Views Navigation

Event Views Navigation

Calendar of Events

S Sun

M Mon

T Tue

W Wed

T Thu

F Fri

S Sat

0 events,

0 events,

0 events,

0 events,

1 event,

2 events,

Stochastics and Statistics Seminar Series Christopher Harshaw

0 events,

0 events,

1 event,

IDSS Distinguished Seminar Series Marco Cuturi

1 event,

0 events,

0 events,

2 events,

Stochastics and Statistics Seminar Series Boris Hanin

IDSS Academic Programs Fotini Christia

0 events,

0 events,

0 events,

0 events,

0 events,

0 events,

2 events,

MIT Policy Hackathon 2024

Stochastics and Statistics Seminar Series Rina Foygel Barber

1 event,

1 event,

IDSS Academic Programs Bernardo García Bulle Bueno

1 event,

0 events,

1 event,

2 events,

Stochastics and Statistics Seminar Series Ofer Shayevitz

IDSS Academic Programs Fotini Christia

0 events,

0 events,

0 events,

0 events,

0 events,

0 events,

0 events,

0 events,

The Conflict Graph Design: Estimating Causal Effects Under Interference

Christopher Harshaw (Columbia University)
E18-304

Abstract: From clinical trials to corporate strategy, randomized experiments are a reliable methodological tool for estimating causal effects. In recent years, there has been a growing interest in causal inference under interference, where treatment given to one unit can affect outcomes of other units. While the literature on interference has focused primarily on unbiased and consistent estimation, designing randomized network experiments to insure tight rates of convergence is relatively under-explored. Not only are the optimal rates of estimation for different…

Find out more »

On Parameterizing Optimal Transport with Elastic Costs

Marco Cuturi (Apple)
MIT Building E18, Room 304

About the Talk: "I will present in this talk an overview of the computations of optimal transport, focusing in particular on the challenge of computing OT maps using two samples from high-dimensional probability measures. After reviewing a few of the popular methods that have been explored for this task recently, including those leveraging neural architectures, I will introduce our recent work on parameterising OT problems with elastic costs, i.e. ground costs that mix the classic squared Euclidean distance with a…

Find out more »

Scaling Limits of Neural Networks

Boris Hanin (Princeton University)
E18-304

Abstract: Neural networks are often studied analytically through scaling limits: regimes in which taking to infinity structural network parameters such as depth, width, and number of training datapoints results in simplified models of learning. I will survey several such approaches with the goal of illustrating the rich and still not fully understood space of possible behaviors when some or all of the network’s structural parameters are large. Bio: Boris Hanin is an Assistant Professor at Princeton Operations Research and Financial…

Find out more »

SES Admissions Q&A

Fotini Christia (IDSS)
Zoom

Learn about the Social and Engineering Systems Doctoral Program by attending one of SES's 2025 Admissions Q&A sessions. These are virtual question & answer sessions hosted by a member of the IDSS faculty as a follow-up to the pre-recorded SES Admissions Webinar. The SES Admissions Webinar should be viewed prior to attending the Q&A. Register!

Find out more »

MIT Policy Hackathon 2024

Convened by IDSS and TPP students, the Policy Hackathon addresses societal challenges via data and policy analysis. Participants work in teams to develop creative policy solutions to real problems sponsored by partners in government, non-profit, and industry.

Find out more »

Evaluating a black-box algorithm: stability, risk, and model comparisons

Rina Foygel Barber (University of Chicago)
E18-304

Abstract: When we run a complex algorithm on real data, it is standard to use a holdout set, or a cross-validation strategy, to evaluate its behavior and performance. When we do so, are we learning information about the algorithm itself, or only about the particular fitted model(s) that this particular data set produced? In this talk, we will establish fundamental hardness results on the problem of empirically evaluating properties of a black-box algorithm, such as its stability and its average…

Find out more »

MIT Policy Hackathon 2024

Convened by IDSS and TPP students, the Policy Hackathon addresses societal challenges via data and policy analysis. Participants work in teams to develop creative policy solutions to real problems sponsored by partners in government, non-profit, and industry.

Find out more »

MIT Policy Hackathon 2024

Convened by IDSS and TPP students, the Policy Hackathon addresses societal challenges via data and policy analysis. Participants work in teams to develop creative policy solutions to real problems sponsored by partners in government, non-profit, and industry.

Find out more »

SES Dissertation Defense

Bernardo García Bulle Bueno (IDSS)
E18-304

Creating Links: Building an Educational Platform to Ask Questions in Education ABSTRACT In this thesis, I document the findings and process through which with my colleague Salome Aguilar Llanes we built an educational platform (JANN) to do research while having a positive impact on a community. Through JANN we have coordinated more than 100k hours of tutoring sessions and built (to our knowledge) one of the largest databases of educational recordings in the world. Broadly the contributions here are twofold:…

Find out more »

Statistical Inference with Limited Memory

Ofer Shayevitz (Tel Aviv University)
E18-304

Abstract:  In statistical inference problems, we are typically given a limited number of samples from some underlying distribution, and we wish to estimate some property of that distribution, under a given measure of risk. We are usually interested in characterizing and achieving the best possible risk as a function of the number of available samples. Thus, it is often implicitly assumed that samples are co-located, and that communication bandwidth as well as computational power are not a bottleneck, essentially making the number…

Find out more »

SES Admissions Q&A

Fotini Christia (IDSS)
Zoom

Learn about the Social and Engineering Systems Doctoral Program by attending one of SES's 2025 Admissions Q&A sessions. These are virtual question & answer sessions hosted by a member of the IDSS faculty as a follow-up to the pre-recorded SES Admissions Webinar. The SES Admissions Webinar should be viewed prior to attending the Q&A. Register!

Find out more »


MIT Institute for Data, Systems, and Society
Massachusetts Institute of Technology
77 Massachusetts Avenue
Cambridge, MA 02139-4307
617-253-1764