arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.09273math.OC
收藏

最优插值范数学习

Learning with Optimal Interpolation Norms

Patrick L. Combettes, Andrew M. McDonald, Charles A. Micchelli, Massimiliano Pontil

摘要:

我们分析了一类范数定义通过一个最优插值问题,涉及到的组合范数和一个线性算子。这种构造,称为凸分析中的infimal后合成,被证明包含了机器学习,信号处理和统计中用作正则化器的各种规范。特别是,这些包括潜在组套索,重叠组套索,以及用于学习张量的某些范数。我们建立了这类规范的基本性质,我们提供了对偶规范。本文还讨论了对更一般的凸函数类的推广。一个随机块坐标版本的道格拉斯-Rachford算法的设计来解决最小化问题,涉及这些正则化。该算法的一个突出特点是,它产生的迭代收敛到一个解决方案的情况下,非光滑损失和随机块更新。最后,我们提出了采用潜在的组套索惩罚问题的数值实验。

英文摘要:

We analyze a class of norms defined via an optimal interpolation problem involving the composition of norms and a linear operator. This construction, known as infimal postcomposition in convex analysis, is shown to encompass various of norms which have been used as regularizers in machine learning, signal processing, and statistics. In particular, these include the latent group lasso, the overlapping group lasso, and certain norms used for learning tensors. We establish basic properties of this class of norms and we provide dual norms. The extension to more general classes of convex functions is also discussed. A stochastic block-coordinate version of the Douglas-Rachford algorithm is devised to solve minimization problems involving these regularizers. A prominent feature of the algorithm is that it yields iterates that converge to a solution in the case of non smooth losses and random block updates. Finally, we present numerical experiments with problems employing the latent group lasso penalty.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