Sign in

NOODL: Provable Online Dictionary Learning and Sparse Coding

By Sirisha Rambhatla and others
We consider the dictionary learning problem, where the aim is to model the given data as a linear combination of a few columns of a matrix known as a dictionary, where the sparse weights forming the linear combination are known as coefficients. Since the dictionary and coefficients, parameterizing the linear... Show more
March 15, 2019
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
NOODL: Provable Online Dictionary Learning and Sparse Coding
Click on play to start listening