activity
20152025
most citedOptimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search

14 citations · 52 across the 23 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

cs.IR2023★ 1 cited

On the Consistency of Average Embeddings for Item Recommendation

Walid Bendada, Guillaume Salha-Galvan, Romain Hennequin +2

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 t…

cs.IR2023★ 13 cited

A Scalable Framework for Automatic Playlist Continuation on Music Streaming Services

Walid Bendada, Guillaume Salha-Galvan, Thomas Bouabça +1

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 mus…

cs.AI2023★ 1 cited

Towards Tackling MaxSAT by Combining Nested Monte Carlo with Local Search

Hui Wang, Abdallah Saffidine, Tristan Cazenave

Recent work proposed the UCTMAXSAT algorithm to address Maximum Satisfiability Problems (MaxSAT) and shown improved performance over pure Stochastic Local Search algorithms (SLS).…

cs.AI2023

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

Quentin Cohen-Solal, Tristan Cazenave

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 game…

cs.AI2023

Solving the HP model with Nested Monte Carlo Search

Milo Roucairol, Tristan Cazenave

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 algorithm…