Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Recent (6 mo)
0
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

ML×1Crypto×1Optimization and Control×1

Frequent co-authors

Rustem Islamov1×
Alexander Gaponov1×
Aurelien Lucchi1×
Peter Richtárik1×
Eduard Gorbunov1×

Research Timeline

2026
Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptions

The paper proposes Byz-Clip21-SGD2M, a novel algorithm that achieves high-probability convergence guarantees for Federated Learning by integrating robust aggregation, double momentum, and clipping, relaxing restrictive assumptions found in prior work.

Highlighted terms show continued research focus across papers

Papers