SOURCE-LINKED INTELLIGENCE

Solving Finite-sum Coupled Compositional Optimization via Multi-block-Single-probe Estimator

arXiv · AI, language, vision and robotics · article · Sep 14, 2026 · UTC

Traditional variance reduction methods (e.g., SPIDER, SARAH, STORM) have been extensively investigated for improving the convergence rates of stochastic optimization. These techniques typically maintain a sequence of estimators for a single function (or gradient) across iterations. However, what if we need to track multiple functions, but can only access stochastic samples of $\mathcal{O}(1)$ functions at each iteration? This scenario arises in an important emerging family of finite-sum coupled compositional optimization (FCCO) problems of the form $\frac{1}{m}\sum_{i=1}^m f_i(g_i(\mathbf{w}))

Read original source ↗ Open in workspace

recordType

paper

region

Global