Learnability of Influence in Networks

We show PAC learnability of influence functions for three common influence models, namely, the Linear Threshold (LT), Independent Cascade (IC) and Voter models, and present concrete sample complexity results in each case. Our results for the LT model are based on interesting connections with neural networks; those for the IC model are based an interpretation of the influence function as an expectation over random draw of a subgraph and use covering number arguments; and those for the Voter model are based on a reduction to linear regression. We show these results for the case in which the cascades are only partially observed and we do not see the time steps in which a node has been influenced. We also provide efficient polynomial time learning algorithms for a setting with full observation, i.e. where the cascades also contain the time steps in which nodes are influenced.

[1]  Le Song,et al.  Estimating Diffusion Network Structures: Recovery Conditions, Sample Complexity & Soft-thresholding Algorithm , 2014, ICML.

[2]  Bernhard Schölkopf,et al.  Uncovering the Temporal Dynamics of Diffusion Networks , 2011, ICML.

[3]  Pravesh Kothari,et al.  Learning Coverage Functions and Private Release of Marginals , 2014, COLT.

[4]  Alessandro Panconesi,et al.  Trace complexity of network inference , 2013, KDD.

[5]  Peter L. Bartlett,et al.  Learning in Neural Networks: Theoretical Foundations , 1999 .

[6]  Le Song,et al.  Scalable Influence Estimation in Continuous-Time Diffusion Networks , 2013, NIPS.

[7]  Laks V. S. Lakshmanan,et al.  Learning influence probabilities in social networks , 2010, WSDM '10.

[8]  Tong Zhang.  Statistical behavior and consistency of classification methods based on convex risk minimization , 2003 .

[9]  Asaf Shapira,et al.  A note on maximizing the spread of influence in social networks , 2011, Inf. Process. Lett..

[10]  Jure Leskovec,et al.  Inferring networks of diffusion and influence , 2010, KDD.

[11]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[12]  Sujay Sanghavi,et al.  Learning the graph of epidemic cascades , 2012, SIGMETRICS '12.

[13]  Peter L. Bartlett,et al.  Neural Network Learning - Theoretical Foundations , 1999 .

[14]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[15]  Niloy Ganguly,et al.  Learning a Linear Influence Model from Transient Opinion Dynamics , 2014, CIKM.

[16]  Peter L. Bartlett,et al.  Vapnik-Chervonenkis dimension of neural nets , 2003 .

[17]  Jean Pouget-Abadie,et al.  Inferring Graphs from Cascades: A Sparse Recovery Framework , 2015, ICML.

[18]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[19]  Maria-Florina Balcan,et al.  Learning submodular functions , 2010, STOC '11.

[20]  Luis E. Ortiz,et al.  Learning the structure and parameters of large-population graphical games from behavioral data , 2012, J. Mach. Learn. Res..

[21]  Le Song,et al.  Influence Function Learning in Information Diffusion Networks , 2014, ICML.

[22]  Le Song,et al.  Learning Networks of Heterogeneous Influence , 2012, NIPS.