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.
View on arXiv@article{yang2025_2504.15625,
title={ Comprehensive List Generation for Multi-Generator Reranking },
author={ Hailan Yang and Zhenyu Qi and Shuchang Liu and Xiaoyu Yang and Xiaobei Wang and Xiang Li and Lantao Hu and Han Li and Kun Gai },
journal={arXiv preprint arXiv:2504.15625},
year={ 2025 }
}