← Search

Eric Nalisnick

34 accepted papers

2026

Compute When Worth It: Risk Control for Reasoning on a Compute Budget

ICML 2026poster

Reasoning Large Language Models (LLMs) enable test-time scaling, with dataset-level accuracy improving as the token budget increases, motivating adaptive reasoning---spending tokens when they improve reliability and stopping early when additional computation is unlikely to help. However, setting the…

Cited by 0SourceScholar
2026

Controlling the Risk of Corrupted Contexts for Language Models via Early-Exiting

ICML 2026poster

Large language models (LLMs) can be influenced by harmful or irrelevant context, which can significantly harm model performance on downstream tasks. This motivates principled designs in which LLM systems include built-in mechanisms to guard against such "garbage in, garbage out" scenarios. We propos…

Cited by 0SourceScholar
2026

Efficient and Uncertainty-Aware Diffusion Framework for Offline-to-Online Reinforcement Learning

ICML 2026poster

Offline-to-Online Reinforcement Learning (O2O-RL) leverages an offline, pre-trained policy to minimize costly online interactions. Although data-efficient, O2O-RL is susceptible to shifts between offline and online distributions. Existing work aims to mitigate the harm of this shift by finetuning th…

Cited by 0SourceScholar
2026

Joint Model and Data Sparsification via the Marginal Likelihood

ICML 2026poster

Sparse recovery in linear systems underpins applications from signal processing to high-dimensional regression. Sparse Bayesian Learning, grounded in the principle of automatic relevance determination (ARD), offers a practical Bayesian mechanism for feature sparsity via marginal likelihood optimizat…

Cited by 0SourceScholar
2026

Rethinking Calibration for Early-Exit Neural Networks

ICML 2026poster

Early-exit neural networks~(EENNs) accelerate inference by allowing intermediate classifiers to stop computation once predictions are confident enough. Most methods rely on confidence thresholds for exiting, and consequently, classifier calibration is widely assumed to improve performance. In this w…

Cited by 0SourceScholar
2025

Approximating Full Conformal Prediction for Neural Network Regression with Gauss-Newton Influence

ICLR 2025poster

Uncertainty quantification is an important prerequisite for the deployment of deep learning models in safety-critical areas. Yet, this hinges on the uncertainty estimates being useful to the extent the prediction intervals are well-calibrated and sharp. In the absence of inherent uncertainty estimat…

Cited by 0SourcePDFScholar
2025

DefVerify: Do Hate Speech Models Reflect Their Dataset’s Definition?

COLING 2025main

When building a predictive model, it is often difficult to ensure that application-specific requirements are encoded by the model that will eventually be deployed. Consider researchers working on hate speech detection. They will have an idea of what is considered hate speech, but building a model th…

2025

ELBOing Stein: Variational Bayes with Stein Mixture Inference

ICLR 2025poster

Stein variational gradient descent (SVGD) (Liu & Wang, 2016) performs approximate Bayesian inference by representing the posterior with a set of particles. However, SVGD suffers from variance collapse, i.e. poor predictions due to underestimating uncertainty (Ba et al., 2021), even for moderately-di…

2025

Generative Uncertainty in Diffusion Models

UAI 2025

Diffusion models have recently driven significant breakthroughs in generative modeling. While state-of-the-art models produce high-quality samples on average, individual samples can still be low quality. Detecting such samples without human inspection remains a challenging task. To address this, we

2025

Improving Handshape Representations for Sign Language Processing: A Graph Neural Network Approach

EMNLP 2025

Handshapes serve a fundamental phonological role in signed languages, with American Sign Language employing approximately 50 distinct shapes. However, computational approaches rarely model handshapes explicitly, which limits both recognition accuracy and linguistic analysis. We introduce a novel gra

Cited by 0SourcePDFScholar
2025

Max-Rank: Efficient Multiple Testing for Conformal Prediction

AISTATS 2025poster

Multiple hypothesis testing (MHT) frequently arises in scientific inquiries, and concurrent testing of multiple hypotheses inflates the risk of Type-I errors or false positives, rendering MHT corrections essential. This paper addresses MHT in the context of conformal prediction, a flexible framework…

Cited by 0SourceScholar
2025

On Continuous Monitoring of Risk Violations under Unknown Shift

UAI 2025

Machine learning systems deployed in the real world must operate under dynamic and often unpredictable distribution shifts. This challenges the validity of statistical safety assurances on the system’s risk established beforehand. Common risk control frameworks rely on fixed assumptions and lack mec

2024

A Generative Model of Symmetry Transformations

NeurIPS 2024poster

Correctly capturing the symmetry transformations of data can lead to efficient models with strong generalization capabilities, though methods incorporating symmetries often require prior knowledge. While recent advancements have been made in learning those symmetries directly from the dataset, most…

2024

Adaptive Bounding Box Uncertainties via Two-Step Conformal Prediction

ECCV 2024oral

