WIQL: Whittle Index-based Q-learning

• WIQL is a reinforcement learning algorithm that estimates Whittle indices for restless multi-armed bandits using a two-timescale stochastic approximation approach.
• It unifies fast Q-learning updates with slower index adjustments, supporting both tabular and deep function approximation for scalable, near-optimal policy implementation.
• Empirical studies show WIQL achieves rapid convergence and efficiency in diverse applications such as wireless scheduling, machine repair, and federated learning.

Whittle Index-based Q-learning (WIQL) is a class of reinforcement learning algorithms for learning Whittle indices in restless multi-armed bandit problems (RMABPs) via model-free, two-timescale stochastic approximation, unifying the computational power of Q-learning with the index policy structure of the Whittle heuristic. WIQL directly estimates Whittle indices online for each arm and state, allowing rapid and scalable implementation of near-optimal index policies in environments with unknown dynamics and rewards. Modern variants include both tabular and deep (function approximation) versions, with convergence guarantees and strong empirical performance in large-scale RMABPs (Relaño et al., 2024).

1. Restless Bandits and the Whittle Index Principle

A restless multi-armed bandit consists of $N$ arms, each evolving as an MDP regardless of being selected, with the agent allowed to activate a subset of $M < N$ arms at each timestep. This PSPACE-hard control problem is rendered tractable by Whittle’s Lagrangian relaxation, decoupling the joint constraint into separate single-arm problems via a per-time-step subsidy $\lambda$. For a given state $s$ of an arm, the Whittle index $W(s)$ is defined as the critical subsidy at which the arm is equally attractive to play or not play:

$$W(s) = \inf\{\lambda : Q^{\lambda}(s,1) = Q^{\lambda}(s,0)\}$$

where $Q^{\lambda}(s,a)$ is the state-action value function parameterized by subsidy $\lambda$. If an arm is indexable (i.e., the set of passive-optimal states grows monotonically in $\lambda$), the Whittle index exists and the policy that activates the $M$ arms with the highest $M < N$0 is asymptotically optimal as $M < N$1 (Relaño et al., 2024, Xiong et al., 2023).

2. Two-Timescale WIQL Architecture and Algorithm

WIQL exploits the Whittle index indifference condition by maintaining, for each state $M < N$2, (i) online Q-learning of $M < N$3 and (ii) a slow-timescale update of $M < N$4 to drive $M < N$5 to zero.

Generic tabular WIQL (QWI) (Relaño et al., 2024):

• Fast (Q-value) timescale: For fixed $M < N$6, update

$M < N$7

for observed $M < N$8, with $M < N$9 satisfying $\lambda$0, $\lambda$1.

• Slow (Whittle-index) timescale: For current $\lambda$2, update

$\lambda$3

with $\lambda$4, $\lambda$5, $\lambda$6.

• Action selection: $\lambda$7.

Empirically, WIQL requires orders of magnitude less storage and reduces the search space from exponential ($\lambda$8) to linear in $\lambda$9 (Avrachenkov et al., 2020).

3. Function Approximation and Deep WIQL

For large or continuous state spaces, WIQL is extended to deep neural function approximation. In QWINN (WIQL with Neural Networks) (Relaño et al., 2024), Q-values $s$0 (parameter vector $s$1) are fitted using standard DQN with minibatch SGD steps, while Whittle indices are represented by a separate “index network” $s$2. On the slow timescale, $s$3 is updated by minimizing the squared error between neural $s$4 and the index estimate $s$5:

$s$6

with $s$7 updated less frequently or at lower learning rate to ensure two-timescale separation. All local minima of the Bellman error in QWINN are locally stable equilibria, marking a notable theoretical advance for DQN-based index schemes (Relaño et al., 2024).

Convergence guarantees for deep WIQL have been established in recent work. In Neural-Q-Whittle, a two-layer ReLU network approximates $s$8, and the Whittle index estimates $s$9 are updated per-iteration as $W(s)$0 (where $W(s)$1 is the neural $W(s)$2 and $W(s)$3 is a state-action embedding). Finite-time analysis yields a non-asymptotic error decay of $W(s)$4 for both neural parameters and index estimation, accounting for Markovian sampling and network approximation error (Xiong et al., 2023).

4. Convergence Guarantees and Rate Analysis

Convergence proofs for WIQL and its extensions rely on two-timescale stochastic approximation. Under standard assumptions (ergodicity, bounded rewards, Lipschitz transitions, sufficient exploration, and step-sizes with $W(s)$5), tabular WIQL converges almost surely to the true Whittle indices $W(s)$6 and optimal $W(s)$7 (Relaño et al., 2024, Avrachenkov et al., 2020). For neural and linear function approximation, convergence is to neighborhoods (due to approximation error), with rates $W(s)$8 established for overparameterized networks (Xiong et al., 2023, Xiong et al., 2022).

In the average-reward setting, relative value iteration Q-learning is used with normalization of the value biases, and convergence is established under the unichain assumption (Avrachenkov et al., 2020).

5. Variants, Acceleration, and Practical Implementation

