Alert button
Picture for Tristan Cazenave

Tristan Cazenave

Alert button

On the Consistency of Average Embeddings for Item Recommendation

Aug 30, 2023
Walid Bendada, Guillaume Salha-Galvan, Romain Hennequin, Thomas Bouabça, Tristan Cazenave

A prevalent practice in recommender systems consists in averaging item embeddings to represent users or higher-level concepts in the same embedding space. This paper investigates the relevance of such a practice. For this purpose, we propose an expected precision score, designed to measure the consistency of an average embedding relative to the items used for its construction. We subsequently analyze the mathematical expression of this score in a theoretical setting with specific assumptions, as well as its empirical behavior on real-world data from music streaming services. Our results emphasize that real-world averages are less consistent for recommendation, which paves the way for future research to better align real-world embeddings with assumptions from our theoretical setting.

* 17th ACM Conference on Recommender Systems (RecSys 2023) 
Viaarxiv icon

A Scalable Framework for Automatic Playlist Continuation on Music Streaming Services

Apr 12, 2023
Walid Bendada, Guillaume Salha-Galvan, Thomas Bouabça, Tristan Cazenave

Figure 1 for A Scalable Framework for Automatic Playlist Continuation on Music Streaming Services
Figure 2 for A Scalable Framework for Automatic Playlist Continuation on Music Streaming Services
Figure 3 for A Scalable Framework for Automatic Playlist Continuation on Music Streaming Services
Figure 4 for A Scalable Framework for Automatic Playlist Continuation on Music Streaming Services

Music streaming services often aim to recommend songs for users to extend the playlists they have created on these services. However, extending playlists while preserving their musical characteristics and matching user preferences remains a challenging task, commonly referred to as Automatic Playlist Continuation (APC). Besides, while these services often need to select the best songs to recommend in real-time and among large catalogs with millions of candidates, recent research on APC mainly focused on models with few scalability guarantees and evaluated on relatively small datasets. In this paper, we introduce a general framework to build scalable yet effective APC models for large-scale applications. Based on a represent-then-aggregate strategy, it ensures scalability by design while remaining flexible enough to incorporate a wide range of representation learning and sequence modeling techniques, e.g., based on Transformers. We demonstrate the relevance of this framework through in-depth experimental validation on Spotify's Million Playlist Dataset (MPD), the largest public dataset for APC. We also describe how, in 2022, we successfully leveraged this framework to improve APC in production on Deezer. We report results from a large-scale online A/B test on this service, emphasizing the practical impact of our approach in such a real-world application.

* Accepted as a Full Paper at the SIGIR 2023 conference 
Viaarxiv icon

Towards Tackling MaxSAT by Combining Nested Monte Carlo with Local Search

Feb 26, 2023
Hui Wang, Abdallah Saffidine, Tristan Cazenave

Figure 1 for Towards Tackling MaxSAT by Combining Nested Monte Carlo with Local Search
Figure 2 for Towards Tackling MaxSAT by Combining Nested Monte Carlo with Local Search
Figure 3 for Towards Tackling MaxSAT by Combining Nested Monte Carlo with Local Search
Figure 4 for Towards Tackling MaxSAT by Combining Nested Monte Carlo with Local Search

Recent work proposed the UCTMAXSAT algorithm to address Maximum Satisfiability Problems (MaxSAT) and shown improved performance over pure Stochastic Local Search algorithms (SLS). UCTMAXSAT is based on Monte Carlo Tree Search but it uses SLS instead of purely random playouts. In this work, we introduce two algorithmic variations over UCTMAXSAT. We carry an empirical analysis on MaxSAT benchmarks from recent competitions and establish that both ideas lead to performance improvements. First, a nesting of the tree search inspired by the Nested Monte Carlo Search algorithm is effective on most instance types in the benchmark. Second, we observe that using a static flip limit in SLS, the ideal budget depends heavily on the instance size and we propose to set it dynamically. We show that it is a robust way to achieve comparable performance on a variety of instances without requiring additional tuning.

Viaarxiv icon

Learning to Play Stochastic Two-player Perfect-Information Games without Knowledge

Feb 08, 2023
Quentin Cohen-Solal, Tristan Cazenave

Figure 1 for Learning to Play Stochastic Two-player Perfect-Information Games without Knowledge
Figure 2 for Learning to Play Stochastic Two-player Perfect-Information Games without Knowledge
Figure 3 for Learning to Play Stochastic Two-player Perfect-Information Games without Knowledge
Figure 4 for Learning to Play Stochastic Two-player Perfect-Information Games without Knowledge

In this paper, we extend the Descent framework, which enables learning and planning in the context of two-player games with perfect information, to the framework of stochastic games. We propose two ways of doing this, the first way generalizes the search algorithm, i.e. Descent, to stochastic games and the second way approximates stochastic games by deterministic games. We then evaluate them on the game EinStein wurfelt nicht! against state-of-the-art algorithms: Expectiminimax and Polygames (i.e. the Alpha Zero algorithm). It is our generalization of Descent which obtains the best results. The approximation by deterministic games nevertheless obtains good results, presaging that it could give better results in particular contexts.

Viaarxiv icon

Solving the HP model with Nested Monte Carlo Search

Jan 25, 2023
Milo Roucairol, Tristan Cazenave

Figure 1 for Solving the HP model with Nested Monte Carlo Search
Figure 2 for Solving the HP model with Nested Monte Carlo Search

In this paper we present a new Monte Carlo Search (MCS) algorithm for finding the ground state energy of proteins in the HP-model. We also compare it briefly to other MCS algorithms not usually used on the HP-model and provide an overview of the algorithms used on HP-model. The algorithm presented in this paper does not beat state of the art algorithms, see PERM (Hsu and Grassberger 2011), REMC (Thachuk, Shmygelska, and Hoos 2007) or WLRE (W\"ust and Landau 2012) for better results. Hsu, H.-P.; and Grassberger, P. 2011. A review of Monte Carlo simulations of polymers with PERM. Journal of Statistical Physics, 144 (3): 597 to 637. Thachuk, C.; Shmygelska, A.; and Hoos, H. H. 2007. A replica exchange Monte Carlo algorithm for protein folding in the HP model. BMC Bioinformatics, 8(1): 342. W\"ust, T.; and Landau, D. P. 2012. Optimized Wang-Landau sampling of lattice polymers: Ground state search and folding thermodynamics of HP model proteins. The Journal of Chemical Physics, 137(6): 064903.

* Accepted to AAAI's workshop AI2ASE 2023: 2nd Annual AAAI Workshop on AI to Accelerate Science and Engineering. 6 pages, 1 for references 
Viaarxiv icon

Nested Search versus Limited Discrepancy Search

Oct 01, 2022
Tristan Cazenave

Figure 1 for Nested Search versus Limited Discrepancy Search
Figure 2 for Nested Search versus Limited Discrepancy Search
Figure 3 for Nested Search versus Limited Discrepancy Search
Figure 4 for Nested Search versus Limited Discrepancy Search

Limited Discrepancy Search (LDS) is a popular algorithm to search a state space with a heuristic to order the possible actions. Nested Search (NS) is another algorithm to search a state space with the same heuristic. NS spends more time on the move associated to the best heuristic playout while LDS spends more time on the best heuristic move. They both use similar times for the same level of search. We advocate in this paper that it is often better to follow the best heuristic playout as in NS than to follow the heuristic as in LDS.

Viaarxiv icon

Planning and Learning: A Review of Methods involving Path-Planning for Autonomous Vehicles

Jul 26, 2022
Kevin Osanlou, Christophe Guettier, Tristan Cazenave, Eric Jacopin

Figure 1 for Planning and Learning: A Review of Methods involving Path-Planning for Autonomous Vehicles
Figure 2 for Planning and Learning: A Review of Methods involving Path-Planning for Autonomous Vehicles
Figure 3 for Planning and Learning: A Review of Methods involving Path-Planning for Autonomous Vehicles
Figure 4 for Planning and Learning: A Review of Methods involving Path-Planning for Autonomous Vehicles

This short review aims to make the reader familiar with state-of-the-art works relating to planning, scheduling and learning. First, we study state-of-the-art planning algorithms. We give a brief introduction of neural networks. Then we explore in more detail graph neural networks, a recent variant of neural networks suited for processing graph-structured inputs. We describe briefly the concept of reinforcement learning algorithms and some approaches designed to date. Next, we study some successful approaches combining neural networks for path-planning. Lastly, we focus on temporal planning problems with uncertainty.

Viaarxiv icon

Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search

Jul 04, 2022
Milo Roucairol, Tristan Cazenave

Figure 1 for Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search
Figure 2 for Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search
Figure 3 for Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search
Figure 4 for Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search

We demonstrate how Monte Carlo Search (MCS) algorithms, namely Nested Monte Carlo Search (NMCS) and Nested Rollout Policy Adaptation (NRPA), can be used to build graphs and find counter-examples to spectral graph theory conjectures in minutes. We also refute a conjecture attributed to Peter Shor that was left open.

* 12 pages, figures and pseudocode in appendix 
Viaarxiv icon

Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability using Tree Search and Graph Neural Networks

Mar 30, 2022
Kevin Osanlou, Jeremy Frank, Andrei Bursuc, Tristan Cazenave, Eric Jacopin, Christophe Guettier, J. Benton

Figure 1 for Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability using Tree Search and Graph Neural Networks
Figure 2 for Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability using Tree Search and Graph Neural Networks
Figure 3 for Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability using Tree Search and Graph Neural Networks
Figure 4 for Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability using Tree Search and Graph Neural Networks

Planning under uncertainty is an area of interest in artificial intelligence. We present a novel approach based on tree search and graph machine learning for the scheduling problem known as Disjunctive Temporal Networks with Uncertainty (DTNU). Dynamic Controllability (DC) of DTNUs seeks a reactive scheduling strategy to satisfy temporal constraints in response to uncontrollable action durations. We introduce new semantics for reactive scheduling: Time-based Dynamic Controllability (TDC) and a restricted subset of TDC, R-TDC. We design a tree search algorithm to determine whether or not a DTNU is R-TDC. Moreover, we leverage a graph neural network as a heuristic for tree search guidance. Finally, we conduct experiments on a known benchmark on which we show R-TDC to retain significant completeness with regard to DC, while being faster to prove. This results in the tree search processing fifty percent more DTNU problems in R-TDC than the state-of-the-art DC solver does in DC with the same time budget. We also observe that graph neural network search guidance leads to substantial performance gains on benchmarks of more complex DTNUs, with up to eleven times more problems solved than the baseline tree search.

* Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022  
* Thirty-Sixth AAAI Conference on Artificial Intelligence. This version includes the technical appendix. arXiv admin note: substantial text overlap with arXiv:2108.01068 
Viaarxiv icon