Ze Liu

Ze Liu

Auto-generated profile, based on publicly available information

Ze Liu

School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 December 2025 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
ZLZe Liu
Ze Liu
JZJin Zhang
Jin Zhang
DLDefu Lian
Defu Lian
CFChao Feng
Chao Feng
JWJie Wang
Jie Wang
ECEnhong Chen
Enhong Chen
With the advancement of deep learning, deep recommendation models have achieved remarkable improvements in recommendation accuracy. However, due to the large number of candidate items in practice and the high cost of preference computation, these methods still suffer from low recommendation efficiency. The recently proposed tree-based deep recommendation models alleviate the problem by directly learning tree structure and representations under the guidance of recommendation objectives. To guarantee the effectiveness of beam search for recommendation accuracy, these models strive to ensure that the tree adheres to the max-heap assumption, where a parent node’s preference should be the maximum among its children’s preferences. However, they employ a one-versus-all strategy, framing the training task as a series of independent binary classification objectives for each node, which limits their ability to fully satisfy the max-heap assumption. To this end, we propose a Deep Tree-based Retriever (DTR for short) for efficient recommendation. DTR frames the training task as a softmax-based multi-class classification over tree nodes at the same level, enabling explicit horizontal competition and more discriminative top-k selection among them, which mimics the beam search behavior during training. To mitigate the suboptimality induced by the labeling of non-leaf nodes, we propose a rectification method for the loss function, which further aligns with the max-heap assumption in expectation. As the number of tree nodes grows exponentially with the levels, we employ sampled softmax to approximate optimization and thereby enhance efficiency. Furthermore, we propose a tree-based sampling method to reduce the bias inherent in sampled softmax. Theoretical results reveal DTR’s generalization capability, and both the rectification method and tree-based sampling contribute to improved generalization. The experiments are conducted on four real-world datasets, validating the effectiveness of the proposed method.

20 July 2025
Verified
Conference Paper
Open access
YPYuanhao Pu
Yuanhao Pu
DLDefu Lian
Defu Lian
XCXiaolong Chen
Xiaolong Chen
JCJin Chen
Jin Chen
ZLZe Liu
Ze Liu
ECEnhong Chen
Enhong Chen