paper-with-me

홈 › Papers

Probably Approximately Correct Federated Learning

2023-04-10 · Xiaojin Zhang, Anbu Huang, Lixin Fan, Kai Chen, Qiang Yang

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.

📄 PDF Abstract BibTeX arXiv:2304.04641

Code (0)

등록된 구현이 없습니다.

Tasks

Federated LearningPAC learning

Similar Papers 제목 키워드 기반

On the Usability of Probably Approximately Correct Implication Bases

2017-01-04 · Daniel Borchmann, Tom Hanika, Sergei Obiedkov

We revisit the notion of probably approximately correct implication bases from the literature and present a first formulation in the language of formal concept analysis, with the goal to investigate whether such bases re…

Federated PAC-Bayesian Learning on Non-IID data

2023-09-13 · Zihao Zhao, Yang Liu, Wenbo Ding, Xiao-Ping Zhang

Existing research has either adapted the Probably Approximately Correct (PAC) Bayesian framework for federated learning (FL) or used information-theoretic PAC-Bayesian bounds while introducing their theorems, but few con…

Federated Learning

The Probably Approximately Correct Learning Model in Computational Learning Theory

2025-11-11 · Rocco A. Servedio arxiv

This survey paper gives an overview of various known results on learning classes of Boolean functions in Valiant's Probably Approximately Correct (PAC) learning model and its commonly studied variants.

Regular Patterns - Probably Approximately Correct Language Model

2013-11-01 · WS 2013 11 · Octavian Popescu
Language ModelingLanguage ModellingmodelNatural Language Inference+1

Probably Approximately Correct Explanations of Machine Learning Models via Syntax-Guided Synthesis

2020-09-18 · Daniel Neider, Bishwamittra Ghosh

We propose a novel approach to understanding the decision making of complex machine learning models (e.g., deep neural networks) using a combination of probably approximately correct learning (PAC) and a logic inference …

BIG-bench Machine LearningDecision Making