The lab has open positions for interns, MS/PhD students, PhD students, postdocs, and research scientists. Apply.


August 23, 2026

Welcome Tigran Melkonyan

Please join me in welcoming Tigran Melkonyan as a new MS/PhD student in our lab!

Tigran started his university studies in Applied Mathematics at Yerevan State University, and then transferred to the American University of Armenia to focus on Computer Science. In 2024, his team reached the ICPC (International Collegiate Programming Contest) Northern Eurasia Finals.

He has research experience in communication delays and control-theoretic methods for synchronized drone operations, and in reaction-diffusion PDE modeling of epidemiological systems. Tigran already coauthored a paper: T. Melkonyan, A. Petrosyan, D. Hakobyan, S. Kumar, Comparative Study of Automated Lung Nodule Detection in Chest X-Ray Images Using Pretrained Deep Learning Models.

Tigran arrived to KAUST this weekend and is now attending orientation.

July 6, 2026

Paper accepted to JOTA

The paper was accepted to Journal of Optimization Theory and Applications (JOTA).

July 3, 2026

Attending ICML 2026 @ Seoul, Korea

I've just arrived to Seoul, Korea, to attend ICML 2026. Strange as it seems, this is my first time to Korea!

Several current (e.g., Abdurakhmon Sadiev, Egor Shulgin, Grigory Malinovsky, Ammar Mahran) and former (e.g., Martin Takáč, Robert Gower, Nicolas Loizou, Konstantin Mishchenko, Nikita Doikov, Adil Salim, Zhize Li, Mher Safaryan, Samuel Horváth, Alexander Tyurin, Slavomír Hanzely, Aleksandr Beznosikov, Rustem Islamov, Andrei Panferov, Kirill Acharya, Philip Zmushko) members of my lab are attending, too. We have several papers spanning the main conference and the workshops:


Further notable workshops:
Update: Back from Seoul. ICML ran July 6-11.

July 1, 2026

Welcome Xun Qian

Please join me in welcoming Xun Qian as a Research Scientist in our lab (from Shanghai)!

Xun was a postdoc with us from 2018 to 2021, and later a Research Scientist at JD Explore Academy in Beijing. Welcome back, Xun!

June 19, 2026

New Paper

New paper out: "Convergence Analysis of Muon-type Methods with Inexact LMO in the Degenerate Case" - joint work with Xun Qian.

We analyze Muon-type methods with an inexact linear minimization oracle in the degenerate case. arXiv:2606.21581

June 16, 2026

Back on campus

After a series of research visits and conference travel, I am now back at KAUST.

June 14, 2026

New Paper

New paper out: "SILAGE: Memory-Efficient, Full-Gradient-Free Nonconvex Optimization for Nested Finite Sums" - joint work with Igor Sokolov and Laurent Condat.

We propose SILAGE, a memory-efficient variance-reduced method for nested finite-sum nonconvex optimization. arXiv:2606.15832

June 8, 2026

Welcome Jan Niklas Kolzenburg

Please join me in welcoming Jan Niklas Kolzenburg as a new research intern in our lab! Jan Niklas is joining us from the Frankfurt School of Finance & Management.

June 2, 2026

New Paper

New paper out: "Demystifying Pipeline Parallelism: First Theory for PipeDream" - joint work with Ivan Ilin.

We give the first convergence theory for PipeDream-style pipeline parallelism. arXiv:2606.03498

June 1, 2026

Team Awards

Several members of my Optimization and Machine Learning Lab were recognized this year.

Dean's List at KAUST: Ammar Mahran (AMCS), Grigory Malinovsky (AMCS), Egor Shulgin (AMCS), Kaja Gruntkowska (Statistics), Abdurakhmon Sadiev (Computer Science), and Hanmin Li (Computer Science).

Igor Sokolov was named an ICLR 2026 Notable Reviewer.

Grigory Malinovsky received a Best Paper Award (runner-up) at the International Conference on Computational Optimization in Abu Dhabi, for the paper "Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction" (with Yury Demidovich).

May 30, 2026

DIS 2026 in Czechia

I am on my way to Ústí nad Labem, Czech Republic. On Tuesday (June 2nd), I'll deliver a plenary lecture at The 9th International Conference on Dynamics of Information Systems (DIS 2026). Haven't been to Czechia for many years -- very much looking forward!
Update: The plenary was on June 2.

May 26, 2026

New Paper

New paper out: "A Unified Primal-Dual Recipe for Accelerating Three-Operator Splitting Methods" - joint work with Abdurakhmon Sadiev and Laurent Condat.

