Fetching the paper…
Reading the bibliography…
We consider relative error low rank approximation of $tensors$ with respect to the Frobenius norm: given an order-$q$ tensor $A \in \mathbb{R}^{\prod_{i=1}^q n_i}$, output a rank-$k$ tensor $B$ for which $\|A-B\|_F^2 \leq (1+\epsilon)$OPT, where OPT $= \inf_{\textrm{rank-}k~A'} \|A-A'\|_F^2$.
Über homogene polynome in ( l 2 l^{2} )
Stefan Banach · 1938
Earlier work this paper cites.
Some results on convex bodies and banach spaces
AP Dvoredsky · 1961
Earlier work this paper cites.
Gaussian elimination is not optimal
Volker Strassen · 1969
Earlier work this paper cites.
Anaylsis of individual differences in multidimensional scaling via an n-way generalization of eckart-young decomposition
J Douglas Carroll and Jih-Jie Chang · 1970
Earlier work this paper cites.
Foundations of the parafac procedure: Models and conditions for an “explanatory” multi-modal factor analysis
Richard A Harshman · 1970
Earlier work this paper cites.
Some simplified np-complete graph problems
Michael R Garey, David S. Johnson, and Larry Stockmeyer · 1976
Earlier work this paper cites.
Border rank of a p × \times q × \times 2 tensor and the optimal approximation of a pair of bilinear forms
Dario Bini · 1980
Earlier work this paper cites.
Three-mode principal component analysis: Theory and applications
Pieter M Kroonenberg · 1983
Earlier work this paper cites.
Border rank of m × \times n × \times (mn-q) tensors
Dario Bini · 1986
Earlier work this paper cites.
Matrix multiplication via arithmetic progressions
Don Coppersmith and Shmuel Winograd · 1987
Earlier work this paper cites.
How 3-mfa data can cause degenerate parafac solutions, among other relationships
JB Kruskal, RA Harshman, and ME Lundy · 1989
Earlier work this paper cites.
Tensor rank is np-complete
Johan Håstad · 1990
Earlier work this paper cites.
On the computational complexity and geometry of the first-order theory of the reals, part I: introduction. preliminaries. the geometry of semi-algebraic sets. the decision problem for the existential theory of the reals
James Renegar · 1992
Earlier work this paper cites.
On the computational complexity and geometry of the first-order theory of the reals, part II: the general decision problem. preliminaries for quantifier elimination
James Renegar · 1992
Earlier work this paper cites.
A tensor framework for multidimensional signal processing
Carl-Fredrik Westin · 1994
Earlier work this paper cites.
On the combinatorial and algebraic complexity of quantifier elimination
Saugata Basu, Richard Pollack, and Marie-Françoise Roy · 1996
Earlier work this paper cites.
Algebraic complexity theory
Peter Bürgisser, Michael Clausen, and Amin Shokrollahi · 1997
Earlier work this paper cites.
P= BPP if E requires exponential circuits: Derandomizing the XOR lemma
Russell Impagliazzo and Avi Wigderson · 1997
Earlier work this paper cites.
A weighted non-negative least squares algorithm for three-way “parafac” factor analysis
Pentti Paatero · 1997
Earlier work this paper cites.
From matrix to tensor: Multilinear algebra and signal processing
Lieven De Lathauwer and Bart De Moor · 1998
Earlier work this paper cites.
Which problems have strongly exponential complexity?
Russell Impagliazzo, Ramamohan Paturi, and Francis Zane · 1998
Earlier work this paper cites.
The art of computer programming, vol. 2 : seminumerical algorithms, 1998
Donald E. Knuth · 1998
Earlier work this paper cites.
Tensor-based trapdoors for cvp and their application to public key cryptography
Roger Fischlin and Jean-Pierre Seifert · 1999
Earlier work this paper cites.
A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures
Françoise Tisseur and Jack Dongarra · 1999
Earlier work this paper cites.
On bounded occurrence constraint satisfaction
Johan Håstad · 2000
Earlier work this paper cites.
A multilinear singular value decomposition
Lieven De Lathauwer, Bart De Moor, and Joos Vandewalle · 2000
Earlier work this paper cites.
On the best rank-1 and rank-( R 1 , R 2 , ⋯ , R n {R}_{1},{R}_{2},\cdots,{R}_{n} ) approximation of higher-order tensors
Lieven De Lathauwer, Bart De Moor, and Joos Vandewalle · 2000
Earlier work this paper cites.
Construction and analysis of degenerate parafac models
Pentti Paatero · 2000
Earlier work this paper cites.
Some optimal inapproximability results
Johan Håstad · 2001
Earlier work this paper cites.
Non-approximability results for optimization problems on bounded degree instances
Luca Trevisan · 2001
Earlier work this paper cites.
Dealing with missing data: Part i
B. Walczak and DL Massart · 2001
Earlier work this paper cites.
Rank-one approximation to high order tensors
Tong Zhang and Gene H. Golub · 2001
Earlier work this paper cites.
Relations between average case complexity and approximation complexity
Uriel Feige · 2002
Earlier work this paper cites.
Principal component analysis for dimension reduction in massive distributed data sets
Yongming Qu, George Ostrouchov, Nagiza Samatova, and Al Geist · 2002
Earlier work this paper cites.
Multilinear analysis of image ensembles: Tensorfaces
M Alex O Vasilescu and Demetri Terzopoulos · 2002
Earlier work this paper cites.
Random walk in a simplex and quadratic optimization over convex polytopes
Yurii Nesterov et al · 2003
Earlier work this paper cites.
Facial expression decomposition
Hongcheng Wang and Narendra Ahuja · 2003
Earlier work this paper cites.
Fast monte-carlo algorithms for finding low-rank approximations
Alan M. Frieze, Ravi Kannan, and Santosh Vempala · 2004
Earlier work this paper cites.
An approximation hardness result for bipartite clique
Andreas Goerdt and André Lanka · 2004
Earlier work this paper cites.
Multi-way Analysis with Applications in the Chemical Sciences
Age K. Smilde, Rasmus Bro, and Paul Geladi · 2004
Earlier work this paper cites.
Tensortextures: Multilinear image-based rendering
M Alex O Vasilescu and Demetri Terzopoulos · 2004
Earlier work this paper cites.
Modeling and multiway analysis of chatroom tensors
Evrim Acar, Seyit A Çamtepe, Mukkai S Krishnamoorthy, and Bülent Yener · 2005
Earlier work this paper cites.
Principal component analysis for distributed data sets with updating
Zheng-Jian Bai, Raymond H Chan, and Franklin T Luk · 2005
Earlier work this paper cites.
Subgradient and sampling algorithms for ℓ 1 \ell_{1} regression
Kenneth L Clarkson · 2005
Earlier work this paper cites.
Sparse image coding using a 3d non-negative tensor factorization
Tamir Hazan, Simon Polak, and Amnon Shashua · 2005
Earlier work this paper cites.
Learning nonsingular phylogenies and hidden markov models
Elchanan Mossel and Sébastien Roch · 2005
Earlier work this paper cites.
Non-negative tensor factorization with applications to statistics and computer vision
Amnon Shashua and Tamir Hazan · 2005
Earlier work this paper cites.
Out-of-core tensor approximation of multi-dimensional matrices of visual data
Hongcheng Wang, Qing Wu, Lin Shi, Yizhou Yu, and Narendra Ahuja · 2005
Earlier work this paper cites.
Collective sampling and analysis of high order tensors for chatroom communications
Evrim Acar, Seyit A Camtepe, and Bülent Yener · 2006
Earlier work this paper cites.
Subspace sampling and relative-error matrix approximation: Column-based methods
Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan · 2006
Earlier work this paper cites.
Subspace sampling and relative-error matrix approximation: Column-row-based methods
Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan · 2006
Earlier work this paper cites.
Adaptive sampling and fast low-rank matrix approximation
Amit Deshpande and Santosh Vempala · 2006
Earlier work this paper cites.
The tophits model for higher-order web link analysis
Tamara Kolda and Brett Bader · 2006
Earlier work this paper cites.
The border rank of the multiplication of 2 × \times 2 matrices is seven
J Landsberg · 2006
Earlier work this paper cites.
Improved approximation algorithms for large matrices via random projections
Tamás Sarlós · 2006
Earlier work this paper cites.
Degeneracy in candecomp/parafac explained for p × \times p × \times 2 arrays of rank p+1 or higher
Alwin Stegeman · 2006
Earlier work this paper cites.
Multiway analysis of epilepsy tensors
Evrim Acar, Canan Aykut-Bingöl, Haluk Bingol, Rasmus Bro, and Bülent Yener · 2007
Earlier work this paper cites.
Fast computation of low-rank matrix approximations
Dimitris Achlioptas and Frank McSherry · 2007
Earlier work this paper cites.
Sampling-based dimension reduction for subspace approximation
Amit Deshpande and Kasturi R. Varadarajan · 2007
Earlier work this paper cites.
Bi-criteria linear-time approximations for generalized k-mean/median/center
Dan Feldman, Amos Fiat, Micha Sharir, and Danny Segev · 2007
Earlier work this paper cites.
Generalized rank-constrained matrix approximations
Shmuel Friedland and Anatoli Torokhti · 2007
Earlier work this paper cites.
Nonnegative tucker decomposition
Yong-Deok Kim and Seungjin Choi · 2007
Earlier work this paper cites.
Distributed principal component analysis for wireless sensor networks
Yann-Ael Le Borgne, Sylvain Raybaud, and Gianluca Bontempi · 2008
Earlier work this paper cites.
Relative-error CUR matrix decompositions
Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan · 2008
Earlier work this paper cites.
Tensor rank and the ill-posedness of the best low-rank approximation problem
Vin De Silva and Lek-Heng Lim · 2008
Earlier work this paper cites.
Robust tensor factorization using r 1 norm
Heng Huang and Chris Ding · 2008
Earlier work this paper cites.
On the non-existence of optimal solutions and the occurrence of “degeneracy” in the candecomp/parafac model
Wim P Krijnen, Theo K Dijkstra, and Alwin Stegeman · 2008
Earlier work this paper cites.
Scalable tensor decompositions for multi-aspect data mining
Tamara G Kolda and Jimeng Sun · 2008
Earlier work this paper cites.
Tensor-cur decompositions for tensor-based data
Michael W Mahoney, Mauro Maggioni, and Petros Drineas · 2008
Earlier work this paper cites.
Tucker dimensionality reduction of three-dimensional arrays in linear time
Ivan V Oseledets, DV Savostianov, and Eugene E Tyrtyshnikov · 2008
Earlier work this paper cites.
Fast and efficient algorithms for nonnegative tucker decomposition
Anh Phan and Andrzej Cichocki · 2008
Earlier work this paper cites.
Low-rank approximation of generic p × \times q × \times 2 arrays and diverging components in the candecomp/parafac model
Alwin Stegeman · 2008
Earlier work this paper cites.
Tensors in image processing and computer vision
Santiago Aja-Fernández, Rodrigo de Luis Garcia, Dacheng Tao, and Xuelong Li · 2009
Earlier work this paper cites.
An improved approximation algorithm for the column subset selection problem
Christos Boutsidis, Michael W Mahoney, and Petros Drineas · 2009
Earlier work this paper cites.
Tensor Decompositions, State of the Art and Applications
P. Comon · 2009
Earlier work this paper cites.
Numerical linear algebra in the streaming model
Kenneth L. Clarkson and David P. Woodruff · 2009
Earlier work this paper cites.
Sampling algorithms and coresets for ℓ p \ell_{p} regression
Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, and Michael W Mahoney · 2009
Cited alongside, same era.
A newton-grassmann method for computing the best multilinear rank-(r1,r2,r3) approximation of a tensor
Lars Eldén and Berkant Savas · 2009
Cited alongside, same era.
Tensor decompositions and applications
Tamara G. Kolda and Brett W. Bader · 2009
Cited alongside, same era.
Sparse coding and automatic relevance determination for multi-way models
Morten Mørup and Lars Kai Hansen · 2009
Cited alongside, same era.
Breaking the curse of dimensionality, or how to use svd in many dimensions
Ivan V Oseledets and Eugene E Tyrtyshnikov · 2009
Cited alongside, same era.
Smallest singular value of a random rectangular matrix
Mark Rudelson and Roman Vershynin · 2009
Square deal: Lower bounds and improved relaxations for tensor recovery
Cun Mu, Bo Huang, John Wright, and Donald Goldfarb · 2014
Later among the works it cites.
Algorithmic Aspects of Machine Learning
Ankur Moitra · 2014
Later among the works it cites.
Personal communication
Jelani Nelson and David P. Woodruff · 2014
Later among the works it cites.
Learning mixed multinomial logit model from ordinal data
Sewoong Oh and Devavrat Shah · 2014
Later among the works it cites.
A statistical model for tensor pca
Emile Richard and Andrea Montanari · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A multilinear (tensor) algebraic framework for computer graphics, computer vision, and machine learning
M Alex O Vasilescu · 2009
Cited alongside, same era.
Scalable Tensor Factorizations for Incomplete Data
E. Acar, T. G. Kolda, D. M. Dunlavy, and M. Morup · 2010
Cited alongside, same era.
Generalizing the column–row matrix decomposition to multi-way arrays
Cesar F Caiafa and Andrzej Cichocki · 2010
Cited alongside, same era.
Efficient volume sampling for row/column subset selection
Amit Deshpande and Luis Rademacher · 2010
Cited alongside, same era.
Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering
Alexandros Karatzoglou, Xavier Amatriain, Linas Baltrunas, and Nuria Oliver · 2010
Cited alongside, same era.
Consensus-based distributed principal component analysis in wireless sensor networks
Sergio V Macua, Pavle Belanovic, and Santiago Zazo · 2010
Cited alongside, same era.
Marco Signoretto, Dinh Quoc Tran, Lieven De Lathauwer, and Johan A. K. Suykens · 2014
Later among the works it cites.
Sketching as a tool for numerical linear algebra
David P. Woodruff · 2014
Later among the works it cites.
Multilinear tensor rank estimation via sparse tucker decomposition
Tatsuya Yokota and Andrzej Cichocki · 2014
Later among the works it cites.
Spectral methods meet em: A provably optimal algorithm for crowdsourcing
Yuchen Zhang, Xi Chen, Denny Zhou, and Michael I Jordan · 2014
Later among the works it cites.
Dictionary learning and tensor decomposition via the sum-of-squares method
Boaz Barak, Jonathan A Kelner, and David Steurer · 2015
Later among the works it cites.
A distributed frank-wolfe algorithm for communication-efficient sparse learning
Aurélien Bellet, Yingyu Liang, Alireza Bagheri Garakani, Maria-Florina Balcan, and Fei Sha · 2015
Later among the works it cites.
Matrix and tensor factorization methods for natural language processing
Guillaume Bouchard, Jason Naradowsky, Sebastian Riedel, Tim Rocktäschel, and Andreas Vlachos · 2015
Later among the works it cites.
A new sampling technique for tensors
Srinadh Bhojanapalli and Sujay Sanghavi · 2015
Later among the works it cites.
Dimensionality reduction for k-means clustering and low rank approximation
Michael B Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Madalina Persu · 2015
Later among the works it cites.
Tensor decomposition of eeg signals: a brief review
Fengyu Cong, Qiu-Hua Lin, Li-Dan Kuang, Xiao-Feng Gong, Piia Astikainen, and Tapani Ristaniemi · 2015
Later among the works it cites.
Uniform sampling for matrix approximation
Michael B Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford · 2015
Later among the works it cites.
Tensor decompositions for signal processing applications: From two-way to multiway component analysis
Andrzej Cichocki, Danilo Mandic, Lieven De Lathauwer, Guoxu Zhou, Qibin Zhao, Cesar Caiafa, and Huy Anh Phan · 2015
Later among the works it cites.
Optimal approximate matrix product in terms of stable rank
Michael B Cohen, Jelani Nelson, and David P Woodruff · 2015
Later among the works it cites.
ℓ p \ell_{p} row sampling by lewis weights
Michael B. Cohen and Richard Peng · 2015
Later among the works it cites.
Fastmotif: spectral sequence motif discovery
Nicoló Colombo and Nikos Vlassis · 2015
Later among the works it cites.
Input sparsity and hardness for robust subspace approximation
Kenneth L Clarkson and David P Woodruff · 2015
Later among the works it cites.
Sketching for m-estimators: A unified approach to robust regression
Kenneth L Clarkson and David P Woodruff · 2015
Later among the works it cites.
Low-rank approximation of tensors
Shmuel Friedland and Venu Tammali · 2015
Later among the works it cites.
Learning mixtures of gaussians in high dimensions
Rong Ge, Qingqing Huang, and Sham M Kakade · 2015
Later among the works it cites.
Decomposing overcomplete 3rd order tensors using sum-of-squares algorithms
Rong Ge and Tengyu Ma · 2015
Later among the works it cites.
Tensor principal component analysis via sum-of-square proofs
Samuel B Hopkins, Jonathan Shi, and David Steurer · 2015
Later among the works it cites.
Tensor principal component analysis via convex optimization
Bo Jiang, Shiqian Ma, and Shuzhong Zhang · 2015
Later among the works it cites.
Beating the perils of non-convexity: Guaranteed training of neural networks using tensor methods
Majid Janzamin, Hanie Sedghi, and Anima Anandkumar · 2015
Later among the works it cites.
Secure tensor decomposition using fully homomorphic encryption scheme
Liwei Kuang, Laurence Yang, Jun Feng, and Mianxiong Dong · 2015
Later among the works it cites.
High-order low-rank tensors for semantic role labeling
Tao Lei, Yuan Zhang, Alessandro Moschitti, and Regina Barzilay · 2015
Later among the works it cites.
Successive rank-one approximations for nearly orthogonally decomposable symmetric tensors
Cun Mu, Daniel Hsu, and Donald Goldfarb · 2015
Later among the works it cites.
A bi-criteria approximation algorithm for k k means
Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, and Justin Ward · 2015
Later among the works it cites.
Rethinking lda: moment matching for discrete ica
Anastasia Podosinnikova, Francis Bach, and Simon Lacoste-Julien · 2015
Later among the works it cites.
Spectacle: fast chromatin state annotation using spectral learning
Jimin Song and Kevin C Chen · 2015
Later among the works it cites.
Column subset selection with missing data via active sampling
Yining Wang and Aarti Singh · 2015
Later among the works it cites.
Fast and guaranteed tensor decomposition via sketching
Yining Wang, Hsiao-Yu Tung, Alexander J Smola, and Anima Anandkumar · 2015
Later among the works it cites.
Greedy column subset selection: New bounds and distributed algorithms
Jason Altschuler, Aditya Bhaskara, Gang Fu, Vahab Mirrokni, Afshin Rostamizadeh, and Morteza Zadimoghaddam · 2016
Later among the works it cites.
Homotopy analysis for tensor pca
Anima Anandkumar, Yuan Deng, Rong Ge, and Hossein Mobahi · 2016
Later among the works it cites.
Provable learning of noisy-or networks
Sanjeev Arora, Rong Ge, Tengyu Ma, and Andrej Risteski · 2016
Later among the works it cites.
Reinforcement learning of POMDPs using spectral methods
Kamyar Azizzadenesheli, Alessandro Lazaric, and Animashree Anandkumar · 2016
Later among the works it cites.
Bptree: an ℓ 2 \ell_{2} heavy hitters algorithm using constant memory
Vladimir Braverman, Stephen R Chestnut, Nikita Ivkin, Jelani Nelson, Zhengyu Wang, and David P Woodruff · 2016
Later among the works it cites.
Beating countsketch for heavy hitters in insertion streams
Vladimir Braverman, Stephen R Chestnut, Nikita Ivkin, and David P Woodruff · 2016
Later among the works it cites.
Sketches for matrix norms: Faster, smaller and more general
Vladimir Braverman, Stephen R Chestnut, Robert Krauthgamer, and Lin F Yang · 2016
Later among the works it cites.
Computing approximate PSD factorizations
Amitabh Basu, Michael Dinitz, and Xin Li · 2016
Later among the works it cites.
Communication efficient distributed kernel principal component analysis
Maria-Florina Balcan, Yingyu Liang, Le Song, David Woodruff, and Bo Xie · 2016
Later among the works it cites.
Noisy tensor completion via the sum-of-squares hierarchy
Boaz Barak and Ankur Moitra · 2016
Later among the works it cites.
Optimal principal component analysis in distributed and streaming models
Christos Boutsidis, David P Woodruff, and Peilin Zhong · 2016
Later among the works it cites.
Fourier-sparse interpolation without a frequency gap
Xue Chen, Daniel M. Kane, Eric Price, and Zhao Song · 2016
Later among the works it cites.
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
Samuel B Hopkins, Tselil Schramm, Jonathan Shi, and David Steurer · 2016
Later among the works it cites.
Greedy bi-criteria approximations for k k -medians and k k -means
Daniel Hsu and Matus Telgarsky · 2016
Later among the works it cites.
Tensor robust principal component analysis: Exact recovery of corrupted low-rank tensors via convex optimization
Canyi Lu, Jiashi Feng, Yudong Chen, Wei Liu, Zhouchen Lin, and Shuicheng Yan · 2016
Later among the works it cites.
Heavy hitters via cluster-preserving clustering
Kasper Green Larsen, Jelani Nelson, Huy L Nguyen, and Mikkel Thorup · 2016
Later among the works it cites.
Polynomial-time tensor decompositions with sum-of-squares
Tengyu Ma, Jonathan Shi, and David Steurer · 2016
Later among the works it cites.
Efficient tensor completion: Low-rank tensor train
Ho N Phien, Hoang D Tuan, Johann A Bengua, and Minh N Do · 2016
Later among the works it cites.
The search problem in mixture models
Avik Ray, Joe Neeman, Sujay Sanghavi, and Sanjay Shakkottai · 2016
Later among the works it cites.
Weighted low rank approximations with provable guarantees
Ilya Razenshteyn, Zhao Song, and David P Woodruff · 2016
Later among the works it cites.
Newtonian program analysis via tensor product
Thomas Reps, Emma Turetsky, and Prathmesh Prabhu · 2016
Later among the works it cites.
Key exchange protocol based on tensor decomposition problem
Mao Shaowu, Zhang Huanguo, Wu Wanqing, Zhang Pei, Song Jun, and Liu Jinhui · 2016
Later among the works it cites.
Sublinear time orthogonal tensor decomposition
Zhao Song, David P. Woodruff, and Huan Zhang · 2016
Later among the works it cites.
Online and differentially-private tensor decomposition
Yining Wang and Animashree Anandkumar · 2016
Later among the works it cites.
Distributed low rank approximation of implicit functions of a matrix
David P Woodruff and Peilin Zhong · 2016
Later among the works it cites.
Weighted sgd for ℓ p \ell_{p} regression with randomized preconditioning
Jiyan Yang, Yin-Lam Chow, Christopher Ré, and Michael W Mahoney · 2016
Later among the works it cites.
Xinyang Yi, Constantine Caramanis, and Sujay Sanghavi · 2016
Later among the works it cites.
Robust low-rank tensor recovery with regularized redescending m-estimator
Yuning Yang, Yunlong Feng, and Johan AK Suykens · 2016
Later among the works it cites.
Subspace methods with local refinements for eigenvalue computation using low-rank tensor-train format
Junyu Zhang, Zaiwen Wen, and Yin Zhang · 2016
Later among the works it cites.
General and robust communication-efficient algorithms for distributed clustering
Pranjal Awasthi, Maria-Florina Balcan, and Colin White · 2017
Closest in time.
Streaming symmetric norms via measure concentration
Jaroslaw Blasiok, Vladimir Braverman, Stephen R Chestnut, Robert Krauthgamer, and Lin F Yang · 2017
Closest in time.
Iterative block tensor singular value thresholding for extraction of low rank component of image data
Longxi Chen, Yipeng Liu, and Ce Zhu · 2017
Closest in time.
Kronecker product and spline regression
Huaian Diao and David P. Woodruff · 2017
Closest in time.
Exact tensor completion with sum-of-squares
Aaron Potechin and David Steurer · 2017
Closest in time.
Fast and robust tensor decomposition with applications to dictionary learning
Tselil Schramm and David Steurer · 2017
Closest in time.
Low rank approximation with entrywise ℓ 1 \ell_{1} -norm error
Zhao Song, David P Woodruff, and Peilin Zhong · 2017
Closest in time.
Fast monte carlo algorithms for tensor operations
Davoud Ataee Tarzanagh and George Michailidis · 2017
Closest in time.
Recovery guarantees for one-hidden-layer neural networks
Kai Zhong, Zhao Song, Prateek Jain, Peter L. Bartlett, and Inderjit S. Dhillon · 2017
Closest in time.
Guaranteed tensor pca with optimality in statistics and computation
Anru Zhang and Dong Xia · 2017
Closest in time.