Metraipolis › archive › dc_b7c6345ca648
On Complexity of Gaussian Sampling — arXiv:2610.20492
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.20492
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T14:25:17.358Z
- SHA-256 of the archived text
8a34c6c05eda36f9ac9e245ba63daf2abdfe9bbc5572b90352194e7633007e86- Stable URL of this page
https://metraipolis.com/documento/dc_b7c6345ca648
How to cite
On Complexity of Gaussian Sampling — arXiv:2610.20492 — arXiv (en), https://arxiv.org/abs/2610.20492 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b7c6345ca648 (Metraipolis archive dc_b7c6345ca648, sha256 8a34c6c05eda36f9ac9e245ba63daf2abdfe9bbc5572b90352194e7633007e86)
BibTeX
@misc{dcb7c6345ca648,
title = {On Complexity of Gaussian Sampling — arXiv:2610.20492},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.20492},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b7c6345ca648; sha256 8a34c6c05eda36f9ac9e245ba63daf2abdfe9bbc5572b90352194e7633007e86},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20492. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 as $\varepsilon\to0$ and match this bound only for $\kappa\le d^{1/5-\delta}$ at constant accuracy. We introduce a construction based on a hidden determinant sign and prove a lower bound of $\Omega\!\left(\min\left\{d,\sqrt{\kappa}\log\left(1+\frac{d}{\sqrt{\kappa}\,\varepsilon}\right)\right\}\right)$ uniformly for all $d\ge1$, $\kappa\ge4$, and $0<\varepsilon\le\tfrac{1}{16}$. This bound matches the known upper bound up to constant factors whenever $\kappa\le d^{2-\delta}$ for fixed $\delta\in(0,2)$, or $\varepsilon\le d^{-c}$ for fixed $c>0$. We also extend a recent fixed-spectrum construction with a hidden eigenbasis from $\kappa=2$ to $2\le\kappa\le d^{1-\delta}$, for any fixed $\delta\in(0,1)$. This gives an $\Omega_\delta(\sqrt{\kappa}\log d)$ lower bound at constant accuracy that holds even when the spectrum of the precision matrix is known to the algorithm.
Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.CO, nuovi lavori del giorno).
Categorie arXiv: Computational Complexity (cs.CC) ; Computation (stat.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.20492 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T13:55:05.292Z dalla pagina https://arxiv.org/list/stat.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).