← Search

Richard Zemel

64 accepted papers

2026

Adaptive Group Elicitation via Multi-Turn LLM Interactions

ICML 2026poster

Eliciting information to reduce uncertainty about latent group-level properties is a central problem in collective assessment, preference modeling, and opinion aggregation, and is especially important in survey-based studies. While natural language interactions provide a flexible interface, existing…

Cited by 0SourceScholar
2025

Adaptive Elicitation of Latent Information Using Natural Language

ICML 2025poster

Eliciting information to reduce uncertainty about a latent entity is a critical task in many application domains, e.g., assessing individual student learning outcomes, diagnosing underlying diseases, or learning user preferences. Though natural language is a powerful medium for this purpose, large l…

Cited by 0SourcePDFScholar
2025

Guiding LLM Decision-Making with Fairness Reward Models

NeurIPS 2025poster

Large language models are increasingly used to support high-stakes decisions, potentially influencing who is granted bail or receives a loan. Naive chain-of-thought sampling can improve average decision accuracy, but has also been shown to amplify unfair bias. To address this challenge and enable th…

Cited by 0SourcecodeScholar
2025

QuEst: Enhancing Estimates of Quantile-Based Distributional Measures Using Model Predictions

ICML 2025poster

As machine learning models grow increasingly competent, their predictions can supplement scarce or expensive data in various important domains. In support of this paradigm, algorithms have emerged to combine a small amount of high-fidelity observed data with a much larger set of imputed model output…

Cited by 0SourcePDFScholar
2025

Towards Safety Reasoning in LLMs: AI-agentic Deliberation for Policy-embedded CoT Data Creation

ACL 2025finding

Safety reasoning is a recent paradigm where LLMs reason over safety policies before generating responses, thereby mitigating limitations in existing safety measures such as over-refusal and jailbreak vulnerabilities. However, implementing this paradigm is challenging due to the resource-intensive pr…

Cited by 0SourcePDFScholar
2024

Attribute Controlled Fine-tuning for Large Language Models: A Case Study on Detoxification

EMNLP 2024finding

We propose a constraint learning schema forfine-tuning Large Language Models (LLMs)with attribute control. Given a training corpusand control criteria formulated as a sequence-level constraint on model outputs, our methodfine-tunes the LLM on the training corpus whileenhancing constraint satisfactio…

Cited by 0SourcePDFScholar
2024

Controlling the World by Sleight of Hand

ECCV 2024oral

"Humans naturally build mental models of object interactions and dynamics, allowing them to imagine how their surroundings will change if they take a certain action. While generative models today have shown impressive results on generating/editing images unconditionally or conditioned on text, curre…

Cited by 3SourcePDFScholar
2024

FLIRT: Feedback Loop In-context Red Teaming

EMNLP 2024main

Warning: this paper contains content that may be inappropriate or offensive.As generative models become available for public use in various applications, testing and analyzing vulnerabilities of these models has become a priority. In this work, we propose an automatic red teaming framework that eval…

2024

Out of the Ordinary: Spectrally Adapting Regression for Covariate Shift

ICML 2024poster

Designing deep neural network classifiers that perform robustly on distributions differing from the available training data is an active area of machine learning research. However, out-of-distribution generalization for regression---the analogous problem for modeling continuous targets---remains rel…

Cited by 1SourcePDFScholar
2024

Prompt Risk Control: A Rigorous Framework for Responsible Deployment of Large Language Models

ICLR 2024poster

With the explosion of the zero-shot capabilities of (and thus interest in) pre-trained large language models, there has come accompanying interest in how best to prompt a language model to perform a given task. While it may be tempting to choose a prompt based on empirical results on a validation se…

2024

The steerability of large language models toward data-driven personas

NAACL 2024long

Large language models (LLMs) are known to generate biased responses where the opinions of certain groups and populations are underrepresented. Here, we present a novel approach to achieve controllable generation of specific viewpoints using LLMs, that can be leveraged to produce multiple perspective…

Cited by 26SourcePDFScholar
2024

Tokenization Matters: Navigating Data-Scarce Tokenization for Gender Inclusive Language Technologies

NAACL 2024findings

