SqueezeFit: Label-Aware Dimensionality Reduction by Semidefinite Programming
From MaRDI portal
Publication:5124405
DOI10.1109/TIT.2019.2962681zbMATH Open1448.94126arXiv1812.02768OpenAlexW2998575132MaRDI QIDQ5124405FDOQ5124405
Authors: Culver McWhirter, Dustin G. Mixon, Soledad Villar 
Publication date: 29 September 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Given labeled points in a high-dimensional vector space, we seek a low-dimensional subspace such that projecting onto this subspace maintains some prescribed distance between points of differing labels. Intended applications include compressive classification. Taking inspiration from large margin nearest neighbor classification, this paper introduces a semidefinite relaxation of this problem. Unlike its predecessors, this relaxation is amenable to theoretical analysis, allowing us to provably recover a planted projection operator from the data.
Full work available at URL: https://arxiv.org/abs/1812.02768
Recommendations
- Supervised dimensionality reduction via sequential semidefinite programming
- A unified framework for semi-supervised dimensionality reduction
- Dimension reduction with semi-supervised pairwise covariance-preserving projection
- A general soft label based linear discriminant analysis for semi-supervised dimensionality reduction
- Sufficient dimension reduction via principal L\(q\) support vector machine
- Constrained large margin local projection algorithms and extensions for multimodal dimensionality reduction
- Minimal \(\sigma\)-field for flexible sufficient dimension reduction
Cited In (3)
This page was built for publication: SqueezeFit: Label-Aware Dimensionality Reduction by Semidefinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124405)
