Solving factored MDPs with continuous and discrete variables
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Resource allocation among agents with preferences induced by factored MDPs
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Approximate dynamic programming in multi-skill call centers
WSC '05 Proceedings of the 37th conference on Winter simulation
Mathematics of Operations Research
Second Order Cone Programming Approaches for Handling Missing and Uncertain Data
The Journal of Machine Learning Research
Tailoring density estimation via reproducing kernel moment matching
Proceedings of the 25th international conference on Machine learning
A New Learning Algorithm for Optimal Stopping
Discrete Event Dynamic Systems
Factored value iteration converges
Acta Cybernetica
On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities
Mathematics of Operations Research
Cutting-set methods for robust convex optimization with pessimizing oracles
Optimization Methods & Software
Approximate linear-programming algorithms for graph-based Markov decision processes
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Mean Field Approximation of the Policy Iteration Algorithm for Graph-based Markov Decision Processes
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Partially Observable Markov Decision Process Approximations for Adaptive Sensing
Discrete Event Dynamic Systems
Towards exploiting duality in approximate linear programming for MDPs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 4
Efficient solution algorithms for factored MDPs
Journal of Artificial Intelligence Research
Solving factored MDPs with hybrid state and action variables
Journal of Artificial Intelligence Research
Using linear programming for Bayesian exploration in Markov decision processes
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Generalizing plans to new environments in relational MDPs
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Constructing Risk Measures from Uncertainty Sets
Operations Research
An MCMC approach to solving hybrid factored MDPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Probability in the Engineering and Informational Sciences
Learning algorithms for link prediction based on chance constraints
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
International Journal of Approximate Reasoning
Network Cargo Capacity Management
Operations Research
A framework and a mean-field algorithm for the local control of spatial processes
International Journal of Approximate Reasoning
Process Flexibility Revisited: The Graph Expander and Its Applications
Operations Research
Robust Approximate Bilinear Programming for Value Function Approximation
The Journal of Machine Learning Research
SIAM Journal on Optimization
Online stochastic weighted matching: improved approximation algorithms
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Approximate Dynamic Programming via a Smoothed Linear Program
Operations Research
Robust bayesian reinforcement learning through tight lower bounds
EWRL'11 Proceedings of the 9th European conference on Recent Advances in Reinforcement Learning
Environmental Modelling & Software
Pathwise Optimization for Optimal Stopping Problems
Management Science
Randomized sampling for large zero-sum games
Automatica (Journal of IFAC)
Approximate Linear Programming for Average Cost MDPs
Mathematics of Operations Research
| Hi-index | 0.00 |
In the linear programming approach to approximate dynamic programming, one tries to solve a certain linear program--the ALP--that has a relatively small numberK of variables but an intractable numberM of constraints. In this paper, we study a scheme that samples and imposes a subset ofm