Smooth sparse coding via marginal regression for learning sparse representations

DOI10.1016/j.artint.2016.04.009zbMath1385.68031arXiv1210.1121OpenAlexW2614850865MaRDI QIDQ309913

Krishnakumar Balasubramanian, Kai Yu, Guy Lebanon

Publication date: 7 September 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.1121

zbMATH Keywords

dictionary learningsparse codingvision

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization

Uses Software

• KernSmooth
• LIBSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence analysis of perturbed feasible descent methods
• Smoothing \(\ell_1\)-penalized estimators for high-dimensional time-course data
• Local Rademacher complexities
• Greed is Good: Algorithmic Results for Sparse Approximation
• On the Goldstein-Levitin-Polyak gradient projection method
• Local Regression and Likelihood
• Sure Independence Screening for Ultrahigh Dimensional Feature Space
• Sparsity and Smoothness Via the Fused Lasso
• Learning with Structured Sparsity
• Combinatorial methods in density estimation

This page was built for publication: Smooth sparse coding via marginal regression for learning sparse representations