STOPS: Short-Term-based Volatility-controlled Policy Search and its Global Convergence
Not on the map. Why?
Abstract (arXiv)
It remains challenging to deploy existing risk-averse approaches to real-world applications. The reasons are multi-fold, including the lack of global optimality guarantee and the necessity of learning from long-term consecutive trajectories. Long-term consecutive trajectories are prone to involving visiting hazardous states, which is a major concern in the risk-averse setting. This paper proposes Short-Term VOlatility-controlled Policy Search (STOPS), a novel algorithm that solves risk-averse problems by learning from short-term trajectories instead of long-term trajectories. Short-term trajectories are more flexible to generate, and can avoid the danger of hazardous state visitations. By using an actor-critic scheme with an overparameterized two-layer neural network, our algorithm finds a globally optimal policy at a sublinear rate with proximal policy optimization and natural policy gradient, with effectiveness comparable to the state-of-the-art convergence rate of risk-neutral policy-search methods. The algorithm is evaluated on challenging Mujoco robot simulation tasks under the mean-variance evaluation metric. Both theoretical analysis and experimental results demonstrate a state-of-the-art level of STOPS' performance among existing risk-averse policy search methods.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 35 of its 81 references that are in the map. First posted on arXiv 24 Jan 2022.
Builds on
35 of 81 references.
References · 35
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2015Trust Region Policy Optimizationcited by 2,503
- 2016OpenAI Gymcited by 1,684
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
- 2018Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layerscited by 340
- 2020On the Global Convergence Rates of Softmax Policy Gradient Methodscited by 258
- 2015Coordinate Descent Algorithmscited by 218
- 2019Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Boundcited by 199
- 2020Fast Global Convergence of Natural Policy Gradient Methods with Entropy Regularizationcited by 170
- 2019Finite-Time Error Bounds For Linear Stochastic Approximation and TD Learningcited by 165
23 more
- 2019Neural Policy Gradient Methods: Global Optimality and Rates of Convergencecited by 157
- 2019Global Optimality Guarantees For Policy Gradient Methodscited by 146
- 2020CRPO: A New Approach for Safe Reinforcement Learning with Convergence Guaranteecited by 128
- 2019Adaptive Trust Region Policy Optimization: Global Convergence and Faster Rates for Regularized MDPscited by 113
- 2017Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimizationcited by 96
- 2014Stochastic Compositional Gradient Descent: Algorithms for Minimizing Compositions of Expected-Value Functionscited by 93
- 2019Generalization Error Bounds of Gradient Descent for Learning Over-parameterized Deep ReLU Networkscited by 60
- 2017How Should a Robot Assess Risk? Towards an Axiomatic Theory of Risk in Roboticscited by 57
- 2019Risk Averse Robust Adversarial Reinforcement Learningcited by 54
- 2019Risk-Averse Trust Region Optimization for Reward-Volatility Reductioncited by 53
- 2020Single-Timescale Actor-Critic Provably Finds Globally Optimal Policycited by 34
- 2020Finite-Sample Analysis of Proximal Gradient TD Algorithmscited by 32
- 2019Two Time-scale Off-Policy TD Learning: Non-asymptotic Analysis over Markovian Samplescited by 31
- 2020Mean-Variance Policy Iteration for Risk-Averse Reinforcement Learningcited by 28
- 2021Mean-Field Multi-Agent Reinforcement Learning: A Decentralized Network Approachcited by 27
- 2019Neural Temporal-Difference and Q-Learning Provably Converge to Global Optimacited by 20
- 2020Finite-sample Analysis of Greedy-GQ with Linear Function Approximation under Markovian Noisecited by 17
- 2021Global Optimality and Finite Sample Analysis of Softmax Off-Policy Actor Critic under State Distribution Mismatchcited by 17
- 2018Finite Sample Analysis of the GTD Policy Evaluation Algorithms in Markov Settingcited by 12
- 2018A Block Coordinate Ascent Algorithm for Mean-Variance Optimizationcited by 11
- 2019Implicit Regularization in Over-parameterized Neural Networkscited by 10
- 2015Stability of Stochastic Approximations with `Controlled Markov' Noise and Temporal Difference Learningcited by 9
- 2020Risk-Sensitive Deep RL: Variance-Constrained Actor-Critic Provably Finds Globally Optimal Policycited by 7
Built on by
Not cited yet.