Identifying and attacking the saddle point problem in high-dimensional non-convex optimization.
Yann N. DauphinRazvan PascanuÇaglar GülçehreKyungHyun ChoSurya GanguliYoshua BengioPublished in: NIPS (2014)
Keyphrases
- convex optimization
- saddle point
- primal dual
- high dimensional
- interior point
- interior point methods
- structured prediction
- variational inequalities
- low rank
- total variation
- linear programming problems
- semidefinite programming
- penalty function
- convex relaxation
- low dimensional
- dimensionality reduction
- maximum margin
- convex sets
- structured output
- linear programming
- input space
- high dimensional data
- global constraints
- data points
- dynamic programming