CLAIM: Curriculum Learning Policy for Influence Maximization in Unknown Social Networks
Not on the map. Why?
Abstract (arXiv)
Influence maximization is the problem of finding a small subset of nodes in a network that can maximize the diffusion of information. Recently, it has also found application in HIV prevention, substance abuse prevention, micro-finance adoption, etc., where the goal is to identify the set of peer leaders in a real-world physical social network who can disseminate information to a large group of people. Unlike online social networks, real-world networks are not completely known, and collecting information about the network is costly as it involves surveying multiple people. In this paper, we focus on this problem of network discovery for influence maximization. The existing work in this direction proposes a reinforcement learning framework. As the environment interactions in real-world settings are costly, so it is important for the reinforcement learning algorithms to have minimum possible environment interactions, i.e, to be sample efficient. In this work, we propose CLAIM - Curriculum LeArning Policy for Influence Maximization to improve the sample efficiency of RL methods. We conduct experiments on real-world datasets and show that our approach can outperform the current best approach.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 10 of its 26 references that are in the map. First posted on arXiv 8 Jul 2021.
Builds on
10 of 26 references.
References · 10
- 2017Hindsight Experience Replaycited by 1,136
- 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 787
- 2018Large-Scale Study of Curiosity-Driven Learningcited by 280
- 2018Visual Reinforcement Learning with Imagined Goalscited by 251
- 2017Intrinsic Motivation and Automatic Curricula via Asymmetric Self-Playcited by 141
- 2018CURIOUS: Intrinsically Motivated Modular Multi-Goal Reinforcement Learningcited by 79
- 2019Influence maximization in unknown social networks: Learning Policies for Effective Graph Samplingcited by 20
- 2016Using Social Networks to Aid Homeless Shelters: Dynamic Influence Maximization under Uncertainty - An Extended Versioncited by 9
- 2016Robust Influence Maximizationcited by 5
- 2014NetworkRepository: An Interactive Data Repository with Multi-scale Visual Analyticscited by 3
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 4.
7 papers.
- 2022A Survey on Influence Maximization: From an ML-Based Combinatorial Optimizationcited by 15
- 2022Efficient Resource Allocation with Fairness Constraints in Restless Multi-Armed Banditscited by 11
- 2023Generative Modelling of Stochastic Actions with Arbitrary Constraints in Reinforcement Learningcited by 10
- 2023Adversarial Socialbots Modeling Based on Structural Information Principlescited by 10
- 2021Socialbots on Fire: Modeling Adversarial Behaviors of Socialbots via Multi-Agent Hierarchical Reinforcement Learningcited by 3
- 2023Dyadic Reinforcement Learningcited by 1
- 2023Diversity Induced Environment Design via Self-Playcited by 0
- 2023Adversarial Socialbots Modeling Based on Structural Information Principles13 Dec 2023
- 2023Generative Modelling of Stochastic Actions with Arbitrary Constraints in Reinforcement Learning26 Nov 2023
- 2023Dyadic Reinforcement Learning15 Aug 2023
- 2023Diversity Induced Environment Design via Self-Play4 Feb 2023
- 2022A Survey on Influence Maximization: From an ML-Based Combinatorial Optimization6 Nov 2022
- 2022Efficient Resource Allocation with Fairness Constraints in Restless Multi-Armed Bandits8 Jun 2022
- 2021Socialbots on Fire: Modeling Adversarial Behaviors of Socialbots via Multi-Agent Hierarchical Reinforcement Learning20 Oct 2021