跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

采集已暂停
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+1新增 AI 导读

arXiv 最近完成扫描:等待完成 · 全站最近入库:2026-11-02 00:39各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:尚未完成最近发现新增版本:2026-11-02 00:39库内论文最新更新时间:2026-10-30 01:59

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

8,677 已收录论文7,675 AI 相关1,866 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。

找到 1 篇论文 · 按版本更新时间排序等待首次采集
新论文 · v1arXiv:2610.36267

Preserving rare-item recall under a storage budget: quantization, distillation, and the limits of teacher fidelity

Han Chen, Yingrui Li

Under a fixed embedding-storage budget, recommenders can use a small full-precision model, a distilled student, or a higher-rank low-precision model. We asked which choice preserves rare-item recall and whether teacher fidelity reflects it in seven dataset-backbone cells: matrix factorization on Gowalla, Last.fm, Amazon Video Games, Steam, Goodbooks-10k and MovieLens-20M, and LightGCN on Amazon Video Games. Seven candidates fit in 168 bytes per user or item row: 40-dimensional Bayesian personalized ranking (BPR), two 40-dimensional unbiased knowledge distillation (UnKD) students, and factorizations of a 300-dimensional teacher's scores at ranks 40, 80, 155 and 300, stored in 32, 16, 8 and 4 bits. Each test set was evaluated once after fixing candidates and confirmatory analyses. The rank-300 4-bit factorization used 13% of teacher storage and retained 95-103% of its tail recall@20 and 93-97% of its NDCG@20 in every cell. The rank-40 factorization had the lowest tail recall in every cell; the 4-bit factorization had 1.2-12.7 times its tail recall and 0.99-1.46 times its NDCG. UnKD students retained 56-102% of teacher tail recall. In all ten prespecified comparisons across five prospective-expansion cells, the 4-bit factorization had higher tail recall, with simultaneous 95% intervals excluding zero. Teacher-hit retention, the share of the teacher's relevant tail hits also found by a model, ordered 23 of 147 candidate pairs differently from tail recall and identified the wrong tail-recall leader in 3 of 7 cells: models can find relevant tail items the teacher misses. In these cells, spending bytes on rank rather than precision preserved rare-item recall at 7.5 times the arithmetic per score. Compressed recommenders should be judged by total tail recall, not teacher fidelity alone.

尚无 AI 解读,展示原文摘要

cs.IR
arXiv ↗PDF ↗