Abstract

Theoretical studies on dictionary learning that fit the problem into a statistical learning framework and justify the above-mentioned optimization problem are given in [23, 36, 12, 10]. In fact, in the previous framework, we minimize an empirical average over the training data, whereas the idealized task would be to optimize an expected cost function over the underlying (and unknown) distribution that generated the data. We point out that in [10] this study is pursed with general coefficient penalties and dictionary constraints, covering all the types of dictionary learning problems mentioned above.

Keywords:
Dictionary learning Computer science Artificial intelligence Natural language processing Sparse approximation

Metrics

1
Cited By
0.48
FWCI (Field Weighted Citation Impact)
1
Refs
0.64
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Speech and Audio Processing
Physical Sciences →  Computer Science →  Signal Processing
Advanced Data Compression Techniques
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
Blind Source Separation Techniques
Physical Sciences →  Computer Science →  Signal Processing

Related Documents

JOURNAL ARTICLE

Alternating Proximal Regularized Dictionary Learning

Saverio SalzoSalvatore MasecchiaAlessandro VerriAnnalisa Barla

Journal:   Neural Computation Year: 2014 Vol: 26 (12)Pages: 2855-2895
JOURNAL ARTICLE

Dual Graph Regularized Dictionary Learning

Yael YankelevskyMichael Elad

Journal:   IEEE Transactions on Signal and Information Processing over Networks Year: 2016 Vol: 2 (4)Pages: 611-624
JOURNAL ARTICLE

Regularized algorithms for dictionary learning

Paul IroftiBogdan Dumitrescu

Year: 2016 Vol: 54 Pages: 439-442
JOURNAL ARTICLE

Regularized Dictionary Learning For Sparse Approximation

Blumensath, ThomasDavies, MikeYaghoobi, Mehrdad

Journal:   Zenodo (CERN European Organization for Nuclear Research) Year: 2008
© 2026 ScienceGate Book Chapters — All rights reserved.