LIDS & Stats Tea

Tea talks are 20 minute long informal chalk-talks for the purpose of sharing ideas and making others aware about some of the topics that may be of interest to the LIDS and Stats audience. If you are interested in presenting in the upcoming seminars, please email lids_stats_tea[at]mit[dot]edu

September 21, 2017

Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets

Ashkan Jasour (CSAIL)

This talk addresses the  “chance constrained problems”, optimization problems with probabilistic constraints, and also "chance optimization" where one aims at maximizing the probability of a set defined by polynomial inequalities. These problems are...

September 28, 2017

Polynomial Time Algorithms for Dual Volume Sampling

Chengtao Li (CSAIL)

I will talk briefly about our recent work on polynomial time algorithms for dual volume sampling (DVS), accepted by NIPS this year. DVS is a method for selecting k columns from an n × m short and wide matrix (n ≤ k ≤ m) such that the probability of...

October 5, 2017

Verification and Synthesis with Linear Temporal Logic Specifications

Cristian Ioan Vasile (LIDS)

This talk introduces the basic principles on formal verification and synthesis for dynamical systems. The two problems lie at the intersection of control theory and computer science, and play a fundamental role in applications requiring correctness...

October 6, 2017

How to apply for your dream academic job: a practical overview

Luca Carlone (LIDS & AeroAstro)

Applying and getting a faculty position involves a number of steps. Knowing where to find advertisements of open positions, what to expect during the different phases of the application process, and preparing for the interview season is crucial to...

October 12, 2017

Re-thinking Information Freshness with Age-of-Information

Rajat Talak (LIDS)

Exchanging timely updates over wireless network is gaining increasing relevance with the advent of technologies such as vehicular networks, internet-of-things, and futuristic network of unmanned aerial vehicles. Traditionally, packet delay has been...

October 19, 2017

Compressing Financial Networks

Tarik Roukny (Media Lab)

We study how the size of financial markets can be reduced while satisfying individual net positions and trading relationships. First, we find that the networked nature of these markets generates an excess of notional obligations between the...

October 26, 2017

The Polynomial Method and the Cap SET Problem

Pritish Kamath (CSAIL)

If you have played the popular card game, SET, you have probably wondered about what is the largest number of cards that one could have that does not contain a SET. This number was shown to be 20 in the classic game of SET. But one could ask the...

November 2, 2017

The Network Topology of Locally Interacting Agents and System-Level Distributions of Agent Actions

Janelle Schlossberger (Harvard Economics)

This work develops the mathematics that underlies many agent-based models and multi-agent systems, both of which could only previously be studied by computer simulation. It also introduces complexity into the study of economic systems while...

November 9, 2017

Practical Distance-Preserving Compression with Provable Guarantees

Tal Wagner (CSAIL)

Distance-preserving compression (or quantization) is a widely used tool for speeding up machine learning and data mining tasks such as near-neighbor searches. The goal is to compress a large high-dimensional dataset so as to approximately preserve...

November 16, 2017

Omer Tanovic

Omer Tanovic (LIDS)

November 30, 2017

Permutation-based Causal Inference Algorithms with Interventions

Yuhao Wang (LIDS)

Causal inference using both observational and interventional data is a fundamentally important problem in real world applications. In this paper, we present two algorithms of this type and prove that both are consistent under the faithfulness...

December 7, 2017

Ulas Ayaz

Ulas Ayaz (LIDS)