File size: 4,181 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 | import Mathlib
import OAI.Probability.LogConcave.Numerics.NodesContinuous
import OAI.Probability.LogConcave.Sampling.CenteringJointLaw
namespace OAI
section
section
noncomputable section
namespace LogConcaveSampling
open Set MeasureTheory ProbabilityTheory
open scoped NNReal
def probabilityRmsBudget {d : β} (F : Point d β β) (x : Point d)
(lam A : ββ₯0) (r h C : β) (k n N : β) : β :=
4*C*((lam:β)*r^2)*Real.sqrt d*(1+Real.log ((d:β)+1))^k*(2*h)^(n+1)+
(A*probabilityMeanLipschitz lam r:ββ₯0)^N*(2*probabilityInitialRms F x lam r)
theorem kernel_probability_errors (n : β) (hn : 0<n) :
βA : ββ₯0,βC : β,0β€C β§ βk : β,β{d : β} {F : Point d β β} {lam : ββ₯0},
βhF : Primitive F lam,β(x : Point d) {r : β},βhr : 0<r,
0<lam β βhl : (lam:β)*r^2β€1/2,1β€d β
β{T h : β},βhT0 : 0<T,βhT1 : T<1,βhh : 0<h,hβ€Real.log 2 β
A*probabilityMeanLipschitz lam rβ€1/2 β βN : β,βs e : ProbabilityNode T h n,
let S : Icc (0:β) T := β¨probabilityNodeTime T h n s,probabilityNodeTime_mem hT0 hT1 hh hn sβ©
let E : Icc (0:β) T := β¨probabilityNodeTime T h n e,probabilityNodeTime_mem hT0 hT1 hh hn eβ©
let ΞΌ := gibbs (centeringPotential F x r S)
let forward := probabilityTransport hF x hr.le hl hT0.le hT1 S E
let pos := fun y : Point (d+d) => (productPointEquiv d d y).1
(Integrable (fun y => βprobabilityAnchoredPicard F x r T h n N e (forward (pos y)) s-pos yβ^2) ΞΌ β§
(β«y,βprobabilityAnchoredPicard F x r T h n N e (forward (pos y)) s-pos yβ^2 βΞΌ)β€
(probabilityRmsBudget F x lam A r h C k n N)^2) β§
βΞ¨ : Point (d+d) β Point (d+d),Measurable Ξ¨ β ΞΌ.map Ξ¨=ΞΌ β
Integrable (fun y => βprobabilityAnchoredPicard F x r T h n (N+1) s (pos (Ξ¨ y)) e-
forward (pos (Ξ¨ y))β^2) ΞΌ β§
(β«y,βprobabilityAnchoredPicard F x r T h n (N+1) s (pos (Ξ¨ y)) e-
forward (pos (Ξ¨ y))β^2 βΞΌ)β€(probabilityRmsBudget F x lam A r h C k n (N+1))^2 := by
obtain β¨A,C,hC,k,hErrβ© := probabilityAnchored_marginal_rms n hn
refine β¨A,C,hC,k,?_β©
intro d F lam hF x r hr hlam hl hd T h hT0 hT1 hh hsmall hq N s e
dsimp only
let S : Icc (0:β) T := β¨probabilityNodeTime T h n s,probabilityNodeTime_mem hT0 hT1 hh hn sβ©
let E : Icc (0:β) T := β¨probabilityNodeTime T h n e,probabilityNodeTime_mem hT0 hT1 hh hn eβ©
let ΞΌ := gibbs (centeringPotential F x r S)
let fw := probabilityTransport hF x hr.le hl hT0.le hT1 S E
let bw := probabilityTransport hF x hr.le hl hT0.le hT1 E S
let pos := fun y : Point (d+d) => (productPointEquiv d d y).1
have hpos : Measurable pos := (productPointEquiv d d).continuous.measurable.fst
have hfw : Continuous fw := probabilityTransport_continuous hF x hr.le hl hT0.le hT1 S E
have hbw : Continuous bw := probabilityTransport_continuous hF x hr.le hl hT0.le hT1 E S
have hp : ΞΌ.map pos=interpolationLaw F x r S :=
centering_position_law hF x hr.le hl S.2.1 (S.2.2.trans_lt hT1)
have hfp : ΞΌ.map (fun y => fw (pos y))=interpolationLaw F x r E := by
change ΞΌ.map (fw β pos)=_
rw [βMeasure.map_map hfw.measurable hpos,hp]
exact probabilityTransport_pushforward hF x hr.le hl hT0.le hT1 S E
constructor
Β· have he := hErr hF x hr hlam hl hd hT0 hT1 hh hsmall hq N e s
have hm := ((probabilityAnchored_continuous hF x hr.le hl hT0 hT1 hh n hn N e s).sub hbw).measurable
have h := rms_bound_pullback (hfw.measurable.comp hpos) hfp hm he.1 he.2
have hc (y : Point d) : bw (fw y)=y := by
dsimp [bw,fw]
rw [probabilityTransport_cocycle,probabilityTransport_initial]
simpa only [Pi.sub_apply,Function.comp_def,hc,probabilityRmsBudget] using h
Β· intro Ξ¨ hm hlaw
have he := hErr hF x hr hlam hl hd hT0 hT1 hh hsmall hq (N+1) s e
have hΨ := harmonic_position_law hF x hr.le hl S.2.1 (S.2.2.trans_lt hT1) hm hlaw
exact rms_bound_pullback (hpos.comp hm) hΨ
((probabilityAnchored_continuous hF x hr.le hl hT0 hT1 hh n hn (N+1) s e).sub hfw).measurable
he.1 he.2
end LogConcaveSampling
end
end
end
end OAI
|