About the journal
Browse
Collections
Multimedia collections
Authors & reviewers
Balanced and efficient federated inference of large language models
Lulu ZHANG , Qian TAO , Zimu ZHOU , Yuanyuan ZHANG , Yuxiang WANG , Yongxin TONG
Front. Comput. Sci. ›› 2026, Vol. 20 ›› Issue (11) : 2011631
Large language models have shown significant performance across various tasks. This paper focuses on federated LLM inference, in which the context generated by silos requires being protected, resulting in both inefficiency and imbalance in communication overhead. To address this issue, this paper proposes BEFI, enabling Balanced and Efficient Federated LLM Inference equipped with carefully designed mechanisms for information sharing among silos. For important tokens, we propose a fine-grained, fixed-size cache sharing mechanism that enables direct and balanced sharing of the KV cache of these tokens. For less critical tokens, we propose a context-free intermediate state sharing mechanism, which allows for the sharing of tokens of arbitrary length with constant communication overhead. Finally, we evaluate the effectiveness of BEFI across various LLMs and privacy mechanisms, demonstrating that BEFI reduces communication overheads by up to 96.0%, while maintaining balanced communication.
large language model / inference optimization / federated learning
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
Mohtashami A, Jaggi M. Landmark attention: random-access infinite context length for transformers. 2023, arXiv preprint arXiv: 2305.16300 |
| [11] |
|
| [12] |
|
| [13] |
Beltagy I, Peters M E, Cohan A. Longformer: the long-document transformer. 2020, arXiv preprint arXiv: 2004.05150 |
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
Wang H, Zhang Z, Han S. SpAtten: Efficient Sparse Attention Architecture with Cascade Token and Head Pruning. In: The the 27th IEEE International Symposium on High-Performance Computer Architecture. 2021, 97-110 |
| [19] |
|
| [20] |
|
| [21] |
Touvron H, Martin L, Stone K, Albert P, Almahairi A, Babaei Y, Bashlykov N, Batra S, Bhargava P, Bhosale S, Bikel D, Blecher L, Canton Ferrer C, Chen M, Cucurull G, Esiobu D, Fernandes J, Fu J, Fu W, Fuller B, Gao C, Goswami V, Goyal N, Hartshorn A, Hosseini S, Hou R, Inan H, Kardas M, Kerkez V, Khabsa M, Kloumann I, Korenev A, Koura P S, Lachaux M, Lavril T, Lee J, Liskovich D, Lu Y, Mao Y, Martinet X, Mihaylov T, Mishra P, Molybog I, Nie Y, Poulton A, Reizenstein J, Rungta R, Saladi K, Schelten A, Silva R, Smith E M, Subramanian R, Tan X E, Tang B, Taylor R, Williams A, Kuan J X, Xu P, Yan Z, Zarov I, Zhang Y, Fan A, Kambadur M, Narang S, Rodriguez A, Stojnic R, Edunov S, Scialom T. Llama 2: open foundation and fine-tuned chat models. 2023, arXiv preprint arXiv: 2307.09288 |
| [22] |
Jiang A Q, Sablayrolles A, Mensch A, Bamford C, Chaplot D S, de Las Casas D, Bressand F, Lengyel G, Lample G, Saulnier L, Lavaud L R, Lachaux M A, Stock P, Le Scao T, Lavril T, Wang T, Lacroix T, El Sayed W. Mistral 7B. 2023, arXiv preprint arXiv: 2310.06825 |
| [23] |
Almazrouei E, Alobeidli H, Alshamsi A, Cappelli A, Cojocaru R, Debbah M, Goffinet E, Hesslow D, Launay J, Malartic Q, Mazzotta D, Noune B, Pannier B, Penedo G. The falcon series of open language models. 2023, arXiv preprint arXiv: 2311.16867 |
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
Zhao P, Shen L, Fan R, Li Q, Wu H, Wu J, Liu Z. Learning with user-level local differential privacy. 2024, arXiv preprint arXiv: 2405.17079 |
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
Blocki J, Blum A, Datta A, Sheffet O. The johnson-lindenstrauss transform itself preserves differential privacy. In: Proceedings of 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science. 2012, 410−419 |
| [40] |
|
| [41] |
Upadhyay J. Randomness efficient fast-Johnson-lindenstrauss transform with applications in differential privacy and compressed sensing. 2015, arXiv preprint arXiv: 1410.2470 |
| [42] |
|
| [43] |
|
| [44] |
|
| [45] |
Zhang Z, Zhang J, Huang J, Qu L, Zhang H, Wang Q, Zhou X, Xu Z. FewFedPIT: towards privacy-preserving and few-shot federated instruction tuning. 2024, arXiv preprint arXiv: 2403.06131 |
| [46] |
Wu C, Li X, Wang J. Vulnerabilities of foundation model integrated federated learning under adversarial threats. 2025, arXiv preprint arXiv: 2401.10375v1 |
| [47] |
|
| [48] |
|
| [49] |
|
| [50] |
|
| [51] |
Liu Z, Li D, Fernandez-Marques J, Laskaridis S, Gao Y, Dudziak Ł, Li S Z, Hu S X, Hospedales T M. Federated learning for inference at anytime and anywhere. 2022, arXiv preprint arXiv: 2212.04084 |
| [52] |
|
| [53] |
Kovaleva O, Romanov A, Rogers A, Rumshisky A. Revealing the dark secrets of BERT. In: Proceedings of 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing. 2019, 4365−4374 |
| [54] |
Child R, Gray S, Radford A, Sutskever I. Generating long sequences with sparse transformers. 2019, arXiv preprint arXiv: 1904.10509 |
| [55] |
|
| [56] |
|
| [57] |
Xu Y, Jie Z, Dong H, Wang L, Lu X, Zhou A, Saha A, Xiong C, Sahoo D. ThinK: thinner key cache by query-driven pruning. In: Proceedings of the 13th International Conference on Learning Representations. 2025 |
| [58] |
|
| [59] |
|
| [60] |
|
| [61] |
|
| [62] |
Gao B, Pavel L. On the properties of the softmax function with application in game theory and reinforcement learning. 2018, arXiv preprint arXiv: 1704.00805 |
Higher Education Press
/
| 〈 |
|
〉 |