跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2610.37611 · v2

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

首次提交 2026-10-28 01:41
版本更新 2026-10-30 00:17
雷达观测 2026-10-30 13:28
arXiv ↗PDF ↗

摘要

Artificial intelligence offers statisticians a new paradigm for modelling and analysing complex datasets. Agents based on large language models can reason about data and automate key stages of the statistical modelling workflow, from model fitting to validation. In this paper we propose a method that uses such an agent to estimate the conditional density of a response given a vector of covariates from an iid sample. The agent examines the sample, chooses a model for the conditional distribution of the response and the procedure to fit it, and returns the estimator as a short computer program. The program is built from a library of probability distributions. The returned law can therefore be a parametric distribution, a mixture or a multivariate factorization, with distribution parameters given by explicit formulas in the covariates. We call this approach agentic distributional regression (ADR). Unlike in the classical approach, the statistician no longer chooses the estimator, but asks an agent to build one. Treating the returned program as a random conditional density estimator, we derive a finite-sample error bound under assumptions on the number of admissible models and on the accuracy of the agent's fit, and an oracle inequality for the selection of a model among fitted candidates using independent validation data. Finally, assuming that, as the sample size grows, the agent selects the same smooth parametric model with probability tending to one and fits it accurately, we show that the estimated parameters are asymptotically normal. In simulation studies, on twelve real datasets and on a new dataset whose responses postdate the agents' training data, ADR with Claude Opus 5.5 has the best average performance among the existing methods from the statistical literature with which it is compared.

作者备注:47 pages, 6 figures, 11 tables

AI 论文解读

基于摘要 · 非全文审阅

提出让大语言模型智能体根据样本自动选择条件分布模型并输出拟合程序,从而估计条件密度的方法(ADR)。

正在读取账号与研究记录…

版本差异

仅对比实际观测的元数据,不代表 PDF 正文或实验变化。版本可能不连续;带删除线为移除,下划线为新增。

作者变化

Lorenzo Tedesco,Francesco Finazzi

摘要变化

Artificial intelligence offers statisticians a new paradigm for modelling and analysing complex datasets. Agents based on large language models can reason about data and automate key stages of the statistical modelling workflow, from model fitting to validation. In this paper we propose a method forthat estimatinguses conditionalsuch densitiesan fromagent anto iidestimate samplethe usingconditional density of a language-modelresponse agentgiven a vector of covariates from an iid sample. The agent writesexamines the estimatorsample, aschooses a shortmodel programfor that,the forconditional eachdistribution covariateof valuethe response and the procedure to fit it, and returns the estimatedestimator conditionalas distributiona ofshort thecomputer responseprogram. The program is built from a library of probability distributions, so. theThe returned law can therefore be a parametric distribution, a mixture or a multivariate factorization, with distribution parameters given by explicit functionsformulas ofin the covariates. Since the numberWe ofcall operationsthis andapproach constantsagentic indistributional theregression program(ADR). isUnlike limited,in the fitted conditional density is a formula that can be inspected and evaluated independently of theclassical agentapproach, while the choice of the modelstatistician structureno andlonger ofchooses the fitting procedure isestimator, leftbut toasks thean agent. We call this approach agentic distributionalto regressionbuild (ADR)one. Treating the returned program as a random conditional density estimator, we derive a finite-sample error bound under explicitassumptions complexityon the number of admissible models and optimizationon assumptionsthe accuracy of the agent's fit, and an oracle inequality for the selection of a model among fitted candidates using independent validation data. ForFinally, aassuming stablythat, selectedas regularthe structuresample size grows, the agent selects the same smooth parametric model with sufficientlyprobability accuratetending fittingto one and fits it accurately, we obtainshow asymptoticthat normalitythe ofestimated theparameters fittedare constantsasymptotically normal. In simulation studies, on twelve real datasets and on a new dataset collectedwhose afterresponses postdate the agents' training data, ADR with Claude Opus 5.5 has the best average performance among the existing methods consideredfrom the statistical literature with which it is compared.

作者备注变化

47 pages, 6 figures, 11 tables

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-10-30 00:17 · 最新观测版本

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

Artificial intelligence offers statisticians a new paradigm for modelling and analysing complex datasets. Agents based on large language models can reason about data and automate key stages of the statistical modelling workflow, from model fitting to validation. In this paper we propose a method that uses such an agent to estimate the conditional density of a response given a vector of covariates from an iid sample. The agent examines the sample, chooses a model for the conditional distribution of the response and the procedure to fit it, and returns the estimator as a short computer program. The program is built from a library of probability distributions. The returned law can therefore be a parametric distribution, a mixture or a multivariate factorization, with distribution parameters given by explicit formulas in the covariates. We call this approach agentic distributional regression (ADR). Unlike in the classical approach, the statistician no longer chooses the estimator, but asks an agent to build one. Treating the returned program as a random conditional density estimator, we derive a finite-sample error bound under assumptions on the number of admissible models and on the accuracy of the agent's fit, and an oracle inequality for the selection of a model among fitted candidates using independent validation data. Finally, assuming that, as the sample size grows, the agent selects the same smooth parametric model with probability tending to one and fits it accurately, we show that the estimated parameters are asymptotically normal. In simulation studies, on twelve real datasets and on a new dataset whose responses postdate the agents' training data, ADR with Claude Opus 5.5 has the best average performance among the existing methods from the statistical literature with which it is compared.

查看此版本解读 →查看此版本原文 ↗
v1 · 2026-10-28 01:41

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

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.

查看此版本解读 →查看此版本原文 ↗