← Search

Victor Veitch

25 accepted papers

2026

Chasing the Tail: Effective Rubric-based Reward Modeling for Large Language Model Post-Training

ICLR 2026poster

Reinforcement fine-tuning (RFT) often suffers from reward over-optimization, where a policy model hacks the reward signals to achieve high scores while producing low-quality outputs. Our theoretical analysis shows that the key lies in reward misspecification at the high-reward tail: the inability to…

Cited by 0SourcecodeScholar
2025

RATE: Causal Explainability of Reward Models with Imperfect Counterfactuals

ICML 2025poster

Reward models are widely used as proxies for human preferences when aligning or evaluating LLMs. However, reward models are black boxes, and it is often unclear what, exactly, they are actually rewarding. In this paper we develop Rewrite-based Attribute Treatment Estimator (RATE) as an effective met…

2025

The Geometry of Categorical and Hierarchical Concepts in Large Language Models

ICLR 2025oral

The linear representation hypothesis is the informal idea that semantic concepts are encoded as linear directions in the representation spaces of large language models (LLMs). Previous work has shown how to make this notion precise for representing binary concepts that have natural contrasts (e.g.,…

2024

BoNBoN Alignment for Large Language Models and the Sweetness of Best-of-n Sampling

NeurIPS 2024poster

This paper concerns the problem of aligning samples from large language models to human preferences using *best-of-$n$* sampling, where we draw $n$ samples, rank them, and return the best one. We consider two fundamental problems. First: what is the relationship between best-of-$n$ and other (RLHF-t…

Cited by 28SourcePDFScholar
2024

On the Origins of Linear Representations in Large Language Models

ICML 2024poster

An array of recent works have argued that high-level semantic concepts are encoded "linearly" in the representation space of large language models. In this work, we study the origins of such linear representations. To that end, we introduce a latent variable model to abstract and formalize the conce…

Cited by 25SourcePDFScholar
2024

The Linear Representation Hypothesis and the Geometry of Large Language Models

ICML 2024poster

Informally, the "linear representation hypothesis" is the idea that high-level concepts are represented linearly as directions in some representation space. In this paper, we address two closely related questions: What does "linear representation" actually mean? And, how do we make sense of geometri…

2024

Transforming and Combining Rewards for Aligning Large Language Models

ICML 2024poster

A common approach for aligning language models to human preferences is to first learn a reward model from preference data, and then use this reward model to update the language model. We study two closely related problems that arise in this approach. First, any monotone transformation of the reward…

Cited by 9SourcePDFScholar
2023

Causal Context Connects Counterfactual Fairness to Robust Prediction and Group Fairness

NeurIPS 2023poster

Counterfactual fairness requires that a person would have been classified in the same way by an AI or other algorithmic system if they had a different protected class, such as a different race or gender. This is an intuitive standard, as reflected in the U.S. legal system, but its use is limited bec…

2023

Concept Algebra for (Score-Based) Text-Controlled Generative Models

NeurIPS 2023poster

This paper concerns the structure of learned representations in text-guided generative models, focusing on score-based models. A key property of such models is that they can compose disparate concepts in a 'disentangled' manner.This suggests these models have internal representations that encode con…

2023

Efficient Conditionally Invariant Representation Learning

ICLR 2023top-5%

We introduce the Conditional Independence Regression CovariancE (CIRCE), a measure of conditional independence for multivariate continuous-valued variables. CIRCE applies as a regularizer in settings where we wish to learn neural features $\varphi(X)$ of data $X$ to estimate a target $Y$, while bein…

2022

Using Embeddings for Causal Estimation of Peer Influence in Social Networks

NeurIPS 2022accept

We address the problem of using observational data to estimate peer contagion effects, the influence of treatments applied to individuals in a network on the outcomes of their neighbors. A main challenge to such estimation is that homophily - the tendency of connected units to share similar latent t…

2021

Causal Effects of Linguistic Properties

NAACL 2021long

We consider the problem of using observational data to estimate the causal effects of linguistic properties. For example, does writing a complaint politely lead to a faster response time? How much will a positive product review increase sales? This paper addresses two technical challenges related to…

2021

Counterfactual Invariance to Spurious Correlations in Text Classification

NeurIPS 2021spotlight

Informally, a 'spurious correlation' is the dependence of a model on some aspect of the input data that an analyst thinks shouldn't matter. In machine learning, these have a know-it-when-you-see-it character; e.g., changing the gender of a sentence's subject changes a sentiment predictor's output. T…

Cited by 90SourcePDFScholar
2021

Invariant representation learning for treatment effect estimation

UAI 2021poster

The defining challenge for causal inference from observational data is the presence of ‘confounders’, covariates that affect both treatment assignment and the outcome. To address this challenge, practitioners collect and adjust for the covariates, hoping that they adequately correct for confounding.…

2021

Valid Causal Inference with (Some) Invalid Instruments

ICML 2021spotlight

Instrumental variable methods provide a powerful approach to estimating causal effects in the presence of unobserved confounding. But a key challenge when applying them is the reliance on untestable "exclusion" assumptions that rule out any relationship between the instrument variable and the respon…

Cited by 30SourcePDFScholar
2020

Sense and Sensitivity Analysis: Simple Post-Hoc Analysis of Bias Due to Unobserved Confounding

NeurIPS 2020spotlight

It is a truth universally acknowledged that an observed association without known mechanism must be in want of a causal estimate. Causal estimates from observational data will be biased in the presence of ‘unobserved confounding’. However, we might hope that the influence of unobserved confounders i…

2019

Adapting Neural Networks for the Estimation of Treatment Effects

NeurIPS 2019poster

This paper addresses the use of neural networks for the estimation of treatment effects from observational data. Generally, estimation proceeds in two stages. First, we fit models for the expected outcome and the probability of treatment (propensity score). Second, we plug these fitted models into a d…

2019

Empirical Risk Minimization and Stochastic Gradient Descent for Relational Data

AISTATS 2019poster

Empirical risk minimization is the main tool for prediction problems, but its extension to relational data remains unsolved. We solve this problem using recent ideas from graph sampling theory to (i) define an empirical risk for relational data and (ii) obtain stochastic gradients for this empirical…

2019

Non-vacuous Generalization Bounds at the ImageNet Scale: a PAC-Bayesian Compression Approach

ICLR 2019poster

Modern neural networks are highly overparameterized, with capacity to substantially overfit to training data. Nevertheless, these networks often generalize well in practice. It has also been observed that trained networks can often be ``compressed to much smaller representations. The purpose of this…

2019

Using Embeddings to Correct for Unobserved Confounding in Networks

NeurIPS 2019poster

We consider causal inference in the presence of unobserved confounding. We study the case where a proxy is available for the unobserved confounding in the form of a network connecting the units. For example, the link structure of a social network carries information about its members. We show how to…