Sciweavers

1834 search results - page 227 / 367
» Online Learning in Monkeys
Sort
View
AAAI
2011
14 years 6 months ago
Fast Newton-CG Method for Batch Learning of Conditional Random Fields
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...
Yuta Tsuboi, Yuya Unno, Hisashi Kashima, Naoaki Ok...
UAI
2008
15 years 8 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 6 months ago
Neuroevolutionary optimization
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
Eva Volná
CVPR
2008
IEEE
16 years 8 months ago
Incremental learning of nonparametric Bayesian mixture models
Clustering is a fundamental task in many vision applications. To date, most clustering algorithms work in a batch setting and training examples must be gathered in a large group b...
Ryan Gomes, Max Welling, Pietro Perona
CVPR
2008
IEEE
16 years 8 months ago
Visual tracking via incremental Log-Euclidean Riemannian subspace learning
Recently, a novel Log-Euclidean Riemannian metric [28] is proposed for statistics on symmetric positive definite (SPD) matrices. Under this metric, distances and Riemannian means ...
Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang, ...