Oct 2026· IEEE Transactions on Mobile Computing· Vol 25, pp. 18814-18831· 0 citations· 72 references
Abstract
Edge devices handle sensitive user data, raising significant security and privacy concerns when shared with data collectors for downstream learning tasks. One potential solution leverages differentially private generative models, keeping original data on user devices and creating obfuscated variants for transmission. However, this approach presents two challenges: 1) Obfuscated data that closely resembles the original compromises privacy, whereas excessive dissimilarity diminishes its utility. 2) Diverse computing capabilities of edge devices hinder deploying such models across hardware platforms. To address these issues, we first introduce Differential Privacy with Adaptive Clipping and Noise Scaling (DP-ACNS), which dynamically adjusts privacy parameters to better balance privacy and utility than conventional DP training. Next, to overcome deployment challenges, we propose a two-stage Neural Architecture Search (NAS) approach. In Stage 1, we utilize DP-ACNS to centrally train an over-parameterized network on proxy data. Following this, we iteratively apply symmetric pruning with subsequent knowledge distillation to generate pretrained architectures. In Stage 2, we conduct a feedback-driven evolutionary search to identify optimal architectures that meet edge computational constraints, and adapt them via minimal fine-tuning on target devices. Experimental results demonstrate that our approach effectively balances privacy and utility while maintaining performance across diverse computational environments in edge computing.
CoVeil is proposed, a defense mechanism which dynamically optimizes transmitted signals to suppress leakage during decoding time while preserving the collaborative quality, and consistently improves the privacy-utility trade-off over existing baselines by reducing data leakage.
Ke-Jia Zhang, Tianyuan Zou, Zi-Xuan Gu et al.· 0 citations
Cloud-based Large Language Model (LLM) inference services typically require users to submit plain-text inputs, thereby posing severe privacy risks. Existing privacy-preserving paradigms are mostly task-specific and often necessitate pervasive modifications to the entire server-side model. This reliance introduces subst...
Wentao Zhong, Yu-Ting Li, Di-Cong Yu et al.· IEEE Transactions on Informa...· 0 citations
The augmented multi-party shuffle DP (AMP-SDP) model is proposed, which re-architects the data pipeline with a lightweight, versatile secret-shared intermediary layer that decentralizes trust while minimizing online communication costs and provides structural security hardening against both shuffler compromise and user-sid...
Wentao Dong, Yang Cao, Cong Wang et al.· 0 citations
Federated learning (FL) trains a shared model across data holders that cannot pool their records, but deployments remain bounded by three coupled costs: uplink traffic from repeated model exchange, accuracy loss under statistically heterogeneous clients, and the information that updates still leak. These are usually at...
Harshavardhan Peddireddy, Sandeep Kumar Gadde, Prasad Bheemavarapu et al.· 2026 International Conferenc...· 0 citations
This work addresses leakage through a learned obfuscate-and-recover scheme that protects participants' private datasets while still allowing an independently deployable model to be trained on the server side, making split-based federated LLM fine-tuning practically viable.
Heng Jin, Chao-Yu Zhang, He-Xuan Yu et al.· 1 citation
Related blog posts
Microsoft Research Blog· microsoft.comOct 29, 2026
Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.