MIM-Reasoner: Learning with Theoretical Guarantees for Multiplex Influence Maximization

• URL: http://arxiv.org/abs/2402.16898v2
• Date: Sun, 10 Mar 2024 07:35:15 GMT
• Title: MIM-Reasoner: Learning with Theoretical Guarantees for Multiplex Influence Maximization
• Authors: Nguyen Do, Tanmoy Chowdhury, Chen Ling, Liang Zhao, My T. Thai
• Abstract summary: 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.
• Score: 22.899884160183596
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Multiplex influence maximization (MIM) asks us to identify a set of seed users such as to maximize the expected number of influenced users in a multiplex network. MIM has been one of central research topics, especially in nowadays social networking landscape where users participate in multiple online social networks (OSNs) and their influences can propagate among several OSNs simultaneously. Although there exist a couple combinatorial algorithms to MIM, learning-based solutions have been desired due to its generalization ability to heterogeneous networks and their diversified propagation characteristics. In this paper, we introduce MIM-Reasoner, coupling reinforcement learning with probabilistic graphical model, which effectively captures the complex propagation process within and between layers of a given multiplex network, thereby tackling the most challenging problem in MIM. We establish a theoretical guarantee for MIM-Reasoner as well as conduct extensive analyses on both synthetic and real-world datasets to validate our MIM-Reasoner's performance.

Related papers

• 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)
• Uni-MoE: Scaling Unified Multimodal LLMs with Mixture of Experts [54.529880848937104]
  We develop a unified MLLM with the MoE architecture, named Uni-MoE, that can handle a wide array of modalities. Specifically, it features modality-specific encoders with connectors for a unified multimodal representation. We evaluate the instruction-tuned Uni-MoE on a comprehensive set of multimodal datasets.
  arXiv  Detail & Related papers  (2024-05-18T12:16:01Z)
• Unimodal Training-Multimodal Prediction: Cross-modal Federated Learning with Hierarchical Aggregation [16.308470947384134]
  HA-Fedformer is a novel transformer-based model that empowers unimodal training with only a unimodal dataset at the client. We develop an uncertainty-aware aggregation method for the local encoders with layer-wise Markov Chain Monte Carlo sampling. Our experiments on popular sentiment analysis benchmarks, CMU-MOSI and CMU-MOSEI, demonstrate that HA-Fedformer significantly outperforms state-of-the-art multimodal models.
  arXiv  Detail & Related papers  (2023-03-27T07:07:33Z)
• ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning [4.266866385061998]
  We propose a novel end-to-end DRL framework, ToupleGDD, to address the Influence Maximization (IM) problem. Our model is trained on several small randomly generated graphs with a small budget, and tested on completely different networks under various large budgets.
  arXiv  Detail & Related papers  (2022-10-14T03:56:53Z)
• A Multi-Transformation Evolutionary Framework for Influence Maximization in Social Networks [44.739573338273175]
  We propose a multi-transformation evolutionary framework for influence transformation (MTEFIM) to exploit potential similarities and unique advantages of alternate transformations. MTEFIM can efficiently utilize the potentially transferable knowledge across multiple transformations to achieve highly competitive performance. The MTEFIM is validated on four real-world social networks.
  arXiv  Detail & Related papers  (2022-04-07T08:53:42Z)
• Joint Demand Prediction for Multimodal Systems: A Multi-task Multi-relational Spatiotemporal Graph Neural Network Approach [7.481812882780837]
  This study proposes a multi-relational graph neural network (MRGNN) for multimodal demand prediction. A multi-relational graph neural network (MRGNN) is introduced to capture cross-mode heterogeneous spatial dependencies. Experiments are conducted using real-world datasets from New York City.
  arXiv  Detail & Related papers  (2021-12-15T12:35:35Z)
• Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning [89.31889875864599]
  We propose an efficient model-based reinforcement learning algorithm for learning in multi-agent systems. Our main theoretical contributions are the first general regret bounds for model-based reinforcement learning for MFC. We provide a practical parametrization of the core optimization problem.
  arXiv  Detail & Related papers  (2021-07-08T18:01:02Z)
• Deep Multi-Task Learning for Cooperative NOMA: System Design and Principles [52.79089414630366]
  We develop a novel deep cooperative NOMA scheme, drawing upon the recent advances in deep learning (DL) We develop a novel hybrid-cascaded deep neural network (DNN) architecture such that the entire system can be optimized in a holistic manner.
  arXiv  Detail & Related papers  (2020-07-27T12:38:37Z)
• A Multi-Semantic Metapath Model for Large Scale Heterogeneous Network Representation Learning [52.83948119677194]
  We propose a multi-semantic metapath (MSM) model for large scale heterogeneous representation learning. Specifically, we generate multi-semantic metapath-based random walks to construct the heterogeneous neighborhood to handle the unbalanced distributions. We conduct systematical evaluations for the proposed framework on two challenging datasets: Amazon and Alibaba.
  arXiv  Detail & Related papers  (2020-07-19T22:50:20Z)
• MS-Net: Multi-Site Network for Improving Prostate Segmentation with Heterogeneous MRI Data [75.73881040581767]
  We propose a novel multi-site network (MS-Net) for improving prostate segmentation by learning robust representations. Our MS-Net improves the performance across all datasets consistently, and outperforms state-of-the-art methods for multi-site learning.
  arXiv  Detail & Related papers  (2020-02-09T14:11:50Z)

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.