activity
20232026
most citedAccelerated Zeroth-order Method for Non-Smooth Stochastic Convex Optimization Problem with Infinite Variance

3 citations · 4 across the 8 of their papers we have counts for

collaborators
Showing math.OCShow all

6 papers · 1 filter

math.OC2025

On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients

Artem Vasin, Valery Krivchenko, Dmitry Kovalev +6

First-order methods for minimization and saddle point (min-max) problems are widely used for solving large-scale problems, in particular arising in machine learning. The majority o…

math.OC2025

Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under -Smoothness

Nikita Kornilov, Philip Zmushko, Andrei Semenov +3

In recent years, non-convex optimization problems are more often described by generalized -smoothness assumption rather than standard one. Meanwhile, severely corrupted…

math.OC2024

Median Clipping for Zeroth-order Non-Smooth Convex Optimization and Multi-Armed Bandit Problem with Heavy-tailed Symmetric Noise

Nikita Kornilov, Yuriy Dorn, Aleksandr Lobanov +5

In this paper, we consider non-smooth convex optimization with a zeroth-order oracle corrupted by symmetric stochastic noise. Unlike the existing high-probability results requiring…

math.OC2023★ 3 cited

Accelerated Zeroth-order Method for Non-Smooth Stochastic Convex Optimization Problem with Infinite Variance

Nikita Kornilov, Ohad Shamir, Aleksandr Lobanov +5

In this paper, we consider non-smooth stochastic convex optimization with two function evaluations per round under infinite noise variance. In the classical setting when noise has…

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

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…