arXiv:2104.04757
공식 코드 · Papers with Code
Adversarially-Trained Nonnegative Matrix Factorization
원문 초록
We consider an adversarially-trained version of the nonnegative matrix factorization, a popular latent dimensionality reduction technique. In our formulation, an attacker adds an arbitrary matrix of bounded norm to the given data matrix. We design efficient algorithms inspired by adversarial training to optimize for dictionary and coefficient matrices with enhanced generalization abilities. Extensive simulations on synthetic and benchmark datasets demonstrate the superior predictive performance on matrix completion tasks of our proposed method compared to state-of-the-art competitors, including other variants of adversarial nonnegative matrix factorization.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Active Learning for Manifold Gaussian Process Regression
Distributed Lyapunov Functions for Nonlinear Networks
Deep Symmetric Autoencoders from the Eckart-Young-Schmidt Perspective
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
Enabling stratified sampling in high dimensions via nonlinear dimensionality reduction
Assessing parameter identifiability of a hemodynamics PDE model using spectral surrogates and dimension reduction
토론
이 논문과 연결된 포럼 글이 아직 없습니다.