Tight Inner Approximations of the Positive-Semidefinite Cone via Grassmannian Packing.
Tianqi ZhengJames GuthrieEnrique MalladaPublished in: CoRR (2021)
Keyphrases
- positive semidefinite
- positive semidefinite matrices
- semidefinite
- semidefinite programming
- complementarity problems
- kernel matrix
- similarity function
- metric learning
- linear combination
- kernel function
- upper bound
- lower bound
- kernel methods
- convex sets
- subspace learning
- linear programming
- interior point methods
- worst case
- polynomial kernels
- low rank
- higher dimensional
- embedding space
- machine learning
- multi task
- high order
- distance metric
- support vector machine
- np hard