Views Navigation

Event Views Navigation

Today

Univariate total variation denoising, trend filtering and multivariate Hardy-Krause variation denoising

E18-304 , United States

Abstract: Total variation denoising (TVD) is a popular technique for nonparametric function estimation. I will first present a theoretical optimality result for univariate TVD for estimating piecewise constant functions. I will then present related results for various extensions of univariate TVD including adaptive risk bounds for higher-order TVD (also known as trend filtering) as well…

Using Computer Vision to Study Society: Methods and Challenges

32-G449 (KIva/Patel)

  Abstract: Targeted socio-economic policies require an accurate understanding of a country's demographic makeup. To that end, the United States spends more than 1 billion dollars a year gathering census data such as race, gender, education, occupation and unemployment rates. Compared to the traditional method of collecting surveys across many years which is costly and…

Automatic Computation of Exact Worst-Case Performance for First-Order Methods

32-155

Joint work with Adrien Taylor (INRIA) and Francois Glineur (UCLouvain). We show that the exact worst-case performances of a wide class of first-order convex optimization algorithms can be obtained as solutions to semi-definite programs, which provide both the performance bounds and functions on which these are reached.  Our formulation is based on a necessary and…

Subvector Inference in Partially Identified Models with Many Moment Inequalities

E18-304 , United States

Abstract: In this work we consider bootstrap-based inference methods for functions of the parameter vector in the presence of many moment inequalities where the number of moment inequalities, denoted by p, is possibly much larger than the sample size n. In particular this covers the case of subvector inference, such as the inference on a…

Optimization of random polynomials on the sphere in the full-RSB regime

E18-304 , United States

Abstract: The talk will focus on optimization on the high-dimensional sphere when the objective function is a linear combination of homogeneous polynomials with standard Gaussian coefficients. Such random processes are called spherical spin glasses in physics, and have been extensively studied since the 80s. I will describe certain geometric properties of spherical spin glasses unique…

A Particulate Solution: Data Science in the Fight to Stop Air Pollution and Climate Change | IDSS Distinguished Speaker Seminar

E18-304 , United States

Abstract: What if I told you I had evidence of a serious threat to American national security – a terrorist attack in which a jumbo jet will be hijacked and crashed every 12 days. Thousands will continue to die unless we act now. This is the question before us today – but the threat doesn’t…

SDSCon2019

MIT Media Lab (E14-674) , United States

SDSCon 2019 is the third annual celebration of the statistics and data science community at MIT and beyond, organized by MIT’s Statistics and Data Science Center (SDSC).

MIT Policy Hackathon 2019

MIT Stata Center Cambridge, MA, United States

The MIT Policy Hackathon is a 48-hour hackathon that will gather participants to work together in teams to propose creative policy solutions using a combination of robust data analytics and domain knowledge.

Personalized Dynamic Pricing with Machine Learning: High Dimensional Covariates and Heterogeneous Elasticity

32-155

We consider a seller who can dynamically adjust the price of a product at the individual customer level, by utilizing information about customers’ characteristics encoded as a $d$-dimensional feature vector. We assume a personalized demand model, parameters of which depend on $s$ out of the $d$ features. The seller initially does not know the relationship…

Exponential line-crossing inequalities

E18-304 , United States

Abstract: This talk will present a class of exponential bounds for the probability that a martingale sequence crosses a time-dependent linear threshold. Our key insight is that it is both natural and fruitful to formulate exponential concentration inequalities in this way. We will illustrate this point by presenting a single assumption and a single theorem…


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