A Note on Lewicki-Sejnowski Gradient for Learning Overcomplete Representations

DOI10.1162/NECO.2007.07-06-296zbMATH Open1140.68433DBLPjournals/neco/HeXZC08OpenAlexW2095715335WikidataQ50853524 ScholiaQ50853524MaRDI QIDQ5453531FDOQ5453531

Andrzej Cichocki, Zhaoshui He, Shengli Xie, L.-Q. Zhang

Publication date: 2 April 2008

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco.2007.07-06-296

Recommendations

• Theory and Applications of Models of Computation
• A variational method for learning sparse and overcomplete representations
• Learning overcomplete, low coherence dictionaries with linear inference
• Learning semidefinite regularizers
• From inexact optimization to learning via gradient concentration
• Structured overcomplete sparsifying transform learning with convergence guarantees and applications
• Convex Formulation of Overparameterized Deep Neural Networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Analysis of Sparse Representation and Blind Source Separation
• Underdetermined blind source separation using sparse representations
• A variational method for learning sparse and overcomplete representations

Cited In (5)

• Estimation of Sparse Nonnegative Sources from Noisy Overcomplete Mixtures Using MAP
• Compressed blind signal reconstruction model and algorithm
• Source number estimation and separation algorithms of underdetermined blind separation
• K-hyperline clustering learning for sparse component analysis
• Compressed sensing construction for underdetermined source separation

This page was built for publication: A Note on Lewicki-Sejnowski Gradient for Learning Overcomplete Representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453531)