资源分类
》 资源 》论文》A Nearly-Linear Time Framework for Graph-Structured Sparsity

A Nearly-Linear Time Framework for Graph-Structured Sparsity

2019-11-25 | |  78 |   43 |   0
Abstract We introduce a framework for sparsity structures defined via graphs. Our approach is flexible and generalizes several previously studied sparsity models. Moreover, we provide efficient projection algorithms for our sparsity model that run in nearly-linear time. In the context of sparse recovery, our framework achieves an informationtheoretically optimal sample complexity for a wide range of parameters. We complement our theoretical analysis with experiments showing that our algorithms also improve on prior work in practice.

上一篇：Domain Model Acquisition in the Presence of Static Relations in the LOP System

下一篇：Projection, Inference, and Consistency

用户评价
全部评价

热门资源

  • 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...