Timezone: »
Influence maximization is the task of selecting a small number of seed nodes in a social network to maximize the spread of the influence from these seeds, and it has been widely investigated in the past two decades. In the canonical setting, the whole social network as well as its diffusion parameters is given as input. In this paper, we consider the more realistic sampling setting where the network is unknown and we only have a set of passively observed cascades that record the set of activated nodes at each diffusion step. We study the task of influence maximization from these cascade samples (IMS), and present constant approximation algorithms for this task under mild conditions on the seed set distribution. To achieve the optimization goal, we also provide a novel solution to the network inference problem, that is, learning diffusion parameters and the network structure from the cascade data. Comparing with prior solutions, our network inference algorithm requires weaker assumptions and does not rely on maximum-likelihood estimation and convex programming. Our IMS algorithms enhance the learning-and-then-optimization approach by allowing a constant approximation ratio even when the diffusion parameters are hard to learn, and we do not need any assumption related to the network structure or diffusion parameters.
Author Information
Wei Chen (Microsoft)
Xiaoming Sun (Institute of Computing Technology, Chinese Academy of Sciences )
Jialin Zhang (Institute of Computing Technology, CAS)
Zhijie Zhang (Institute of Computing Technology, Chinese Academy of Sciences)
Related Events (a corresponding poster, oral, or spotlight)
-
2021 Poster: Network Inference and Influence Maximization from Samples »
Wed. Jul 21st 04:00 -- 06:00 AM Room
More from the Same Authors
-
2022 Poster: Branching Reinforcement Learning »
Yihan Du · Wei Chen -
2022 Spotlight: Branching Reinforcement Learning »
Yihan Du · Wei Chen -
2021 Poster: Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning »
Xutong Liu · Jinhang Zuo · Xiaowei Chen · Wei Chen · John C. S. Lui -
2021 Oral: Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning »
Xutong Liu · Jinhang Zuo · Xiaowei Chen · Wei Chen · John C. S. Lui -
2021 Tutorial: Privacy in learning: Basics and the interplay »
Huishuai Zhang · Wei Chen -
2020 Poster: Optimization from Structured Samples for Coverage Functions »
Wei Chen · Xiaoming Sun · Jialin Zhang · Zhijie Zhang -
2020 Poster: (Locally) Differentially Private Combinatorial Semi-Bandits »
Xiaoyu Chen · Kai Zheng · Zixin Zhou · Yunchang Yang · Wei Chen · Liwei Wang -
2020 Poster: Combinatorial Pure Exploration for Dueling Bandit »
Wei Chen · Yihan Du · Longbo Huang · Haoyu Zhao -
2018 Poster: Thompson Sampling for Combinatorial Semi-Bandits »
Siwei Wang · Wei Chen -
2018 Oral: Thompson Sampling for Combinatorial Semi-Bandits »
Siwei Wang · Wei Chen