Sample Complexity
282 papers
Papers per year
1
2
4
3
4
2
5
5
4
11
5
3
6
10
26
26
27
33
48
28
29
'10
'15
'20
'25
Papers
Algorithms for Infinitely Many-Armed Bandits
NeurIPS 2008
Near-optimal Regret Bounds for Reinforcement Learning
NeurIPS 2008
Rademacher Complexity Bounds for Non-I.I.D. Processes
NeurIPS 2008
Risk Bounds for Randomized Sample Compressed Classifiers
NeurIPS 2008
A general agnostic active learning algorithm
NeurIPS 2007
The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information
NeurIPS 2007
Sample Complexity of Policy Search with Known Dynamics
NeurIPS 2006