Abstract
We analyze the following model: One person, called “helper” observes an outcome\(x^n=(x_1,\dots ,x_n)\in {\mathcal X}^n\) of the sequence \(X^n=(X_1,\dots ,X_n)\) of i.i.d. RV’s and the statistician gets a sample\(y^n=(y_1,\dots ,y_n)\) of the sequence \(Y^n(\theta ,x^n)\) of RV’s with a density \(\prod _{t=1}^n f(y_t|\theta , x_t)\). The helper can give some (side) information about \(x^n\) to the statistician via an encoding function \(s^n:{\mathcal X}^n\rightarrow \mathbb {N}\) with \(\text {rate} (s_n)\triangleq (1/n)\log \# \text {range}(s_n)\le R\). Based on the knowledge of \(s_n(x^n)\) and \(y^n\) the statistician tries to estimate \(\theta \) by an estimator \(\hat{\theta }_n\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A.C. Yao, Some complexity questions related to distributive computing, in 11th ACM Symposium on Theory of Computing (1979), pp. 209–213
R. Ahlswede, I. Csiszár, Hypothesis testing with communication constraints. IEEE Trans. Inform. Theory IT–32, 533–542 (1986)
I. Csiszár, J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems (Academic, New York, 1982)
R. Ahlswede, J. Körner, Source coding with side information and a converse for degraded broadcast channels. IEEE Trans. Inform. Theory IT–21, 629–637 (1975)
R. Ahlswede, Coloring hypergraphs: a new approach to multi-user source coding, Part I. J. Combin. Inform. Syst. Sci. 1, 76–115 (1979)
I.A. Ibragimov, R.Z. Khas’minskii, Information-theoretic inequalities and superefficient estimates. Probl. Inform. Transm. 9, 216–227 (1975)
N.N. Cencov, Statistical Decision Rules and Optimal Inference (Nanka, Moscow, 1972)
J. Wolfowitz, Coding Theorems of Information Theory, 3rd edn. (Springer, Berlin, 1978)
L. Le Cam, On some asymptotic properties of maximum likelihood estimates and related Bayes’ estimates. Univ. Calif. Publ. Statist. I, 277–330 (1953)
L. Le Cam, On the asymptotic theory of estimation and testing hypothesis. Proc. Third Berkeley Symp. Math. Statist. Prob. 1, 129–156 (1956)
L. Le Cam, On the assumption used to prove asymptotic normality of maximum likelihood estimates. Ann. Math. Statist. 41, 803–826 (1970)
I.A. Ibragimov, R.Z. Khas’minskii, Asymptotic behaviour of statistical estimators in the smooth case I. Study of the likelihood ratio. Theory Probab. Appl. 17, 445–462 (1972)
I.A. Ibragimov, R.Z. Khas’minskii, Asymptotic behaviour of some statistical estimators II. Limit theorems for the a posteriori and Bayes’ estimators. Theory Probab. Appl. 18, 76–91 (1973)
I.A. Ibragimov, R.Z. Khas’minskii, Properties of maximum likelihood and Bayes’ estimators for non-identically distributed observations. Theory Probab. Appl. 20, 689–697 (1975)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Ahlswede, R. (2019). Estimation Under Communication Constraints. In: Ahlswede, A., Althöfer, I., Deppe, C., Tamm, U. (eds) Probabilistic Methods and Distributed Information. Foundations in Signal Processing, Communications and Networking, vol 15. Springer, Cham. https://doi.org/10.1007/978-3-030-00312-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-00312-8_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00310-4
Online ISBN: 978-3-030-00312-8
eBook Packages: EngineeringEngineering (R0)