A Sieve M-Estimator for Entropic Optimal Transport
熵正则最优传输的筛法 M 估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论熵正则最优传输的筛法 M 估计与统计收敛性,属于计量理论与统计估计方法,未涉及因果推断、面板、离散选择、时间序列、金融定价等用户所列具体领域细分,故不选择任何细分方向。
熵正则最优传输的筛法 M 估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Entropically regularized optimal transport between probability measures supported on compact subsets of Euclidean space admits a representation as an information projection under moment inequality constraints. Exploiting this structure, I develop a sieve-based approximation of the Fenchel dual, yielding a sequence of finite-dimensional convex programs whose sample analogues provide tractable estimators of the regularized optimal value and associated dual optimizers. Under minimal assumptions--compact support and continuity of the cost function--I establish almost sure consistency of these estimators. I further derive finite-sample bounds for the estimation error of the optimal value, featuring only logarithmic dependence on sieve complexity, and obtain asymptotic stochastic bounds characterized by suprema of centered Gaussian processes. The results furnish general statistical guarantees for sieve-based estimation of entropic optimal transport and apply to settings not covered by existing theory for the empirical Sinkhorn divergence and other sieve-based methods.