Skip to content
Preprint

Tabular Foundation Models for Multi-View Information Cascade Popularity Prediction

Aug 2026 · 0 citations · 60 references
Computer Science

TL;DR

TFM4POP is the first framework to introduce tabular foundation models (TFMs) into popularity prediction, leveraging their pre-trained tabular priors to unify the modeling of multiple heterogeneous information views and constructs a comprehensive multi-view cascade benchmark that covers all four information views.

Abstract

Predicting the future popularity of information cascades is essential for understanding information diffusion on social media. Despite recent advances, existing methods face two key limitations: they focus primarily on the cascade view while overlooking other information views that drive user engagement, such as textual semantics, visual content, and tabular attributes; and they fail to capture high-order cross-view interactions. To address these issues, we propose \textbf{TFM4POP}, the first framework to introduce tabular foundation models (TFMs) into popularity prediction, leveraging their pre-trained tabular priors to unify the modeling of multiple heterogeneous information views. Specifically, TFM4POP adopts a dual-branch design: the static branch employs a TFM as the feature-encoding backbone that jointly reasons over all static views through in-context learning to produce the static cascade representation, while the dynamic branch captures the continuous-time cascade dynamics with a dedicated Neural-ODE-based encoder. The two representations are then fused via cross-attention for the final prediction. Furthermore, to adapt the TFM to real cascade distributions, we apply parameter-efficient IA3 fine-tuning, achieving performance competitive with or better than full fine-tuning while updating substantially fewer parameters. In addition, we construct a comprehensive multi-view cascade benchmark that covers all four information views. Extensive experiments show that TFM4POP consistently outperforms state-of-the-art baselines across multiple datasets and observation settings.

View source

Similar papers

Conference Open access Sep 2026

Bridging the Semantic Gap: Leveraging LLMs for Hierarchical Interest Evolution in Sequential Recommendation

The Hierarchical Semantic Interest Evolution Network (HSIEN), a novel generative-discriminative framework that significantly alleviates modality misalignment and enhances CTR prediction performance through feature complementarity, is proposed.

Yi-Fan Cao, Rui Wu, Xiang Wang et al. · 0 citations
Open access Sep 2026

Timepop a posting time aware deep model for short video popularity prediction

SShort-video platforms have experienced explosive growth, making automated popularity prediction one of the core challenges in social media analytics and recommender systems. Existing methods predominantly focus on visual content or social network features, while systematically neglecting the temporal signal embedded i...

Di Wu, Yan-Fei Zhou, Hai-Long Li et al. · 0 citations
Conference Open access Sep 2026

CasUGC: Aligning User-Generated Comment Evolution with Cascade Dynamics for Popularity Prediction

Accurately predicting the popularity of information cascades facilitates the development of social media network applications. During the cascade propagation process, user-generated comments continually evolve, thereby substantially affecting overall information popularity. However, existing methods primarily focus on...

Yi-Fan Meng, Xi-Gang Sun, An-Ran Zhang et al. · 0 citations
Conference Sep 2026

A lightweight graph convolutional network-based session recommendation method based on multihop attention mechanism

Conversational recommendation aims to predict a user's next potentially interesting item based on a series of historical clicks generated in an anonymous session. In recent years, Graph Convolutional Networks (GCNs) have achieved great success in this field due to their excellent ability to capture complex item transfo...

Xua Li, Ru-Jun Wang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.