跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1680新增论文
+1333其中 AI 相关
+187已有论文修订
+59新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-17 23:35各信源进度 →

统计口径与数据新鲜度

统计 2026-11-17 10:02 — 2026-11-18 10:02(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-17 23:35库内论文最新更新时间:2026-11-17 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

25,786 已收录论文21,491 AI 相关7,725 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
版本更新 · v4arXiv:2602.23530

Unified Ranking Across Retrieval Channels: A Large-Scale E-Commerce Approach

Aditya Gaydhani, Guangyue Xu, Dhanush Kamath, Ankit Singh, Alex Fengjie Li

原文摘要

Large-scale e-commerce search and recommendation systems rely on multiple specialized retrieval channels to surface diverse products, each optimized for a distinct objective. A key challenge is merging candidates from these heterogeneous channels into a single ranked list under strict latency constraints while optimizing business KPIs such as user conversion. Static rank-fusion methods such as Reciprocal Rank Fusion (RRF) and Weighted Interleaving use the same fusion behavior across queries, limiting their ability to adapt to context or model interactions among channel signals. We reformulate multi-channel fusion as a channel-aware learning-to-rank problem and propose a unified ranking model trained on a scalar, funnel-weighted graded-relevance label that combines clicks, add-to-carts, and purchases. The model incorporates channel-specific scores together with recent aggregate query-item behavior to capture near-term population demand. The evaluated channel set combines conventional relevance retrieval with query-conditioned, recommendation-oriented channels emphasizing newness, trending demand, regional relevance, and seasonality. A randomized online experiment shows a 2.85% increase in user conversion over the deployed weighted-interleaving control. The model achieves a p95 reranking-stage latency below 50 ms and has been deployed on Target.com.

cs.IR

版本更新 · v3arXiv:2310.02226Google Research

Think before you speak: Training Language Models With Pause Tokens

Sachin Goyal, Ziwei Ji, Ankit Singh Rawat, Aditya Krishna Menon, Sanjiv Kumar, Vaishnavh Nagarajan

原文摘要

Language models generate responses by producing a series of tokens in immediate succession: the $(K+1)^{th}$ token is an outcome of manipulating $K$ hidden vectors per layer, one vector per preceding token. What if instead we were to let the model manipulate say, $K+10$ hidden vectors, before it outputs the $(K+1)^{th}$ token? We operationalize this idea by performing training and inference on language models with a (learnable) $\textit{pause}$ token, a sequence of which is appended to the input prefix. We then delay extracting the model's outputs until the last pause token is seen, thereby allowing the model to process extra computation before committing to an answer. We empirically evaluate $\textit{pause-training}$ on decoder-only models of 1B and 130M parameters with causal pretraining on C4, and on downstream tasks covering reasoning, question-answering, general understanding and fact recall. Our main finding is that inference-time delays show gains when the model is both pre-trained and finetuned with delays. For the 1B model, we witness gains on 8 of 9 tasks, most prominently, a gain of $18\%$ EM score on the QA task of SQuAD, $8\%$ on CommonSenseQA and $1\%$ accuracy on the reasoning task of GSM8k. Our work raises a range of conceptual and practical future research questions on making delayed next-token prediction a widely applicable new paradigm.

cs.CL · cs.AI · cs.LG