REM: A Scalable Reinforced Multi-Expert Framework for Multiplex Influence Maximization
Huyen Nguyen, Hieu Dam, Nguyen Hoang Khoi Do, Cong Tran, Cuong Pham
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Hephaestus: Mixture Generative Modeling with Energy Guidance for Large-scale QoS DegradationNguyen Do, Bach Ngo, Youval Kashuv, Canh V. Pham 等NeurIPS 2025 · 被引用 1 次
- 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
它引用的顶会 Paper4
- Deep Graph Representation Learning and Optimization for Influence MaximizationChen Ling, Junji Jiang, Junxiang Wang, My T. Thai 等ICML 2023 · 被引用 159 次
- GCOMB: Learning Budget-constrained Combinatorial Algorithms over Billion-sized GraphsSahil Manchanda, Akash Mittal, Anuj Dhawan, Sourav Medya 等NeurIPS 2020 · 被引用 120 次
- Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound TightenedQintian Guo, Sibo Wang, Zhewei Wei, Ming ChenSIGMOD 2020 · 被引用 80 次
- Source Localization of Graph Diffusion via Variational Autoencoders for Graph Inverse ProblemsChen Ling, Junji Jiang, Junxiang Wang, Liang ZhaoKDD 2022 · 被引用 42 次
相关 Paper
- IMGNN: An Efficient, Effective and Generalizable Algorithm for Influence Maximization in Social NetworksHaotian Zhang, Kai Han, Zhizhuo Yin, Shuang Cui 等KDD 2026
- Approximation and Learning-based Algorithms for Influence Maximization in Multilayer Social NetworksXueqin Chang, Ruize Liu, Qing Liu, Baihua Zheng 等KDD 2026 · 被引用 1 次
- DeepSN: A Sheaf Neural Framework for Influence MaximizationAsela Hevapathige, Qing Wang, Ahad N. ZehmakanAAAI 2025 · 被引用 4 次
- Network Inference and Influence Maximization from SamplesWei Chen, Xiaoming Sun, Jialin Zhang, Zhijie ZhangICML 2021 · 被引用 18 次
- Efficient and Effective Algorithms for Revenue Maximization in Social AdvertisingKai Han, Benwei Wu, Jing Tang, Shuang Cui 等SIGMOD 2021 · 被引用 13 次
