Generalization Bounds for Uniformly Stable Algorithms

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=cQlDAMeAyjc


Duration: 41:12
1,036 views
13

Vitaly Feldman (Google)
https://simons.berkeley.edu/talks/generalization-bounds-uniformly-stable-algorithms
Robust and High-Dimensional Statistics



Other Videos By Simons Institute for the Theory of Computing


2018-11-01Robust Sparse Covariance Estimation by Thresholding Tyler's M-estimator
2018-11-01Simons Institute Polylogues: Algorithmic Fairness and Quantum Computation
2018-10-31A Flexible Framework for Hypothesis Testing in High-Dimensions
2018-10-31The Robustness of Controlling the False Discovery Rate
2018-10-31Controlling FDR While Highlighting Selected Discoveries
2018-10-30Robustness in High-Dimensional Inference Tasks
2018-10-30A Modern Maximum-Likelihood Theory for High-Dimensional Logistic Regression
2018-10-30TAP Free Energy, Spin Glasses, and Variational Inference
2018-10-30Some Problems of Robust High-dimensional Statistics
2018-10-30Orthogonal Machine Learning: Power and Limitations
2018-10-30Generalization Bounds for Uniformly Stable Algorithms
2018-10-30Invariance, Causality and Novel Robustness
2018-10-30Mixture Models, Robustness, and Sum of Squares Proofs
2018-10-29The Importance of Better Models in Stochastic Optimization...
2018-10-29On Using Graph Distances to Estimate Euclidean and Related Distances
2018-10-29Detecting Weak Signals via Hypothesis Testing
2018-10-29Efficient Algorithms for Outlier-Robust Regression
2018-10-29Computational-Statistical Tradeoffs in Robust High-Dimensional Estimation
2018-10-29Robust List Decoding of Spherical Gaussians
2018-10-24Mathematical Theories of Communication: Old and New
2018-10-18Fully Understanding The Hashing Trick


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Robust and High-Dimensional Statistics
Vitaly Feldman