282 search results - page 25 / 57 » Online Learning of Approximate Dependency Parsing Algorithms |
EACL
2006
ACL Anthology
13 years 9 months ago
2006
ACL Anthology
We present a model for sentence compression that uses a discriminative largemargin learning framework coupled with a novel feature set defined on compressed bigrams as well as dee...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...