472 search results - page 62 / 95 » Linear programming with online learning |
COLT
1998
Springer
13 years 12 months ago
1998
Springer
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
NIPS
1996
13 years 9 months ago
1996
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
HT
2000
ACM
13 years 12 months ago
2000
ACM
Software components for distance and just-in-time (JIT) learning are an increasingly common method of encouraging reuse and facilitating the development process[58], but no analog...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
AAAI
2011
12 years 7 months ago
2011
We propose a fast batch learning method for linearchain Conditional Random Fields (CRFs) based on Newton-CG methods. Newton-CG methods are a variant of Newton method for high-dime...