Revisiting Clustering of Neural Bandits: Selective Reinitialization for Mitigating Loss of Plasticity
Not on the map. Why?
Abstract (arXiv)
Clustering of Bandits (CB) methods enhance sequential decision-making by grouping bandits into clusters based on similarity and incorporating cluster-level contextual information, demonstrating effectiveness and adaptability in applications like personalized streaming recommendations. However, when extending CB algorithms to their neural version (commonly referred to as Clustering of Neural Bandits, or CNB), they suffer from loss of plasticity, where neural network parameters become rigid and less adaptable over time, limiting their ability to adapt to non-stationary environments (e.g., dynamic user preferences in recommendation). To address this challenge, we propose Selective Reinitialization (SeRe), a novel bandit learning framework that dynamically preserves the adaptability of CNB algorithms in evolving environments. SeRe leverages a contribution utility metric to identify and selectively reset underutilized units, mitigating loss of plasticity while maintaining stable knowledge retention. Furthermore, when combining SeRe with CNB algorithms, the adaptive change detection mechanism adjusts the reinitialization frequency according to the degree of non-stationarity, ensuring effective adaptation without unnecessary resets. Theoretically, we prove that SeRe enables sublinear cumulative regret in piecewise-stationary environments, outperforming traditional CNB approaches in long-term performances. Extensive experiments on six real-world recommendation datasets demonstrate that SeRe-enhanced CNB algorithms can effectively mitigate the loss of plasticity with lower regrets, improving adaptability and robustness in dynamic settings.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 41 of its 73 references that are in the map. First posted on arXiv 14 Jun 2025.
Builds on
41 of 73 references.
References · 41
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2017Continual Learning with Deep Generative Replaycited by 1,158
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 742
- 2024Bridging Language and Items for Retrieval and Recommendation: Benchmarking LLMs as Semantic Encoderscited by 224
- 2013Finite-Time Analysis of Kernelised Contextual Banditscited by 177
- 2020Neural Thompson Samplingcited by 128
- 2023Loss of Plasticity in Continual Deep Reinforcement Learningcited by 121
- 2014Online Clustering of Banditscited by 102
- 2014Best-Arm Identification in Linear Banditscited by 100
29 more
- 2022KuaiRec: A Fully-observed Dataset and Insights for Evaluating Recommender Systemscited by 96
- 2020Neural Contextual Bandits with Deep Representation and Shallow Explorationcited by 71
- 2016Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradientcited by 66
- 2023Maintaining Plasticity in Continual Learning via Regenerative Regularizationcited by 65
- 2019Generalization Error Bounds of Gradient Descent for Learning Over-parameterized Deep ReLU Networkscited by 60
- 2021A Simple Approach for Non-stationary Linear Banditscited by 54
- 2016Distributed Clustering of Linear Bandits in Peer to Peer Networkscited by 50
- 2016On Context-Dependent Clustering of Banditscited by 44
- 2020Latent Bandits Revisitedcited by 44
- 2021EE-Net: Exploitation-Exploration Neural Networks in Contextual Banditscited by 44
- 2023Maintaining Plasticity in Deep Continual Learningcited by 43
- 2021Neural Contextual Bandits without Regretcited by 40
- 2019Improved Algorithm on Online Clustering of Banditscited by 38
- 2019Continual Learning with Adaptive Weights (CLAW)cited by 38
- 2020Dynamic Regret of Policy Optimization in Non-stationary Environmentscited by 33
- 2021Local Clustering in Contextual Multi-Armed Banditscited by 29
- 2023Continual Learning via Sequential Function-Space Variational Inferencecited by 29
- 2017Online Clustering of Contextual Cascading Banditscited by 24
- 2022Learning Neural Contextual Bandits Through Perturbed Rewardscited by 17
- 2019Context-Based Dynamic Pricing with Online Clusteringcited by 14
- 2022Meta-Learning with Less Forgetting on Large-Scale Non-Stationary Task Distributionscited by 14
- 2023Online Clustering of Bandits with Misspecified User Modelscited by 12
- 2022Improved Algorithms for Neural Active Learningcited by 11
- 2021On Dynamic Pricing with Covariatescited by 10
- 2022Federated Online Clustering of Banditscited by 10
- 2023HyperBandit: Contextual Bandit with Hypernewtork for Time-Varying User Preferences in Streaming Recommendationcited by 10
- 2024Neural Active Learning Beyond Banditscited by 10
- 2024Meta Clustering of Neural Banditscited by 7
- 2022Reward Imputation with Sketching for Contextual Batched Banditscited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.