Sciweavers

282 search results - page 20 / 57
» Online Learning of Approximate Dependency Parsing Algorithms
Sort
View
IWANN
1999
Springer
13 years 12 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
ICML
2008
IEEE
14 years 8 months ago
A worst-case comparison between temporal difference and residual gradient with linear function approximation
Residual gradient (RG) was proposed as an alternative to TD(0) for policy evaluation when function approximation is used, but there exists little formal analysis comparing them ex...
Lihong Li
SEMWEB
2009
Springer
14 years 2 months ago
Populating the Semantic Web by Macro-reading Internet Text
A key question regarding the future of the semantic web is “how will we acquire structured information to populate the semantic web on a vast scale?” One approach is to enter t...
Tom M. Mitchell, Justin Betteridge, Andrew Carlson...
ICML
2007
IEEE
14 years 8 months ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
13 years 2 months ago
Learning in mean-field oscillator games
This research concerns a noncooperative dynamic game with large number of oscillators. The states are interpreted as the phase angles for a collection of non-homogeneous oscillator...
Huibing Yin, Prashant G. Mehta, Sean P. Meyn, Uday...