arrow
Return

Adaptive value function approximation for continuous-state stochastic dynamic programming

delete2013-04-01
delete12
PRE
AI
V
Victoria C. P. Chen
DOI:10.1016/j.cor.2012.11.016delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Approximate dynamic programming (ADP) commonly employs value function approximation to numerically solve complex dynamic programming problems. A statistical perspective of value function approximation employs a design and analysis of computer experiments (DACE) approach, where the computer experiment yields points on the value function curve. The DACE approach has been used to numerically solve high-dimensional, continuous-state stochastic dynamic programming, and performs two tasks primarily: (1) design of experiments and (2) statistical modeling. The use of design of experiments enables more efficient discretization. However, identifying the appropriate sample size is not straightforward. Furthermore, identifying the appropriate model structure is a well-known problem in. the field of statistics. In this paper, we present a sequential method that can adaptively determine both sample size and model structure. Number-theoretic methods (NTM) are used to sequentially grow the experimental design because of their ability to fill the design space. Feed-forward neural networks (NNs) are used for statistical modeling because of their adjustability in structure-complexity. This adaptive value function approximation (AVFA) method must be automated to enable efficient implementation within ADP. An AVFA algorithm is introduced, that increments the size of the state space training data in each sequential step, and for each sample size a successive model search process is performed to find an optimal NN model. The new algorithm is tested on a nine-dimensional inventory forecasting problem. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Approximate dynamic programming
Sequential design of experiments
Statistical modeling
Neural network
Number theoretic methods
Inventory forecasting
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

R
rolls-royce holding group
Scholars:
756
Papers: 895
Citations: 0
U
university of texas system
Scholars:
18.5W
Papers: 15.6W
Citations: 210
Cited Papers

Cited Papers

Evaluating pitolisant as a narcolepsy treatment option
err2020-09-17
err0
PREAI
errStefano de Biase; Gaia Pellitteri; Gian Luigi Gigli; Mariarosaria Valente
errShare
errSave
Nonlinear Elasticity of Monolayer Graphene
err2009-06-11
err0
errOAAI
errEmiliano Cadelano; Pier Luca Palla; Stefano Giordano; Luciano Colombo
errShare
errSave
Dilated Cardiomyopathy in Epidermolysis Bullosa
err2010-04-01
err0
PREAI
errIrene Lara-Corrales; Elena Pope
errShare
errSave
A Hollow Tube‐on‐Tube Architecture of Carbon‐Tube‐Supported Nickel Cobalt Sulfide Nanotubes for Advanced Supercapacitors
err2017-03-23
err0
PREAI
errNannan Wang; Yanjie Wang; Shizhong Cui; Hongwei Hou; Liwei Mi; Weihua Chen
errShare
errSave
Intraspinal metastatic disease in childhood cancer
err1977-02-01
err0
PREAI
errMichael Baten; Robert C. Vannucci
errShare
errSave
researcher View more