Cover Image

Faster Q-Learning Algorithms for Restless Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kakarapalli, Parvish, Kayande, Devendra, Meshram, Rahul
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Systems and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Whittle Index Learning Algorithms for Restless Bandits with Constant Stepsizes
by: Mittal, Vishesh, et al.
Published: (2024)

Lagrangian Relaxation for Multi-Action Partially Observable Restless Bandits: Heuristic Policies and Indexability
by: Meshram, Rahul, et al.
Published: (2025)

Risk-Aware Decision Making in Restless Bandits: Theory and Algorithms for Planning and Learning
by: Akbarzadeh, Nima, et al.
Published: (2024)

Hierarchical Decentralized Stochastic Control for Cyber-Physical Systems
by: Kaza, Kesav, et al.
Published: (2025)

Restless Bandit Problem with Rewards Generated by a Linear Gaussian Dynamical System
by: Gornet, Jonathan, et al.
Published: (2024)

Low-Complexity Algorithm for Restless Bandits with Imperfect Observations
by: Liu, Keqin, et al.
Published: (2021)

The Bandit Whisperer: Communication Learning for Restless Bandits
by: Zhao, Yunfan, et al.
Published: (2024)

Bandit Algorithms for Deep Brain Stimulation
by: Gupta, Arkaprava, et al.
Published: (2026)

Learning to Sparsify Stochastic Linear Bandits
by: Wang, Zhengmiao, et al.
Published: (2026)

DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback
by: Xiong, Guojun, et al.
Published: (2024)

Decentralized Upper Confidence Bound Algorithms for Homogeneous Multi-Agent Multi-Armed Bandits
by: Zhu, Jingxuan, et al.
Published: (2021)

Variance-Reduced Cascade Q-learning: Algorithms and Sample Complexity
by: Boveiri, Mohammad, et al.
Published: (2024)

Why Most Optimism Bandit Algorithms Have the Same Regret Analysis: A Simple Unifying Theorem
by: Krishnamurthy, Vikram
Published: (2025)

Model Predictive Control is Almost Optimal for Restless Bandit
by: Gast, Nicolas, et al.
Published: (2024)

Faster Reinforcement Learning by Freezing Slow States
by: Wang, Yijia, et al.
Published: (2023)

Robust Q-Learning under Corrupted Rewards
by: Maity, Sreejeet, et al.
Published: (2024)

Analysis of Multiscale Reinforcement Q-Learning Algorithms for Mean Field Control Games
by: Angiuli, Andrea, et al.
Published: (2024)

Deep Q-Learning with Gradient Target Tracking
by: Park, Bum Geun, et al.
Published: (2025)

Convergence and stability of Q-learning in Hierarchical Reinforcement Learning
by: Manenti, Massimiliano, et al.
Published: (2025)

Byzantine-Resilient Decentralized Multi-Armed Bandits
by: Zhu, Jingxuan, et al.
Published: (2023)

Optimal Transport-Assisted Risk-Sensitive Q-Learning
by: Shahrooei, Zahra, et al.
Published: (2024)

Explore-then-Commit for Nonstationary Linear Bandits with Latent Dynamics
by: Choi, Sunmook, et al.
Published: (2025)

Corruption-Tolerant Asynchronous Q-Learning with Near-Optimal Rates
by: Maity, Sreejeet, et al.
Published: (2025)

Lagrangian Index Policy for Restless Bandits with Average Reward
by: Avrachenkov, Konstantin, et al.
Published: (2024)

Multi-Agent Stage-wise Conservative Linear Bandits
by: Afsharrad, Amirhossein, et al.
Published: (2025)

HPC Application Parameter Autotuning on Edge Devices: A Bandit Learning Approach
by: Hossain, Abrar, et al.
Published: (2025)

Cost-Ordered Feasibility for Multi-Armed Bandits with Cost Subsidy
by: Juneja, Ishank, et al.
Published: (2026)

Entropy-regularized Diffusion Policy with Q-Ensembles for Offline Reinforcement Learning
by: Zhang, Ruoqi, et al.
Published: (2024)

Model Predictive Control is almost Optimal for Heterogeneous Restless Multi-armed Bandits
by: Narasimha, Dheeraj, et al.
Published: (2025)

Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness
by: Manupriya, Piyushi, et al.
Published: (2025)

Finite-Time Guarantees for Multi-Agent Combinatorial Bandits with Nonstationary Rewards
by: Adams, Katherine B., et al.
Published: (2025)

Learnable Faster Kernel-PCA for Nonlinear Fault Detection: Deep Autoencoder-Based Realization
by: Ren, Zelin, et al.
Published: (2021)

Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds
by: Güçlü, Arda, et al.
Published: (2024)

Differentially Private High Dimensional Bandits
by: Shukla, Apurv
Published: (2024)

Multi-User mmWave Beam and Rate Adaptation via Combinatorial Satisficing Bandits
by: Özyıldırım, Emre, et al.
Published: (2026)

An LP-based Sampling Policy for Multi-Armed Bandits with Side-Observations and Stochastic Availability
by: Soni, Ashutosh, et al.
Published: (2026)

An Exploration-free Method for a Linear Stochastic Bandit Driven by a Linear Gaussian Dynamical System
by: Gornet, Jonathan, et al.
Published: (2025)

Tensor-Efficient High-Dimensional Q-learning
by: Wu, Junyi, et al.
Published: (2025)

Faster Adaptive Decentralized Learning Algorithms
by: Huang, Feihu, et al.
Published: (2024)

Finite-Time Analysis of Simultaneous Double Q-learning
by: Na, Hyunjun, et al.
Published: (2024)