Stochastic Estimation of Transduced Language Models 待解读

下载

新用户看这篇论文该怎么开始

  1. 先点「赞助解读」,AI 会把论文转成可直接执行的行动清单。
  2. 看完“可执行改进行动”后,可快速决定是否值得立项。
  3. 用上面的卡片内容直接发给团队,减少重复阅读。
先订阅关键词,后续不再手工筛论文

摘要

Transduced language models (TLMs) compose a pretrained \emph{source} language model with a functional finite-state transducer to induce a language model over \emph{target} strings. Computing the probability of a target prefix under a TLM amounts to summing the source-model probabilities of all source strings that the transducer maps to target strings beginning with that prefix. This set can be exponentially large or infinite. Prior work uses a computational shortcut based on source prefix probabilities, then approximates the resulting sum with threshold-pruned beam summing. This produces a lower bound with unknown error. Instead, we resample source prefixes without replacement and reweight each selected prefix by the inverse of its inclusion probability. We show that applying this correction recursively gives an unbiased estimator of the target prefix probability and lets us estimate the mass lost by threshold pruning. Our beam-summing algorithm extends the retained source prefixes and samples which prefixes to keep, reducing their number as more probability mass is added to the running estimate. This can save computation and guarantees that the run halts with probability one. We evaluate the method on encyclopedic text and DNA against sequential Monte Carlo baselines that resample with replacement. It achieves a better compute--variance tradeoff on text and lower error at the same maximum number of particles on DNA. On a DNA-to-amino-acid transduction, it reduces runtime by several orders of magnitude relative to threshold-pruned beam summing and makes estimating prefix probabilities for long target strings feasible. Replacing threshold pruning with unbiased sampling in a published reading-time analysis substantially lowers the estimated corpus surprisal but leaves the published conclusions unchanged.

分析报告

暂无报告。点击“分析”开始生成。

个性化解读 与社区共享解读不同

用自己的话告诉 AI 你想要什么样的解读(比如"用大白话讲给非专业人士听"、"重点分析对我们团队 RAG 系统的可迁移性"),生成一份只属于你自己的版本;生成后也可以选择设为"愿意共享",被更多人看到、点赞。