Open Problem: Tightness of maximum likelihood semidefinite relaxations.
Afonso S. BandeiraYuehaw KhooAmit SingerPublished in: COLT (2014)
Keyphrases
- semidefinite
- maximum likelihood
- semidefinite programming
- convex relaxation
- sufficient conditions
- interior point methods
- lower bound
- em algorithm
- higher dimensional
- convex sets
- expectation maximization
- convex optimization
- linear programming
- markov networks
- training samples
- kernel matrix
- multiple kernel learning
- dimensionality reduction
- learning algorithm