"Quantifying a model’s predictive uncertainty is essential for safety-critical applications such as autonomous driving. We consider quantifying such uncertainty for multi-object detection. In particular, we leverage conformal prediction to obtain uncertainty intervals with guaranteed coverage for ob…

2024

Early-Exit Neural Networks with Nested Prediction Sets

UAI 2024poster

Early-exit neural networks (EENNs) facilitate adaptive inference by producing predictions at multiple stages of the forward pass. In safety-critical applications, these predictions are only meaningful when complemented with reliable uncertainty estimates. Yet, due to their sequential structure, an…

Cited by 1SourcePDFScholar
2024

Fast yet Safe: Early-Exiting with Risk Control

NeurIPS 2024poster

Scaling machine learning models significantly improves their performance. However, such gains come at the cost of inference being slow and resource-intensive. Early-exit neural networks (EENNs) offer a promising solution: they accelerate inference by allowing intermediate layers to exit and produc…

2024

Learning to Defer to a Population: A Meta-Learning Approach

AISTATS 2024poster

The learning to defer (L2D) framework allows autonomous systems to be safe and robust by allocating difficult decisions to a human expert. All existing work on L2D assumes that each expert is well-identified, and if any expert were to change, the system should be re-trained. In this work, we allevia…

2023

Do Bayesian Neural Networks Need To Be Fully Stochastic?

AISTATS 2023poster

We investigate the benefit of treating all the parameters in a Bayesian neural network stochastically and find compelling theoretical and empirical evidence that this standard construction may be unnecessary. To this end, we prove that expressive predictive distributions require only small amounts o…

2023

Exploiting Inferential Structure in Neural Processes

UAI 2023poster

Neural Processes (NPs) are appealing due to their ability to perform fast adaptation based on a context set. This set is encoded by a latent variable, which is often assumed to follow a simple distribution. However, in real-word settings, the context set may be drawn from richer distributions having…

2023

Learning to Defer to Multiple Experts: Consistent Surrogate Losses, Confidence Calibration, and Conformal Ensembles

AISTATS 2023poster

We study the statistical properties of learning to defer (L2D) to multiple experts. In particular, we address the open problems of deriving a consistent surrogate loss, confidence calibration, and principled ensembling of experts. Firstly, we derive two consistent surrogates—one based on a softmax p…

2023

Sampling-based inference for large linear models, with application to linearised Laplace

ICLR 2023poster

Large-scale linear models are ubiquitous throughout machine learning, with contemporary application as surrogate models for neural network uncertainty quantification; that is, the linearised Laplace method. Alas, the computational cost associated with Bayesian linear models constrains this method's…

2023

Towards Anytime Classification in Early-Exit Architectures by Enforcing Conditional Monotonicity

NeurIPS 2023poster

Modern predictive models are often deployed to environments in which computational budgets are dynamic. Anytime algorithms are well-suited to such environments as, at any point during computation, they can output a prediction whose quality is a function of computation time. Early-exit neural networ…

2022

Adapting the Linearised Laplace Model Evidence for Modern Deep Learning

ICML 2022spotlight

The linearised Laplace method for estimating model uncertainty has received renewed attention in the Bayesian deep learning community. The method provides reliable error bars and admits a closed-form expression for the model evidence, allowing for scalable selection of model hyperparameters. In this…

Cited by 39SourcePDFScholar
2021

Bayesian Deep Learning via Subnetwork Inference

ICML 2021spotlight

The Bayesian paradigm has the potential to solve core issues of deep neural networks such as poor calibration and data inefficiency. Alas, scaling Bayesian inference to large weight spaces often requires restrictive approximations. In this work, we show that it suffices to perform inference over a s…

2019

Bayesian Batch Active Learning as Sparse Subset Approximation

NeurIPS 2019poster

Leveraging the wealth of unlabeled data produced in recent years provides great potential for improving supervised models. When the cost of acquiring labels is high, probabilistic active learning methods can be used to greedily select the most informative data points to be labeled. However, for many…

2019

Do Deep Generative Models Know What They Don't Know?

ICLR 2019poster

A neural network deployed in the wild may be asked to make predictions for inputs that were drawn from a different distribution than that of the training data. A plethora of work has demonstrated that it is easy to find or synthesize inputs for which a neural network is highly confident yet wrong.…

Cited by 903SourcePDFScholar
2019

Hybrid Models with Deep and Invertible Features

ICML 2019oral

We propose a neural hybrid model consisting of a linear model defined on a set of features computed by a deep, invertible transformation (i.e. a normalizing flow). An attractive property of our model is that both p(features), the density of the features, and p(targets|features), the predictive distr…

Cited by 110SourcePDFScholar
2018

THE EFFECTIVENESS OF A TWO-LAYER NEURAL NETWORK FOR RECOMMENDATIONS

ICLR 2018workshop

We present a personalized recommender system using neural network for recommending products, such as eBooks, audio-books, Mobile Apps, Video and Music. It produces recommendations based on customer’s implicit feedback history such as purchases, listens or watches. Our key contribution is to formulat…

Cited by 7SourceScholar