The paper introduces Signals and Queries (S&Q), a lightweight first-stage relevance filter for LLM agents that removes at least 30% of candidate policies before downstream evaluation while maintaining high recall. S&Q uses offline-generated activating examples and hard negatives to train a logistic classifier that predicts policy relevance via embeddings and vector dot products, eliminating per-turn LLM calls. Evaluated on 9,144 relevance labels across 254 conversation prefixes and 36 airline policies, S&Q outperforms top‑K and cosine‑threshold retrieval in precision at every recall level, consistently across two embedding providers.
By Yam Marcovitz
Merchant risk control at large payment platforms screens tens of millions of merchants daily, where false positives harm legitimate merchants and false negatives leave harmful activity undetected. The hardest cases require jointly understanding a merchant's textual profile and long behavioral sequence.
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).
By Congfei Zhang, Jingxiao Ma, Xiaodong Liu, Hsiang-wei Chao, Siman Wang, Ge Liu, Shantanu Aggarwal, Vincent Zhang, Meghana Missula, Rachel Liao, Zichu Li, Xiao Bai, Yunzhi Zhou, Yajun Wang, Zhe Liu, Jinchao Li, Yu Zhang
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.
By Ji Xin, Xiao Xiao, Ishan Bhatt, Vinesh Gudla, Trace Levinson, Raochuan Fan, Shishir Kumar Prasad, Prakash Putta, Tejaswi Tenneti
arXiv:2607. 20528v1 Announce Type: new Abstract: Online recommendation platforms increasingly use Large Language Models (LLMs) to extract structured features from ad creatives.
By Sebastian Koralewski, Merwan Barlier, Yulia Stolin, Bla\v{z} \v{S}krlj
arXiv:2610.14550v1 Announce Type: cross
Abstract: Dynamic Product Advertising (DPA) retrieval systems are a core component of modern e-commerce advertising; however, their evaluation remains challeng...
By Wen Zhang, Xiao Bai, Hsiang-wei Chao, Mengfan Zhu, Tong Zhao, Mingxuan Ju, Xiaodong Liu, Congfei Zhang, Yunzhi Zhou, Yajun Wang, Jinchao Li, Yu Zhang
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. 29606v1 Announce Type: cross Abstract: A fundamental challenge of vector search is achieving consistently high recall while minimizing computational costs.
By Hakan Ferhatosmanoglu, Kushal Kumar, Tal Wagner, Andy Warfield
arXiv:2609.23646v1 Announce Type: cross
Abstract: E-commerce search requires distinguishing products that are merely related to a query from those that directly satisfy the user's shopping intent. We...
By Girish A. Koushik, Swapnil Bhosale, Samarth Agrawal, Hadeel Sadany, Constantin Orasan, Xiatian Zhu, Diptesh Kanojia
arXiv:2607. 22690v1 Announce Type: new Abstract: Long-term memory lets LLM agents reuse past interactions, but raw dialogue histories are verbose and information-sparse.
By Jing Yu, Yibo Zhao, Jiaming Zhang, Xiang Li
arXiv:2605. 25475v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) are increasingly expected to operate over long contexts, yet standard softmax attention incurs a KV cache that grows linearly with sequence length, quickly becoming the bottleneck for long context inference.
By Xintong Yang, Hao Gu, Binxing Xu, Lujun Li, Bei Liu, Jiacheng Liu, Qiyuan Zhu, Yike Guo, Sirui Han
arXiv:2602. 10238v2 Announce Type: replace-cross Abstract: The growing size of Large Language Models (LLMs) makes efficient inference challenging, primarily due to the memory demands of the autoregressive Key-Value (KV) cache.
By Luca Moschella, Laura Manduchi, Ozan Sener