Polyak--Ruppert
PulseAugur coverage of Polyak--Ruppert — every cluster mentioning Polyak--Ruppert across labs, papers, and developer communities, ranked by signal.
2 day(s) with sentiment data
-
New TD(0) algorithm achieves robust and fast convergence with single stepsize
Researchers have developed a new method for linear TD(0) algorithms that uses a single stepsize schedule, eliminating the need for prior knowledge of curvature parameters. This approach provides high-probability guarant…
-
New Theory: SA-Adam Adaptivity Asymptotically Invisible
Researchers have published a paper detailing a theoretical analysis of adaptive optimization algorithms, specifically focusing on SA-Adam with momentum and non-convergent adaptive preconditioning. The study proves a non…
-
New Q-learning method achieves n^{-1/4} Gaussian approximation bound
Researchers have developed a new method for approximating Gaussian distributions in entropy-regularized Q-learning with function approximation. The study establishes convergence rates for averaged iterates generated by …
-
Researchers develop novel bootstrap for SGD confidence sets
Researchers have developed a novel method for constructing confidence sets in Stochastic Gradient Descent (SGD) algorithms. This new approach utilizes the multiplier bootstrap procedure and establishes its non-asymptoti…
-
New research identifies stabilization threshold for dynamic preconditioning in online inference
Researchers have identified a critical stabilization threshold for dynamic preconditioning in gradient descent methods. This threshold determines when the Polyak-Ruppert averaging technique, fundamental for online infer…