CAFL-L: Constraint-Aware Federated Learning with Lagrangian Dual Optimization for On-Device Language Models
Not on the map. Why?
Abstract (arXiv)
We introduce Constraint-Aware Federated Learning with Lagrangian Dual Optimization (CAFL-L), a principled extension of FedAvg that explicitly incorporates device-level resource constraints including energy, communication, memory, and thermal budgets. CAFL-L employs Lagrangian dual optimization to dynamically adapt training hyperparameters -- freezing depth, local steps, batch size, and communication compression -- while preserving training stability through token-budget preservation via gradient accumulation. Experiments on a character-level language model demonstrate that CAFL-L achieves superior constraint satisfaction compared to standard FedAvg (reducing memory usage by 20% and communication by 95%) while maintaining competitive validation performance, making it practical for deployment on resource-constrained edge devices.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 5 of its 9 references that are in the map. First posted on arXiv 29 Sep 2025.
Builds on
5 of 9 references.
References · 5
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,538
- 2019FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantizationcited by 356
- 2018Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goalscited by 103
- 2024Parameter Competition Balancing for Model Mergingcited by 72
Built on by
Citing papers per year: 2026: 1.
1 paper.