~/talk

Sampling for Linear Algebra, Statistics, and Optimization II

links:none on file
slides:none on file

Mixing importance sampling with a small uniform fraction reduces estimator variance, with an empirical sweet spot near half leverage plus half uniform (roughly 0.7 in one setup). Claims rest on Taylor expansions and asymptotic MSE formulas that put sampling probabilities in the denominator, and on algorithmic proxies for leverage like low-stretch spanning trees for graphs (million × 10 million incidence example). Practical workflows use sketching plus iterate via Hessian sketch, and bootstrap heuristics predict ~63% coverage from coupon-collector sampling.

AI-written summary · about

  1. 0:00Intro
  2. 3:02Extensions and Applications of Basic Rand NLA Principles
  3. 9:06Statistics versus machine learning
  4. 14:00Bias and variance of subsampling estimators (1 of 3)
  5. 17:25Bias and variance of subsampling estimators (3 of 3)
  6. 22:08Tackling statistical properties of subsampling estimators
  7. 23:56Subsampling Estimators for Estimating the Parameter
  8. 27:49The statistical approach
  9. 28:47A statistical perspective on the algorithmic approach
  10. 30:14Corollary of key structural lemma
  11. 34:42A statistical perspective on randomized sketching (2 of 2)
  12. 35:34Sketched ridge regression
  13. 39:19Summary of connection with Bootstrapping
  14. 42:49Optimization Overview
  15. 50:45Brief overview of stochastic optimization
  16. 53:49Sub-sampled second-order optimization
~/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.