Feature-based methods for large scale dynamic programming
From MaRDI portal
Recommendations
- Feature-based methods for large scale dynamic programming
- Efficient massively parallel methods for dynamic programming
- Multidimensional dynamic programming on massively parallel computers
- Dynamic factorization in large-scale optimization
- scientific article; zbMATH DE number 5520408
- Scaling features in complex optimization problems
- scientific article; zbMATH DE number 3174053
- A linear programming methodology for approximate dynamic programming
- scientific article; zbMATH DE number 5226440
Cites work
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3594403 (Why is no real title available?)
- Adaptive aggregation methods for infinite horizon dynamic programming
- Approximations of Dynamic Programs, I
- Asynchronous stochastic approximation and Q-learning
- Functional Approximations and Dynamic Programming
- Generalized polynomial approximations in Markovian decision processes
- Practical issues in temporal difference learning
- Regularization algorithms for learning that are equivalent to multilayer networks
- The convergence of \(TD(\lambda)\) for general \(\lambda\)
- \({\mathcal Q}\)-learning
Cited in
(19)- The actor-critic algorithm as multi-time-scale stochastic approximation.
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
- Shape constraints in economics and operations research
- Feature-based methods for large scale dynamic programming
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem
- Automatic induction of Bellman-error features for probabilistic planning
- Single sample path-based optimization of Markov chains
- Offline reinforcement learning in large state spaces: algorithms and guarantees
- Tetris: A study of randomized constraint sampling
- Data-driven models for capacity allocation of inpatient beds in a Chinese public hospital
- Refined performance estimation for the l-step lookahead policy in reinforcement learning
- A review of stochastic algorithms with continuous value function approximation and some new approximate policy iteration algorithms for multidimensional continuous applications
- Approximate policy iteration: a survey and some new methods
- Error analysis for approximate CVaR-optimal control with a maximum cost
- Reinforcement learning in non-Markovian environments
- Regularization and two time scales for convergence of reinforcement learning
- Reinforcement learning in convergently non-stationary environments: feudal hierarchies and learned representations
- The Benefits of State Aggregation with Extreme-Point Weighting for Assemble-to-Order Systems
- Solving the k-sparse eigenvalue problem with reinforcement learning
This page was built for publication: Feature-based methods for large scale dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1911341)
