conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Sample Complexity

99 papers

Papers per year

2
2
14
4
'10
'15
'20
'25

Papers

Characterizing the Sample Complexity of Pure Private Learners JMLR 2019
On Oracle-Efficient PAC RL with Rich Observations NIPS 2018
Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes NIPS 2018
Query Complexity of Bayesian Private Learning NIPS 2018
Data Amplification: A Unified and Competitive Approach to Property Estimation NIPS 2018
Learning without the Phase: Regularized PhaseMax Achieves Optimal Sample Complexity NIPS 2018
Tight Bounds for Collaborative PAC Learning via Multiplicative Weights NIPS 2018
Phase Transitions in the Pooled Data Problem NIPS 2017
A Sample Complexity Measure with Applications to Learning Optimal Auctions NIPS 2017
Optimal Sample Complexity of M-wise Data for Top-K Ranking NIPS 2017
Dimension-Free Iteration Complexity of Finite Sum Optimization Problems NIPS 2016
Finite-Sample Analysis of Fixed-k Nearest Neighbor Density Functional Estimators NIPS 2016
Adaptive Concentration Inequalities for Sequential Decision Problems NIPS 2016
The Power of Adaptivity in Identifying Statistical Alternatives NIPS 2016
Sample Complexity of Learning Mahalanobis Distance Metrics NIPS 2015
On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs NIPS 2015
Time--Data Tradeoffs by Aggressive Smoothing NIPS 2014
More data speeds up training time in learning halfspaces over sparse vectors NIPS 2013
Dimensionality Dependent PAC-Bayes Margin Bound NIPS 2012
Multi-View Active Learning in the Non-Realizable Case NIPS 2010
Tight Sample Complexity of Large-Margin Learning NIPS 2010
Rademacher Complexity Bounds for Non-I.I.D. Processes NIPS 2008
Risk Bounds for Randomized Sample Compressed Classifiers NIPS 2008
Sample Complexity of Policy Search with Known Dynamics NIPS 2006