研究人员开发了一种新的统计逆向学习方法，该方法利用 \(\ell^1\)-正则化从间接和噪声观测中恢复稀疏函数。所提出的方法在理论上进行了分析，确立了其一致性，并推导了预测和 \(\ell^1\) 重构范数下的收敛速率。通过匹配极小极大下界，这些速率被证明是最优的。该框架应用于椭圆偏微分方程中的反应系数识别和稀疏计算断层扫描等问题，并为滤波后的Radon变换推导了显式的收敛速率。 AI
排序理由 该条目是发表在arXiv上的学术论文，详细介绍了一种新的统计方法。[lever_c_demoted from research: ic=1 ai=1.0]
AI 生成摘要 · Google Gemini · 来自 2 个来源。 我们如何撰写摘要 →
arXiv:2607.07468v1 Announce Type: new Abstract: We study the recovery of sparse functions from finite, noisy, and indirect observations in the framework of statistical inverse learning. The unknown is modeled as an element of $\ell^1$, and observations are generated through a pos…
We study the recovery of sparse functions from finite, noisy, and indirect observations in the framework of statistical inverse learning. The unknown is modeled as an element of $\ell^1$, and observations are generated through a possibly nonlinear forward operator $A:\ell^1\to H$…