Approximate linear programming

21

ICML
2010
IEEE

223views Machine Learning» more ICML 2010»

Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes

13 years 6 months ago

Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...

Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...

claim paper

Read More »

17

click to vote

NIPS
2003

156views Information Technology» more NIPS 2003»

Linear Program Approximations for Factored Continuous-State Markov Decision Processes

13 years 6 months ago

Download www.cs.pitt.edu

Approximate linear programming (ALP) has emerged recently as one of the most promising methods for solving complex factored MDPs with ﬁnite state spaces. In this work we show th...

Milos Hauskrecht, Branislav Kveton

claim paper

Read More »

11

click to vote

UAI
2008

230views Artificial Intelligence» more UAI 2008»

Partitioned Linear Programming Approximations for MDPs

13 years 6 months ago

Download uai2008.cs.helsinki.fi

Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...

Branislav Kveton, Milos Hauskrecht

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers