Samplinglib
Lean gate passed 2026-08-19T05:09:39.794721+00:00 · 644be936998e
Primary textbook

Log-Concave Sampling

Read Sinho Chewi's textbook in canonical chapter order, with beginner exposition, rigorous contracts, and Lean evidence available on demand.

flowchart TD
  C1["1 · Langevin diffusion"] --> C2["2 · Functional inequalities"]
  C1 --> C3["3 · Stochastic analysis"]
  C2 --> C4["4 · Langevin Monte Carlo"]
  C3 --> C4
  C4 --> C5["5 · Faster low-accuracy samplers"]
  C4 --> C6["6 · Rényi convergence"]
  C5 --> C6
  C2 --> C7["7 · High-accuracy samplers"]
  C6 --> C7
  C2 --> C8["8 · Proximal sampler"]
  C3 --> C9["9 · Lower bounds"]
  C6 --> C9
  C8 --> C10["10 · Structured sampling"]
  C1 --> C11["11 · Non-log-concave sampling"]
  C3 --> C12["12 · Diffusion generative models"]
  C6 --> C12
Logical chapter dependencies and recommended route.
01
Source pp. 3–47 · active frontier

The Langevin Diffusion in Continuous Time

Build the analytic language that turns Langevin dynamics into quantitative convergence estimates.

Markov semigroupinfinitesimal generatorDirichlet formPoincaré and log-Sobolev inequalitiesLangevin diffusion
02
Source pp. 48–95 · partially formalized

Functional Inequalities

Develop Poincaré, log-Sobolev, transport, and isoperimetric tools, including semigroup proofs and preservation operations.

Poincaré inequalitylog-Sobolev inequalitytransport inequalitiesCheeger inequalityPoincaré constant
03
Source pp. 96–120 · partially formalized

Additional Topics in Stochastic Analysis

Build the stochastic-analysis tools used later for path-space comparison, conditioned diffusions, and bridge constructions.

quadratic variationchange of measureGirsanov theoremDoob transformFöllmer drift
04
Source pp. 123–140 · partially formalized

Analysis of Langevin Monte Carlo

Derive Langevin Monte Carlo guarantees through Wasserstein coupling, interpolation, convex optimization, and Girsanov comparison.

synchronous couplingreflection couplinginterpolationgradient flowchange of drift
05
Source pp. 141–173 · planned

Faster Low-Accuracy Samplers

Study randomized midpoint, Hamiltonian, and underdamped methods that improve low-accuracy complexity.

Hamiltonian flowmomentum refreshmentunderdamped Langevinhypocoercivityacceleration
06
Source pp. 174–188 · partially formalized

Convergence in Rényi Divergence

Analyze LMC and ULMC in Rényi divergence using interpolation and Girsanov arguments.

Rényi divergenceLangevin Monte Carlounderdamped LMCcontinuous interpolationlocal truncation error
07
Source pp. 189–213 · planned

High-Accuracy Samplers

Use accept/reject correction and conductance tools to obtain exact-target chains.

proposal kernelacceptance ratiodetailed balanceconductancewarm start
08
Source pp. 214–232 · partially formalized

The Proximal Sampler

Study an augmented-variable sampler that isolates difficult geometry in a proximal subproblem.

proximal distributionrestricted Gaussian oracledata augmentationconditional Gibbs update
09
Source pp. 233–248 · planned

Lower Bounds for Sampling

Identify which dimension, smoothness, condition-number, and accuracy dependences are unavoidable.

minimax riskpackingtesting reductionoracle lower boundhard family
10
Source pp. 249–271 · planned

Structured Sampling

Adapt Langevin analysis to stochastic gradients, coordinate updates, and mirror geometry.

stochastic gradientcoordinate methodmirror maprelative smoothnessnon-Euclidean diffusion
11
Source pp. 272–282 · partially formalized

Non-Log-Concave Sampling

Use Fisher information to formulate and analyze approximate stationarity for non-log-concave targets, then compare upper and lower bounds.

Fisher informationfirst-order stationaritynonconvex Langevin dynamicsdissipativitylower bounds
12
Source pp. 283–296 · partially formalized

Diffusion Generative Models

Connect sampling analysis to score-based reverse diffusions and generative modeling.

forward diffusionscoretime reversaldenoisingscore error