Algorithmic Stability for Interactive Data Analysis
summary
Interactive reuse of data causes severe overfitting: naive empirical answers let an adaptive procedure reach correlation about √D/√N (even perfect when D > N). Stability measured as distributional stability (inspired by differential privacy) prevents that by limiting information leaked about the sample. Practical remedy: answer statistical queries by adding noise (e.g. add Gaussian noise to empirical estimates) and get improved accuracy roughly error O(K^{1/4}/√N) instead of √K/√N. Remaining limits: dependence on ambient dimension D and worst-case computational barriers via fingerprinting-code attacks.
AI-written summary · about
chapters (15)
- 0:00Intro
- 0:48Statistical Theory: One-Way Streets
- 2:04Statistical Practice: Traffic Circles
- 2:57Examples of Interaction
- 4:48Possible Approaches
- 8:23Overfitting in Interactive Data Analysis
- 13:07How to Avoid This Trap?
- 14:51Output Stability
- 16:19Distributional Stability (aka Privacy)
- 18:55A General Framework
- 21:11Example: Statistical Queries (SQs)
- 22:03The Empirical Estimator
- 23:19An Improved Estimator
- 24:37Proof Overview
- 29:10Summary of Results
related talks
53mDesigning Robust Learners
01h 04mAlgorithmic High Dimensional Robust Statistics II
01h 14mStatistical Inference and Privacy, Part III
01h 00mAlgorithmic High Dimensional Robust Statistics I
01h 30mHigh-Dimensional Statistics I
48mComputational-Statistical Tradeoffs in Robust High-Dimensional Estimation
01h 00mDifferential Privacy And The Complexity Of Simple Queries
43mIs Interaction Necessary for Distributed Private Learning?
