跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

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

全站更新概况

+479新增论文
+361其中 AI 相关
+63已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 13:44各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 13:44库内论文最新更新时间:2026-11-14 02:59

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

23,827 已收录论文19,941 AI 相关6,921 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v4arXiv:2610.16102

Where Polanyi Meets Galois: Tacit Knowing as an Algebro-Deterministic Operation, Toward Re-rooting AI-Generated Science

Hiroyuki Chuma, Kanji Otsuka, Yoichi Sato, Kodo Yamauchi

原文摘要

Tacit knowing is an operating regime of one memory substrate, not a separate kind of content. In VaCoAl (CASRAM, PyVaCoAl), an algebro-deterministic hyperdimensional memory over GF(2), one DAG of bound records is read in two ways. With every collision repaired (Rescue), the trace is exactly auditable but no path outranks another; with collisions tolerated (Don't Care), a path-integrated confidence $CR_2$ ranks direct over circuitous routes without being stated. This audit-valuation complementarity formalizes Polanyi's claim that tacit and explicit knowledge are not sharply divided. (1) Polanyi's from-to structure reads as non-commutative binding. (2) Full explication destroys the valuation (Lemma 1), as with Polanyi's pianist; tacitness is contingent or regime-bound, placing Polanyi, Nonaka, Tsoukas and Collins on one substrate. (3) The same lemma answers the popular dual-process moral ("train slow System 2 to tame fast System 1"), which mirrors the two-store reading of knowledge Polanyi rejected; Mercier and Sperber's reply, that reasoning is intuitive inference about reasons, matches his. (4) To know a large DAG is to cull it. Simon answered Polanyi's Meno argument: a test and a generator suffice. The AlphaGo-to-AlphaProof lineage builds that answer, yet a checker audits an endpoint and values no path: the tacit is relocated, not removed, and results are verified yet rootless. (5) Collins's three tacit knowledges map to bound structure, substrate valuation and value binding. (6) Our mentor-student DAG charts tacit transmission. (7) AI-solved problems with few follow-ups (Tao) are rootless explicit knowledge, re-rooted when LLMs generate, VaCoAl keeps the trace and the community values. (8) On Mercier and Sperber's theory an LLM is a sophist; truth-seeking lies in collective tacit knowing, Polanyi's conviviality, which we conjecture extends beyond humans. Testable predictions follow.

cs.NE · cs.AI

版本更新 · v3arXiv:2511.18127

Predictive Representation Learning for Manipulation via Streaming Egocentric 3D Hand Forecasting

Ruicong Liu, Yifei Huang, Liangyang Ouyang, Caixin Kang, Yoichi Sato

原文摘要

Learning embodied manipulation from egocentric human data offers a scalable path, reducing the cost of collecting robot-specific demonstrations. However, existing representation learning methods largely stop at perceptual understanding, such as extracting what a scene contains or what an action is. A capable embodied agent is more than understanding: it predicts the next motion. We propose that forecasting 3D human hand motion is one suitable pretraining task, as the representation jointly learns how to manipulate objects and how the motion will unfold next. Building on this hypothesis, we introduce SFHand, the first representation learning method via streaming egocentric 3D hand forecasting. SFHand learns by autoregressively predicting future 3D hand states, including hand type, 2D bounding box, 3D pose, and trajectory, from a continuous stream of video and language instructions. Its autoregressive architecture is equipped with an ROI-enhanced memory layer, capturing temporal context while focusing on salient hand-centric regions. To enable this research, we also introduce SFHand, the first open-source large-scale dataset pairing synchronized 3D hand poses with fine-grained language instructions (247K clips, 3.95M frames). Transferred to downstream embodied control, the learned representation shows state-of-the-art performance on both simulation and real-world manipulation benchmarks, improving success rate by up to 13.4%. Our method also achieves leading 3D hand forecasting accuracy, with 35.8% lower ADE than baseline methods. These results suggest that forecasting hand motion is a better pretraining task for representation learning in embodied manipulation. Projec page: https://ruicongliu.github.io/sfhand/.

cs.CV