Anima Anandkumar
Anima Anandkumar
Verified email at caltech.edu
TitleCited byYear
Tensor decompositions for learning latent variable models
A Anandkumar, R Ge, D Hsu, SM Kakade, M Telgarsky
arXiv preprint arXiv:1210.7559 64, 70-72, 0
688*
A method of moments for mixture models and hidden Markov models
A Anandkumar, D Hsu, SM Kakade
Conference on Learning Theory, 33.1-33.34, 2012
2452012
A spectral algorithm for latent dirichlet allocation
A Anandkumar, DP Foster, DJ Hsu, SM Kakade, YK Liu
Advances in Neural Information Processing Systems, 917-925, 2012
2292012
Distributed algorithms for learning and cognitive medium access with logarithmic regret
A Anandkumar, N Michael, AK Tang, A Swami
IEEE Journal on Selected Areas in Communications 29 (4), 731-745, 2011
2152011
A tensor approach to learning mixed membership community models
A Anandkumar, R Ge, D Hsu, SM Kakade
The Journal of Machine Learning Research 15 (1), 2239-2312, 2014
1982014
Learning latent tree graphical models
MJ Choi, VYF Tan, A Anandkumar, AS Willsky
Journal of Machine Learning Research 12 (May), 1771-1812, 2011
1972011
Non-convex robust PCA
P Netrapalli, UN Niranjan, S Sanghavi, A Anandkumar, P Jain
Advances in Neural Information Processing Systems, 1107-1115, 2014
1872014
Opportunistic spectrum access with multiple users: Learning under competition
A Anandkumar, N Michael, A Tang
2010 Proceedings IEEE INFOCOM, 1-9, 2010
1642010
Beating the perils of non-convexity: Guaranteed training of neural networks using tensor methods
M Janzamin, H Sedghi, A Anandkumar
arXiv preprint arXiv:1506.08473, 2015
1502015
Learning sparsely used overcomplete dictionaries via alternating minimization
A Agarwal, A Anandkumar, P Jain, P Netrapalli
SIAM Journal on Optimization 26 (4), 2775-2799, 2016
1192016
High-dimensional structure estimation in Ising models: Local separation criterion
A Anandkumar, VYF Tan, F Huang, AS Willsky
The Annals of Statistics 40 (3), 1346-1375, 2012
104*2012
Stochastic activation pruning for robust adversarial defense
GS Dhillon, K Azizzadenesheli, ZC Lipton, J Bernstein, J Kossaifi, ...
arXiv preprint arXiv:1803.01442, 2018
892018
Efficient approaches for escaping higher order saddle points in non-convex optimization
A Anandkumar, R Ge
Conference on learning theory, 81-102, 2016
842016
Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank- Updates
A Anandkumar, R Ge, M Janzamin
arXiv preprint arXiv:1402.5180, 2014
782014
Learning sparsely used overcomplete dictionaries
A Agarwal, A Anandkumar, P Jain, P Netrapalli, R Tandon
Conference on Learning Theory, 123-137, 2014
772014
Two svds suffice: Spectral decompositions for probabilistic topic modeling and latent dirichlet allocation
A Anandkumar, SM Kakade, DP Foster, YK Liu, D Hsu
772012
Born again neural networks
T Furlanello, ZC Lipton, M Tschannen, L Itti, A Anandkumar
arXiv preprint arXiv:1805.04770, 2018
712018
High-dimensional Gaussian graphical model selection: Walk summability and local separation criterion
A Anandkumar, VYF Tan, F Huang, AS Willsky
Journal of Machine Learning Research 13 (Aug), 2293-2337, 2012
70*2012
Fast and guaranteed tensor decomposition via sketching
Y Wang, HY Tung, AJ Smola, A Anandkumar
Advances in Neural Information Processing Systems, 991-999, 2015
692015
Learning topic models and latent Bayesian networks under expansion constraints
A Anandkumar, D Hsu, A Javanmard, SM Kakade
arXiv preprint arXiv:1209.5350, 2012
57*2012
The system can't perform the operation now. Try again later.
Articles 1–20