Learning Stochastic Optimal Policies via Gradient Descent
Not on the map. Why?
Abstract (arXiv)
We systematically develop a learning-based treatment of stochastic optimal control (SOC), relying on direct optimization of parametric control policies. We propose a derivation of adjoint sensitivity results for stochastic differential equations through direct application of variational calculus. Then, given an objective function for a predetermined task specifying the desiderata for the controller, we optimize their parameters via iterative gradient descent methods. In doing so, we extend the range of applicability of classical SOC techniques, often requiring strict assumptions on the functional form of system and control. We verify the performance of the proposed approach on a continuous-time, finite horizon portfolio optimization with proportional transaction costs.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 15 of its 38 references that are in the map. First posted on arXiv 7 Jun 2021.
Builds on
15 of 38 references.
References · 15
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2016An overview of gradient descent optimization algorithmscited by 1,021
- 2014Deep Learning in Neural Networks: An Overviewcited by 765
- 2018Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Reviewcited by 466
- 2020Scalable Gradients for Stochastic Differential Equationscited by 264
- 2020Dissecting Neural ODEscited by 150
- 2016Variance Reduction for Faster Non-Convex Optimizationcited by 72
- 2019LQR through the Lens of First Order Methods: Discrete-time Casecited by 30
- 2014Global Convergence of Stochastic Gradient Descent for Some Non-convex Matrix Problemscited by 25
- 2020Stable Neural Flowscited by 25
- 2019Infinitely deep neural networks as diffusion processescited by 21
3 more
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1.
2 papers.