3 citations · 10 across the 14 of their papers we have counts for
19 papers
Optimal Parameter-Free Second-order Acceleration with Inexact Hessians under Generalized Smoothness
Artem Agafonov, Aslan Ashabokov, Alexander D'yakonov +3
We study second-order convex optimization under generalized Hessian smoothness, where the local Hessian Lipschitz constant may grow linearly with the gradient norm. For inexact Hes…
Clipped or Unclipped? Finite-Sample Trade-offs for Averaged SGD under Heavy-Tailed Noise
Alexandra Suvorikova, Egor Gladin, Darina Dvinskikh +5
Gradient clipping is widely used to stabilize training, but it need not improve the statistical accuracy of averaged SGD, even under heavy-tailed noise. We derive a finite-sample c…
Smooth or Separable? Sparse Block Acceleration for Entropy-Regularized Linear Programs
Irina Podlipnova, Maxim Mashtaler, Artem Agafonov +2
We study entropy-regularized linear programs with sparse affine constraints and compare two exact dual representations induced by whether a redundant normalization constraint is re…
Application of Optimal Inexact Second-Order Acceleration to Distributed Stochastic Optimization under Statistical Similarity
Yury A. Sokolov, Maxim K. Mashtaler, Alexander V. Gasnikov +3
We consider distributed stochastic convex optimization with a fixed budget of independent samples split among workers. Sample average approximation reduces the problem to a…
Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees
Artem Agafonov, Vladislav Ryspayev, Samuel Horváth +3
Quasi-Newton methods are widely used for solving convex optimization problems due to their ease of implementation, practical efficiency, and strong local convergence guarantees. Ho…
OPTAMI: Global Superlinear Convergence of High-order Methods
Dmitry Kamzolov, Dmitry Pasechnyuk, Artem Agafonov +2
Second-order methods for convex optimization outperform first-order methods in terms of theoretical iteration convergence, achieving rates up to for highly-smooth funct…
Exploring Jacobian Inexactness in Second-Order Methods for Variational Inequalities: Lower Bounds, Optimal Algorithms and Quasi-Newton Approximations
Artem Agafonov, Petr Ostroukhov, Roman Mozhaev +5
Variational inequalities represent a broad class of problems, including minimization and min-max problems, commonly found in machine learning. Existing second-order and high-order…
Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness
Artem Agafonov, Dmitry Kamzolov, Alexander Gasnikov +4
We present a new accelerated stochastic second-order method that is robust to both gradient and Hessian inexactness, which occurs typically in machine learning. We establish theore…
Cubic Regularization is the Key! The First Accelerated Quasi-Newton Method with a Global Convergence Rate of for Convex Functions
Dmitry Kamzolov, Klea Ziu, Artem Agafonov +1
In this paper, we propose the first Quasi-Newton method with a global convergence rate of for general convex functions. Quasi-Newton methods, such as BFGS, SR-1, are we…
Learning Confident Classifiers in the Presence of Label Noise
Asma Ahmed Hashmi, Aigerim Zhumabayeva, Nikita Kotelevskii +4
The success of Deep Neural Network (DNN) models significantly depends on the quality of provided annotations. In medical image segmentation, for example, having multiple expert ann…
FLECS-CGD: A Federated Learning Second-Order Framework via Compression and Sketching with Compressed Gradient Differences
Artem Agafonov, Brahim Erraji, Martin Takáč
In the recent paper FLECS (Agafonov et al, FLECS: A Federated Learning Second-Order Framework via Compression and Sketching), the second-order framework FLECS was proposed for the…
Exploiting higher-order derivatives in convex optimization methods
Dmitry Kamzolov, Alexander Gasnikov, Pavel Dvurechensky +2
Exploiting higher-order derivatives in convex optimization is known at least since 1970's. In each iteration higher-order (also called tensor) methods minimize a regularized Taylor…
FLECS: A Federated Learning Second-Order Framework via Compression and Sketching
Artem Agafonov, Dmitry Kamzolov, Rachael Tappenden +2
Inspired by the recent work FedNL (Safaryan et al, FedNL: Making Newton-Type Methods Applicable to Federated Learning), we propose a new communication efficient second-order framew…
An Accelerated Second-Order Method for Distributed Stochastic Optimization
Artem Agafonov, Pavel Dvurechensky, Gesualdo Scutari +4
We consider distributed stochastic optimization problems that are solved with master/workers computation architecture. Statistical arguments allow to exploit statistical similarity…
Inexact Tensor Methods and Their Application to Stochastic Convex Optimization
Artem Agafonov, Dmitry Kamzolov, Pavel Dvurechensky +2
We propose general non-accelerated and accelerated tensor methods under inexact information on the derivatives of the objective, analyze their convergence rate. Further, we provide…
Lower bounds for conditional gradient type methods for minimizing smooth strongly convex functions
Artem Agafonov
In this paper, we consider conditional gradient methods. These are methods that use a linear minimization oracle, which, for a given vector , computes the solut…
Inexact Relative Smoothness and Strong Convexity for Optimization and Variational Inequalities by Inexact Model
Fedor Stonyakin, Alexander Tyurin, Alexander Gasnikov +7
In this paper, we propose a general algorithmic framework for first-order methods in optimization in a broad sense, including minimization problems, saddle-point problems, and vari…
Gradient Methods for Problems with Inexact Model of the Objective
Fedor Stonyakin, Darina Dvinskikh, Pavel Dvurechensky +8
We consider optimization methods for convex minimization problems under inexact information on the objective function. We introduce inexact model of the objective, which as a parti…
Inexact Model: A Framework for Optimization and Variational Inequalities
Fedor Stonyakin, Alexander Gasnikov, Alexander Tyurin +6
In this paper we propose a general algorithmic framework for first-order methods in optimization in a broad sense, including minimization problems, saddle-point problems and variat…