← Learning Types
Machine Learning › Learning Types ›

Sparse Learning

135 directly classified papers

Papers per year

Papers

Superset Technique for Approximate Recovery in One-Bit Compressed Sensing NIPS 2019
Evaluating Lottery Tickets Under Distributional Shifts EMNLP 2019
Deconstructing Lottery Tickets: Zeros, Signs, and the Supermask NIPS 2019
Efficient online algorithms for fast-rate regret bounds under sparsity NIPS 2018
Alternating optimization of decision trees, with application to learning sparse oblique trees NIPS 2018
Neural Sparse Topical Coding ACL 2018
Multivariate Convolutional Sparse Coding for Electromagnetic Brain Signals NIPS 2018
Learning without the Phase: Regularized PhaseMax Achieves Optimal Sample Complexity NIPS 2018
Sample Efficient Stochastic Gradient Iterative Hard Thresholding Method for Stochastic Sparse Linear Regression with Limited Attribute Observation NIPS 2018
Parametric Simplex Method for Sparse Learning NIPS 2017
Provable Self-Representation Based Outlier Detection in a Union of Subspaces CVPR 2017
From Bayesian Sparsity to Gated Recurrent Nets NIPS 2017
From Keyframes to Key Objects: Video Summarization by Representative Object Proposal Selection CVPR 2016
Aggregation of supports along the Lasso path COLT 2016
Generalized Direct Change Estimation in Ising Model Structure ICML 2016
The Constrained Dantzig Selector with Enhanced Consistency JMLR 2016
Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit CVPR 2016
Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering CVPR 2016
Learning Sparse High Dimensional Filters: Image Filtering, Dense CRFs and Bilateral Neural Networks CVPR 2016
Estimating Sparse Signals With Smooth Support via Convex Programming and Block Sparsity CVPR 2016
On Benefits of Selection Diversity via Bilevel Exclusive Sparsity CVPR 2016
Optimal Sparse Linear Encoders and Sparse PCA NIPS 2016
Sparse Support Recovery with Non-smooth Loss Functions NIPS 2016
Approximating Sparse PCA from Incomplete Data NIPS 2015
Subspace Clustering with Irrelevant Features via Robust Dantzig Selector NIPS 2015