Algorithmic Principles For Multiclass Learning Are Hard To Come By: Limits of Regularization and Proper Learning
cs.LG, stat.ML
Submitted: 2026-08-27
Updated: 2026-08-27
Terminology
Sources
- An Optimal Sauer Lemma Over $k$-ary Alphabets
- Local Regularization Does Not Characterize Multiclass PAC Learnability
- The Optimal Sample Complexity of Multiclass and List Learning
- Majority-of-Three is Optimal
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks