← Back to all news
arXiv Machine Learning September 15, 2026 By Wei Jiang, Sifan Yang, Yibo Wang, Lijun Zhang, Zechao Li

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

Read the original on arXiv Machine Learning →

The Flow has not summarised this story yet — read it at arXiv Machine Learning.

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

Related stories

arXiv Machine Learning
Jun 16

SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums

arXiv:2606. 15832v1 Announce Type: new Abstract: Empirical risk minimization on massive datasets naturally exhibits a nested double finite-sum structure, where $N=nm$ total samples are logically or physically partitioned into $n$ blocks of size $m$ (e.

By Igor Sokolov, Laurent Condat, Peter Richt\'arik
efficiencybenchmarks
More like this →
arXiv Computer Vision
Aug 26

Adaptive Extrapolated Proximal Gradient Methods with Variance Reduction for Composite Nonconvex Finite-Sum Minimization

arXiv:2502.21099v3 Announce Type: replace-cross Abstract: This paper proposes {\sf AEPG-SPIDER}, an Adaptive Extrapolated Proximal Gradient (AEPG) method with variance reduction for minimizing compos...

By Ganzhao Yuan
More like this →
arXiv Machine Learning
Aug 13

Adaptive Bregman Proximal Stochastic Gradient with a Stabilized Barzilai--Borwein Step Size

arXiv:2608. 12009v1 Announce Type: cross Abstract: Bregman proximal stochastic gradient (BPSG) methods bring variance-reduced composite optimization to objectives whose geometry is poorly captured by Euclidean smoothness.

By Chenhan Jin, Shengze Xu, Binghui Xie, Kaiwen Zhou, Fan Jia, James Cheng, Tieyong Zeng
More like this →
arXiv Machine Learning
Aug 12

Dual Space Preconditioning for Gradient Descent in the Overparameterized Regime

arXiv:2603. 10485v3 Announce Type: replace-cross Abstract: In this work, we study the convergence properties of the Dual Space Preconditioned Gradient Descent, encompassing optimizers such as Normalized Gradient Descent and Gradient Clipping.

By Reza Ghane, Danil Akhtiamov, Babak Hassibi
safety
More like this →
arXiv Machine Learning
1d ago

Gradient Descent with Stochastic Subspaces via Persistence of Memory

arXiv:2609.18416v1 Announce Type: cross Abstract: Stochastic subspace methods have gained popularity as gradient descent based techniques for large scale optimisation problems, especially in distribu...

By Subhroshekhar Ghosh, Clement Z. Q. Ng, Pierre-Louis Poirion, Akiko Takeda
efficiencysafety
More like this →
arXiv Machine Learning
Jul 20

Regularity-Aware Stochastic MGDA with Adaptive Conflict-Avoidant Update Direction Control

arXiv:2607. 15412v1 Announce Type: new Abstract: Multi-objective learning (MOL) aims to optimize multiple objectives simultaneously.

By Chentong Huang, Lisha Chen
safety
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea