Paul Missault
Research Subjects
Research Interests
Paul Missault has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Badr Abdallaoui
Amazon, Luxembourg, LUXEMBOURG
1 shared publication - Ekaterina Trimbach
EPFL, Lausanne, Vaud, Switzerland
1 shared publication - Filippo Betello
Sapienza University of Rome, Rome, Italy
1 shared publication - Maarten Buyl
Ghent University, Ghent, Belgium
1 shared publication - Maryna Beliuha
Amazon, Luxembourg, LUXEMBOURG
1 shared publication - Pierre-Antoine Sondag
Amazon, Luxembourg, LUXEMBOURG
1 shared publication
Latest Publications
- Open Access
- 25 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 8089-8106
Your LLM Has a Passport: Investigating Brand Origin Geographic Bias in E-Commerce Rankings
- 25 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 8089-8106
Open AccessYour LLM Has a Passport: Investigating Brand Origin Geographic Bias in E-Commerce Rankings
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 2536-2544
Cost-Efficiency Trade-offs for Neural Cascade Rankers in Web Search
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 2536-2544
Open AccessCost-Efficiency Trade-offs for Neural Cascade Rankers in Web Search
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 3762-3773
RankFormer: Listwise Learning-to-Rank Using Listwide Labels
Web applications where users are presented with a limited selection of items have long employed ranking models to put the most relevant results first. Any feedback received from users is typically assumed to reflect a relative judgement on the utility of items, e.g. a user clicking on an item only implies it is better than items not clicked in the same ranked list. Hence, the objectives optimized in Learning-to-Rank (LTR) tend to be pairwise or listwise. Yet, by only viewing feedback as relative, we neglect the user's absolute feedback on the list's overall quality, e.g. when no items in the selection are clicked. We thus reconsider the standard LTR paradigm and argue the benefits of learning from this listwide signal. To this end, we propose the RankFormer as an architecture that, with a Transformer at its core, can jointly optimize a novel listwide assessment objective and a traditional listwise LTR objective. We simulate implicit feedback on public datasets and observe that the RankFormer succeeds in benefitting from listwide signals. Additionally, we conduct experiments in e-commerce on Amazon Search data and find the RankFormer to be superior to all baselines offline. An online experiment shows that knowledge distillation can be used to find immediate practical use for the RankFormer.
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 3762-3773
Open AccessRankFormer: Listwise Learning-to-Rank Using Listwide Labels
Web applications where users are presented with a limited selection of items have long employed ranking models to put the most relevant results first. Any feedback received from users is typically assumed to reflect a relative judgement on the utility of items, e.g. a user clicking on an item only implies it is better than items not clicked in the same ranked list. Hence, the objectives optimized in Learning-to-Rank (LTR) tend to be pairwise or listwise. Yet, by only viewing feedback as relative, we neglect the user's absolute feedback on the list's overall quality, e.g. when no items in the selection are clicked. We thus reconsider the standard LTR paradigm and argue the benefits of learning from this listwide signal. To this end, we propose the RankFormer as an architecture that, with a Transformer at its core, can jointly optimize a novel listwide assessment objective and a traditional listwise LTR objective. We simulate implicit feedback on public datasets and observe that the RankFormer succeeds in benefitting from listwide signals. Additionally, we conduct experiments in e-commerce on Amazon Search data and find the RankFormer to be superior to all baselines offline. An online experiment shows that knowledge distillation can be used to find immediate practical use for the RankFormer.