Beyond Greedy Ranking: Slate Optimization via List-CVAE

ICLR 2019 Ray JiangSven GowalTimothy A. MannDanilo J. Rezende

The conventional solution to the recommendation problem greedily ranks individual document candidates by prediction scores. However, this method fails to optimize the slate as a whole, and hence, often struggles to capture biases caused by the page layout and document interdepedencies... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.