Abstract
We introduce a new aspect of the influence of the information-theoretical methods on the statistical theory. The procedures of the probability distributions identification for K(≥1) random objects each having one from the known set of M(≥2) distributions are studied. N-sequences of discrete independent random variables represent results of N observations for each of K objects. On the base of such samples decisions must be made concerning probability distributions of the objects. For \(N \longrightarrow \infty\) the exponential decrease of the test’s error probabilities is considered. The reliability matrices of logarithmically asymptotically optimal procedures are investigated for some models and formulations of the identification problems. The optimal subsets of reliabilities which values may be given beforehand and conditions guaranteeing positiveness of all the reliabilities are investigated.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Rao, R.C.: Linear Statistical Inference and its Applications. Wiley, New York (1965)
Bechhofer, R.E., Kiefer, J., Sobel, M.: Sequential Identification and Ranking Procedures. The University of Chicago Press, Chicago (1968)
Ahlswede, R., Wegener, I.: Search Problems. Wiley, New York (1987)
Ahlswede, R., Dueck, G.: Identification via channels. IEEE Trans. Inform. Theory 35(1), 15–29 (1989)
Ahlswede, R.: General theory of information transfer, Preprint 97–118, SFB 343 Diskrete Strukturen in der Mathematik, Universität Bielefeld (1997); General theory of information transfer: updated, General Theory of Information Transfer and Combinatorics, a Special Issue of Discrete Applied Mathematics (to appear)
Hoeffding, W.: Asymptotically optimal tests for multinomial distributions. Annals. of Math. Statist. 36, 369–401 (1965)
Csiszár, I., Longo, G.: On the error exponent for source coding and for testing simple statistical hypotheses. Studia Sc. Math. Hungarica 6, 181–191 (1971)
Tusnady, G.: On asymptotically optimal tests. Annals of Statist. 5(2), 385–393 (1977)
Longo, G., Sgarro, A.: The error exponent for the testing of simple statistical hypotheses, a combinatorial approach. J. of Combin. Inform. Sys. Sc. 5(1), 58–67 (1980)
Birgé, L.: Vitesse maximales de décroissance des erreurs et tests optimaux associés, Z. Wahrsch. verw Gebiete 55, 261–273 (1981)
Haroutunian, E.A.: Logarithmically asymptotically optimal testing of multiple statistical hypotheses. Problems of Control and Inform. Theory 19(5-6), 413–421 (1990)
Csiszár, I., Körner, J.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, New York (1981)
Csiszár, I.: Method of types. IEEE Trans. Inform. Theory 44(6), 2505–2523 (1998)
Natarajan, S.: Large deviations, hypotheses testing, and source coding for finite Markov chains. IEEE Trans. Inform. Theory 31(3), 360–365 (1985)
Haroutunian, E.A.: On asymptotically optimal testing of hypotheses concerning Markov chain (in Russian). Izvestia Acad. Nauk Armenian SSR. Seria Mathem. 22(1), 76–80 (1988)
Gutman, M.: Asymptotically optimal classification for multiple test with empirically observed statistics. IEEE Trans. Inform. Theory 35(2), 401–408 (1989)
Blahut, R.E.: Principles and Practice of Information Theory. Addison-Weslay, Massachusetts (1987)
Blahut, R.E.: Hypotheses testing and information theory. IEEE Trans. Inform Theory 20(4), 405–417 (1974)
Fu, F.W., Shen, S.Y.: Hypothesis testing for arbitrarily varying source with exponents type constraint. IEEE Trans. Inform. Theory 44(2), 892–895 (1998)
Ahlswede, R., Csiszár, I.: Hypotheses testing with communication constraints. IEEE Trans. Inform. Theory 32(4), 533–542 (1986)
Han, T.S., Kobayashi, K.: Exponential-type error probabilities for multiterminal hypothesis testing. IEEE Trans. Inform. Theory 35(1), 2–13 (1989)
Berger, T.: Decentralized estimation and decision theory. In: IEEE Seven Springs Workshop on Information Theory, Mt. Kisco, NY (September 1979)
Zhang, Z., Berger, T.: Estimation via compressed information. IEEE Trans. Inform. Theory 34(2), 198–211 (1988)
Ahlswede, R., Burnashev, M.: On minimax estimation in the presence of side information about remote data. Annals of Statist. 18(1), 141–171 (1990)
Han, T.S., Amari, S.: Statistical inference under multiterminal data compression. IEEE Trans. Inform. Theory 44(6), 2300–2324 (1998)
Ahlswede, R., Yang, E., Zhang, Z.: Identification via compressed data. IEEE Trans. Inform. Theory 43(1), 48–70 (1997)
Borovkov, A.A.: Mathematical Statistics (in Russian), Nauka, Novosibirsk (1997)
Ihara, S.: Information Theory for Continuous Systems. World Scientific, Singapore (1993)
Chen, P.N.: General formulas for the Neyman-Pearson type-II error exponent subject to fixed and exponential type-I error bounds. IEEE Trans. Inform. Theory 42(1), 316–323 (1996)
Han, T.S.: Information-Spectrum Methods in Information Theory. Springer, Berlin (2003)
Han, T.S.: Hypothesis testing with the general source. IEEE Trans. Inform. Theory 46(7), 2415–2427 (2000)
Maurer, U.M.: Authentication theory and hypothesis testing. IEEE Trans. Inform. Theory 46(4), 1350–1356 (2000)
Cachin, C.: An information-theoretic model for steganography. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, p. 306. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ahlswede, R., Haroutunian, E. (2006). On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_33
Download citation
DOI: https://doi.org/10.1007/11889342_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46244-6
Online ISBN: 978-3-540-46245-3
eBook Packages: Computer ScienceComputer Science (R0)