Gender-inclusive NLP research has documented the harmful limitations of gender binary-centric large language models (LLM), such as the inability to correctly use gender-diverse English neopronouns (e.g., xe, zir, fae). While data scarcity is a known culprit, the precise mechanisms through which scar…

2024

Toward Informal Language Processing: Knowledge of Slang in Large Language Models

NAACL 2024long

Recent advancement in large language models (LLMs) has offered a strong potential for natural language systems to process informal language. A representative form of informal language is slang, used commonly in daily conversations and online social media. To date, slang has not been comprehensively…

2024

Training-free Deep Concept Injection Enables Language Models for Video Question Answering

EMNLP 2024main

Recently, enabling pretrained language models (PLMs) to perform zero-shot crossmodal tasks such as video question answering has been extensively studied. A popular approach is to learn a projection network that projects visual features into the input text embedding space of a PLM, as well as feed-fo…

Cited by 1SourcePDFScholar
2023

Distribution-Free Statistical Dispersion Control for Societal Applications

NeurIPS 2023spotlight

Explicit finite-sample statistical guarantees on model performance are an important ingredient in responsible machine learning. Previous work has focused mainly on bounding either the expected loss of a predictor or the probability that an individual prediction will incur a loss value in a specifie…

Cited by 5SourcePDFScholar
2023

Quantile Risk Control: A Flexible Framework for Bounding the Probability of High-Loss Predictions

ICLR 2023poster

Rigorous guarantees about the performance of predictive algorithms are necessary in order to ensure their responsible use. Previous work has largely focused on bounding the expected loss of a predictor, but this is not sufficient in many risk-sensitive applications where the distribution of errors i…

2023

Resolving Ambiguities in Text-to-Image Generative Models

ACL 2023long

Natural language often contains ambiguities that can lead to misinterpretation and miscommunication. While humans can handle ambiguities effectively by asking clarifying questions and/or relying on contextual cues and common-sense knowledge, resolving ambiguities can be notoriously hard for machines…

2023

SurfsUP: Learning Fluid Simulation for Novel Surfaces

ICCV 2023poster

Modeling the mechanics of fluid in complex scenes is vital to applications in design, graphics, and robotics. Learning-based methods provide fast and differentiable fluid simulators, however most prior work is unable to accurately model how fluids interact with genuinely novel surfaces not seen duri…

Cited by 2PDFScholar
2022

Deep Ensembles Work, But Are They Necessary?

NeurIPS 2022accept

Ensembling neural networks is an effective way to increase accuracy, and can often match the performance of individual larger models. This observation poses a natural question: given the choice between a deep ensemble and a single neural network with similar accuracy, is one preferable over the othe…

2022

Implications of Model Indeterminacy for Explanations of Automated Decisions

NeurIPS 2022accept

There has been a significant research effort focused on explaining predictive models, for example through post-hoc explainability and recourse methods. Most of the proposed techniques operate upon a single, fixed, predictive model. However, it is well-known that given a dataset and a predictive task…

Cited by 15SourcePDFScholar
2021

A PAC-Bayesian Approach to Generalization Bounds for Graph Neural Networks

ICLR 2021poster

In this paper, we derive generalization bounds for two primary classes of graph neural networks (GNNs), namely graph convolutional networks (GCNs) and message passing GNNs (MPGNNs), via a PAC-Bayesian approach. Our result reveals that the maximum node degree and the spectral norm of the weights gove…

Cited by 121SourcePDFScholar
2021

Bayesian Few-Shot Classification with One-vs-Each Pólya-Gamma Augmented Gaussian Processes

ICLR 2021poster

Few-shot classification (FSC), the task of adapting a classifier to unseen classes given a small labeled dataset, is an important step on the path toward human-like machine learning. Bayesian methods are well-suited to tackling the fundamental issue of overfitting in the few-shot scenario because th…

2021

Learning a Universal Template for Few-shot Dataset Generalization

ICML 2021spotlight

Few-shot dataset generalization is a challenging variant of the well-studied few-shot classification problem where a diverse training set of several datasets is given, for the purpose of training an adaptable model that can then learn classes from \emph{new datasets} using only a few examples. To th…

2021

NP-DRAW: A Non-Parametric Structured Latent Variable Model for Image Generation

UAI 2021poster

