mlsanityData to 7 Oct 2026

Finite-sum Composition Optimization via Variance Reduced Gradient Descent

arXiv 1610.04674 ↗First posted 15 Oct 2016math.OCcited by 15

Not on the map. Why?

Abstract (arXiv)

The stochastic composition optimization proposed recently by Wang et al. [2014] minimizes the objective with the compositional expectation form: minx~(mathbbEiFi circ mathbbEj Gj)(x). It summarizes many important applications in machine learning, statistics, and finance. In this paper, we consider the finite-sum scenario for composition optimization: [minx f (x) := frac1n sumi = 1n Fi left(frac1m sumj = 1m Gj (x) right). ] We propose two algorithms to solve this problem by combining the stochastic compositional gradient descent (SCGD) and the stochastic variance reduced gradient (SVRG) technique. A constant linear convergence rate is proved for strongly convex optimization, which substantially improves the sublinear rate O(K-0.8) of the best known algorithm.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Oct 2016.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 6; 2022: 4; 2023: 4; 2024: 0; 2025: 1.

15 papers.

Sort: