Tradeoffs in Large Scale Learning: Statistical Accuracy vs. Numerical Precision
summary
Claims an algorithm based on variance-reduced gradient ideas drives the excess risk to the empirical-risk-minimizer rate sigma^2/n while using one-pass streaming access and O(1) memory per sample. Method alternates cheap correction updates with occasional larger gradient estimates whose sample size doubles, killing initial error quickly, is trivially parallelizable, and avoids dimension/condition-number blowup. Targets linear, logistic and other GLMs; theoretical guarantees show constant-factor optimality, practical tuning is robust though no large-scale benchmarks are given.
AI-written summary · about
chapters (13)
- 0:00Intro
- 1:09Statistical estimation involves optimization
- 2:09Statistics vs. Computation
- 3:00Machine learning at scale!
- 5:35The Stochastic Optimization Problem
- 7:40Without Computational Constraints...
- 12:34Outline
- 13:05(just) Statistics
- 15:11(just) Computation
- 16:50Stochastic Gradient Descent (SGD)
- 19:32Stochastic Variance Reduced Gradient (SVRG)
- 25:28Computation + Statistics
- 28:09Single Pass Least Squares Estimation
related talks
01h 01mRobustness, Stochastics, Uncertainty 2
42mWhat (Doesn't) Make Learning Algorithms Generalize?
33mStochastic Optimization for Big Data Machine Learning Problems
13mNon-Parametric Convergence Rates for Plain Vanilla Stochastic Gradient Descent
01h 05mOptimization for Machine Learning I
01h 04mOptimization for Machine Learning II
53mDesigning Robust Learners
01h 07mLarge-Scale Private Learning, Part II
