Dmitrii Moor
Research Subjects
Research Interests
Dmitrii Moor has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Mounia Lalmas
Spotify, London, United Kingdom
4 shared publications - Zhenwen Dai
Spotify, London, United Kingdom
3 shared publications - Kyle Kretschman
Spotify, NYC, NY, USA
2 shared publications - Alice Wang
Spotify, New York, NY, USA
1 shared publication - Ben Carterette
Spotify, New York, USA
1 shared publication - Denis Beslic
Spotify, New York, USA
1 shared publication
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 3775-3786
Stochastic Primal-Dual Decoding for Multiobjective Generative Recommender Systems
Recent advances in recommender systems (RS) have shown substantial performance gains through generative modelling. In practice, recommendation often involves constructing slates--ordered lists of items--that must satisfy multiple objectives beyond relevance, such as constraints defined over item attributes or fairness constraints. Existing multiobjective approaches either rely on post-processing techniques designed for non-generative settings, or incorporate auxiliary objectives directly into model training. The former does not explicitly account for the sequential nature of generative RS, while the latter is often impractical in large-scale systems. We propose a lightweight, inference-time decoding layer that augments autoregressive generative RS to support multiobjective slate generation without modifying or retraining the underlying model. We formulate decoding as an online constrained optimisation problem, where items are selected sequentially, and trade-offs between relevance and auxiliary objectives are adjusted dynamically based on the remaining constraint slack, i.e., how much of each objective remains to be satisfied. This is implemented via a stochastic primal-dual approximation scheme that balances relevance and auxiliary objectives during generation. We provide theoretical guarantees on constraint violation and regret, and evaluate the proposed approach through extensive offline experiments and a large-scale online A/B experiment in a real-world recommender system. Our results show consistent improvements in multiobjective trade-offs, including a +1.8% gain in the auxiliary objectives achieved at zero cost to user satisfaction.
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 3775-3786
Open AccessStochastic Primal-Dual Decoding for Multiobjective Generative Recommender Systems
Recent advances in recommender systems (RS) have shown substantial performance gains through generative modelling. In practice, recommendation often involves constructing slates--ordered lists of items--that must satisfy multiple objectives beyond relevance, such as constraints defined over item attributes or fairness constraints. Existing multiobjective approaches either rely on post-processing techniques designed for non-generative settings, or incorporate auxiliary objectives directly into model training. The former does not explicitly account for the sequential nature of generative RS, while the latter is often impractical in large-scale systems. We propose a lightweight, inference-time decoding layer that augments autoregressive generative RS to support multiobjective slate generation without modifying or retraining the underlying model. We formulate decoding as an online constrained optimisation problem, where items are selected sequentially, and trade-offs between relevance and auxiliary objectives are adjusted dynamically based on the remaining constraint slack, i.e., how much of each objective remains to be satisfied. This is implemented via a stochastic primal-dual approximation scheme that balances relevance and auxiliary objectives during generation. We provide theoretical guarantees on constraint violation and regret, and evaluate the proposed approach through extensive offline experiments and a large-scale online A/B experiment in a real-world recommender system. Our results show consistent improvements in multiobjective trade-offs, including a +1.8% gain in the auxiliary objectives achieved at zero cost to user satisfaction.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2159-2168
Learning Optimal Personalised Reservation Prices in Impression Ad Auctions with Mixture Density Networks
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2159-2168
Open AccessLearning Optimal Personalised Reservation Prices in Impression Ad Auctions with Mixture Density Networks
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 2138-2149
Optimising Budget Management via Primal-Dual Approximation with Constrained Polynomial Weights Update
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 2138-2149
Open AccessOptimising Budget Management via Primal-Dual Approximation with Constrained Polynomial Weights Update
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 4759-4765
Exploiting Sequential Music Preferences via Optimisation-Based Sequencing
Users in music streaming platforms typically consume tracks sequentially in sessions by interacting with personalised playlists. To satisfy users, music platforms usually rely on recommender systems that learn users' preferences over individual tracks and rank the tracks within each playlist according to the learned preferences. However, such rankings often do not fully exploit the sequential nature of the users' consumption, which may result in a lower within-a-session consumption. In this paper, we model the sequential within-a-session preferences of users and propose an optimisation-based sequencing approach that allows for optimally incorporating such preferences into the rankings. To this end, we rely on interaction data of a major music streaming service to identify two most common aspects of the users' sequential preferences: (1) Position-Aware preferences, and (2) Local-Sequential preferences. We propose a sequencing model that can leverage each of these aspects optimally to maximise the expected total consumption from the session. We further perform an extensive offline and off-policy evaluation of our model, and carry out a large scale online randomised control trial with 7M users across 80 countries. Our findings confirm that we can effectively incorporate sequential preferences of users into our sequencer to make users complete more and skip less tracks within their listening sessions.
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 4759-4765
Open AccessExploiting Sequential Music Preferences via Optimisation-Based Sequencing
Users in music streaming platforms typically consume tracks sequentially in sessions by interacting with personalised playlists. To satisfy users, music platforms usually rely on recommender systems that learn users' preferences over individual tracks and rank the tracks within each playlist according to the learned preferences. However, such rankings often do not fully exploit the sequential nature of the users' consumption, which may result in a lower within-a-session consumption. In this paper, we model the sequential within-a-session preferences of users and propose an optimisation-based sequencing approach that allows for optimally incorporating such preferences into the rankings. To this end, we rely on interaction data of a major music streaming service to identify two most common aspects of the users' sequential preferences: (1) Position-Aware preferences, and (2) Local-Sequential preferences. We propose a sequencing model that can leverage each of these aspects optimally to maximise the expected total consumption from the session. We further perform an extensive offline and off-policy evaluation of our model, and carry out a large scale online randomised control trial with 7M users across 80 countries. Our findings confirm that we can effectively incorporate sequential preferences of users into our sequencer to make users complete more and skip less tracks within their listening sessions.