Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
7-2021
Abstract
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.
Discipline
Artificial Intelligence and Robotics | OS and Networks
Research Areas
Intelligent Systems and Optimization
Publication
Proceedings of the 37th Conference on Uncertainty in Artificial Intelligence (UAI 2021), Virtual Conference, July 27-30
First Page
1
Last Page
11
Publisher
AAMAS
City or Country
Virtual Conference
Citation
LI, Dexun; MEGHNA LOWALEKAR; and VARAKANTHAM, Pradeep.
CLAIM: Curriculum learning policy for influence maximization in unknown social networks. (2021). Proceedings of the 37th Conference on Uncertainty in Artificial Intelligence (UAI 2021), Virtual Conference, July 27-30. 1-11.
Available at: https://ink.library.smu.edu.sg/sis_research/6786
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.