Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming
From MaRDI portal
Publication:851872
DOI10.1007/s10994-006-8365-9zbMath1475.90122OpenAlexW2146917784MaRDI QIDQ851872
Warren B. Powell, Abraham P. George
Publication date: 22 November 2006
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-006-8365-9
Related Items (21)
A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks ⋮ ASD+M: automatic parameter tuning in stochastic optimization and on-line learning ⋮ Approximate dynamic programming for lateral transshipment problems in multi-location inventory systems ⋮ A stochastic gradient method for a class of nonlinear PDE-constrained optimal control problems under uncertainty ⋮ Block-cyclic stochastic coordinate descent for deep neural networks ⋮ Cross-docking based factory logistics unitisation process: an approximate dynamic programming approach ⋮ Reinforcement learning algorithms with function approximation: recent advances and applications ⋮ Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming ⋮ Integrated condition-based maintenance and multi-item lot-sizing with stochastic demand ⋮ Stochastic model predictive control with adaptive constraint tightening for non-conservative chance constraints satisfaction ⋮ Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control of Grid-Level Energy Storage ⋮ Autonomous reinforcement learning with experience replay ⋮ A unified framework for stochastic optimization ⋮ Scalable estimation strategies based on stochastic approximations: classical results and new insights ⋮ A Stochastic Line Search Method with Expected Complexity Analysis ⋮ Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures ⋮ Bayesian Exploration for Approximate Dynamic Programming ⋮ Projected Stochastic Gradients for Convex Constrained Problems in Hilbert Spaces ⋮ Probabilistic Line Searches for Stochastic Optimization ⋮ Convergence Rates and Decoupling in Linear Stochastic Approximation Algorithms ⋮ An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forecasting Sales by Exponentially Weighted Moving Averages
- Exponentiated gradient versus gradient descent for linear predictors
- Recursive estimation and time-series analysis. An introduction
- Accelerated Stochastic Approximation
- On the identification of non-stationary linear processes
- A method of aggregate stochastic subgradients with on-line stepsize rules for convex stochastic programming problems
- A stochastic gradient adaptive filter with gradient adaptive step size
- Introduction to Stochastic Search and Optimization
- Analysis of adaptive step-size SA algorithms for parameter tracking
- Learning Applied to Successive Approximation Algorithms
- Stochastic Estimation of the Maximum of a Regression Function
- A Stochastic Approximation Method
- Approximation Methods which Converge with Probability one
- Multidimensional Stochastic Approximation Methods
- Adaptive filtering
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming
