REM: A Scalable Reinforced Multi-Expert Framework for Multiplex Influence Maximization
Huyen Nguyen, Hieu Dam, Nguyen Hoang Khoi Do, Cong Tran, Cuong Pham
Abstract
In social online platforms, identifying influential seed users to maximize influence spread is a crucial as it can greatly diminish the cost and efforts required for information dissemination. While effective, traditional methods for Multiplex Influence Maximization (MIM) have reached their performance limits, prompting the emergence of learning-based approaches. These novel methods aim for better generalization and scalability for more sizable graphs but face significant challenges, such as (1) inability to handle unknown diffusion patterns and (2) reliance on high-quality training samples. To address these issues, we propose the Reinforced Expert Maximization framework (REM). REM leverages a Propagation Mixture of Experts technique to encode dynamic propagation of large multiplex networks effectively in order to generate enhanced influence propagation. Noticeably, REM treats a generative model as a policy to autonomously generate different seed sets and learn how to improve them from a Reinforcement Learning perspective. Extensive experiments on several real-world datasets demonstrate that REM surpasses state-of-the-art methods in terms of influence spread, scalability, and inference time in influence maximization tasks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ca3a067a-e0a0-4103-865b-329d19a144fbCited by top-tier papers2
- Hephaestus: Mixture Generative Modeling with Energy Guidance for Large-scale QoS DegradationNguyen Do, Bach Ngo, Youval Kashuv, Canh V. Pham et al.NeurIPS 2025 · 1 citation
- Hexaïssa: Standing on Giants' Shoulders - Routing the Best Chess Engines with Mixture-of-Experts and Latent Reward LearningBach Ngo, Nguyen Hoang Khoi DoAAAI 2026
Builds on4
- Deep Graph Representation Learning and Optimization for Influence MaximizationChen Ling, Junji Jiang, Junxiang Wang, My T. Thai et al.ICML 2023 · 159 citations
- GCOMB: Learning Budget-constrained Combinatorial Algorithms over Billion-sized GraphsSahil Manchanda, Akash Mittal, Anuj Dhawan, Sourav Medya et al.NeurIPS 2020 · 120 citations
- Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound TightenedQintian Guo, Sibo Wang, Zhewei Wei, Ming ChenSIGMOD 2020 · 80 citations
- Source Localization of Graph Diffusion via Variational Autoencoders for Graph Inverse ProblemsChen Ling, Junji Jiang, Junxiang Wang, Liang ZhaoKDD 2022 · 42 citations
Related papers
- IMGNN: An Efficient, Effective and Generalizable Algorithm for Influence Maximization in Social NetworksHaotian Zhang, Kai Han, Zhizhuo Yin, Shuang Cui et al.KDD 2026
- Approximation and Learning-based Algorithms for Influence Maximization in Multilayer Social NetworksXueqin Chang, Ruize Liu, Qing Liu, Baihua Zheng et al.KDD 2026 · 1 citation
- DeepSN: A Sheaf Neural Framework for Influence MaximizationAsela Hevapathige, Qing Wang, Ahad N. ZehmakanAAAI 2025 · 4 citations
- Network Inference and Influence Maximization from SamplesWei Chen, Xiaoming Sun, Jialin Zhang, Zhijie ZhangICML 2021 · 18 citations
- Efficient and Effective Algorithms for Revenue Maximization in Social AdvertisingKai Han, Benwei Wu, Jing Tang, Shuang Cui et al.SIGMOD 2021 · 13 citations
