2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) 2017
DOI: 10.1109/allerton.2017.8262847
|View full text |Cite
|
Sign up to set email alerts
|

Mean estimation from adaptive one-bit measurements

Abstract: We consider the problem of estimating the mean of a symmetric log-concave distribution under constraint that only a single bit per sample from this distribution is available to the estimator. We study the mean squared error as a function of the sample size (and hence number of bits). We consider three settings: first, a centralized setting, where an encoder may release n bits given a sample of size n, and for which there is no asymptotic penalty for quantization; second, an adaptive setting in which each bit i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 46 publications
0
2
0
Order By: Relevance
“…In simulations, we demonstrate that by choosing b large enough, the approximation of analog measurements holds and the MSE from ( 18) is achieved by b-bit quantized data. In addition to the power constraints in (25), systems may also have other physical constraints on the number of measurements. This can be due to system design or available workspace, such as a field in which sensors are deployed, requiring a minimal distance from each other to avoid interference.…”
Section: B Constraintsmentioning
confidence: 99%
“…In simulations, we demonstrate that by choosing b large enough, the approximation of analog measurements holds and the MSE from ( 18) is achieved by b-bit quantized data. In addition to the power constraints in (25), systems may also have other physical constraints on the number of measurements. This can be due to system design or available workspace, such as a field in which sensors are deployed, requiring a minimal distance from each other to avoid interference.…”
Section: B Constraintsmentioning
confidence: 99%
“…In particular, such an encoder is agnostic to the relationship between X and θ. This situation is in contrast to optimal quantization schemes in indirect source coding [14], [15] and in problems involving estimation from compressed date [7], [10], [12], [13], [35], [36], where the specification of the model θ → X is needed for the design of compression and estimation schemes. As a result, the random spherical coding scheme we rely on is sub-optimal in general, although it can be applied in situations where the model θ → X is unknown at the compressor.…”
Section: B Background and Related Workmentioning
confidence: 99%