~/talk

Tools from Stochastic Calculus 3

Talkat Analysis and TCS Boot Camp 2023 · 2023-06-05..06-09· [machine-learning]
links:none on file
slides:none on file

Main lemma shows the stopping time τ when ∥∇f(x_t)∥ exceeds a fixed constant has probability ≥ 1/200 when Var(f) ≥ 1/100, via equality between expected quadratic variation and Var(f) and splitting before/after τ. A pseudo‑Brownian discretization defines x_t by dx_t = σ_t dB_t with σ_ii = √(1+ξ_t(1−ξ_t)) so σ_t slows near ±1. A level‑1 inequality (Gaussian isoperimetry) bounds ‖σ_t∇f‖, Dambis‑Dubins‑Schwarz reparametrizes martingales, and a comparison of quadratic variations bootstraps to Majority Is Stablest with improved bounds under small influences.

AI-written summary · about

  1. 0:00Martingale proof approach
  2. 11:24Defining stochastic processes
  3. 24:37Majority Stables theorem
  4. 36:09Level one inequality
  5. 55:54Dambis-Dubins-Schwarz theorem
  6. 1:02:01Q&A and discussion
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.