Dimensionality Reduction

Fantope Projection and Selection: A near-optimal convex relaxation of sparse PCA NeurIPS 2013 Fast algorithms for sparse principal component analysis based on Rayleigh quotient iteration ICML 2013 Faster Ridge Regression via the Subsampled Randomized Hadamard Transform NeurIPS 2013 Fast High Dimensional Vector Multiplication Face Recognition ICCV 2013 Fast Subspace Search via Grassmannian Based Hashing ICCV 2013 Forecastable Component Analysis ICML 2013 Generalizing Analytic Shrinkage for Arbitrary Covariance Structures NeurIPS 2013 Graph-Laplacian PCA: Closed-Form Solution and Robustness CVPR 2013 K-Means Hashing: An Affinity-Preserving Quantization Method for Learning Binary Compact Codes CVPR 2013 Learning a Manifold as an Atlas CVPR 2013 Learning a Metric Space for Neighbourhood Topology Estimation: Application to Manifold Learning ACML 2013 Learning a set of directions COLT 2013 Learning Binary Codes for High-Dimensional Data Using Bilinear Projections CVPR 2013 Least Informative Dimensions NeurIPS 2013 Low-Rank Matrix and Tensor Completion via Adaptive Sampling NeurIPS 2013 Manifold-based Similarity Adaptation for Label Propagation NeurIPS 2013 Markov Network Estimation From Multi-attribute Data ICML 2013 Memory Limited, Streaming PCA NeurIPS 2013 Multilinear Dynamical Systems for Tensor Time Series NeurIPS 2013 Near-Optimal Entrywise Sampling for Data Matrices NeurIPS 2013 Non-rigid Structure from Motion with Diffusion Maps Prior CVPR 2013 One-shot learning and big data with n=2 NeurIPS 2013 Online PCA for Contaminated Data NeurIPS 2013 Online Robust PCA via Stochastic Optimization NeurIPS 2013 On the Convergence of Maximum Variance Unfolding JMLR 2013