← 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

Learning Determinantal Point Processes with Moments and Cycles ICML 2017
Collect at Once, Use Effectively: Making Non-interactive Locally Private Learning Possible ICML 2017
Preference-based Teaching of Unions of Geometric Objects ALT 2017
Collaborative Clustering: Sample Complexity and Efficient Algorithms ALT 2017
Structured Best Arm Identification with Fixed Confidence ALT 2017
Learning from Networked Examples ALT 2017
Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues NIPS 2017
A Sample Complexity Measure with Applications to Learning Optimal Auctions NIPS 2017
Monte-Carlo Tree Search by Best Arm Identification NIPS 2017
Adaptive Active Hypothesis Testing under Limited Information NIPS 2017
Collaborative PAC Learning NIPS 2017
Rank Aggregation and Prediction with Item Features AISTATS 2017
Learning Graphical Games from Behavioral Data: Sufficient and Necessary Conditions AISTATS 2017
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection AISTATS 2017
Mixing Implies Lower Bounds for Space Bounded Learning COLT 2017
Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems COLT 2017
Learning from Conditional Distributions via Dual Embeddings AISTATS 2017
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration COLT 2017
Towards Instance Optimal Bounds for Best Arm Identification COLT 2017
Learning a Ground Truth Ranking Using Noisy Approval Votes IJCAI 2017
Learning Low-Dimensional Metrics NIPS 2017
Noisy Tensor Completion via the Sum-of-Squares Hierarchy COLT 2016
Accurate Robust and Efficient Error Estimation for Decision Trees ICML 2016
Multi-step learning and underlying structure in statistical models NIPS 2016
Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja’s Algorithm COLT 2016