Metraipolis › archive › dc_fc0b2be42207
Revealing graph bandits for maximizing local influence — arXiv:2605.00489
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2605.00489
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T09:33:27.104Z
- SHA-256 of the archived text
2ecde23beb4b8d6cc8097223d5e86af9d3c13569d6b1d590956f390de95ce8cf- Stable URL of this page
https://metraipolis.com/documento/dc_fc0b2be42207
How to cite
Revealing graph bandits for maximizing local influence — arXiv:2605.00489 — arXiv (en), https://arxiv.org/abs/2605.00489 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fc0b2be42207 (Metraipolis archive dc_fc0b2be42207, sha256 2ecde23beb4b8d6cc8097223d5e86af9d3c13569d6b1d590956f390de95ce8cf)
BibTeX
@misc{dcfc0b2be42207,
title = {Revealing graph bandits for maximizing local influence — arXiv:2605.00489},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2605.00489},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fc0b2be42207; sha256 2ecde23beb4b8d6cc8097223d5e86af9d3c13569d6b1d590956f390de95ce8cf},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2605.00489. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study a graph bandit setting where the objective of the learner is to detect the most influential node of a graph by requesting as little information from the graph as possible. One of the relevant applications for this setting is marketing in social networks, where the marketer aims at finding and taking advantage of the most influential customers. The existing approaches for bandit problems on graphs require either partial or complete knowledge of the graph. In this paper, we do not assume any knowledge of the graph, but we consider a setting where it can be gradually discovered in a sequential and active way. At each round, the learner chooses a node of the graph and the only information it receives is a stochastic set of the nodes that the chosen node is currently influencing. To address this setting, we propose BARE, a bandit strategy for which we prove a regret guarantee that scales with the detectable dimension, a problem dependent quantity that is often much smaller than the number of nodes. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ML, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2605.00489 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T08:24:13.972Z dalla pagina https://arxiv.org/list/stat.ML/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).