PPaperPicks

Peter Richtárik

King Abdullah University of Science and Technology (KAUST), Thuwal, Saudi Arabia

32 papers at tracked venues · 24 at CORE A* · active 20242025

Venues

Frequent coauthors

Papers

  1. ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning
  2. Collaborative Value Function Estimation Under Model Mismatch: A Federated Temporal Difference Analysis
  3. Correlated Quantization for Faster Nonconvex Distributed Optimization
  4. ELF: Federated Langevin Algorithms with Primal, Dual and Bidirectional Compression
  5. Error Feedback under (L0, L1)-Smoothness: Normalization and Momentum
  6. HIGGS: Pushing the Limits of Large Language Model Quantization via the Linearity Theorem
  7. LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compression
  8. Local Curvature Descent: Squeezing More Curvature out of Standard and Polyak Gradient Descent
    NeurIPS 2025 · Peter Richtárik
  9. MAST: model-agnostic sparsified training
  10. Methods for Convex (L0, L1)-Smooth Optimization: Clipping, Acceleration, and Adaptivity
  11. Methods with Local Steps and Random Reshuffling for Generally Smooth Non-Convex Federated Optimization
  12. MindFlayer SGD: Efficient Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times
  13. Quantize Once, Train Fast: Allreduce-Compatible Compression with Provable Guarantees
  14. Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity
  15. Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits
  16. Byzantine Robustness and Partial Participation Can Be Achieved at Once: Just Clip Gradient Differences
  17. Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates
  18. Det-CGD: Compressed Gradient Descent with Matrix Stepsizes for Non-Convex Optimization
  19. Don't Compress Gradients in Random Reshuffling: Compress Gradient Differences
  20. Error Feedback Reloaded: From Quadratic to Arithmetic Mean of Smoothness Constants
    ICLR 2024 · Peter Richtárik
  21. FedP3: Federated Personalized and Privacy-friendly Network Pruning under Model Heterogeneity
  22. Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations
  23. High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise
  24. Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
  25. MicroAdam: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergence
  26. Minibatch Stochastic Three Points Method for Unconstrained Smooth Minimization
  27. On the Optimal Time Complexities in Decentralized Stochastic Asynchronous Optimization
  28. PV-Tuning: Beyond Straight-Through Estimation for Extreme LLM Compression
  29. Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
  30. The Power of Extrapolation in Federated Learning
  31. Towards a Better Theoretical Understanding of Independent Subnetwork Training
  32. Understanding Progressive Training Through the Framework of Randomized Coordinate Descent