Sciweavers

176 search results - page 13 / 36
» The complexity of properly learning simple concept classes
Sort
View
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
14 years 3 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
NIPS
2007
13 years 10 months ago
A general agnostic active learning algorithm
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...
Sanjoy Dasgupta, Daniel Hsu, Claire Monteleoni
COLT
2008
Springer
13 years 10 months ago
On the Power of Membership Queries in Agnostic Learning
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
Vitaly Feldman
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
14 years 2 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
NN
2007
Springer
112views Neural Networks» more  NN 2007»
13 years 8 months ago
An augmented CRTRL for complex-valued recurrent neural networks
Real world processes with an “intensity” and “direction” component can be made complex by convenience of representation (vector fields, radar, sonar), and their processin...
Su Lee Goh, Danilo P. Mandic