Sparse Learning

Optimal Sparse Linear Encoders and Sparse PCA NeurIPS 2016 Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering CVPR 2016 Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit CVPR 2016 Sparse Support Recovery with Non-smooth Loss Functions NeurIPS 2016 The Constrained Dantzig Selector with Enhanced Consistency JMLR 2016 An Active Learning Framework using Sparse-Graph Codes for Sparse Polynomials and Graph Sketching NeurIPS 2015 Approximating Sparse PCA from Incomplete Data NeurIPS 2015 Associative Memory via a Sparse Recovery Model NeurIPS 2015 GAP Safe screening rules for sparse multi-task and multi-class models NeurIPS 2015 Motion Part Regularization: Improving Action Recognition via Trajectory Selection CVPR 2015 Multi-Layer Feature Reduction for Tree Structured Group Lasso via Hierarchical Projection NeurIPS 2015 Sparse and Low-Rank Tensor Decomposition NeurIPS 2015 Sparse Composite Quantization CVPR 2015 Sparse PCA via Bipartite Matchings NeurIPS 2015 Sparse Representation Classification With Manifold Constraints Transfer CVPR 2015 Structural Sparse Tracking CVPR 2015 Subspace Clustering with Irrelevant Features via Robust Dantzig Selector NeurIPS 2015 Accelerated Mini-batch Randomized Block Coordinate Descent Method NeurIPS 2014 A Safe Screening Rule for Sparse Logistic Regression NeurIPS 2014 Efficient Sampling for Learning Sparse Additive Models in High Dimensions NeurIPS 2014 Exclusive Feature Learning on Arbitrary Structures via ℓ_1,2-norm NeurIPS 2014 Finding a sparse vector in a subspace: Linear sparsity using alternating directions NeurIPS 2014 Newton Greedy Pursuit: A Quadratic Approximation Method for Sparsity-Constrained Optimization CVPR 2014 Quality-based Multimodal Classification using Tree-Structured Sparsity CVPR 2014 QUIC & DIRTY: A Quadratic Approximation Approach for Dirty Statistical Models NeurIPS 2014