Probably Approximately Correct Federated Learning
- URL: http://arxiv.org/abs/2304.04641v4
- Date: Fri, 19 May 2023 14:00:13 GMT
- Title: Probably Approximately Correct Federated Learning
- Authors: Xiaojin Zhang, Anbu Huang, Lixin Fan, Kai Chen, Qiang Yang
- Abstract summary: Federated learning (FL) is a new distributed learning paradigm with privacy, utility, and efficiency as its primary pillars.
Existing research indicates that it is unlikely to simultaneously attain infinitesimal privacy leakage, utility loss, and efficiency.
How to find an optimal trade-off solution is the key consideration when designing the FL algorithm.
- Score: 20.85915650297227
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Federated learning (FL) is a new distributed learning paradigm, with privacy,
utility, and efficiency as its primary pillars. Existing research indicates
that it is unlikely to simultaneously attain infinitesimal privacy leakage,
utility loss, and efficiency. Therefore, how to find an optimal trade-off
solution is the key consideration when designing the FL algorithm. One common
way is to cast the trade-off problem as a multi-objective optimization problem,
i.e., the goal is to minimize the utility loss and efficiency reduction while
constraining the privacy leakage not exceeding a predefined value. However,
existing multi-objective optimization frameworks are very time-consuming, and
do not guarantee the existence of the Pareto frontier, this motivates us to
seek a solution to transform the multi-objective problem into a
single-objective problem because it is more efficient and easier to be solved.
To this end, we propose FedPAC, a unified framework that leverages PAC learning
to quantify multiple objectives in terms of sample complexity, such
quantification allows us to constrain the solution space of multiple objectives
to a shared dimension, so that it can be solved with the help of a
single-objective optimization algorithm. Specifically, we provide the results
and detailed analyses of how to quantify the utility loss, privacy leakage,
privacy-utility-efficiency trade-off, as well as the cost of the attacker from
the PAC learning perspective.
Related papers
- Data-Efficient Interactive Multi-Objective Optimization Using ParEGO [6.042269506496206]
Multi-objective optimization seeks to identify a set of non-dominated solutions that provide optimal trade-offs among competing objectives.
In practical applications, decision-makers (DMs) will select a single solution that aligns with their preferences to be implemented.
We propose two novel algorithms that efficiently locate the most preferred region of the Pareto front in expensive-to-evaluate problems.
arXiv Detail & Related papers (2024-01-12T15:55:51Z) - A Theoretical Analysis of Efficiency Constrained Utility-Privacy
Bi-Objective Optimization in Federated Learning [23.563789510998333]
Federated learning (FL) enables multiple clients to collaboratively learn a shared model without sharing their individual data.
Differential privacy has emerged as a prevalent technique in FL, safeguarding the privacy of individual user data while impacting utility and training efficiency.
This paper systematically formulates an efficiency-constrained utility-privacy bi-objective optimization problem in DPFL.
arXiv Detail & Related papers (2023-12-27T12:37:55Z) - Privacy-preserving Federated Primal-dual Learning for Non-convex and Non-smooth Problems with Model Sparsification [51.04894019092156]
Federated learning (FL) has been recognized as a rapidly growing area, where the model is trained over clients under the FL orchestration (PS)
In this paper, we propose a novel primal sparification algorithm for and guarantee non-smooth FL problems.
Its unique insightful properties and its analyses are also presented.
arXiv Detail & Related papers (2023-10-30T14:15:47Z) - Theoretically Principled Federated Learning for Balancing Privacy and
Utility [61.03993520243198]
We propose a general learning framework for the protection mechanisms that protects privacy via distorting model parameters.
It can achieve personalized utility-privacy trade-off for each model parameter, on each client, at each communication round in federated learning.
arXiv Detail & Related papers (2023-05-24T13:44:02Z) - Optimizing Privacy, Utility and Efficiency in Constrained
Multi-Objective Federated Learning [20.627157142499378]
We develop two improved CMOFL algorithms based on NSGA-II and PSL.
We design specific measurements of privacy leakage, utility loss, and training cost for three privacy protection mechanisms.
Empirical experiments conducted under each of the three protection mechanisms demonstrate the effectiveness of our proposed algorithms.
arXiv Detail & Related papers (2023-04-29T17:55:38Z) - Preference-Aware Constrained Multi-Objective Bayesian Optimization [32.95116113569985]
This paper addresses the problem of constrained multi-objective optimization over black-box objective functions with practitioner-specified preferences over the objectives when a large fraction of the input space is infeasible (i.e., violates constraints)
The key challenges include the huge size of the design space, multiple objectives and large number of constraints, and the small fraction of feasible input designs which can be identified only after performing expensive simulations.
We propose a novel and efficient preference-aware constrained multi-objective Bayesian optimization approach referred to as PAC-MOO to address these challenges.
arXiv Detail & Related papers (2023-03-23T04:46:49Z) - Privacy-Preserving Joint Edge Association and Power Optimization for the
Internet of Vehicles via Federated Multi-Agent Reinforcement Learning [74.53077322713548]
We investigate the privacy-preserving joint edge association and power allocation problem.
The proposed solution strikes a compelling trade-off, while preserving a higher privacy level than the state-of-the-art solutions.
arXiv Detail & Related papers (2023-01-26T10:09:23Z) - Joint Entropy Search for Multi-objective Bayesian Optimization [0.0]
We propose a novel information-theoretic acquisition function for BO called Joint Entropy Search.
We showcase the effectiveness of this new approach on a range of synthetic and real-world problems in terms of the hypervolume and its weighted variants.
arXiv Detail & Related papers (2022-10-06T13:19:08Z) - Penalized Proximal Policy Optimization for Safe Reinforcement Learning [68.86485583981866]
We propose Penalized Proximal Policy Optimization (P3O), which solves the cumbersome constrained policy iteration via a single minimization of an equivalent unconstrained problem.
P3O utilizes a simple-yet-effective penalty function to eliminate cost constraints and removes the trust-region constraint by the clipped surrogate objective.
We show that P3O outperforms state-of-the-art algorithms with respect to both reward improvement and constraint satisfaction on a set of constrained locomotive tasks.
arXiv Detail & Related papers (2022-05-24T06:15:51Z) - Decentralized Personalized Federated Learning for Min-Max Problems [79.61785798152529]
This paper is the first to study PFL for saddle point problems encompassing a broader range of optimization problems.
We propose new algorithms to address this problem and provide a theoretical analysis of the smooth (strongly) convex-(strongly) concave saddle point problems.
Numerical experiments for bilinear problems and neural networks with adversarial noise demonstrate the effectiveness of the proposed methods.
arXiv Detail & Related papers (2021-06-14T10:36:25Z) - Combining Deep Learning and Optimization for Security-Constrained
Optimal Power Flow [94.24763814458686]
Security-constrained optimal power flow (SCOPF) is fundamental in power systems.
Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs.
This paper proposes a novel approach that combines deep learning and robust optimization techniques.
arXiv Detail & Related papers (2020-07-14T12:38:21Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.