SOURCE-LINKED INTELLIGENCE

High-Probability Convergence of SGD via Batched Updates

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

Stochastic gradient descent (SGD) is the primary workhorse for large-scale optimization. While the average behavior of its iterates, typically characterized by mean-squared error bounds, is well-understood, obtaining high-probability guarantees for the last iterate remains challenging. Prior approaches to this problem have either imposed restrictive assumptions (such as bounded domains or gradients) or relied on complex proofs involving auxiliary sequences. In this work, we propose Batched SGD, a simple variant that partitions online samples into epochs and performs a single update per epoch u

Read original source ↗ Open in workspace

recordType

paper

region

Global