1974 search results - page 161 / 395 » Online learning in online auctions |
183
click to vote
IROS
2008
IEEE
16 years 27 days 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...
133
click to vote
COCOON
2007
Springer
16 years 20 days 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.
198
click to vote
COLT
2000
Springer
15 years 10 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...
166
click to vote
UAI
1997
15 years 7 months ago
1997
This paper re-examines the problem of parameter estimation in Bayesian networks with missing values and hidden variables from the perspective of recent work in on-line learning [1...
189
click to vote
COLT
2005
Springer
15 years 8 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...