← 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

Exploring $k$ out of Top $ρ$ Fraction of Arms in Stochastic Bandits AISTATS 2019
Learning Rules-First Classifiers AISTATS 2019
PAC Learnability of Node Functions in Networked Dynamical Systems ICML 2019
Optimality Implies Kernel Sum Classifiers are Statistically Efficient ICML 2019
Characterizing the Sample Complexity of Pure Private Learners JMLR 2019
The information-theoretic value of unlabeled data in semi-supervised learning ICML 2019
Learning Unfaithful $K$-separable Gaussian Graphical Models JMLR 2019
Simultaneous Private Learning of Multiple Concepts JMLR 2019
The Gap Between Model-Based and Model-Free Methods on the Linear Quadratic Regulator: An Asymptotic Viewpoint COLT 2019
Best Arm Identification for Contaminated Bandits JMLR 2019
Model-based RL in Contextual Decision Processes: PAC bounds and Exponential Improvements over Model-free Approaches COLT 2019
Quantifying Learning Guarantees for Convex but Inconsistent Surrogates NIPS 2018
Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes NIPS 2018
Learning from Group Comparisons: Exploiting Higher Order Interactions NIPS 2018
Chaining Mutual Information and Tightening Generalization Bounds NIPS 2018
PAC-learning in the presence of adversaries NIPS 2018
Learning Compact Neural Networks with Regularization ICML 2018
Entropy Rate Estimation for Markov Chains with Large State Space NIPS 2018
Towards Black-box Iterative Machine Teaching ICML 2018
Learning linear structural equation models in polynomial time and sample complexity AISTATS 2018
Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications IJCAI 2018
Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow ICML 2018
Fast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms COLT 2018
Model-Agnostic Private Learning NIPS 2018
Sample Efficient Stochastic Gradient Iterative Hard Thresholding Method for Stochastic Sparse Linear Regression with Limited Attribute Observation NIPS 2018