← Search

Matt J Kusner

14 accepted papers

2023

Adapting to Latent Subgroup Shifts via Concepts and Proxies

AISTATS 2023poster

We address the problem of unsupervised domain adaptation when the source domain differs from the target domain because of a shift in the distribution of a latent subgroup. When this subgroup confounds all observed data, neither covariate shift nor label shift assumptions apply. We show that the opti…

2022

Causal inference with treatment measurement error: a nonparametric instrumental variable approach

UAI 2022poster

We propose a kernel-based nonparametric estimator for the causal effect when the cause is corrupted by error. We do so by generalizing estimation in the instrumental variable setting. Despite significant work on regression with measurement error, additionally handling unobserved confounding in the c…

Cited by 16SourcePDFScholar
2021

Unsupervised Point Cloud Pre-Training via Occlusion Completion

ICCV 2021poster

We describe a simple pre-training approach for point clouds. It works in three steps: 1. Mask all points occluded in a camera view; 2. Learn an encoder-decoder model to reconstruct the occluded points; 3. Use the encoder weights as initialisation for downstream point cloud tasks. We find that even w…

Cited by 300PDFcodeScholar
2020

A Class of Algorithms for General Instrumental Variable Models

NeurIPS 2020poster

Causal treatment effect estimation is a key problem that arises in a variety of real-world settings, from personalized medicine to governmental policy making. There has been a flurry of recent work in machine learning on estimating causal effects when one has access to an instrument. However, to ach…

2020

Barking up the right tree: an approach to search over molecule synthesis DAGs

NeurIPS 2020spotlight

When designing new molecules with particular properties, it is not only important what to make but crucially how to make it. These instructions form a synthesis directed acyclic graph (DAG), describing how a large vocabulary of simple building blocks can be recursively combined through chemical reac…

2019

A Generative Model For Electron Paths

ICLR 2019poster

Chemical reactions can be described as the stepwise redistribution of electrons in molecules. As such, reactions are often depicted using "arrow-pushing" diagrams which show this movement as a sequence of arrows. We propose an electron path prediction model (ELECTRO) to learn these sequences directl…

Cited by 90SourcePDFScholar
2019

A Model to Search for Synthesizable Molecules

NeurIPS 2019poster

Deep generative models are able to suggest new organic molecules by generating strings, trees, and graphs representing their structure. While such models allow one to generate molecules with desirable properties, they give no guarantees that the molecules can actually be synthesized in practice. We…

2019

The Sensitivity of Counterfactual Fairness to Unmeasured Confounding

UAI 2019poster

Causal approaches to fairness have seen substantial recent interest, both from the machine learning community and from wider parties interested in ethical prediction algorithms. In no small part, this has been due to the fact that causal models allow one to simultaneously leverage data and expert kn…

2017

When Worlds Collide: Integrating Different Counterfactual Assumptions in Fairness

NeurIPS 2017poster

Machine learning is now being used to make crucial decisions about people's lives. For nearly all of these decisions there is a risk that individuals of a certain race, gender, sexual orientation, or any other subpopulation are unfairly discriminated against. Our recent method has demonstrated how t…

Cited by 232SourcePDFScholar
2016

Supervised Word Mover's Distance

NeurIPS 2016oral

Accurately measuring the similarity between text documents lies at the core of many real world applications of machine learning. These include web-search ranking, document recommendation, multi-lingual document matching, and article categorization. Recently, a new document metric, the word mover's d…

2015

Fast Distributed k-Center Clustering with Outliers on Massive Data

NeurIPS 2015poster

Clustering large data is a fundamental problem with a vast number of applications. Due to the increasing size of data, practitioners interested in clustering have turned to distributed computation methods. In this work, we consider the widely used k-center clustering problem and its variant used t…

Cited by 108SourcePDFScholar