Distributed Learning in Wireless Sensor Networks
Joel B. Predd, Sanjeev R. Kulkarni, and H. Vincent Poor

TL;DR
This paper reviews recent nonparametric models for distributed detection and estimation in wireless sensor networks, addressing scenarios with vague prior knowledge and moving beyond traditional parametric assumptions.
Contribution
It introduces nonparametric models for distributed learning applicable to wireless sensor networks, expanding the theoretical framework beyond classical parametric models.
Findings
Nonparametric models are suitable for scenarios with limited prior knowledge.
The models are inspired by classical nonparametric statistics.
Applicable to real-world wireless sensor network problems.
Abstract
The problem of distributed or decentralized detection and estimation in applications such as wireless sensor networks has often been considered in the framework of parametric models, in which strong assumptions are made about a statistical description of nature. In certain applications, such assumptions are warranted and systems designed from these models show promise. However, in other scenarios, prior knowledge is at best vague and translating such knowledge into a statistical model is undesirable. Applications such as these pave the way for a nonparametric study of distributed detection and estimation. In this paper, we review recent work of the authors in which some elementary models for distributed learning are considered. These models are in the spirit of classical work in nonparametric statistics and are applicable to wireless sensor networks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
