research
∙
07/17/2023
Optimizing Distributed Tensor Contractions using Node-Aware Processor Grids
We propose an algorithm that aims at minimizing the inter-node communica...
share
research
∙
07/11/2023
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network
Sparse tensor decomposition and completion are common in numerous applic...
research
∙
07/06/2023
Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs
Positive linear programs (LPs) model many graph and operations research ...
research
∙
10/18/2022
Multi-Parameter Performance Modeling via Tensor Completion
Performance tuning, software/hardware co-design, and job scheduling are ...
research
∙
05/26/2022
Cost-efficient Gaussian Tensor Network Embeddings for Tensor-structured Inputs
This work discusses tensor network embeddings, which are random matrices...
research
∙
04/14/2022
Alternating Mahalanobis Distance Minimization for Stable and Accurate CP Decomposition
CP decomposition (CPD) is prevalent in chemometrics, signal processing, ...
research
∙
04/10/2022
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting
State-of-the-art parallel sorting algorithms for distributed-memory arch...
research
∙
10/10/2021
Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels
Formulations of graph algorithms using sparse linear algebra have yielde...
research
∙
07/21/2021
Communication Lower Bounds for Nested Bilinear Algorithms
We develop lower bounds on communication in the memory hierarchy or betw...
research
∙
06/15/2021
Augmented Tensor Decomposition with Stochastic Optimization
Tensor decompositions are powerful tools for dimensionality reduction an...
research
∙
06/14/2021
MTC: Multiresolution Tensor Completion from Partial and Coarse Observations
Existing tensor completion formulation mostly relies on partial observat...
research
∙
04/27/2021
Efficient Preconditioners for Interior Point Methods via a new Schur Complementation Strategy
We propose new preconditioned iterative solvers for linear systems arisi...
research
∙
04/02/2021
Fast and Accurate Randomized Algorithms for Low-rank Tensor Decompositions
Low-rank Tucker and CP tensor decompositions are powerful tools in data ...
research
∙
03/01/2021
Accelerating Distributed-Memory Autotuning via Statistical Analysis of Execution Paths
The prohibitive expense of automatic performance tuning at scale has lar...
research
∙
10/30/2020
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations
We reduce the cost of communication and synchronization in graph process...
research
∙
10/22/2020
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree
CP tensor decomposition with alternating least squares (ALS) is dominate...
research
∙
10/19/2020
SlimSell: A Vectorizable Graph Representation for Breadth-First Search
Vectorization and GPUs will profoundly change graph processing. Traditio...
research
∙
07/10/2020
Distributed-Memory DMRG via Sparse and Dense Parallel Tensor Contractions
The Density Matrix Renormalization Group (DMRG) algorithm is a powerful ...
research
∙
06/26/2020
Efficient 2D Tensor Network Simulation of Quantum Systems
Simulation of quantum systems is challenging due to the exponential size...
research
∙
05/10/2020
AutoHOOT: Automatic High-Order Optimization for Tensors
High-order optimization methods, including Newton's method and its varia...
research
∙
01/05/2020
On Stability of Tensor Networks and Canonical Forms
Tensor networks such as matrix product states (MPS) and projected entang...
research
∙
11/11/2019
Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons
Jaccard Similarity index is an important measure of the overlap of two s...
research
∙
10/29/2019
Derivation and Analysis of Fast Bilinear Algorithms for Convolution
The prevalence of convolution in applications within signal processing, ...
research
∙
10/27/2019
Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CP Decomposition
Alternating least squares is the most widely used algorithm for CP tenso...
research
∙
10/06/2019
Enabling Distributed-Memory Tensor Completion in Python using New Sparse Tensor Kernels
Tensor computations are increasingly prevalent numerical techniques in d...
research
∙
11/26/2018
Accelerating Alternating Least Squares for Tensor Decomposition by Pairwise Perturbation
The alternating least squares algorithm for CP and Tucker decomposition ...
research
∙
03/03/2018
Histogram Sort with Sampling
To minimize data movement, state-of-the-art parallel sorting algorithms ...
research
∙
10/23/2017
Communication-avoiding Cholesky-QR2 for rectangular matrices
The need for scalable algorithms to solve least squares and eigenvalue p...
research
∙
07/14/2017
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
Accurate numerical calculations of electronic structure are often domina...
research
∙
09/22/2016
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
Betweenness centrality (BC) is a crucial graph problem that measures the...
research
∙
11/30/2015
