Seminars

Feb
20
2018

Computer Science/Discrete Mathematics Seminar II

Some closure results for polynomial factorization
Mrinal Kumar
10:30am|Simonyi Hall 101

In a sequence of extremely fundamental results in the 80's, Kaltofen showed that any factor of n-variate polynomial with degree and arithmetic circuit size poly(n) has an arithmetic circuit of size poly(n). In other words, the complexity class VP is...

Feb
12
2018

Computer Science/Discrete Mathematics Seminar I

Nonlinear dimensionality reduction for faster kernel methods in machine learning.
Christopher Musco
11:00am|Simonyi Hall 101

The Random Fourier Features (RFF) method (Rahimi, Recht, NIPS 2007) is one of the most practically successful techniques for accelerating computationally expensive nonlinear kernel learning methods. By quickly computing a low-rank approximation for...

Feb
06
2018

Computer Science/Discrete Mathematics Seminar II

Outlier-Robust Estimation via Sum-of-Squares
10:30am|Simonyi Hall 101

We develop efficient algorithms for estimating low-degree moments of unknown distributions in the presence of adversarial outliers. The guarantees of our algorithms improve in many cases significantly over the best previous ones, obtained in recent...

Feb
05
2018

Computer Science/Discrete Mathematics Seminar I

Locally Repairable Codes, Storage Capacity and Index Coding
Arya Mazumdar
11:00am|Simonyi Hall 101

An error-correcting code is called locally repairable if any coordinate of a codeword can be recovered by accessing only few other coordinates. For locally repairable codes over small alphabets (such as binary), the optimal trade-off between...

Feb
01
2018

Theoretical Machine Learning Seminar

Two approaches to (Deep) Learning with Differential Privacy
Kunal Talwar
12:15pm|White-Levy Room

Machine learning techniques based on neural networks are achieving remarkable results in a wide variety of domains. Often, the training of models requires large, representative datasets, which may be crowd-sourced and contain sensitive information...

Jan
30
2018

Computer Science/Discrete Mathematics Seminar II

Explicit, Epsilon-Balanced Codes Close to the Gilbert-Varshamov Bound
Amnon Ta-Shma
10:30am|S-101

I will show an explicit construction of a binary error correcting code with relative distance $\frac{1-\epsilon}{2}$ and relative rate $\epsilon^{2+o(1)}$. This comes close to the Gilbert-Varshamov bound that shows such codes with rate $\epsilon^2$...

Jan
29
2018

Computer Science/Discrete Mathematics Seminar I

Explicit, Epsilon-Balanced Codes Close to the Gilbert-Varshamov Bound
Amnon Ta-Shma
11:00am|S-101

I will show an explicit construction of a binary error correcting code with relative distance $\frac{1-\epsilon}{2}$ and relative rate $\epsilon^{2+o(1)}$. This comes close to the Gilbert-Varshamov bound that shows such codes with rate $\epsilon^2$...

Jan
25
2018

Theoretical Machine Learning Seminar

Prediction and Control of Linear Dynamical Systems
Cyril Zhang
12:15pm|White-Levy

Linear dynamical systems (LDSs) are a class of time-series models widely used in robotics, finance, engineering, and meteorology. I will present our "spectral filtering" approach to the identification and control of discrete-time LDSs with multi...