Exploring Large Action Sets with Hyperspherical Embeddings using von Mises-Fisher Sampling
Not on the map. Why?
Abstract (arXiv)
This paper introduces von Mises-Fisher exploration (vMF-exp), a scalable method for exploring large action sets in reinforcement learning problems where hyperspherical embedding vectors represent these actions. vMF-exp involves initially sampling a state embedding representation using a von Mises-Fisher distribution, then exploring this representation's nearest neighbors, which scales to virtually unlimited numbers of candidate actions. We show that, under theoretical assumptions, vMF-exp asymptotically maintains the same probability of exploring each action as Boltzmann Exploration (B-exp), a popular alternative that, nonetheless, suffers from scalability issues as it requires computing softmax values for each action. Consequently, vMF-exp serves as a scalable alternative to B-exp for exploring large action sets with hyperspherical embeddings. Experiments on simulated data, real-world public data, and the successful large-scale deployment of vMF-exp on the recommender system of a global music streaming service empirically validate the key properties of the proposed method.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 32 of its 66 references that are in the map. First posted on arXiv 1 Jul 2025.
Builds on
32 of 66 references.
References · 32
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2017Billion-scale similarity search with GPUscited by 2,477
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
- 2019Introduction to Multi-Armed Banditscited by 475
- 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
- 2021Reinforcement learning based recommender systems: A surveycited by 187
- 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 181
- 2020Reward-Free Exploration for Reinforcement Learningcited by 177
- 2015Deep Reinforcement Learning in Large Discrete Action Spacescited by 158
- 2022Exploration in Deep Reinforcement Learning: A Surveycited by 158
- 2018ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithmscited by 130
20 more
- 2017Boltzmann Exploration Done Rightcited by 69
- 2021A Survey of Exploration Methods in Reinforcement Learningcited by 68
- 2017Current Challenges and Visions in Music Recommender Systems Researchcited by 42
- 2022Guarantees for Epsilon-Greedy Reinforcement Learning with Function Approximationcited by 29
- 2020Carousel Personalization in Music Streaming Apps with Contextual Banditscited by 25
- 2022Modularity-Aware Graph Autoencoders for Joint Community Detection and Link Predictioncited by 22
- 2021A Semi-Personalized System for User Cold Start Recommendation on Music Streaming Appscited by 21
- 2023Latent Exploration for Reinforcement Learningcited by 21
- 2024Results of the Big ANN: NeurIPS'23 competitioncited by 21
- 2018Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Datacited by 20
- 2023Adap-τ: Adaptively Modulating Embedding Magnitude for Recommendationcited by 19
- 2022Flow Moods: Recommending Music by Moods on Deezercited by 11
- 2018An Analysis of Approaches Taken in the ACM RecSys Challenge 2018 for Automatic Music Playlist Continuationcited by 9
- 2023A Scalable Framework for Automatic Playlist Continuation on Music Streaming Servicescited by 7
- 2023Track Mix Generation on Music Streaming Services using Transformerscited by 6
- 2024Let's Get It Started: Fostering the Discoverability of New Releases on Deezercited by 5
- 2023Test Time Embedding Normalization for Popularity Bias Mitigationcited by 4
- 2023Automatic Music Playlist Generation via Simulation-based Reinforcement Learningcited by 4
- 2023Of Spiky SVDs and Music Recommendationcited by 1
- 2024vMFER: Von Mises-Fisher Experience Resampling Based on Uncertainty of Gradient Directions for Policy Improvementcited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.