资源分类
》 资源 》论文》On Approximation Guarantees for Greedy Low Rank Optimization

On Approximation Guarantees for Greedy Low Rank Optimization

2020-03-10 | |  61 |   47 |   0

Abstract

We provide new approximation guarantees for greedy low rank matrix estimation under standard assumptions of restricted strong convexity and smoothness. Our novel analysis also uncovers previously unknown connections between the low rank estimation and combinatorial optimization, so much so that our bounds are reminiscent of corresponding approximation bounds in submodular maximization. Additionally, we also provide statistical recovery guarantees. Finally, we present empirical comparison of greedy estimation with established baselines on two important real-world problems.

上一篇：SPLICE: Fully Tractable Hierarchical Extension of ICA with Pooling

下一篇：Post-Inference Prior Swapping

用户评价
全部评价

热门资源

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

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...