Abstract

We consider the problem of learning parametric distributions from their quantized samples in a network. Specifically, nn agents or sensors observe independent samples of an unknown parametric distribution; and each of them uses kk 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 LpL_p-norms, with p>1p > 1, in terms of Generalized Fisher information. Then, we develop minimax lower bounds on the estimation error for two losses: general LpL_p-norms and the related Wasserstein loss from optimal transport.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.