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

Learning Theory

5,312 papers

Papers per year

Papers

On the Minimal Error of Empirical Risk Minimization COLT 2021
Optimal prediction of Markov chains with and without spectral gap NIPS 2021
Uniform-PAC Bounds for Reinforcement Learning with Linear Function Approximation NIPS 2021
Towards Tight Bounds on the Sample Complexity of Average-reward MDPs ICML 2021
A Provably Efficient Sample Collection Strategy for Reinforcement Learning NIPS 2021
Wasserstein Flow Meets Replicator Dynamics: A Mean-Field Analysis of Representation Learning in Actor-Critic NIPS 2021
Bandit algorithms: Letting go of logarithmic regret for statistical robustness AISTATS 2021
Shift Invariance Can Reduce Adversarial Robustness NIPS 2021
Sharper Generalization Bounds for Clustering ICML 2021
DuReader_robust: A Chinese Dataset Towards Evaluating Robustness and Generalization of Machine Reading Comprehension in Real-World Applications IJCNLP 2021
Causal Analysis of Syntactic Agreement Mechanisms in Neural Language Models IJCNLP 2021
Power of Hints for Online Learning with Movement Costs AISTATS 2021
Best-case lower bounds in online learning NIPS 2021
Stability and Generalization of Stochastic Gradient Methods for Minimax Problems ICML 2021
Improved Learning Rates of a Functional Lasso-type SVM with Sparse Multi-Kernel Representation NIPS 2021
Improved Corruption Robust Algorithms for Episodic Reinforcement Learning ICML 2021
Robust Density Estimation from Batches: The Best Things in Life are (Nearly) Free ICML 2021
An Exact Characterization of the Generalization Error for the Gibbs Algorithm NIPS 2021
Adapting to Delays and Data in Adversarial Multi-Armed Bandits ICML 2021
Modeling Risky Choices in Unknown Environments ACML 2021
Towards Lower Bounds on the Depth of ReLU Neural Networks NIPS 2021
Non-stationary Reinforcement Learning without Prior Knowledge: an Optimal Black-box Approach COLT 2021
Adaptive estimation of nonparametric functionals JMLR 2021
Sharp Analysis of a Simple Model for Random Forests AISTATS 2021
Tractable contextual bandits beyond realizability AISTATS 2021