Skip to content

Author

D. Belomestny

6 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
Aug 2026

Beyond Marginal Validity: Finite-Sample Guarantees for Localized Conformal Prediction

High-probability bounds are proved, uniform over a realized localization neighbourhood, for the conditional-coverage gap and the length error relative to the oracle and uniform local guarantees decompose into fixed-score calibration and uniform score-estimation errors, showing that improved learning sharpens localized...

Anton Conrad, R. Isaev, D. Belomestny et al. · 0 citations
#machine learning Preprint Sep 2026

Conformalized Quantile Regression and Minimax Limits of Fixed-Score Calibration under Known Covariate Shift

In this paper, we study nonasymptotic $L^p$ error bounds for interval length and conditional coverage in split conformalized quantile regression (CQR). Our bounds rely on local regularity conditions and accuracy guarantees for the estimated quantiles. We further instantiate our bounds for quantile regression with spars...

R. Isaev, Anton Conrad, D. Belomestny et al. · 0 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
Review Jul 2026

Mathematical methods of reinforcement learning

Reinforcement learning (RL) is increasingly grounded in tools from probability, optimization, and operator theory. This survey organizes the mathematical structures that underpin the design and analysis of modern algorithms in RL. We begin from Markov decision processes (MDPs) and Bellman operators, emphasizing contrac...

D. Belomestny, Alexander V. Gasnikov, E. Gladin et al. · 0 citations
#machine learning Preprint Aug 2026

Uniform Statistical Convergence of Empirical Sinkhorn Potentials with Exponential and Polynomial Dependence on the Regularization Parameter

We study the empirical Sinkhorn estimator of the entropic optimal transport potentials under the uniform loss. Since the potentials are only unique up to additive constants, we measure the error using the quotient supremum norm, defined as $d_\infty([u],[v]) = \inf_{a\in\mathbb{R}}\|u-v-a\|_\infty$. For a fixed regular...

D. Belomestny · 0 citations

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