February 7, 2018
Ayush Bhandari (MIT Media Lab)
Shannon's sampling theorem provides a link between the continuous and the discrete realms stating that bandlimited signals are uniquely determined by its values on a discrete set. This theorem is realized in practice using so called analog-to-...
February 14, 2018
Jean Pouget Abadie (Harvard)
Tech companies rely on online experiments to understand the impact of changes to their ecosystem or product. The classic assumption, on which these experiments depend, of no interference amongst users—that is, the fact that the outcome of a user...
February 21, 2018
Alyssa Pierson (CSAIL)
Multi-agent pursuit-evasion games are relevant to a number of emerging importance, such as security and surveillance, search and rescue, and wildlife monitoring. Originally inspired by the ``cops and robbers’’ game, the goal is to design pursuer...
February 28, 2018
Cheng Mao (Mathematics Department, MIT)
There has been a recent surge of interest in studying permutation-based models, such as the noisy sorting (NS) model and the strong stochastic transitivity (SST) model, for ranking from pairwise comparisons. Although permutation-based ranking models...
March 7, 2018
Zhi Xu (LIDS)
We formulate a private learning model to study an intrinsic tradeoff between privacy and query complexity in sequential learning. Our model involves a learner who aims to determine a scalar value, v*, by sequentially querying an external database...
March 14, 2018
Ilias Zadik (ORC)
In this talk, we focus on the high dimensional linear regression problem where the goal is to efficiently recover an unknown vector β* from n noisy linear observations Y = Xβ* + W ∈ ℝn, for known X ∈ ℝn × p and unknown W ∈ ℝn. Unlike most of the...
March 21, 2018
Govind Ramnarayan (CSAIL)
Locally decodable codes (resp. locally correctable codes), or LDCs (resp. LCCs), are codes for which individual symbols of the message (resp. codeword) and be recovered by reading just a few bits from a noisy codeword, which is corrupted with ...
April 4, 2018
Raj Agrawal (LIDS)
Learning a Bayesian network (BN) from data can be useful for decision-making or discovering causal relationships, but traditional methods can fail in modern applications, which often exhibit a larger number of observed variables than data points....
April 11, 2018
Gautam Kamath (CSAIL)
Gautam Kamath will discuss some his recent work on estimating distribution properties, with the additional constraint of guaranteeing the privacy of the sample. Some properties of interest include entropy, support size, and support coverage, which...
April 18, 2018
Anish Agarwal (LIDS)
We consider the task of interpolating and forecasting a time series in the presence of noise and missing data. As the main contribution of this work, we introduce an algorithm that transforms the observed time series into a matrix, utilizes singular...
May 9, 2018
Omer Tanovic (LIDS)
In this talk, we consider a problem of designing discrete-time systems which are optimal in frequency-weighted least squares sense subject to a maximal output amplitude constraint. It can be shown for such problems, in general, that the optimality...
May 16, 2018
Igor Gilitschenski (CSAIL)
Robotic Perception tasks typically involve processing uncertain quantities that are defined on inherently nonlinear domains. The most important among these domains involve the 2d and 3d manifolds of orientations and poses (which combines position...
