activity
20242026
collaborators

7 papers

math.OC2026

Stochastic Optimization and Data Science

Arutyun Avetisyan, Darina Dvinskikh, Alexander Gasnikov +3

This paper aims to motivate stochastic optimization problems from a statistical perspective and a statistical learning perspective, where the goal is to maximize the log-likelihood…

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

CaCuTe: Casual Cubic-Model Technique for Faster Optimization

Nazarii Tupitsa

We establish a local rate for the gradient update under a -Hessian--Lipschitz assumption. Regime det…

cs.LG2025

Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad

Sayantan Choudhury, Nazarii Tupitsa, Nicolas Loizou +3

Adaptive methods are extremely popular in machine learning as they make learning rate tuning less expensive. This paper introduces a novel optimization algorithm named KATE, which…

math.OC2024

Methods for Convex -Smooth Optimization: Clipping, Acceleration, and Adaptivity

Eduard Gorbunov, Nazarii Tupitsa, Sayantan Choudhury +4

Due to the non-smoothness of optimization problems in Machine Learning, generalized smoothness assumptions have been gaining a lot of attention in recent years. One of the most pop…

cs.CL2024

Low-Resource Machine Translation through the Lens of Personalized Federated Learning

Viktor Moskvoretskii, Nazarii Tupitsa, Chris Biemann +3

We present a new approach called MeritOpt based on the Personalized Federated Learning algorithm MeritFed that can be applied to Natural Language Tasks with heterogeneous data. We…