Dimensionality Reduction Using the Sparse Linear Model
We propose an approach for linear unsupervised dimensionality reduction, based on the sparse linear model that has been used to probabilistically interpret sparse coding. We formulate an optimization problem for learning a linear projection from the original signal domain to a lower-dimensional one in a way that approximately preserves, in expectation, pairwise inner products in the sparse domain. We derive solutions to the problem, present nonlinear extensions, and discuss relations to compressed sensing. Our experiments using facial images, texture patches, and images of object categories suggest that the approach can improve our ability to recover meaningful structure in many classes of signals.
Code (0)
등록된 구현이 없습니다.
Tasks
compressed sensingDimensionality ReductionmodelSimilar Papers 제목 키워드 기반
A Nonlinear Dimensionality Reduction Framework Using Smooth Geodesics
Existing dimensionality reduction methods are adept at revealing hidden underlying manifolds arising from high-dimensional data and thereby producing a low-dimensional representation. However, the smoothness of the manif…
Dimensionality ReductionIsometric sketching of any set via the Restricted Isometry Property
In this paper we show that for the purposes of dimensionality reduction certain class of structured random matrices behave similarly to random Gaussian matrices. This class includes several matrices for which matrix-vect…
Dimensionality ReductionSupervised Discriminative Sparse PCA with Adaptive Neighbors for Dimensionality Reduction
Dimensionality reduction is an important operation in information visualization, feature extraction, clustering, regression, and classification, especially for processing noisy high dimensional data. However, most existi…
ClusteringDimensionality ReductionGeneral ClassificationSupervised dimensionality reductionSparse POD Mode Selection and Manifold Dimensionality Reduction with Neural Networks
Linear dimensionality reduction methods such as proper orthogonal decomposition (POD) make high-dimensional data amenable to analysis by identifying the principal components, or modes, that capture the most variance, or …
Dimensionality ReductionNon-linear, Sparse Dimensionality Reduction via Path Lasso Penalized Autoencoders
High-dimensional data sets are often analyzed and explored via the construction of a latent low-dimensional space which enables convenient visualization and efficient predictive modeling or clustering. For complex data s…
ClusteringDimensionality Reduction