no code implementations • 8 Feb 2024 • Jay Mardia, Kabir Aladin Verchand, Alexander S. Wein
Using (a bound on) the conditional low-degree likelihood ratio as a potential function, we show that for every non-adaptive query pattern, there is a highly structured query pattern of the same size that is at least as effective.
no code implementations • 2 Feb 2024 • Mengqi Lou, Kabir Aladin Verchand, Ashwin Pananjady
Motivated by the desire to understand stochastic algorithms for nonconvex optimization that are robust to their hyperparameter choices, we analyze a mini-batched prox-linear iterative algorithm for the problem of recovering an unknown rank-1 matrix from rank-1 Gaussian measurements corrupted by noise.
