77 search results - page 10 / 16 » Sample Size Lower Bounds in PAC Learning by Algorithmic Comp... |
COLT
2010
Springer
13 years 5 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
EWRL
2008
13 years 9 months ago
2008
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
SIGMETRICS
2005
ACM
14 years 1 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...