Metraipolis › archive › dc_ab10cee6f0ed
Empirical approximation of $L_p$ norms for $p\in (2, \infty)$ — arXiv:2611.08896
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08896
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:43:17.639Z
- SHA-256 of the archived text
7f4dc8b7ebeb8debe0a705e43a796dfdf9ca742a4111dd9f03d01519a42e988b- Stable URL of this page
https://metraipolis.com/documento/dc_ab10cee6f0ed
How to cite
Empirical approximation of $L_p$ norms for $p\in (2, \infty)$ — arXiv:2611.08896 — arXiv (en), https://arxiv.org/abs/2611.08896 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ab10cee6f0ed (Metraipolis archive dc_ab10cee6f0ed, sha256 7f4dc8b7ebeb8debe0a705e43a796dfdf9ca742a4111dd9f03d01519a42e988b)
BibTeX
@misc{dcab10cee6f0ed,
title = {Empirical approximation of $L_p$ norms for $pin (2, infty)$ — arXiv:2611.08896},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08896},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ab10cee6f0ed; sha256 7f4dc8b7ebeb8debe0a705e43a796dfdf9ca742a4111dd9f03d01519a42e988b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08896. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For $p>2$ and an $N$-dimensional subspace $X\subset L_\infty(\mu)$ satisfying \[ \|f\|_\infty\le (KN)^{1/p}\|f\|_{L_p(\mu)} \quad\forall f\in X, \] we show that $m\ge C(p)KN \bigl(\varepsilon^{-p} +\varepsilon^{-2}\log_2(2N)\bigr)$ independent samples $\xi^1,\ldots,\xi^m$ with distribution $\mu$ satisfy \[ (1-\varepsilon)\|f\|_{L_p(\mu)}^p \le\frac1m\sum_{j=1}^m|f(\xi^j)|^p \le(1+\varepsilon)\|f\|_{L_p(\mu)}^p \quad\forall f\in X \] with probability at least $1-\exp(-c(p)\frac{m\varepsilon^2}{KN})$. This gives the optimal sample-size order $N\log_2 N$ for independent random sampling with fixed $K$, $p$, and $\varepsilon$. This result follows from a more general empirical moment estimate over unit balls of $p$-convex norms.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Functional Analysis (math.FA) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.08896 — 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-11-09T22:36:02.261Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).