Research map / Bandits and online learning / Multi-armed bandits
Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Crawling the Community Structure of Multiplex Networks (AAAI 2019 · similarity 0.86)
- Learning to target with network interference (NeurIPS 2026 · similarity 0.86)
- Distributed Multi-Agent Bandits Over Erdős-Rényi Random Networks (NeurIPS 2025 · similarity 0.86)
- Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search (AAAI 2024 · similarity 0.85)
- Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs (AAAI 2024 · similarity 0.85)
- Efficient Graph Bandit Learning with Side-Observations and Switching Constraints (AAAI 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.