Highly useful text studies logarithmic measures of information and their application to testing statistical hypotheses. Includes numerous worked examples and problems. References. Glossary. Appendix. 1968 2nd, revised edition.

This interdisciplinary text offers theoretical and practical results of information theoretic methods used in statistical learning. It presents a comprehensive overview of the many different methods that have been developed in numerous contexts.

Information Theory and Statistics: A Tutorial is concerned with applications of information theory concepts in statistics, in the finite alphabet setting. The topics covered include large deviations, hypothesis testing, maximum likelihood estimation in exponential families, analysis of contingency tables, and iterative algorithms with an "information geometry" background. Also, an introduction is provided to the theory of universal coding, and to statistical inference via the minimum description length principle motivated by that theory. The tutorial does not assume the reader has an in-depth knowledge of Information Theory or statistics. As such, Information Theory and Statistics: A Tutorial, is an excellent introductory text to this highly-important topic in mathematics, computer science and electrical engineering. It provides both students and researchers with an invaluable resource to quickly get up to speed in the field.

The latest edition of this classic is updated with new problem sets and material The Second Edition of this fundamental textbook maintains the book's tradition of clear, thought-provoking instruction. Readers are provided once again with an instructive mix of mathematics, physics, statistics, and information theory. All the essential topics in information theory are covered in detail, including entropy, data compression, channel capacity, rate distortion, network information theory, and hypothesis testing. The authors provide readers with a solid understanding of the underlying theory and applications. Problem sets and a telegraphic summary at the end of each chapter further assist readers. The historical notes that follow each chapter recap the main points. The Second Edition features: * Chapters reorganized to improve teaching * 200 new problems * New material on source coding, portfolio theory, and feedback capacity * Updated references Now current and enhanced, the Second Edition of Elements of Information Theory remains the ideal textbook for upper-level undergraduate and graduate courses in electrical engineering, statistics, and telecommunications.

This concise and readable book addresses primarily readers with a background in classical statistical physics and introduces quantum mechanical notions as required. Conceived as a primer to bridge the gap between statistical physics and quantum information, it emphasizes concepts and thorough discussions of the fundamental notions and prepares the reader for deeper studies, not least through a selection of well chosen exercises.

Evaluating statistical procedures through decision and game theory, as first proposed by Neyman and Pearson and extended by Wald, is the goal of this problem-oriented text in mathematical statistics. First-year graduate students in statistics and other students with a background in statistical theory and advanced calculus will find a rigorous, thorough presentation of statistical decision theory treated as a special case of game theory. The work of Borel, von Neumann, and Morgenstern in game theory, of prime importance to decision theory, is covered in its relevant aspects: reduction of games to normal forms, the minimax theorem, and the utility theorem. With this introduction, Blackwell and Professor Girshick look at: Values and Optimal Strategies in Games; General Structure of Statistical Games; Utility and Principles of Choice; Classes of Optimal Strategies; Fixed Sample-Size Games with Finite Ω and with Finite A; Sufficient Statistics and the Invariance Principle; Sequential Games; Bayes and Minimax Sequential Procedures; Estimation; and Comparison of Experiments. A few topics not directly applicable to statistics, such as perfect information theory, are also discussed. Prerequisites for full understanding of the procedures in this book include knowledge of elementary analysis, and some familiarity with matrices, determinants, and linear dependence. For purposes of formal development, only discrete distributions are used, though continuous distributions are employed as illustrations. The number and variety of problems presented will be welcomed by all students, computer experts, and others using statistics and game theory. This comprehensive and sophisticated introduction remains one of the strongest and most useful approaches to a field which today touches areas as diverse as gambling and particle physics.

This book is devoted to the theory of probabilistic information measures and their application to coding theorems for information sources and noisy channels. The eventual goal is a general development of Shannon's mathematical theory of communication, but much of the space is devoted to the tools and methods required to prove the Shannon coding theorems. These tools form an area common to ergodic theory and information theory and comprise several quantitative notions of the information in random variables, random processes, and dynamical systems. Examples are entropy, mutual information, conditional entropy, conditional information, and discrimination or relative entropy, along with the limiting normalized versions of these quantities such as entropy rate and information rate. Much of the book is concerned with their properties, especially the long term asymptotic behavior of sample information and expected information. This is the only up-to-date treatment of traditional information theory emphasizing ergodic theory.