跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

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

全站更新概况

+0新增论文
+0其中 AI 相关
+1已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-08 18:41 · 全站最近入库:2026-11-08 06:02各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-08 18:41最近发现新增版本:2026-11-08 06:02库内论文最新更新时间:2026-11-06 02:59

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

17,100 已收录论文14,661 AI 相关4,057 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-08 18:39(北京时间)
版本更新 · v5arXiv:2504.20369

Perception-Augmented Databases for Effective Visual Analytics

Zafeiria Moumoulidou, Hamza Elhamdadi, Redwan Ahmed Rizvee, Ke Yang, Subrata Mitra, Cindy Xiong Bearfield, Alexandra Meliou

原文摘要

Analysts often use sampling in visual exploration to overcome the computational and perceptual bottlenecks of working with massive datasets. Yet, existing sampling methods optimize for statistical or geometric data properties, without explicit consideration for how humans perceive a visualization. We propose perception-augmented databases: a database framework that stores perceptual models of data as precomputed metadata and exposes a new query operator---perception-aware sampling---that selects subsets optimized for how humans visually perceive the result. We make the following contributions: (1) We introduce perception-augmented databases and design PAwS, a perception-aware sampling operator for scatterplot visualizations that leverages saliency maps---a computer vision tool for predicting areas of visual attention---combined with density and coverage objectives. (2) We design ApproPAwS: a fast approximate visualization method that works directly over a perception-aware compressed synopsis of the data, achieving up to 100x speed-ups with minimal loss in visual fidelity, and without accessing the underlying data at query time. (3) We contribute a perceptual similarity metric that evaluates the quality of a sample by comparing its saliency map to that of the original dataset, a novel evaluation methodology, applicable to any sampling method for scatterplots. (4) Our extensive experimental evaluation over datasets up to 3.5M points demonstrates that our methods consistently outperform five state-of-the-art sampling algorithms. A user study confirms that PAwS samples are preferred by humans, validating our quantitative findings.

cs.HC · cs.DB

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.70ACL Anthology · ACL 2026

CachePrune: Teaching LLMs What Not to Follow via KV-Cache Editing

Rui Wang Adobe Systems, Junda Wu University of California, San Diego, Yu Xia University of California, San Diego, Tong Yu Adobe Research, Ruiyi Zhang, Ryan A. Rossi, Subrata Mitra Adobe Systems, Lina Yao University of New South Wales 等 9 位作者

原文摘要

Large Language Models (LLMs) are susceptible to indirect prompt injection attack, where the model inadvertently responds to instructions injected into the prompt context. This vulnerability stems from LLMs’ inability to distinguish between data and instructions within a prompt. We propose CachePrune that defends against this attack by identifying and pruning neurons associated with instruction-following, during KV cache encoding of the prompt context. The pruning steers the LLM toward interpreting the context purely as data rather than as instructions to follow. To identify these neurons, we introduce a neural attribution mechanism guided by a preferential attribution loss, and theoretically connect this loss to an upper bound of the Direct Preference Optimization (DPO) objective. Further, we improve on the fidelity of neural attribution by leveraging an observed triggering effect in instruction-following. Our approach does not interfere with prompt formatting or incur test-time overhead in response generation. Experiments show that CachePrune significantly reduces the attack success rate while preserving the LLM’s ability to follow user instructions.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表