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 531540 of 823 papers

TitleStatusHype
Learning quadrangulated patches for 3D shape parameterization and completion0
Learning Scalable Discriminative Dictionary with Sample Relatedness0
Learning Simple Thresholded Features with Sparse Support Recovery0
Learning Sparse Adversarial Dictionaries For Multi-Class Audio Classification0
Learning Sparsity-Promoting Regularizers using Bilevel Optimization0
Learning Stable Multilevel Dictionaries for Sparse Representations0
Learning zeroth class dictionary for human action recognition0
Level Set KSVD0
Lightweight Conceptual Dictionary Learning for Text Classification Using Information Compression0
Linearization to Nonlinear Learning for Visual Tracking0
Show:102550
← PrevPage 54 of 83Next →

No leaderboard results yet.