conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5,312 papers

Papers per year

Papers

Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning NIPS 2021
Statistical Query Lower Bounds for List-Decodable Linear Regression NIPS 2021
Bounded-cost Search Using Estimates of Uncertainty IJCAI 2021
Masked Language Modeling and the Distributional Hypothesis: Order Word Matters Pre-training for Little EMNLP 2021
Neural Active Learning with Performance Guarantees NIPS 2021
Bandits with Knapsacks beyond the Worst Case NIPS 2021
Jointly Learning Prices and Product Features IJCAI 2021
Multi-group Agnostic PAC Learnability ICML 2021
A theory of high dimensional regression with arbitrary correlations between input features and target functions: sample complexity, multiple descent curves and a hierarchy of phase transitions ICML 2021
Fast Learning for Renewal Optimization in Online Task Scheduling JMLR 2021
Problem Dependent View on Structured Thresholding Bandit Problems ICML 2021
Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs NIPS 2021
Memorization vs. Generalization : Quantifying Data Leakage in NLP Performance Evaluation EACL 2021
Predicting Deep Neural Network Generalization with Perturbation Response Curves NIPS 2021
Gradient Starvation: A Learning Proclivity in Neural Networks NIPS 2021
Near-Optimal Offline Reinforcement Learning via Double Variance Reduction NIPS 2021
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization NIPS 2021
Separation Results between Fixed-Kernel and Feature-Learning Probability Metrics NIPS 2021
On the Validity of Modeling SGD with Stochastic Differential Equations (SDEs) NIPS 2021
Domain Divergences: A Survey and Empirical Analysis NAACL 2021
Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Sparse Neural Networks NIPS 2021
Agnostic Learning of Halfspaces with Gradient Descent via Soft Margins ICML 2021
Taxonomy Completion via Triplet Matching Network AAAI 2021
How Tight Can PAC-Bayes be in the Small Data Regime? NIPS 2021
How Important is the Train-Validation Split in Meta-Learning? ICML 2021