3 papers
cs.LG2026
Online Learning with Recency: Algorithms for Sliding-window Streaming Multi-armed Bandits
Vladimir Braverman, Chen Wang, Liudeng Wang +1
Motivated by the recency effect in online learning, we study algorithms for single-pass *sliding-window streaming multi-armed bandits (MABs)* in this paper. In this setting, we are…
cs.DS2026
Distributed Algorithms for Euclidean Clustering
Vincent Cohen-Addad, Liudeng Wang, David P. Woodruff +1
We study the problem of constructing -coresets for Euclidean -clustering in the distributed setting, where data points are partitioned across sites.…
cs.DS2025
Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
Vincent Cohen-Addad, Liudeng Wang, David P. Woodruff +1
We show that both clustering and subspace embeddings can be performed in the streaming model with the same asymptotic efficiency as in the central/offline setting. For -clu…