跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1295新增论文
+1026其中 AI 相关
+111已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 04:58 · 全站最近入库:2026-11-17 16:10各信源进度 →

统计口径与数据新鲜度

统计 2026-11-16 17:09 — 2026-11-17 17:09(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-17 04:58最近发现新增版本:2026-11-17 16:10库内论文最新更新时间:2026-11-17 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

25,122 已收录论文20,967 AI 相关7,309 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
版本更新 · v2arXiv:2610.15728

When Watermarks Turn Adversarial: Exposing Vulnerabilities in Document Understanding

Qingzhe Han, Fan Dang, Shengqi Chen, Xinyi Sun, Haoyu Xiong, Lingkun Li, Di Zhang

原文摘要

Visible watermarks are common in digital documents and persist during vision-language model (VLM) processing. We show that they can also serve as adversarial surfaces for document understanding. We propose Watermark-based Adversarial Surface Perturbation (WASP), a white-box attack that optimizes pixels inside fixed watermark strokes without requiring downstream questions, answers, or task-specific losses. We further introduce Balanced Aggregation Loss (BAL), which emphasizes visual token groups that remain highly similar to clean representations. Adversarial watermarks degrade performance substantially more than ordinary watermarks. On DocVQA, WASP achieves attack success rates of 96.81% and 71.93% against Qwen2.5-VL and InternVL2.5; BAL improves over a standard token hinge objective by 9.21 and 2.24 percentage points. On 1,651 OmniDocBench pages, WASP increases MinerU2.5's text edit distance by 0.7748 relative to ordinary watermarks. WASP also transfers within model families and across readers sharing a vision-tower architecture. Attack effectiveness depends on watermark geometry, model architecture, and preprocessing; in structured parsing, disrupted layout and routing can propagate errors downstream. These results expose an underexplored security risk in document understanding systems.

cs.CV

新论文 · v1arXiv:2611.16009

JustRUA: A Controlled Study of GPT-6 Robot-Use Agents

Zefan Wang, Yufan Dang, Xuanwei Shi, Mingqi Gao, Cheng Yin, SikYuen Tam, Hanyu Liu, Yasheng Wang 等 12 位作者

原文摘要

GPT-6 Astra can drive a robot arm directly through a fixed harness, and scores of such robot-use agents on RoboDojo have risen quickly since. Reported systems differ in harness and test subset and often change several designs at once, so it is hard to tell which choices produce the gains. We take these designs apart and test them in one framework, along the harness around the model, the action interface, the reuse of experience and the scene geometry given to the model. A lean harness that keeps the full episode history and stops each motion early goes a long way. Reusing experience changes how the model acts but is not a free lunch, and scene geometry helps most, even when depth is predicted from RGB alone. JustRUA starts from the official L3 harness and keeps only what matters most. Even with no learned policy, self-improvement loop or task-specific tuning, this simple harness raises the score on the RoboDojo simulation benchmark substantially, from 29.7 to 50.3.

cs.RO · cs.AI

版本更新 · v3arXiv:2406.07155Google Research

Scaling Large Language Model-based Multi-Agent Collaboration

Chen Qian, Zihao Xie, YiFei Wang, Wei Liu, Kunlun Zhu, Hanchen Xia, Yufan Dang, Zhuoyun Du 等 12 位作者

原文摘要

Recent breakthroughs in large language model-driven autonomous agents have revealed that multi-agent collaboration often surpasses each individual through collective reasoning. Inspired by the neural scaling law--increasing neurons enhances performance, this study explores whether the continuous addition of collaborative agents can yield similar benefits. Technically, we utilize directed acyclic graphs to organize agents into a multi-agent collaboration network (MacNet), upon which their interactive reasoning is topologically orchestrated for autonomous task solving. Extensive evaluations reveal that it effectively supports collaboration among over a thousand agents, with irregular topologies outperforming regular ones. We also identify a collaborative scaling law--the overall performance follows a logistic growth pattern as agents scale, with collaborative emergence occurring earlier than traditional neural emergence. We speculate this may be because scaling agents catalyzes their multidimensional considerations during interactive reflection and refinement, thereby producing more comprehensive artifacts. The code is available at https://github.com/OpenBMB/ChatDev/tree/macnet.

cs.AI · cs.CL · cs.MA · cs.NI · cs.SI