Subtracting a best rank-1 approximation may increase tensor rank
By Alwin Stegeman, Pierre Comon. 2009
66 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Mathematics, Computational Mechanics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Anima Anandkumar
- Rong Ge
- Sham M. Kakade
- Daniel J. Hsu
- Yuanzhi Li
- Matus Telgarsky
- Tengyu Ma
- Michael I. Jordan
In Computational Mathematics
- Anima Anandkumar
- Rong Ge
- Daniel J. Hsu
- Sham M. Kakade
- Matus Telgarsky
- Yuanzhi Li
- Zehao Dou
- Alessandro Lazaric
In Computational Mechanics
- Rong Ge
- Sham M. Kakade
- Anima Anandkumar
- Daniel J. Hsu
- Matus Telgarsky
- Zeyuan Allen-Zhu
- Jason D. Lee
- Prateek Jain
Citations in the corpus
- A literature survey of low‐rank tensor approximation techniques (2013, neutral): “Of course, such a greedy approach will not yield the best rank-R approximation after R steps [241].”
- Tensor decompositions for learning latent variable models (2012, background): “In addition, removal of the best rank-1 approximation of a (general) tensor may increase the tensor rank of the residual (Stegeman and Comon, 2010).”