跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序等待首次采集
版本更新 · v2arXiv:2607.28070

CCFormer: Efficient Cross-Field Interaction and Hierarchical Sequence Compression for Industrial Recommendation at Tencent

Yunlong Wang, Huizhe Zhang, Haonan Hu, Yudong Li, Bing Wen, Jianchao Tu, Chengxiang Zhuo, Zang Li

Industrial candidate-ranking systems must combine long user behavior histories with heterogeneous user and item features under strict computational budgets. We propose CCFormer, a structured interaction architecture that separates cross-field retrieval from intra-history modeling. Feature-field-separated cross-attention allows user and target queries to read an evolving history hierarchy, while local subspace token mixing contextualizes history tokens independently of candidate targets. Hierarchical sequence compression reduces the number of history tokens and provides multi-scale historical context for subsequent interactions. Experiments on two public benchmarks show higher mean AUC than the evaluated baselines, while experiments on a large-scale industrial dataset show a favorable accuracy-compute trade-off and higher training throughput than HSTU. Online A/B tests across four recommendation and advertising scenarios report system-level improvements of up to 3.57% in click-through rate, 3.86% in page views, and 1.71% in advertising revenue relative to the corresponding production baselines. CCFormer has been fully deployed in all four scenarios, demonstrating its practical scalability and effectiveness in large-scale recommendation systems.

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

cs.IR
arXiv ↗PDF ↗
新论文 · v1arXiv:2610.34688

From Speech Tokens to Stolen Voices: Attacker-Chosen-Text Speaker Impersonation via Representation Inversion

Ye Lu, Shen Wang, Runze Liu, Zhitao Ou, Haonan Huang, Yihan Yan, Fanghui Sun, Zhaoyang Zhang

Speech interaction systems have gradually evolved from traditional cascaded systems that use text as intermediate information to end-to-end speech language models that directly process speech representations. In some applications, the speech frontend runs on the user's device and sends speech representations to a remote server for inference, while the original audio remains local. However, these representations may still contain speaker identity information. If an attacker obtains them, it may use this information to imitate the user's voice, threatening their voice privacy. To investigate this risk, we propose \stia, a Speech Token Inversion Attack that generates speech with attacker-specified text in a victim's voice using a single short leaked representation, without access to the original audio or its transcript. Specifically, \stia converts discrete, continuous, or mixed speech representations into conditioning sequences and trains a conditional flow-matching speech generation model using pairs of different utterances from the same speaker in public speech datasets. The model combines speaker characteristics contained in the leaked representation with the specified text to generate speech in the victim's voice. Experiments show that, with a Moshi representation leak corresponding to 3 seconds of speech, \stia achieves an average CAM++ speaker cosine similarity of 0.78 and a target-text word error rate of 3.80\%. These results show that speech frontend representations reveal reusable speaker identity information and highlight the need to consider privacy risks when designing speech frontend representation methods.

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

cs.SD · cs.AI · cs.CR · cs.CV · cs.MM
arXiv ↗PDF ↗