Learning Data Manifolds with a Cutting Plane Method

DOI10.1162/neco_a_01119zbMath1472.68132arXiv1705.09944OpenAlexW2617020621WikidataQ91156991 ScholiaQ91156991MaRDI QIDQ5157241

Haim Sompolinsky, Uri Cohen, Daniel D. Lee, Sueyeon Chung

Publication date: 12 October 2021

Published in: Neural Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Statistics on manifolds (62R30) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• RSVM
• ImageNet
• AlexNet

Cites Work

• Unsupervised learning of invariant representations
• A new quadratic semi-infinite programming algorithm based on dual parametrization
• Cutting planes in integer and mixed integer programming
• A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Learning Data Manifolds with a Cutting Plane Method