Latent Variable Graphical Model Selection Via Convex Optimization
Suppose we have samples of a subset of a collection of random variables. No additional information is provided about the number of latent variables, nor of the relationship between the latent and observed variables. Is it possible to discover the number of hidden components, and to learn a statistic...
Main Authors: | Chandrasekaran, Venkat (Contributor), Parrilo, Pablo A. (Contributor), Willsky, Alan S. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2012-09-11T15:10:32Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Latent variable graphical model selection via convex optimization
by: Willsky, Alan S.
Published: (2013) -
Convex Graph Invariants
by: Chandrasekaran, Venkat, et al.
Published: (2012) -
The convex algebraic geometry of linear inverse problems
by: Chandrasekaran, Venkat, et al.
Published: (2012) -
Learning Gaussian Graphical Models with Observed or Latent FVSs
by: Liu, Ying, et al.
Published: (2015) -
Semidefinite Descriptions of the Convex Hull of Rotation Matrices
by: Saunderson, James, et al.
Published: (2016)