Near-Optimal Sample Complexity of Deterministic Agnostic PAC Learning
stat.ML, cs.LG
Submitted: 2026-11-09
Updated: 2026-11-09
Terminology
Sources
- Contextual Bandits and Optimistically Universal Learning
- Trade-offs in Data Memorization via Strong Data Processing Inequalities
- Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes
- Understanding deep learning requires rethinking generalization
Related papers
- Uniform-in-Time Weak Propagation-of-Chaos in Shallow Neural Networks
- Diffusion Models Observe Only Gradients: A Geometric Perspective on Score Matching Errors
- Quantifying Error Propagation and Model Collapse in Diffusion Models
- Behavior of prediction performance metrics with rare events
- Statistical Inference and Learning for Shapley Additive Explanations (SHAP)
- Control Variate Design for Score-Function Gradient Estimators in Importance-Weighted Variational Inference