ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1605.00507
  4. Cited By
Methods for Sparse and Low-Rank Recovery under Simplex Constraints

Methods for Sparse and Low-Rank Recovery under Simplex Constraints

2 May 2016
Ping Li
Syama Sundar Rangapuram
M. Slawski
ArXiv (abs)PDFHTML

Papers citing "Methods for Sparse and Low-Rank Recovery under Simplex Constraints"

5 / 5 papers shown
Title
Geometric Sparse Coding in Wasserstein Space
Geometric Sparse Coding in Wasserstein Space
M. Mueller
Shuchin Aeron
James M. Murphy
Abiy Tasissa
48
4
0
21 Oct 2022
Positively Weighted Kernel Quadrature via Subsampling
Positively Weighted Kernel Quadrature via Subsampling
Satoshi Hayakawa
Harald Oberhauser
Terry Lyons
105
26
0
20 Jul 2021
Online Graph Dictionary Learning
Online Graph Dictionary Learning
Cédric Vincent-Cuaz
Titouan Vayer
Rémi Flamary
Marco Corneli
Nicolas Courty
77
46
0
12 Feb 2021
On Geometric Analysis of Affine Sparse Subspace Clustering
On Geometric Analysis of Affine Sparse Subspace Clustering
Chun-Guang Li
Chong You
René Vidal
70
32
0
17 Aug 2018
Equivalent Lipschitz surrogates for zero-norm and rank optimization
  problems
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
Yulan Liu
Shujun Bi
S. Pan
59
32
0
30 Apr 2018
1