Sample Complexity Bounds for Influence Maximization.
Gal SadehEdith CohenHaim KaplanPublished in: ITCS (2020)
Keyphrases
- influence maximization
- sample complexity bounds
- average case
- greedy algorithm
- sample complexity
- social networks
- worst case
- diffusion model
- viral marketing
- covering numbers
- online social networks
- upper bound
- partially observable markov decision processes
- lower bound
- theoretical analysis
- vc dimension
- uniform distribution
- learning algorithm
- active learning
- learning problems
- special case
- generalization error
- pac learning
- sample size
- training examples
- uniform convergence
- supervised learning
- dynamic programming
- np hard
- computational complexity
- objective function
- image processing