In this paper, we present a non-parametric structured latent variable model for image generation, called NP-DRAW, which sequentially draws on a latent canvas in a part-by-part fashion and then decodes the image from the canvas. Our key contributions are as follows. 1) We propose a non-parametric pri…

2021

On Monotonic Linear Interpolation of Neural Network Parameters

ICML 2021spotlight

Linear interpolation between initial neural network parameters and converged parameters after training with stochastic gradient descent (SGD) typically leads to a monotonic decrease in the training objective. This Monotonic Linear Interpolation (MLI) property, first observed by Goodfellow et al. 201…

Cited by 15SourcePDFScholar
2021

Theoretical bounds on estimation error for meta-learning

ICLR 2021poster

Machine learning models have traditionally been developed under the assumption that the training and test distributions match exactly. However, recent success in few-shot learning and related problems are encouraging signs that these models can be adapted to more realistic settings where train and t…

Cited by 15SourcePDFScholar
2021

Variational Model Inversion Attacks

NeurIPS 2021poster

Given the ubiquity of deep neural networks, it is important that these models do not reveal information about sensitive data that they have been trained on. In model inversion attacks, a malicious user attempts to recover the private dataset used to train a supervised neural network. A successful mo…

2021

Wandering within a world: Online contextualized few-shot learning

ICLR 2021poster

We aim to bridge the gap between typical human and machine-learning environments by extending the standard framework of few-shot learning to an online, continual setting. In this setting, episodes do not have separate training and testing phases, and instead models are evaluated online while learnin…

2020

Causal Modeling for Fairness In Dynamical Systems

ICML 2020poster

In many applications areas—lending, education, and online recommenders, for example—fairness and equity concerns emerge when a machine learning system interacts with a dynamically changing environment to produce both immediate and long-term effects for individuals and demographic groups. We discuss…

2020

Learning the Stein Discrepancy for Training and Evaluating Energy-Based Models without Sampling

ICML 2020poster

We present a new method for evaluating and training unnormalized density models. Our approach only requires access to the gradient of the unnormalized model’s log-density. We estimate the Stein discrepancy between the data density p(x) and the model density q(x) based on a vector function of the dat…

2020

Optimizing Long-term Social Welfare in Recommender Systems: A Constrained Matching Approach

ICML 2020poster

Most recommender systems (RS) research assumes that a user’s utility can be maximized independently of the utility of the other agents (e.g., other users, content providers). In realistic settings, this is often not true – the dynamics of an RS ecosystem couple the long-term utility of all agents. I…

Cited by 74SourcePDFScholar
2020

Understanding the Limitations of Conditional Generative Models

ICLR 2020poster

Class-conditional generative models hold promise to overcome the shortcomings of their discriminative counterparts. They are a natural choice to solve discriminative tasks in a robust manner as they jointly optimize for predictive performance and accurate modeling of the input distribution. In this…

Cited by 59SourceScholar
2019

A Divergence Minimization Perspective on Imitation Learning Methods

CoRL 2019

In many settings, it is desirable to learn decision-making and control policies through learning or bootstrapping from expert demonstrations. The most common approaches under this Imitation Learning (IL) framework are Behavioural Cloning (BC), and Inverse Reinforcement Learning (IRL). Recent methods

2019

Efficient Graph Generation with Graph Recurrent Attention Networks

NeurIPS 2019poster

We propose a new family of efficient and expressive deep generative models of graphs, called Graph Recurrent Attention Networks (GRANs). Our model generates graphs one block of nodes and associated edges at a time. The block size and sampling stride allow us to trade off sample quality for efficienc…

2019

Excessive Invariance Causes Adversarial Vulnerability

ICLR 2019poster

Despite their impressive performance, deep neural networks exhibit striking failures on out-of-distribution inputs. One core idea of adversarial example research is to reveal neural network errors under such distribution shifts. We decompose these errors into two complementary sources: sensitivity a…

Cited by 201SourcePDFScholar
2019

Flexibly Fair Representation Learning by Disentanglement

ICML 2019oral

We consider the problem of learning representations that achieve group and subgroup fairness with respect to multiple sensitive attributes. Taking inspiration from the disentangled representation learning literature, we propose an algorithm for learning compact representations of datasets that are u…

2019

Incremental Few-Shot Learning with Attention Attractor Networks

NeurIPS 2019poster

