SOTAVerified

Dictionary Learning

Dictionary Learning is an important problem in multiple areas, ranging from computational neuroscience, machine learning, to computer vision and image processing. The general goal is to find a good basis for given data. More formally, in the Dictionary Learning problem, also known as sparse coding, we are given samples of a random vector $y\in\mathbb{R}^n$, of the form $y=Ax$ where $A$ is some unknown matrix in $\mathbb{R}^{n×m}$, called dictionary, and $x$ is sampled from an unknown distribution over sparse vectors. The goal is to approximately recover the dictionary $A$.

Source: Polynomial-time tensor decompositions with sum-of-squares

Papers

Showing 601610 of 823 papers

TitleStatusHype
Prior-Less Compressible Structure From Motion0
Saliency Guided Dictionary Learning for Weakly-Supervised Image Parsing0
Efficient Large-Scale Similarity Search Using Matrix Factorization0
Sparse Coding for Third-Order Super-Symmetric Tensor Descriptors With Application to Texture Recognition0
Rain Streak Removal Using Layer Priors0
TenSR: Multi-Dimensional Tensor Sparse Representation0
Feuding Families and Former Friends: Unsupervised Learning for Dynamic Fictional Relationships0
Sparse Coding for Classification via Discrimination Ensemble0
Sample-Specific SVM Learning for Person Re-Identification0
Domain Transfer Multi-Instance Dictionary Learning0
Show:102550
← PrevPage 61 of 83Next →

No leaderboard results yet.