Saved in:
Bibliographic Details
Main Authors: Li, Huaicheng, Zhao, Junhui, Quan, Haoyu, Wang, Xiaoming
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2604.24103
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917439146557440
author Li, Huaicheng
Zhao, Junhui
Quan, Haoyu
Wang, Xiaoming
author_facet Li, Huaicheng
Zhao, Junhui
Quan, Haoyu
Wang, Xiaoming
contents Federated learning (FL) offers a promising distributed learning paradigm for internet of vehicles (IoV) applications. However, it faces challenges from communication overhead and dynamic environments. Model compression techniques reduce computing and communication burden yet create trade-offs between compression ratios and vehicle participation strategies. In this paper, we propose a lightweight FL algorithm named federated learning with dynamic low-rank adaptation (Fed-DLoRA), which is combined with low-rank adaptation (LoRA) to effectively reduce parameters and communication costs while enhancing training efficiency. The convergence analysis of Fed-DLoRA is conducted through stochastic gradient descent optimization coupled with singular value decomposition. This analysis establishes the theoretical relationships among LoRA rank, vehicular scheduling strategies and the model's convergence characteristics. Building on these insights, we formulate a joint optimization problem aimed at maximizing system performance. To address this problem, we propose an adaptive rank, bandwidth and vehicle selection (ARBVS) algorithm that integrates enumeration with greedy optimization strategies. The algorithm provides efficient rank selection and resource scheduling strategies for each FL communication round, thereby achieving effective performance improvements for the FL system. Experimental results demonstrate that Fed-DLoRA achieves superior performance compared to conventional federated learning approaches, exhibiting enhanced accuracy, faster convergence, and improved communication efficiency.
format Preprint
id arxiv_https___arxiv_org_abs_2604_24103
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Fed-DLoRA: Efficient Wireless Federated Learning with Dynamic Low-Rank Adaptation
Li, Huaicheng
Zhao, Junhui
Quan, Haoyu
Wang, Xiaoming
Machine Learning
Systems and Control
I.2.6; I.2.11; C.2.4; C.2.1
Federated learning (FL) offers a promising distributed learning paradigm for internet of vehicles (IoV) applications. However, it faces challenges from communication overhead and dynamic environments. Model compression techniques reduce computing and communication burden yet create trade-offs between compression ratios and vehicle participation strategies. In this paper, we propose a lightweight FL algorithm named federated learning with dynamic low-rank adaptation (Fed-DLoRA), which is combined with low-rank adaptation (LoRA) to effectively reduce parameters and communication costs while enhancing training efficiency. The convergence analysis of Fed-DLoRA is conducted through stochastic gradient descent optimization coupled with singular value decomposition. This analysis establishes the theoretical relationships among LoRA rank, vehicular scheduling strategies and the model's convergence characteristics. Building on these insights, we formulate a joint optimization problem aimed at maximizing system performance. To address this problem, we propose an adaptive rank, bandwidth and vehicle selection (ARBVS) algorithm that integrates enumeration with greedy optimization strategies. The algorithm provides efficient rank selection and resource scheduling strategies for each FL communication round, thereby achieving effective performance improvements for the FL system. Experimental results demonstrate that Fed-DLoRA achieves superior performance compared to conventional federated learning approaches, exhibiting enhanced accuracy, faster convergence, and improved communication efficiency.
title Fed-DLoRA: Efficient Wireless Federated Learning with Dynamic Low-Rank Adaptation
topic Machine Learning
Systems and Control
I.2.6; I.2.11; C.2.4; C.2.1
url https://arxiv.org/abs/2604.24103