Spectral bandit algorithms for smooth graph functions achieve regret linear in the effective dimension for large-scale recommender systems.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Spectral bandits for smooth graph functions with applications in recommender systems
Spectral bandit algorithms for smooth graph functions achieve regret linear in the effective dimension for large-scale recommender systems.