The following pages link to Animashree Anandkumar (Q355076):
Displayed 22 items.
- Learning loopy graphical models with latent variables: efficient methods and guarantees (Q355078) (← links)
- High-dimensional structure estimation in Ising models: local separation criterion (Q693728) (← links)
- When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity (Q2788378) (← links)
- (Q2788386) (← links)
- Topology discovery of sparse random graphs with few participants (Q2844081) (← links)
- High-Dimensional Covariance Decomposition into Sparse Markov and Independence Models (Q2934033) (← links)
- (Q2934062) (← links)
- Tensor decompositions for learning latent variable models (Q2934101) (← links)
- A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries (Q2979124) (← links)
- Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization (Q3179269) (← links)
- Distributed Estimation Via Random Access (Q3604443) (← links)
- Type-Based Random Access for Distributed Detection Over Multiaccess Fading Channels (Q4567489) (← links)
- Optimal Node Density for Detection in Energy-Constrained Random Networks (Q4569160) (← links)
- Learning Gaussian Tree Models: Analysis of Error Exponents and Extremal Structures (Q4570256) (← links)
- Active Learning of Multiple Source Multiple Destination Topologies (Q4579124) (← links)
- Detection of Gauss–Markov Random Fields With Nearest-Neighbor Dependency (Q4975737) (← links)
- A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures (Q5281051) (← links)
- (Q5361285) (← links)
- (Q5396653) (← links)
- Learning Latent Tree Graphical Models (Q5396658) (← links)
- High-Dimensional Gaussian Graphical Model Selection: Walk Summability and Local Separation Criterion (Q5405191) (← links)
- Sample Complexity Analysis for Learning Overcomplete Latent Variable Models through Tensor Methods (Q6253653) (← links)