Machine learning classifiers are often trained to recognize a set of pre-defined classes. However, in many applications, it is often desirable to have the flexibility of learning additional concepts, with limited data and without re-training on the full training set. This paper addresses this proble…

2019

LanczosNet: Multi-Scale Deep Graph Convolutional Networks

ICLR 2019poster

We propose Lanczos network (LanczosNet) which uses the Lanczos algorithm to construct low rank approximations of the graph Laplacian for graph convolution. Relying on the tridiagonal decomposition of the Lanczos algorithm, we not only efficiently exploit multi-scale information via fast approximated…

2019

SMILe: Scalable Meta Inverse Reinforcement Learning through Context-Conditional Policies

NeurIPS 2019poster

Imitation Learning (IL) has been successfully applied to complex sequential decision-making problems where standard Reinforcement Learning (RL) algorithms fail. A number of recent methods extend IL to few-shot learning scenarios, where a meta-trained policy learns to quickly master new tasks using l…

2019

Understanding the Origins of Bias in Word Embeddings

ICML 2019oral

Popular word embedding algorithms exhibit stereotypical biases, such as gender bias. The widespread use of these algorithms in machine learning systems can amplify stereotypes in important contexts. Although some methods have been developed to mitigate this problem, how word embedding biases arise d…

2018

Adversarial Distillation of Bayesian Neural Network Posteriors

ICML 2018accepted

Bayesian neural networks (BNNs) allow us to reason about uncertainty in a principled way. Stochastic Gradient Langevin Dynamics (SGLD) enables efficient BNN learning by drawing samples from the BNN posterior using mini-batches. However, SGLD and its extensions require storage of many copies of the m…

2018

Learning Adversarially Fair and Transferable Representations

ICML 2018oral

In this paper, we advocate for representation learning as the key to mitigating unfair prediction outcomes downstream. Motivated by a scenario where learned representations are used by third parties with unknown objectives, we propose and explore adversarial representation learning as a natural meth…

2018

Neural Guided Constraint Logic Programming for Program Synthesis

NeurIPS 2018poster

Synthesizing programs using example input/outputs is a classic problem in artificial intelligence. We present a method for solving Programming By Example (PBE) problems by using a neural model to guide the search of a constraint logic programming system called miniKanren. Crucially, the neural model…

2018

Neural Relational Inference for Interacting Systems

ICML 2018oral

Interacting systems are prevalent in nature, from dynamical systems in physics to complex societal dynamics. The interplay of components can give rise to complex behavior, which can often be explained using a simple model of the system’s constituent parts. In this work, we introduce the neural relat…

2018

Predict Responsibly: Improving Fairness and Accuracy by Learning to Defer

NeurIPS 2018poster

In many machine learning applications, there are multiple decision-makers involved, both automated and human. The interaction between these agents often goes unaddressed in algorithmic development. In this work, we explore a simple version of this interaction with a two-stage framework containing an…

2018

Reviving and Improving Recurrent Back-Propagation

ICML 2018oral

In this paper, we revisit the recurrent back-propagation (RBP) algorithm, discuss the conditions under which it applies as well as how to satisfy them in deep neural networks. We show that RBP can be unstable and propose two variants based on conjugate gradient on the normal equations (CG-RBP) and N…

2017

Causal Effect Inference with Deep Latent-Variable Models

NeurIPS 2017poster

Learning individual-level causal effects from observational data, such as inferring the most effective medication for a specific patient, is a problem of growing importance for policy makers. The most important aspect of inferring causal effects from observational data is the handling of confounders…

Cited by 972SourcePDFScholar
2016

Understanding the Effective Receptive Field in Deep Convolutional Neural Networks

NeurIPS 2016poster

We study characteristics of receptive fields of units in deep convolutional networks. The receptive field size is a crucial issue in many visual tasks, as the output must respond to large enough areas in the image to capture information about large objects. We introduce the notion of an effective re…

Cited by 2531SourcePDFScholar
2015

Skip-Thought Vectors

NeurIPS 2015poster

We describe an approach for unsupervised learning of a generic, distributed sentence encoder. Using the continuity of text from books, we train an encoder-decoder model that tries to reconstruct the surrounding sentences of an encoded passage. Sentences that share semantic and syntactic properties a…