Metraipolis › archive › dc_652421965396
Convergence Rates for Lasserre's Upper-Bound Hierarchy on $\mathbb{R}^d$ with Gaussian Measure — arXiv:2610.22030
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.22030
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:28:49.171Z
- SHA-256 of the archived text
064062fec8607b7ebcb90b663cd307047403ab2470329bfcc835072625438e38- Stable URL of this page
https://metraipolis.com/documento/dc_652421965396
How to cite
Convergence Rates for Lasserre's Upper-Bound Hierarchy on $\mathbb{R}^d$ with Gaussian Measure — arXiv:2610.22030 — arXiv (en), https://arxiv.org/abs/2610.22030 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_652421965396 (Metraipolis archive dc_652421965396, sha256 064062fec8607b7ebcb90b663cd307047403ab2470329bfcc835072625438e38)
BibTeX
@misc{dc652421965396,
title = {Convergence Rates for Lasserre's Upper-Bound Hierarchy on $mathbbR^d$ with Gaussian Measure — arXiv:2610.22030},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.22030},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_652421965396; sha256 064062fec8607b7ebcb90b663cd307047403ab2470329bfcc835072625438e38},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22030. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We establish quantitative convergence rates for Lasserre's measure-based upper-bound hierarchy on $\mathbb{R}^d$ using the standard Gaussian measure as the reference measure. For any polynomial $f$ attaining its global infimum $f_{\min}$, we prove that the order-$r$ upper bounds satisfy $$ \lambda_r-f_{\min}=O\Big(\frac{1}{r}\Big), $$ yielding, to the best of our knowledge, the first explicit convergence rate for this hierarchy on a noncompact domain. We further show that the rate is sharp by proving an $\Omega(1/r)$ rate for $f=x^2$, while demonstrating that, without attainment of the infimum, convergence can be arbitrarily slow: for every $m\ge0$, we construct a polynomial whose upper bounds converge at rate $\Theta(r^{-1/(m+2)})$.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2610.22030 — 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-16T08:49:47.935Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).