Stochastic Complexity In Statistical Inquiry

Stochastic Complexity In Statistical Inquiry PDF Author: Jorma Rissanen
Publisher: World Scientific
ISBN: 9814507407
Category : Technology & Engineering
Languages : en
Pages : 191

Get Book

Book Description
This book describes how model selection and statistical inference can be founded on the shortest code length for the observed data, called the stochastic complexity. This generalization of the algorithmic complexity not only offers an objective view of statistics, where no prejudiced assumptions of 'true' data generating distributions are needed, but it also in one stroke leads to calculable expressions in a range of situations of practical interest and links very closely with mainstream statistical theory. The search for the smallest stochastic complexity extends the classical maximum likelihood technique to a new global one, in which models can be compared regardless of their numbers of parameters. The result is a natural and far reaching extension of the traditional theory of estimation, where the Fisher information is replaced by the stochastic complexity and the Cramer-Rao inequality by an extension of the Shannon-Kullback inequality. Ideas are illustrated with applications from parametric and non-parametric regression, density and spectrum estimation, time series, hypothesis testing, contingency tables, and data compression.

Stochastic Complexity In Statistical Inquiry

Stochastic Complexity In Statistical Inquiry PDF Author: Jorma Rissanen
Publisher: World Scientific
ISBN: 9814507407
Category : Technology & Engineering
Languages : en
Pages : 191

Get Book

Book Description
This book describes how model selection and statistical inference can be founded on the shortest code length for the observed data, called the stochastic complexity. This generalization of the algorithmic complexity not only offers an objective view of statistics, where no prejudiced assumptions of 'true' data generating distributions are needed, but it also in one stroke leads to calculable expressions in a range of situations of practical interest and links very closely with mainstream statistical theory. The search for the smallest stochastic complexity extends the classical maximum likelihood technique to a new global one, in which models can be compared regardless of their numbers of parameters. The result is a natural and far reaching extension of the traditional theory of estimation, where the Fisher information is replaced by the stochastic complexity and the Cramer-Rao inequality by an extension of the Shannon-Kullback inequality. Ideas are illustrated with applications from parametric and non-parametric regression, density and spectrum estimation, time series, hypothesis testing, contingency tables, and data compression.

Stochastic Complexity in Statistical Inquiry Theory

Stochastic Complexity in Statistical Inquiry Theory PDF Author: Jorma Rissanen
Publisher: World Scientific Publishing Company Incorporated
ISBN: 9789810203115
Category : Business & Economics
Languages : en
Pages : 188

Get Book

Book Description


Stochastic Complexity in Statistical Inquiry

Stochastic Complexity in Statistical Inquiry PDF Author: Jorma Rissanen
Publisher:
ISBN:
Category : Computational complexity
Languages : en
Pages : 0

Get Book

Book Description


Information and Complexity in Statistical Modeling

Information and Complexity in Statistical Modeling PDF Author: Jorma Rissanen
Publisher: Springer Science & Business Media
ISBN: 0387688129
Category : Mathematics
Languages : en
Pages : 145

Get Book

Book Description
No statistical model is "true" or "false," "right" or "wrong"; the models just have varying performance, which can be assessed. The main theme in this book is to teach modeling based on the principle that the objective is to extract the information from data that can be learned with suggested classes of probability models. The intuitive and fundamental concepts of complexity, learnable information, and noise are formalized, which provides a firm information theoretic foundation for statistical modeling. Although the prerequisites include only basic probability calculus and statistics, a moderate level of mathematical proficiency would be beneficial.

An Introduction to Kolmogorov Complexity and Its Applications

An Introduction to Kolmogorov Complexity and Its Applications PDF Author: Ming Li
Publisher: Springer
ISBN: 3030112985
Category : Mathematics
Languages : en
Pages : 834

Get Book

