← Search

Rico Angell

11 accepted papers

2026

Estimating Tail Risks in Language Model Output Distributions

ICML 2026spotlight

Language models are increasingly capable and are being rapidly deployed on a population-level scale. As a result, the safety of these models is increasingly high-stakes. Fortunately, advances in alignment have significantly reduced the likelihood of harmful model outputs. However, when models are qu…

Cited by 0SourceScholar
2026

Is it Thinking or Cheating? Detecting Implicit Reward Hacking by Measuring Reasoning Effort

ICLR 2026oral

Reward hacking, where a reasoning model exploits loopholes in a reward function to achieve high rewards without solving the intended task, poses a significant threat. This behavior may be explicit, i.e. verbalized in the model's chain-of-thought (CoT), or implicit, where the CoT appears benign thus…

Cited by 0SourceScholar
2026

Monitoring Decomposition Attacks with Lightweight Sequential Monitors

ICLR 2026poster

As LLMs become more agentic, a critical risk emerges: attackers can \emph{decompose} harmful goals into stateful, benign subtasks that trick LLM agents into executing them without realizing the harmful intent in the same context. The challenge lies in the existing shallow safety alignment techniques…

Cited by 0SourcecodeScholar
2024

Fast, Scalable, Warm-Start Semidefinite Programming with Spectral Bundling and Sketching

ICML 2024poster

While semidefinite programming (SDP) has traditionally been limited to moderate-sized problems, recent algorithms augmented with matrix sketching techniques have enabled solving larger SDPs. However, these methods achieve scalability at the cost of an increase in the number of necessary iterations,…

2024

Measuring Progress in Dictionary Learning for Language Model Interpretability with Board Game Models

NeurIPS 2024poster

What latent features are encoded in language model (LM) representations? Recent work on training sparse autoencoders (SAEs) to disentangle interpretable features in LM representations has shown significant promise. However, evaluating the quality of these SAEs is difficult because we lack a ground-t…

2022

Efficient Nearest Neighbor Search for Cross-Encoder Models using Matrix Factorization

EMNLP 2022main

Efficient k-nearest neighbor search is a fundamental task, foundational for many problems in NLP. When the similarity is measured by dot-product between dual-encoder vectors or L2-distance, there already exist many scalable and efficient search methods. But not so when similarity is measured by more…

2022

Entity Linking via Explicit Mention-Mention Coreference Modeling

NAACL 2022long

Learning representations of entity mentions is a core component of modern entity linking systems for both candidate generation and making linking predictions. In this paper, we present and empirically analyze a novel training approach for learning mention and entity representations that is based on…

2022

Interactive Correlation Clustering with Existential Cluster Constraints

ICML 2022spotlight

We consider the problem of clustering with user feedback. Existing methods express constraints about the input data points, most commonly through must-link and cannot-link constraints on data point pairs. In this paper, we introduce existential cluster constraints: a new form of feedback where users…

2021

Clustering-based Inference for Biomedical Entity Linking

NAACL 2021long

Due to large number of entities in biomedical knowledge bases, only a small fraction of entities have corresponding labelled training data. This necessitates entity linking models which are able to link mentions of unseen entities using learned representations of entities. Previous approaches link e…

Cited by 70SourcePDFScholar