Truncated Matrix Completion - An Empirical Study
원문 초록
Low-rank Matrix Completion (LRMC) describes the problem where we wish to recover missing entries of partially observed low-rank matrix. Most existing matrix completion work deals with sampling procedures that are independent of the underlying data values. While this assumption allows the derivation of nice theoretical guarantees, it seldom holds in real-world applications. In this paper, we consider various settings where the sampling mask is dependent on the underlying data values, motivated by applications in sensing, sequential decision-making, and recommender systems. Through a series of experiments, we study and compare the performance of various LRMC algorithms that were originally successful for data-independent sampling patterns.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
LLM-Stackelberg Games: Conjectural Reasoning Equilibria and Their Applications to Spearphishing
UProp: Investigating the Uncertainty Propagation of LLMs in Multi-Step Agentic Decision-Making
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
TextAtari: 100K Frames Game Playing with Language Agents
N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion
토론
이 논문과 연결된 포럼 글이 아직 없습니다.