资源分类
》 资源 》论文》Cut-Pursuit Algorithm for Regularizing Nonsmooth Functionals with Graph Total Variation

Cut-Pursuit Algorithm for Regularizing Nonsmooth Functionals with Graph Total Variation

2020-03-20 | |  79 |   51 |   0

Abstract

We present an extension of the cut-pursuit algorithm, introduced by Landrieu & Obozinski (2017), to the graph total-variation regularizatio of functions with a separable nondifferentiable part. We propose a modified algorithmic scheme as well as adapted proofs of convergence. We also present a heuristic approach for handling the case in which the values associated to each vertex of the graph are multidimensional. The performance of our algorithm, which we demonstrate on difficult, ill-conditioned large-scale inverse and lear ing problems, is such that it may in practice extend the scope of application of the total-variati regularization.

上一篇：MSplit LBI: Realizing Feature Selection and Dense Estimation Simultaneously in Few-shot and Zero-shot Learning

下一篇：Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...