mlsanityData to 14 Oct 2026

Controllable Multi-Objective Re-ranking with Policy Hypernetworks

arXiv 2306.05118 ↗First posted 8 Jun 2023cs.IRcited by 15

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Jun 2023.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 5; 2025: 4; 2026: 4.

15 papers.

Sort:

By area:

  1. 2025Bone Soups: A Seek-and-Soup Model Merging Approach for Controllable Multi-Objective Generationcited by 14
  2. 2024A Survey of Controllable Learning: Methods and Applications in Information Retrievalcited by 12
  3. 2023HyperBandit: Contextual Bandit with Hypernewtork for Time-Varying User Preferences in Streaming Recommendationcited by 10
  4. 2025Interactive Recommendation Agent with Active User Commandscited by 10
  5. 2025KuaiLive: A Real-time Interactive Dataset for Live Streaming Recommendationcited by 7
  6. 2024COS-DPO: Conditioned One-Shot Multi-Objective Fine-Tuning Frameworkcited by 5
  7. 2024A Hyper-Transformer model for Controllable Pareto Front Learning with Split Feasibility Constraintscited by 3
  8. 2025A Comprehensive Review on Harnessing Large Language Models to Overcome Recommender System Challengescited by 3
  9. 2024UOEP: User-Oriented Exploration Policy for Enhancing Long-Term User Experiences in Recommender Systemscited by 2
  10. 2023Impression-Aware Recommender Systemscited by 1
  11. 2026Enhancing Bandit Algorithms with LLMs for Time-varying User Preferences in Streaming Recommendationscited by 1
  12. 2026GenRecEdit: Adapting Model Editing for Generative Recommendation with Cold-Start Itemscited by 1
3 more
  1. 2026Transition-Matrix Regularization for Next Dialogue Act Prediction in Counselling Conversationscited by 1
  2. 2024Do Not Wait: Learning Re-Ranking Model Without User Feedback At Serving Time in E-Commercecited by 0
  3. 2026A Production-Ready RL Framework for Personalized Utility Tuning with Pareto Sweeping in Pinterest Recommender Systemscited by 0