Exact Support Recovery in Federated Regression with One-shot Communication
Federated learning provides a framework to address the challenges of distributed computing, data ownership and privacy over a large number of distributed clients with low computational and communication capabilities. In this paper, we study the problem of learning the exact support of sparse linear regression in the federated learning setup. We provide a simple communication efficient algorithm which only needs one-shot communication with the centralized server to compute the exact support. Our method does not require the clients to solve any optimization problem and thus, can be run on devices with low computational capabilities. Our method is naturally robust to the problems of client failure, model poisoning and straggling clients. We formally prove that our method requires a number of samples per client that is polynomial with respect to the support size, but independent of the dimension of the problem. We require the number of distributed clients to be logarithmic in the dimension of the problem. If the predictor variables are mutually independent then the overall sample complexity matches the optimal sample complexity of the non-federated centralized setting. Furthermore, our method is easy to implement and has an overall polynomial time complexity.
Code (0)
등록된 구현이 없습니다.
Tasks
Distributed ComputingFederated LearningModel PoisoningregressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
One-Shot Federated Ridge Regression: Exact Recovery via Sufficient Statistic Aggregation
Federated learning protocols require repeated synchronization between clients and a central server, with convergence rates depending on learning rates, data heterogeneity, and client sampling. This paper asks whether ite…
Federated LearningSequential adaptive elastic net approach for single-snapshot source localization
This paper proposes efficient algorithms for accurate recovery of direction-of-arrival (DoA) of sources from single-snapshot measurements using compressed beamforming (CBF). In CBF, the conventional sensor array signal m…
On the exact recovery of sparse signals via conic relaxations
In this note we compare two recently proposed semidefinite relaxations for the sparse linear regression problem by Pilanci, Wainwright and El Ghaoui (Sparse learning via boolean relaxations, 2015) and Dong, Chen and Lind…
Sparse LearningVariable SelectionFederated Myopic Community Detection with One-shot Communication
In this paper, we study the problem of recovering the community structure of a network under federated myopic learning. Under this paradigm, we have several clients, each of them having a myopic view, i.e., observing a s…
Community DetectionFederated LoRA Fine-Tuning for LLMs via Collaborative Alignment
Low-rank adaptation (LoRA) has emerged as a powerful tool for parameter-efficient fine-tuning of large language models (LLMs). This paper studies LoRA under a federated learning setting, enabling collaborative fine-tunin…
parameter-efficient fine-tuningFederated Learning