mlsanityData to 7 Oct 2026

Stochastically Controlled Stochastic Gradient for the Convex and Non-convex Composition problem

arXiv 1809.02505 ↗First posted 6 Sep 2018math.OC cs.LG stat.MLcited by 4

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

Cited by year

Citing papers per year: 2021: 3; 2022: 1.

4 papers.