Structured Sparse Regression via Greedy Hard Thresholding

neural information processing systems, pp. 1516-1524, 2016.

Cited by: 24|Bibtex|Views15|

Abstract:

Several learning applications require solving high-dimensional regression problems where the relevant features belong to a small number of (overlapping) groups. For very large datasets and under standard sparsity constraints, hard thresholding methods have proven to be extremely efficient, but such methods require NP hard projections when...More

Code:

Data:

Your rating :
0

 

Tags
Comments