Comprehensive List Generation for Multi-Generator Reranking
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909588421345280 |
|---|---|
| author | Yang, Hailan Qi, Zhenyu Liu, Shuchang Yang, Xiaoyu Wang, Xiaobei Li, Xiang Hu, Lantao Li, Han Gai, Kun |
| author_facet | Yang, Hailan Qi, Zhenyu Liu, Shuchang Yang, Xiaoyu Wang, Xiaobei Li, Xiang Hu, Lantao Li, Han Gai, Kun |
| contents | Reranking models solve the final recommendation lists that best fulfill users' demands. While existing solutions focus on finding parametric models that approximate optimal policies, recent approaches find that it is better to generate multiple lists to compete for a ``pass'' ticket from an evaluator, where the evaluator serves as the supervisor who accurately estimates the performance of the candidate lists. In this work, we show that we can achieve a more efficient and effective list proposal with a multi-generator framework and provide empirical evidence on two public datasets and online A/B tests. More importantly, we verify that the effectiveness of a generator is closely related to how much it complements the views of other generators with sufficiently different rerankings, which derives the metric of list comprehensiveness. With this intuition, we design an automatic complementary generator-finding framework that learns a policy that simultaneously aligns the users' preferences and maximizes the list comprehensiveness metric. The experimental results indicate that the proposed framework can further improve the multi-generator reranking performance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_15625 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Comprehensive List Generation for Multi-Generator Reranking Yang, Hailan Qi, Zhenyu Liu, Shuchang Yang, Xiaoyu Wang, Xiaobei Li, Xiang Hu, Lantao Li, Han Gai, Kun Information Retrieval H.3.3 Reranking models solve the final recommendation lists that best fulfill users' demands. While existing solutions focus on finding parametric models that approximate optimal policies, recent approaches find that it is better to generate multiple lists to compete for a ``pass'' ticket from an evaluator, where the evaluator serves as the supervisor who accurately estimates the performance of the candidate lists. In this work, we show that we can achieve a more efficient and effective list proposal with a multi-generator framework and provide empirical evidence on two public datasets and online A/B tests. More importantly, we verify that the effectiveness of a generator is closely related to how much it complements the views of other generators with sufficiently different rerankings, which derives the metric of list comprehensiveness. With this intuition, we design an automatic complementary generator-finding framework that learns a policy that simultaneously aligns the users' preferences and maximizes the list comprehensiveness metric. The experimental results indicate that the proposed framework can further improve the multi-generator reranking performance. |
| title | Comprehensive List Generation for Multi-Generator Reranking |
| topic | Information Retrieval H.3.3 |
| url | https://arxiv.org/abs/2504.15625 |