Skip to content

Author

A. Gasnikov

We have 7 of 158 papers

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

Adaptive First-Order Methods with Composite Gradient Error

We study first-order optimization with inexact gradients whose errors combine a component proportional to the true gradient norm and a uniformly bounded absolute component. We develop an adaptive gradient descent scheme that selects estimates of the smoothness constant and both error parameters through a computable bac...

A. Vasin, A. Tyurin, A. Gasnikov · 0 citations
Preprint Sep 2026

Certified Residual Quasi-Newton Methods for Distributed Variational Inequalities

Second-order methods for smooth monotone variational inequalities reach the optimal rate $O(T^{-3/2})$, but a distributed exact Jacobian costs $d$ times more communication than an operator value. We show that similarity does part of the work for free: if the server's Jacobian differs from the global one by at most $\be...

Ewsey Obzherin, Roman M. Mozhaev, A. Gasnikov et al. · 0 citations
Preprint Sep 2026

Gradient-Free Methods for Stochastic Convex Optimization with Stochastic Functional Constraints

We develop accelerated gradient-free methods for stochastic convex optimization with constraints defined by expectations. Our batched primal-dual sliding method uses two-point evaluations sharing a random sample and guarantees expected objective error and expected maximum constraint violation at most $\varepsilon$. It...

Vadim Abronin, A. Gasnikov, D. Dvinskikh · 0 citations
Preprint Sep 2026

Application of Optimal Inexact Second-Order Acceleration to Distributed Stochastic Optimization under Statistical Similarity

We consider distributed stochastic convex optimization with a fixed budget of $N$ independent samples split among $m$ workers. Sample average approximation reduces the problem to a regularized finite-sum problem whose local Hessians are statistically similar. This allows the Hessian of the local objective at the server...

Yury A. Sokolov, Maxim Mashtaler, A. Gasnikov et al. · 0 citations
Preprint Sep 2026

Lower Bounds For Gradient-Free Convex Optimization And Convex-Concave Saddle-Point Problems

We study the query complexity of optimization with exact scalar-value information. For globally $L$-smooth convex functions on $\mathbb R^d$ with a minimizer in a Euclidean ball of radius $R$, we prove the lower bound $\Omega(d\min\{d,\sqrt{LR^2/\varepsilon}\})$ for adaptive randomized algorithms in the stated accuracy...

Y. Dorn, D. Dvinskikh, Т. В. Логінов et al. · 0 citations
Preprint Sep 2026

The Complexity of Convex Optimization with Mismatched Geometry

It is shown that for this mismatched problem the minimax value of the gap is of order $LR^2/N^3$ up to logarithmic factors, for deterministic and for randomized methods alike, and already in dimension proportional to the number of queries.

Т. В. Логінов, A. Gasnikov, Yuriy Dorn et al. · 0 citations
#machine learning Preprint Sep 2026

Clipped or Unclipped? Finite-Sample Trade-offs for Averaged SGD under Heavy-Tailed Noise

This work derives a finite-sample comparison of clipped and unclipped Polyak-Ruppert averaged SGD under finite conditional $p$-th moments, and gives explicit accuracy and confidence conditions under which, for $p>2$, the Gaussian term dominates the unclipped deviation bound, so clipping need not improve its leading ord...

A. Suvorikova, E. Gladin, D. Dvinskikh et al. · 0 citations

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