DuET: Dual-View Tensor-to-Topology Spectral Adapter for Enhancing Sparse Tensor Factorization
Jun-Gi Jang, Jingrui He, Andrew J. Margenot, Hanghang Tong
Abstract
Many real-world datasets, ranging from web-interaction logs to biomedical networks, can be represented as sparse tensors where most entries are unobserved. Tensor factorization (TF) learns latent representations and a predictor to estimate unobserved entries and has been widely applied to higher-order recommendation, biomedical retrieval, and completion. However, under extreme sparsity, many entities participate in only a few interactions, yielding noisy and undertrained latent vectors with poor generalization. We propose DuET, a model-agnostic refinement framework that stabilizes TF embeddings by separating structural denoising from tensor factorization. DuET distills a dual-view structural prior from observed tuples and refines it via per-view low-rank spectral filtering and mode-wise gated residual refinement. We provide a theoretical guarantee that the resulting refinement is Frobenius-norm non-expansive, ensuring stability under repeated refinement. DuET seamlessly integrates with existing TF models without modifying their scoring architectures. Experiments on nine real-world tensors demonstrate consistent improvements for both retrieval and completion, with gains of up to 52.1% in NDCG@10 and reductions of up to 13.8% in RMSE.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext e339fc46-4119-4f36-849a-b35c29935d82Builds on12
- ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph RepresentationsEkagra Ranjan, Soumya Sanyal, Partha P. TalukdarAAAI 2020 · 400 citations
- Simple Spectral Graph ConvolutionHao Zhu, Piotr KoniuszICLR 2021 · 352 citations
- Tensor Decompositions for Temporal Knowledge Base CompletionTimothée Lacroix, Guillaume Obozinski, Nicolas UsunierICLR 2020 · 341 citations
- Generalizing Tensor Decomposition for N-ary Relational Knowledge BasesYu Liu, Quanming Yao, Yong LiWWW 2020 · 91 citations
- Network of Tensor Time SeriesBaoyu Jing, Hanghang Tong, Yada ZhuWWW 2021 · 48 citations
Related papers
- SPAC: Sparse Partitioning and Adaptive Core Tensor Pruning Model for Knowledge Graph CompletionChuhong Yang, Bin Li, Nan WuAAAI 2025 · 2 citations
- Knowledge Graph Completion by Intermediate Variables RegularizationChangyi Xiao, Yixin CaoNeurIPS 2024 · 3 citations
- Score-Based Model for Low-Rank Tensor RecoveryZhengyun Cheng, Changhao Wang, Guanwen Zhang, Yi Xu et al.AAAI 2026
- Deep Rank-One Tensor Functional Factorization for Multi-Dimensional Data RecoveryYanyi Li, Xi Zhang, Yisi Luo, Deyu MengAAAI 2025 · 8 citations
- Nonparametric Embeddings of Sparse High-Order Interaction EventsZheng Wang, Yiming Xu, Conor Tillinghast, Shibo Li et al.ICML 2022 · 6 citations
