Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,694 papers · 148 categories

Trend · papers per month

count% of corpus
0111 · Feb 202219922001200920172026
2 results for “ClippedGossip”
Byzantine-Robust Decentralized Learning via ClippedGossipcs.LG

New algorithm improves decentralized learning in the presence of Byzantine faults.

problem Byzantine faults in decentralized learning on arbitrary graphs.
method Proposes ClippedGossip for Byzantine-robust consensus and optimization.
result First to provably converge to a specified neighborhood of the stationary point for non-convex objectives.
Byzantine fault toleranceDecentralized learningConsensusOptimizationClippedGossip
2022-02-03abs ↗pdf ↗
Unified Breakdown Analysis for Byzantine Robust Gossipmath.OC

Unified framework for Byzantine robust gossip algorithms with guaranteed performance.

problem Vulnerability of decentralized machine learning to misbehaving devices.
method Introduces F-RG framework and CS+ robust aggregation rule for Byzantine resilience.
result CS+-RG has near-optimal breakdown tolerance and outperforms existing methods.
Byzantine robustnessDecentralized learningGossip algorithmsRobust aggregationBreakdown point
2024-10-14abs ↗pdf ↗