Covariate-assisted Sparse Tensor Completion
Hilda S Ibriga, Will Wei Sun

TL;DR
This paper introduces COSTCO, a method that leverages covariate information to improve the completion of sparse, highly-missing tensors, demonstrated on advertising data with significant accuracy gains and meaningful ad clustering.
Contribution
The paper proposes a novel covariate-assisted tensor completion method with theoretical error bounds and practical effectiveness in advertising applications.
Findings
Achieved 23% accuracy improvement over baseline in CTR tensor completion.
Derived explicit error bounds showing covariates enhance recovery accuracy.
Revealed meaningful ad clusters useful for targeted advertising.
Abstract
We aim to provably complete a sparse and highly-missing tensor in the presence of covariate information along tensor modes. Our motivation comes from online advertising where users click-through-rates (CTR) on ads over various devices form a CTR tensor that has about 96% missing entries and has many zeros on non-missing entries, which makes the standalone tensor completion method unsatisfactory. Beside the CTR tensor, additional ad features or user characteristics are often available. In this paper, we propose Covariate-assisted Sparse Tensor Completion (COSTCO) to incorporate covariate information for the recovery of the sparse tensor. The key idea is to jointly extract latent components from both the tensor and the covariate matrix to learn a synthetic representation. Theoretically, we derive the error bound for the recovered tensor components and explicitly quantify the improvements…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Advanced Neural Network Applications
