Artificial Intelligence · 31.08.2026, 06:17 UTC
Mine and Refine: Optimizing Graded Relevance in E-commerce Semantic Search Retrieval
| Schweregrad | info |
|---|---|
| Kategorie | Artificial Intelligence |
| Quelle | arXiv cs.LG ↗ |
| Veröffentlicht | 31.08.2026 UTC |
Sicherheitsmeldung mit Schweregrad noch nicht bewertet. Technische Details im Tab „Originaltext“; empfohlene Schritte in der Checkliste.
arXiv:2602.17654v2 Announce Type: replace-cross Abstract: Embedding-based retrieval (EBR) for large-scale e-commerce search faces three intertwined challenges: graded (non-binary) relevance where engagement signals are noisy and intent-varying while business relevance guidelines admit acceptable-but-not-exact matches, false negatives in hard sample mining, and unstable similarity score separability across relevance levels, the last of which complicates hybrid search score fusion and downstream ranking. We propose Mine and Refine, a two-stage contrastive training framework that addresses all three. A lightweight LLM, fine-tuned with engagement-driven audit, serves as a guideline-aligned scalable labeler throughout training. Stage 1 establishes a robust global embedding space via label-aware supervised contrastive learning; Stage 2 mines hard samples, re-annotates them with the LLM labeler to mitigate spurious negatives, and refines the model through a multi-level extension of circle loss that enforces margin-controlled separation across relevance levels. Deployed in production e-commerce search across multiple product verticals, the approach delivers statistically significant lifts in user engagement and gross order value, and substantially improves retrieval and end-to-end relevance metrics.
Maßnahmen
⬇ Als MarkdownVerwandte Beiträge
- info TreeGraft: Adaptive Multi-Drafter Grafting for Tree-Based Speculative Decoding
- info Overview of SHROOM-Visions 2026: A Shared Task on Hallucination Detection in Large Vision-Language Models
- info One Form to Transfer Them All: Pretraining Multilingual Language Models Beyond Native Orthography
- info MathAdv: What Theorem Provers Know, Reason, Formalize, and Generalize