Papers with Code 아카이브

Dictionary Learning

태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.

하위 태스크
0
평가표
0
보존된 평가 기록
0

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 with Code 기록으로, 최신 순위는 아닙니다.

아직 연결된 자료가 없습니다.

관련 논문 살펴보기 →

출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.