How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Finite KL-regularized policy improvement
Definition
Let be a finite nonempty set. A probability vector on is a family with and . For probability vectors , define the finite relative entropy when whenever , and define otherwise. Terms with are omitted. Given a real reward and a coefficient , define The finite KL-regularized policy-improvement problem is to maximize over all probability vectors on . The reference has full support when for every ; in that case is finite for every .
Definition references
Finite KL divergence: uses the same directed finite sum, omits zero first-coordinate terms, and assigns when has positive mass where is zero.
Natural logarithm: defines on as the inverse of the exponential function.
Depends on
Used by
- Disconnected comparison support does not identify Gibbs policy mass Counterexample
- Zero reference support makes the DPO reward ratio undefined Counterexample
- A prompt-only reward offset leaves Bradley–Terry comparisons and policy unchanged Example
- A two-response Gibbs policy with exact probabilities Example
- Preference coverage and Bradley–Terry model limits Remark
- Bradley–Terry reward-policy reparameterization and finite DPO gradient Theorem
- The finite-action Gibbs policy uniquely maximizes reward minus KL Theorem
Dependency tree · two levels
6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Rafael Rafailov et al., Direct Preference Optimization: Your Language Model is Secretly a Reward Model, arXiv:2305.18290v3 (2024) (standard reference, not scraped)
- Purdue course lecture notes, Preference Optimization (PrefOpt) (standard reference, not scraped)