Metraipolis › archive › dc_aa152fae23ad
A Proof of the Convergence a Lipschitz Upper Confidence Bound — arXiv:2608.03081
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.03081
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:53:59.110Z
- SHA-256 of the archived text
72d1dcfac1b610fb9b30afb9db4d93c0f7de25174918ca370a26d527200e1020- Stable URL of this page
https://metraipolis.com/documento/dc_aa152fae23ad
How to cite
A Proof of the Convergence a Lipschitz Upper Confidence Bound — arXiv:2608.03081 — arXiv (en), https://arxiv.org/abs/2608.03081 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aa152fae23ad (Metraipolis archive dc_aa152fae23ad, sha256 72d1dcfac1b610fb9b30afb9db4d93c0f7de25174918ca370a26d527200e1020)
BibTeX
@misc{dcaa152fae23ad,
title = {A Proof of the Convergence a Lipschitz Upper Confidence Bound — arXiv:2608.03081},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.03081},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aa152fae23ad; sha256 72d1dcfac1b610fb9b30afb9db4d93c0f7de25174918ca370a26d527200e1020},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03081. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This document presents a proof of the estimation of a lipschitz parameter by constructing a consistent lower confidence bound through hypothesis test inversion. We prove that as the number of design points grows to infinity, the test correctly identifies any underestimated Lipschitz constant with asymptotic probability 1. The convergence proofs rely on a Uniform Law of Large Numbers and analyze discrepancy metrics under both bounded and unbounded replication sampling. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-05 in math.ST). Categorie arXiv: Statistics Theory (math.ST). Pagina del lavoro: https://arxiv.org/abs/2608.03081 — 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-31T12:41:37.330Z dalla pagina https://arxiv.org/catchup/math.ST/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).