SqueezeFit: Label-aware dimensionality reduction by semidefinite programming
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.
Code (1)
Tasks
ClassificationDimensionality ReductionGeneral ClassificationSimilar Papers 제목 키워드 기반
Unified Framework for Spectral Dimensionality Reduction, Maximum Variance Unfolding, and Kernel Learning By Semidefinite Programming: Tutorial and Survey
This is a tutorial and survey paper on unification of spectral dimensionality reduction methods, kernel learning by Semidefinite Programming (SDP), Maximum Variance Unfolding (MVU) or Semidefinite Embedding (SDE), and it…
Dimensionality ReductionPrescriptive PCA: Dimensionality Reduction for Two-stage Stochastic Optimization
In this paper, we consider the alignment between an upstream dimensionality reduction task of learning a low-dimensional representation of a set of high-dimensional data and a downstream optimization task of solving a st…
Dimensionality ReductionStochastic OptimizationSRP: Efficient class-aware embedding learning for large-scale data via supervised random projections
Supervised dimensionality reduction strategies have been of great interest. However, current supervised dimensionality reduction approaches are difficult to scale for situations characterized by large datasets given the …
Dimensionality ReductionSupervised dimensionality reductionFast Graph Laplacian Regularized Kernel Learning via Semidefinite–Quadratic–Linear Programming
Kernel learning is a powerful framework for nonlinear data modeling. Using the kernel trick, a number of problems have been formulated as semidefinite programs (SDPs). These include Maximum Variance Unfolding (MVU) (Wein…
ClusteringComputational EfficiencyConstrained ClusteringDimensionality ReductionWorst-Case Linear Discriminant Analysis as Scalable Semidefinite Feasibility Problems
In this paper, we propose an efficient semidefinite programming (SDP) approach to worst-case linear discriminant analysis (WLDA). Compared with the traditional LDA, WLDA considers the dimensionality reduction problem fro…
Dimensionality ReductionGeneral Classification