首页> 外文期刊>IEEE Transactions on Information Theory >Representer Theorems for Sparsity-Promoting ℓ1 Regularization
【24h】

Representer Theorems for Sparsity-Promoting ℓ1 Regularization

机译:稀疏促进ℓ1正则化的表示定理

获取原文
获取原文并翻译 | 示例
           

摘要

We present a theoretical analysis and comparison of the effect of l1 versus l2 regularization for the resolution of ill-posed linear inverse and/or compressed sensing problems. Our formulation covers the most general setting where the solution is specified as the minimizer of a convex cost functional. We derive a series of representer theorems that give the generic form of the solution depending on the type of regularization. We start with the analysis of the problem in finite dimensions and then extend our results to the infinite-dimensional spaces l2(Z) and l1(Z). We also consider the use of linear transformations in the form of dictionaries or regularization operators. In particular, we show that the l2 solution is forced to live in a predefined subspace that is intrinsically smooth and tied to the measurement operator. The l1 solution, on the other hand, is formed by adaptively selecting a subset of atoms in a dictionary that is specified by the regularization operator. Beside the proof that l1 solutions are intrinsically sparse, the main outcome of our investigation is that the use of l1 regularization is much more favorable for injecting prior knowledge: it results in a functional form that is independent of the system matrix, while this is not so in the l2 scenario.
机译:我们提出了理论分析和l1和l2正则化对不适定线性反和/或压缩感测问题的解决方案的比较。我们的公式涵盖了最通用的设置,其中解决方案被指定为凸成本函数的最小化器。我们导出了一系列表示定理,这些定理根据正则化的类型给出了解决方案的一般形式。我们从对有限维问题的分析开始,然后将结果扩展到无限维空间l2(Z)和l1(Z)。我们还考虑使用字典或正则化运算符形式的线性变换。特别是,我们证明了l2解被迫生活在预定义的子空间中,该子空间本质上是平滑的,并且与测量算符相关。另一方面,l1解决方案是通过在正则化运算符指定的字典中自适应选择原子的子集来形成的。除了证明l1解本质上是稀疏的证明之外,我们研究的主要结果是,使用l1正则化更有利于注入先验知识:它产生的函数形式与系统矩阵无关,但不是所以在l2场景中。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号