Neural Spectrahedra and Semidefinite Lifts: Global Convex Optimization of Polynomial Activation Neural Networks in Fully Polynomial-Time.
Burak BartanMert PilanciPublished in: CoRR (2021)
Keyphrases
- convex optimization
- semidefinite
- neural network
- convex relaxation
- interior point methods
- convex sets
- interior point
- semidefinite programming
- primal dual
- low rank
- special case
- total variation
- linear program
- sufficient conditions
- multiscale
- singular value decomposition
- higher dimensional
- multiple kernel learning
- model selection
- finite dimensional
- computational complexity