On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,291 papers · 148 categories

Trend · papers per month

count % of corpus

2 results for “PSPACE-hard”

Approximations of the Restless Bandit Problemmath.ST

The paper develops a UCB-based method for a specific class of restless bandit problems.

problem Real-world restless bandit problems are complex and hard to solve optimally.

method Modified UCB algorithm for

\varphi

-mixing stationary pay-off distributions.

result UCB-based method provides good approximate solutions under certain conditions.

restless bandit UCB algorithm stationary pay-offs PSPACE-hard φ-mixing

2017-02-22abs ↗pdf ↗

Online Learning of Whittle Indices for Restless Bandits with Non-Stationary Transition Kernelscs.LG

New algorithm optimizes resource allocation in non-stationary networks.

problem Optimal resource allocation in non-stationary RMABs is computationally hard.

method Sliding-Window Online Whittle (SW-Whittle) policy for non-stationary transition kernels.

result Sub-linear dynamic regret achieved with unknown variation budget.

Whittle indices restless bandits non-stationary online learning resource allocation

2025-06-22abs ↗pdf ↗