Wasserstein convergence in Bayesian and frequentist deconvolution models
贝叶斯与频率学派反卷积模型中的 Wasserstein 收敛AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:核心目标是恢复潜在信号分布并衡量分布估计误差,直接关联分布估计方向。
贝叶斯与频率学派反卷积模型中的 Wasserstein 收敛AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We study the multivariate deconvolution problem of recovering the distribution of a signal from independent and identically distributed observations additively contaminated with random errors having known distribution. For errors with ordinary smooth distribution, we recast the multidimensional problem as a one-dimensional problem leveraging the equivalence between the L1-Wasserstein and the max-sliced L1-Wasserstein metrics and derive an inversion inequality relating the L1-Wasserstein distance between two distributions of the signal to the L1-distance between the corresponding mixture densities of the observations. This smoothing inequality outperforms existing inversion inequalities. We apply it to derive L1-Wasserstein rates of convergence for the distribution of the signal. As an application to the Bayesian framework, we consider L1-Wasserstein deconvolution with the Laplace noise in dimension one using a Dirichlet process mixture of normal densities as a prior measure for the mixing distribution. We construct an adaptive approximation of the sampling density by convolving the Laplace density with a well-chosen mixture of Gaussian densities and show that the posterior measure contracts at a nearly minimax-optimal rate, up to a log-factor, in the L1-distance. The rate automatically adapts to the unknown Sobolev regularity of the mixing density, thus leading to a new Bayesian adaptive estimation procedure over the full scale of regularity levels. We illustrate the utility of the inversion inequality also in a frequentist setting by showing that a minimum distance estimator attains the minimax convergence rates for L1-Wasserstein deconvolution in any dimension d≥1, lower bounds being derived here.