Views Navigation

Event Views Navigation

Latest Past Events

Influence maximization in stochastic and adversarial settings

We consider the problem of influence maximization in fixed networks, for both stochastic and adversarial contagion models. In the stochastic setting, nodes are infected in waves according to linear threshold or independent cascade models. We establish upper and lower bounds for the influence of a subset of nodes in the network, where the influence is defined as the expected number of infected nodes at the conclusion of the epidemic. We quantify the gap between our upper and lower bounds in…

Making Good Policies with Bad Causal Inference: The Role of Prediction and Machine Learning

In the last few decades, we have learned to be careful about causation, and have developed powerful tools for making causal inferences from data. Applying these tools has generated both policy impact and conceptual insights. Prof. Mullainathan will argue that there are a large class of problems where causal inference is largely unnecessary where, instead, prediction is the central challenge. These problems are ideally suited to machine learning and high dimensional data analysis tools. In this talk he will (1)…

An Extended Frank-Wolfe Method with Application to Low-Rank Matrix Completion

32-124

We present an extension of the Frank-Wolfe method that is designed to induce near-optimal solutions on low-dimensional faces of the feasible region. We present computational guarantees for the method that trade off efficiency in computing near-optimal solutions with upper bounds on the dimension of minimal faces of iterates. We apply our method to the low-rank matrix completion problem, where low-dimensional faces correspond to low-rank solutions. We present computational results for large-scale low-rank matrix completion problems that demonstrate significant speed-ups in…


© MIT Statistics + Data Science Center | 77 Massachusetts Avenue | Cambridge, MA 02139-4307 | 617-253-1764 |
      
Accessibility