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. 1402.5180
  4. Cited By
Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank-$1$
  Updates

Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank-111 Updates

21 February 2014
Anima Anandkumar
Rong Ge
Majid Janzamin
ArXivPDFHTML

Papers citing "Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank-$1$ Updates"

16 / 16 papers shown
Title
Lower Bounds for the Convergence of Tensor Power Iteration on Random Overcomplete Models
Lower Bounds for the Convergence of Tensor Power Iteration on Random Overcomplete Models
Yuchen Wu
Kangjie Zhou
94
6
0
07 Nov 2022
Understanding Alternating Minimization for Matrix Completion
Understanding Alternating Minimization for Matrix Completion
Moritz Hardt
71
258
0
03 Dec 2013
Smoothed Analysis of Tensor Decompositions
Smoothed Analysis of Tensor Decompositions
Aditya Bhaskara
Moses Charikar
Ankur Moitra
Aravindan Vijayaraghavan
104
154
0
14 Nov 2013
Nonparametric Estimation of Multi-View Latent Variable Models
Nonparametric Estimation of Multi-View Latent Variable Models
Le Song
Anima Anandkumar
Bo Dai
Bo Xie
43
44
0
13 Nov 2013
Learning Sparsely Used Overcomplete Dictionaries via Alternating
  Minimization
Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization
Alekh Agarwal
Anima Anandkumar
Prateek Jain
Praneeth Netrapalli
86
172
0
30 Oct 2013
Online Tensor Methods for Learning Latent Variable Models
Online Tensor Methods for Learning Latent Variable Models
Furong Huang
U. Niranjan
Mohammad Umar Hakeem
Anima Anandkumar
135
55
0
03 Sep 2013
New Algorithms for Learning Incoherent and Overcomplete Dictionaries
New Algorithms for Learning Incoherent and Overcomplete Dictionaries
Sanjeev Arora
Rong Ge
Ankur Moitra
60
205
0
28 Aug 2013
When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor
  Tucker Decompositions with Structured Sparsity
When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity
Anima Anandkumar
Daniel J. Hsu
Majid Janzamin
Sham Kakade
37
51
0
13 Aug 2013
Fourier PCA and Robust Tensor Decomposition
Fourier PCA and Robust Tensor Decomposition
Navin Goyal
Santosh Vempala
Ying Xiao
70
98
0
25 Jun 2013
Correlated random features for fast semi-supervised learning
Correlated random features for fast semi-supervised learning
Brian McWilliams
David Balduzzi
J. M. Buhmann
BDL
64
47
0
24 Jun 2013
Phase Retrieval using Alternating Minimization
Phase Retrieval using Alternating Minimization
Praneeth Netrapalli
Prateek Jain
Sujay Sanghavi
148
632
0
02 Jun 2013
Low-rank Matrix Completion using Alternating Minimization
Low-rank Matrix Completion using Alternating Minimization
Prateek Jain
Praneeth Netrapalli
Sujay Sanghavi
154
1,066
0
03 Dec 2012
Tensor decompositions for learning latent variable models
Tensor decompositions for learning latent variable models
Anima Anandkumar
Rong Ge
Daniel J. Hsu
Sham Kakade
Matus Telgarsky
273
1,142
0
29 Oct 2012
A concentration theorem for projections
A concentration theorem for projections
S. Dasgupta
Daniel J. Hsu
Nakul Verma
45
37
0
27 Jun 2012
Representation Learning: A Review and New Perspectives
Representation Learning: A Review and New Perspectives
Yoshua Bengio
Aaron Courville
Pascal Vincent
OOD
SSL
184
12,384
0
24 Jun 2012
A Method of Moments for Mixture Models and Hidden Markov Models
A Method of Moments for Mixture Models and Hidden Markov Models
Anima Anandkumar
Daniel J. Hsu
Sham Kakade
127
341
0
03 Mar 2012
1