Learning with Structured Sparsity
From MaRDI portal
Publication:5396730
zbMath1280.68169arXiv0903.3002MaRDI QIDQ5396730
Tong Zhang, Junzhou Huang, Dimitris Metaxas
Publication date: 3 February 2014
Full work available at URL: https://arxiv.org/abs/0903.3002
feature selectioncompressive sensinggroup sparsitysparse learningstructured sparsitygraph sparsitystandard sparsitytree sparsity
Nonparametric regression and quantile regression (62G08) Ridge regression; shrinkage estimators (Lasso) (62J07) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Linearized alternating direction method of multipliers for sparse group and fused Lasso models ⋮ Smooth sparse coding via marginal regression for learning sparse representations ⋮ ORKA: Object reconstruction using a K-approximation graph ⋮ Structured Sparsity: Discrete and Convex Approaches ⋮ Two-level structural sparsity regularization for identifying lattices and defects in noisy images ⋮ Unnamed Item ⋮ Sparsity Constrained Estimation in Image Processing and Computer Vision ⋮ Overlapping group lasso for high-dimensional generalized linear models ⋮ On change-point estimation under Sobolev sparsity ⋮ Grouping strategies and thresholding for high dimensional linear models ⋮ Comment on: \(\ell _{1}\)-penalization for mixture regression models ⋮ Sequential approaches for learning datum-wise sparse representations ⋮ Cluster sparsity field: an internal hyperspectral imagery prior for reconstruction ⋮ Regularizers for structured sparsity ⋮ Theoretical properties of the overlapping groups Lasso ⋮ Structured, sparse regression with application to HIV drug resistance ⋮ Kernelized Elastic Net Regularization: Generalization Bounds, and Sparse Recovery ⋮ Discrete optimization methods for group model selection in compressed sensing ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ Sparse trace norm regularization ⋮ Traditional and recent approaches in background modeling for foreground detection: an overview ⋮ Structured sparsity through convex optimization ⋮ Foveated compressed sensing ⋮ Robust visual tracking via consistent low-rank sparse learning ⋮ Convex relaxations of penalties for sparse correlated variables with bounded total variation ⋮ Beyond covariance: SICE and kernel based visual feature representation ⋮ Investigating consumers' store-choice behavior via hierarchical variable selection ⋮ Theoretical guarantees for graph sparse coding ⋮ Unnamed Item
This page was built for publication: Learning with Structured Sparsity