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.
Average reward and pathwise regret
Definition
Assume the Axiom of Choice for the path laws and conditional-expectation constructions used by the common-average-reward result. For a finite communicating MDP, let denote the common optimal average reward. The existence and independence of this value from the initial state are proved in the immediately cited theorem. Under any policy, write for the realized cumulative reward over the first interactions. The pathwise regret is the random variable . Its expected regret is . The pathwise random variable and its expectation are distinct objects.
Definition references
Bounded-reward MDP: supplies the realized reward sequence and its finite-horizon path law.
Communicating MDP and diameter: supplies the model class for which is defined.
Common optimal average reward: its limit exists and is independent of the initial state.
Expectation: defines expected regret.
Expectation linearity: gives the displayed expected-regret identity.
UCRL2 regret convention: §2, the paper defines regret from the realized cumulative reward (PDF lines 134–138).
Average-reward regret treatment: Chapter 10.3.1, printed p. 223.
Axiom of Choice: assumed for the path laws and conditional expectations in the common-average-reward result.
Depends on
Used by
Dependency tree · two levels
26 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
- Thomas Jaksch, Ronald Ortner, and Peter Auer, Near-optimal Regret Bounds for Reinforcement Learning (standard reference, not scraped)
- Christos Dimitrakakis and Ronald Ortner, Decision Making Under Uncertainty and Reinforcement Learning: Theory and Algorithms (standard reference, not scraped)