~/talk

Compositional Properties of Statistical Procedures: An Information-Theoretic View

links:none on file
slides:none on file

Argues that mutual information and KL chain rules explain linear degradation under adaptive composition but fail for deterministic estimators (mutual information can be infinite), so stability uses erasure mutual information and, crucially, Wasserstein stability and transportation inequalities. Derives concrete bounds: Gibbs gives ~beta/N stability, SGD approximates ERM with extra error O(1/sqrt(T)) (so total O(1/N + 1/sqrt(T)); under strong convexity synchronous coupling yields contraction and stability essentially O(1/N). Uses Dobrushin comparison, couplings, and Markov-chain viewpoints; MCMC analysis is suggested but not completed.

AI-written summary · about

  1. 0:00Introduction to statistical decision procedures
  2. 17:37Stability and information theoretic measures
  3. 26:12Geometric approach to stability and Wasserstein distance
  4. 35:13Analyzing stochastic gradient descent stability
  5. 44:15The de Bruijn comparison theorem for composition
  6. 52:52Detailed SGD analysis and conclusion
~/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.