跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1680新增论文
+1333其中 AI 相关
+187已有论文修订
+59新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-17 23:35各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-17 23:35库内论文最新更新时间:2026-11-17 02:59

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

25,786 已收录论文21,491 AI 相关7,725 有修订112 HF 社区发现

浏览论文库

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

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
版本更新 · v3arXiv:2602.02799

Joint Learning of Hierarchical Neural Options and Abstract World Model

Wasu Top Piriyakulkij, Wolfgang Lehrach, Kevin Ellis, Kevin Murphy

原文摘要

Building agents that can perform new skills by composing existing skills is a long-standing goal of AI agent research. Towards this end, we investigate how to efficiently acquire a sequence of skills, formalized as hierarchical neural options. However, existing model-free hierarchical reinforcement algorithms need a lot of data. We propose a novel method, which we call AgentOWL (Option and World model Learning Agent), that jointly learns -- in a sample efficient way -- an abstract world model (abstracting across both states and time) and a set of hierarchical neural options. We show, on a subset of Object-Centric Atari games, that our method can learn more skills using less data than baseline methods and possesses learning and generalization capabilities that the baselines do not have.

cs.LG · cs.AI

版本更新 · v3arXiv:2605.24528

Learning Mental Models From Unreliable Evidence

Jeffrey Qin, Zhuangfei Gao, Wasu Top Piriyakulkij, Mia Radovanovic, Jessica Sommerville, Kevin Ellis, Marta Kryven

原文摘要

Children expertly construct mental models under uncertainty despite limited world knowledge. Which computational principles make this possible? We study this question in an interactive physical Box Task in which participants infer a latent cause through interaction with a stochastic and partially observed environment. The Box Task was originally designed to study children's puzzle-solving qualitatively. We contribute a computational analysis of behavior that formalizes the cognitive process by which children generate new hypotheses and respond to environmental uncertainty as inference unfolds. Our modeling framework is based on Bayesian particle-based inference, which maintains a small set of working hypotheses and continually generates new ones. We give two complementary implementations of hypothesis representations within this framework: (1) as constraints on evidence, and (2) as executable programs evaluated against evidence. Using the constraint-based formulation, we show that the model needs to account both for subjective reliability of evidence and online hypothesis generation to explain key signatures of children's behavior. Using the programmatic formulation, we show that hypotheses may take the form of partial compositional rules to guide information gathering when evidence interpretation is hard. The programmatic hypotheses are implemented using LLM-based program synthesis, evaluated across three prompt variants and several LLM backends, demonstrating robustness of our approach. Together, these results extend current models of children's inference to account for subjective reliability of evidence and open-ended hypothesis spaces, and provide a computational analysis of the form generated hypotheses may take in practice.

cs.AI · cs.CL · cs.LG

新论文 · v1arXiv:2610.35617

Distilling neural networks into equations to predict planetary instability

Simon Alford, Edward Gu, Omar Costilla-Reyes, Dan Tamayo, Miles Cranmer, Kevin Ellis

原文摘要

The problem of predicting when a multi-planet system will become dynamically unstable has defied analytical progress over the past three hundred years. Recent machine learning advances achieve high predictive performance of instability dynamics, but as black-box systems cannot be interpreted to connect to existing scientific understanding. Here we show analytic equations that predict when a multi-planet system will undergo instability. We discover these equations by first training a neural network on a dataset of N-body simulations, and then distilling its latent knowledge into closed-form algebraic expressions. Our two-stage pipeline first learns an interpretable variable basis, then searches for equations using symbolic regression. The resulting equations outperform existing analytic estimates of instability and apply across wide ranges of mass ratios, spacing, and orbital eccentricities. They capture structure in the prediction landscape with a small number of variables amenable to dynamical interpretation. These results demonstrate how symbolic learning can be combined with neural networks to extract scientific insight from complex dynamical systems.

cs.LG · astro-ph.EP