跳到正文
Jones Ray

ScholarPulse 日报 2026-10-28

2026-10-28 学术简报:2 篇。评估显示LLM在无提示自由探索中发现物理规律的能力极弱,12个被测模型中仅GPT-6-Astra达到16.7%的发现率,其余均为0%。

今日速览

序号标题来源日期主题推荐等级
1Can LLMs Uncover Hidden Physical Laws through Free Exploration?arXiv2026-10-27AI-Agent高
2Agentic Distributional Regression: Conditional Density Estimation through Agent-Written ProgramsarXiv2026-10-27RAG高

重点论文与技术动态

1. Can LLMs Uncover Hidden Physical Laws through Free Exploration?

一句话结论

评估显示LLM在无提示自由探索中发现物理规律的能力极弱,12个被测模型中仅GPT-6-Astra达到16.7%的发现率,其余均为0%。

核心内容

方法与数据

价值判断

摘要 Scientific discovery often begins with an unexpected observation that prompts a new research question. In a world with altered physical laws, can large language models (LLMs) notice unexpected behavior, such as heavier objects falling more slowly, and discover the law through experiments without being told what to investigate? To evaluate this ability, we introduce LongChang, an automated framework that creates simulated worlds with altered physics, where one or more laws differ from ordinary physics. The evaluated LLMs act as explorers, manipulating objects and building tools to investigate their own questions without research tasks or hints about these laws. Separate LLM agents generate and review scenes, review tool designs, and evaluate reports for correctness and experimental support using the altered physical laws and exploration records. These records guide scene evolution for further exploration, allowing the full cycle to run without human intervention. Among 12 LLMs, GPT-6-Astra achieves a discovery rate of 16.7%, while the other 11 score 0%. The exploration records reveal uninvestigated anomalies and only partial identification of the altered physical laws.

2. Agentic Distributional Regression: Conditional Density Estimation through Agent-Written Programs

一句话结论

论文提出智能体分布回归(ADR),由大语言模型智能体编写简短程序生成显式公式来估计条件概率密度,理论完备且实证性能最优。

核心内容

方法与数据

价值判断

摘要 In this paper we propose a method for estimating conditional densities from an iid sample using a language-model agent. The agent writes the estimator as a short program that, for each covariate value, returns the estimated conditional distribution of the response. The program is built from a library of probability distributions, so the returned law can be a parametric distribution, a mixture or a multivariate factorization, with parameters given by explicit functions of the covariates. Since the number of operations and constants in the program is limited, the fitted conditional density is a formula that can be inspected and evaluated independently of the agent, while the choice of the model structure and of the fitting procedure is left to the agent. We call this approach agentic distributional regression (ADR). Treating the returned program as a random conditional density estimator, we derive a finite-sample error bound under explicit complexity and optimization assumptions, and an oracle inequality for selection using independent validation data. For a stably selected regular structure with sufficiently accurate fitting, we obtain asymptotic normality of the fitted constants. In simulation studies, on twelve real datasets and on a new dataset collected after the agents' training data, ADR with Claude Opus 5.5 has the best average performance among the methods considered.