跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2609.24969 · v2

Rare Event Estimation via Iterative Unalignment

首次提交 2026-09-22 01:53
版本更新 2026-11-12 12:59
雷达观测 2026-11-13 14:16
arXiv ↗PDF ↗

摘要

As agents are deployed with increased autonomy, even extremely rare events along their stochastic output trajectories can occur and prove catastrophic. Safe deployment therefore does not depend on whether these events can occur, but on how often they might. We study the problem of estimating the probability of rare events that arise from stochastic variation in the agent's own actions. Estimating this type of risk requires searching over the combinatorially vast space of trajectories. Naive Monte Carlo is computationally prohibitive in this regime, and constructing effective importance sampling (IS) proposals requires coordinated changes to a context-dependent chain of conditional distributions. We develop a new IS method that perturbs the original model's weights to construct the proposal. The proposal is itself a differentiably parameterized language model, enabling gradient-based search over weight space. We formulate an objective that combines a differentiable surrogate for event amplification and an adaptive regularization scheme that dynamically balances amplification against estimator stability. We evaluate our approach on ∼\sim120M and ∼\sim2.6B models across three event families spanning 300+ rare events as rare as 10−910^{-9}, all with independently estimated reference probabilities. In our most verifiable settings, we observe that our IS estimator achieves over 800×800\times compute-weighted efficiency gains on average over naive Monte Carlo for events with probabilities lower than 10−710^{-7}. Our implementation is available at https://github.com/namkoong-lab/iterative-unalignment.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-12 12:59 · 最新观测版本

Rare Event Estimation via Iterative Unalignment

As agents are deployed with increased autonomy, even extremely rare events along their stochastic output trajectories can occur and prove catastrophic. Safe deployment therefore does not depend on whether these events can occur, but on how often they might. We study the problem of estimating the probability of rare events that arise from stochastic variation in the agent's own actions. Estimating this type of risk requires searching over the combinatorially vast space of trajectories. Naive Monte Carlo is computationally prohibitive in this regime, and constructing effective importance sampling (IS) proposals requires coordinated changes to a context-dependent chain of conditional distributions. We develop a new IS method that perturbs the original model's weights to construct the proposal. The proposal is itself a differentiably parameterized language model, enabling gradient-based search over weight space. We formulate an objective that combines a differentiable surrogate for event amplification and an adaptive regularization scheme that dynamically balances amplification against estimator stability. We evaluate our approach on ∼\sim120M and ∼\sim2.6B models across three event families spanning 300+ rare events as rare as 10−910^{-9}, all with independently estimated reference probabilities. In our most verifiable settings, we observe that our IS estimator achieves over 800×800\times compute-weighted efficiency gains on average over naive Monte Carlo for events with probabilities lower than 10−710^{-7}. Our implementation is available at https://github.com/namkoong-lab/iterative-unalignment.

查看此版本解读 →查看此版本原文 ↗