Decentralized linear bandit algorithms NetLinUCB and Net-SGD-UCB reduce the shared-structure learning cost from O(N) to O(sqrt(N)) via adaptive network weights.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Decentralized Contextual Bandits with Network Adaptivity
Decentralized linear bandit algorithms NetLinUCB and Net-SGD-UCB reduce the shared-structure learning cost from O(N) to O(sqrt(N)) via adaptive network weights.