← Search

Ofir Gaash

2 accepted papers

2025

Faster Stochastic Optimization with Arbitrary Delays via Adaptive Asynchronous Mini-Batching

ICML 2025poster

We consider the problem of asynchronous stochastic optimization, where an optimization algorithm makes updates based on stale stochastic gradients of the objective that are subject to an arbitrary (possibly adversarial) sequence of delays. We present a procedure which, for any given $q \in (0,1]$, t…

Cited by 0SourcePDFScholar