Edgar Solomonik

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 67

Top Topics

Betweenness Centrality

Tensor Decomposition

Randomized Algorithms

Mahalanobis Distance

Top Venues

Publications

Linjian Ma, Matthew Fishman, Edwin Miles Stoudenmire, Edgar Solomonik
Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm. CoRR (2024)
Raghavendra Kanakagiri, Edgar Solomonik
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network. SPAA (2024)
Wentao Yang, Vipul Harsh, Edgar Solomonik
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting. SPAA (2023)
Navjot Singh, Edgar Solomonik
Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition. SIAM J. Sci. Comput. 45 (6) (2023)
Andreas Irmler, Raghavendra Kanakagiri, Sebastian T. Ohlmann, Edgar Solomonik, Andreas Grüneis
Optimizing Distributed Tensor Contractions using Node-Aware Processor Grids. CoRR (2023)
Edward Hutter, Edgar Solomonik
Application Performance Modeling via Tensor Completion. SC (2023)
Toluwanimi O. Odemuyiwa, Hadi Asghari Moghaddam, Michael Pellauer, Kartik Hegde, Po-An Tsai, Neal Clayton Crago, Aamer Jaleel, John D. Owens, Edgar Solomonik, Joel S. Emer, Christopher W. Fletcher
Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling. ASPLOS (3) (2023)
Toluwanimi O. Odemuyiwa, Hadi Asghari Moghaddam, Michael Pellauer, Kartik Hegde, Po-An Tsai, Neal Clayton Crago, Aamer Jaleel, John D. Owens, Edgar Solomonik, Joel S. Emer, Christopher W. Fletcher
Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling (Extended Abstract). HOPC@SPAA (2023)
Ping-Hsuan Tsai, Paul Fischer, Edgar Solomonik
Accelerating the Galerkin Reduced-Order Model with the Tensor Decomposition for Turbulent Flows. CoRR (2023)
Andreas Irmler, Raghavendra Kanakagiri, Sebastian T. Ohlmann, Edgar Solomonik, Andreas Grüneis
Optimizing Distributed Tensor Contractions Using Node-Aware Processor Grids. Euro-Par (2023)
Raghavendra Kanakagiri, Edgar Solomonik
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network. CoRR (2023)
Caleb Ju, Serif Yesil, Mengyuan Sun, Chandra Chekuri, Edgar Solomonik
Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs. CoRR (2023)
Chaoqi Yang, Cheng Qian, Navjot Singh, Cao (Danica) Xiao, M. Brandon Westover, Edgar Solomonik, Jimeng Sun
ATD: Augmenting CP Tensor Decomposition by Self Supervision. NeurIPS (2022)
Samah Karim, Edgar Solomonik
Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy. SIAM J. Matrix Anal. Appl. 43 (4) (2022)
Navjot Singh, Zecheng Zhang, Xiaoxiao Wu, Naijing Zhang, Siyuan Zhang, Edgar Solomonik
Distributed-memory tensor completion for generalized loss functions in python using new sparse tensor kernels. J. Parallel Distributed Comput. 169 (2022)
Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik
Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels. PPSC (2022)
Edward Hutter, Edgar Solomonik
High-Dimensional Performance Modeling via Tensor Completion. CoRR (2022)
Wentao Yang, Vipul Harsh, Edgar Solomonik
Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting. CoRR (2022)
Linjian Ma, Edgar Solomonik
Cost-efficient Gaussian tensor network embeddings for tensor-structured inputs. NeurIPS (2022)
Linjian Ma, Edgar Solomonik
Cost-efficient Gaussian Tensor Network Embeddings for Tensor-structured Inputs. CoRR (2022)
Linjian Ma, Edgar Solomonik
Accelerating alternating least squares for tensor decomposition by pairwise perturbation. Numer. Linear Algebra Appl. 29 (4) (2022)
Navjot Singh, Edgar Solomonik
Alternating Mahalanobis Distance Minimization for Stable and Accurate CP Decomposition. CoRR (2022)
Chaoqi Yang, Navjot Singh, Cao Xiao, Cheng Qian, Edgar Solomonik, Jimeng Sun
MTC: Multiresolution Tensor Completion from Partial and Coarse Observations. KDD (2021)
Linjian Ma, Edgar Solomonik
Fast and accurate randomized algorithms for low-rank tensor decompositions. NeurIPS (2021)
Edgar Solomonik, James Demmel
Fast Bilinear Algorithms for Symmetric Tensor Contractions. Comput. Methods Appl. Math. 21 (1) (2021)
Chaoqi Yang, Cheng Qian, Navjot Singh, Cao Xiao, M. Brandon Westover, Edgar Solomonik, Jimeng Sun
Augmented Tensor Decomposition with Stochastic Optimization. CoRR (2021)
Caleb Ju, Yifan Zhang, Edgar Solomonik
Communication Lower Bounds for Nested Bilinear Algorithms. CoRR (2021)
Edgar Solomonik, James Demmel, Torsten Hoefler
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions. SIAM J. Sci. Comput. 43 (5) (2021)
Edward Hutter, Edgar Solomonik
Accelerating Distributed-Memory Autotuning via Statistical Analysis of Execution Paths. CoRR (2021)
Samah Karim, Edgar Solomonik
Efficient Preconditioners for Interior Point Methods via a new Schur Complementation Strategy. CoRR (2021)
Tim Baer, Raghavendra Kanakagiri, Edgar Solomonik
Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels. CoRR (2021)
Navjot Singh, Linjian Ma, Hongru Yang, Edgar Solomonik
Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition. SIAM J. Sci. Comput. 43 (4) (2021)
Linjian Ma, Edgar Solomonik
Fast and Accurate Randomized Algorithms for Low-rank Tensor Decompositions. CoRR (2021)
Linjian Ma, Edgar Solomonik
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree. IPDPS (2021)
Edward Hutter, Edgar Solomonik
Accelerating Distributed-Memory Autotuning via Statistical Analysis of Execution Paths. IPDPS (2021)
Chaoqi Yang, Navjot Singh, Cao Xiao, Cheng Qian, Edgar Solomonik, Jimeng Sun
MTC: Multiresolution Tensor Completion from Partial and Coarse Observations. CoRR (2021)
Ryan Levy, Edgar Solomonik, Bryan K. Clark
Distributed-memory DMRG via sparse and dense parallel tensor contractions. SC (2020)
Caleb Ju, Edgar Solomonik
Derivation and Analysis of Fast Bilinear Algorithms for Convolution. SIAM Rev. 62 (4) (2020)
Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, Edgar Solomonik
Communication-Efficient Jaccard similarity for High-Performance Distributed Genome Comparisons. IPDPS (2020)
Maciej Besta, Florian Marending, Edgar Solomonik, Torsten Hoefler
SlimSell: A Vectorizable Graph Representation for Breadth-First Search. CoRR (2020)
Linjian Ma, Jiayu Ye, Edgar Solomonik
AutoHOOT: Automatic High-Order Optimization for Tensors. CoRR (2020)
Yifan Zhang, Edgar Solomonik
On Stability of Tensor Networks and Canonical Forms. CoRR (2020)
Linjian Ma, Jiayu Ye, Edgar Solomonik
AutoHOOT: Automatic High-Order Optimization for Tensors. PACT (2020)
Yuchen Pang, Tianyi Hao, Annika Dugad, Yiqing Zhou, Edgar Solomonik
Efficient 2D tensor network simulation of quantum systems. SC (2020)
Ryan Levy, Edgar Solomonik, Bryan K. Clark
Distributed-Memory DMRG via Sparse and Dense Parallel Tensor Contractions. CoRR (2020)
Yuchen Pang, Tianyi Hao, Annika Dugad, Yiqing Zhou, Edgar Solomonik
Efficient 2D Tensor Network Simulation of Quantum Systems. CoRR (2020)
Maciej Besta, Michal Podstawski, Linus Groner, Edgar Solomonik, Torsten Hoefler
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations. CoRR (2020)
Linjian Ma, Edgar Solomonik
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree. CoRR (2020)
Vipul Harsh, Laxmikant V. Kalé, Edgar Solomonik
Histogram Sort with Sampling. SPAA (2019)
Edward Hutter, Edgar Solomonik
Communication-Avoiding Cholesky-QR2 for Rectangular Matrices. IPDPS (2019)
Navjot Singh, Linjian Ma, Hongru Yang, Edgar Solomonik
Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CP Decomposition. CoRR (2019)
Caleb Ju, Edgar Solomonik
Derivation and Analysis of Fast Bilinear Algorithms for Convolution. CoRR (2019)
Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, Edgar Solomonik
Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons. CoRR (2019)
Kartik Hegde, Hadi Asghari Moghaddam, Michael Pellauer, Neal Clayton Crago, Aamer Jaleel, Edgar Solomonik, Joel S. Emer, Christopher W. Fletcher
ExTensor: An Accelerator for Sparse Tensor Algebra. MICRO (2019)
Zecheng Zhang, Xiaoxiao Wu, Naijing Zhang, Siyuan Zhang, Edgar Solomonik
Enabling Distributed-Memory Tensor Completion in Python using New Sparse Tensor Kernels. CoRR (2019)
Vipul Harsh, Laxmikant V. Kalé, Edgar Solomonik
Histogram Sort with Sampling. CoRR (2018)
Linjian Ma, Edgar Solomonik
Accelerating Alternating Least Squares for Tensor Decomposition by Pairwise Perturbation. CoRR (2018)
Edgar Solomonik, Maciej Besta, Flavio Vella, Torsten Hoefler
Scaling betweenness centrality using communication-efficient sparse matrix multiplication. SC (2017)
Maciej Besta, Florian Marending, Edgar Solomonik, Torsten Hoefler
SlimSell: A Vectorizable Graph Representation for Breadth-First Search. IPDPS (2017)
Edgar Solomonik, Grey Ballard, James Demmel, Torsten Hoefler
A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem. SPAA (2017)
Edward Hutter, Edgar Solomonik
Communication-avoiding Cholesky-QR2 for rectangular matrices. CoRR (2017)
Maciej Besta, Michal Podstawski, Linus Groner, Edgar Solomonik, Torsten Hoefler
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations. HPDC (2017)
Tobias Wicky, Edgar Solomonik, Torsten Hoefler
Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations. IPDPS (2017)
Edgar Solomonik, James Demmel, Torsten Hoefler
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions. CoRR (2017)
Edgar Solomonik, Grey Ballard, James Demmel, Torsten Hoefler
A communication-avoiding parallel algorithm for the symmetric eigenvalue problem. CoRR (2016)
Edgar Solomonik, Maciej Besta, Flavio Vella, Torsten Hoefler
Betweenness Centrality is more Parallelizable than Dense Matrix Multiplication. CoRR (2016)
Tobias Wicky, Edgar Solomonik, Torsten Hoefler
Communication-Avoiding Parallel Algorithms for Solving Triangular Systems of Linear Equations. CoRR (2016)
Edgar Solomonik, Torsten Hoefler
Sparse Tensor Algebra as a Parallel Programming Model. CoRR (2015)
Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Hong Diep Nguyen, Edgar Solomonik
Reconstructing Householder Vectors from Tall-Skinny QR. IPDPS (2014)
Edgar Solomonik, Erin C. Carson, Nicholas Knight, James Demmel
Tradeoffs between synchronization, communication, and computation in parallel linear algebra computations. SPAA (2014)
Edgar Solomonik, Devin Matthews, Jeff R. Hammond, John F. Stanton, James Demmel
A massively parallel tensor contraction framework for coupled-cluster computations. J. Parallel Distributed Comput. 74 (12) (2014)
Michael B. Driscoll, Evangelos Georganas, Penporn Koanantakool, Edgar Solomonik, Katherine A. Yelick
A Communication-Optimal N-Body Algorithm for Direct Interactions. IPDPS (2013)
Edgar Solomonik, Aydin Buluç, James Demmel
Minimizing Communication in All-Pairs Shortest Paths. IPDPS (2013)
Edgar Solomonik, Devin Matthews, Jeff R. Hammond, James Demmel
Cyclops Tensor Framework: Reducing Communication and Eliminating Load Imbalance in Massively Parallel Contractions. IPDPS (2013)
Evangelos Georganas, Jorge González-Domínguez, Edgar Solomonik, Yili Zheng, Juan Touriño, Katherine A. Yelick
Communication avoiding and overlapping for numerical linear algebra. SC (2012)
Edgar Solomonik, James Demmel
Matrix Multiplication on Multidimensional Torus Networks. VECPAR (2012)
Edgar Solomonik, Abhinav Bhatele, James Demmel
Improving communication performance in dense linear algebra via topology aware collectives. SC (2011)
Edgar Solomonik, James Demmel
Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms. Euro-Par (2) (2011)
Edgar Solomonik, Laxmikant V. Kalé
Highly scalable parallel sorting. IPDPS (2010)
Abhinav Bhatele, Lukasz Wesolowski, Eric J. Bohm, Edgar Solomonik, Laxmikant V. Kalé
Understanding Application Performance via Micro-benchmarks on Three Large Supercomputers: Intrepid, Ranger and Jaguar. Int. J. High Perform. Comput. Appl. 24 (4) (2010)