Newest papers

A Sharp Dynamic Haussler Lemma

S. Shao, Dacheng Tao · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.29898 · cited by 0 works (OpenAlex) · open-access PDF

French

La couverture des cibles de Haussoperis corrélée avec les valeurs de référence (JCTA 1995) donne la couverture métrique aiguë de $(C/δ)^d$ pour les classes de VC binaires exactes sous la distance normalisée de $\ell_1$. Nous prouvons une couverture dynamique globale aiguë pour les classes de référence à la taille maximale de $(C/\varepsilon^p)^d$ pour chaque horizon préliminaire fixé à $1 et $0 pour l'horizontale malhonnête et $0 pour l'horizontale infinie. En écrivant ici une seule famille d'experts déterministes causalistes, fixe indépendamment de la séquence d'instance, notre log log log continu Y couvre chaque

Machine translation (Meta M2M100); the English original follows.

Abstract

Haussler's covering lemma (JCTA 1995) gives the sharp $(C/δ)^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/δ)^{\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.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Mathematics, Bounded function, Upper and lower bounds, Combinatorics, Discrete mathematics, Lemma (botany)

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange