Papers with Code 아카이브
Matrix Completion
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 1
- 평가표
- 0
- 보존된 평가 기록
- 0
Matrix Completion is a method for recovering lost information. It originates from machine learning and usually deals with highly sparse matrices. Missing or unknown data is estimated using the low-rank matrix of the known data.
Source: A Fast Matrix-Completion-Based Approach for Recommendation Systems
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Over-fitting Control in Deep Nonlinear Matrix Completion via Gradual Nonsmooth Regularization
New Hardness Results for Low-Rank Matrix Completion
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
Optimal Transport with Heterogeneously Missing Data
RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees
Adaptively-weighted Nearest Neighbors for Matrix Completion
Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent
AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization
Truncated Matrix Completion - An Empirical Study
Computational Efficient Informative Nonignorable Matrix Completion: A Row- and Column-Wise Matrix U-Statistic Pseudo-Likelihood Approach
An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
Depth-Aided Color Image Inpainting in Quaternion Domain
Fast Two-photon Microscopy by Neuroimaging with Oblong Random Acquisition (NORA)
A Linearized Alternating Direction Multiplier Method for Federated Matrix Completion Problems
Interference-Aware Edge Runtime Prediction with Conformal Matrix Completion
Optimal Transfer Learning for Missing Not-at-Random Matrix Completion
Recommendations from Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization
A Geometric Approach to Personalized Recommendation with Set-Theoretic Constraints Using Box Embeddings
Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach
Covariates-Adjusted Mixed-Membership Estimation: A Novel Network Model with Optimal Guarantees
Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent
Norm-Bounded Low-Rank Adaptation
Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size
Matrix Completion in Group Testing: Bounds and Simulations
Robust Egoistic Rigid Body Localization
Low rank matrix completion and realization of graphs: results and problems
Improved Approximation Algorithms for Low-Rank Problems Using Semidefinite Optimization
Deeply Learned Robust Matrix Completion for Large-scale Low-rank Data Recovery
Robust Matrix Completion for Discrete Rating-Scale Data
Matrix Completion via Residual Spectral Matching
Representational Transfer Learning for Matrix Completion
A privacy-preserving distributed credible evidence fusion algorithm for collective decision-making
On adaptivity and minimax optimality of two-sided nearest neighbors
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory Data
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.