A Rate Separation for Agnostic Direct Sums
Mihir More, Aritra Das, Debayan Gupta
Abstract
Hanneke, Moran, and Waknine HannekeMoranWaknine2024 asked how the agnostic PAC learning curve of the direct sum Cr depends on the single-instance learning curve (n C) and on r. We show that the single-instance learning rate does not determine the direct-sum rate. Let be the class of the two constant binary functions and let consist of the zero function and the identity function. Both classes have agnostic learning curve of order n-1/2.
Create a lesson
Related papers
How Model Growth, Recursion, and Boundary Operators Influence Scaling Exponents
Zixi Chen, Akshay Vegesna, Samip Dahal et al.
Evidence-Grounded Agentic Formulation Development in an Autonomous Laboratory
Michael M. Craig, Riley J. Hickman, Yingshan Ma et al.
Probabilistic Linear Explanations
Frederic Koriche, Jean-Marie Lagniez, Chi Tran
Double descent is the principle of least action
Congzhou M Sha
RLLBC-Lib: An Educational Code Library for Reinforcement Learning and Learning-Based Control
Bernd Frauenknecht, Emma Cramer, Artur Eisele et al.
Higher-order pruning of experts in mixture-of-experts language models
Alex M. Tseng, Prannay Kaul, Luca Zancato et al.