all AI news
Provably Efficient Reinforcement Learning for Online Adaptive Influence Maximization. (arXiv:2206.14846v1 [cs.LG])
July 1, 2022, 1:10 a.m. | Kaixuan Huang, Yu Wu, Xuezhou Zhang, Shenyinying Tu, Qingyun Wu, Mengdi Wang, Huazheng Wang
cs.LG updates on arXiv.org arxiv.org
Online influence maximization aims to maximize the influence spread of a
content in a social network with unknown network model by selecting a few seed
nodes. Recent studies followed a non-adaptive setting, where the seed nodes are
selected before the start of the diffusion process and network parameters are
updated when the diffusion stops. We consider an adaptive version of
content-dependent online influence maximization problem where the seed nodes
are sequentially activated based on real-time feedback. In this paper, we …
arxiv influence learning lg reinforcement reinforcement learning
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Data Engineer
@ Parker | New York City
Sr. Data Analyst | Home Solutions
@ Three Ships | Raleigh or Charlotte, NC