REVIEW 1 cited by
Improved Algorithm on Online Clustering of Bandits
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We generalize the setting of online clustering of bandits by allowing non-uniform distribution over user frequencies. A more efficient algorithm is proposed with simple set structures to represent clusters. We prove a regret bound for the new algorithm which is free of the minimal frequency over users. The experiments on both synthetic and real datasets consistently show the advantage of the new algorithm over existing methods.
Forward citations
Cited by 1 Pith paper
-
Heterogeneous Multi-agent Multi-armed Bandits on Stochastic Block Models
A cluster-aware multi-agent bandit algorithm achieves O((C/M) log T) regret by aggregating information within clusters and communicating only between clusters, improving on the O(M^2 log T) bound of fully heterogeneou...
Discussion (0). Continue with ORCID to comment.