ZooWork-ShopRanker: An Open, Preference-Aligned E-Commerce Reranker

Siqiao Xue, Shuxuan Liu, Ning Hu

ZooWork Team

Published September 25, 2026 · on the feed September 28, 2026 · ▲ 3 · arXiv 2609.31002

The abstract

Open rerankers trained for general web retrieval transfer imperfectly to e-commerce, where ranking decisions depend not only on topical relevance but also on user preferences, product constraints, and comparative product fit. These preference signals are difficult to supervise at scale: real search traffic provides authentic queries and candidates but no clean pairwise labels. We present ZooWork-ShopRanker, a family of e-commerce rerankers (0.6B, 4B, and 8B) aligned to judge-labeled shopping preference. Training pairs are labeled by a panel of reasoning large language models (LLMs) from different families acting as a preference oracle, with position-debiased judgments and agreement tiers, and the rerankers are trained on these labels. The aligned 8B flagship then serves as a distillation teacher for the efficient 4B and 0.6B models, which are fit to its scores and sharpened on judged pairs. To measure progress, we introduce ShopRank-Bench, a contamination-limited benchmark of ~10,000 private-traffic preference pairs in both text formats, tiered by how many judge families committed to each label. ZooWork-ShopRanker-8B and -4B significantly outperform the strongest open reranker baseline, every model significantly beats its own un-aligned base, and ZooWork-ShopRanker-0.6B beats its size peer; the gains hold in both formats and extend to common MTEB benchmarks. We release the models and the dual-format ShopRank-Bench to facilitate further research.

The Brief

2:23

A short podcast summary of the paper. Written and voiced by AI.

Transcript

ZooWork-ShopRanker. An Open, Preference-Aligned E-Commerce Reranker. By Siqiao Xue and two others, from the ZooWork Team. Published on the twenty-fifth of September. No code repository is linked to it.

ZooWork-ShopRanker is a family of open rerankers built for e-commerce search, released together with a benchmark called ShopRank-Bench. The motivation is a transfer problem. Open rerankers trained for general web retrieval carry over imperfectly to shopping, because there a ranking decision depends not only on topical relevance, but also on user preferences, product constraints, and how well one product fits compared with another. Those preference signals are difficult to supervise at scale. Real search traffic supplies authentic queries and candidates, but no clean pairwise labels saying which product is the better one.

The family comes in three sizes: zero point six billion, four billion, and eight billion. Each is aligned to judge-labeled shopping preference. ShopRank-Bench is a contamination-limited benchmark of about ten thousand preference pairs taken from private traffic. It comes in two text formats, and its pairs are tiered by how many judge families committed to each label, so a pair every family agreed on can be told apart from one where fewer did.

The labels come from a panel of reasoning large language models, drawn from different families and acting together as a preference oracle. Their judgments are position-debiased and sorted into agreement tiers, and the rerankers are trained on those labels. The aligned eight billion flagship then serves as a distillation teacher. The four billion model and the zero point six billion model are fit to its scores, and then sharpened on judged pairs.

On the benchmark, the eight billion and four billion versions significantly outperform the strongest open reranker baseline. Every model in the family significantly beats its own un-aligned base, and the zero point six billion model beats its size peer. The gains hold in both formats, and they extend to common MTEB benchmarks. Anyone building product search on open components gets rerankers at three sizes, the smaller two described as efficient, and a benchmark that measures shopping preference rather than topic alone.

The design choice at the center is who decides what a better product is. Real traffic supplies the questions but not the answers, so the answers come from a panel of models from different families, with their level of agreement recorded rather than assumed. The models and the dual-format ShopRank-Bench are both released to support further research.

Paper Quest · 7 chapters · about 40 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

Relevant is not the same as right. That gap is where this story starts.

You run search for an online shop. Retrieval finds plausible products, and a reranker decides which best satisfies the shopper.

The road ahead

  1. 1 · The problem ~6 min Open rerankers pick the product closest in topic, but shoppers need the one that fits their budget, recipient and needs, and nobody labels that.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~9 min Several reasoning language models from different families judge product pairs in both orders; agreement grades the labels, and the biggest trained model teaches the smaller ones.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Label pairs with a cross-family judge panel, train the 8B on them, distil it into the 4B and 0.6B, then sharpen those on judged pairs.
  6. 6 · The experiment ~6 min You’ll guess: Which ZooWork-ShopRanker sizes significantly outperformed the strongest open reranker baseline on ShopRank-Bench?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.