← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation NIPS 2024
Oracle-Efficient Hybrid Online Learning with Unknown Distribution COLT 2024
Modeling probabilistic reduction across domains with Naive Discriminative Learning INTERSPEECH 2024
On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games NIPS 2024
Open Problem: Can Local Regularization Learn All Multiclass Problems? COLT 2024
Reconstructing the Geometry of Random Geometric Graphs (Extended Abstract) COLT 2024
The Limits of Differential Privacy in Online Learning NIPS 2024
Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs AISTATS 2024
Do Androids Know They’re Only Dreaming of Electric Sheep? ACL 2024
On the Vulnerability of Fairness Constrained Learning to Malicious Noise AISTATS 2024
On the Necessity of Collaboration for Online Model Selection with Decentralized Data NIPS 2024
Certified private data release for sparse Lipschitz functions AISTATS 2024
Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise NIPS 2024
Learning-Based Algorithms for Graph Searching Problems AISTATS 2024
How Does Variance Shape the Regret in Contextual Bandits? NIPS 2024
Provable Advantage in Quantum PAC Learning COLT 2024
Large Stepsize Gradient Descent for Non-Homogeneous Two-Layer Networks: Margin Improvement and Fast Optimization NIPS 2024
Pruning is Optimal for Learning Sparse Features in High-Dimensions COLT 2024
Non-asymptotic Convergence of Training Transformers for Next-token Prediction NIPS 2024
Testing exchangeability by pairwise betting AISTATS 2024
Rethinking Propagation for Unsupervised Graph Domain Adaptation AAAI 2024
Provable Policy Gradient Methods for Average-Reward Markov Potential Games AISTATS 2024
Low-rank MDPs with Continuous Action Spaces AISTATS 2024
Understanding Emergent Abilities of Language Models from the Loss Perspective NIPS 2024
Replicability in Learning: Geometric Partitions and KKM-Sperner Lemma NIPS 2024