Privacy-Aware Collaborative and Distributed Bayesian Optimization

• URL: http://arxiv.org/abs/2607.11600v1
• Date: Mon, 13 Jul 2026 14:25:04 GMT
• Title: Privacy-Aware Collaborative and Distributed Bayesian Optimization
• Abstract summary: We show gradient sharing leaks client observations, with leakage worsening as the search converges and queries concentrate near the optimum.<n>We evaluate a differentially private defense and characterize its privacy-utility trade-off.
• Score: 0.815557531820863
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a collaborative meta-learning framework for distributed Bayesian optimization matching centralized performance without raw-data exchange. We show gradient sharing leaks client observations, with leakage worsening as the search converges and queries concentrate near the optimum. We evaluate a differentially private defense and characterize its privacy-utility trade-off.

Related papers

• Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptions [89.52532304099522]
  Federated Learning (FL) enables clients to collaboratively train a shared model without centralizing their raw data, offering an inherent level of privacy.<n> gradients and model updates can still leak sensitive information, while malicious servers may mount adversarial attacks such as Byzantine manipulation.<n>These vulnerabilities highlight the need to address differential privacy (DP) and Byzantine robustness within a unified framework.<n>We propose Byz-Clip21-SGD2M, a new algorithm that integrates robust aggregation with double momentum and carefully designed clipping.
  arXiv  Detail & Related papers  (2026-03-24T17:39:09Z)
• Hybrid Federated and Split Learning for Privacy Preserving Clinical Prediction and Treatment Optimization [0.0]
  Collaborative clinical decision support is often constrained by governance and privacy rules that prevent pooling patient-level records across institutions.<n>We present a hybrid privacy-preserving framework that combines Federated Learning (FL) and Split Learning (SL) to support decision-oriented healthcare modeling without raw-data sharing.
  arXiv  Detail & Related papers  (2026-02-17T01:57:27Z)
• Optimal Transport Based Hyperspectral Unmixing for Highly Mixed Observations [0.0]
  We propose a novel approach for tackling the problem of highly mixed data in blind hyperspectral unmixing.<n>Our method constrains the distribution of the estimated abundance matrix to resemble a targeted Dirichlet distribution more closely.
  arXiv  Detail & Related papers  (2025-09-24T10:56:17Z)
• Collaborative Bayesian Optimization via Wasserstein Barycenters [11.41081495236219]
  We introduce a collaborative Bayesian optimization (BO) framework that addresses black-box optimization and data privacy challenges.<n>In this framework agents work collaboratively to optimize a function they only have oracle access to.<n>We prove that our proposed algorithm is numerically consistent and that its implementation via Monte Carlo methods is accurate.
  arXiv  Detail & Related papers  (2025-04-15T00:15:09Z)
• Preference-Guided Diffusion for Multi-Objective Offline Optimization [64.08326521234228]
  We propose a preference-guided diffusion model for offline multi-objective optimization.<n>Our guidance is a preference model trained to predict the probability that one design dominates another.<n>Our results highlight the effectiveness of classifier-guided diffusion models in generating diverse and high-quality solutions.
  arXiv  Detail & Related papers  (2025-03-21T16:49:38Z)
• Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems [8.419845742978985]
  This paper addresses the challenge of preserving privacy in Federated Learning (FL) within centralized systems. We devise methods that ensure Differential Privacy (DP) while maintaining optimal convergence rates for homogeneous and heterogeneous data distributions.
  arXiv  Detail & Related papers  (2024-07-17T08:19:58Z)
• Privacy-Preserving Optimal Parameter Selection for Collaborative Clustering [2.107610564835429]
  We focus on key clustering algorithms within a collaborative framework, where multiple data owners combine their data. A semi-trusted server assists in recommending the most suitable clustering algorithm and its parameters. Our findings indicate that the privacy parameter ($epsilon$) minimally impacts the server's recommendations, but an increase in $epsilon$ raises the risk of membership inference attacks.
  arXiv  Detail & Related papers  (2024-06-08T18:21:12Z)
• 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)
• Collaborative Mean Estimation over Intermittently Connected Networks with Peer-To-Peer Privacy [86.61829236732744]
  This work considers the problem of Distributed Mean Estimation (DME) over networks with intermittent connectivity. The goal is to learn a global statistic over the data samples localized across distributed nodes with the help of a central server. We study the tradeoff between collaborative relaying and privacy leakage due to the additional data sharing among nodes.
  arXiv  Detail & Related papers  (2023-02-28T19:17:03Z)
• FedLAP-DP: Federated Learning by Sharing Differentially Private Loss Approximations [53.268801169075836]
  We propose FedLAP-DP, a novel privacy-preserving approach for federated learning. A formal privacy analysis demonstrates that FedLAP-DP incurs the same privacy costs as typical gradient-sharing schemes. Our approach presents a faster convergence speed compared to typical gradient-sharing methods.
  arXiv  Detail & Related papers  (2023-02-02T12:56:46Z)
• 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)
• Optimizer Amalgamation [124.33523126363728]
  We are motivated to study a new problem named Amalgamation: how can we best combine a pool of "teacher" amalgamations into a single "student" that can have stronger problem-specific performance? First, we define three differentiable mechanisms to amalgamate a pool of analyticals by gradient descent. In order to reduce variance of the process, we also explore methods to stabilize the process by perturbing the target.
  arXiv  Detail & Related papers  (2022-03-12T16:07:57Z)

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.