Sciweavers

63 search results - page 3 / 13
» Adaptive Subgradient Methods for Online Learning and Stochas...
Sort
View
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
13 years 9 months ago
On-line evolutionary computation for reinforcement learning in stochastic domains
In reinforcement learning, an agent interacting with its environment strives to learn a policy that specifies, for each state it may encounter, what action to take. Evolutionary c...
Shimon Whiteson, Peter Stone
SIAMCO
2000
117views more  SIAMCO 2000»
13 years 5 months ago
The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
Vivek S. Borkar, Sean P. Meyn
JMLR
2006
116views more  JMLR 2006»
13 years 5 months ago
Step Size Adaptation in Reproducing Kernel Hilbert Space
This paper presents an online support vector machine (SVM) that uses the stochastic meta-descent (SMD) algorithm to adapt its step size automatically. We formulate the online lear...
S. V. N. Vishwanathan, Nicol N. Schraudolph, Alex ...
ATAL
2008
Springer
13 years 7 months ago
An approach to online optimization of heuristic coordination algorithms
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
Jumpol Polvichai, Paul Scerri, Michael Lewis
RSS
2007
129views Robotics» more  RSS 2007»
13 years 6 months ago
Spatially-Adaptive Learning Rates for Online Incremental SLAM
— Several recent algorithms have formulated the SLAM problem in terms of non-linear pose graph optimization. These algorithms are attractive because they offer lower computationa...
Edwin Olson, John J. Leonard, Seth J. Teller