September 21, 2017
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
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
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
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
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
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
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
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
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 (LIDS)
November 30, 2017
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 (LIDS)