← Keywords

learning theory

518 papers

Explore in graph

Co-occurring keywords

generalization bound (649) sample complexity (1158) statistical learning (350) neural network (6616) online learning (1770) gradient descent (1143) stochastic gradient descent (1088) empirical risk minimization (348) convergence rate (606) pac learning (280)

Papers

Tikhonov Regularization is Optimal Transport Robust under Martingale Constraints NIPS 2022
On Leave-One-Out Conditional Mutual Information For Generalization NIPS 2022
Phase transitions in when feedback is useful NIPS 2022
On the Generalization Power of the Overfitted Three-Layer Neural Tangent Kernel Model NIPS 2022
Lower Bounds on the Total Variation Distance Between Mixtures of Two Gaussians ALT 2022
Domain Generalization by Marginal Transfer Learning JMLR 2021
Practical, Provably-Correct Interactive Learning in the Realizable Setting: The Power of True Believers NIPS 2021
The Pareto Frontier of model selection for general Contextual Bandits NIPS 2021
Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstruction NIPS 2021
Understanding the Generalization Benefit of Model Invariance from a Data Perspective NIPS 2021
Robust Learning under Strong Noise via SQs AISTATS 2021
Identification of the Generalized Condorcet Winner in Multi-dueling Bandits NIPS 2021
Limitations of Post-Hoc Feature Alignment for Robustness CVPR 2021
An Exponential Improvement on the Memorization Capacity of Deep Threshold Networks NIPS 2021
On the Cryptographic Hardness of Learning Single Periodic Neurons NIPS 2021
RATT: Leveraging Unlabeled Data to Guarantee Generalization ICML 2021
Littlestone Classes are Privately Online Learnable NIPS 2021
On the number of linear functions composing deep neural network: Towards a refined definition of neural networks complexity AISTATS 2021
Prediction with Finitely many Errors Almost Surely AISTATS 2021
Bandit algorithms: Letting go of logarithmic regret for statistical robustness AISTATS 2021
Sample Complexity of Robust Linear Classification on Separated Data ICML 2021
Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries ICML 2021
Provably Efficient Reinforcement Learning for Discounted MDPs with Feature Mapping ICML 2021
Generalization in Portfolio-Based Algorithm Selection AAAI 2021
Learning and testing junta distributions with sub cube conditioning COLT 2021