3694 search results - page 184 / 739 » Stochastic complexity in learning |
NIPS
2007
14 years 11 months ago
2007
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...
ICML
2003
IEEE
15 years 11 months ago
2003
IEEE
Recent theoretical results have shown that improved bounds on generalization error of classifiers can be obtained by explicitly taking the observed margin distribution of the trai...
75
Voted
AAAI
2008
15 years 16 days ago
2008
The core computational step in spectral learning
ILP
2007
Springer
15 years 4 months ago
2007
Springer
In reinforcement learning problems, an agent has the task of learning a good or optimal strategy from interaction with his environment. At the start of the learning task, the agent...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...