activity
20192026
most citedOne Step of Gradient Descent is Provably the Optimal In-Context Learner with One Layer of Linear Self-Attention

2 citations · 4 across the 6 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

cs.DS2022

Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions

Arvind V. Mahankali, David P. Woodruff, Ziyu Zhang

We study low rank approximation of tensors, focusing on the tensor train and Tucker decompositions, as well as approximations with tree tensor networks and more general tensor netw…