Fetching the paper…
Reading the bibliography…
Kronecker regression is a highly-structured least squares problem $\min_{\mathbf{x}} \lVert \mathbf{K}\mathbf{x} - \mathbf{b} \rVert_{2}^2$, where the design matrix $\mathbf{K} = \mathbf{A}^{(1)} \otimes \cdots \otimes \mathbf{A}^{(N)}$ is a Kronecker product of factor matrices.
The generalised inverse
M James · 1978
Earlier work this paper cites.
Inconsistent systems of linear equations
M. Planitz · 1979
Earlier work this paper cites.
Extensions of lipschitz mappings into a Hilbert space
William B Johnson and Joram Lindenstrauss · 1984
Earlier work this paper cites.
Columbia object image library (coil-20)
Sameer A Nene, Shree K Nayar, Hiroshi Murase, et al · 1996
Earlier work this paper cites.
Iterative Methods for Sparse Linear Systems
Yousef Saad · 2003
Earlier work this paper cites.
An algorithmic theory of learning: Robust concepts and random projection
Rosa I Arriaga and Santosh Vempala · 2006
Earlier work this paper cites.
Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication
Petros Drineas, Ravi Kannan, and Michael W Mahoney · 2006
Earlier work this paper cites.
Tensor decompositions and applications
Tamara G. Kolda and Brett W. Bader · 2009
Earlier work this paper cites.
Scalable tensor factorizations for incomplete data
Evrim Acar, Daniel M Dunlavy, Tamara G Kolda, and Morten Mørup · 2011
Earlier work this paper cites.
Differentially private empirical risk minimization
Kamalika Chaudhuri, Claire Monteleoni, and Anand D Sarwate · 2011
Earlier work this paper cites.
Faster least squares approximation
Petros Drineas, Michael W. Mahoney, Shan Muthukrishnan, and Tamás Sarlós · 2011
Earlier work this paper cites.
Tensor completion for estimating missing values in visual data
Ji Liu, Przemyslaw Musialski, Peter Wonka, and Jieping Ye · 2012
Earlier work this paper cites.
Most tensor problems are NP-hard
Christopher J Hillar and Lek-Heng Lim · 2013
Earlier work this paper cites.
Low-rank matrix completion using alternating minimization
Prateek Jain, Praneeth Netrapalli, and Sujay Sanghavi · 2013
Earlier work this paper cites.
Iterative row sampling
Mu Li, Gary L Miller, and Richard Peng · 2013
Earlier work this paper cites.
Compressed matrix multiplication
Rasmus Pagh · 2013
Earlier work this paper cites.
On the kronecker products and their applications
Huamin Zhang and Feng Ding · 2013
Earlier work this paper cites.
Tensor regression with applications in neuroimaging data analysis
Hua Zhou, Lexin Li, and Hongtu Zhu · 2013
Earlier work this paper cites.
Provable tensor factorization with missing data
Prateek Jain and Sewoong Oh · 2014
Earlier work this paper cites.
Low-rank tensor completion by Riemannian optimization
Daniel Kressner, Michael Steinlechner, and Bart Vandereycken · 2014
Earlier work this paper cites.
Sketching as a Tool for Numerical Linear Algebra
David P. Woodruff · 2014
Earlier work this paper cites.
Decomposition of big tensors with low multilinear rank
Guoxu Zhou, Andrzej Cichocki, and Shengli Xie · 2014
Earlier work this paper cites.
Fast randomized kernel ridge regression with statistical guarantees
Ahmed Alaoui and Michael W. Mahoney · 2015
Earlier work this paper cites.
Uniform sampling for matrix approximation
Michael B Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford · 2015
Cited alongside, same era.
Tucker factorization with missing data with application to low- n n -rank tensor completion
Marko Filipović and Ante Jukić · 2015
Cited alongside, same era.
Variants of alternating least squares tensor completion in the tensor train format
Lars Grasedyck, Melanie Kluge, and Sebastian Kramer · 2015
Cited alongside, same era.
Differentially private matrix factorization using sketching techniques
Raghavendran Balu and Teddy Furon · 2016
Cited alongside, same era.
SPALS: Fast alternating least squares via implicit leverage scores sampling
Dehua Cheng, Richard Peng, Yan Liu, and Ioakeim Perros · 2016
Cited alongside, same era.
Low-rank tensor completion: a Riemannian manifold preconditioning approach
Optimal sketching for Kronecker product regression and low rank approximation
Huaian Diao, Rajesh Jayaram, Zhao Song, Wen Sun, and David Woodruff · 2019
Later among the works it cites.
Tensorly: Tensor learning in Python
Jean Kossaifi, Yannis Panagakis, Anima Anandkumar, and Maja Pantic · 2019
Later among the works it cites.
Towards a unified analysis of random Fourier features
Zhu Li, Jean-Francois Ton, Dino Oglic, and Dino Sejdinovic · 2019
Later among the works it cites.
Least squares problems involving generalized kronecker products and application to bivariate polynomial regression
Ana Marco, José-Javier Martínez, and Raquel Viaña · 2019
Later among the works it cites.
Relative error tensor low rank approximation
Zhao Song, David P Woodruff, and Peilin Zhong · 2019
Later among the works it cites.
Singleshot: A scalable Tucker tensor decomposition
Abraham Traore, Maxime Berar, and Alain Rakotomamonjy · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hiroyuki Kasai and Bamdev Mishra · 2016
Cited alongside, same era.
Spatial distributions of local illumination color in natural scenes
Sérgio MC Nascimento, Kinjiro Amano, and David H Foster · 2016
Cited alongside, same era.
Learning from multiway data: Simple and efficient tensor regression
Rose Yu and Yan Liu · 2016
Cited alongside, same era.
Sharper bounds for regularized data fitting
Haim Avron, Kenneth L. Clarkson, and David P. Woodruff · 2017
Cited alongside, same era.
Input sparsity time low-rank approximation via ridge leverage score sampling
Michael B Cohen, Cameron Musco, and Christopher Musco · 2017
Cited alongside, same era.
Recursive sampling for the Nyström method
Cameron Musco and Christopher Musco · 2017
Cited alongside, same era.
Introduction to tensor decompositions and their applications in machine learning
Stephan Rabanser, Oleksandr Shchur, and Stephan Günnemann · 2017
Cited alongside, same era.
Later among the works it cites.
Dynamic approximate shortest paths and beyond: Subquadratic and worst-case update time
Jan van den Brand and Danupon Nanongkai · 2019
Later among the works it cites.
Optimization landscape of Tucker decomposition
Abraham Frandsen and Rong Ge · 2020
Later among the works it cites.
Array programming with NumPy
Charles R. Harris, K. Jarrod Millman, Stéfan J. van der Walt, Ralf Gommers, Pauli Virtanen, David Cournapeau, Eric Wieser, Julian Taylor, Sebastian Berg, Nathaniel J. Smith, Robert Kern, Matti Picus, Stephan Hoyer, Marten H. van Kerkwijk, Matthew Brett, Allan Haldane, Jaime Fernández del Río, Mark Wiebe, Pearu Peterson, Pierre Gérard-Marchant, Kevin Sheppard, Tyler Reddy, Warren Weckesser, Hameer Abbasi, Christoph Gohlke, and Travis E. Oliphant · 2020
Later among the works it cites.
Adaptive tensor learning with tensor networks
Meraj Hashemizadeh, Michelle Liu, Jacob Miller, and Guillaume Rabusseau · 2020
Later among the works it cites.
Tensor completion made practical
Allen Liu and Ankur Moitra · 2020
Later among the works it cites.
Low-rank Tucker approximation of a tensor from streaming data
Yiming Sun, Yang Guo, Charlene Luo, Joel Tropp, and Madeleine Udell · 2020
Later among the works it cites.
Randomized algorithms for computation of Tucker decomposition and higher order SVD (HOSVD)
Salman Ahmadi-Asl, Stanislav Abukhovich, Maame G Asante-Mensah, Andrzej Cichocki, Anh Huy Phan, Tohishisa Tanaka, and Ivan Oseledets · 2021
Later among the works it cites.
A refined laser method and faster matrix multiplication
Josh Alman and Virginia Vassilevska Williams · 2021
Later among the works it cites.
Tensor toolbox for MATLAB, version 3.2.1
Brett W. Bader and Tamara G. Kolda · 2021
Later among the works it cites.
Adaptive hierarchical subtensor partitioning for tensor compression
Virginie Ehrlacher, Laura Grigori, Damiano Lombardi, and Hao Song · 2021
Later among the works it cites.
Fast low-rank tensor decomposition by ridge leverage score sampling
Matthew Fahrbach, Mehrdad Ghadiri, and Thomas Fu · 2021
Later among the works it cites.
Fast and memory-efficient tucker decomposition for answering diverse time range queries
Jun-Gi Jang and U Kang · 2021
Later among the works it cites.
Fast and accurate randomized algorithms for low-rank tensor decompositions
Linjian Ma and Edgar Solomonik · 2021
Later among the works it cites.
A sampling-based method for tensor ring decomposition
Osman Asif Malik and Stephen Becker · 2021
Later among the works it cites.
A rank-adaptive higher-order orthogonal iteration algorithm for truncated Tucker decomposition
Chuanfu Xiao and Chao Yang · 2021
Later among the works it cites.
Sketching algorithms and lower bounds for ridge regression
Praneeth Kacham and David Woodruff · 2022
Closest in time.
Dynamic tensor product regression
Aravind Reddy, Zhao Song, and Lichen Zhang · 2022
Closest in time.