Theorem. Uniform proxy error and objective regret [ftip-00IA]
✍️source

For a finite common feasible set and a common regularizer, the uniform proxy error hypothesis in Definition [ftip-007G] yields the two-epsilon objective regret bound proved in Theorem [ftip-007H]; the conclusion concerns the regularized objective named there.

Theorem. Uniform proxy error and objective regret [ftip-00IA]
✍️source

Finite probability and execution results [ftip-00I2]

Convention. Domains of the finite results [ftip-00I5]

Theorem. Independent discovery probability [ftip-00I7]

Theorem. Discovery budget for a failure threshold [ftip-00I8]

Theorem. Support under finite exponential tilting [ftip-00I9]

Theorem. Uniform proxy error and objective regret [ftip-00IA]
✍️source

Theorem. Utility under a change of evaluation law [ftip-00IB]

Theorem. Response classes under feedback refinement [ftip-00IC]

Theorem. Equal execution inputs give equal replay traces [ftip-00IJ]

Theorem. Observational equivalence under a common update kernel [ftip-00IK]

Theorem. Conditions for an admissible commit decision [ftip-00IL]

Theorem. Admission of a finite audit plan [ftip-00IM]

Definition. Uniform proxy approximation [ftip-007G]

Theorem. Uniform proxy error gives two-epsilon selection regret [ftip-007H]

Proof.