Online contextual influence maximization with costly observations

Publication Type

Journal Article

Publication Date

6-2019

Abstract

In the online contextual influence maximization problem with costly observations, the learner faces a series of epochs in each of which a different influence spread process takes place over a network. At the beginning of each epoch, the learner exogenously influences (activates) a set of seed nodes in the network. Then, the influence spread process takes place over the network, through which other nodes get influenced. The learner has the option to observe the spread of influence by paying an observation cost. The goal of the learner is to maximize its cumulative reward, which is defined as the expected total number of influenced nodes over all epochs minus the observation costs. We depart from the prior work in three aspects: 1) the learner does not know how the influence spreads over the network, i.e., it is unaware of the influence probabilities; 2) influence probabilities depend on the context; and 3) observing influence is costly. We consider two different influence observation settings: costly edge-level feedback, in which the learner freely observes the set of influenced nodes, but pays to observe the influence outcomes on the edges of the network; and costly node-level feedback, in which the learner pays to observe whether a node is influenced or not. Since the offline influence maximization problem itself is NP-hard, for these settings, we develop online learning algorithms that use an approximation algorithm as a subroutine to obtain the set of seed nodes in each epoch. When the influence probabilities are Hölder continuous functions of the context, we prove that these algorithms achieve sublinear regret (for any sequence of contexts) with respect to an approximation oracle that knows the influence probabilities for all contexts. Our numerical results on several networks illustrate that the proposed algorithms perform on par with the state-of-the-art methods even when the observations are cost free.

Keywords

Influence maximization, combinatorial bandits, social networks, approximation algorithms, costly observations, regret bounds

Discipline

Operations and Supply Chain Management | Theory and Algorithms

Research Areas

Operations Management

Publication

IEEE Transactions on Signal and Information Processing over Networks

Volume

5

Issue

2

First Page

273

Last Page

289

ISSN

2373-776X

Identifier

10.1109/TSIPN.2018.2866334

Publisher

Institute of Electrical and Electronics Engineers

Additional URL

https://doi.org/10.1109/TSIPN.2018.2866334

This document is currently not available here.

Share

COinS