2025 Talks

  • Lemont, United States
    Argonne National Laboratory
    May 1, 2025
    Talk: Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization Under Function Similarity
  • Optimization Seminar
    Beijing, China
    Beijing Institute of Mathematical Sciences and Applications (BIMSA)
    April 24, 2025
    Talk: Improving the worst-case bidirectional communication complexity for nonconvex distributed optimization under function similarity (invited by Yi-Shuai Niu)
  • Center for ML Research Seminar
    Beijing, China
    Peking University
    April 22, 2025
    Talk: Freya PAGE. First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations (invited by Kun Yuan)
  • Academic Report of the School of Mathematical Sciences
    Beijing, China
    Beihang University
    April 21, 2025
    Talk: Improving the worst-case bidirectional communication complexity for nonconvex distributed optimization under function similarity (invited by Jiaxin Xie)
  • Tsinghua University
    April 16, 2025
    Talk: Freya PAGE. First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations (invited by Yang Yuan)
  • Thuwal, Saudi Arabia
    KAUST
    March 6, 2025
    Talk: The Ball-Proximal (="Broximal") Point Method

2024 Talks

  • Thuwal, Saudi Arabia
    KAUST
    December 2, 2024
    Talk: Freya PAGE. First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations

2023 Talks