Pith. sign in

REVIEW 4 cited by

Probabilistic Inference in Language Models via Twisted Sequential Monte Carlo

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.17546 v1 pith:BTJRI6D7 submitted 2024-04-26 cs.LG cs.AIcs.CLstat.ML

classification cs.LGcs.AIcs.CLstat.ML
keywords inferencelanguagetechniquestwistedautomatedboundscarloestimate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Numerous capability and safety techniques of Large Language Models (LLMs), including RLHF, automated red-teaming, prompt engineering, and infilling, can be cast as sampling from an unnormalized target distribution defined by a given reward or potential function over the full sequence. In this work, we leverage the rich toolkit of Sequential Monte Carlo (SMC) for these probabilistic inference problems. In particular, we use learned twist functions to estimate the expected future value of the potential at each timestep, which enables us to focus inference-time computation on promising partial sequences. We propose a novel contrastive method for learning the twist functions, and establish connections with the rich literature of soft reinforcement learning. As a complementary application of our twisted SMC framework, we present methods for evaluating the accuracy of language model inference techniques using novel bidirectional SMC bounds on the log partition function. These bounds can be used to estimate the KL divergence between the inference and target distributions in both directions. We apply our inference evaluation techniques to show that twisted SMC is effective for sampling undesirable outputs from a pretrained model (a useful component of harmlessness training and automated red-teaming), generating reviews with varied sentiment, and performing infilling tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Depth-Entropy Guided Sampling for Training-Free LLM Reasoning

    cs.LG 2026-06 conditional novelty 7.0 of 10

    Layer-wise entropy collapse depth is a weak per-candidate signal that, compounded inside MCMC power sampling, yields state-of-the-art training-free LLM reasoning accuracy.

  2. Sound Probabilistic Safety Bounds for Large Language Models

    cs.CL 2026-07 conditional novelty 6.0 of 10

    Guided expansion of a few generation-tree branches yields provably valid but extremely small lower bounds on LLM harm probability; in several reported runs the baseline Monte Carlo estimate is orders of magnitude larger.

  3. Backward Filtering Forward Guiding

    stat.ME 2025-05 conditional novelty 6.0 of 10

    A unified backward-filtering and forward-guiding scheme provides weighted posterior samples for latent processes on trees and DAGs with intractable transition densities.

  4. Uncertainty-Aware Simulation-Based Inference for Operations Research with Large Language Models

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Lookahead resampling with entropy- and power-based rewards steers LLM decoding toward OR formulations whose short simulated continuations are most concentrated, giving reported pass@1 gains not yet separated from adde...

Pith tools