Research map / Bandits and online learning / Multi-armed bandits
GINO-Q: Learning an Asymptotically Optimal Index Policy for Restless Multi-armed Bandits
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
- Achieving $\tilde{\mathcal{O}}(1/N)$ Optimality Gap in Restless Bandits through Gaussian Approximation (NeurIPS 2025 · similarity 0.91)
- Global Rewards in Restless Multi-Armed Bandits (NeurIPS 2024 · similarity 0.90)
- Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback (ICML 2024 · similarity 0.89)
- The Bandit Whisperer: Communication Learning for Restless Bandits (AAAI 2025 · similarity 0.89)
- Reinforcement learning with combinatorial actions for coupled restless bandits (ICLR 2025 · similarity 0.89)
- Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond (ICML 2024 · similarity 0.88)
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.