arXiv (All)
open access
A Shadow Sequence Technique for Last-Iterate Convergence Analysis of the Random Reshuffling Method: Relaxed Stepsize Conditions and Beyond
We prove two last-iterate convergence bounds of the random reshuffling (RR) method in the smooth general convex finite-sum optimization. In the proved results, the stepsize sequence $\{η_{k}\}_{k}$ of RR is an arbitrary positive non-increasing sequence with $η_{1}\lesssim 1/(\operatorname{polylog}(n
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Uniform convergence at optimal rate and scale#1388902
- Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order#1155274
- Polytope Sampling at the Speed of Isoperimetry#1388146
- Minimax-Optimal Early Stopping for Continuous-Time SGD via the Discrepancy Principle#998814
- A more efficient algorithm to compute the Rand Index for change-point problems#665417
Record · ID 1413407
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive