跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

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

Stabilizing Neural Emulation of Spatiotemporal Physical Dynamics through Denoising Koopman Latent Dynamics

Chenxu Wu, Sixing Chen, Junming Hou, Jiahan Huang, Jianqiao Zeng, Peiming Luo, Liang Yan, Jian Wei You

原文摘要

Koopman operator theory provides a principled framework for reduced-order modeling of nonlinear spatiotemporal dynamics through linear evolution in an observable space. In practice, however, learned finite-dimensional representations are typically approximately invariant, causing unresolved dynamics and accumulated closure errors. Recent approaches, inspired by the Mori-Zwanzig formalism, address these effects through deterministic memory or closure modeling, yet robust extrapolation beyond the training horizon remains challenging. Here, we propose KoopFlow, an efficient prediction-correction framework based on the key insight that finite-dimensional Koopman error accumulation can be reinterpreted as a progressive distributional degradation process. Accordingly, KoopFlow treats Koopman predictions as noisy intermediate estimates, which are then transported toward the target latent distribution through a generative model, thereby mitigating accumulated errors while retaining computational efficiency and temporal flexibility. Moreover, we reveal a non-monotonic relationship between Koopman spectral coherence and predictive accuracy. Experiments across diverse nonlinear dynamical systems demonstrate improved long-horizon prediction accuracy and stability over representative baselines, particularly beyond the training horizon.

cs.CE

版本更新 · v6arXiv:2605.06840

Extracting Search Trees from LLM Reasoning Traces Reveals Myopic Planning

Sixing Chen, Ji-An Li, Saner Cakir, Sinan Akcali, Kayla Lee, Marcelo G. Mattar

原文摘要

Large language models (LLMs), especially reasoning models, generate extended chain-of-thought (CoT) reasoning that often contains explicit deliberation over possible futures. Yet it remains unclear whether this deliberation constitutes genuine planning, how it is structured, and what aspects of it drive performance. Here we introduce a method for characterizing LLM planning by extracting search trees from reasoning traces in the board game four-in-a-row. By fitting computational models to the extracted search trees, we quantify how plans are structured and how they influence move decisions. We find that LLMs search less deeply than humans, and that their performance is better predicted by search breadth than depth. Most strikingly, although LLMs expand deep nodes in their traces, their move choices are best explained by a myopic model that ignores those nodes entirely. A causal intervention that selectively prunes CoT paragraphs supports that move selection depends predominantly on shallow rather than deep nodes. These patterns contrast with human planning, where performance is driven primarily by deep search. Together, our findings reveal a key difference between LLM and human planning: human expertise rests on deeper search, whereas LLMs generate deep lookahead but fail to act on it. This dissociation offers concrete targets for aligning LLM and human planning. More broadly, our framework provides a generalizable approach for interpreting the structure of LLM planning across strategic domains.

cs.AI