Skip to content

Translation in progress Some entries still include text in the original language.

Oct 13 · Tuesday

All papers

Found 5 papers

Another 201papers do not have category tags yet and are not included in filtered results.

  1. AttacksarXiv 2610.05894

    研究者提出闭环偏见注入攻击

    提出闭环激活引导,在扩散语言模型去噪过程中注入定向偏见

    Published
    Attacker
    Gray-box
    Evaluated models
    LLaDA-8B-Instruct, Dream-v0-Instruct-7B, LLaDA-MoE-7B-A1B-Instruct

    Abstract通过去噪中间概率反馈动态调节残差流转向,证明扩散语言模型在推理服务栈中存在闭环偏见注入脆弱性。

    Paper analysisRead analysis
  2. AttacksarXiv 2606.12716

    PaperGuard:针对多模态 AI 同行评审的攻击与防御基准

    提出 PaperGuard,用图文注入与梯度扰动抬高自动审稿分数并检测恶意指令

    Published
    Evaluated models
    Claude-sonnet-4.5, GPT-4o, GPT-4.1 and others11
    AbstractPaperGuard 测到提示注入与白盒视觉抬分,并比较分块检索防御。

    PaperGuard同时评测并检测多模态 AI 审稿中的评分操纵。

    Paper analysisRead analysis
  3. AttacksarXiv 2602.17837

    TFL: Targeted Bit-Flip Attack against Large Language Models

    Proposes TFL targeted bit flipping so that selected prompts output false answers while unrelated queries remain correct

    Published
    Evaluated models
    Qwen3-8B, DeepSeek-R1-Distill-Qwen-14B, LLaMA-3.1-8B-INSTRUCT
    AbstractTFL searches weight bits on three LLMs to make specified prompts produce target keywords while constraining degradation on unrelated tasks.

    TFL is a framework for targeted bit flips on LLM main memory weights: the attacker wants a selected prompt to output a specified false answer keyword while limiting degradation on unrelated queries.

    Paper analysisRead analysis
  4. AttacksarXiv 2602.00364

    "Someone hid it": Query-agnostic black-box attacks against LLM retrieval

    提出查询无关黑盒攻击 DQ-A,用可迁移文末后缀降低文档检索排名

    Published
    Evaluated models
    Qwen-1.5-7B-Instruct, SFR-Embedding-Mistral, E5-Mistral-7B-Instruct and others10
    AbstractDQ-A 以无查询黑盒后缀压低 LLM 检索排名,并在 BRIGHT 上比较三种基线。

    DQ-A 是一种 query-agnostic、complete black-box 的文档隐藏攻击,对象是用最后隐层相似度匹配的 LLM 检索。

    Paper analysisRead analysis
  5. AttacksarXiv 2601.20283

    One word is enough: Minimal adversarial perturbations for neural text ranking

    提出查询中心词的单次插入或替换攻击,操纵神经排序名次

    Published
    Evaluated models
    BERT-base-mdoc-BM25, monoT5-base-MSMARCO
    Abstract作者称单词扰动即可抬升名次、中段文档最脆弱,且比白盒 PRADA 更少编辑。

    单个与查询对齐的词,就可能改掉神经重排结果。要做的是少改原文,仍把目标文档在 NRM 列表里的名次抬高。

    Paper analysisRead analysis
You have reached the end