跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1199新增论文
+950其中 AI 相关
+132已有论文修订
+97新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 16:53各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-20 16:53库内论文最新更新时间:2026-11-20 02:59

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

28,609 已收录论文23,738 AI 相关8,785 有修订112 HF 社区发现

浏览论文库

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

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
新论文 · v1arXiv:2611.26249

Beyond Covers and Titles: Evidence-First Ranking for Robust Cold-Start Recommendation

Fuyi Wang, Yuxin Cao, Yifan Liao, Renyang Liu, Lin Li, Wei Song

原文摘要

Short-video platforms rank new uploads before anyone has watched them, using content towers that read a video's cover, title and frames. Existing attacks on content-aware recommenders perturb pixels or features and ignore platform re-encoding, and existing defenses train against norm-bounded perturbations that neither match real edits nor preserve recommendation quality. We show with REAP, a realizable attack through {a simulated platform channel (H.264 transcoding, rescaling, cropping and JPEG)}, that packaging edits raise a cold video by 32.0 rank-percentile points in unrelated audiences. We then observe that cold-start ranking does not need the packaging at all: a tower that sees only the video body ranks cold items best. Building on this, we propose Evidence-First Ranking (EFR), which scores cold videos from their body, admits packaging only through a support-gated residual bounded by $γ$, and merges cold and warm rankings by rank percentile, yielding an exact certificate against any packaging edit. On MicroLens-100K, EFR cuts the attack gain by 81% and raises cold-start Recall@100 from 0.1133 to 0.170, while keeping the merged NDCG@10 within 4% of the undefended system.

cs.CV

版本更新 · v2arXiv:2611.24133

Evaluating LIM Trading Agents: A Critical Review of Backtesting Validity and Reporting Practices

Long Xu, Fuyi Wang, Xiaolu Hu, Chao Chen

原文摘要

Large language models (LLMs) are increasingly used in investment research, and many studies report promising historical returns. However, such results are only credible if researchers can demonstrate that the model used only information available at the time, account for how strategies and configurations were selected, and explain how reported returns were generated. We identify six common threats to validity in LLM investment evaluations and apply them to 18 published studies. Across 108 assessments, we find substantial gaps in reporting. No paper fully addresses information timing, model-memory exposure, universe selection, trading costs, or configuration-selection bias. Only four studies provide minimum evidence that results hold across multiple market periods. Our analysis reveals that commonly used safeguards often address different problems than researchers assume. For example, using dated inputs does not guarantee that a pretrained model lacked knowledge of future events, and repeated experimental runs do not correct for strategy-selection bias. We therefore propose an evaluation protocol for future LLM investment research. Rather than judging whether LLMs can generate profits, our study examines whether existing evidence is sufficient to support such claims. We conclude that current reporting practices are generally insufficient for that purpose.

cs.CR

新论文 · v1arXiv:2611.22714

Flexibility Has a Price: Quantifying Modality Policies in Maliciously Secure Multi-Biometric Authentication

Fuyi Wang, Wang Zhang, Neo Xu, Chao Chen, Kok-Leong Ong, Jianying Zhou

原文摘要

Multi-biometric authentication improves robustness and accessibility by combining information from multiple biometric modalities. Existing research has primarily focused on secure multimodal authentication, feature fusion, and recognition performance, while paying comparatively little attention to the security implications of modality-flexible authentication policies. At the same time, most systems provide limited cryptographic protection for biometric data during authentication. This paper addresses both challenges. We first study modality flexibility as a security decision rather than merely a usability feature. Each accepted modality subset creates an authentication entry point, and the resulting risk depends on the joint behavior of all accepted subsets and the attempt budget. We introduce a framework for quantifying this security cost and develop a policy-selection procedure that identifies policies satisfying a target risk level while supporting users who can present only a subset of modalities. We then present SUPERMBA, a two-server privacy-preserving authentication system that enforces the selected policy without revealing biometric templates or the modality subset used in an authentication attempt. The protocol provides verifiable policy enforcement even when one server is malicious and executes the same computation irrespective of the chosen policy or modality subset. Experiments on the three-modality MULB+ dataset show that allowing all modality subsets increases impostor risk from 1.21% for the weakest entry to 4.42% for the union of entries. On VidTIMIT, the increase is substantially smaller and is not statistically resolved with the available identities. SUPERMBA completes an authentication attempt in only 6.42 ms on MULB+ and 6.03 ms on VidTIMIT.

cs.CR