Timezone: »

 
Poster
Accelerating Stochastic Composition Optimization
Mengdi Wang · Ji Liu · Ethan Fang

Wed Dec 07 09:00 AM -- 12:30 PM (PST) @ Area 5+6+7+8 #167
in Wednesday Posters »

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.

Keywords: Convex Optimization · Reinforcement Learning Algorithms
[ PDF] 

Author Information

Mengdi Wang (Princeton University)

Mengdi Wang is interested in data-driven stochastic optimization and applications in machine and reinforcement learning. She received her PhD in Electrical Engineering and Computer Science from Massachusetts Institute of Technology in 2013. At MIT, Mengdi was affiliated with the Laboratory for Information and Decision Systems and was advised by Dimitri P. Bertsekas. Mengdi became an assistant professor at Princeton in 2014. She received the Young Researcher Prize in Continuous Optimization of the Mathematical Optimization Society in 2016 (awarded once every three years).

Ji Liu (Kwai Inc.)
Ethan Fang (Pennsylvania State University)

More from the Same Authors