arXiv:2006.04075
Discrete-Aware Matrix Completion via Proximal Gradient
원문 초록
We present a novel algorithm for the completion of low-rank matrices whose entries are limited to a finite discrete alphabet. The proposed method is based on the recently-emerged proximal gradient (PG) framework of optimization theory, which is applied here to solve a regularized formulation of the completion problem that includes a term enforcing the discrete-alphabet membership of the matrix entries.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion
An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
Interference-Aware Edge Runtime Prediction with Conformal Matrix Completion
Robust Matrix Completion for Discrete Rating-Scale Data
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.