conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Sparse Optimization

158 papers

Papers per year

12
17
6
'10
'15
'20

Papers

Deeply Learned Spectral Total Variation Decomposition NIPS 2020
The Strong Screening Rule for SLOPE NIPS 2020
The Generalized Lasso with Nonlinear Observations and Generative Priors NIPS 2020
Stochastic Sparse Subspace Clustering CVPR 2020
Pruning Redundant Mappings in Transformer Models via Spectral-Normalized Identity Prior EMNLP 2020
Sparse Optimization for Unsupervised Extractive Summarization of Long Documents with the Frank-Wolfe Algorithm EMNLP 2020
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery NIPS 2019
Learning Sparse Distributions using Iterative Hard Thresholding NIPS 2019
Sparse High-Dimensional Isotonic Regression NIPS 2019
Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing NIPS 2019
The Impact of Regularization on High-dimensional Logistic Regression NIPS 2019
Fast Sparse Group Lasso NIPS 2019
Doubly-Robust Lasso Bandit NIPS 2019
RS3CIS: Robust Single-Step Spectral Clustering with Intrinsic Subspace AAAI 2019
Graphical Lasso and Thresholding: Equivalence and Closed-form Solutions JMLR 2019
Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds NIPS 2018
High Dimensional Linear Regression using Lattice Basis Reduction NIPS 2018
Theoretical Linear Convergence of Unfolded ISTA and Its Practical Weights and Thresholds NIPS 2018
Fast Greedy MAP Inference for Determinantal Point Process to Improve Recommendation Diversity NIPS 2018
Efficient Stochastic Gradient Hard Thresholding NIPS 2018
Low-rank Interaction with Sparse Additive Effects Model for Large Data Frames NIPS 2018
Proximal SCOPE for Distributed Sparse Learning NIPS 2018
Orthogonal Matching Pursuit for Text Classification EMNLP 2018
k-Support and Ordered Weighted Sparsity for Overlapping Groups: Hardness and Algorithms NIPS 2017
Fast, Sample-Efficient Algorithms for Structured Phase Retrieval NIPS 2017