Skip to content

Adaptive Multilevel Twisted Sequential Monte Carlo for Rare Events Estimation in Language Models

Aug 2026 · 0 citations
Computer Science

TL;DR

Adaptive Multilevel Twisted SMC is proposed, which learns the rare-event twist through a sequence of progressively rarer intermediate events, ultimately leading to a more accurate final twist for the target rare event.

Abstract

Rare unsafe behaviors in large language models can remain practically significant even when their probability is extremely small, particularly at deployment scales involving millions or billions of interactions. Twisted Sequential Monte Carlo (SMC) provides a principled framework for rare-event probability estimation by learning twist functions that guide generation toward a target event. However, the standard twist learning framework relies on positive samples from the rare-event target distribution, which may be nearly absent before an informative twist has been learned, resulting in unreliable rare-event estimation. We propose Adaptive Multilevel Twisted SMC, which learns the rare-event twist through a sequence of progressively rarer intermediate events. At each level, the learned twist provides more informative positive examples for learning the next twist, ultimately leading to a more accurate final twist for the target rare event. Experiments across diverse tasks and model scales show that the proposed method produces more accurate rare-event probability estimates. By enabling more reliable discovery of hard-to-observe unsafe behaviors, our method provides a practical tool for strengthening the evaluation and safety alignment of deployed language models.

View source

Similar papers

Jul 2026

Estimating Rare Events in Language Models with Proper Evaluation

This work introduces Gradient Activation Adaptive Multi-Level Splitting (GA-AMLS), which adapts rare-event Monte Carlo methods to the continuous activation space of language models and establishes activation space as a tractable domain for rare-event estimation in language models, circumventing the brittleness of discr...

Nikita Y. Parulekar, Anqi Liu · 0 citations
Preprint Aug 2026

Quantum Rare-Event Estimation for Ising Graphical Models with Belief-Propagation State Preparation

A sample-free state-preparation method combining loopy belief propagation with the Chow--Liu algorithm is introduced, and its accuracy is evaluated across graph families spanning different topologies, coupling strengths, and coupling signs.

Mario Hernández Vera, Narges Jamialahmadi, B. Mete et al. · 0 citations
Preprint Aug 2026

Clustered Randomized Smoothing for Stochastic Prediction Functions

Clustered $\alpha$-smoothing is proposed, a framework that partitions noisy samples using an arbitrary clustering algorithm, applies $\alpha$-smoothing locally within each cluster, and combines the resulting predictions into a mixture distribution, derived from interpreting the smoothing distribution as a mixture of $\...

Eduardo Figueiredo, Frederik Baymler Mathiesen, J. Schumann et al. · 0 citations
Preprint Jul 2026

CORA-Diff: Confidence-Oriented Residual Acceptance for Efficient Diffusion Language Model Inference

This work proposes CORA-Diff, a training-free method that preserves the original transfer rule and applies confidence-and-persistence gating only to positions that rule leaves unresolved, and shows that native confidence and persistence enable reliable residual acceptance, reducing repeated denoising computation while...

Yifan Wu, Yu-Feng Zhang, Kenli Li · 0 citations

A Coin Flip Per Token: Bernoulli Sparse Steering of Large Language Models

Stochastic Token Steering (STS), which gates each token independently with probability $p$, and Stochastic Block Steering (SBS), which gates a leading window once per sequence are introduced; neither requires a reward model or learned gating policy.

Nima Eshraghi, Lovedeep Gondara, Yuqing Huang et al. · 0 citations
Jul 2026

Diachronic Sample Integration: Robust Tail-Risk Estimation with Generative Models

Diachronic Sample Integration is introduced, a test-time inference framework that ensembles generated samples across checkpoints from a stochastic training trajectory that substantially reduces tail-estimation error compared to single-checkpoint baselines under fixed simulation budgets.

Shuning Zhao, Patrick Wong, Leran Zhang et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.