Birs- 21w5070: Mathematical Statistics and Learning
-
Title: The Sum-of-Squares Algorithmic Paradigm in Statistics
Speaker:
Link:
-
Title: Provable Recovery of Boolean Interactions based on Random Forests
Speaker:
Link:
-
Title: The contact process over a switching random d-regular graph
Speaker:
Link:
-
Title: Non-Gaussian Component Analysis: Statistical Query Hardness and its Applications
Speaker:
Link:
-
Title: Efficient Mean Estimation with Pure Differential Privacy via a Sum-of-Squares Exponential Mechanism
Speaker:
Link:
-
Title: Variational Inference and Robustness
Speaker:
Link:
-
Title: The Sum-of-Squares Algorithmic Paradigm in Statistics
Speaker:
Link:
-
Title: Estimation of Stationary Optimal Transport Plans
Speaker:
Link:
-
Title: Rates of convergence of Gaussian smoothed empirical measures in Wasserstein and KL distances
Speaker:
Link:
-
Title: Self-regularization of nonparametric maximum likelihood in mixture models
Speaker:
Link:
-
Title: On Using Graph Distances to Estimate Euclidean and Related Distances
Speaker:
Link:
-
Title: Some recent results on Algorithmic Stability
Speaker:
Link:
-
Title: Confident Off-Policy Evaluation and Selection through Self-Normalized Importance Weighting
Speaker:
Link:
-
Title: The Sum-of-Squares Algorithmic Paradigm in Statistics
Speaker:
Link:
-
Title: Communication-efficient hypothesis testing
Speaker:
Link:
-
Title: Non-parametric exploration in multi-armed bandits
Speaker:
Link:
-
Title:
Speaker:
Link:
-
Title: Fundamental models of statistical learning and their combinatorial characterizations - negative results and implied open problems
Speaker:
Link:
-
Title: Adversarial examples in deep networks
Speaker:
Link: