Deceptive updating and minimal information methods

DOI10.1007/s11229-011-0028-0zbMath1275.03095OpenAlexW1975288942MaRDI QIDQ383022

Haim Gaifman, Anubav Vasudevan

Publication date: 25 November 2013

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11229-011-0028-0

zbMATH Keywords

maximum entropyJaynescross entropyhigher-order probabilitiesminimal informationupdating probabilities

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Probability and inductive logic (03B48) Axioms; other general questions in probability (60A05)

Related Items

Rules of proof for maximal entropy inference, On the a priori and a posteriori assessment of probabilities, Learning and pooling, pooling and learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Common sense and maximum entropy
• In defense of the maximum entropy inference process
• A comparison of the Shannon and Kullback information measures
• Steady magnetohydrodynamic flow of an incompressible viscous fluid involving an ignorable co-ordinate
• Information Theory and Statistical Mechanics
• Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
• Probabilities over rich languages, testing and randomness
• Probability Theory
• Prior Probabilities
• On Information and Sufficiency