Metraipolis › archive › dc_be4ae8876867
EvoRank: LLM-Guided Evolution of Multi-Objective Learning-to-Rank Pipelines — arXiv:2609.22196
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.22196
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:50:24.152Z
- SHA-256 of the archived text
0379a776221b7fc1af1fece589c1bd65e5738b1f4e00f8a4cbff73a245ad92c6- Stable URL of this page
https://metraipolis.com/documento/dc_be4ae8876867
How to cite
EvoRank: LLM-Guided Evolution of Multi-Objective Learning-to-Rank Pipelines — arXiv:2609.22196 — arXiv (en), https://arxiv.org/abs/2609.22196 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_be4ae8876867 (Metraipolis archive dc_be4ae8876867, sha256 0379a776221b7fc1af1fece589c1bd65e5738b1f4e00f8a4cbff73a245ad92c6)
BibTeX
@misc{dcbe4ae8876867,
title = {EvoRank: LLM-Guided Evolution of Multi-Objective Learning-to-Rank Pipelines — arXiv:2609.22196},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.22196},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_be4ae8876867; sha256 0379a776221b7fc1af1fece589c1bd65e5738b1f4e00f8a4cbff73a245ad92c6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22196. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present EvoRank, an open autonomous ranking engineer: an LLM-guided evolutionary loop that discovers complete Learning-to-Rank pipelines (features, models, losses, ensembles) for multi-objective e-commerce search. On the Expedia ICDM 2013 dataset, with relevance, conversion, and revenue as competing objectives, three independent runs each converge within 50 iterations (about ten dollars) on interpretable pipelines that beat an Optuna-tuned LambdaMART on 60k held-out queries, an advantage that persists at full data scale and places in the top 6 percent of the original competition. A first campaign, evolving only training objectives, builds the central design rule: it appeared to work on its selection fold (the small dataset it uses to pick winners) while a transfer audit, re-scoring winners on held-out data, showed the gains were almost entirely fitness noise (the randomness of its own scoring), and neither seeded domain knowledge nor richer diagnostic feedback changed what transferred. The deciding quantity is measurable in advance: search-space headroom relative to fitness noise. We package this as a headroom gate that predicts, before any LLM spend, whether the loop will pay off, and we release the system, the auditing tools, and a catalog of failure modes with their guardrails, so teams can apply the procedure to their own ranking stacks. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-22 in cs.CL). Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Neural and Evolutionary Computing (cs.NE). Pagina del lavoro: https://arxiv.org/abs/2609.22196 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T06:48:45.093Z dalla pagina https://arxiv.org/catchup/cs.CL/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).