Collaborative Mean Estimation over Intermittently Connected Networks with Peer-To-Peer Privacy
This work considers the problem of Distributed Mean Estimation (DME) over networks with intermittent connectivity, where the goal is to learn a global statistic over the data samples localized across distributed nodes with the help of a central server. To mitigate the impact of intermittent links, nodes can collaborate with their neighbors to compute local consensus which they forward to the central server. In such a setup, the communications between any pair of nodes must satisfy local differential privacy constraints. We study the tradeoff between collaborative relaying and privacy leakage due to the additional data sharing among nodes and, subsequently, propose a novel differentially private collaborative algorithm for DME to achieve the optimal tradeoff. Finally, we present numerical simulations to substantiate our theoretical findings.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Privacy Preserving Semi-Decentralized Mean Estimation over Intermittently-Connected Networks
We consider the problem of privately estimating the mean of vectors distributed across different nodes of an unreliable wireless network, where communications between nodes can fail intermittently. We adopt a semi-decent…
Privacy PreservingEfficient Online 3D Multi-Camera Multi-Object Tracking and Pose Estimation
This paper proposes a fast and online method for jointly performing 3D multi-object tracking and pose estimation using multiple monocular cameras. Our algorithm requires only 2D bounding box and pose detections, eliminat…
3D Multi-Object TrackingComputational EfficiencyPose EstimationRobust Federated Learning with Connectivity Failures: A Semi-Decentralized Framework with Collaborative Relaying
Intermittent connectivity of clients to the parameter server (PS) is a major bottleneck in federated edge learning frameworks. The lack of constant connectivity induces a large generalization gap, especially when the loc…
Federated LearningOnline Learning over Dynamic Graphs via Distributed Proximal Gradient Algorithm
We consider the problem of tracking the minimum of a time-varying convex optimization problem over a dynamic graph. Motivated by target tracking and parameter estimation problems in intermittently connected robotic and s…
parameter estimationExploiting Local and Cloud Sensor Fusion in Intermittently Connected Sensor Networks
We consider a detection problem where sensors experience noisy measurements and intermittent communication opportunities to a centralized fusion center (or cloud). The objective of the problem is to arrive at the correct…
ClusteringEvent DetectionSensor Fusion