<--- Back to Details
First PageDocument Content
Reduction / Structural complexity theory / Probably approximately correct learning / Big O notation / Theoretical computer science / Applied mathematics / Computational complexity theory
Date: 2012-06-07 13:20:18
Reduction
Structural complexity theory
Probably approximately correct learning
Big O notation
Theoretical computer science
Applied mathematics
Computational complexity theory

PAC Subset Selection in Stochastic Multi-armed Bandits

Add to Reading List

Source URL: icml.cc

Download Document from Source Website

File Size: 227,37 KB

Share Document on Facebook

Similar Documents