跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1084新增论文
+883其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-18 19:45库内论文最新更新时间:2026-11-18 08:00

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

26,870 已收录论文22,374 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

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

找到 5 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
新论文 · v1arXiv:2611.13714

TRUER: Test-Time Reward Correction Using an Error-Aware Rectifier for Reinforcement Learning

Mingxiang Shen, Jinhao Li, Jiaming Xu, Yibo Han, Guohao Dai, Yijia Zhang, Ningyi Xu

原文摘要

Test-time reinforcement learning enables language models to adapt using rewards derived from their own answers. However, majority voting can reinforce incorrect solutions even when correct alternatives are available. Our training audit shows that false positives (incorrect responses receiving positive rewards) dominate reward errors. We focus on a practical regime where ground-truth rewards are difficult to obtain at scale, while a limited labeled source set is available. We introduce TRUER, a framework that uses limited supervision to train a reward rectifier that distinguishes correctness from consensus. To achieve this goal, we train the rectifier with an emphasis on incorrect majorities and correct minorities, targeting cases where consensus and correctness disagree. After that, we freeze the rectifier and use it to correct rewards during subsequent test-time adaptation. By improving reward accuracy and thereby model performance, TRUER consistently outperforms naive TTRL in both metrics across all evaluated configurations.

cs.LG

新论文 · v1arXiv:2611.10714

Permute-then-Adapt: Weak-to-Strong Contrastive Image-Text Adaptation

Jinhao Li, Sarah Erfani, Lei Feng, Guangrui Li, James Bailey, Feng Liu

原文摘要

Image-text alignment models such as CLIP are typically trained with contrastive learning, where unpaired examples are treated as strict negatives. While this assumption introduces noise by penalising semantically related pairs, existing solutions often rely on heuristic similarity thresholds that lack statistical grounding and sensitivity to dataset-specific noise distributions. In this paper, we propose Permute-then-Adapt (PTA), a framework that leverages efficient weak models to identify missed positives while controlling Type-I error relative to a conditional permutation reference, up to calibration approximation error. Unlike standard distillation or arbitrary thresholding, PTA estimates a random-pairing reference distribution from the weak teacher's similarity scores and uses its upper tail, determined by $α$, to select auxiliary positives. The calibrated positive set is then trained against by a single multi-positive contrastive objective: each anchor maximises the total probability mass it assigns to its positive set. Offline calibration with the weak model adds negligible training overhead. Experiments show gains over heuristic soft-label approaches in object recognition, cross-modal retrieval, and data efficiency. Project repository: https://github.com/JinhaoLee/Permute-then-Adapt.

cs.CV

新论文 · v1arXiv:2610.38160

ATI-OPD: Adaptive Teacher Intervention for Stable Long-Sequence On-Policy Distillation

Jiannan Guan, Youxin Jiang, Yutai Hou, Qiguang Chen, Yirong Zeng, Haitao Wang, Dengyun Peng, Zheng Yan 等 12 位作者

原文摘要

On-policy distillation (OPD) trains a student on its own responses using token-level feedback from a teacher. As responses grow longer, the student's prefix can depart from the teacher's own reasoning, weakening its feedback on later tokens. Updates based on this feedback can reinforce the same deviations in later responses and destabilize training. Prior approaches such as length control and loss reweighting limit learning from problematic responses but leave their prefixes unchanged. Fixed cutoffs can also discard later reasoning. We propose \textbf{Adaptive Teacher Intervention for On-Policy Distillation (ATI-OPD)} to improve subsequent teacher guidance by revising the student's reasoning prefix. ATI-OPD replaces the earliest high-disagreement segment with a short teacher segment, then lets the student resume its own reasoning from the revised text. To handle renewed disagreement, it excludes persistently divergent suffixes from the distillation loss while retaining useful student continuation. Training diagnostics show less teacher-student disagreement, fewer gradient spikes, and fewer extremely long responses. Across five mathematical reasoning benchmarks and two teacher-student pairs, ATI-OPD improves average student-only accuracy over standard OPD.

cs.CL

新论文 · v1arXiv:2610.37280

Modeling Preference Dependencies with Directed Acyclic Graphs for Narrative-Driven Recommendation

Mingzhe Lu, Jian Qin, Ruize Qin, Jinhao Liu, Yunpeng Li, Hang Su

原文摘要

Narrative-driven recommendation allows users to express multifaceted needs through free-form text where stated preferences naturally qualify and condition one another. Existing methods typically treat narratives as flat keyword combinations or unconstrained generative queries, failing to capture how complex preferences hierarchically refine and contextualize each other. We propose the Preference Dependency Graph Framework (PDG-F), a narrative-driven recommendation framework centered on explicit preference dependencies. Specifically, PDG-A (PDG-Agent) first parses unstructured requests to organize user preferences and their mutual qualifications into a directed acyclic Preference Dependency Graph (PDG). Through this graph, candidate evidence from the open Web is acquired via directed path retrieval, and final recommendations are determined by topological path ranking. Comprehensive experiments across three diverse domains spanning English and Chinese contexts confirm that PDG-F consistently achieves superior recommendation performance over competitive baselines, open-domain retrieval agents, and frontier language models. Further diagnostic analyses show that our dependency-guided retrieval markedly raises the attainable candidate-pool ceiling, demonstrating the fundamental value of modeling preference dependencies in narrative-driven recommendation.

cs.IR · cs.CL

版本更新 · v2arXiv:2608.00643

Domain Decoupling Attack: Exploiting the Validation Gap Between Protective DNS and Shared Edge Routing

Weizhe Wang, Minhong Dong, Jinhao Li, Lyuchuan Wei, Yao Zhang, Qiang Hu, Qi Guo, Guangquan Xu 等 9 位作者

原文摘要

Command-and-control, data transfer, and censorship circumvention can hide in traffic to widely used services. DNS-bound access control grants permits based on resolved IP addresses, while shared edges route requests by tenant identity, creating a validation gap. An attacker can resolve an allowed anchor, obtain a permit for its shared edge address, and access a hidden tenant by presenting the tenant's name as both SNI and HTTP Host. To investigate this gap, we present the Domain Decoupling Attack (DDA), which exploits this gap in CDN and non-CDN hosting while preserving SNI--Host consistency. Across 1,069,048 domains, we conduct 18,025,068 successful probes. Overall, 95.8% of domains accept an external SNI, and 84.6% return content matching the named tenant. Exposure reaches 99.26% across 506,763 CDN domains and 92.75% across 562,285 non-CDN domains. The co-location graph places 666,413 exposed domains in cross-tenant components; 97.7% of 54,069 cross-tenant non-CDN addresses have a confirmed path to another tenant. None of the tested defenses bind tenant identity to the DNS-approved name. Cleartext inline IPS can block access based on SNI, but Encrypted Client Hello (ECH) hides it. The Windows Zero Trust DNS (ZTDNS) permit remains reusable in both cases, enabling the concealment of command-and-control and data-exfiltration traffic and facilitating censorship circumvention. The risk conceals command-and-control and data-exfiltration traffic and supports censorship.

cs.CR · cs.NI