Towards Principled Learning for Re-ranking in Recommender Systems

April 05, 2025 Β· Declared Dead Β· πŸ› Annual International ACM SIGIR Conference on Research and Development in Information Retrieval

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Qunwei Li, Linghui Li, Jianbin Lin, Wenliang Zhong arXiv ID 2504.04188 Category cs.IR: Information Retrieval Cross-listed cs.LG Citations 1 Venue Annual International ACM SIGIR Conference on Research and Development in Information Retrieval Last Checked 4 months ago
Abstract
As the final stage of recommender systems, re-ranking presents ordered item lists to users that best match their interests. It plays such a critical role and has become a trending research topic with much attention from both academia and industry. Recent advances of re-ranking are focused on attentive listwise modeling of interactions and mutual influences among items to be re-ranked. However, principles to guide the learning process of a re-ranker, and to measure the quality of the output of the re-ranker, have been always missing. In this paper, we study such principles to learn a good re-ranker. Two principles are proposed, including convergence consistency and adversarial consistency. These two principles can be applied in the learning of a generic re-ranker and improve its performance. We validate such a finding by various baseline methods over different datasets.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted