aiqbench analysis
This paper advances the theoretical foundations of differentially private wireless federated learning by removing restrictive convexity assumptions and accounting for gradient clipping in non-convex settings. The authors demonstrate that privacy loss can converge to a constant rather than diverging with iterations, providing explicit guarantees on the trade-off between utility and security under realistic device selection protocols. These findings offer critical insights into scaling private machine learning systems across wireless networks without compromising model convergence or data protection standards.
When Differential Privacy Meets Wireless Federated Learning: An Improved Analysis for Privacy and Convergence
arXiv:2603.19040v2 Announce Type: replace Abstract: Differentially private wireless federated learning (DPWFL) is a promising framework for protecting sensitive user data. However, foundational questions on how to precisely characterize privacy loss remain open, and existing work is further limited by convergence analyses that rely on restrictive convexity assumptions or ignore the effect of gradient clipping. To overcome these issues, we present a comprehensive analysis of privacy and convergence for DPWFL with general smooth non-convex loss objectives. Our analysis explicitly incorporates both device selection and mini-batch sampling, and shows that the privacy loss can converge to a constant rather than diverge with the number of iterations. Moreover, we establish convergence guarantees with gradient clipping and derive an explicit privacy-utility trade-off. Numerical results validate our theoretical findings.
Abstract:Differentially private wireless federated learning (DPWFL) is a promising framework for protecting sensitive user data. However, foundational questions on how to precisely characterize privacy loss remain open, and existing work is further limited by convergence analyses that rely on restrictive convexity assumptions or ignore the effect of gradient clipping. To overcome these issues, we present a comprehensive analysis of privacy and convergence for DPWFL with general smooth non-convex loss objectives. Our analysis explicitly incorporates both device selection and mini-batch sampling, and shows that the privacy loss can converge to a constant rather than diverge with the number of iterations. Moreover, we establish convergence guarantees with gradient clipping and derive an explicit privacy-utility trade-off. Numerical results validate our theoretical findings.
Machine Learning (cs.LG)
arXiv:2603.19040 [cs.LG]
(or arXiv:2603.19040v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2603.19040 Focus to learn more arXiv-issued DOI via DataCite
https://doi.org/10.1109/ICASSP55912.2026.11463544 Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 221 words
Related coverage
Mixed-Timescale Differential Coding for Downlink Model Broadcast in Wireless Federated Learning
arXiv · Jul 21, 2026

Introducing Claude for Teachers
Anthropic · Jul 14, 2026

Digital States 2026: AI Moves From Experiment to Infrastructure
govtech.com · Sep 24, 2026

Benn Jordan on Flock, privacy, and the new surveillance backlash
The Verge · Oct 15, 2026