Improved linear embeddings via Lagrange duality

DOI10.1007/s10994-018-5729-xzbMath1482.62069arXiv1711.11527MaRDI QIDQ669310

Juan-Miguel Gracia

Publication date: 15 March 2019

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.11527

zbMATH Keywords

convex relaxation; dimensionality reduction; convex and non-convex optimization; near isometric embeddings

Mathematics Subject Classification ID

62H25: Factor analysis and principal components; correspondence analysis

62H30: Classification and discrimination; cluster analysis (statistical aspects)

90C26: Nonconvex programming, global optimization

90C46: Optimality conditions and duality in mathematical programming

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Uses Software

• MNIST