低维恢复的最优凸正则化理论
A theory of optimal convex regularization for low-dimensional recovery
AI总结:
该论文针对低维模型恢复问题,定义并研究最优凸正则化器,基于受限等距性质给出合规性度量解析式,证明l1范数和核范数的最优性,并探讨构造方法。
摘要:
我们考虑从欠定线性测量中恢复低维模型元素的问题。为了进行恢复,我们考虑在数据拟合约束下最小化凸正则化器。给定一个模型,我们问自己什么是执行其恢复的“最佳”凸正则化器。为了回答这个问题,我们将最优正则化器定义为相对于模型最大化合规性度量的函数。我们引入并研究了几种合规性概念。我们给出了基于受限等距性质的最著名恢复保证的合规性度量的解析表达式。这些表达式允许证明对于这些合规性度量,稀疏恢复的${\ell}$1范数和低秩矩阵恢复的核范数的最优性。我们还使用分层稀疏性和稀疏加低秩模型的例子来研究最优凸正则化器的构造。
英文摘要:
We consider the problem of recovering elements of a low-dimensional model from under-determined linear measurements. To perform recovery, we consider the minimization of a convex regularizer subject to a data fit constraint. Given a model, we ask ourselves what is the "best" convex regularizer to perform its recovery. To answer this question, we define an optimal regularizer as a function that maximizes a compliance measure with respect to the model. We introduce and study several notions of compliance. We give analytical expressions for compliance measures based on the best-known recovery guarantees with the restricted isometry property. These expressions permit to show the optimality of the ${\ell}$1-norm for sparse recovery and of the nuclear norm for low-rank matrix recovery for these compliance measures. We also investigate the construction of an optimal convex regularizer using the examples of sparsity in levels and of sparse plus low-rank models.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。