Fairness and Privacy Guarantees in Federated Contextual Bandits

• URL: http://arxiv.org/abs/2402.03531v1
• Date: Mon, 5 Feb 2024 21:38:23 GMT
• Title: Fairness and Privacy Guarantees in Federated Contextual Bandits
• Authors: Sambhav Solanki, Shweta Jain, Sujit Gujar
• Abstract summary: We model the algorithm's effectiveness using fairness regret. We show that both Fed-FairX-LinUCB and Priv-FairX-LinUCB achieve near-optimal fairness regret.
• Score: 8.071147275221973
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper considers the contextual multi-armed bandit (CMAB) problem with fairness and privacy guarantees in a federated environment. We consider merit-based exposure as the desired fair outcome, which provides exposure to each action in proportion to the reward associated. We model the algorithm's effectiveness using fairness regret, which captures the difference between fair optimal policy and the policy output by the algorithm. Applying fair CMAB algorithm to each agent individually leads to fairness regret linear in the number of agents. We propose that collaborative -- federated learning can be more effective and provide the algorithm Fed-FairX-LinUCB that also ensures differential privacy. The primary challenge in extending the existing privacy framework is designing the communication protocol for communicating required information across agents. A naive protocol can either lead to weaker privacy guarantees or higher regret. We design a novel communication protocol that allows for (i) Sub-linear theoretical bounds on fairness regret for Fed-FairX-LinUCB and comparable bounds for the private counterpart, Priv-FairX-LinUCB (relative to single-agent learning), (ii) Effective use of privacy budget in Priv-FairX-LinUCB. We demonstrate the efficacy of our proposed algorithm with extensive simulations-based experiments. We show that both Fed-FairX-LinUCB and Priv-FairX-LinUCB achieve near-optimal fairness regret.

Related papers

• PFGuard: A Generative Framework with Privacy and Fairness Safeguards [14.504462873398461]
  PFGuard is a generative framework with privacy and fairness safeguards. It balances privacy-fairness conflicts between fair and private training stages. Experiments show that PFGuard successfully generates synthetic data on high-dimensional data.
  arXiv  Detail & Related papers  (2024-10-03T06:37:16Z)
• FedFDP: Fairness-Aware Federated Learning with Differential Privacy [21.55903748640851]
  Federated learning (FL) is a new machine learning paradigm to overcome the challenge of data silos. We first propose a fairness-aware federated learning algorithm, termed FedFair. We then introduce differential privacy protection to form the FedFDP algorithm to address the trade-offs among fairness, privacy protection, and model performance.
  arXiv  Detail & Related papers  (2024-02-25T08:35:21Z)
• Privacy for Fairness: Information Obfuscation for Fair Representation Learning with Local Differential Privacy [26.307780067808565]
  This study introduces a theoretical framework that enables a comprehensive examination of the interplay between privacy and fairness. We shall develop and analyze an information bottleneck (IB) based information obfuscation method with local differential privacy (LDP) for fair representation learning. In contrast to many empirical studies on fairness in ML, we show that the incorporation of LDP randomizers during the encoding process can enhance the fairness of the learned representation.
  arXiv  Detail & Related papers  (2024-02-16T06:35:10Z)
• Toward the Tradeoffs between Privacy, Fairness and Utility in Federated Learning [10.473137837891162]
  Federated Learning (FL) is a novel privacy-protection distributed machine learning paradigm. We propose a privacy-protection fairness FL method to protect the privacy of the client model. We conclude the relationship between privacy, fairness and utility, and there is a tradeoff between these.
  arXiv  Detail & Related papers  (2023-11-30T02:19:35Z)
• Incentivized Communication for Federated Bandits [67.4682056391551]
  We introduce an incentivized communication problem for federated bandits, where the server shall motivate clients to share data by providing incentives. We propose the first incentivized communication protocol, namely, Inc-FedUCB, that achieves near-optimal regret with provable communication and incentive cost guarantees.
  arXiv  Detail & Related papers  (2023-09-21T00:59:20Z)
• 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)
• On Differentially Private Federated Linear Contextual Bandits [9.51828574518325]
  We consider cross-silo federated linear contextual bandit (LCB) problem under differential privacy. We identify three issues in the state-of-the-art: (i) failure of claimed privacy protection and (ii) incorrect regret bound due to noise miscalculation. We show that our algorithm can achieve nearly optimal'' regret without a trusted server.
  arXiv  Detail & Related papers  (2023-02-27T16:47: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)
• Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
  We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
  arXiv  Detail & Related papers  (2022-07-19T05:47:30Z)
• Privacy Amplification via Shuffling for Linear Contextual Bandits [51.94904361874446]
  We study the contextual linear bandit problem with differential privacy (DP) We show that it is possible to achieve a privacy/utility trade-off between JDP and LDP by leveraging the shuffle model of privacy. Our result shows that it is possible to obtain a tradeoff between JDP and LDP by leveraging the shuffle model while preserving local privacy.
  arXiv  Detail & Related papers  (2021-12-11T15:23:28Z)
• Private Reinforcement Learning with PAC and Regret Guarantees [69.4202374491817]
  We design privacy preserving exploration policies for episodic reinforcement learning (RL) We first provide a meaningful privacy formulation using the notion of joint differential privacy (JDP) We then develop a private optimism-based learning algorithm that simultaneously achieves strong PAC and regret bounds, and enjoys a JDP guarantee.
  arXiv  Detail & Related papers  (2020-09-18T20:18:35Z)

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.