REVIEW 2 cited by
Greedy Deep Dictionary Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this work we propose a new deep learning tool called deep dictionary learning. Multi-level dictionaries are learnt in a greedy fashion, one layer at a time. This requires solving a simple (shallow) dictionary learning problem, the solution to this is well known. We apply the proposed technique on some benchmark deep learning datasets. We compare our results with other deep learning tools like stacked autoencoder and deep belief network; and state of the art supervised dictionary learning tools like discriminative KSVD and label consistent KSVD. Our method yields better results than all.
Forward citations
Cited by 2 Pith papers
-
On the Sparsity-Storage-Accuracy Tradeoff in Parsimoniously Activated Dictionary Learning
PADL is shown equivalent to MAP estimation under a structured generative model, yielding generalization guarantees, an analytical sparsity-storage-accuracy tradeoff, and a tuning-free algorithm tested on visual benchm...
-
The Finite Element Neural Network Method: One Dimensional Study
FENNM solves 1D PDEs by minimizing a finite-element weak-form residual with Lagrange test functions and a neural network trial solution, including flux terms at element boundaries.
Discussion (0). Continue with ORCID to comment.