Paper

A stochastic approximation method with max-norm projections and its applications to the Q-learning algorithm

2010

Created by Alysson Bolognesi Prado at 2019-03-28 09:35:35.0.

Simplified Graph of Associations

Word Cloud

Bibliographic Sets

1

Research Paradigm

Authors

2

Sumit Kunnumkal

Huseyin Topaloglu

Venue

1

ACM Transactions on Modeling and Computer Simulation

References

27

An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem

Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics), Wiley-Interscience, 2007

Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems

Discrete Stochastic Dynamic Programming, John Wiley & Sons, Inc

An approximate dynamic programming approach for a product distribution problem

An algorithm for approximating piecewise linear concave functions from sample gradients