跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

+1072新增论文
+845其中 AI 相关
+94已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-09 21:43 · 全站最近入库:2026-11-09 13:22各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-09 21:43最近发现新增版本:2026-11-09 13:22库内论文最新更新时间:2026-11-07 02:59

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

18,172 已收录论文15,506 AI 相关4,527 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-09 21:40(北京时间)
新论文 · v1arXiv:2611.03887

The Information Limits of Neural Controlled Differential Equations Under Sparse Observations

Rostislav Gusev, Evgenia Romanenkova, Alexey Zaytsev

原文摘要

Neural controlled differential equations (Neural CDEs) evolve hidden states along continuous paths constructed by interpolating discrete observations. Sparse measurements leave the input between observation times undetermined, and admissible continuous paths consistent with the same data can produce different terminal states. We characterize this ambiguity for planar drivers with bounded speed. The set of compatible terminal states admits a leading-order zonotopic approximation determined by feasible signed areas and transported Lie brackets. Its projection onto a scalar prediction yields a computable, target-specific ambiguity certificate. We also study the number of measurements needed to reduce the remaining uncertainty. For nondegenerate planar CDEs, the optimal worst-case radius over deterministic adaptive sampling policies scales as $N^{-1}$ when speed is bounded and $N^{-2}$ when both speed and acceleration are bounded, where $N$ is the number of observation intervals. Synthetic experiments assess the certificate using admissible continuous completions and examine the role of path regularity.

cs.LG

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

Hallucination Detection in LLMs with Topological Divergence on Attention Graphs

Alexandra Bazarova Applied AI Institute, Andrei Volodichev Applied AI Institute, Aleksandr Yugay Applied AI Institute, Andrey Shulga Applied AI Institute, Alina Ermilova University of Sharjah and Applied AI Institute, Konstantin Polev SB AI Lab, Julia Belikova, Rauf Parchiev 等 13 位作者

原文摘要

Hallucinations remain a critical challenge for large language models (LLMs), particularly in Retrieval-Augmented Generation (RAG) settings where models may generate outputs unsupported by the provided context. To address this, we introduce TOHA, a TOpology-based HAllucination detector, which leverages a topological divergence metric to quantify the structural properties of graphs induced by attention matrices. Examining the topological divergence between prompt and response subgraphs in RAG settings reveals consistent patterns: higher divergence values in specific attention heads correlate with unfaithful outputs, independent of the dataset. Extensive experiments — including evaluations on question answering and summarization tasks — show that our approach achieves state-of-the-art or competitive results on several benchmarks while requiring minimal annotated data and computational resources. Our findings indicate that the topological structure of attention matrices provides an efficient and robust metric for assessing the correctness of LLM’s responses.

cs.CL

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