LLM-based User-Product Relevance Evaluation for Dynamic Product Advertising
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
The Flow has not summarised this story yet — read it at arXiv AI.
arXiv:2607. 23121v1 Announce Type: cross Abstract: Dynamic Product Ads (DPA) require retrieving relevant items from multi-million product catalogs, balancing two competing objectives: retargeting (re-surfacing known interests) and prospecting (discovering new categories).
arXiv:2607. 27172v1 Announce Type: cross Abstract: Traditional search systems are optimized to retrieve items that strictly match a query, often prioritizing precision over recall.
Traditional search systems are optimized to retrieve items that strictly match a query, often prioritizing precision over recall. In e-commerce marketplaces and particularly grocery, this paradigm is limiting, as user satisfaction and commercial outcomes depend heavily on the discoverability of substitute, complementary, and thematically related items.
arXiv:2607. 03886v1 Announce Type: cross Abstract: Sponsored search plays a crucial role as a revenue stream for search engines, wherein advertisers competitively bid on keywords that align with the users' search queries.
arXiv:2602. 23234v4 Announce Type: replace-cross Abstract: Large-scale commercial search systems optimize for relevance to drive successful sessions that help users find what they are looking for.
The paper introduces Mine and Refine, a two‑stage contrastive training framework designed to improve embedding‑based retrieval for large‑scale e‑commerce search. It tackles graded relevance, hard‑sample mining, and unstable similarity separability by using a lightweight LLM as a scalable labeler and a multi‑level circle loss to enforce margin‑controlled separation across relevance levels. The method has been deployed in production across multiple product verticals, yielding statistically significant increases in user engagement, gross order value, and retrieval relevance metrics.