← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

Horizon-Free and Variance-Dependent Reinforcement Learning for Latent Markov Decision Processes ICML 2023
Unveiling The Mask of Position-Information Pattern Through the Mist of Image Features ICML 2023
Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs ICML 2023
When is Realizability Sufficient for Off-Policy Reinforcement Learning? ICML 2023
Polarity Is All You Need to Learn and Transfer Faster ICML 2023
On the Power of Pre-training for Generalization in RL: Provable Benefits and Hardness ICML 2023
Near-Minimax-Optimal Risk-Sensitive Reinforcement Learning with CVaR ICML 2023
The Value of Out-of-Distribution Data ICML 2023
PAC-Bayesian Offline Contextual Bandits With Guarantees ICML 2023
Off-Policy Evaluation for Large Action Spaces via Conjunct Effect Modeling ICML 2023
Contextual Reliability: When Different Features Matter in Different Contexts ICML 2023
Towards Theoretical Understanding of Inverse Reinforcement Learning ICML 2023
Fundamental Tradeoffs in Learning with Prior Information ICML 2023
Benign Overfitting in Two-layer ReLU Convolutional Neural Networks ICML 2023
What can online reinforcement learning with function approximation benefit from general coverage conditions? ICML 2023
Horizon-free Learning for Markov Decision Processes and Games: Stochastically Bounded Rewards and Improved Bounds ICML 2023
Understanding Backdoor Attacks through the Adaptability Hypothesis ICML 2023
Reward-Mixing MDPs with Few Latent Contexts are Learnable ICML 2023
The Impact of Exploration on Convergence and Performance of Multi-Agent Q-Learning Dynamics ICML 2023
Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes ICML 2023
Non-stationary Reinforcement Learning under General Function Approximation ICML 2023
Stochastic Policy Gradient Methods: Improved Sample Complexity for Fisher-non-degenerate Policies ICML 2023
Does Sparsity Help in Learning Misspecified Linear Bandits? ICML 2023
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path ICML 2023
Refined Regret for Adversarial MDPs with Linear Function Approximation ICML 2023