Talks and Poster Presentations

2026

  1. Swiss Optimization SymposiumAugust 23–27, 2026
    Monte Verità · Ascona, Switzerland
    Poster: Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity [poster]
  2. Lagune Barra Hotel · Rio de Janeiro, Brazil
    Talk: Controlling Delay in Asynchronous SGD: Optimality for Any Data Regime [video] [slides]
  3. Riocentro Convention and Event Center · Rio de Janeiro, Brazil
    Poster: Ringleader ASGD: The First Asynchronous SGD with Optimal Time Complexity under Data Heterogeneity [poster]
  4. KAUST, Saudi Arabia
    Posters:
    • Ringleader ASGD: The First Asynchronous SGD with Optimal Time Complexity under Data Heterogeneity [poster]
    • Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity [poster]
    • ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning [poster]

2025

  1. AMCS/STAT graduate seminar November 13, 2025
    KAUST, Saudi Arabia
    Talk: First Provably Optimal Asynchronous SGD for Homogeneous and Heterogeneous Data [slides]
  2. KAUST, Saudi Arabia
    Posters:
    • Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity [poster]
    • ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning [poster]
  3. KAUST, Saudi Arabia
    Talk: Ringleader ASGD: The First Asynchronous SGD with Optimal Time Complexity under Data Heterogeneity [slides]
  4. 35º Colóquio Brasileiro de Matemática July 27–August 1, 2025
    Instituto Nacional de Matemática Pura e Aplicada (IMPA) · Rio de Janeiro, Brazil
    Talk and poster: Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity [slides] [poster]
  5. Rio Othon Palace · Rio de Janeiro, Brazil
    Poster: MindFlayer SGD: Efficient Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times [poster]
  6. Vancouver Convention Center · Vancouver, Canada
    Posters:
    • Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity [poster]
    • ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning [poster]
  7. KAUST, Saudi Arabia
    Poster: ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning [poster]
  8. Singapore EXPO · Singapore
    Poster: LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compression (ICLR 2025 Spotlight, top 5.1%) [poster]
  9. FLOW Talk #126 · Online
    Talk: Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity [video] [slides]
  10. KAUST, Saudi Arabia
    Poster: ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning [poster]
  11. YSU Krisp-AI Lab · Yerevan, Armenia
    Talk: Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity [slides]
  12. Flower AI Summit 2025 March 26, 2025
    King's House · London, England
    Talk: Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity [slides]
  13. Beihang University (BUAA) · Beijing, China
    Invited by Jiaxin Xie to give a talk on Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity [slides]
  14. Optimization Seminar March 13, 2025
    Beijing Institute of Mathematical Sciences and Applications (BIMSA) · Beijing, China
    Invited by Yi-Shuai Niu to give a talk on Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity [slides]
  15. Seminar March 12, 2025
    Peking University · Beijing, China
    Invited by Kun Yuan to give a talk on Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity [slides]
  16. AMCS/STAT graduate seminar February 27, 2025
    KAUST
    Talk: Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity [slides]

2024

  1. Vancouver Convention Center · Vancouver, Canada
    Presented
    • MindFlayer: Efficient Asynchronous Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times (Oral, Top 5%) [video] [poster]
    • Differentially Private Random Block Coordinate Descent [poster]
    • LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compression
  2. MLR Weekly SeminarNovember 21, 2024
    Machine Learning Research at Apple · Online
    Invited by Samy Bengio to give a talk on MindFlayer: Efficient Asynchronous Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times [slides]
  3. Yerevan State University · Online
    Talk: MindFlayer: Efficient Asynchronous Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times
  4. CEMSE E-Poster Competition October 10, 2024
    KAUST, Saudi Arabia
    Poster: GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity [3rd place]
  5. Yerevan State University · Yerevan, Armenia
    Talk: MindFlayer: Efficient Asynchronous Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times [abstract]
  6. KAUST, Saudi Arabia
    Poster: GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity [poster]
  7. CS 331, Stochastic Gradient Descent MethodsMay 5, 2024
    KAUST, Saudi Arabia
    Delivered a guest lecture on MindFlayer: Efficient Asynchronous Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times
  8. Okinawa Institute of Science and Technology (OIST) · Okinawa, Japan
    Poster: GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity [poster]
  9. KAUST, Saudi Arabia
    Poster: GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity [poster]

2023

  1. Group SeminarNovember 16, 2023
    KAUST, Saudi Arabia
    Talk: Differentially Private Coordinate Descent for Composite Empirical Risk Minimization
  2. University of Warwick · Coventry, England
    Talk: GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity [slides]
  3. Yerevan State University · Yerevan, Armenia
    Talk: GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity [abstract]
  4. Yerevan State University · Yerevan, Armenia
    Talk: GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity [video (Armenian)]

2022

  1. FLOW Talk #88 · Online
    Talk: GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity [video]
  2. Yerevan State University · Yerevan, Armenia
    Talk: ProxSkip: Yes! Local Gradient Steps Provably Lead to Communication Acceleration! Finally!