Seminars

Nov
27
2017

Computer Science/Discrete Mathematics Seminar I

Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound
11:00am|S-101

We show that there exist binary locally testable codes (for all rates) and locally correctable codes (for low rates) with rate and distance approaching the Gilbert-Varshamov bound (which is the best rate-distance tradeoff known for general binary...

Nov
21
2017

Computer Science/Discrete Mathematics Seminar II

A practical guide to deep learning
10:30am|S-101

Neural networks have been around for many decades. An important question is what has led to their recent surge in performance and popularity. I will start with an introduction to deep neural networks, covering the terminology and standard approaches...

Nov
14
2017

Computer Science/Discrete Mathematics Seminar II

Learning models: connections between boosting, hard-core distributions, dense models, GAN, and regularity II
10:30am|S-101

A theme that cuts across many domains of computer science and mathematics is to find simple representations of complex mathematical objects such as graphs, functions, or distributions on data. These representations need to capture how the object...

Nov
13
2017

Theoretical Machine Learning Seminar

Towards a better understanding of neural networks: learning dynamics, interpretability and RL generalization
Maithra Raghu
12:30pm|White-Levy Room

With the continuing successes of deep learning, it becomes increasingly important to better understand the phenomena exhibited by these models, ideally through a combination of systematic experiments and theory. In this talk I discuss some of our...

Nov
13
2017

Computer Science/Discrete Mathematics Seminar I

Learning models: connections between boosting, hard-core distributions, dense models, GAN, and regularity I
11:00am|S-101

A theme that cuts across many domains of computer science and mathematics is to find simple representations of complex mathematical objects such as graphs, functions, or distributions on data. These representations need to capture how the object...

Nov
07
2017

Computer Science/Discrete Mathematics Seminar II

Pseudorandom generators for unordered branching programs
10:30am

We present an explicit pseudorandom generator with seed length $\tilde{O}((\log n)^{w+1})$ for read-once, oblivious, width $w$ branching programs that can read their input bits in any order. This improves upon the work of Impaggliazzo, Meka and...

Nov
06
2017

Theoretical Machine Learning Seminar

Naturalizing a programming language
12:30pm

Our goal is to create a convenient natural language interface for performing well-specified but complex actions such as analyzing data, manipulating text, and querying databases. However, existing natural language interfaces for such tasks are quite...

Nov
06
2017

Computer Science/Discrete Mathematics Seminar I

Language edit distance, $(min,+)$-matrix multiplication & beyond
Barna Saha
11:00am

The language edit distance is a significant generalization of two basic problems in computer science: parsing and string edit distance computation. Given any context free grammar, it computes the minimum number of insertions, deletions and...

Oct
31
2017

Computer Science/Discrete Mathematics Seminar II

Cap-sets in $(F_q)^n$ and related problems
10:30am

A cap set in $(F_q)^n$ is a set not containing a three term arithmetic progression. Last year, in a surprising breakthrough, Croot-Lev-Pach and a follow up paper of Ellenberg-Gijswijt showed that such sets have to be of size at most $c^n$ with $c q...