Pith. sign in

REVIEW 1 cited by

Relative Entropy and Inductive Inference

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv physics/0311093 v1 pith:CSOFQKT2 submitted 2003-11-19 physics.data-an physics.gen-ph

classification physics.data-anphysics.gen-ph
keywords entropydistributioninductiveinferencemethodprobabilitytoolbeyond
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We discuss how the method of maximum entropy, MaxEnt, can be extended beyond its original scope, as a rule to assign a probability distribution, to a full-fledged method for inductive inference. The main concept is the (relative) entropy S[p|q] which is designed as a tool to update from a prior probability distribution q to a posterior probability distribution p when new information in the form of a constraint becomes available. The extended method goes beyond the mere selection of a single posterior p, but also addresses the question of how much less probable other distributions might be. Our approach clarifies how the entropy S[p|q] is used while avoiding the question of its meaning. Ultimately, entropy is a tool for induction which needs no interpretation. Finally, being a tool for generalization from special examples, we ask whether the functional form of the entropy depends on the choice of the examples and we find that it does. The conclusion is that there is no single general theory of inductive inference and that alternative expressions for the entropy are possible.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Finite-State Gibbs Construction from a Recognition Cost

    cond-mat.stat-mech 2026-05 unverdicted novelty 7.0 of 10

    Adopting the normalized d'Alembert degree-two closure (RCL) to induce real-valued costs X_ω = J(r_ω), multinomial counting and convex duality recover the finite-state Gibbs weights together with the identity F_R(q) - ...

Pith tools