On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,341 papers · 148 categories

Trend · papers per month

count % of corpus

2 results for “RandomShuffle”

Random Shuffling Beats SGD after Finite Epochsmath.OC

Random shuffling outperforms SGD after a few epochs in optimization problems.

problem Proving RandomShuffle converges faster than SGD after a finite number of epochs.

method Introduced RandomShuffle and proved its convergence rate under strong convexity and smoothness conditions.

result RandomShuffle converges faster than SGD after a reasonable number of epochs, with a rate of O(1/T^2 + n^3/T^3).

RandomShuffle SGD Convergence Optimization Strong Convexity

2018-06-26abs ↗pdf ↗

SGD with shuffling: optimal rates without component convexity and large epoch requirementsmath.OC

Optimal SGD rates achieved with shuffling, covering non-convex and convex cases.

problem Optimizing finite-sum optimization problems with shuffling strategies.

method RandomShuffle and SingleShuffle algorithms for SGD, analyzing convergence rates.

result Minimax optimal convergence rates established, generalizing to non-convex costs.

SGD Shuffling Optimization Finite-sum Convergence

2020-06-12abs ↗pdf ↗