The Proximal Robbins-Monro Method
Panos Toulis, Thibaut Horel, Edoardo M. Airoldi

TL;DR
This paper introduces a proximal version of the Robbins-Monro stochastic approximation method, enhancing numerical stability and convergence properties, and extends its applicability to scenarios with intractable objectives.
Contribution
It develops a theoretical framework for stochastic proximal Robbins-Monro procedures, demonstrating improved stability and practical implementation advantages over classical methods.
Findings
Proximal Robbins-Monro improves numerical stability.
The method retains optimal convergence rates.
Approximate implementations are practical and effective.
Abstract
The need for parameter estimation with massive datasets has reinvigorated interest in stochastic optimization and iterative estimation procedures. Stochastic approximations are at the forefront of this recent development as they yield procedures that are simple, general, and fast. However, standard stochastic approximations are often numerically unstable. Deterministic optimization, on the other hand, increasingly uses proximal updates to achieve numerical stability in a principled manner. A theoretical gap has thus emerged. While standard stochastic approximations are subsumed by the framework of Robbins and Monro (1951), there is no such framework for stochastic approximations with proximal updates. In this paper, we conceptualize a proximal version of the classical Robbins-Monro procedure. Our theoretical analysis demonstrates that the proposed procedure has important stability…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
