On Complexity of Gaussian Sampling
We study the number of exact matrix-vector queries needed to sample a centered $d$-dimensional Gaussian with condition number at most $\kappa$ to total variation error $\varepsilon$. The best known algorithm uses $O(\min\{d,\sqrt{\kappa}\log(\frac{d}{\varepsilon})\})$ queries, while the known lower bounds do not grow a...