Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Claudia Shi

dblp:242/9281 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
7since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 4 first-author · 7 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
5 papers
Trustworthy machine learning · 61% Language models and text generation · 22% Probabilistic and Bayesian machine learning · 10%

Topics — the 14 heaviest of 16, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
0.812024
Hypothesis Testing the Circuit Hypothesis in LLMs · NeurIPS 2024
Machine learning › Trustworthy machine learning › robustness
distribution shift
0.712023
An Invariant Learning Characterization of Controlled Text Generation · ACL (1) 2023
Machine learning › Trustworthy machine learning
fairness
0.712023
Evaluating the Moral Beliefs Encoded in LLMs · NeurIPS 2023
Machine learning › Trustworthy machine learning › out-of-distribution generalization
invariant learning
0.712023
An Invariant Learning Characterization of Controlled Text Generation · ACL (1) 2023
Natural language and speech › Language models and text generation
large language model
0.712023
Evaluating the Moral Beliefs Encoded in LLMs · NeurIPS 2023
Machine learning › Trustworthy machine learning › fairness
moral alignment
0.712023
Evaluating the Moral Beliefs Encoded in LLMs · NeurIPS 2023
Machine learning › Trustworthy machine learning
out-of-distribution generalization
0.712023
Causal-structure Driven Augmentations for Text OOD Generalization · NeurIPS 2023
Machine learning › Trustworthy machine learning
robustness
0.712023
An Invariant Learning Characterization of Controlled Text Generation · ACL (1) 2023
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift
0.712023
Causal-structure Driven Augmentations for Text OOD Generalization · NeurIPS 2023
Natural language and speech › Language models and text generation
text generation
0.712023
An Invariant Learning Characterization of Controlled Text Generation · ACL (1) 2023
Machine learning › Probabilistic and Bayesian machine learning
causal inference
0.412019
Adapting Neural Networks for the Estimation of Treatment Effects · NeurIPS 2019
Machine learning › Deep learning architectures and training › regularization
targeted regularization
0.412019
Adapting Neural Networks for the Estimation of Treatment Effects · NeurIPS 2019
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal effect estimation
treatment effect estimation
0.412019
Adapting Neural Networks for the Estimation of Treatment Effects · NeurIPS 2019
Machine learning › Deep learning architectures and training › transformer
transformer analysis
0.212024
Hypothesis Testing the Circuit Hypothesis in LLMs · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

