2021-2022 Seminars

This is the second talk in a three-part series presented together with Roei Tell.

The series is intended to survey the fast-paced recent developments in the study of derandomization. We will present:

1. A revised version of the classical hardness...

We extend the classical theory of PAC learning in a way which allows to model a rich variety of practical learning tasks where the data satisfies special properties that ease the learning process. This is done by considering partial concepts...

This is the first talk in a three-part series presented together with Lijie Chen.

The series is intended to survey the fast-paced recent developments in the study of derandomization. We will present:

1. A revised version of the classical hardness...

This talk will serve as an introduction to the random algebraic method. This method has its origins in the following problem: suppose the binomial random graph comes "close" to having some property of interest P, but fails to do so because of the...

I will discuss the difficult problem of proving reasonable bounds in the multidimensional generalization of Szemerédi's theorem. Most of the first talk will be spent going over Shkredov's proof of good bounds for sets lacking corners, in preparation...

The degree mantra states that any non-zero univariate polynomial of degree at most d has at most d roots (counted with multiplicity). A generalization of this to the multivariate setting, proved by Dvir-Kopparty-Saraf-Sudan asserts that over any...

I will discuss the difficult problem of proving reasonable bounds in the multidimensional generalization of Szemerédi's theorem.  Most of the first talk will be spent going over Shkredov's proof of good bounds for sets lacking corners, in...

Reproducibility is vital to ensuring scientific conclusions are reliable, but failures of reproducibility have been a major issue in nearly all scientific areas of study in recent decades. A key issue underlying the reproducibility crisis is the...