Do PAC-Learners Learn the Marginal Distribution?
Max Hopkins, Daniel M. Kane, Shachar Lovett, Gaurav Mahajan

TL;DR
This paper explores the relationship between PAC learning, uniform convergence, and density estimation when the distribution is restricted to a known family, revealing refined connections beyond the classical distribution-free setting.
Contribution
It establishes that PAC learning remains closely linked to density estimation under distributional restrictions, with new equivalences and bounds that extend the Fundamental Theorem.
Findings
PAC learning is between two refined density estimation models.
Density estimation is equivalent to uniform estimation under certain conditions.
The classical Fundamental Theorem does not hold in the distribution-restricted setting.
Abstract
The Fundamental Theorem of PAC Learning asserts that learnability of a concept class is equivalent to the of empirical error in to its mean, or equivalently, to the problem of , learnability of the underlying marginal distribution with respect to events in . This seminal equivalence relies strongly on PAC learning's `distribution-free' assumption, that the adversary may choose any marginal distribution over data. Unfortunately, the distribution-free model is known to be overly adversarial in practice, failing to predict the success of modern machine learning algorithms, but without the Fundamental Theorem our theoretical understanding of learning under distributional constraints remains highly limited. In this work, we revisit the connection between PAC learning, uniform convergence, and density estimation beyond…
Peer Reviews
Decision·ALT 2025
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Domain Adaptation and Few-Shot Learning · Statistical Methods and Inference