Advanced Q-learning schemes can be integrated on the fast timescale for improved sample efficiency:

• Speedy Q-Learning (SQL): Maintains two past iterates to accelerate contraction (Kakarapalli et al., 2024).
• Generalized SQL (GSQL): Adds a relaxation parameter to further improve convergence constants.
• Phase Q-Learning (PhaseQL): Averages Bellman targets over $W(s)$9 simulated transitions. In synchronous settings, achieves empirical $$W(s) = \inf\{\lambda : Q^{\lambda}(s,1) = Q^{\lambda}(s,0)\}$$0 convergence (Kakarapalli et al., 2024).

Exploration strategies include $$W(s) = \inf\{\lambda : Q^{\lambda}(s,1) = Q^{\lambda}(s,0)\}$$1-greedy, softmax, $$W(s) = \inf\{\lambda : Q^{\lambda}(s,1) = Q^{\lambda}(s,0)\}$$2-softmax, and UCB. UCB-based policies typically accelerate convergence and index estimation (Kakarapalli et al., 2024), especially for rarely visited state-action pairs. For efficient implementation, step-sizes $$W(s) = \inf\{\lambda : Q^{\lambda}(s,1) = Q^{\lambda}(s,0)\}$$3 must be chosen. In large settings, periodic random resets or state-aggregation accelerate coverage (Mittal et al., 2024, Xiong et al., 2022).

Function approximation is crucial in high-dimensional problems: linear architectures (state aggregation or features) yield practical WIQL variants with provable $$W(s) = \inf\{\lambda : Q^{\lambda}(s,1) = Q^{\lambda}(s,0)\}$$4 finite-time bounds (Xiong et al., 2022); deep neural architectures (QWINN, Neural-Q-Whittle) enable extrapolation across states, with empirical runtime dominated by DQN-like updates and $$W(s) = \inf\{\lambda : Q^{\lambda}(s,1) = Q^{\lambda}(s,0)\}$$510% overhead for index-network updates (Relaño et al., 2024, Xiong et al., 2023).

6. Empirical Performance and Applications

WIQL algorithms have been evaluated in various RMABP domains:

Domain/Environment	WIQL Variant	Sample Complexity	Regret (vs. oracle Whittle)
Machine repair, queueing	QWI/QWINN	$$W(s) = \inf\{\lambda : Q^{\lambda}(s,1) = Q^{\lambda}(s,0)\}$$6–$$W(s) = \inf\{\lambda : Q^{\lambda}(s,1) = Q^{\lambda}(s,0)\}$$7 steps	$$W(s) = \inf\{\lambda : Q^{\lambda}(s,1) = Q^{\lambda}(s,0)\}$$8, converges $$W(s) = \inf\{\lambda : Q^{\lambda}(s,1) = Q^{\lambda}(s,0)\}$$9 faster than DQN (Relaño et al., 2024)
Wireless sensor scheduling	Tabular WIQL	Within 2–3% of oracle	Up to 70% reduction in transmissions (Jonah et al., 3 Jan 2026)
Federated learning client selection	Tabular WIQL	$Q^{\lambda}(s,a)$0 index MSE	Within 3–7% of Whittle-optimal, 45% wallclock time reduction (Li et al., 17 Sep 2025)
Edge caching	Linear FA WIQL	$Q^{\lambda}(s,a)$1 convergence	Within 1–2% of model-based Whittle (Xiong et al., 2022)

Numerical studies confirm that WIQL and its deep variants outperform naive Q-learning by leveraging the structure of Whittle-index policies: they converge faster, require less memory, and maintain near-optimal rewards even in large-scale, heterogeneous, or resource-constrained regimes (Relaño et al., 2024, Xiong et al., 2023, Li et al., 17 Sep 2025, Jonah et al., 3 Jan 2026).

7. Limitations and Extensions

WIQL's theoretical guarantees crucially depend on arm-wise indexability. Extensions to non-indexable arms or arms with continuous state/action spaces require alternative index learning or actor-critic hybridizations (Relaño et al., 2024). For deep WIQL, convergence may be to local minima; good exploration coverage and buffer diversity are important. For rare or infrequently visited states, index estimation may be slow unless forced by explicit state resets or targeted exploration (Kakarapalli et al., 2024, Mittal et al., 2024). Empirical studies suggest that meta-learning across arm families, functional parameter sharing, and variance-reduction actor-critic approaches are promising for scaling further (Relaño et al., 2024).

Major extensions include:

• Incorporation of variance-reducing actor-critic components.
• Online adaptation to non-stationary or continuous dynamics.
• Large-scale parallelization across arms with shared or conditional index networks.
• Meta-learning warm-starts for families of similar arms.

WIQL thus provides a unified, scalable, and theoretically grounded framework for model-free learning of near-optimal index policies in RMABPs with broad applicability to resource allocation, wireless scheduling, smart sensing, and federated learning (Relaño et al., 2024, Xiong et al., 2023, Li et al., 17 Sep 2025, Jonah et al., 3 Jan 2026).