research
∙
02/21/2023
Boosting Nyström Method
The Nyström method is an effective tool to generate low-rank approximati...
share
research
∙
02/14/2023
Linearized Wasserstein dimensionality reduction with approximation guarantees
We introduce LOT Wassmap, a computationally feasible algorithm to uncove...
research
∙
01/29/2023
Multi-Priority Graph Sparsification
A sparsification of a given graph G is a sparser graph (typically a subg...
research
∙
06/29/2022
Generalized Pseudoskeleton Decompositions
We characterize some variations of pseudoskeleton (also called CUR) deco...
research
∙
06/17/2022
Riemannian CUR Decompositions for Robust Principal Component Analysis
Robust Principal Component Analysis (PCA) has received massive attention...
research
∙
04/13/2022
Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning
In this paper, we propose Wasserstein Isometric Mapping (Wassmap), a par...
research
∙
08/18/2021
Computing Steiner Trees using Graph Neural Networks
Graph neural networks have been successful in many learning problems and...
research
∙
06/22/2021
On Matrix Factorizations in Subspace Clustering
This article explores subspace clustering algorithms using CUR decomposi...
research
∙
03/19/2021
Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions
Low rank tensor approximation is a fundamental tool in modern machine le...
research
∙
03/17/2021
On additive spanners in weighted graphs with local error
An additive +β spanner of a graph G is a subgraph which preserves distan...
research
∙
02/11/2021
Multi-level Weighted Additive Spanners
Given a graph G = (V,E), a subgraph H is an additive +β spanner if _H(u,...
research
∙
01/05/2021
Robust CUR Decomposition: Theory and Imaging Applications
This paper considers the use of Robust PCA in a CUR decomposition framew...
research
∙
10/14/2020
Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation
Robust principal component analysis (RPCA) is a widely used tool for dim...
research
∙
01/08/2020
Stability of Sampling for CUR Decompositions
This article studies how to form CUR decompositions of low-rank matrices...
research
∙
09/07/2019
Graph Spanners: A Tutorial Review
This tutorial review provides a guiding reference to researchers who wan...
research
∙
08/21/2019
Perturbations of CUR Decompositions
The CUR decomposition is a factorization of a low-rank matrix obtained b...
research
∙
07/29/2019
Perspectives on CUR Decompositions
This note discusses an interesting matrix factorization called the CUR D...
research
∙
05/02/2019
A General Framework for Multi-level Subsetwise Graph Sparsifiers
Given an undirected weighted graph $G(V,E)$, a subsetwise sparsifier ove...
research
∙
04/01/2019
Approximation algorithms and an integer program for multi-level graph spanners
Given a weighted graph G(V,E) and t > 1, a subgraph H is a t--spanner of...
research
∙
03/22/2019
CUR Decompositions, Approximations, and Perturbations
This article discusses a useful tool in dimensionality reduction and low...
research
∙
11/11/2017