activity
20142026
most citedComputational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm

66 citations · 450 across the 76 of their papers we have counts for

collaborators
Showing 2023Show all

6 papers · 1 filter

math.OC2023★ 3 cited

High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise

Eduard Gorbunov, Abdurakhmon Sadiev, Marina Danilova +5

High-probability analysis of stochastic first-order optimization methods under mild assumptions on the noise has been gaining a lot of attention in recent years. Typically, gradien…

math.OC2023

Accuracy Certificates for Convex Minimization with Inexact Oracle

Egor Gladin, Alexander Gasnikov, Pavel Dvurechensky

Accuracy certificates for convex minimization problems allow for online verification of the accuracy of approximate solutions and provide a theoretically valid online stopping crit…

math.OC2023★ 1 cited

Intermediate Gradient Methods with Relative Inexactness

Nikita Kornilov, Eduard Gorbunov, Mohammad Alkousa +3

This paper is devoted to first-order algorithms for smooth convex optimization with inexact gradients. Unlike the majority of the literature on this topic, we consider the setting…

math.OC2023

Algorithms for Euclidean-regularised Optimal Transport

Dmitry A. Pasechnyuk, Michael Persiianov, Pavel Dvurechensky +1

This paper addresses the Optimal Transport problem, which is regularized by the square of Euclidean -norm. It offers theoretical guarantees regarding the iteration complexi…

math.OC2023

Gradient-Free Methods for Non-Smooth Convex Stochastic Optimization with Heavy-Tailed Noise on Convex Compact

Nikita Kornilov, Alexander Gasnikov, Pavel Dvurechensky +1

We present two easy-to-implement gradient-free/zeroth-order methods to optimize a stochastic non-smooth function accessible only via a black-box. The methods are built upon efficie…

math.OC2023★ 5 cited

High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance

Abdurakhmon Sadiev, Marina Danilova, Eduard Gorbunov +5

During recent years the interest of optimization and machine learning communities in high-probability convergence of stochastic optimization methods has been growing. One of the ma…