Sciweavers

180 search results - page 13 / 36
» Improved bounds on the sample complexity of learning
Sort
View
ECAI
2004
Springer
14 years 28 days ago
Towards Efficient Learning of Neural Network Ensembles from Arbitrarily Large Datasets
Advances in data collection technologies allow accumulation of large and high dimensional datasets and provide opportunities for learning high quality classification and regression...
Kang Peng, Zoran Obradovic, Slobodan Vucetic
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
14 years 2 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
ICCV
2007
IEEE
14 years 9 months ago
Unsupervised Joint Alignment of Complex Images
Many recognition algorithms depend on careful positioning of an object into a canonical pose, so the position of features relative to a fixed coordinate system can be examined. Cu...
Gary B. Huang, Vidit Jain, Erik G. Learned-Miller
AAAI
2007
13 years 10 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
ICML
2006
IEEE
14 years 8 months ago
PAC model-free reinforcement learning
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
Alexander L. Strehl, Lihong Li, Eric Wiewiora, Joh...