← Keywords

sample complexity

1158 papers

Explore in graph

Co-occurring keywords

reinforcement learning (4122) pac learning (280) multi-armed bandit (1091) markov decision process (788) learning theory (518) differential privacy (1010) stochastic optimization (1060) neural network (6616) active learning (1295) regret bound (1918)

Papers

Model-Based Reinforcement Learning for Infinite-Horizon Discounted Constrained Markov Decision Processes IJCAI 2021
Near-Optimal Offline Reinforcement Learning via Double Variance Reduction NIPS 2021
An Exponential Lower Bound for Linearly Realizable MDP with Constant Suboptimality Gap NIPS 2021
Closing the Gap: Tighter Analysis of Alternating Stochastic Gradient Methods for Bilevel Problems NIPS 2021
Statistically and Computationally Efficient Linear Meta-representation Learning NIPS 2021
Divergence Frontiers for Generative Models: Sample Complexity, Quantization Effects, and Frontier Integrals NIPS 2021
Sample Efficient Decentralized Stochastic Frank-Wolfe Methods for Continuous DR-Submodular Maximization IJCAI 2021
Minimax sample complexity for turn-based stochastic game UAI 2021
Variance-dependent best arm identification UAI 2021
Towards Instance-Optimal Offline Reinforcement Learning with Pessimism NIPS 2021
Discrete-Valued Latent Preference Matrix Estimation with Graph Side Information ICML 2021
Sample Efficient Reinforcement Learning In Continuous State Spaces: A Perspective Beyond Linearity ICML 2021
Smooth Convex Optimization Using Sub-Zeroth-Order Oracles AAAI 2021
SGD: The Role of Implicit Regularization, Batch-size and Multiple-epochs NIPS 2021
Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Sparse Neural Networks NIPS 2021
Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates NIPS 2021
Robust Learning of Optimal Auctions NIPS 2021
Learning Complexity of Simulated Annealing AISTATS 2021
Sample Complexity of Policy Gradient Finding Second-Order Stationary Points AAAI 2021
Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priors NIPS 2021
Communication-Aware Collaborative Learning AAAI 2021
Exponential Separation between Two Learning Models and Adversarial Robustness NIPS 2021
STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning NIPS 2021
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond NIPS 2021
Towards Sample-efficient Overparameterized Meta-learning NIPS 2021