← 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

Spectral Methods for Ranking with Scarce Data UAI 2020
AsyncQVI: Asynchronous-Parallel Q-Value Iteration for Discounted Markov Decision Processes with Near-Optimal Sample Complexity AISTATS 2020
Sample Complexity of Kalman Filtering for Unknown Systems L4DC 2020
Forgetting to Learn Logic Programs AAAI 2020
A Stochastic Derivative-Free Optimization Method with Importance Sampling: Theory and Learning to Control AAAI 2020
Sample Complexity of Reinforcement Learning using Linearly Combined Model Ensembles AISTATS 2020
Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity AISTATS 2020
Learning the model-free linear quadratic regulator via random search L4DC 2020
Periodic Q-Learning L4DC 2020
Learning nonlinear dynamical systems from a single trajectory L4DC 2020
Top-$k$ Combinatorial Bandits with Full-Bandit Feedback ALT 2020
Algebraic and Analytic Approaches for Parameter Learning in Mixture Models ALT 2020
Optimal $δ$-Correct Best-Arm Selection for Heavy-Tailed Distributions ALT 2020
Robust Outlier Arm Identification ICML 2020
Student Specialization in Deep Rectified Networks With Finite Width and Input Dimension ICML 2020
A Sample Complexity Separation between Non-Convex and Convex Meta-Learning ICML 2020
From PAC to Instance-Optimal Sample Complexity in the Plackett-Luce Model ICML 2020
The Sample Complexity of Best-$k$ Items Selection from Pairwise Comparisons ICML 2020
Fixed-confidence guarantees for Bayesian best-arm identification AISTATS 2020
The True Sample Complexity of Identifying Good Arms AISTATS 2020
Learning Gaussian Graphical Models via Multiplicative Weights AISTATS 2020
Formal Limitations on the Measurement of Mutual Information AISTATS 2020
Worst-Case Analysis for Randomly Collected Data NIPS 2020
Proper Learning, Helly Number, and an Optimal SVM Bound COLT 2020
High probability guarantees for stochastic convex optimization COLT 2020