Book Description
This must-read textbook presents an essential introduction to Kolmogorov complexity (KC), a central theory and powerful tool in information science that deals with the quantity of information in individual objects. The text covers both the fundamental concepts and the most important practical applications, supported by a wealth of didactic features. This thoroughly revised and enhanced fourth edition includes new and updated material on, amongst other topics, the Miller-Yu theorem, the Gács-Kučera theorem, the Day-Gács theorem, increasing randomness, short lists computable from an input string containing the incomputable Kolmogorov complexity of the input, the Lovász local lemma, sorting, the algorithmic full Slepian-Wolf theorem for individual strings, multiset normalized information distance and normalized web distance, and conditional universal distribution. Topics and features: describes the mathematical theory of KC, including the theories of algorithmic complexity and algorithmic probability; presents a general theory of inductive reasoning and its applications, and reviews the utility of the incompressibility method; covers the practical application of KC in great detail, including the normalized information distance (the similarity metric) and information diameter of multisets in phylogeny, language trees, music, heterogeneous files, and clustering; discusses the many applications of resource-bounded KC, and examines different physical theories from a KC point of view; includes numerous examples that elaborate the theory, and a range of exercises of varying difficulty (with solutions); offers explanatory asides on technical issues, and extensive historical sections; suggests structures for several one-semester courses in the preface. As the definitive textbook on Kolmogorov complexity, this comprehensive and self-contained work is an invaluable resource for advanced undergraduate students, graduate students, and researchers in all fields of science.

Artificial Intelligence Frontiers in Statistics

Artificial Intelligence Frontiers in Statistics PDF Author: David J. Hand
Publisher: CRC Press
ISBN: 100015291X
Category : Business & Economics
Languages : en
Pages : 431

Get Book

Book Description
This book presents a summary of recent work on the interface between artificial intelligence and statistics. It does this through a series of papers by different authors working in different areas of this interface. These papers are a selected and referenced subset of papers presented at the 3rd Interntional Workshop on Artificial Intelligence and Statistics, Florida, January 1991.

Algorithmic Learning Theory II

Algorithmic Learning Theory II PDF Author: Setsuo Arikawa
Publisher: IOS Press
ISBN: 9784274076992
Category : Algorithms
Languages : en
Pages : 324

Get Book

Book Description


Complexity, Entropy And The Physics Of Information

Complexity, Entropy And The Physics Of Information PDF Author: Wojciech H. Zurek
Publisher: CRC Press
ISBN: 0429971435
Category : Science
Languages : en
Pages : 545

Get Book

Book Description
This book has emerged from a meeting held during the week of May 29 to June 2, 1989, at St. John’s College in Santa Fe under the auspices of the Santa Fe Institute. The (approximately 40) official participants as well as equally numerous “groupies” were enticed to Santa Fe by the above “manifesto.” The book—like the “Complexity, Entropy and the Physics of Information” meeting explores not only the connections between quantum and classical physics, information and its transfer, computation, and their significance for the formulation of physical theories, but it also considers the origins and evolution of the information-processing entities, their complexity, and the manner in which they analyze their perceptions to form models of the Universe. As a result, the contributions can be divided into distinct sections only with some difficulty. Indeed, I regard this degree of overlapping as a measure of the success of the meeting. It signifies consensus about the important questions and on the anticipated answers: they presumably lie somewhere in the “border territory,” where information, physics, complexity, quantum, and computation all meet.

Advances in Minimum Description Length

Advances in Minimum Description Length PDF Author: Peter D. Grünwald
Publisher: MIT Press
ISBN: 9780262072625
Category : Computers
Languages : en
Pages : 464

Get Book

Book Description
A source book for state-of-the-art MDL, including an extensive tutorial and recent theoretical advances and practical applications in fields ranging from bioinformatics to psychology.

Computational Learning Theory

Computational Learning Theory PDF Author: Paul Vitanyi
Publisher: Springer Science & Business Media
ISBN: 9783540591191
Category : Computers
Languages : en
Pages : 442

Get Book

Book Description
This volume presents the proceedings of the Second European Conference on Computational Learning Theory (EuroCOLT '95), held in Barcelona, Spain in March 1995. The book contains full versions of the 28 papers accepted for presentation at the conference as well as three invited papers. All relevant topics in fundamental studies of computational aspects of artificial and natural learning systems and machine learning are covered; in particular artificial and biological neural networks, genetic and evolutionary algorithms, robotics, pattern recognition, inductive logic programming, decision theory, Bayesian/MDL estimation, statistical physics, and cryptography are addressed.