Introduces distributional matrix completion via kernel embeddings and functional unfolding operators, with non-asymptotic error bounds for a novel estimator.
Distributional matrix completion via nearest neighbors in the wasserstein space
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Low-rank Distributional Matrix Completion
Introduces distributional matrix completion via kernel embeddings and functional unfolding operators, with non-asymptotic error bounds for a novel estimator.