math.OC · 2026-11-02 · No. 161

Optimization and Control, 2026-11-02.

3 new papers in math.OC. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

3 entries
  1. 01

    Exact Theory and Optimal Stepsizes for Stochastic Gradient Descent in Smooth Convex Minimization

    Benjamin Grimmer, Qining Shen

    math.OC · cs.LG

    This work considers the design of stepsize schedules for stochastic gradient descent in smooth convex optimization. Throughout, we assume that gradient noise is conditionally zero-mean with bounded variance. Among problems with dimension $d\geq N+1$, we provide an exact worst-case analysis of the expected suboptimality of stochastic gradient descent's final iterate. Our analysis applies to any (potentially nonconstant) schedule of $N$...

    arxiv.org/abs/2610.42048 · PDF

  2. 02

    Near-Optimal Second-Order Convex Finite-Sum Optimization under Individual Smoothness

    Xinliang Zhang, Lesi Chen, Zonghan Li, Jingzhao Zhang

    math.OC · cs.AI · stat.ML

    We study the stochastic second-order oracle complexity of solving smooth convex finite-sum optimization with $n$ components. Very recently, Tsedenov \& Kovalev (2026) showed that the minimax optimal complexity under averaged smoothness and convexity is $\tildeΘ(n + n^{6/7} ε^{-2/7})$ by establishing nearly matching upper and lower bounds. In this paper, we show that individual smoothness and convexity provably enable further acceleration,...

    arxiv.org/abs/2610.42040 · PDF

  3. 03

    Variance Reduction for Decentralized Stochastic Optimization with Multiple Local Updates

    Jie Liu, Nicola Bastianello, Wenying Xu, Daniel W. C. Ho

    math.OC · cs.LG

    Multiple local updates are widely used in decentralized optimization to enhance communication efficiency, often in conjunction with stochastic gradients when exact gradient computation is costly. However, such algorithms generally converge only to a neighborhood of the optimum, whose size depends on the stepsize and the variance of gradient noise. Variance reduction has been incorporated into ADMM-based methods to achieve exact convergence in...

    arxiv.org/abs/2610.41927 · PDF

This edition is part of The Daily Abstract — math.OC archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.