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: CoRR (2014)
Keyphrases
- convex optimization
- saddle point
- primal dual
- high dimensional
- interior point
- interior point methods
- structured prediction
- variational inequalities
- dimensionality reduction
- linear programming problems
- semidefinite programming
- low dimensional
- low rank
- total variation
- convex relaxation
- convex sets
- structured output
- maximum margin
- penalty function
- high dimensional data
- feature space
- dynamic programming
- multiscale
- convergence rate
- denoising
- probabilistic model