Smooth sparse coding via marginal regression for learning sparse representations
type: Item
instance of: scholarly article
title: Smooth sparse coding via marginal regression for learning sparse representations
zbMATH Open document ID: 1385.68031
author: Krishnakumar Balasubramanian
author: Kai Yu
author: Guy Lebanon
published in: Artificial Intelligence
publication date: 2016-09-07T00:00:00Z
full work available at URL: https://arxiv.org/abs/1210.1121
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 62G08
zbMATH DE Number: 6624687
zbMATH Keywords: sparse coding
zbMATH Keywords: dictionary learning
zbMATH Keywords: vision
describes a project that uses: KernSmooth
describes a project that uses: LIBSVM
MaRDI profile type: Publication
OpenAlex ID: W2614850865
arXiv ID: 1210.1121
cites work: Local Rademacher complexities
cites work: On the Goldstein-Levitin-Polyak gradient projection method
cites work: Combinatorial methods in density estimation
cites work: Sure Independence Screening for Ultrahigh Dimensional Feature Space
cites work: Q5405186
cites work: Learning with Structured Sparsity
cites work: Local Regression and Likelihood
cites work: Smoothing \(\ell_1\)-penalized estimators for high-dimensional time-course data
cites work: Convergence analysis of perturbed feasible descent methods
cites work: Sparsity and Smoothness Via the Fused Lasso
cites work: Greed is Good: Algorithmic Results for Sparse Approximation
cites work: Q5396727
cites work: Q4865051
cites work: Q5591247
DOI: 10.1016/J.ARTINT.2016.04.009
description: scientific article; zbMATH DE number 6624687