Sciweavers

68 search results - page 4 / 14
» Feature-Discovering Approximate Value Iteration Methods
Sort
View
ICML
1995
IEEE
14 years 8 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon
SIAMSC
2010
141views more  SIAMSC 2010»
13 years 6 months ago
An Iterative Method for Edge-Preserving MAP Estimation When Data-Noise Is Poisson
In numerous applications of image processing, e.g. astronomical and medical imaging, data-noise is well-modeled by a Poisson distribution. This motivates the use of the negative-lo...
Johnathan M. Bardsley, John Goldes
JAIR
2010
131views more  JAIR 2010»
13 years 6 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
CISS
2008
IEEE
14 years 2 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar
SIAMJO
2010
246views more  SIAMJO 2010»
13 years 6 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...