Skip to the content.

The declarations of Garivier2016Optimal whose docstrings cite a result of the literature, at commit 4f71d11. Each declaration links to the referee site, its file to the source. Declarations in ForLMLExplore/ are the general forms that the project contributes to LMLExplore.

For the headline results, the relation says how the paper’s statement compares with the Lean one, read “paper relation Lean”, as checked against the paper:

The same links, in the Literature Links format: annotations.jsonl (28 annotations).

Optimal Best Arm Identification with Fixed Confidence

Aurélien Garivier and Emilie Kaufmann. Proceedings of the 29th Conference on Learning Theory (COLT). 2016. arXiv:1602.04589v2.

Result Declaration File Relation
Theorem 1 charTime_mul_klBer_le_expectedStoppingTime GK2016/Theorem1.lean narrowMatch (erratum E1)
Remark 2 eventually_mul_log_le_expectedStoppingTime GK2016/Theorem1.lean closeMatch
Theorem 5 mem_optAlloc_iff_exists_scalar GK2016/Theorem5.lean closeMatch
  LMLExplore.Identification.mem_optAlloc_baiTask_restrict_iff ForLMLExplore/Identification/Task/BestArmScalar.lean  
  LMLExplore.Identification.mem_optAlloc_baiTask_restrict_of_sum_div_eq_one ForLMLExplore/Identification/Task/BestArmScalar.lean  
  LMLExplore.Identification.sum_div_eq_one_of_mem_optAlloc_baiTask_restrict ForLMLExplore/Identification/Task/BestArmScalar.lean  
Proposition 6 continuousAt_of_mem_optAlloc GK2016/Proposition6.lean hasPart
  le_of_mem_optAlloc_of_le GK2016/Proposition6.lean hasPart
  pos_of_mem_optAlloc GK2016/Proposition6.lean hasPart
  LMLExplore.Identification.le_iff_le_of_mem_optAlloc_baiTask_restrict ForLMLExplore/Identification/Task/BestArmOrder.lean  
  LMLExplore.Identification.lt_iff_lt_of_mem_optAlloc_baiTask_restrict ForLMLExplore/Identification/Task/BestArmOrder.lean  
Theorem 10 measureReal_glrt_bernoulli_le GK2016/Theorem10.lean exactMatch
  LMLExplore.Identification.measureReal_histOutputMeasure_glrt_baiTask_bernoulli_le ForLMLExplore/Identification/KTThreshold.lean  
Proof of Theorem 10 LMLExplore.measure_exists_log_two_mul_mul_lt_klBer_le ForLMLExplore/SequentialLearning/KTDeviation.lean  
Lemma 11 LMLExplore.div_pow_mul_div_pow_le_two_mul_sqrt_mul_integral_betaMeasure ForLMLExplore/InformationTheory/KrichevskyTrofimov.lean  
  LMLExplore.mul_klBerReal_div_le_log_two_mul_sqrt_mul_integral_betaMeasure_div ForLMLExplore/InformationTheory/KrichevskyTrofimov.lean  
  LMLExplore.pow_mul_one_sub_pow_le_two_mul_sqrt_mul_integral_betaMeasure ForLMLExplore/InformationTheory/KrichevskyTrofimov.lean  
Proposition 12 exists_measureReal_glrt_expFamilyEvidence_le GK2016/Proposition12.lean narrowMatch (erratum E2)
  LMLExplore.Identification.IdentTask.isDeltaPAC_glrt_expFamilyEvidence_log_mul_rpow_div ForLMLExplore/Identification/DeviationalThreshold.lean  
  LMLExplore.Identification.IdentTask.measureReal_histOutputMeasure_glrt_expFamilyEvidence_log_mul_rpow_div_le ForLMLExplore/Identification/DeviationalThreshold.lean  
  LMLExplore.measure_exists_two_mul_card_mul_add_le_sum_pullCount_mul_expFamilyRate_le ForLMLExplore/SequentialLearning/ExpFamilyDeviation.lean  
Proposition 13 stoppingTime_glrt_ne_top_and_limsup_le GK2016/Proposition13.lean exactMatch
  LMLExplore.Identification.IdentTask.ae_eventually_stoppingTime_glrt_le ForLMLExplore/Identification/AlmostSure.lean  
  LMLExplore.Identification.IdentTask.ae_stoppingTime_glrt_ne_top ForLMLExplore/Identification/AlmostSure.lean  
  LMLExplore.Identification.IdentTask.eventually_stoppingTime_glrt_le_of_eventually_mul_le_glr ForLMLExplore/Identification/AlmostSure.lean  
Proof of Proposition 13 LMLExplore.Identification.IdentTask.eventually_mul_le_glr_plugInCost ForLMLExplore/Identification/AlmostSure.lean  
Theorem 14 limsup_expectedStoppingTime_cTrackAndStop_div_log_le GK2016/Theorem14.lean hasPart
  limsup_expectedStoppingTime_trackAndStop_div_log_le GK2016/Theorem14.lean hasPart