paper-with-me

홈 › Papers

Controllable Multi-Objective Re-ranking with Policy Hypernetworks

2023-06-08 · Sirui Chen, YuAn Wang, Zijing Wen, Zhiyu Li, Changshuo Zhang, Xiao Zhang, Quan Lin, Cheng Zhu, Jun Xu

Multi-stage ranking pipelines have become widely used strategies in modern recommender systems, where the final stage aims to return a ranked list of items that balances a number of requirements such as user preference, diversity, novelty etc. Linear scalarization is arguably the most widely used technique to merge multiple requirements into one optimization objective, by summing up the requirements with certain preference weights. Existing final-stage ranking methods often adopt a static model where the preference weights are determined during offline training and kept unchanged during online serving. Whenever a modification of the preference weights is needed, the model has to be re-trained, which is time and resources inefficient. Meanwhile, the most appropriate weights may vary greatly for different groups of targeting users or at different time periods (e.g., during holiday promotions). In this paper, we propose a framework called controllable multi-objective re-ranking (CMR) which incorporates a hypernetwork to generate parameters for a re-ranking model according to different preference weights. In this way, CMR is enabled to adapt the preference weights according to the environment changes in an online manner, without retraining the models. Moreover, we classify practical business-oriented tasks into four main categories and seamlessly incorporate them in a new proposed re-ranking model based on an Actor-Evaluator framework, which serves as a reliable real-world testbed for CMR. Offline experiments based on the dataset collected from Taobao App showed that CMR improved several popular re-ranking models by using them as underlying models. Online A/B tests also demonstrated the effectiveness and trustworthiness of CMR.

📄 PDF Abstract BibTeX arXiv:2306.05118

Code (1)

lyingcs/controllable-multi-objective-reranking 공식 구현 tf

Tasks

Recommendation SystemsRe-Ranking

Methods 이 논문이 사용한 방법론

HyperNetwork A HyperNetwork is a network that generates weights for a main network. The behavior of the main network is the same with any usual neural network: it learns to map some raw…

Similar Papers 제목 키워드 기반

A Taxation Perspective for Fair Re-ranking

2024-04-27 · Chen Xu, Xiaopeng Ye, Wenjie Wang, Liang Pang 외

Fair re-ranking aims to redistribute ranking slots among items more equitably to ensure responsibility and ethics. The exploration of redistribution problems has a long history in economics, offering valuable insights fo…

EthicsFairnessRe-Ranking

A Framework for Controllable Multi-objective Learning with Annealed Stein Variational Hypernetworks

2025-06-07 · Minh-Duc Nguyen, Dung D. Le

Pareto Set Learning (PSL) is popular as an efficient approach to obtaining the complete optimal solution in Multi-objective Learning (MOL). A set of optimal solutions approximates the Pareto set, and its mapping is a set…

Multi-Task Learning

HyperMARL: Adaptive Hypernetworks for Multi-Agent RL

2024-12-05 · Kale-ab Abebe Tessera, Arrasy Rahman, Amos Storkey, Stefano V. Albrecht

Adaptability to specialised or homogeneous behaviours is critical in cooperative multi-agent reinforcement learning (MARL). Parameter sharing (PS) techniques, common for efficient adaptation, often limit behavioural dive…

DiversityMulti-agent Reinforcement Learning

Hyper-GoalNet: Goal-Conditioned Manipulation Policy Learning with HyperNetworks

2025-11-26 · Pei Zhou, Wanting Yao, Qian Luo, Xunzhe Zhou 외 arxiv

Goal-conditioned policy learning for robotic manipulation presents significant challenges in maintaining performance across diverse objectives and environments. We introduce Hyper-GoalNet, a framework that generates task…

A Two-Phase Adaptive Balanced Penalty Method for Controllable Pareto Front Learning under Split Feasibility Conditions

2026-05-19 · Nguyen Viet Hoang, Dung D. Le, Tran Ngoc Thang arxiv

We address the open problem of training hypernetworks for Controllable Pareto Front Learning (CPFL) under split feasibility conditions with rigorous theoretical guarantees. We reformulate the constrained Pareto problem a…

Multi-Task Learning