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

• URL: http://arxiv.org/abs/2501.00779v1
• Date: Wed, 01 Jan 2025 09:13:09 GMT
• Title: REM: A Scalable Reinforced Multi-Expert Framework for Multiplex Influence Maximization
• Authors: Huyen Nguyen, Hieu Dam, Nguyen Do, Cong Tran, Cuong Pham,
• Abstract summary: In social online platforms, identifying influential seed users to maximize influence spread is a crucial task. We propose the Reinforced Expert Maximization framework (REM) to address these issues. REM surpasses state-of-the-art methods in terms of influence spread, scalability, and inference time in influence tasks.
• Score: 3.275046031354923
• License:
• 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.

Related papers

• Diffusion Model Agnostic Social Influence Maximization in Hyperbolic Space [0.0]
  The Influence Maximization (IM) problem aims to find a small set of influential users to maximize their influence spread in a social network. Traditional methods rely on fixed diffusion models with known parameters, limiting their generalization to real-world scenarios. We propose HIM, a novel diffusion model agnostic method that leverages hyperbolic representation learning to estimate users' potential influence spread.
  arXiv  Detail & Related papers  (2025-02-19T09:24:28Z)
• DeepSN: A Sheaf Neural Framework for Influence Maximization [7.2716257100195385]
  Influence is key topic in data mining, with broad applications in social network analysis and viral marketing. In recent years, researchers have increasingly turned to machine learning techniques to address this problem. DeepSN employs sheaf neural diffusion to learn diverse influence patterns in a data-driven end-to-end manner.
  arXiv  Detail & Related papers  (2024-12-16T23:49:51Z)
• On-the-fly Modulation for Balanced Multimodal Learning [53.616094855778954]
  Multimodal learning is expected to boost model performance by integrating information from different modalities. The widely-used joint training strategy leads to imbalanced and under-optimized uni-modal representations. We propose On-the-fly Prediction Modulation (OPM) and On-the-fly Gradient Modulation (OGM) strategies to modulate the optimization of each modality.
  arXiv  Detail & Related papers  (2024-10-15T13:15:50Z)
• Influence Maximization via Graph Neural Bandits [54.45552721334886]
  We set the IM problem in a multi-round diffusion campaign, aiming to maximize the number of distinct users that are influenced. We propose the framework IM-GNB (Influence Maximization with Graph Neural Bandits), where we provide an estimate of the users' probabilities of being influenced.
  arXiv  Detail & Related papers  (2024-06-18T17:54:33Z)
• Decision Mamba: A Multi-Grained State Space Model with Self-Evolution Regularization for Offline RL [57.202733701029594]
  We propose Decision Mamba, a novel multi-grained state space model (SSM) with a self-evolving policy learning strategy. To address these challenges, we propose Decision Mamba, a novel multi-grained state space model (SSM) with a self-evolving policy learning strategy. To mitigate the overfitting issue on noisy trajectories, a self-evolving policy is proposed by using progressive regularization.
  arXiv  Detail & Related papers  (2024-06-08T10:12:00Z)
• MMA-DFER: MultiModal Adaptation of unimodal models for Dynamic Facial Expression Recognition in-the-wild [81.32127423981426]
  Multimodal emotion recognition based on audio and video data is important for real-world applications. Recent methods have focused on exploiting advances of self-supervised learning (SSL) for pre-training of strong multimodal encoders. We propose a different perspective on the problem and investigate the advancement of multimodal DFER performance by adapting SSL-pre-trained disjoint unimodal encoders.
  arXiv  Detail & Related papers  (2024-04-13T13:39:26Z)
• Intuition-aware Mixture-of-Rank-1-Experts for Parameter Efficient Finetuning [50.73666458313015]
  Large Language Models (LLMs) have demonstrated significant potential in performing multiple tasks in multimedia applications. MoE has been emerged as a promising solution with its sparse architecture for effective task decoupling. Intuition-MoR1E achieves superior efficiency and 2.15% overall accuracy improvement across 14 public datasets.
  arXiv  Detail & Related papers  (2024-04-13T12:14:58Z)
• Graph Bayesian Optimization for Multiplex Influence Maximization [9.155955744238852]
  Influence (IM) is the problem of identifying a limited number of initial influential users within a social network to maximize the number of influenced users. Previous research has mostly focused on individual information propagation, neglecting the simultaneous and interactive dissemination of multiple information items. This paper first formulates the Multiplex Maximization (Multi-IM) problem using diffusion models with an information association mechanism.
  arXiv  Detail & Related papers  (2024-03-25T14:50:01Z)
• MIM-Reasoner: Learning with Theoretical Guarantees for Multiplex Influence Maximization [22.899884160183596]
  Multiplex influence (MIM) asks us to identify a set of seed users such as to maximize the expected number of influenced users in a multiplex network. We introduce MIM-Reasoner, which captures the complex propagation process within and between layers of a given multiplex network.
  arXiv  Detail & Related papers  (2024-02-24T03:48:22Z)
• Self-Supervised Neuron Segmentation with Multi-Agent Reinforcement Learning [53.00683059396803]
  Mask image model (MIM) has been widely used due to its simplicity and effectiveness in recovering original information from masked images. We propose a decision-based MIM that utilizes reinforcement learning (RL) to automatically search for optimal image masking ratio and masking strategy. Our approach has a significant advantage over alternative self-supervised methods on the task of neuron segmentation.
  arXiv  Detail & Related papers  (2023-10-06T10:40:46Z)
• Deep Graph Representation Learning and Optimization for Influence Maximization [10.90744025490539]
  In Influence (IM) is formulated as selecting a set of initial users from a social network to maximize the expected number of influenced users. We propose a novel framework DeepIM to generatively characterize the latent representation of seed sets. We also design a novel objective function to infer optimal seed sets under flexible node-centrality-based budget constraints.
  arXiv  Detail & Related papers  (2023-05-01T15:45:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.