We give a unified primal-dual recipe for accelerating three-operator splitting methods. arXiv:2605.26985

May 20, 2026

New Paper

New paper out: "LOSCAR-SGD: Local SGD with Communication-Computation Overlap and Delay-Corrected Sparse Model Averaging" - joint work with Yassine Maziane, Ammar Mahran, and Artavazd Maranjyan.

We study local SGD with communication-computation overlap and delay-corrected sparse model averaging. arXiv:2605.20866

May 18, 2026

New Paper

New paper out: "Distance-Aware Muon: Adaptive Step Scaling for Normalized Optimization" - joint work with Yury Demidovich, Abhishek Chakraborty, Grigory Malinovsky, and Angelia Nedić.

We develop adaptive step-scaling rules for Muon-type normalized optimizers. arXiv:2605.18999

May 18, 2026

New Paper

New paper out: "Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method" - joint work with Abdurakhmon Sadiev, Artavazd Maranjyan, and Ivan Ilin.

We introduce an asynchronous linear-minimization-oracle momentum method for heterogeneous distributed training. arXiv:2605.18174

May 13, 2026

New Paper

New paper out: "Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity" - joint work with Ammar Mahran and Artavazd Maranjyan.

We analyze rescaled asynchronous SGD and obtain optimal rates under data and system heterogeneity. arXiv:2605.13434

May 9, 2026

New Paper

New paper out: "Rennala MVR: Improved Time Complexity for Parallel Stochastic Optimization via Momentum-Based Variance Reduction" - joint work with Zhirayr Tovmasyan and Artavazd Maranjyan.

We improve the time complexity of parallel stochastic optimization via momentum-based variance reduction. arXiv:2605.08871

May 9, 2026

New Paper

New paper out: "Local LMO: Constrained Gradient Optimization via a Local Linear Minimization Oracle" - joint work with Kaja Gruntkowska and Hanmin Li.


We study constrained gradient optimization via a local linear minimization oracle. arXiv:2605.08850

May 5, 2026

Off to Sweden!

I am off to Lund, Sweden, to attend the ELLIIT Symposium on Optimization for Learning, with a lineup of star speakers. Together with Jeremy Bernstein (Thinking Machines), Jelena Diakonikolas (University of Wisconsin-Madison), Niao He (ETH Zurich) and Alp Yurtsever (Umeå University), I am on the scientific committee for this event. I am the opening speaker on May 6 -- will talk about new exciting work on Local LMO (a new projection-free method for constrained optimization based on a local variant of the linear minimization oracle), to be put on arXiv soon!

Update 1: Here are my slides:
Update 2: The paper is on arXiv now.

Update 3: A tweet / X post related to this method.

May 2, 2026

AISTATS 2026, Tangier, Morocco

Together with my PhD students Egor Shulgin and Abdurakhmon Sadiev, I am attending AISTATS 2026 in Tangier Morocco. We are presenting our papers:

May 1, 2026

Papers Accepted to ICML 2026

The following papers from my Optimization and Machine Learning Lab were accepted to ICML 2026, to be held in Seoul, South Korea, during July 6-11, 2026:
  • Artem Riabinin, Egor Shulgin, Kaja Gruntkowska, and Peter Richtárik. From Muon to Gluon: Bridging Theory and Practice of LMO-based Optimizers for LLMs.
  • Egor Shulgin, Tamaz Gadaev, Sarit Khirirat, and Peter Richtárik. Understanding MARS: When Scaling Momentum Provably Helps.
  • Egor Shulgin, Mohamed Awad, Peter Richtárik, and Eduard Gorbunov. General Analysis of LMO-based Optimizers: Beyond Bounded Variance.
See you in Seoul!

April 22, 2026

ICLR 2026, Rio de Janeiro, Brazil

Several members of my team are attending ICLR in Rio: Artavazd "Arto" Maranjyan, Kaja Gruntkowska, Alexander Gaponov, and Zhirayr Tovmasyan. They are presenting our papers:

April 15, 2026

New Paper

New paper out: "Broximal Alignment for Global Non-Convex Optimization" - joint work with Kaja Gruntkowska, Hanmin Li, and Xun Qian.

We propose Broximal Alignment, a condition under which the ball proximal point method converges to a global minimizer. arXiv:2604.13483

April 12, 2026

New Paper

New paper out: "Communication-Efficient Gluon in Federated Learning" - joint work with Xun Qian, Alexander Gaponov, and Grigory Malinovsky.

We develop communication-efficient variants of Gluon for federated learning. arXiv:2604.10689

