No Time to Observe: Adaptive Influence Maximization with Partial Feedback
Not on the map. Why?
Abstract (arXiv)
Although influence maximization problem has been extensively studied over the past ten years, majority of existing work adopt one of the following models: full-feedback model or zero-feedback model. In the zero-feedback model, we have to commit the seed users all at once in advance, this strategy is also known as non-adaptive policy. In the full-feedback model, we select one seed at a time and wait until the diffusion completes, before selecting the next seed. Full-feedback model has better performance but potentially huge delay, zero-feedback model has zero delay but poorer performance since it does not utilize the observation that may be made during the seeding process. To fill the gap between these two models, we propose Partial-feedback Model, which allows us to select a seed at any intermediate stage. We develop two novel greedy policies that, for the first time, achieve bounded approximation ratios under both uniform and non-uniform cost settings.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Sep 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 0; 2023: 1; 2024: 0; 2025: 0; 2026: 1.
6 papers.
- 2021Adaptive Regularized Submodular Maximizationcited by 8
- 2021Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization subject to Knapsack and k-System Constraintscited by 8
- 2021Robust Adaptive Submodular Maximizationcited by 4
- 2026Policy-Embedded Graph Expansion: Networked HIV Testing with Diffusion-Driven Network Samplescited by 3
- 2021Partial-Adaptive Submodular Maximizationcited by 1
- 2023Jointly Complementary&Competitive Influence Maximization with Concurrent Ally-Boosting and Rival-Preventingcited by 0
- 2026Policy-Embedded Graph Expansion: Networked HIV Testing with Diffusion-Driven Network Samples20 Jan 2026
- 2023Jointly Complementary&Competitive Influence Maximization with Concurrent Ally-Boosting and Rival-Preventing19 Feb 2023
- 2021Partial-Adaptive Submodular Maximization1 Nov 2021
- 2021Robust Adaptive Submodular Maximization23 Jul 2021
- 2021Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization subject to Knapsack and k-System Constraints10 Apr 2021
- 2021Adaptive Regularized Submodular Maximization28 Feb 2021