Views Navigation

Event Views Navigation

Naive Feature Selection: Sparsity in Naive Bayes

Alexandre d'Aspremont (ENS, CNRS)
online

Abstract: Due to its linear complexity, naive Bayes classification remains an attractive supervised learning method, especially in very large-scale settings. We propose a sparse version of naive Bayes, which can be used for feature selection. This leads to a combinatorial maximum-likelihood problem, for which we provide an exact solution in the case of binary data, or a bound in the multinomial case. We prove that our bound becomes tight as the marginal contribution of additional features decreases. Both binary and…

Find out more »

The Ethical Algorithm

Michael Kearns (University of Pennsylvania)
online

Title: The Ethical Algorithm Abstract: Many recent mainstream media articles and popular books have raised alarms over anti-social algorithmic behavior, especially regarding machine learning and artificial intelligence. The concerns include leaks of sensitive personal data by predictive models, algorithmic discrimination as a side-effect of machine learning, and inscrutable decisions made by complex models. While standard and legitimate responses to these phenomena include calls for stronger and better laws and regulations, researchers in machine learning, statistics and related areas are also…

Find out more »

SES & IDPS Dissertation Defense – Rui Sun

Rui Sun
online

Online Learning and Optimization in Operations Management ABSTRACT We study in this thesis online learning and optimization problems in operations management where we need to make decisions in the face of incomplete information and operational constraints in a dynamic environment. We first consider an online matching problem where a central platform needs to match a number of limited resources to different groups of users that arrive sequentially over time. The platform does not know the reward of each matching option…

Find out more »

Stein’s method for multivariate continuous distributions and applications

Gesine Reinert, University of Oxford
online

Abstract: Stein’s method is a key method for assessing distributional distance, mainly for one-dimensional distributions. In this talk we provide a general approach to Stein’s method for multivariate continuous distributions. Among the applications we consider is the Wasserstein distance between two continuous probability distributions under the assumption of existence of a Poincare constant. This is joint work with Guillaume Mijoule (INRIA Paris) and Yvik Swan (Liege). - Bio: Gesine Reinert is a Research Professor of the Department of Statistics and…

Find out more »

Causal Inference and Overparameterized Autoencoders in the Light of Drug Repurposing for SARS-CoV-2

Caroline Uhler, MIT
online

Abstract:  Massive data collection holds the promise of a better understanding of complex phenomena and ultimately, of better decisions. An exciting opportunity in this regard stems from the growing availability of perturbation / intervention data (drugs, knockouts, overexpression, etc.) in biology. In order to obtain mechanistic insights from such data, a major challenge is the development of a framework that integrates observational and interventional data and allows predicting the effect of yet unseen interventions or transporting the effect of interventions…

Find out more »

Webinar: Inside the MITx MicroMasters Program in Statistics and Data Science

Online

Ready to start your data science journey? To help train for this in-demand field, IDSS has created the MITx MicroMasters® Program in Statistics and Data Science. In this 60-minute engaging and interactive webinar, you will: Learn more about the courses in the program. Find out how these courses could bring you to MIT or other universities around the world for a graduate program. Hear about the exclusive benefits for learners who upgrade to the MicroMasters Program track. Get real-time answers to your questions.…

Find out more »

Separating Estimation from Decision Making in Contextual Bandits

Dylan Foster, MIT
online

Abstract: The contextual bandit is a sequential decision making problem in which a learner repeatedly selects an action (e.g., a news article to display) in response to a context (e.g., a user’s profile) and receives a reward, but only for the action they selected. Beyond the classic explore-exploit tradeoff, a fundamental challenge in contextual bandits is to develop algorithms that can leverage flexible function approximation to model similarity between contexts, yet have computational requirements comparable to classical supervised learning tasks…

Find out more »

Bayesian inverse problems, Gaussian processes, and partial differential equations

Richard Nickl - University of Cambridge
online

Abstract: The Bayesian approach to inverse problems has become very popular in the last decade after seminal work by Andrew Stuart (2010) and collaborators. Particularly in non-linear applications with PDEs and when using Gaussian process priors, this can leverage powerful MCMC methodology to tackle difficult high-dimensional and non-convex inference problems. Little is known in terms of rigorous performance guarantees for such algorithms. After laying out the main ideas behind Bayesian inversion, we will discuss recent progress providing both statistical and…

Find out more »


MIT Statistics + Data Science Center
Massachusetts Institute of Technology
77 Massachusetts Avenue
Cambridge, MA 02139-4307
617-253-1764