Just wondering, is there any way to leverage the memory efficiency of unfold if I want to do matrix multiplication after? Even though arbitrary strides resulting from unfold can be very memory efficient, it seems that operations like mm and bmm cannot take them in; moreover, einsum and tensordot call mm and bmm (I think they also call contiguous maybe, which bloats memory); moreover, even if all of those were to work, in the backward phase the gradient matrix would be huge anyways…