mlsanityData to 14 Oct 2026

Dual-Attention Convolution Experts for Sparse Tensor Completion

arXiv 2606.21427 ↗First posted 19 Jun 2026cs.LG cs.IRcited by 0

Not on the map. Why?

Abstract (arXiv)

Tensor factorization (TF) has been widely adopted for high-dimensional sparse data completion tasks. Despite significant progress, neural TF methods often struggle to capture complex cross-mode interactions and remain vulnerable to (extreme) data sparsity. To address these challenges, we propose a novel neural tensor factorization approach, termed Dual-Attention Convolution Expert Networks with Group-Level Contrastive Learning (DCGC). For the first problem, DCGC generates diverse non-linear alignment patterns of latent factors via a multi-channel convolution network, and leverages the gated dual-attention mechanism to drive the model to focus on more important output channels (i.e., convolution experts) and the aligned features. Furthermore, DCGC introduces a group-level contrastive learning strategy that aggregates positive samples with identical feedback levels while separating negative samples across different levels. This strategy injects high-quality self-supervised signals to mitigate data sparsity. Extensive experiments conducted on five datasets demonstrate that our DCGC outperforms the state-of-the-art methods in sparse tensor completion for traffic and recommendation applications. Code to reproduce the experimental results in the paper is available at https://github.com/ku1z/DCGC.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 34 references that are in the map. First posted on arXiv 19 Jun 2026.

Builds on

12 of 34 references.

References · 12

  1. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,173
  2. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  3. 2023Self-Supervised Learning from Images with a Joint-Embedding Predictive Architecturecited by 1,039
  4. 2023Beyond Appearance: a Semantic Controllable Self-Supervised Learning Framework for Human-Centric Visual Taskscited by 96
  5. 2018Tensor Ring Decomposition with Rank Minimization on Latent Space: An Efficient Approach for Tensor Completioncited by 42
  6. 2021Low-Rank Hankel Tensor Completion for Traffic Speed Estimationcited by 22
  7. 2017Scalable Tucker Factorization for Sparse Tensors - Algorithms and Discoveriescited by 14
  8. 2023Multi-task Item-attribute Graph Pre-training for Strict Cold-start Item Recommendationcited by 13
  9. 2021POSO: Personalized Cold Start Modules for Large-scale Recommender Systemscited by 9
  10. 2025Unveiling Contrastive Learning's Capability of Neighborhood Aggregation for Collaborative Filteringcited by 6
  11. 2018Coupled Graphs and Tensor Factorization for Recommender Systems and Community Detectioncited by 5
  12. 2023Dynamic Tensor Decomposition via Neural Diffusion-Reaction Processescited by 5

Built on by

Not cited yet.