arXiv (Cornell University) · 2015 · 27 citations · 4 references
ComputingComputer ScienceMachine LearningRecommender SystemsSocial InfluenceCollaborative FilteringEvaluation Of Recommender SystemsExploration-exploitation TradeoffRecommendation EvaluationBandit AlgorithmsBandit Algorithms For RecommendationExploration - Exploitation Trade-offExploration-exploitation Trade-offMulti-armed Bandit OptimizationMulti-armed Bandit Recommendation
We consider the problem of \emph{influence maximization}, the problem of maximizing the number of people that become aware of a product by finding the `best' set of `seed' users to expose the product to. Most prior work on this topic assumes that we know the probability of each user influencing each other user, or we have data that lets us estimate these influences. However, this information is typically not initially available or is difficult to obtain. To avoid this assumption, we adopt a combinatorial multi-armed bandit paradigm that estimates the influence probabilities as we sequentially try different seed sets. We establish bounds on the performance of this procedure under the existing edge-level feedback as well as a novel and more realistic node-level feedback. Beyond our theoretical results, we describe a practical implementation and experimentally demonstrate its efficiency and effectiveness on four real datasets.
4
Minimax Policies for Combinatorial Prediction Games
Jean-Yves Audibert, Sébastien Bubeck, Gábor Lugosi · 2011 · 16 citations