Representation Dependence in Probabilistic Inference
| dc.creator | Halpern, Joseph Y. | |
| dc.creator | Koller, Daphne | |
| dc.date | 2003-12-20 | |
| dc.date.accessioned | 2026-07-07T03:20:46Z | |
| dc.date.available | 2026-07-07T03:20:46Z | |
| dc.description | Non-deductive reasoning systems are often {\em representation dependent}: representing the same situation in two different ways may cause such a system to return two different answers. Some have viewed this as a significant problem. For example, the principle of maximum entropy has been subjected to much criticism due to its representation dependence. There has, however, been almost no work investigating representation dependence. In this paper, we formalize this notion and show that it is not a problem specific to maximum entropy. In fact, we show that any representation-independent probabilistic inference procedure that ignores irrelevant information is essentially entailment, in a precise sense. Moreover, we show that representation independence is incompatible with even a weak default assumption of independence. We then show that invariance under a restricted class of representation changes can form a reasonable compromise between representation independence and other desiderata, and provide a construction of a family of inference procedures that provides such restricted representation independence, using relative entropy. | |
| dc.description | A preliminary version of the is paper appears in IJCAI, 1995. This version will appear in the Journal of AI Research | |
| dc.identifier | https://arxiv.org/abs/cs/0312048 | |
| dc.identifier | http://arxiv.org/abs/cs/0312048 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31943 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Logic in Computer Science | |
| dc.subject | I.2.4; F.4.q | |
| dc.title | Representation Dependence in Probabilistic Inference | |
| dc.type | text |