Exact-K Recommendation via Maximal Clique Optimization

05/17/2019
by   Yu Gong, et al.
0

This paper targets to a novel but practical recommendation problem named exact-K recommendation. It is different from traditional top-K recommendation, as it focuses more on (constrained) combinatorial optimization which will optimize to recommend a whole set of K items called card, rather than ranking optimization which assumes that "better" items should be put into top positions. Thus we take the first step to give a formal problem definition, and innovatively reduce it to Maximum Clique Optimization based on graph. To tackle this specific combinatorial optimization problem which is NP-hard, we propose Graph Attention Networks (GAttN) with a Multi-head Self-attention encoder and a decoder with attention mechanism. It can end-to-end learn the joint distribution of the K items and generate an optimal card rather than rank individual items by prediction scores. Then we propose Reinforcement Learning from Demonstrations (RLfD) which combines the advantages in behavior cloning and reinforcement learning, making it sufficient- and-efficient to train the model. Extensive experiments on three datasets demonstrate the effectiveness of our proposed GAttN with RLfD method, it outperforms several strong baselines with a relative improvement of 7.7 Ratio respectively, and achieves state-of-the-art (SOTA) performance for the exact-K recommendation problem.

READ FULL TEXT
research
11/29/2016

Neural Combinatorial Optimization with Reinforcement Learning

This paper presents a framework to tackle combinatorial optimization pro...
research
07/05/2021

Learning Delaunay Triangulation using Self-attention and Domain Knowledge

Delaunay triangulation is a well-known geometric combinatorial optimizat...
research
05/27/2019

Minimizing Time-to-Rank: A Learning and Recommendation Approach

Consider the following problem faced by an online voting platform: A use...
research
03/03/2023

Tile Networks: Learning Optimal Geometric Layout for Whole-page Recommendation

Finding optimal configurations in a geometric space is a key challenge i...
research
09/24/2021

Adversarial Neural Trip Recommendation

Trip recommender system, which targets at recommending a trip consisting...
research
12/08/2020

Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem

We address the Traveling Salesman Problem (TSP), a famous NP-hard combin...
research
07/08/2022

Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems

TSP is a classical NP-hard combinatorial optimization problem with many ...

Please sign up or login with your details

Forgot password? Click here to reset