Orthogonal Statistical Learning
summary
Provides finite-sample guarantees that make nuisance estimation a second-order error source by using a two-stage sample-splitting meta-algorithm plus Neyman orthogonality, giving oracle rates under metric-entropy conditions and concrete bounds for variance-penalized ERM, neural nets and sparse high‑dim linear models. Proposes a robust GMM SEVER‑style filter that runs in polynomial time and achieves O(sqrt(epsilon)) recovery under an epsilon‑contamination model (demonstrated on IV and semi‑synthetic 401K/labor data), and a practical pipeline to estimate the Riesz representer via min‑max or squared‑loss for automated debiasing with neural nets and forests.
AI-written summary · about
chapters (24)
- 0:00Intro
- 0:45The Ease of Use of Machine Learning
- 1:20The Ease of (mis)Use of Machine Learning
- 3:07Making CausalML Accessible to Every Decision-Maker
- 10:24Automated Outlier Removal
- 11:42Desiderata for a good robust estimator
- 12:41Estimation via Moment Conditions
- 14:15Generalized Method of Moments
- 14:44Our Results
- 17:17Two-part theorem
- 17:43Algorithm and Key Ingredients
- 21:29Example Application Theorem: IV Regression
- 22:57Experiments
- 24:37Application: NLSYM
- 27:03Method of Moments with Nuisance Functions
- 29:06De-biased moment
- 34:13The Adversarial Approach
- 36:40The Direct Loss Approach
- 38:04Formal Theorem
- 39:27Neural Network and Forest Heuristic Improvements
- 40:41Multi-Tasking
- 41:22Application: 401k
- 41:57Application: Gasoline Demand
- 43:56Beyond Linear Moments
related talks
44mOrthogonal Machine Learning: Power and Limitations
31mRealizing Robustness
01h 01mRobustness, Stochastics, Uncertainty 1
01h 02mSampling for Linear Algebra, Statistics, and Optimization II
01h 03mOverview of Statistical Learning Theory Part 2
48mComputational-Statistical Tradeoffs in Robust High-Dimensional Estimation
37mEfficient Algorithms for Reliable Machine Learning
44mActive Regression via Linear-Sample Sparsification
