Stochastic Compositional Optimization via Hybrid Momentum Frank--Wolfe
Not on the map. Why?
Abstract (arXiv)
Stochastic compositional optimization minimizes F(f(x), x) over a compact convex set when the inner map f is available only through noisy samples. We propose Hybrid Momentum Stochastic Frank--Wolfe, a projection-free method for outer functions F that are jointly convex and Lipschitz but not necessarily differentiable, such as maxima, CVaR, and norms. The method tracks the Jacobian and the value of f with momentum, using a Taylor correction for the value, and passes the tracked linearization to a generalized linear minimization oracle. Under finite-variance noise, it attains an expected generalized Frank--Wolfe gap of order K-1/4 for non-convex objectives and, when the linearized models minorize the objective, a last-iterate primal error of order K-1/3. The analysis extends to heavy-tailed noise without clipping, with separate moment orders for values and Jacobians. With an exact oracle, the method reduces to the deterministic method of Vladarean et al. (2023).
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 16 of its 30 references that are in the map. First posted on arXiv 14 May 2026.
Builds on
16 of 30 references.
References · 16
- 2018Multi-Task Learning as Multi-Objective Optimizationcited by 821
- 2018A Reductions Approach to Fair Classificationcited by 587
- 2019Lower Bounds for Non-Convex Stochastic Optimizationcited by 307
- 2019Momentum-Based Variance Reduction in Non-Convex SGDcited by 306
- 2018Empirical Risk Minimization under Fairness Constraintscited by 226
- 2014Stochastic Compositional Gradient Descent: Algorithms for Minimizing Compositions of Expected-Value Functionscited by 95
- 2018Two-Player Games for Efficient Non-Convex Constrained Optimizationcited by 55
- 2018A Single Time-Scale Stochastic Approximation Method for Nested Stochastic Optimizationcited by 53
- 2020Solving Stochastic Compositional Optimization is Nearly as Easy as Solving Stochastic Optimizationcited by 51
- 2018Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximizationcited by 47
- 2016Minimizing the Maximal Loss: How and Why?cited by 30
- 2020Stochastic Multi-level Composition Optimization Algorithms with Level-Independent Convergence Ratescited by 25
4 more
- 2018A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programmingcited by 14
- 2022A Projection-free Algorithm for Constrained Stochastic Multi-level Composition Optimizationcited by 8
- 2023Linearization Algorithms for Fully Composite Optimizationcited by 2
- 2026RanSOM: Second-Order Momentum with Randomized Scaling for Constrained and Unconstrained Optimizationcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.