跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

+788新增论文
+627其中 AI 相关
+81已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-09 11:20 · 全站最近入库:2026-11-09 11:19各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-09 11:20最近发现新增版本:2026-11-09 11:19库内论文最新更新时间:2026-11-06 21:58

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

17,888 已收录论文15,288 AI 相关4,419 有修订112 HF 社区发现

浏览论文库

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

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

Persistence, Exposure, and Credit Routing in Linear Temporal Predictive Coding

Akira Tanase, Julian Gould, Jeffrey Seely

原文摘要

Temporal Predictive Coding (tPC) networks offer a layer-local alternative to backpropagation. For linear tPC, we show, by applying tools from cellular sheaf theory, that temporal credit assignment is a tug-of-war between spatial displacement and temporal errors, whose ratios are modulated by persistence and exposure operators $P$ and $Q$. Spatial inference therefore gives us the effective recurrent transition $F=PA$, whilst future credit is filtered by $P^\ast$. This creates a persistence--error tradeoff in spatial modes: under non-amplifying invariant recurrence, modes that preserve influence over long delays simultaneously fail to expose that influence strongly as temporal error. Recurrence can circumvent this via routing between persistent and exposed modes.

cs.LG · cs.IT