YoVDO

Combinatorial Testing Problems - Lecture 1

Offered By: Georgia Tech Research via YouTube

Tags

High-dimensional Statistics Courses Graph Theory Courses Computational Complexity Courses Probability Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore combinatorial testing problems and their statistical implications in this lecture by Gabor Lugosi from Pompeu Fabra University, part of the TRIAD Distinguished Lecture Series. Delve into the "hidden clique" problem as a prototypical example with a rich structure. Examine various combinatorial testing problems and their connections to high-dimensional random geometric graphs. Investigate the challenge of estimating the mean of a random variable, time permitting. Gain insights into the intersection of statistics and combinatorial structures through this 52-minute presentation delivered on October 15, 2018.

Syllabus

TRIAD Distinguished Lecture Series | Gabor Lugosi | Pompeu Fabra University | Lecture 1 (of 2)


Taught by

Georgia Tech Research

Related Courses

K-Means and K-Medians Under Dimension Reduction
Simons Institute via YouTube
Can Non-Convex Optimization Be Robust?
Simons Institute via YouTube
Robust Estimation and Generative Adversarial Nets
Simons Institute via YouTube
Invariance, Causality and Novel Robustness
Simons Institute via YouTube
The Importance of Better Models in Stochastic Optimization
Simons Institute via YouTube