2026· International Journal of Mathematical Analysis and Research· 0 citations
TL;DR
This work provides a unified approach for aiding the design of state-of-the-art privacy-preserving distributed learning systems that are also utility-optimal and is an important step towards using such approaches in high-stakes domains like healthcare or finance.
Abstract
Federated Learning (FL) has emerged as a revolutionary paradigm in distributed machine learning, enabling multiple decentralized clients to collaboratively train models without sharing their local raw data. Despite its inherent privacy-centric design, FL remains vulnerable to sophisticated privacy attacks, such as gradient leakage and membership inference, which can reconstruct sensitive user data from communicated model updates. In order to reduce these vulnerabilities, we integrate privacy-preserving mechanisms most notably Differential Privacy (DP) and Cryptographic Protocols into the training procedure. These privacy constraints, however, come with utility loss and convergence slowdown thus highlighting a basic conflict between (differential) privacy on one side and high-order model accuracy and efficiency at another. In our paper, we carefully examine how to use convex optimization methods systematically in terms of performing this rich multi-dimensional trade-off. We center around the rigorous implementation of privacy-preserving FL couched as a bounded convex optimization task, studying how traditional and state-of-the-art optimization algorithms retain strong convergence rates even under durable privacy constraints. We benchmark the performance of these primary optimization frameworks, such as FedAvg, FedProx, and Accelerated Gradient Methods, when adopted on different privacy budgets. Theoretically, we analyze the impact of differential privacy on gradient variance in algorithms and experimentally validate how adaptive optimization (Specifically by AMSGrad) and proximal regularization can account for this noise-induced increase to enable faster convergence with a tight guarantee of differential privacy. To summarize, this work provides a unified approach for aiding the design of state-of-the-art privacy-preserving distributed learning systems that are also utility-optimal and is an important step towards using such approaches in high-stakes domains like healthcare or finance.
This paper proposes a comprehensive framework for privacy-preserving feature engineering (PPFE) within federated learning analytics and explores techniques such as homomorphic encryption, differential privacy, and secure multi-party computation to enable robust, privacy-safe feature selection, transformation, and extraction across clients.
Yuki Nakamura, Olivia Martin· International Journal of Dat...· 0 citations
Federated learning is appealing for privacy-sensitive network systems, yet its practical deployment remains hindered by the following three recurring challenges: (1) client drift under non-IID data, (2) vulnerability to corrupted updates, and (3) the communication cost of repeated model exchange. Most existing approaches address these issues in isolation. While analytically convenient, this separation often fails to reflect real-world conditions. For instance, defenses against poisoning may suppress useful updates, while personalization and compression can alter the aggregation geometry itself. In this paper, we study these effects jointly and propose URP-FL, a compact training framework that integrates reliability-aware aggregation, local regularization for drift control, and sparse client uploads. We provide theoretical analysis establishing a convergence bound with distinct terms capturing optimization error, data heterogeneity, and adversarial impact. Experiments on a non-IID image classification benchmark with sign-flip and label-flip attacks demonstrate the benefits of the unified design. Compared to FedAvg and FedProx, this URP-FL maintains accuracy under attack while reducing transmitted parameters by approximately 75%. Rather than presenting a production ready system, it offers a reproducible and technically coherent step toward federated learning that is more robust under realistic conditions.
Hua Kun, Wei Wang· 2026 International Conferenc...· 0 citations
Federated learning (FL) enables collaborative model training across multiple clients in a privacy-preserving manner. However, the employment of homomorphic encryption algorithms might lead to high computational cost while the application of differential privacy (DP) methods would sacrifice model performance. To establish efficient and secure FL system as well as maintaining competitive performance, we introduce a DP-enabled cascaded filter with novel model-aggregation mechanism. Taking the model parameters of one client for example, dimensions with large absolute values and significant variations are selected by the cascaded filter and regarded as important dimensions. After that, random noise are added to these important dimensions for data security. Finally, the model parameters will be sent to the central server for aggregation. Unlike traditional DP-based approaches, our method considers each dimension’s informational importance, i.e., both absolute value and its variation. We theoretically prove the convergence of our method and verify the effectiveness on different scenarios including four datasets. The experimental results suggest that our method outperforms the other ones from literature under both IID and non-IID conditions while achieving high level of efficiency and privacy protection performance.
Zhiqiang Chen, Yuchen Jiang, Ray Y. Zhong et al.· IEEE Transactions on Informa...· 0 citations
Deep learning is becoming popular in cloud applications and serves to provide intelligent services; data aggregation in a central location makes sensitive information vulnerable to privacy breaches, regulatory infractions, and adversarial manipulation. All modern privacy mechanisms offer partial protection and frequently lack accuracy, scalability, or practicality in their operations. To overcome these limitations, a federated deep learning model is formulated so that secure joint learning can occur without transferring raw data across the domains of ownership. The framework incorporates training that is decentralized, training that uses differential privacy, training that uses secure aggregation, training that uses encrypted communication, and training that uses trust-based anomaly defense to defend against leakage, poisoning, and inference attacks. It also supports heterogeneous and highly non-IID datasets using adaptive coordination and stability-relevant participation regulation and meets emerging data protection requirements. The methods of resource-conscious orchestration and the optimization of communication eliminate overhead without obstructing the effectiveness of learning. The paradigm has therefore formed a privacy-by-design intelligent cloud ecosystem which ensures confidentiality, maintains performance, enhances robustness, and ensures responsible AI implementation in privacy-related sectors of healthcare, finance, governance, and smart infrastructure.
Sribidhya Mohanty, Pallavi Gupta, Anil Pratap Singh et al.· 2026 International Conferenc...· 0 citations
Federated learning is a decentralised machine-learning approach in which several clients jointly build a shared model without moving their raw data to one location. Rising concerns around privacy, tightening regulation, and restrictions on how data may be owned or shared have made this approach increasingly attractive in practice. Although federated learning lowers privacy exposure relative to centralised training, deploying it in practice is complicated by clients whose data are unevenly distributed and non-identically distributed, by clients that participate inconsistently, and by training that can converge unpredictably. To obtain global models that train reliably and consistently even when client data are heterogeneous, this work puts forward a federated learning system built around privacy preservation. The design follows a client–server pattern in which a coordinating server aggregates updates from local models using weights that account for imbalance among participants. The behaviour of the resulting system is examined methodically across several data-distribution regimes — IID, mildly non-IID, and severely non-IID. The experiments show that the framework converges reliably and delivers predictive accuracy that holds up well, especially in the more difficult non-IID cases. Compared with conventional federated learning baselines, the approach shows greater robustness and steadier performance across successive training rounds. Because it is simple to implement, repeatable, and built with real deployment in mind, the architecture suits privacy-sensitive, decentralised use cases such as distributed intelligent systems, industrial monitoring, and healthcare analytics.
Shyam Patel, S. Khan· 2026 International Conferenc...· 0 citations
Differential privacy (DP) mechanisms have been widely adopted in federated learning (FL) to enhance model security. However, existing approaches predominantly employ uniform privacy budgets, neglecting personalized requirements arising from heterogeneous user privacy preferences. Such uniform privacy configurations typically necessitate compliance with the most stringent budget, which not only leads to the wasteful underutilization of privacy budgets for certain clients but also compromises overall model utility. To address this limitation, we propose FedSPA, a Subspace Projection Aggregation personalized differential private Federated learning framework. The proposed method conducts singular value decomposition operations on noise-perturbed local models to extract singular value vectors as compact representations of both model structure and privacy noise. The server then clusters clients and identifies a consensus subspace for projecting models with varying noise levels, ultimately aggregating the global model through a residual-aware mechanism. This method not only effectively guides the aggregation of client personalized differential privacy but also reduces communication overhead. Extensive experiments demonstrate the model's effectiveness. Additionally, we provide theoretical proof of the privacy and convergence of FedSPA. Experimental results also showcase its superior performance over personalized DP-FL baselines.
Tianchi Liao, Xiaojun Deng, Lele Fu et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
