Legacy topic placeholder · setting
Causal bandits
Reviewed actual expected simple regret for finite causal DAGs, exact noisy diagnostics, repaired parallel allocation and full-support/deterministic witnesses. Remaining source screening and ICLR evidence are open; topic incomplete.
Result contract to fill
A separate record is required for each exact model and guarantee. Compare bounds only when assumptions, feedback, metrics and parameter regimes match.
- Exact setting and model class
- Pending source verification
- Assumptions
- Pending source verification
- Feedback structure
- Pending source verification
- Algorithm / method
- Pending source verification
- Regret or other metric
- Pending source verification
- Expectation / high probability
- Pending source verification
- Horizon, dimension and other parameter dependencies
- Pending source verification
- Upper bound and conditions
- Pending source verification
- Lower bound and conditions
- Pending source verification
- Computation, oracle and relaxation requirements
- Pending source verification
- Paper / theorem / version / verification date
- Pending source verification
- Canonical Lean references and completion boundary
- Pending source verification
Three separate evidence ledgers
- Literature results: Mapped source and repairs reviewed within the disclosed scope; remaining source audits are incomplete.
- Lean mapping: Mapped results independently reviewed with explicit differences; topic acceptance remains incomplete.
- Literature open problems: none asserted. Missing formalization is not an open mathematical problem.
Reviewed native heterogeneous causal sampling and actual expected regret
Native heterogeneous finite-node actual-law expected regret; complete frozen noisy diagnostics; repaired parallel allocation, actual graph-law/cost bridge, true-cost regret consumers and both boundary witnesses. Remaining source screening and ICLR evidence are open.
Mapped results independently reviewed with explicit scope differences; topic incomplete.
Causal Bandits: Learning Good Interventions via Causal Inference · F. Lattimore, T. Lattimore and M. D. Reid · 2016
Frozen source provenance
PDF SHA-256: 99aa9427e02e31883510dfcd0b11ba4f45097dc30dd98a094cbf13068f93b747
Compiled source snapshot: 6ac086dcd71dd6829c9859e13aefef4a9f04c282. The page-wide banner separately reports this site's current Lean gate.
- Each node has its own nonempty finite type; final performance theorem constructs the finite product codec internally. Binary readout extends the literal binary source reward node.
- Coverage is explicit; zero allocation weights are allowed only when Q covers every parent support.
- Unchanged source truncation tuning and fixed-order ties; coefficient and failure direction repairs disclosed.
- Uniform actual threshold uses m, with K substituted only in RHS. Optimal allocation minimizes cost, not a proved ordering of actual regrets.
- Frozen noisy test now proves concentrated coverage, cost 8/3, B=2 biases, conditional versus interventional means, an uncovered design, actual tuned T=1 recommendation and exact expected regret 1/5, plus concentrated all-horizon bound. The B=2 bias test is distinct from the actual one-round tuning.
- Parallel bridge and witnesses are reviewed with strict rarity, normalized observation mass 1-D, N>=2 and known q. Actual thresholds retain designCost. Remaining source audit and ICLR evidence remain required; no topic completion.
- Heterogeneous Fin3/Fin2 canary proves native factorization, means 5/12, 1/4, 3/4 and uniform all-horizon rate; no exact diagnostic cost or random recommendation distribution is claimed.
- Evidence erratum: three historical sampling file hashes are invalid. Fresh independent blind/source review binds five foundations and seven sampling modules plus canary to132a834; old records retained. Identity checks use explicit LF normalization and run in the harness. No Lean proof change or topic completion.
Mathematical contract and proof
A round samples an action from eta and a full assignment from its actual intervened DAG law. The finite product law and reward projection derive independent paired observations; no supplied tail or confidence premise.
The observable estimator averages Y(P_a/Q)1{P_a/Q<=B}; it uses known parent laws and observed bits. Its mean differs from true intervention reward by nonnegative truncation bias at most m/B. The true reward mean is proved equal to the intervention integral.
Bounded centered MGF at tilt 1/(2B), with B=sqrt(mT/L), L=log(2TK), gives simultaneous confidence radius sqrt(2mL/T)+3BL/T with failure at most 1/T.
The least empirical maximizer satisfies regret <=2epsilon+m/B on the good event and <=1 everywhere. Integration gives (2sqrt(2)+7)sqrt(mL/T)+1/T and the cap 1. Since L>=1/2, explicit constant 3sqrt(2)+7 suffices.
Existing attained optimal-design and uniform-coverage theorems instantiate the same actual learner. The original noisy graph has true means 1/2, 3/10, 7/10; the exact noisy diagnostics are now reviewed, and the parallel-design bridge and witnesses are accepted separately with explicit source corrections.
Native dependent node tables define the joint before encoding. Induction proves its pushforward under a constructed finite product codec; intervention and parent laws, coverage, exact design cost and full product sample law are preserved.
The estimator, fixed-order recommendation and actual regret agree pathwise; integral transport yields the native expected-regret endpoint without an external codec premise. The additional Fin3/Fin2 canary has exact means 5/12, 1/4 and 3/4.
The local noisy canary derives all parent masses from the actual DAG. Sampling only observation still covers every intervention and has exact cost 8/3. At T=1 the source threshold lies strictly between 1 and 4/3, estimates are (Y,0,0), fixed-order ties recommend observation, and the actual expected regret is exactly 1/5. Conditional reward given W=1 is 3/4, distinct from intervention reward 7/10. These are local model diagnostics, not numerical claims attributed to the paper.
Construct the integer rarity r, prove at most r strict rare interventions, allocate 1/(2r) to each and 1-D to observation. Actual intervention product laws give P_a<=2r Q, including deterministic roots; derive coverage and design cost<=2r. Injective actual parent-law transport connects both repaired and attained optimal designs to the real learner. Actual threshold uses its true cost; RHS relaxes to 2r. The N=2 fair and deterministic witnesses have exact costs 2 and 4.
| Role | Canonical Lean declaration | Source or instance scope |
|---|---|---|
| algorithm | BanditRLProof.Causal.GraphModel.roundLaw | Algorithm2/Theorem3 repaired common-alphabet chain; Proposition4 for uniform RHS |
| algorithm | BanditRLProof.Causal.GraphModel.sampleLaw | Algorithm2/Theorem3 repaired common-alphabet chain; Proposition4 for uniform RHS |
| algorithm | BanditRLProof.Causal.GraphModel.sampleWeightedBit | Algorithm2/Theorem3 repaired common-alphabet chain; Proposition4 for uniform RHS |
| algorithm | BanditRLProof.Causal.GraphModel.sampleEstimate | Algorithm2/Theorem3 repaired common-alphabet chain; Proposition4 for uniform RHS |
| algorithm | BanditRLProof.Causal.GraphModel.sampleRecommendation | Algorithm2/Theorem3 repaired common-alphabet chain; Proposition4 for uniform RHS |
| producer | BanditRLProof.Causal.GraphModel.rewardMean_eq_integral | Algorithm2/Theorem3 repaired common-alphabet chain; Proposition4 for uniform RHS |
| producer | BanditRLProof.Causal.GraphModel.sampleEstimate_source_confidence | Algorithm2/Theorem3 repaired common-alphabet chain; Proposition4 for uniform RHS |
| endpoint | BanditRLProof.Causal.GraphModel.expected_simpleRegret_source_bound | Algorithm2/Theorem3 repaired common-alphabet chain; Proposition4 for uniform RHS |
| endpoint | BanditRLProof.Causal.GraphModel.expected_simpleRegret_bounds | Algorithm2/Theorem3 repaired common-alphabet chain; Proposition4 for uniform RHS |
| endpoint | BanditRLProof.Causal.GraphModel.expected_simpleRegret_explicit_rate | Algorithm2/Theorem3 repaired common-alphabet chain; Proposition4 for uniform RHS |
| endpoint | BanditRLProof.Causal.GraphModel.expected_simpleRegret_uniform | Algorithm2/Theorem3 repaired common-alphabet chain; Proposition4 for uniform RHS |
| endpoint | BanditRLProof.Causal.GraphModel.expected_simpleRegret_optimal | Algorithm2/Theorem3 repaired common-alphabet chain; Proposition4 for uniform RHS |
| model | BanditRLProof.Causal.nodeJoint | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| producer | BanditRLProof.Causal.productNodeCodec | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| producer | BanditRLProof.Causal.NodeCodec.joint_encodeTables | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| producer | BanditRLProof.Causal.nodeIntervention_factorization | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| algorithm | BanditRLProof.Causal.NodeGraphModel.sampleLaw | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| producer | BanditRLProof.Causal.NodeGraphModel.sampleLaw_encoded | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| algorithm | BanditRLProof.Causal.NodeGraphModel.sampleWeightedBit | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| algorithm | BanditRLProof.Causal.NodeGraphModel.sampleEstimate | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| algorithm | BanditRLProof.Causal.NodeGraphModel.sampleRecommendation | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| producer | BanditRLProof.Causal.NodeGraphModel.designCost_encoded | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| producer | BanditRLProof.Causal.NodeGraphModel.expected_simpleRegret_encoded | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| endpoint | BanditRLProof.Causal.NodeGraphModel.expected_simpleRegret_source_bound | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| endpoint | BanditRLProof.Causal.NodeGraphModel.expected_simpleRegret_explicit_rate | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| endpoint | BanditRLProof.Causal.NodeGraphModel.expected_simpleRegret_uniform | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| endpoint | BanditRLProof.Causal.NodeGraphModel.expected_simpleRegret_optimal | Algorithm2/Theorem3 native finite-node representation bridge; Proposition4 for uniform RHS; explicit repaired constants |
| model | BanditRLProof.Causal.ParallelParameters.rarity | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| producer | BanditRLProof.Causal.ParallelParameters.rarity_spec | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| producer | BanditRLProof.Causal.ParallelParameters.rarity_minimal | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| producer | BanditRLProof.Causal.ParallelParameters.rareActions_card_le | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| algorithm | BanditRLProof.Causal.ParallelParameters.allocation | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| producer | BanditRLProof.Causal.ParallelParameters.allocationWeight_sum | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| model | BanditRLProof.Causal.ParallelParameters.rootLaw | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| producer | BanditRLProof.Causal.ParallelParameters.rootLaw_mass | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| producer | BanditRLProof.Causal.ParallelParameters.allocated_mass_domination | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| producer | BanditRLProof.Causal.ParallelParameters.allocation_covers | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| endpoint | BanditRLProof.Causal.ParallelParameters.allocation_cost_le | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| endpoint | BanditRLProof.Causal.ParallelParameters.optimal_cost_le | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| model | BanditRLProof.Causal.ParallelParameters.graph | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| producer | BanditRLProof.Causal.ParallelParameters.graph_parentLaw | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| producer | BanditRLProof.Causal.ParallelParameters.graph_designCost | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| endpoint | BanditRLProof.Causal.ParallelParameters.expected_simpleRegret_parallel | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |
| endpoint | BanditRLProof.Causal.ParallelParameters.expected_simpleRegret_parallel_optimal | Supplement p15 Proposition8 (arXiv v1 Proposition9), repaired allocation; known-q Algorithm2/Theorem3 consumer |