analiza aiqbench
This paper introduces Hybrid Momentum Stochastic Frank--Wolfe, a projection-free optimization algorithm designed for stochastic compositional problems involving non-differentiable outer functions like maxima and norms. By tracking Jacobians and values with momentum under finite-variance or heavy-tailed noise, the method achieves improved convergence rates without requiring gradient clipping. The work advances theoretical machine learning by addressing complex objective landscapes where standard differentiability assumptions do not hold.
Stochastic Compositional Optimization via Hybrid Momentum Frank--Wolfe
arXiv:2605.15350v2 Announce Type: replace-cross Abstract: 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).
Abstract: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).
Optimization and Control (math.OC); Machine Learning (cs.LG)
arXiv:2605.15350 [math.OC]
(or arXiv:2605.15350v2 [math.OC] for this version)
https://doi.org/10.48550/arXiv.2605.15350 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 240 cuvinte
Subiecte conexe
Projection-Free Multi-level Algorithms for Stochastic Constrained Compositional Optimization
arXiv · 15 sept. 2026
Variance-Reduced Conditional Gradient Methods under Markovian Sampling for Nonconvex Composite Optimization
arXiv · 29 iul. 2026

A new pulse design cuts errors in hybrid qubit-oscillator control
Quantum Zeitgeist · 15 oct. 2026
Optimal Momentum Methods for Stochastic Multilevel Compositional Optimization
arXiv · 2 oct. 2026