Sampling for Linear Algebra, Statistics, and Optimization II
summary
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
chapters (16)
- 0:00Intro
- 3:02Extensions and Applications of Basic Rand NLA Principles
- 9:06Statistics versus machine learning
- 14:00Bias and variance of subsampling estimators (1 of 3)
- 17:25Bias and variance of subsampling estimators (3 of 3)
- 22:08Tackling statistical properties of subsampling estimators
- 23:56Subsampling Estimators for Estimating the Parameter
- 27:49The statistical approach
- 28:47A statistical perspective on the algorithmic approach
- 30:14Corollary of key structural lemma
- 34:42A statistical perspective on randomized sketching (2 of 2)
- 35:34Sketched ridge regression
- 39:19Summary of connection with Bootstrapping
- 42:49Optimization Overview
- 50:45Brief overview of stochastic optimization
- 53:49Sub-sampled second-order optimization
related talks
01h 02mImportance Sampling in High Dimensions via Hashing
33mRandomized Least Squares Optimization and its Incredible Utility for Large-Scale Tensor Decomp...
01h 26mStreaming, Sketching and Sufficient Statistics II
32mRandomized Numerical Linear Algebra: Overview
36mUnbiased Estimates for Linear Regression via Volume Sampling
34mError Estimation for Randomized Numerical Linear Algebra: Bootstrap Methods
48mRandomized Numerical Linear Algebra
01h 01mRobustness, Stochastics, Uncertainty 1
