Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1708.07401
Cited By
Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product
24 August 2017
Grey Ballard
Nicholas Knight
Kathryn Rouse
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product"
8 / 8 papers shown
Title
Alternating Mahalanobis Distance Minimization for Stable and Accurate CP Decomposition
Navjot Singh
Edgar Solomonik
11
0
0
14 Apr 2022
DISTAL: The Distributed Tensor Algebra Compiler
Rohan Yadav
A. Aiken
Fredrik Kjolstad
11
29
0
15 Mar 2022
Communication lower bounds for nested bilinear algorithms via rank expansion of Kronecker products
Caleb Ju
Yifan Zhang
Edgar Solomonik
21
0
0
21 Jul 2021
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree
Linjian Ma
Edgar Solomonik
8
8
0
22 Oct 2020
Stochastic Gradients for Large-Scale Tensor Decomposition
T. Kolda
David Hong
21
55
0
04 Jun 2019
Generalized Canonical Polyadic Tensor Decomposition
David Hong
T. Kolda
J. Duersch
12
123
0
22 Aug 2018
Parallel Nonnegative CP Decomposition of Dense Tensors
Grey Ballard
Koby Hayashi
R. Kannan
13
24
0
19 Jun 2018
Tensor Decomposition for Signal Processing and Machine Learning
N. Sidiropoulos
L. De Lathauwer
Xiao Fu
Kejun Huang
Evangelos E. Papalexakis
Christos Faloutsos
105
1,342
0
06 Jul 2016
1