Hugging Face Trending Papers August 2, 2026

Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap

Read the original on Hugging Face Trending Papers →

In recent years, the prevalence of large-scale data-sets and the demand for sophisti-cated learning models have necessitated the development of efficient distributed ma-chine learning (ML) solutions. Convergence speed is a critical factor influencing the practicality and effectiveness of these distributed frameworks.

Summary generated by The Flow from the publisher's feed. The full article lives at Hugging Face Trending Papers.

arXiv Machine Learning

Aug 4

Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap

arXiv:2608. 01220v1 Announce Type: cross Abstract: In recent years, the prevalence of large-scale data-sets and the demand for sophisti-cated learning models have necessitated the development of efficient distributed ma-chine learning (ML) solutions.

By Mohammadreza Doostmohammadian, Amir Ahmad Ghods, Alireza Aghasi, Zulfiya R. Gabidullina, Hamid R. Rabiee

arXiv Machine Learning

Jul 15

The Limits and Potentials of Local SGD for Distributed Heterogeneous Learning with Intermittent Communication

arXiv:2405. 11667v2 Announce Type: replace Abstract: Local SGD is a popular optimization method in distributed learning, often outperforming other algorithms in practice, including mini-batch SGD.

By Kumar Kshitij Patel, Margalit Glasgow, Ali Zindari, Lingxiao Wang, Sebastian U. Stich, Ziheng Cheng, Nirmit Joshi, Nathan Srebro

arXiv Machine Learning

Jul 31

First-order Constrained Trilevel Optimization Over Distributed Networks for Robust Coreset Selection

arXiv:2607. 27632v1 Announce Type: new Abstract: With the rapid advancement of the Internet of Things (IoT), massive amounts of data are generated across distributed edge networks.

By Yang Jiao (Richard), Kaixuan Jiao (Richard), Kai Yang (Richard), Nadjib Aitsaadi (Richard), Ilhem Fajjari (Richard), Renwei (Richard), Li

safety

arXiv Machine Learning

Aug 10

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization

arXiv:2608. 06563v1 Announce Type: new Abstract: Machine learning and optimization have advanced together, with practical demands motivating new theory and theoretical breakthroughs enabling new applications.

By Grigory Malinovsky

fine-tuning

arXiv Machine Learning

Jun 5

Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms

arXiv:2508. 00775v2 Announce Type: replace-cross Abstract: The design of many classical optimization algorithms is driven by the certification of linear convergence rates over classes of optimization problems.

By Andrea Martin, Ian R. Manchester, Luca Furieri

rag

arXiv Machine Learning

Jun 2

Mirror Descent Under Generalized Smoothness

arXiv:2502. 00753v4 Announce Type: replace-cross Abstract: Smoothness is crucial for attaining fast rates in first-order optimization.

By Dingzhi Yu, Wei Jiang, Hongyi Tao, Yuanyu Wan, Lijun Zhang

llms benchmarks

Related stories

Using Non-Lipschitz Signum-based Functions for Distributed Optimization and Machine Learning: Trade-off Between Con-vergence Rate and Optimality Gap

The Limits and Potentials of Local SGD for Distributed Heterogeneous Learning with Intermittent Communication

First-order Constrained Trilevel Optimization Over Distributed Networks for Robust Coreset Selection

Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization

Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms

Mirror Descent Under Generalized Smoothness