← 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

Local policy search with Bayesian optimization NIPS 2021
Combinatorial Pure Exploration with Bottleneck Reward Function NIPS 2021
Closing the Gap: Tighter Analysis of Alternating Stochastic Gradient Methods for Bilevel Problems NIPS 2021
Navigating to the Best Policy in Markov Decision Processes NIPS 2021
Policy Finetuning: Bridging Sample-Efficient Offline and Online Reinforcement Learning NIPS 2021
Faster Matchings via Learned Duals NIPS 2021
Sample Complexity Bounds for Active Ranking from Multi-wise Comparisons NIPS 2021
Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification NIPS 2021
Fast Pure Exploration via Frank-Wolfe NIPS 2021
Taming Communication and Sample Complexities in Decentralized Policy Evaluation for Cooperative Multi-Agent Reinforcement Learning NIPS 2021
Exponential Separation between Two Learning Models and Adversarial Robustness NIPS 2021
Divergence Frontiers for Generative Models: Sample Complexity, Quantization Effects, and Frontier Integrals NIPS 2021
Statistically and Computationally Efficient Linear Meta-representation Learning NIPS 2021
Tighter Expected Generalization Error Bounds via Wasserstein Distance NIPS 2021
On the Bias-Variance-Cost Tradeoff of Stochastic Optimization NIPS 2021
Multiclass versus Binary Differentially Private PAC Learning NIPS 2021
Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model NIPS 2021
Provable Model-based Nonlinear Bandit and Reinforcement Learning: Shelve Optimism, Embrace Virtual Curvature NIPS 2021
Teaching via Best-Case Counterexamples in the Learning-with-Equivalence-Queries Paradigm NIPS 2021
Aggregating Incomplete and Noisy Rankings AISTATS 2021
On the Sample Complexity of Privately Learning Unbounded High-Dimensional Gaussians ALT 2021
Testing Product Distributions: A Closer Look ALT 2021
Learning and Testing Irreducible Markov Chains via the $k$-Cover Time ALT 2021
Estimating Smooth GLM in Non-interactive Local Differential Privacy Model with Public Unlabeled Data ALT 2021
Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model ALT 2021