arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.04521cs.CLcs.ET
收藏

$C$-$ΔΘ$:用于选择性拒绝的电路受限权重算法

$C$-$ΔΘ$: Circuit-Restricted Weight Arithmetic for Selective Refusal

Aditya Kasliwal, Pratinav Seth, Vinay Kumar Sankarapu

AI总结:

研究能否将选择性拒绝移至离线,提出C-ΔΘ电路受限权重算法,通过定位拒绝因果计算为稀疏电路并计算受限权重更新,实现无推理时钩子的即插即用编辑检查点,转移成本并评估了相关性能。

摘要:

现代部署要求大语言模型大规模实施安全策略,但许多控制依赖推理时干预,增加了计算成本和服务复杂性。激活引导虽被广泛使用,但需要运行时钩子且成本随生成数量增加;条件变体通过门控提高选择性,但仍保留推理时控制路径。本文探讨能否将选择性拒绝完全移至离线:能否将对特定类别拒绝的机制理解提炼为作为标准检查点部署的电路受限权重更新?提出了C-ΔΘ电路受限权重算法,将拒绝因果计算定位为使用EAP-IG的稀疏电路,并仅在该电路上计算受限权重更新ΔΘC,应用ΔΘC会产生无推理时钩子的即插即用编辑检查点,将成本从每次请求干预转移到一次性离线更新。并在拒绝和效用基准上评估了类别针对性选择性和能力保留情况。

英文摘要:

Modern deployments require LLMs to enforce safety policies at scale, yet many controls rely on inference-time interventions that add recurring compute cost and serving complexity. Activation steering is widely used, but it requires runtime hooks and scales cost with the number of generations; conditional variants improve selectivity by gating when steering is applied but still retain an inference-time control path. We ask whether selective refusal can be moved entirely offline: can a mechanistic understanding of category-specific refusal be distilled into a circuit-restricted weight update that deploys as a standard checkpoint? We propose C-Δθ Circuit Restricted Weight Arithmetic}, which (i) localizes refusal-causal computation as a sparse circuit using EAP-IG and (ii) computes a constrained weight update ΔθC supported only on that circuit (typically <5% of parameters). Applying ΔθC yields a drop-in edited checkpoint with no inference-time hooks, shifting cost from per request intervention to a one-time offline update. We evaluate category-targeted selectivity and capability retention on refusal and utility benchmarks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