Stochastically Controlled Stochastic Gradient for the Convex and Non-convex Composition problem
Not on the map. Why?
Abstract (arXiv)
In this paper, we consider the convex and non-convex composition problem with the structure frac1nsumnolimitsi = 1n Fi( G( x ) ), where G( x )=frac1nsumnolimitsj = 1n Gj( x ) is the inner function, and Fi(·) is the outer function. We explore the variance reduction based method to solve the composition optimization. Due to the fact that when the number of inner function and outer function are large, it is not reasonable to estimate them directly, thus we apply the stochastically controlled stochastic gradient (SCSG) method to estimate the gradient of the composition function and the value of the inner function. The query complexity of our proposed method for the convex and non-convex problem is equal to or better than the current method for the composition problem. Furthermore, we also present the mini-batch version of the proposed method, which has the improved the query complexity with related to the size of the mini-batch.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1.
4 papers.
- 2021Stochastic Optimization of Areas Under Precision-Recall Curves with Provable Convergencecited by 34
- 2021Randomized Stochastic Variance-Reduced Methods for Multi-Task Stochastic Bilevel Optimizationcited by 32
- 2022Multi-block-Single-probe Variance Reduced Estimator for Coupled Compositional Optimizationcited by 16
- 2021Efficient Semi-Implicit Variational Inferencecited by 9
- 2022Multi-block-Single-probe Variance Reduced Estimator for Coupled Compositional Optimization18 Jul 2022
- 2021Randomized Stochastic Variance-Reduced Methods for Multi-Task Stochastic Bilevel Optimization5 May 2021
- 2021Stochastic Optimization of Areas Under Precision-Recall Curves with Provable Convergence18 Apr 2021
- 2021Efficient Semi-Implicit Variational Inference15 Jan 2021