Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sample-only randomized CNF learners

Definition
CNFLearning873_Valiant_Supplement_LearningModel

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

cnf-learningcombinatoricsp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

A sample-only randomized learner maps an ordered sequence of Boolean assignments on nnn variables to a probability distribution on CNF formulas on the same variables. It receives no unknown target or membership oracle; arbitrary private randomization and unbounded computation are allowed. If FFF is satisfiable, a returned formula GGG is successful precisely when it is satisfiable and

dTV(μF,μG)≤ε.d_{\mathrm{TV}}(\mu_F,\mu_G)\le\varepsilon.dTV​(μF​,μG​)≤ε.

The success probability averages this event first over the learner's output law and then over the independent uniform-solution sample law μF⊗T\mu_F^{\otimes T}μF⊗T​. This is the learning model used by the minimax lower bound.

Definition code
import Definitions.Def_CNFLearning873_Valiant_Learner

noncomputable section

namespace CNFLearning873.Valiant.Supplement
open scoped BigOperators

/-- An arbitrary sample-only randomized proper learner. No target is an argument. -/
abbrev Learner (n T : ℕ) := (Fin T → Assignment n) → WildeQIT.FinDist (CNF n)

/-- TV success is only defined through nonempty solution laws. -/
def GoodOutput {n : ℕ} (F : CNF n) (h : (solutions F).Nonempty)
    (ε : ℝ) (G : CNF n) : Prop :=
  ∃ hg : (solutions G).Nonempty,
    HybridXorLift.tvDist (solutionLaw F h).prob (solutionLaw G hg).prob ≤ ε

/-- Integrates both the product sample law and the learner's private output law. -/
def learnerSuccess {n T : ℕ} (F : CNF n) (h : (solutions F).Nonempty)
    (ε : ℝ) (A : Learner n T) : ℝ :=
  ∑ xs, (sampleLaw F h T).prob xs * eventProb (A xs) (GoodOutput F h ε)

end CNFLearning873.Valiant.Supplement
Source
Weiming Feng, Yixiao Yu, Yiyao Zhang, STOC 2027 submission #873 (October 2026), Theorem 6.2 and its Appendix B proof, printed pp.27,37–38 = 1-based PDF pp.27,37–38; https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/873.pdf

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me