mlsanityData to 7 Oct 2026

REM: A Scalable Reinforced Multi-Expert Framework for Multiplex Influence Maximization

arXiv 2501.00779 ↗First posted 1 Jan 2025cs.SI cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 1 Jan 2025.

Builds on

0 of 0 references.

No references here yet.

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2024Graph Bayesian Optimization for Multiplex Influence Maximization
  2. 2025A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence
  3. 2022GraMeR: Graph Meta Reinforcement Learning for Multi-Objective Influence Maximization
  4. 2023DSCom: A Data-Driven Self-Adaptive Community-Based Framework for Influence Maximization in Social Networks
  5. 2024Non-Progressive Influence Maximization in Dynamic Social Networks
  6. 2021Online Influence Maximization under the Independent Cascade Model with Node-Level Feedback
  7. 2025Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach
  8. 2025A Pressure-Based Diffusion Model for Influence Maximization on Social Networks