2223 search results - page 153 / 445 » Implicit Online Learning |
147
click to vote
TSMC
1998
15 years 4 months ago
1998
Abstract—We present a general scheme for learning sensorimotor tasks which allows rapid on-line learning and generalization of the learned knowledge to unfamiliar objects. The sc...
111
click to vote
AAAI
2010
15 years 6 months ago
2010
The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs h...
149
click to vote
IROS
2008
IEEE
15 years 11 months ago
2008
IEEE
— High performance and compliant robot control requires accurate dynamics models which cannot be obtained analytically for sufficiently complex robot systems. In such cases, mac...
115
click to vote
COCOON
2007
Springer
15 years 11 months ago
2007
Springer
We use the connection between resource-bounded dimension and the online mistake-bound model of learning to show that the following classes have polynomial-time dimension zero.
172
click to vote
COLT
2000
Springer
15 years 9 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...