跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

+2471新增论文
+2025其中 AI 相关
+163已有论文修订
+100新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

20,643 已收录论文17,531 AI 相关5,643 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-10 17:26(北京时间)
新论文 · v1arXiv:2611.12762

Sage-Taiyi: A Metacognitive Architecture for Scientific Discovery

Weida Wang, Benteng Chen, Yigeng Jiang, Shuchen Pu, Weiping Shen, Zichao Liu, Yulin Su, Zitong Wang 等 90 位作者

原文摘要

We introduce Sage-Taiyi, a metacognition-inspired architecture that uses accumulated scientific understanding to guide what to investigate next and how to investigate it. Through explicit monitoring and control, the system revises its understanding of evidence, assumptions, and unresolved questions, then uses these assessments to adapt research targets and select reusable reasoning methods. On Taiyi-Bench, an AI co-scientist ideation benchmark comprising 265 tasks from 50 papers across ten disciplines, Sage-Taiyi ranks first on all eight metrics of historical rediscovery and open-ended ideation, achieving an Overall score of 54.0 compared with 47.9 for the strongest baseline, AI Scientist-v2. It also performs well on two external scientific ideation benchmarks. Five expert-guided collaborations further connect its proposals to experimental and computational validation across chemistry, materials science, and engineering. In chemistry, reaction-condition optimization raises the yield of cobalt-catalyzed carbonylation from trace amounts to 84% and photocatalytic allylic amination from 13% to 69%. These results support metacognitive regulation as an approach to scientific ideation and its progression toward practical validation.

cs.AI

版本更新 · v2arXiv:2606.24153

Differential Unfolding: Efficient Reconstruction for Video Snapshot Compressive Imaging

Yin-Ping Zhao, Muyuan Zhang, Jiaxi Li, Jiancheng Zhang, Haijin Zeng, Xuelong Li

原文摘要

Although Deep Unfolding Networks (DUNs) are predominant in Video Snapshot Compressive Imaging (SCI), they are still limited by a uniform design philosophy. The existing approaches stack high-complexity priors with the same structure repeatedly, neglecting the fact that the optimization paths gradually converge to a nearly static state. As a consequence, representation stagnation occurs, and much computational cost is wasted on small feature updates. To solve this inefficiency, we propose Differential Unfolding (DU), a heterogeneous framework that substitutes repeated work with a periodic schedule of heavy and lightweight stages. The core of DU is the Differential Evolutionary Framework (DEF), which divides the unfolding procedure into two complementary roles: structural anchoring and differential evolution. In this method, high-parameter general stages are used sparsely to form high-fidelity feature foundations. On the other hand, lightweight differential stages use a Differential Representation Prior (DRP) to pass on and refine these foundational features by a differential mechanism. By integrating Differential Representation Attention (DRA) for evolving attention maps and a Differential Modulated FFN (DM-FFN) for feature rectification, DRP effectively models cross-stage variations with minimal overhead. By concentrating high-capacity computation on the sparsely-scheduled general stages and delegating incremental refinement to the lightweight differential stages, DU achieves a superior trade-off between accuracy and efficiency. Extensive experiments show that DU-9stg achieves state-of-the-art reconstruction quality, while DU-5stg surpasses all compared methods with the fewest parameters and FLOPs; compared with the unfolding method DADUN, DU-9stg needs about half the parameters and a quarter of the FLOPs. Code: https://github.com/Muyuan-Zhang/DU

cs.CV