An Information-Theoretic Analysis of The Cost of Decentralization for Learning and Inference Under Privacy Constraints

10/11/2021
by   Sharu Theresa Jose, et al.
0

In vertical federated learning (FL), the features of a data sample are distributed across multiple agents. As such, inter-agent collaboration can be beneficial not only during the learning phase, as is the case for standard horizontal FL, but also during the inference phase. A fundamental theoretical question in this setting is how to quantify the cost, or performance loss, of decentralization for learning and/or inference. In this paper, we consider general supervised learning problems with any number of agents, and provide a novel information-theoretic quantification of the cost of decentralization in the presence of privacy constraints on inter-agent communication within a Bayesian framework. The cost of decentralization for learning and/or inference is shown to be quantified in terms of conditional mutual information terms involving features and label variables.

READ FULL TEXT
research
12/19/2022

Rate-Privacy-Storage Tradeoff in Federated Learning with Top r Sparsification

We investigate the trade-off between rate, privacy and storage in federa...
research
12/15/2021

Data Valuation for Vertical Federated Learning: An Information-Theoretic Approach

Federated learning (FL) is a promising machine learning paradigm that en...
research
10/30/2022

PHY-Fed: An Information-Theoretic Secure Aggregation in Federated Learning in Wireless Communications

Federated learning (FL) is a type of distributed machine learning at the...
research
02/04/2022

Improved Information Theoretic Generalization Bounds for Distributed and Federated Learning

We consider information-theoretic bounds on expected generalization erro...
research
11/04/2019

Improving Supervised Phase Identification Through the Theory of Information Losses

This paper considers the problem of Phase Identification in power distri...
research
05/14/2023

Federated TD Learning over Finite-Rate Erasure Channels: Linear Speedup under Markovian Sampling

Federated learning (FL) has recently gained much attention due to its ef...
research
10/09/2019

On the Possibility of Rewarding Structure Learning Agents: Mutual Information on Linguistic Random Sets

We present a first attempt to elucidate an Information-Theoretic approac...

Please sign up or login with your details

Forgot password? Click here to reset