Big Data: The Computation/Statistics Interface
summary
Argues that progress requires marrying computational ideas with statistical decision theory and gives concrete tools and numbers: convex relaxation hierarchies trade off runtime vs. sample size via a geometric quantity called Gaussian squared complexity (examples show complexity scaling like P^1/2 or P^1/4 across cuts, matchings and planted‑clique relaxations). Implements a cloud‑friendly estimator, the Bag of Little Bootstraps (BLB), which parallelizes resampling, cuts I/O for a quarter‑terabyte logistic regression and matches bootstrap accuracy while running orders of magnitude faster and retaining higher‑order correctness (O(1/n)).
AI-written summary · about
chapters (12)
- 0:00Start
- 3:31What is the Big Data Phenomenon?
- 6:36What is the Big Data Problem?
- 15:21Example of an Ultimate Goal
- 17:39Statistical Decision Theory 101
- 45:32Frequentist Perspective
- 48:50Computation/Statistics Tradeoffs
- 50:50Time-Data Tradeoffs
- 52:51An Estimation Problem
- 53:56Convex Programming Estimator
- 55:20Statistical Performance of Estimator
- 58:30Hierarchy of Convex Relaxations
related talks
43mComputational and Statistical Tradeoffs via Convex Relaxation
01h 04mStatistical Physics and Computation in High Dimension
01h 07mA Few Simple Average-Case Reduction Techniques And Their Surprising Effectiveness
38mRole of Statistics in the era of Big Data
01h 04m"More is Different." Also in Computing?
01h 12mPedagogical Talk: Frameworks for Information-Computation Tradeoffs
48mComputational-Statistical Tradeoffs in Robust High-Dimensional Estimation
01h 11mStatistical Physics and Computation in High Dimension
