Skip to content

Author

Alexey Naumov

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Lower Bounds on Inference Complexity for Polyak-Ruppert Averaged Stochastic Gradient Descent

Sharp lower bounds are established for Gaussian approximation of Polyak-Ruppert averaged stochastic gradient descent with polynomially decreasing step sizes for Polyak-Ruppert averaged stochastic gradient descent with polynomially decreasing step sizes.

D. Belomestny, Alexey Naumov, Sergey Samsonov · 0 citations
#machine learning Conference Aug 2025

High-Order Error Bounds for Markovian LSA with Richardson-Romberg Extrapolation

In this paper, we study the bias and high-order error bounds of the Linear Stochastic Approximation (LSA) algorithm with Polyak-Ruppert (PR) averaging under Markovian noise. We focus on the version of the algorithm with constant step size and propose a novel decomposition of the bias via a linearization technique. We a...

I. Levin, Alexey Naumov, Sergey Samsonov · 2 citations

Statistical analysis of Inverse Entropy-regularized Reinforcement Learning

A statistical framework for Inverse Entropy-regularized Reinforcement Learning is developed that resolves ambiguity by combining entropy regularization with a least-squares reconstruction of the reward from the soft Bellman residual, leading to a unique and well-defined so-called least-squares reward consistent with th...

D. Belomestny, Alexey Naumov, Sergey Samsonov · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.