hypothesis testing · 0.8activation hooks · 0.8uncertainty quantification · 0.7statistical survey · 0.7invariant learning · 0.7causal-structure driven data augmentation · 0.7attribute classifier · 0.7targeted regularization · 0.4dragonnet architecture · 0.4
YearPublicationVenuePosition
2024 On the Misspecification of Linear Assumptions in Synthetic Controls
abstract
The synthetic control (SC) method is popular for estimating causal effects from observational panel data. It rests on a crucial assumption that we can write the treated unit as a linear combination of the untreated units. In practice, this assumption may not hold, and when violated, the resulting SC estimates are incorrect. This paper examines two questions: (1) How large can the misspecification error be? (2) How can we minimize it? First, we provide theoretical bounds to quantify the misspecification error. The bounds are comforting: small misspecifications induce small errors. With these bounds in hand, we develop new SC estimators specially designed to minimize misspecification error. The estimators are based on additional data about each unit. (E.g., if the units are countries, it might be demographic information about each.) We study our estimators on synthetic data; we find they produce more accurate causal estimates than standard SC. We then re-analyze the California tobacco program data of the original SC paper, now including additional data from the US census about per-state demographics. Our estimators show that the observations in the pre-treatment period lie within the bounds of misspecification error and that observations post-treatment lie outside of those bounds. This is evidence that our SC methods have uncovered a true effect.
Achille Nazaret, Claudia Shi, David M. Blei
AISTATS2
2024 Hypothesis Testing the Circuit Hypothesis in LLMs
abstract
Large language models (LLMs) demonstrate surprising capabilities, but we do not understand how they are implemented. One hypothesis suggests that these capabilities are primarily executed by small subnetworks within the LLM, known as circuits. But how can we evaluate this hypothesis? In this paper, we formalize a set of criteria that a circuit is hypothesized to meet and develop a suite of hypothesis tests to evaluate how well circuits satisfy them. The criteria focus on the extent to which the LLM's behavior is preserved, the degree of localization of this behavior, and whether the circuit is minimal. We apply these tests to six circuits described in the research literature. We find that synthetic circuits -- circuits that are hard-coded in the model -- align with the idealized properties. Circuits discovered in Transformer models satisfy the criteria to varying degrees. To facilitate future empirical studies of circuits, we created the \textit{circuitry} package, a wrapper around the \textit{TransformerLens} library, which abstracts away lower-level manipulations of hooks and activations. The software is available at \url{https://github.com/blei-lab/circuitry}.
Claudia Shi, Nicolas Beltran-Velez, Achille Nazaret, Carolina Zheng, Adrià Garriga-Alonso, Andrew Jesson, Maggie Makar, David M. Blei
NeurIPS1
2023 An Invariant Learning Characterization of Controlled Text Generation
abstract
Controlled generation refers to the problem of creating text that contains stylistic or semantic attributes of interest.Many approaches reduce this problem to training a predictor of the desired attribute.For example, researchers hoping to deploy a large language model to produce non-toxic content may use a toxicity classifier to filter generated text.In practice, the generated text to classify, which is determined by user prompts, may come from a wide range of distributions.In this paper, we show that the performance of controlled generation may be poor if the distributions of text in response to user prompts differ from the distribution the predictor was trained on.To address this problem, we cast controlled generation under distribution shift as an invariant learning problem: the most effective predictor should be invariant across multiple text environments.We then discuss a natural solution that arises from this characterization and propose heuristics for selecting natural environments.We study this characterization and the proposed method empirically using both synthetic and real data.Experiments demonstrate both the challenge of distribution shift in controlled generation and the potential of invariance methods in this setting.
Carolina Zheng, Claudia Shi, Keyon Vafa, Amir Feder, David M. Blei
ACL (1)2
2023 Causal-structure Driven Augmentations for Text OOD Generalization
Amir Feder, Yoav Wald, Claudia Shi, Suchi Saria, David M. Blei
NeurIPS3
2023 Evaluating the Moral Beliefs Encoded in LLMs
abstract
This paper presents a case study on the design, administration, post-processing, and evaluation of surveys on large language models (LLMs). It comprises two components: (1) A statistical method for eliciting beliefs encoded in LLMs. We introduce statistical measures and evaluation metrics that quantify the probability of an LLM "making a choice", the associated uncertainty, and the consistency of that choice. (2) We apply this method to study what moral beliefs are encoded in different LLMs, especially in ambiguous cases where the right choice is not obvious. We design a large-scale survey comprising 680 high-ambiguity moral scenarios (e.g., "Should I tell a white lie?") and 687 low-ambiguity moral scenarios (e.g., "Should I stop for a pedestrian on the road?"). Each scenario includes a description, two possible actions, and auxiliary labels indicating violated rules (e.g., "do not kill"). We administer the survey to 28 open- and closed-source LLMs. We find that (a) in unambiguous scenarios, most models ``choose" actions that align with commonsense. In ambiguous cases, most models express uncertainty. (b) Some models are uncertain about choosing the commonsense action because their responses are sensitive to the question-wording. (c) Some models reflect clear preferences in ambiguous scenarios. Specifically, closed-source models tend to agree with each other.
Nino Scherrer, Claudia Shi, Amir Feder, David M. Blei
NeurIPS2
2022 On the Assumptions of Synthetic Control Methods
abstract
Synthetic control (SC) methods have been widely applied to estimate the causal effect of large-scale interventions, e.g., the state-wide effect of a change in policy. The idea of synthetic controls is to approximate one unit’s counterfactual outcomes using a weighted combination of some other units’ observed outcomes. The motivating question of this paper is: how does the SC strategy lead to valid causal inferences? We address this question by re-formulating the causal inference problem targeted by SC with a more fine-grained model, where we change the unit of analysis from “large units" (e.g., states) to “small units" (e.g., individuals in states). Under the re-formulation, we derive sufficient conditions for the non-parametric causal identification of the causal effect. We show that, in some settings, existing linear SC estimators are valid even when the data generating process is non-linear. We highlight two implications of the reformulation: 1) it clarifies where “linearity" comes from, and how it falls naturally out of the more fine-grained and flexible model; 2) it suggests new ways of using available data with SC methods for valid causal inference, in particular, new ways of selecting observations from which to estimate the counterfactual.
Claudia Shi, Dhanya Sridhar, Vishal Misra, David M. Blei
AISTATS1
2021 Invariant representation learning for treatment effect estimation
abstract
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. However, including every observed covariate in the adjustment runs the risk of including ‘bad controls’, variables that induce bias when they are conditioned on. The problem is that we do not always know which variables in the covariate set are safe to adjust for and which are not. To address this problem, we develop Nearly Invariant Causal Estimation (NICE). NICE uses invariant risk minimization (IRM) [Arj19] to learn a representation of the covariates that, under some assumptions, strips out bad controls but preserves sufficient information to adjust for confounding. Adjusting for the learned representation, rather than the covariates themselves, avoids the induced bias and provides valid causal inferences. We evaluate NICE on both synthetic and semi-synthetic data. When the covariates contain unknown collider variables and other bad controls, NICE performs better than adjusting for all the covariates.
Claudia Shi, Victor Veitch, David M. Blei
UAI1
2019 Adapting Neural Networks for the Estimation of Treatment Effects
abstract
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 downstream estimator. Neural networks are a natural choice for the models in the first step. Our question is: how can we adapt the design and training of the neural networks used in this first step in order to improve the quality of the final estimate of the treatment effect? We propose two adaptations based on insights from the statistical literature on the estimation of treatment effects. The first is a new architecture, the Dragonnet, that exploits the sufficiency of the propensity score for estimation adjustment. The second is a regularization procedure, targeted regularization, that induces a bias towards models that have non-parametrically optimal asymptotic properties ‘out-of-the-box’. Studies on benchmark datasets for causal inference show these adaptations outperform existing methods.
Claudia Shi, David M. Blei, Victor Veitch
NeurIPS1