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

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.

Authors

Institutions

Publication Details

Journal
Machine Learning and Knowledge Extraction
Published
2026-09-09
DOI
https://doi.org/10.3390/make8090278
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

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

János Demetrovics, Duc Thi Vu, Vu Duc Nghia, Thanh Huy Nguyen
Machine Learning and Knowledge Extraction
Advanced Graph Neural Networks
article

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

János Demetrovics, Duc Thi Vu, Vu Duc Nghia, Thanh Huy Nguyen
article en

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.

Machine Learning and Knowledge ExtractionVol. 8(9)
National Economics University (VN), Vietnam National University, Hanoi (VN), Hanoi University of Civil Engineering (VN), HUN-REN Institute for Computer Science and Control (HU), Youth Development (US), VNU University of Science (VN)
Openalex Percentile: Top 8%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.