跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

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

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

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

全站更新概况

+1151新增论文
+896其中 AI 相关
+86已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-07 07:03 · 全站最近入库:2026-11-06 13:12各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-07 07:03最近发现新增版本:2026-11-06 13:12库内论文最新更新时间:2026-11-06 02:59

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

17,100 已收录论文14,661 AI 相关4,055 有修订112 HF 社区发现

浏览论文库

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

找到 4 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-07 07:01(北京时间)
新论文 · v1arXiv:2611.05799

Item Representations Matter: Bridging Hard Semantic IDs and Soft Prototype Mixtures for Generative Retrieval

Vicente Balmaseda, Dongqi Fu, Jiarui Feng, Ren chen, Hanqing Zeng, Tianxin Wei, Yinglong Xia, Tianbao Yang 等 9 位作者

Modern recommender systems rely on generative retrieval techniques to predict the next item either as discrete codes or as a continuous vector. On the one hand, Semantic IDs (SIDs) give discrete models shared parameters and pretrained semantic structure, but discretizing items into hard codes discards some information from the original content embeddings. On the other hand, continuous models avoid quantization, yet typically use flat item lookup tables with no explicit parameter tying across items. We ask whether a continuous recommender can introduce shared structure without making it a discrete bottleneck. We propose CAP-Mix, a flow recommender that represents each item as a soft mixture of shared prototypes plus an item-specific vector. The assignments, prototypes, and item vectors are trained jointly, and the soft representation is retained at inference. Pretrained information is optional: SID responsibilities can serve as a prior over assignments, while a full content embedding can initialize the item-specific vector without changing the initial flat table. In matched comparisons on three datasets, CAP-Mix improves over a flat table on the two sparse Amazon datasets and yields a small gain on Steam when trained without pretrained information. Given only an offline SID, it outperforms a hard table built from the same tokenizer by 4.45-14.90% in HR@5. Given the full content embedding, it matches or improves a strong flat table while hard assignments regress on the sparse Amazon datasets. Overall, averaged across six benchmarks, CAP-Mix improves HR@5 and NDCG@5 by 6.9% and 13.6% relative to the best evaluated baseline for each dataset and metric, while delivering 1.4-161x the inference throughput of the discrete baselines in our experiments.

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

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

BLPO: Beyond-Local Policy Optimization for Long-Horizon LLM Agents

Xuanren Chen, Chongyang Tao, Wenpeng Hu, Yong Wang, Bo Deng, Xinlei Zheng, Shuai Ma

Long-horizon tasks require large language model (LLM) agents to coordinate interdependent actions, a capability central to automating complex workflows. Stepwise group-based reinforcement learning provides finer credit than trajectory-level supervision, but reliable comparisons must account for differences in interaction history. Enforcing this consistency within the limited rollouts of each task can leave insufficient support for estimating action preferences. We propose Beyond-Local Policy Optimization (BLPO), which estimates task-progress advantages from experience shared across tasks and training updates. We summarize trajectory prefixes into task-progress states and abstract actions by their function, allowing corresponding decisions from different tasks to contribute to shared estimates. To control bias and noise from heterogeneous tasks, we accumulate context-relative returns in a global memory with balanced aggregation and reliability weighting. These global advantages complement local comparisons over normalized actions and trajectory-level credit without a learned critic or additional rollouts. Experiments on ALFWorld and WebShop with 1.5B and 7B policies show improved task success over the evaluated baselines under matched training budgets. Further analyses show faster learning and shorter trajectories with little computational overhead.

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

cs.AI
arXiv ↗PDF ↗
新论文 · v1arXiv:2610.37083

Design and Architecture of Airmod: An Active Noise Cancellation and Deep Learning System for Real-Time Respiratory Rate Estimation from Tracheal Sounds

Shang-Ran Huang, Fu-Shun Hsu, Ji-Chang Huang, Chuan Chen, Shou-Zen Fan, Chang-Fu Su, Eng-Che Huang, Yuan-Ren Cheng

Tracheal auscultation is recommended by clinical practice guidelines, and required by some U.S. state regulations, for monitoring ventilation during procedural sedation and monitored anesthesia care. However, continuous auscultation with a conventional stethoscope is impractical, susceptible to ambient noise, and difficult to interpret. We developed the Artificial Intelligence Respiratory MOnitoring Device (Airmod), an FDA-cleared software as a medical device (510(k) K242798) that continuously monitors tracheal sounds and estimates breath-to-breath respiratory rate in real time. In this paper, we describe its software architecture and key processing modules. Ambient noise is suppressed by active noise control, using a normalized least-mean-square adaptive filter with a dual-microphone electronic stethoscope. A multiclass convolutional bidirectional gated recurrent unit (CNN-BiGRU) model detects inhalations and exhalations in 15-s inference windows. It was trained on HF_Tracheal_V2, a new database of 373 continuous tracheal sound recordings (8,521 min; 107,644 labeled inhalations) from 369 subjects under sedation. To handle continuous acoustic streaming, Airmod runs inference on overlapping 15-s windows. It refines the detected inhalations by removing incomplete events, low-energy false positives, and double counts, concatenates them into a history list, and estimates respiratory rate from the mean period of the last three breaths. On the test set, at the default 2-s prediction interval with refinement enabled, inhalation detection achieved a sensitivity of 0.828, a positive predictive value of 0.832, and an F1-score of 0.830. Airmod also broadcasts the noise-cancelled tracheal sound and displays a real-time spectrogram to help clinicians recognize respiratory abnormalities.

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

cs.SD
arXiv ↗PDF ↗
首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.874ACL Anthology · ACL 2026

FACTrial: Factorized Clinical Contrastive Training for Scalable Patient-Trial Retrieval

Xuanren Chen Beijing University of Aeronautics and Astronautics, Chongyang Tao Beihang University, Tao Shen Oracle, Shuai Ma Beihang University

Patient–trial retrieval is a challenging problem that requires nuanced clinical reasoning beyond surface-level semantic similarity. However, scarce and costly relevance annotations force existing approaches to rely on very limited supervision or zero-shot transfer, reducing the task to generic semantic matching and failing to capture multi-factor eligibility reasoning. To this end, we propose FACTrial, a factorized contrastive training framework that leverages LLMs to synthesize diagnosis-aware supervision for scalable patient–trial retrieval. FACTrial decomposes each patient note into a primary diagnosis and a set of concomitant, eligibility-triggering conditions, and constructs complementary contrastive signals through structured trial augmentation. Specifically, we generate primary-target and concomitant-target positives, together with clinically confusable near-miss negatives, to enforce diagnostic specificity under contrastive learning. Two specialized bi-encoder experts are trained to balance primary-diagnosis prioritization and concomitant-driven recall, and fused into a single deployable retriever. Experiments on three public benchmarks demonstrate that FACTrial achieves state-of-the-art performance, improving both top-ranked quality and high-recall coverage.

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

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表

ACL Anthology · ACL 2026 ↗PDF ↗