On learning parametric distributions from quantized samples

05/25/2021
by   Septimia Sârbu, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/07/2019

Learning Distributions from their Samples under Communication Constraints

We consider the problem of learning high-dimensional, nonparametric and ...
research
10/07/2021

Pointwise Bounds for Distribution Estimation under Communication Constraints

We consider the problem of estimating a d-dimensional discrete distribut...
research
06/27/2018

Uncoupled isotonic regression via minimum Wasserstein deconvolution

Isotonic regression is a standard problem in shape-constrained estimatio...
research
11/28/2019

Optimal Estimation of Change in a Population of Parameters

Paired estimation of change in parameters of interest over a population ...
research
06/15/2020

Estimation of Skill Distributions

In this paper, we study the problem of learning the skill distribution o...
research
08/16/2018

Active Distribution Learning from Indirect Samples

This paper studies the problem of learning the probability distribution...
research
07/24/2023

Tuning-free one-bit covariance estimation using data-driven dithering

We consider covariance estimation of any subgaussian distribution from f...

Please sign up or login with your details

Forgot password? Click here to reset