activity
20122020
most citedBeating the Perils of Non-Convexity: Guaranteed Training of Neural Networks using Tensor Methods

132 citations · 344 across the 10 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

cs.LG2014★ 29 cited

Score Function Features for Discriminative Learning: Matrix and Tensor Framework

Majid Janzamin, Hanie Sedghi, Anima Anandkumar

Feature learning forms the cornerstone for tackling challenging learning problems in domains such as speech, computer vision and natural language processing. In this paper, we cons…

cs.LG2014

Score Function Features for Discriminative Learning

Majid Janzamin, Hanie Sedghi, Anima Anandkumar

Feature learning forms the cornerstone for tackling challenging learning problems in domains such as speech, computer vision and natural language processing. In this paper, we cons…

cs.LG2014★ 27 cited

Analyzing Tensor Power Method Dynamics in Overcomplete Regime

Anima Anandkumar, Rong Ge, Majid Janzamin

We present a novel analysis of the dynamics of tensor power iterations in the overcomplete regime where the tensor CP rank is larger than the input dimension. Finding the CP decomp…

cs.LG2014★ 18 cited

Sample Complexity Analysis for Learning Overcomplete Latent Variable Models through Tensor Methods

Animashree Anandkumar, Rong Ge, Majid Janzamin

We provide guarantees for learning latent variable models emphasizing on the overcomplete regime, where the dimensionality of the latent space can exceed the observed dimensionalit…

cs.LG2014★ 91 cited

Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank- Updates

Animashree Anandkumar, Rong Ge, Majid Janzamin

In this paper, we provide local and global convergence guarantees for recovering CP (Candecomp/Parafac) tensor decomposition. The main step of the proposed algorithm is a simple al…