274 citations · 3.1k across the 75 of their papers we have counts for
6 papers · 1 filter
Competing with the Empirical Risk Minimizer in a Single Pass
Roy Frostig, Rong Ge, Sham M. Kakade +1
In many estimation problems, e.g. linear and logistic regression, we wish to minimize an unknown objective given only unbiased samples of the objective function. Furthermore, we ai…
Minimal Realization Problems for Hidden Markov Models
Qingqing Huang, Rong Ge, Sham Kakade +1
Consider a stationary discrete random process with alphabet size d, which is assumed to be the output process of an unknown stationary Hidden Markov Model (HMM). Given the joint pr…
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…
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…
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…
More Algorithms for Provable Dictionary Learning
Sanjeev Arora, Aditya Bhaskara, Rong Ge +1
In dictionary learning, also known as sparse coding, the algorithm is given samples of the form where is an unknown random sparse vector and is an…