Accelerating Stochastic Composition Optimization

2016-07-25 · NeurIPS 2016 12 · Mengdi Wang, Ji Liu, Ethan X. Fang

Consider the stochastic composition optimization problem where the objective is a composition of two expected-value functions. We propose a new stochastic first-order method, namely the accelerated stochastic compositional proximal gradient (ASC-PG) method, which updates based on queries to the sampling oracle using two different timescales. The ASC-PG is the first proximal gradient method for the stochastic composition problem that can deal with nonsmooth regularization penalty. We show that the ASC-PG exhibits faster convergence than the best known algorithms, and that it achieves the optimal sample-error complexity in several important special cases. We further demonstrate the application of ASC-PG to reinforcement learning and conduct numerical experiments.

📄 PDF Abstract BibTeX arXiv:1607.07329

Code (0)

등록된 구현이 없습니다.

Tasks

reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Fast Stochastic Variance Reduced ADMM for Stochastic Composition Optimization

2017-05-11 · Yue Yu, Longbo Huang

We consider the stochastic composition optimization problem proposed in \cite{wang2017stochastic}, which has applications ranging from estimation to statistical and machine learning. We propose the first ADMM-based algor…

BIG-bench Machine Learning

Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates

2023-07-17 · Kyle Mana, Fernando Acero, Stephen Mak, Parisa Zehtabi 외

Discrete optimization belongs to the set of $\mathcal{NP}$-hard problems, spanning fields such as mixed-integer programming and combinatorial optimization. A current standard approach to solving convex discrete optimizat…

Combinatorial Optimization Management reinforcement-learning Reinforcement Learning+1

Solving Stochastic Compositional Optimization is Nearly as Easy as Solving Stochastic Optimization

2020-08-25 · Tianyi Chen, Yuejiao Sun, Wotao Yin

Stochastic compositional optimization generalizes classic (non-compositional) stochastic optimization to the minimization of compositions of functions. Each composition may introduce an additional expectation. The series…

Management Meta-Learning Stochastic Optimization

Efficient Smooth Non-Convex Stochastic Compositional Optimization via Stochastic Recursive Gradient Descent

2019-12-01 · NeurIPS 2019 12 · Huizhuo Yuan, Xiangru Lian, Chris Junchi Li, Ji Liu 외

Stochastic compositional optimization arises in many important machine learning tasks such as reinforcement learning and portfolio management. The objective function is the composition of two expectations of stochastic f…

Management Reinforcement Learning Stochastic Optimization

Stochastic Recursive Variance Reduction for Efficient Smooth Non-Convex Compositional Optimization

2019-12-31 · Huizhuo Yuan, Xiangru Lian, Ji Liu

Stochastic compositional optimization arises in many important machine learning tasks such as value function evaluation in reinforcement learning and portfolio management. The objective function is the composition of two…