algorithms-optimization / Optimization

The Yun-Sra-Jadbabaie SS-RS-GD Inequalities

Yun, Sra and Jadbabaie posed as a COLT 2021 open question whether, for well-conditioned symmetric matrices, the operators encoding the expected iterate of single-shuffle SGD, random-reshuffle SGD and gradient descent on a quadratic finite sum satisfy $\|W_{ss}\| \le \|W_{rs}\| \le \|W_{gd}\|$. They do.

15Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

algorithms-optimizationJun 16, 2026Significance 15/100Registry: unreviewed

The Yun-Sra-Jadbabaie SS-RS-GD Inequalities

Prior state unknownproved

Yun, Sra and Jadbabaie posed as a COLT 2021 open question whether, for well-conditioned symmetric matrices, the operators encoding the expected iterate of single-shuffle SGD, random-reshuffle SGD and gradient descent on a quadratic finite sum satisfy $\|W_{ss}\| \le \|W_{rs}\| \le \|W_{gd}\|$. They do.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Yun, Sra and Jadbabaie posed as a COLT 2021 open question whether, for well-conditioned symmetric matrices, the operators encoding the expected iterate of single-shuffle SGD, random-reshuffle SGD and gradient descent on a quadratic finite sum satisfy $\|W_{ss}\| \le \|W_{rs}\| \le \|W_{gd}\|$. They do.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.

The Yun-Sra-Jadbabaie SS-RS-GD Inequalities — Mathematical Frontier Network