Metraipolis › archive › dc_e7df112f8362
A Sharp Dynamic Haussler Lemma — arXiv:2610.29898
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.29898
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:28:37.055Z
- SHA-256 of the archived text
195b215249fc90d960d5d172c8b9213fc1cddcba237d3c5f3bd79e1b63aa6b14- Stable URL of this page
https://metraipolis.com/documento/dc_e7df112f8362
How to cite
A Sharp Dynamic Haussler Lemma — arXiv:2610.29898 — arXiv (en), https://arxiv.org/abs/2610.29898 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e7df112f8362 (Metraipolis archive dc_e7df112f8362, sha256 195b215249fc90d960d5d172c8b9213fc1cddcba237d3c5f3bd79e1b63aa6b14)
BibTeX
@misc{dce7df112f8362,
title = {A Sharp Dynamic Haussler Lemma — arXiv:2610.29898},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.29898},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e7df112f8362; sha256 195b215249fc90d960d5d172c8b9213fc1cddcba237d3c5f3bd79e1b63aa6b14},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.29898. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Haussler's covering lemma (JCTA 1995) gives the sharp $(C/\delta)^d$ metric-entropy bound for binary VC classes under normalized $\ell_1$ distance. We prove a sharp global dynamic analogue for bounded real-valued classes in normalized $\ell_p$, for every $1\le p<\infty$. Writing $d=\operatorname{sfat}_{\varepsilon/32}(\mathcal F)$, we obtain a global dynamic cover of size at most $(C/\varepsilon^p)^d$ for every horizon and $0<\varepsilon<1/2$. Here a single family of deterministic causal experts, fixed independently of the instance sequence, covers every target on every sequence. For $0<\varepsilon<1/4$, a matching worst-case lower bound $(c/\varepsilon)^{pd}$ holds already for binary classes on one fixed sequence, even with real-valued experts. The constants are universal, independent of $p$. For $p=2$, this resolves the horizon-independent sequential $\ell_2$ covering problem of Rakhlin, Sridharan, and Tewari (PTRF 2015) in a stronger global form. For $p=1$, it gives the sharp $(C/\delta)^{\operatorname{Ldim}(\mathcal H)}$ global dynamic covering bound for binary classes, resolving questions of Alon, Ben-Eliezer, Dagan, Moran, Naor, and Yogev (STOC 2021) and Malliaris and Moran (Trans. AMS 2024). Our proof combines rank-decreasing correction schedules and accurate sampled prefixes with exact continuations after target identification. Shared-parent routing distributes these continuations among eligible prefixes, eliminating the logarithmic overhead.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Data Structures and Algorithms (cs.DS); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.29898 — 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-05T18:18:34.002Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).