collaborators

7 papers

cs.LG2026

One-Step Gradient Delay is Not a Barrier for Large-Scale Asynchronous Pipeline Parallel LLM Pretraining

Philip Zmushko, Egor Petrov, Nursultan Abdullaev +2

Modern large-scale LLM pretraining benefits from utilizing Pipeline Parallelism; however, synchronous implementations leave GPUs idle during pipeline bubbles, wasting computational…

cs.LG2026

Preconditioned Norms: A Unified Framework for Steepest Descent, Quasi-Newton and Adaptive Methods

Andrey Veprikov, Arman Bolatov, Aleksandr Bogdanov +4

Optimization lies at the core of modern deep learning, yet existing methods often face a fundamental trade-off between adapting to problem geometry and leveraging curvature utiliza…

cs.LG2025

MT-DAO: Multi-Timescale Distributed Adaptive Optimizers with Local Updates

Alex Iacob, Andrej Jovanovic, Mher Safaryan +6

Training large models with distributed data parallelism (DDP) requires frequent communication of gradients across workers, which can saturate bandwidth. Infrequent communication st…

math.OC2025

Loss-Transformation Invariance in the Damped Newton Method

Alexander Shestakov, Sushil Bohara, Samuel Horváth +2

The Newton method is a powerful optimization algorithm, valued for its rapid local convergence and elegant geometric properties. However, its theoretical guarantees are usually lim…

cs.LG2025

Differentially Private Clipped-SGD: High-Probability Convergence with Arbitrary Clipping Level

Saleh Vatan Khah, Savelii Chezhegov, Shahrokh Farahmand +2

Gradient clipping is a fundamental tool in Deep Learning, improving the high-probability convergence of stochastic first-order methods like SGD, AdaGrad, and Adam under heavy-taile…

math.OC2025

Convergence of Clipped-SGD for Convex -Smooth Optimization with Heavy-Tailed Noise

Savelii Chezhegov, Aleksandr Beznosikov, Samuel Horváth +1

Gradient clipping is a widely used technique in Machine Learning and Deep Learning (DL), known for its effectiveness in mitigating the impact of heavy-tailed noise, which frequentl…