arXiv Computation and Language

Constructing Budgeted KGW Evasion through Token-Event Evidence Replacement

The paper presents a method for evading Knowledge-Guided Watermarking (KGW) by replacing token‑event evidence with ordinary phrase rewrites. It jointly selects LLM‑proposed alternatives, measures global token‑edit distance, and uses exact coverage search to maximize removal of original scored token pairs within a budget. Experiments on short passages show that about half of detected sources can be rewritten to pass a blinded detector with a moderate token‑edit cost, though the approach does not outperform simpler rewriting strategies.

arXiv Computation and Language
Oct 19

Watermarkability: Measuring and Improving Language-Model Compatibility with Logit-Based Watermarks

The paper introduces "watermarkability," a metric that quantifies how compatible a language model is with a logit‑based watermark that boosts the probability of a specified token set during decoding. By measuring the expected minimum KL divergence needed to achieve a target probability mass, the authors can assess and compare models and watermark rules. They propose a two‑stage approach—first training a low‑rank adapter conditioned on the target set, then applying a minimal uniform logit bias—to reduce this cost, achieving significant perplexity reductions across multiple watermark schedules on OPT‑125M and Qwen3‑8B.

By Zewei Deng, Mohamed Seif, Liyan Xie
arXiv AI
Aug 11

From Trajectories to Evidence: Auditable Experimental Records for Industrial Research Agents

arXiv:2608. 05235v1 Announce Type: cross Abstract: Research agents increasingly conduct multi-round machine-learning experiments in industrial recommendation settings and retain the resulting trajectories to guide later decisions.

By Zijie Zhuang, Changxin Lao, Pengbo Xu, Hanwen Xu, Ruochen Yang, Yingzhi He, Peng Zhang, Jiangxia Cao, Yusheng Huang, Guohong Mu, Jian Liang, Ruiming Tang, Shuang Yang, Zhaojie Liu, Wenwu Ou, Kun Gai
arXiv AI
Jun 6

Answer Presence Drives RAG Rewriting Gains

arXiv:2606. 05633v1 Announce Type: new Abstract: Retrieval-augmented QA pipelines often route retrieved passages through an LLM \emph{rewriter} before a smaller reader, lifting F1 by tens of points on multi-hop benchmarks; this gain is typically credited to improved evidence quality.

By Yuejie Li, Yueying Hua, Ke Yang, Li Zhang, Yueping He, Yueping He, Ruiqi Li, Bolin Chen, Tao Wang, Bowen Li, Chengjun Mao
arXiv Computation and Language
Oct 9

Adversarial Cues in Decision Models Used as Judges: The Role of Request Presentation

The study investigates how subtle changes in the presentation of a structured judging request can influence the behavior of an answer‑grading model. By adding a single colon to a candidate answer, the researchers found that the model’s false‑acceptance rate rose dramatically—from 1–3% to over 26%—across two benchmark datasets (DROP and GSM8K) and different grading configurations. The effect varied with the presentation format, showing that logically equivalent requests can lead to markedly different vulnerabilities.

By Hongliang Liu