GraphDR-LinUCB projects contextual bandit arms onto a graph's low-frequency eigenspace to obtain the first Õ(k√T) regret bound under approximate smoothness, with a spectral predictor Γ_k that matches outcomes on five of six real datasets.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
UCB-AA is a screening-enhanced UCB algorithm for bandits with arriving arms that delivers arrival-dependent regret bounds and sublinear dynamic regret under gap regularity conditions.
citing papers explorer
-
Graph Dimensionality Reduction for Contextual Bandits: Structure-Specific Regret Bounds under Approximate Smoothness and Noisy Eigenspaces
GraphDR-LinUCB projects contextual bandit arms onto a graph's low-frequency eigenspace to obtain the first Õ(k√T) regret bound under approximate smoothness, with a spectral predictor Γ_k that matches outcomes on five of six real datasets.
-
Multi-Armed Bandits with Arriving Arms: Sequential Screening, Dynamic Regret, and Sublinear Guarantees
UCB-AA is a screening-enhanced UCB algorithm for bandits with arriving arms that delivers arrival-dependent regret bounds and sublinear dynamic regret under gap regularity conditions.