跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 06:41 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-22 06:41最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

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

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 06:39(北京时间)
新论文 · v1arXiv:2611.19742

Exploration of Reinforcement Learning in Generative Recommendation Models

Pengfei Zheng, Wuchao Li, Shiyao Wang, Honghui Bao, Hongyi Xie, Jiaxin Deng, Xingmei Wang, Jinghao Zhang 等 14 位作者

原文摘要

Traditional cascaded recommender systems balance accuracy and efficiency over large item spaces, but misaligned stage-wise objectives hinder end-to-end optimization. Generative recommendation unifies these stages in an autoregressive framework, providing a natural interface for reinforcement learning (RL) to optimize the entire generation process. However, directly applying RL often leads to unstable optimization and degraded recommendation quality. We revisit Group Relative Policy Optimization (GRPO) and other ratio-based objectives through a unified logit-gradient view. We identify three issues: (i) clipped surrogates create dead-gradient regions, under-utilizing samples; (ii) negative-advantage updates can become effectively unbounded as importance ratios grow, allowing a small subset of negatives to dominate optimization; and (iii) ratio-based control lacks sensitivity to absolute policy confidence, so updates on high-confidence cases may fail to vanish. Motivated by this diagnosis, we propose \emph{Gradient-Bounded Policy Optimization} (GBPO), a simple objective with stop-gradient normalization that is simultaneously (a) fully gradient-active, (b) sign-symmetrically bounded for both positive and negative updates, and (c) explicitly confidence-weighted under current policy probabilities. This ensures that updates gracefully vanish for $π\!\to\!1$ positives and $π\!\to\!0$ negatives. Across the evaluated settings, GBPO achieves competitive recommendation performance with more stable training than competing RL methods.

cs.LG · cs.AI

版本更新 · v2arXiv:2610.09737

Mosquito acoustic identification at unseen recording sites: practical limits of common transfer remedies for vector surveillance

Yucheng Gong, Rui Zhou, Binbin Zeng, Qiang Ren, Hongjin Hui

原文摘要

Passive acoustic monitoring could widen mosquito surveillance, but a classifier trained under one set of recording conditions often fails when moved to a new site, device or enclosure. On a nine-species, five-condition corpus of about 271,000 recordings, the published baseline identifies species at 0.881 balanced accuracy under conditions it has seen and 0.175 under held-out ones. Using that corpus's leave-domain protocol, we asked which transfer strategy is most reliable when a program brings a new site online. Using fixed features from a pre-trained bioacoustic model and a small classifier improved held-out-condition balanced accuracy to 0.305, without updating backbone weights and in minutes of training per site. Four widely used additions did not improve transfer: rebalancing training across recording conditions, fine-tuning the backbone and fusing a weaker second modality each reduced accuracy, and a six-term objective reduced to a single alignment term. Rebalancing reversed direction across four encoders, helping weak representations and harming strong ones. Genus-level aggregation was more accurate than species-level classification (about 0.50 against 0.30), suggesting genus-level screening may be the more realistic operating point here. These results come from one corpus under one protocol, and are dataset-bounded guidance rather than validated general rules.

eess.AS · cs.LG