Re:A basic introduction to NumPy's einsum
by dgasmith on Saturday April 09, 2022 @08:34PM
(#30973445)
The looped matrix multiply that you show is very hard to optimize for in the general case of einsum. Often the looped GEMM is found permuted such as `kbi,kjb->bij`. In this case, heuristics are needed to determine if GEMM is worth it due to unaligned memory copies.
`optimize=True` is generally best when there are more than two tensors in the expression.
Re:A basic introduction to NumPy's einsum
by cschmid on Saturday April 09, 2022 @08:20PM
(#30973386)
I just tried replicating the same experiment using Jax's numpy API, and einsum is still slower, but at least the same order of magnitude:
%timeit (x_jax @ y_jax).block_until_ready()
579 µs ± 4.54 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
%timeit jnp.einsum('bik,bkj->bij',x_jax,y_jax, optimize=True).block_until_ready()
658 µs ± 1.38 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
%timeit jnp.einsum('bik,bkj->bij',x_jax,y_jax).block_until_ready()
660 µs ± 2.82 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
The optimizer clearly tries to improve the performance, but in many cases, it doesn't seem to change anything. Let's simply multiply some matrices:
I can do or a naive But even with optimization, I see I'm not sure if I'm doing something wrong.