SOTAVerified

Matrix Completion

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

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 101–150 of 796 papers

TitleStatusHype
Linear Recursive Feature Machines provably recover low-rank matricesCode1
Polynomial Precision Dependence Solutions to Alignment Research Center Matrix Completion Problems—0
Misclassification excess risk bounds for 1-bit matrix completion—0
Waveform Design for OFDM-based ISAC Systems Under Resource Occupancy Constraint—0
Automotive Radar Sensing with Sparse Linear Arrays Using One-Bit Hankel Matrix Completion—0
Multiple Testing of Linear Forms for Noisy Matrix Completion—0
Iterative missing value imputation based on feature importance—0
Harmonic Retrieval Using Weighted Lifted-Structure Low-Rank Matrix Completion—0
Blocked Collaborative Bandits: Online Collaborative Filtering with Per-Item Budget Constraints—0
Triple Simplex Matrix Completion for Expense Forecasting—0
Robust matrix completion via Novel M-estimator Functions—0
A framework to generate sparsity-inducing regularizers for enhanced low-rank matrix completion—0
Robust Low-Rank Matrix Completion via a New Sparsity-Inducing Regularizer—0
Matrix Completion-Informed Deep Unfolded Equilibrium Models for Self-Supervised k-Space Interpolation in MRI—0
IHT-Inspired Neural Network for Single-Snapshot DOA Estimation with Sparse Linear Arrays—0
L_2,1-Norm Regularized Quaternion Matrix Completion Using Sparse Representation and Quaternion QR Decomposition—0
Widely Separated MIMO Radar Using Matrix Completion—0
Applications of Nature-Inspired Metaheuristic Algorithms for Tackling Optimization Problems Across DisciplinesCode0
Matrix Completion in Almost-Verification Time—0
Color Image Recovery Using Generalized Matrix Completion over Higher-Order Finite Dimensional Algebra—0
Data-based system representations from irregularly measured data—0
Imposing Consistency Properties on Blackbox Systems with Applications to SVD-Based Recommender Systems—0
Tackling Combinatorial Distribution Shift: A Matrix Completion Perspective—0
Teaching Arithmetic to Small TransformersCode1
Non-Convex Optimizations for Machine Learning with Theoretical Guarantee: Robust Matrix Completion and Neural Network Learning—0
Graph-Based Matrix Completion Applied to Weather Data—0
Exploiting Observation Bias to Improve Matrix Completion—0
Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation—0
One-sided Matrix Completion from Two Observations Per Row—0
Matrix Completion from General Deterministic Sampling Patterns—0
Combining Explicit and Implicit Regularization for Efficient Learning in Deep Networks—0
Gibbs-Duhem-Informed Neural Networks for Binary Activity Coefficient Prediction—0
Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning—0
Implicit bias of SGD in L_2-regularized linear DNNs: One-way jumps from high to low rank—0
Matrix Estimation for Offline Reinforcement Learning with Low-Rank Structure—0
Disjunctive Branch-And-Bound for Certifiably Optimal Low-Rank Matrix Completion—0
Matrix tri-factorization over the tropical semiringCode0
Rotation Synchronization via Deep Matrix FactorizationCode0
MISNN: Multiple Imputation via Semi-parametric Neural Networks—0
Quaternion Matrix Completion Using Untrained Quaternion Convolutional Neural Network for Color Image Inpainting—0
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion—0
Towards Addressing Training Data Scarcity Challenge in Emerging Radio Access Networks: A Survey and Framework—0
Sequence-aware item recommendations for multiply repeated user-item interactions—0
Region-wise matching for image inpainting based on adaptive weighted low-rank decomposition—0
Constructing High Frequency Economic Indicators by Imputation—0
Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?—0
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time—0
Transductive Matrix Completion with Calibration for Multi-Task Learning—0
Netflix and Forget: Efficient and Exact Machine Unlearning from Bi-linear Recommendations—0
Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form SolutionCode0
Show:102550
← PrevPage 3 of 16Next →

No leaderboard results yet.