1.1k citations · 7.8k across the 180 of their papers we have counts for
5 papers · 1 filter
Non-convex Robust PCA
Praneeth Netrapalli, U N Niranjan, Sujay Sanghavi +2
We propose a new method for robust PCA -- the task of recovering a low-rank matrix from sparse corruptions that are of unknown value and support. Our method involves alternating be…
Summary Based Structures with Improved Sublinear Recovery for Compressed Sensing
M. Amin Khajehnejad, Juhwan Yoo, Animashree Anandkumar +1
We introduce a new class of measurement matrices for compressed sensing, using low order summaries over binary sequences of a given length. We prove recovery guarantees for three r…
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshold…
Energy Scaling Laws for Distributed Inference in Random Fusion Networks
Animashree Anandkumar, Joseph E. Yukich, Lang Tong +1
The energy scaling laws of multihop data fusion networks for distributed inference are considered. The fusion network consists of randomly located sensors distributed i.i.d. accord…
Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency
Animashree Anandkumar, Lang Tong, Ananthram Swami
The problem of hypothesis testing against independence for a Gauss-Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the log-likelihoo…