arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2106.05565stat.MLcs.LGmath.PR
收藏

交互粒子平均场方程中交互核的可识别性

Identifiability of interaction kernels in mean-field equations of interacting particles

Johns Hopkins University(约翰斯·霍普金斯大学)

Quanjun Lang, Fei Lu

AI总结:

研究交互粒子平均场方程中交互核的可识别性,在两种数据自适应$L^2$空间中证明其函数空间为反演算子相关RKHS的闭包,指出反问题病态需正则化,并验证加权空间能产生更准确的估计器。

摘要:

本研究考察了交互粒子或智能体平均场方程中交互核的可识别性,这一领域在多个科学和工程领域中日益受到关注。主要关注点是识别数据依赖的函数空间,在这些空间中,二次损失泛函具有唯一的极小值解。我们考虑了两种数据自适应的 $L^2$ 空间:一种由数据自适应测度加权,另一种使用勒贝格测度。在每个 $L^2$ 空间中,我们证明可识别性的函数空间是与反演积分算子相关的 RKHS 的闭包。结合先前的研究,本研究完成了对具有有限或无限粒子的交互粒子系统中可识别性的完整刻画,突出了这两种设置之间的关键差异。此外,可识别性分析对计算实践具有重要意义。它表明该反问题是病态的,需要正则化。我们的数值演示表明,加权 $L^2$ 空间优于非加权 $L^2$ 空间,因为它能产生更准确的正则化估计器。

英文摘要:

This study examines the identifiability of interaction kernels in mean-field equations of interacting particles or agents, an area of growing interest across various scientific and engineering fields. The main focus is identifying data-dependent function spaces where a quadratic loss functional possesses a unique minimizer. We consider two data-adaptive $L^2$ spaces: one weighted by a data-adaptive measure and the other using the Lebesgue measure. In each $L^2$ space, we show that the function space of identifiability is the closure of the RKHS associated with the integral operator of inversion. Alongside prior research, our study completes a full characterization of identifiability in interacting particle systems with either finite or infinite particles, highlighting critical differences between these two settings. Moreover, the identifiability analysis has important implications for computational practice. It shows that the inverse problem is ill-posed, necessitating regularization. Our numerical demonstrations show that the weighted $L^2$ space is preferable over the unweighted $L^2$ space, as it yields more accurate regularized estimators.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