Large-scale industrial recommender systems are usually confronted with
computational problems due to the enormous corpus size. To retrieve and
recommend the most relevant items to users under response time limits,
resorting to an efficient index structure is an effective and practical
solution. The previous work Tree-based Deep Model (TDM) \cite{zhu2018learning}
greatly improves recommendation accuracy using tree index. By indexing items in
a tree hierarchy and training a user-node preference prediction model
satisfying a max-heap like property in the tree, TDM provides logarithmic
computational complexity w.r.t. the corpus size, enabling the use of arbitrary
advanced models in candidate retrieval and recommendation.
In tree-based recommendation methods, the quality of both the tree index and
the user-node preference prediction model determines the recommendation
accuracy for the most part. We argue that the learning of tree index and
preference model has interdependence. Our purpose, in this paper, is to develop
a method to jointly learn the index structure and user preference prediction
model. In our proposed joint optimization framework, the learning of index and
user preference prediction model are carried out under a unified performance
measure. Besides, we come up with a novel hierarchical user preference
representation utilizing the tree index hierarchy. Experimental evaluations
with two large-scale real-world datasets show that the proposed method improves
recommendation accuracy significantly. Online A/B test results at a display
advertising platform also demonstrate the effectiveness of the proposed method
in production environments.

本文提出了一种联合优化的框架来学习树形推荐模型的索引结构和用户偏好预测模型，利用树形结构提出了一种新的用户偏好表示方法，针对大规模实际数据进行了实验验证，并在显示广告平台的在线 A/B 测试中证明了方法的有效性。