Search Results for author:
Found 2 papers, 1 papers with code
Locality Regularized Reconstruction: Structured Sparsity and Delaunay Triangulations
We prove that, for all levels of regularization and under a mild condition that the columns of $\mathbf{X}$ have a unique Delaunay triangulation, the optimal coefficients' number of non-zero entries is upper bounded by $d+1$, thereby providing local sparse solutions when $d \ll n$.
Geometric Sparse Coding in Wasserstein Space
We show this approach leads to sparse representations in Wasserstein space and addresses the problem of non-uniqueness of barycentric representation.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
