Sciweavers

945 search results - page 63 / 189
» Dialog Convergence and Learning
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Fast adaptive variational sparse Bayesian learning with automatic relevance determination
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
Dmitriy Shutin, Thomas Buchgraber, Sanjeev R. Kulk...
IJCAI
1997
14 years 11 months ago
Learning Topological Maps with Weak Local Odometric Information
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...
Hagit Shatkay, Leslie Pack Kaelbling
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
14 years 7 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
COLT
2004
Springer
15 years 3 months ago
Deterministic Calibration and Nash Equilibrium
Abstract. We provide a natural learning process in which the joint frequency of empirical play converges into the set of convex combinations of Nash equilibria. In this process, al...
Sham Kakade, Dean P. Foster
ICML
1996
IEEE
15 years 10 months ago
Sensitive Discount Optimality: Unifying Discounted and Average Reward Reinforcement Learning
Research in reinforcementlearning (RL)has thus far concentrated on two optimality criteria: the discounted framework, which has been very well-studied, and the averagereward frame...
Sridhar Mahadevan