SeedFlood: A Step Toward Scalable Decentralized Fine-Tuning of LLMs
Not on the map. Why?
Abstract (arXiv)
This work presents SeedFlood, a new approach to decentralized LLM fine-tuning designed to scale across large models, large collaborations, and complex network topologies while achieving global consensus with negligible communication overhead. Traditional methods suffer from high communication costs that grow with model size, while information decay over network hops renders global consensus inefficient. SeedFlood takes a significant departure from these practices by exploiting the seed-reconstructible structure of zeroth-order gradients and effectively making the messages to transmit near-zero in size, allowing them to be flooded to every client in the network, and thereby enhancing scalability of decentralized training. Consequently, SeedFlood enables training in regimes previously considered impractical, such as billion-parameter scale models or distributed across hundred of clients. Our experiments on decentralized LLM fine-tuning demonstrate that SeedFlood consistently outperforms the standard zeroth-order baselines in both communication efficiency and generalization performance, and even achieves results comparable to first-order gossip-based methods in large-scale settings, while requiring orders-of-magnitude less communication cost. We also provide theoretical analysis to formalize that SeedFlood avoids topology-dependent consensus terms in the convergence bound while retaining the acceleration enabled by increased client participation.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 48 of its 64 references that are in the map. First posted on arXiv 20 Feb 2026.
Builds on
48 of 64 references.
References · 48
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2025Qwen3 Technical Reportcited by 8,820
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
- 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
- 2023Instruction-Following Evaluation for Large Language Modelscited by 1,228
- 2024Tulu 3: Pushing Frontiers in Open Language Model Post-Trainingcited by 1,053
- 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 903
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
36 more
- 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 502
- 2018Sparsified SGD with Memorycited by 376
- 2018WiC: the Word-in-Context Dataset for Evaluating Context-Sensitive Meaning Representationscited by 372
- 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 367
- 2023Fine-Tuning Language Models with Just Forward Passescited by 345
- 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 221
- 2018ReCoRD: Bridging the Gap between Human and Machine Commonsense Reading Comprehensioncited by 200
- 2024Improving LoRA in Privacy-preserving Federated Learningcited by 161
- 2021Decentralized Federated Averagingcited by 114
- 2018Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimizationcited by 111
- 2022Petals: Collaborative Inference and Fine-tuning of Large Modelscited by 87
- 2023DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Trainingcited by 76
- 2023SWARM Parallelism: Training Large Models Can Be Surprisingly Communication-Efficientcited by 59
- 2021Distributed Deep Learning in Open Collaborationscited by 58
- 2023Federated Full-Parameter Tuning of Billion-Sized Language Models with Communication Cost under 18 Kilobytescited by 55
- 2024Variance-reduced Zeroth-Order Methods for Fine-Tuning Language Modelscited by 54
- 2024Enhancing Zeroth-order Fine-tuning for Language Models with Low-rank Structurescited by 50
- 2021Consensus Control for Decentralized Deep Learningcited by 49
- 2022BEER: Fast O(1/T) Rate for Decentralized Nonconvex Optimization with Communication Compressioncited by 41
- 2021RelaySum for Decentralized Deep Learning on Heterogeneous Datacited by 39
- 2020PowerGossip: Practical Low-Rank Communication Compression in Decentralized Deep Learningcited by 35
- 2023A Survey on Decentralized Federated Learningcited by 27
- 2024Zeroth-Order Fine-Tuning of LLMs in Random Subspacescited by 26
- 2019textttDeepSqueeze: Decentralization Meets Error-Compensated Compressioncited by 22
- 2023Just One Byte (per gradient): A Note on Low-Bandwidth Decentralized Language Model Finetuning Using Shared Randomnesscited by 18
- 2025Decentralized Low-Rank Fine-Tuning of Large Language Modelscited by 14
- 2025FZOO: Fast Zeroth-Order Optimizer for Fine-Tuning Large Language Models towards Adam-Scale Speedcited by 14
- 2017Zeroth Order Nonconvex Multi-Agent Optimization over Networkscited by 13
- 2021Zeroth-Order Algorithms for Stochastic Distributed Nonconvex Optimizationcited by 13
- 2024Achieving Dimension-Free Communication in Federated Learning via Zeroth-Order Optimizationcited by 13
- 2025Refining Adaptive Zeroth-Order Optimization at Easecited by 12
- 2023Beyond Exponential Graph: Communication-Efficient Topologies for Decentralized Learning via Finite-time Convergencecited by 9
- 2024Towards Faster Decentralized Stochastic Optimization with Communication Compressioncited by 5
- 2025ADF-LoRA: Alternating Low-Rank Aggregation for Decentralized Federated Fine-Tuningcited by 4
- 2025On the Surprising Effectiveness of a Single Global Merging in Decentralized Learningcited by 3
- 2024AdaGossip: Adaptive Consensus Step-size for Decentralized Deep Learning with Communication Compressioncited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.