conftrace_

sparse linear regression

49 papers

Explore in graph

Also known as

SLR

Co-occurring keywords

sample complexity (1169) sparse regression (175) support recovery (43) high-dimensional statistics (145) feature selection (649) online learning (1777) compressed sensing (201) differential privacy (1016) gaussian graphical model (106) sublinear regret (88)

Papers

Bayesian Model Selection with Graph Structured Sparsity JMLR 2020
Winnowing with Gradient Descent COLT 2020
Overfitting Can Be Harmless for Basis Pursuit, But Only to a Degree NIPS 2020
Learning Some Popular Gaussian Graphical Models without Condition Number Bounds NIPS 2020
A Knowledge Transfer Framework for Differentially Private Sparse Learning AAAI 2020
The All-or-Nothing Phenomenon in Sparse Linear Regression COLT 2019
On Sparse Linear Regression in the Local Differential Privacy Model ICML 2019
Sample Complexity of Learning Mixture of Sparse Linear Regressions NIPS 2019
Differentially Private Iterative Gradient Hard Thresholding for Sparse Learning IJCAI 2019
Sample Efficient Stochastic Gradient Iterative Hard Thresholding Method for Stochastic Sparse Linear Regression with Limited Attribute Observation NIPS 2018
Online Regression with Partial Information: Generalization and Linear Projection AISTATS 2018
Sparse PCA from Sparse Linear Regression NIPS 2018
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation NIPS 2017
Collect at Once, Use Effectively: Making Non-interactive Locally Private Learning Possible ICML 2017
Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP ICML 2017
Memory, Communication, and Statistical Queries COLT 2016
Online Sparse Linear Regression COLT 2016
Minimax rates for memory-bounded sparse linear regression COLT 2015
A Greedy Homotopy Method for Regression with Nonconvex Constraints AISTATS 2015
Lower Bounds on the Performance of Polynomial-time Algorithms for Sparse Linear Regression COLT 2014
Information-Theoretic Characterization of Sparse Recovery AISTATS 2014
Differentially Private Feature Selection via Stability Arguments, and the Robustness of the Lasso COLT 2013
High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity NIPS 2011
Fast global convergence rates of gradient methods for high-dimensional statistical recovery NIPS 2010