mlsanityData to 7 Oct 2026

Tensor Convolutional Network for Higher-Order Interaction Prediction in Sparse Tensors

arXiv 2503.11786 ↗First posted 14 Mar 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Many real-world data, such as recommendation data and temporal graphs, can be represented as incomplete sparse tensors where most entries are unobserved. For such sparse tensors, identifying the top-k higher-order interactions that are most likely to occur among unobserved ones is crucial. Tensor factorization (TF) has gained significant attention in various tensor-based applications, serving as an effective method for finding these top-k potential interactions. However, existing TF methods primarily focus on effectively fusing latent vectors of entities, which limits their expressiveness. Since most entities in sparse tensors have only a few interactions, their latent representations are often insufficiently trained. In this paper, we propose TCN, an accurate and compatible tensor convolutional network that integrates seamlessly with existing TF methods for predicting higher-order interactions. We design a highly effective encoder to generate expressive latent vectors of entities. To achieve this, we propose to (1) construct a graph structure derived from a sparse tensor and (2) develop a relation-aware encoder, TCN, that learns latent representations of entities by leveraging the graph structure. Since TCN complements traditional TF methods, we seamlessly integrate TCN with existing TF methods, enhancing the performance of predicting top-k interactions. Extensive experiments show that TCN integrated with a TF method outperforms competitors, including TF methods and a hyperedge prediction method. Moreover, TCN is broadly compatible with various TF methods and GNNs (Graph Neural Networks), making it a versatile solution.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 61 references that are in the map. First posted on arXiv 14 Mar 2025.

Builds on

22 of 61 references.

References · 22

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Graph Attention Networkscited by 8,854
  4. 2017Inductive Representation Learning on Large Graphscited by 6,284
  5. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  6. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
  7. 2019Simplifying Graph Convolutional Networkscited by 1,470
  8. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  9. 2017Neural Collaborative Filteringcited by 1,108
  10. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
  11. 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 361
  12. 2019TuckER: Tensor Factorization for Knowledge Graph Completioncited by 290
10 more
  1. 2019Hypergraph Convolution and Hypergraph Attentioncited by 226
  2. 2020Tensor Decompositions for temporal knowledge base completioncited by 115
  3. 2019Hyper-SAGNN: a self-attention based graph neural network for hypergraphscited by 69
  4. 2022Anti-Symmetric DGN: a stable architecture for Deep Graph Networkscited by 58
  5. 2020Generalizing Tensor Decomposition for N-ary Relational Knowledge Basescited by 38
  6. 2021Network of Tensor Time Seriescited by 32
  7. 2020How Much and When Do We Need Higher-order Information in Hypergraphs? A Case Study on Hyperedge Predictioncited by 31
  8. 2017Scalable Tucker Factorization for Sparse Tensors - Algorithms and Discoveriescited by 14
  9. 2022AHP: Learning to Negative Sample for Hyperedge Predictioncited by 12
  10. 2022On the Persistence of Higher-Order Interactions in Real-World Hypergraphscited by 3

Built on by

Not cited yet.