Skip to content
#small language model Open access

Neural Probabilistic Relational Games (N-PRG): Learning Influence Coalitions from Cascade Data via Gradient Descent

Sep 2026 · Machine Learning and Knowledge Extraction · Vol 8, pp. 278 · 0 citations · 13 references
Advanced Graph Neural Networks

TL;DR

The Neural Probabilistic Relational Game (N-PRG), a data-driven framework that automatically learns a probabilistic hypergraph of influence coalitions from cascade traces, unites the flexibility of gradient-descent learning with the structural rigour of relational games for influence analysis.

Abstract

Influence maximisation traditionally assumes that each activated neighbour contributes independently to the likelihood of a user adopting information, ignoring conjunctive synergies where a set of users must be active simultaneously to trigger another. Relational games provide a formal language for such coalitional dependencies, but the necessary influence hypergraph must be hand-crafted by domain experts, making them infeasible for large, dynamic social networks. We introduce the Neural Probabilistic Relational Game (N-PRG), a data-driven framework that automatically learns a probabilistic hypergraph of influence coalitions from cascade traces. A feed-forward neural network, trained via gradient descent to predict user activation, is interpreted using Deep SHAP to extract important set-level triggers. These are calibrated into a stochastic cascade model, the Probabilistic Relational Game (PRG), which generalises the Independent Cascade to set-based activation. We define the Minimal Reliable Seed Set problem, prove its NP-hardness even in the deterministic case, and establish that the expected influence function is monotone. We further demonstrate that, unlike the Independent Cascade model, the influence function under conjunctive (AND-type) hyperedges is in general not submodular, which precludes constant-factor approximation guarantees and motivates the use of greedy heuristics. Extensive experiments on synthetic data confirm that N-PRG successfully identifies coalitional interactions of size greater than one and achieves targeted out-of-sample coverage. Semi-synthetic experiments on Digg and Twitter network topologies demonstrate that N-PRG discovers seed sets up to 45% smaller than Independent Cascade baselines, while providing interpretable coalition pathways invisible to black-box methods. N-PRG thus unites the flexibility of gradient-descent learning with the structural rigour of relational games for influence analysis.

Read PDF

Similar papers

Preprint Aug 2026

A Unifying Relational Perspective on Expressive Lottery Tickets

It is proved that sufficiently parameterized RGNNs contain sparse subnetworks that maintain 1-RWL expressivity and derive a lower bound on the probability that a random pruning yields such a subnetwork.

Lorenz Kummer, Samir Moustafa, Anatol Ehrlich et al. · 0 citations
Preprint Sep 2026

Routing Between Generative and Collaborative User Profiles: A Serving-Time Gate for Controllable Novelty

Large language models (LLMs) enable rich semantic user profiles for recommendation, but such profiles are more expensive to generate and are not necessarily desirable to deploy uniformly. We study whether LLM-generated profiles can instead be invoked selectively within a production recommendation pipeline. Using a real...

M. Sabouri, Neeraj Sharma, Sardar Hamidian et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Diffusion Reward Models

Downstream RLHF experiments additionally show that using DRM as the training-time reward leads to improved policy performance, directly validating the practical benefit of diffusion-based reward modeling for RLHF training.

Xiang-Yang Wang, Bing-Xiang He, Ze-Yuan Liu et al. · 0 citations
Preprint Aug 2026

FlowNeg: GFlowNet-Guided Diverse Hard Negative Sampling for Knowledge Graph Embedding

FlowNeg is introduced, a context-conditioned hierarchical generative flow network that amortizes reward-proportional sampling without normalizing a composite reward over the entity set: given a positive triple and corruption side, it selects a type, then an entity.

Ibne Farabi Shihab, Naoshin Anzum Hridi, Joyanta J. Mondal · 0 citations
#artificial intelligence Open access Sep 2026

Local Updates, Global Learning (LUGL): Playing Games with non-incremental Learners

The dominance of Neural Networks (NNs) in RL is partially due to their incremental learning capability, which naturally suits the online, non-stationary nature of self-play training. However, gradient-boosted trees like LightGBM are widely recognised as the state of the art for tabular data in supervised learning, ofte...

David Milec, Spyridon Samothrakis, Michael Fairbank et al. · 0 citations
#machine learning Preprint Sep 2026

Optimal Networks for Agentic Information Aggregation

Kearns, Roth, and Ryu show that the output agent's error approaches the global predictor's error along sufficiently deep paths with suitable feature coverage, while insufficient depth can prevent aggregation even in large networks.

M. Bateni, Z. Hadizadeh, Mohammadtaghi Hajiaghayi et al. · 0 citations

Related blog posts

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