April 10, 2026

New Paper

New paper out: "A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization" - joint work with Laurent Condat and Abdurakhmon Sadiev.

We propose a Nesterov-accelerated primal-dual splitting algorithm for convex nonsmooth optimization. arXiv:2604.09245

April 8-10, 2026

Keynote @ ICMI 2026

On April 9, I am giving a keynote at the IEEE 5th International Conference on Computing and Machine Intelligence (ICMI 2026), held at King Faisal University in Al-Ahsa, Kingdom of Saudi Arabia.

Update: Unfortunately, due to technical issues with internet connection, I was not able to deliver this remote/Zoom talk. I apologize to all conference participants!

April 3, 2026

New Paper

New paper out: "Stabilized Proximal Point Method via Trust Region Control" - joint work with Hanmin Li and Kaja Gruntkowska.

We study a trust-region stabilized proximal point method that yields linear descent without strong convexity. arXiv:2604.02943

March 24, 2026

New Paper

New paper out: "Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptions" - joint work with Rustem Islamov, Grigory Malinovsky, Alexander Gaponov, Aurelien Lucchi, and Eduard Gorbunov.

We propose a Byzantine-robust and differentially private federated method under weaker assumptions. arXiv:2603.23472

February 23, 2026

Opening Keynote @ Berkeley

I am visiting UC Berkeley again. This time, I am attending the Simons Institute Workshop on Learning from Heterogeneous Sources. The video recording of my opening keynote "From the Broximal Point Method to Efficient Training of LLMs" is on Youtube (it starts at 8' 50'').

January 25, 2026

Three Papers Accepted to ICLR 2026

The following papers from my Optimization and Machine Learning Lab were accepted to ICLR 2026, to be held in Rio de Janeiro, Brazil, during April 23-27, 2026: I am not sure yet if I will be able to travel. If I do, I'll see you in Rio!

January 24, 2026

Visiting Simons Institute @ Berkeley

I am on my way to Berkeley, to attend the Bootcamp jump-starting the Simons Institute Program on Federated and Collaborative Learning. On Monday, I will be giving a series of talks forming a tutorial on federated optimization.

Update: My lectures are available on Youtube: [Part 1 (72 mins)] [Part 2 (72 mins)] [Part 3 (65 mins)]

January 22, 2026

Two Papers Accepted to AISTATS 2026

The following papers from my Optimization and Machine Learning Lab were accepted to AISTATS 2026, to be held in Tangier, Morocco during May 2-5, 2026: I am not sure yet if I will be able to travel. If I do, I'll see you in Morocco!

January 18, 2026

New Paper

New paper out: "BiCoLoR: Communication-Efficient Optimization with Bidirectional Compression and Local Training" - joint work with Laurent Condat and Artavazd Maranjyan.

We introduce BiCoLoR, combining local training with bidirectional compression. arXiv:2601.12400

January 17, 2026

2023 Charles Broyden Prize

Together with three of my (then present and now former) KAUST PhD students
  • Samuel Horváth (now Assistant Professor at MBZUAI, Abu Dhabi),
  • Dmitry Kovalev (now Research Scientist at Yandex, Moscow),
  • Konstantin Mishchenko (now Research Scientist at Meta, Paris)
and collaborator
  • Sebastian U Stich (now Faculty at CISPA, Saarbrücken; who was visiting us at KAUST at the time)
we have won the 2023 Charles Broyden Prize for the paper Stochastic distributed learning with gradient quantization and double-variance reduction.

The Charles Broyden Prize is an annual international award honoring the best paper published in the journal Optimization Methods and Software (OMS) during the preceding year. Established in 2009, the prize commemorates the life and work of British mathematician Charles George Broyden (1933–2011), a pioneer in numerical optimization known for his namesake methods and his role in the development of the BFGS algorithm.

Here is the list of previous Charles Broyden Prize holders.

Personally, I consider this prize to be shared with i) the authors of the original 2019 "DIANA paper", which was the inspiration for the above award-winning follow-up work in which we polished, generalized and improved it, ii) the authors of the 2018 "SEGA paper", which can be seen as a single-node variant of DIANA, as well as iii) the authors of the even earlier 2018 "JacSketch paper", which was the inspiration for SEGA.

One can keep going like this, since every new discovery builds on prior work, but I'll stop here. So, once again, congrats to the authors of the award-winning paper, as well as to the authors of all these prior works!

Update (Jan 22): KAUST wrote a short news article about this: KAUST - LinkedIn - X.

Old News


Read old news (2025 and earlier)