跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要研究物理粒子系统的统计分类,粒子相互作用本身不足以归入经济网络与干扰方向。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Christophe Denis
Yating Liu

谁驱动系统?根据轨迹数据分类平均场粒子系统

研究问题
当粒子相互依赖且单粒子轨迹不具Markov性时,如何根据新系统中一个粒子的轨迹,判断该系统所属的相互作用漂移类别?
方法与思路
作者利用McKean–Vlasov极限,以B样条基上的岭正则化最小二乘估计各类别的相互作用漂移,再构造基于漂移估计的代入分类器。
材料陈述的贡献
摘要称给出新的非参数漂移估计与分类器收敛结果,并报告数值实验中优于未利用粒子系统结构的端到端神经网络基准。
阅读关注点
应核对粒子数、训练系统数和离散观测频率各自的作用、平均场近似误差,以及分类损失定义和神经网络比较的具体设定。
阅读边界
依据arXiv v2预印本摘要,同行评审或期刊接收未核验;收敛率指数排版不清,须查阅原PDF,不重构公式或推广数值优势。

原文摘要

We study the supervised classification problem for interacting particle systems (IPS) from trajectory observations. The IPS belongs to one of K classes, each characterized by a distinct interaction drift. Given a learning dataset, the goal is then to predict the class label of a newly observed system based on the trajectory of a single particle. This setting raises several statistical challenges. First, the particles within each system interact and are therefore dependent. Second, although the full particle system is Markovian, the trajectory of a single particle is not. To address these difficulties, we exploit the McKean-Vlasov limit of the IPS, which describes the dynamics of a typical particle as the number of particles tends to infinity. We propose a plug-in classification procedure based on estimating the interaction drift associated with each class from discretely observed trajectory data. Hence, for each class, we provide a new nonparametric estimator of the drifts by minimizing a ridge-regularized least-squares contrast over a B-spline basis. In particular, our theoretical findings reveal that the convergence rate of the resulting classifier is of order N -1/6+$ε$ for any $ε$ > 0, where N denotes the number of particles in each system. Numerical experiments illustrate the performance of the proposed method and show that it outperforms an end-to-end neural network baseline that does not exploit the underlying particle-system structure.

笔记与分组