首页 /研究 /Discrete prior probabilities: the entropy principle
OTHER

Discrete prior probabilities: the entropy principle

E. T. Jaynes

发表年份
2003
引用次数
35

摘要

At this point, we return to the job of designing the robot. We have part of its brain designed, and we have seen how it would reason in a few simple problems of hypothesis testing and estimation. In every problem it has solved thus far, the results have either amounted to the same thing as, or were usually demonstrably superior to, those offered in the ‘orthodox’ statistical literature. But it is still not a very versatile reasoning machine, because it has only one means by which it can translate raw information into numerical values of probabilities, the principle of indifference (2.95). Consistency requires it to recognize the relevance of prior information, and so in almost every problem it is faced at the onset with the problem of assigning initial probabilities, whether they are called technically prior probabilities or sampling probabilities. It can use indifference for this if it can break the situation up into mutually exclusive, exhaustive possibilities in such a way that no one of them is preferred to any other by the evidence. But often there will be prior information that does not change the set of possibilities but does give a reason for preferring one possibility to another. What do we do in this case?

关键词

Consistency (knowledge bases)Relevance (law)Simple (philosophy)Computer scienceSet (abstract data type)Entropy (arrow of time)Point (geometry)Occam's razorMathematical economicsMathematics

相关论文

查看 OTHER 分类全部论文