资源分类
》 资源 》论文》Fast greedy algorithms for dictionary selection with generalized sparsity constraints

Fast greedy algorithms for dictionary selection with generalized sparsity constraints

2020-02-18 | |  61 |   41 |   0

Abstract

 In dictionary selection, several atoms are selected from finite candidates that successfully approximate given data points in the sparse representation. We propose a novel efficient greedy algorithm for dictionary selection. Not only does our algorithm work much faster than the known methods, but it can also handle more complex sparsity constraints, such as average sparsity. Using numerical experiments, we show that our algorithm outperforms the known methods for dictionary selection, achieving competitive performances with dictionary learning algorithms in a smaller running time.

上一篇：Overcoming Language Priors in Visual Question Answering with Adversarial Regularization

下一篇：Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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