Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Xu, Zhengrui, Yang, Zhe, Guo, Zhengxiao, Liu, Shukai, Lin, Luocheng, Liu, Xiaoyan, Liu, Yongqi, Li, Han
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2508.07613
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909739340791808
author Xu, Zhengrui
Yang, Zhe
Guo, Zhengxiao
Liu, Shukai
Lin, Luocheng
Liu, Xiaoyan
Liu, Yongqi
Li, Han
author_facet Xu, Zhengrui
Yang, Zhe
Guo, Zhengxiao
Liu, Shukai
Lin, Luocheng
Liu, Xiaoyan
Liu, Yongqi
Li, Han
contents Industrial recommender systems commonly rely on ensemble sorting (ES) to combine predictions from multiple behavioral objectives. Traditionally, this process depends on manually designed nonlinear transformations (e.g., polynomial or exponential functions) and hand-tuned fusion weights to balance competing goals -- an approach that is labor-intensive and frequently suboptimal in achieving Pareto efficiency. In this paper, we propose a novel Unified Monotonic Ranking Ensemble (UMRE) framework to address the limitations of traditional methods in ensemble sorting. UMRE replaces handcrafted transformations with Unconstrained Monotonic Neural Networks (UMNN), which learn expressive, strictly monotonic functions through the integration of positive neural integrals. Subsequently, a lightweight ranking model is employed to fuse the prediction scores, assigning personalized weights to each prediction objective. To balance competing goals, we further introduce a Pareto optimality strategy that adaptively coordinates task weights during training. UMRE eliminates manual tuning, maintains ranking consistency, and achieves fine-grained personalization. Experimental results on two public recommendation datasets (Kuairand and Tenrec) and online A/B tests demonstrate impressive performance and generalization capabilities.
format Preprint
id arxiv_https___arxiv_org_abs_2508_07613
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle UMRE: A Unified Monotonic Transformation for Ranking Ensemble in Recommender Systems
Xu, Zhengrui
Yang, Zhe
Guo, Zhengxiao
Liu, Shukai
Lin, Luocheng
Liu, Xiaoyan
Liu, Yongqi
Li, Han
Information Retrieval
Industrial recommender systems commonly rely on ensemble sorting (ES) to combine predictions from multiple behavioral objectives. Traditionally, this process depends on manually designed nonlinear transformations (e.g., polynomial or exponential functions) and hand-tuned fusion weights to balance competing goals -- an approach that is labor-intensive and frequently suboptimal in achieving Pareto efficiency. In this paper, we propose a novel Unified Monotonic Ranking Ensemble (UMRE) framework to address the limitations of traditional methods in ensemble sorting. UMRE replaces handcrafted transformations with Unconstrained Monotonic Neural Networks (UMNN), which learn expressive, strictly monotonic functions through the integration of positive neural integrals. Subsequently, a lightweight ranking model is employed to fuse the prediction scores, assigning personalized weights to each prediction objective. To balance competing goals, we further introduce a Pareto optimality strategy that adaptively coordinates task weights during training. UMRE eliminates manual tuning, maintains ranking consistency, and achieves fine-grained personalization. Experimental results on two public recommendation datasets (Kuairand and Tenrec) and online A/B tests demonstrate impressive performance and generalization capabilities.
title UMRE: A Unified Monotonic Transformation for Ranking Ensemble in Recommender Systems
topic Information Retrieval
url https://arxiv.org/abs/2508.07613