Published August 21, 2026
| Version 1.1.1-candidate
Software
Open
Exact Low-Length Recht–Ré Inequalities and Metric-Dependent Rankings in Random Reshuffling Dynamics: combined candidate package
Authors/Creators
Description
Anonymous, unrefereed combined candidate package containing two manuscripts: an exact computer-assisted classification of Recht–Ré inequalities through five factors with balanced six-factor families, and a metric-aware theory of random-reshuffling dynamics. The bundle includes exact rational certificates, separate internal semantic reconstruction checks, exported FLINT characteristic-polynomial coefficients, manifests, replay receipts, and semantic mutation controls. Deterministic replay is not formal verification, independent external reproduction, specialist review, or editorial peer review.
Files
exact-low-length-recht-re-inequalities-v1.1.1-candidate.pdf
Files
(6.9 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:18966cd1027fd103a3a69f896a128ebf
|
445.4 kB | Preview Download |
|
md5:6f75e5e361528b1cb93c623d943e0a62
|
6.0 MB | Preview Download |
|
md5:6bdbc6bf4915a8d3624bf905bbfb32fe
|
397.2 kB | Preview Download |
|
md5:84f2f07f1b4861368878f03159506559
|
8.1 kB | Preview Download |
|
md5:d2d325edfc2cbe05f70d6aaabf61233e
|
112 Bytes | Download |
|
md5:7019d8ba759b89ccf472d0b0f502f35a
|
1.6 kB | Preview Download |
|
md5:1d4d0d9ab99617c948894bc388182cf5
|
703 Bytes | Preview Download |
Additional details
Related works
- Cites
- 10.48550/arXiv.2206.00632 (DOI)
- 10.48550/arXiv.2607.22620 (DOI)
- Is new version of
- Software: 10.5281/zenodo.21709239 (DOI)
- Is supplement to
- Software: https://github.com/ipitchford/exact-low-length-recht-re-inequalities/tree/v1.1.1-candidate (URL)
References
- Recht, B., & Ré, C. (2012). Toward a noncommutative arithmetic–geometric mean inequality: conjectures, case-studies, and consequences. COLT 2012, PMLR 23. https://proceedings.mlr.press/v23/recht12.html
- Lai, Z., & Lim, L.-H. (2020). Recht–Ré noncommutative arithmetic–geometric mean conjecture is false. ICML 2020, PMLR 119. https://proceedings.mlr.press/v119/lai20a.html
- De Sa, C. M. (2020). Random reshuffling is not always better. NeurIPS 2020. https://proceedings.neurips.cc/paper/2020/hash/42299f06ee419aa5d9d07798b56779e2-Abstract.html
- Yun, C., Sra, S., & Jadbabaie, A. (2021). Open problem: Can single-shuffle SGD be better than reshuffling SGD and GD? COLT 2021, PMLR 134. https://proceedings.mlr.press/v134/open-problem-yun21a.html
- Domingo-Enrich, C. (2022). Shuffle once: the better alternative to SGD and random reshuffling for finite-sum optimization. arXiv:2206.00632. https://arxiv.org/abs/2206.00632
- Lok, C., Sonthalia, R., & Rebrova, E. (2025). On the error dynamics of random reshuffling. ALT 2025, PMLR 272. https://proceedings.mlr.press/v272/lok25a.html
- Liu, Z. (2026). Random reshuffling dominates stochastic gradient descent. COLT 2026, PMLR 336. https://proceedings.mlr.press/v336/liu26d.html
- Peng, B. (2026). Single shuffling beats reshuffling: an affirmative answer to Yun–Sra–Jadbabaie. arXiv:2607.22620. https://arxiv.org/abs/2607.22620