Variance Reduction with Delayed Feedback for Non-Convex Optimization

The paper investigates variance reduction techniques for non‑convex optimization when gradient evaluations are delayed. It introduces an ordered recursive momentum estimator whose oracle complexity depends on smoothness, variance, and delay, and provides bounds for both stochastic and finite‑sum settings. An asynchronous snapshot variant is also proposed, allowing updates during full‑gradient computations under a completion‑time bound.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.