Translation in progress Some entries still include text in the original language.
Oct 12 · Monday
Another 232 papers do not have category tags yet and are not included in filtered results.
“
About this collection Collection in progress We are building a large AI safety paper collection to help researchers find work related to their interests. Papers are collected automatically andfiltered only for relevance to AI safety , without judging quality, novelty or reading value. The default “Annotated first” shows papers with tags or published paper analyses first. Each group is ordered by original publication date, newest first, with undated papers last. “Newest first” uses publication dates only. This order is not a quality ranking.
One-line summaries, tags and paper analyses are prepared by AI from the papers. Language models may have systematic biases and produce hallucinations.We plan to carry out human annotation and review to reduce errors in this content.
提出 FAB 攻击，向声学基础模型植入可由环境声触发的后门
Published Oct 7
Evaluated models HuBERT-base , WavLM-base Abstract 论文提出了针对声学基模的 FAB 后门攻击，在弱威胁模型下实现了任务无关、物理可触发的后门植入。
证明预训练投毒的清洁超额风险指数随极限顺序变化
Published Sep 26
Evaluated models OLMo-style models Abstract 投毒清洁超额风险的幂指数取决于先固定宽高比还是先取充足数据极限。可解的预训练数据投毒理论：清洁超额风险的缩放指数随极限顺序改变。 。
提出 Fed-ADR，用编排服务器协同操纵梯度攻破联邦学习并检测恢复
Published Sep 23
Evaluated models CNN（MNIST：2 Conv + 3 FC） , CNN（Fashion-MNIST：6 Conv + 1 FC） , ResNet18（CIFAR-10） Abstract Fed-ADR 用 gray-box 编排攻击绕过多种聚合防御，再用 Hessian 一致性检测和窗口内恢复把准确率拉回。Fed-ADR 是一套面向联邦学习的攻击、检测与恢复框架：编排服务器改写合谋客户端的梯度，使参数服务器的现有防御把投毒更新当成良性，同时在发现后用历史梯度把全局模型原地修回来。
用 Dmax 与尾部损失评测后门修复的类别性能保持
Published Sep 22
Evaluated models ResNet18 , PreActResNet18 , VGG19-BN 提出 UBA-ORL，以 BD/CM 样本在遗忘后激活离线 RL 后门
Published Sep 19
Evaluated models TD3+BC , BCQ , IQL Abstract UBA-ORL 用竞争的 BD/CM 样本，使离线 RL 后门在删除伪装轨迹后激活。UBA-ORL 研究离线强化学习中由合规轨迹删除激活的后门：合法贡献者同时上传共享触发的后门轨迹和伪装轨迹，训练后触发响应被压低，删除伪装批次后再升高。受害系统是使用静态数据集和轨迹级遗忘接口的离线 RL 服务。对手不能看到训练算法、参数、梯度或具体遗忘算法，但能提交可区分批次，并在部署时向观测注入预定触发。
提出 BPI 选点算法，增强去中心化联邦学习中的模型与数据投毒
Published Sep 2 Abstract BPI 用有限轮 gossip 暴露选拜占庭集合。作者把 DFL 中“破坏哪 m 个节点”写成攻击者在固定预算下的优化问题，并用 BPI 近似有限轮内诚实节点受到的拜占庭暴露。
You have reached the end