Abstract
We consider the problem of learning parametric distributions from their quantized samples in a network. Specifically, agents or sensors observe independent samples of an unknown parametric distribution; and each of them uses bits to describe its observed sample to a central processor whose goal is to estimate the unknown distribution. First, we establish a generalization of the well-known van Trees inequality to general -norms, with , in terms of Generalized Fisher information. Then, we develop minimax lower bounds on the estimation error for two losses: general -norms and the related Wasserstein loss from optimal transport.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.