paper-with-me

홈 › Papers

Null Measurability at the Symmetrization Interface in VC Learning

2026-04-27 · Dhruv Gupta arxiv

Recent work revisiting measurability in the fundamental theorem of statistical learning imposes Borel measurability of ghost-gap suprema. We show that, at the one-sided ghost-gap interface actually used by the standard symmetrization proof, this requirement is stronger than necessary. For any Borel-parameterized concept class on a Polish domain, the bad event "there exists a hypothesis whose ghost empirical error exceeds its training empirical error by at least ε/2" is analytic. By Choquet capacitability, it is therefore measurable in the completion of every finite Borel measure. We then construct a concept class whose bad event is null-measurable but not Borel, giving a strict separation from the Borel supremum condition. Finally, we prove closure under patching, fixed and countable interpolation, and fiber-product amalgamation, showing that the weaker regularity level is stable under natural concept-class constructors. In the realizable setting, where targets belong to the class and are measurable, these results weaken the measurability hypothesis needed by the symmetrization route from finite VC dimension to PAC learnability. The main results and the descriptive-set-theoretic infrastructure used by them are formalized in Lean 4.

📄 PDF Abstract BibTeX arXiv:2604.25028

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Symmetrizing Bregman Divergence on the Cone of Positive Definite Matrices: Which Mean to Use and Why

2026-03-30 · Tushar Sial, Abhishek Halder arxiv

This work uncovers variational principles behind symmetrizing the Bregman divergences induced by generic mirror maps over the cone of positive definite matrices. We show that computing the canonical means for this symmet…

Measurability in the Fundamental Theorem of Statistical Learning

2024-10-14 · Lothar Sebastian Krapp, Laura Wirth

The Fundamental Theorem of Statistical Learning states that a hypothesis space is PAC learnable if and only if its VC dimension is finite. For the agnostic model of PAC learning, the literature so far presents proofs of …

Binary ClassificationPAC learning

Verification of ML Systems via Reparameterization

2020-07-14 · Jean-Baptiste Tristan, Joseph Tassarotti, Koundinya Vajjha, Michael L. Wick 외

As machine learning is increasingly used in essential systems, it is important to reduce or eliminate the incidence of serious bugs. A growing body of research has developed machine learning algorithms with formal guaran…

BIG-bench Machine LearningFairnessLearning Theory

On a generalization of the Jensen-Shannon divergence and the JS-symmetrization of distances relying on abstract means

2019-04-08 · Frank Nielsen

The Jensen-Shannon divergence is a renown bounded symmetrization of the unbounded Kullback-Leibler divergence which measures the total Kullback-Leibler divergence to the average mixture distribution. However the Jensen-S…

ClusteringForm

An Empirical Study of Diversity of Word Alignment and its Symmetrization Techniques for System Combination

2015-12-01 · WS 2015 12 · Thoudam Doren Singh
DiversityMachine TranslationMultiobjective OptimizationWord Alignment