Exploring multi-layered networks through random walks: bridging offline optimization and online learning
- 27 February 2026
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 354
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (625B2163)
This publication has 11 references indexed in Scilit:
- Variance-Aware Bandit Framework for Dynamic Probabilistic Maximum Coverage Problem With Triggered or Self-Reliant ArmsIEEE Transactions on Networking, 2025
- Conversational Recommendation With Online Learning and Clustering on Misspecified UsersIEEE Transactions on Knowledge and Data Engineering, 2024
- Scalable influence maximization for independent cascade model in large-scale social networksData Mining and Knowledge Discovery, 2012
- Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual ObservationsIEEE/ACM Transactions on Networking, 2012
- Routing betweenness centralityJournal of the ACM, 2010
- Exploration–exploitation tradeoff using variance estimates in multi-armed banditsTheoretical Computer Science, 2009
- Efficient Sensor Placement Optimization for Securing Large Water Distribution NetworksJournal of Water Resources Planning and Management, 2008
- Measuring ISP topologies with rocketfuelACM SIGCOMM Computer Communication Review, 2002
- The budgeted maximum coverage problemInformation Processing Letters, 1999
- Some aspects of the sequential design of experimentsBulletin of the American Mathematical Society, 1952