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. 1708.07401
  4. Cited By
Communication Lower Bounds for Matricized Tensor Times Khatri-Rao
  Product
v1v2 (latest)

Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product

24 August 2017
Grey Ballard
Nicholas Knight
Kathryn Rouse
ArXiv (abs)PDFHTML

Papers citing "Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product"

15 / 15 papers shown
Title
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor
  Network
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network
Raghavendra Kanakagiri
Edgar Solomonik
54
6
0
11 Jul 2023
Communication Lower Bounds and Optimal Algorithms for Multiple
  Tensor-Times-Matrix Computation
Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation
Hussam Al Daas
Grey Ballard
L. Grigori
Suraj Kumar
Kathryn Rouse
30
4
0
21 Jul 2022
Deinsum: Practically I/O Optimal Multilinear Algebra
Deinsum: Practically I/O Optimal Multilinear Algebra
A. Ziogas
Grzegorz Kwa'sniewski
Tal Ben-Nun
Timo Schneider
Torsten Hoefler
96
5
0
16 Jun 2022
Tight Memory-Independent Parallel Matrix Multiplication Communication
  Lower Bounds
Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds
Hussam Al Daas
Grey Ballard
L. Grigori
Suraj Kumar
Kathryn Rouse
32
5
0
26 May 2022
Alternating Mahalanobis Distance Minimization for Stable and Accurate CP
  Decomposition
Alternating Mahalanobis Distance Minimization for Stable and Accurate CP Decomposition
Navjot Singh
Edgar Solomonik
57
0
0
14 Apr 2022
DISTAL: The Distributed Tensor Algebra Compiler
DISTAL: The Distributed Tensor Algebra Compiler
Rohan Yadav
A. Aiken
Fredrik Kjolstad
55
30
0
15 Mar 2022
Communication lower bounds for nested bilinear algorithms via rank
  expansion of Kronecker products
Communication lower bounds for nested bilinear algorithms via rank expansion of Kronecker products
Caleb Ju
Yifan Zhang
Edgar Solomonik
38
0
0
21 Jul 2021
Efficient parallel CP decomposition with pairwise perturbation and
  multi-sweep dimension tree
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree
Linjian Ma
Edgar Solomonik
65
8
0
22 Oct 2020
Comparison of Accuracy and Scalability of Gauss-Newton and Alternating
  Least Squares for CP Decomposition
Comparison of Accuracy and Scalability of Gauss-Newton and Alternating Least Squares for CP Decomposition
Navjot Singh
Linjian Ma
Hongru Yang
Edgar Solomonik
38
7
0
27 Oct 2019
Distributed-Memory Tensor Completion for Generalized Loss Functions in
  Python using New Sparse Tensor Kernels
Distributed-Memory Tensor Completion for Generalized Loss Functions in Python using New Sparse Tensor Kernels
Navjot Singh
Zecheng Zhang
Xiaoxia Wu
Naijing Zhang
Siyuan Zhang
Edgar Solomonik
51
15
0
06 Oct 2019
PLANC: Parallel Low Rank Approximation with Non-negativity Constraints
PLANC: Parallel Low Rank Approximation with Non-negativity Constraints
Srinivas Eswar
Koby Hayashi
Grey Ballard
R. Kannan
Michael A. Matheson
Haesun Park
63
10
0
30 Aug 2019
Stochastic Gradients for Large-Scale Tensor Decomposition
Stochastic Gradients for Large-Scale Tensor Decomposition
T. Kolda
David Hong
72
56
0
04 Jun 2019
Generalized Canonical Polyadic Tensor Decomposition
Generalized Canonical Polyadic Tensor Decomposition
David Hong
T. Kolda
J. Duersch
77
125
0
22 Aug 2018
Parallel Nonnegative CP Decomposition of Dense Tensors
Parallel Nonnegative CP Decomposition of Dense Tensors
Grey Ballard
Koby Hayashi
R. Kannan
127
24
0
19 Jun 2018
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor
  Contractions
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
Edgar Solomonik
J. Demmel
Torsten Hoefler
30
3
0
14 Jul 2017
1