AI Chat AI Image Generator AI Video Text to Speech

The Optimal Sample Complexity of PAC Learning

07/02/2015

∙

by Steve Hanneke, et al.

∙

∙

This work establishes a new upper bound on the number of samples sufficient for PAC learning in the realizable case. The bound matches known lower bounds up to numerical constant factors. This solves a long-standing open problem on the sample complexity of PAC learning. The technique and analysis build on a recent breakthrough by Hans Simon.

page 1

page 2

page 3

page 4

research

∙ 07/22/2023

The Sample Complexity of Multi-Distribution Learning for VC Classes

Multi-distribution learning is a natural generalization of PAC learning ...

0 Pranjal Awasthi, et al. ∙

research

∙ 05/24/2020

Proper Learning, Helly Number, and an Optimal SVM Bound

The classical PAC sample complexity bounds are stated for any Empirical ...

0 Olivier Bousquet, et al. ∙

research

∙ 05/22/2018

Improved Algorithms for Collaborative PAC Learning

We study a recent model of collaborative PAC learning where k players wi...

0 Huy L. Nguyen, et al. ∙

research

∙ 02/26/2020

Decidability of Sample Complexity of PAC Learning in finite setting

In this short note we observe that the sample complexity of PAC machine ...

0 Alberto Gandolfi, et al. ∙

research

∙ 01/05/2023

Optimal lower bounds for Quantum Learning via Information Theory

Although a concept class may be learnt more efficiently using quantum sa...

0 Shima Bab Hadiashar, et al. ∙

research

∙ 12/05/2022

Bagging is an Optimal PAC Learner

Determining the optimal sample complexity of PAC learning in the realiza...

0 Kasper Green Larsen, et al. ∙

research

∙ 04/19/2014

Tight bounds for learning a mixture of two gaussians

We consider the problem of identifying the parameters of an unknown mixt...

0 Moritz Hardt, et al. ∙