When Evolutionary Computation Meets Privacy
- URL: http://arxiv.org/abs/2304.01205v1
- Date: Wed, 22 Mar 2023 15:22:15 GMT
- Title: When Evolutionary Computation Meets Privacy
- Authors: Bowen Zhao, Wei-Neng Chen, Xiaoguo Li, Ximeng Liu, Qingqi Pei, Jun
Zhang
- Abstract summary: evolutionary computation combined with privacy protection is becoming an emerging topic.
Privacy concerns in evolutionary computation lack a systematic exploration, especially for the object, motivation, position, and method of privacy protection.
This paper adopts BOOM to characterize the object and motivation of privacy protection in three typical optimization paradigms.
- Score: 33.38530737746583
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Recently, evolutionary computation (EC) has been promoted by machine
learning, distributed computing, and big data technologies, resulting in new
research directions of EC like distributed EC and surrogate-assisted EC. These
advances have significantly improved the performance and the application scope
of EC, but also trigger privacy leakages, such as the leakage of optimal
results and surrogate model. Accordingly, evolutionary computation combined
with privacy protection is becoming an emerging topic. However, privacy
concerns in evolutionary computation lack a systematic exploration, especially
for the object, motivation, position, and method of privacy protection. To this
end, in this paper, we discuss three typical optimization paradigms (i.e.,
\textit{centralized optimization, distributed optimization, and data-driven
optimization}) to characterize optimization modes of evolutionary computation
and propose BOOM to sort out privacy concerns in evolutionary computation.
Specifically, the centralized optimization paradigm allows clients to outsource
optimization problems to the centralized server and obtain optimization
solutions from the server. While the distributed optimization paradigm exploits
the storage and computational power of distributed devices to solve
optimization problems. Also, the data-driven optimization paradigm utilizes
data collected in history to tackle optimization problems lacking explicit
objective functions. Particularly, this paper adopts BOOM to characterize the
object and motivation of privacy protection in three typical optimization
paradigms and discusses potential privacy-preserving technologies balancing
optimization performance and privacy guarantees in three typical optimization
paradigms. Furthermore, this paper attempts to foresee some new research
directions of privacy-preserving evolutionary computation.
Related papers
- Discovering Preference Optimization Algorithms with and for Large Language Models [50.843710797024805]
offline preference optimization is a key method for enhancing and controlling the quality of Large Language Model (LLM) outputs.
We perform objective discovery to automatically discover new state-of-the-art preference optimization algorithms without (expert) human intervention.
Experiments demonstrate the state-of-the-art performance of DiscoPOP, a novel algorithm that adaptively blends logistic and exponential losses.
arXiv Detail & Related papers (2024-06-12T16:58:41Z) - End-to-End Learning for Fair Multiobjective Optimization Under
Uncertainty [55.04219793298687]
The Predict-Then-Forecast (PtO) paradigm in machine learning aims to maximize downstream decision quality.
This paper extends the PtO methodology to optimization problems with nondifferentiable Ordered Weighted Averaging (OWA) objectives.
It shows how optimization of OWA functions can be effectively integrated with parametric prediction for fair and robust optimization under uncertainty.
arXiv Detail & Related papers (2024-02-12T16:33:35Z) - Towards Efficient Exact Optimization of Language Model Alignment [93.39181634597877]
Direct preference optimization (DPO) was proposed to directly optimize the policy from preference data.
We show that DPO derived based on the optimal solution of problem leads to a compromised mean-seeking approximation of the optimal solution in practice.
We propose efficient exact optimization (EXO) of the alignment objective.
arXiv Detail & Related papers (2024-02-01T18:51:54Z) - A Data-Driven Evolutionary Transfer Optimization for Expensive Problems
in Dynamic Environments [9.098403098464704]
Data-driven, a.k.a. surrogate-assisted, evolutionary optimization has been recognized as an effective approach for tackling expensive black-box optimization problems.
This paper proposes a simple but effective transfer learning framework to empower data-driven evolutionary optimization to solve dynamic optimization problems.
Experiments on synthetic benchmark test problems and a real-world case study demonstrate the effectiveness of our proposed algorithm.
arXiv Detail & Related papers (2022-11-05T11:19:50Z) - Data-driven evolutionary algorithm for oil reservoir well-placement and
control optimization [3.012067935276772]
Generalized data-driven evolutionary algorithm (GDDE) is proposed to reduce the number of simulation runs on well-placement and control optimization problems.
Probabilistic neural network (PNN) is adopted as the classifier to select informative and promising candidates.
arXiv Detail & Related papers (2022-06-07T09:07:49Z) - Decentralized Stochastic Optimization with Inherent Privacy Protection [103.62463469366557]
Decentralized optimization is the basic building block of modern collaborative machine learning, distributed estimation and control, and large-scale sensing.
Since involved data, privacy protection has become an increasingly pressing need in the implementation of decentralized optimization algorithms.
arXiv Detail & Related papers (2022-05-08T14:38:23Z) - Distributed Reinforcement Learning for Privacy-Preserving Dynamic Edge
Caching [91.50631418179331]
A privacy-preserving distributed deep policy gradient (P2D3PG) is proposed to maximize the cache hit rates of devices in the MEC networks.
We convert the distributed optimizations into model-free Markov decision process problems and then introduce a privacy-preserving federated learning method for popularity prediction.
arXiv Detail & Related papers (2021-10-20T02:48:27Z) - Bilevel Optimization for Differentially Private Optimization in Energy
Systems [53.806512366696275]
This paper studies how to apply differential privacy to constrained optimization problems whose inputs are sensitive.
The paper shows that, under a natural assumption, a bilevel model can be solved efficiently for large-scale nonlinear optimization problems.
arXiv Detail & Related papers (2020-01-26T20:15:28Z)
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.