← Back to all news
arXiv Machine Learning By Jun-Yi Meng, Zheng-Chu Guo, Yuan Mao

Generalization Analysis of Distributed Kernel-based Robust Gradient Descent Algorithms

Read the original on arXiv Machine Learning →

arXiv:2609. 11712v1 Announce Type: cross Abstract: In this paper, we investigate the generalization performance of distributed gradient descent algorithms in a reproducing kernel Hilbert space under a robust loss function $l_{\sigma}$.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Sep 14

High-Probability Convergence of SGD via Batched Updates

The paper introduces Batched SGD, a variant that groups online samples into epochs and performs a single update per epoch using a low‑variance gradient estimate. This batching approach allows a straightforward high‑probability analysis without restrictive assumptions or auxiliary sequences, yielding near‑optimal rates for both strongly convex and non‑convex objectives under standard smoothness and sub‑Gaussian noise conditions. The authors also extend the method to federated learning, providing the first high‑probability guarantees with logarithmic communication complexity, linear speedup in the number of agents, and robustness to data heterogeneity.

By Feng Zhu, Robert W. Heath Jr., Aritra Mitra
agents
More like this →
arXiv Machine Learning
Jul 30

Minimax-Optimal Generalization Bounds for Smooth Deep Neural Networks Trained by (Stochastic) Gradient Descent

arXiv:2606. 06772v2 Announce Type: replace-cross Abstract: Characterizing the optimization dynamics and statistical performance of over-parameterized deep neural networks (DNNs) remains a central challenge in understanding the remarkable success of deep learning.

By Junyu Zhou, Puyu Wang, Dennis Wagner, Yunwen Lei, Marius Kloft, Yiming Ying
More like this →
arXiv Machine Learning
Oct 21

On Johnson-Lindenstrauss Transforms for Byzantine-Robust Optimization

The paper investigates the use of Johnson‑Lindenstrauss (JL) transforms in Byzantine‑robust distributed optimization. By leveraging JL’s ability to preserve inner products and distances, worker messages are weighted based on their alignment with a trusted reference gradient, reducing communication costs while maintaining robustness. Experimental results support the theoretical claims.

By Aleksandr Shestakov, Vladimir Aletov, Aleksandr Beznosikov
safety
More like this →