no code implementations • 16 Mar 2024 • Steve Hanneke, Shay Moran, Tom Waknine
In classical PAC learning, both uniform convergence and sample compression satisfy a form of `completeness': whenever a class is learnable, it can also be learned by a learning rule that adheres to these principles.