跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

统计 2026-11-18 05:27 — 2026-11-19 05:27(北京时间) · 点击数字查看对应简报;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 社区发现

浏览论文库

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

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

Combinatorial Residual Network: a decay-chain-aware classifier without explicit jet assignment

John Alison, Patrick Bryant, Alejandro Gomez Espinosa, Christian Guinto-Brody, Aniket Khanal, Chuyuan Liu, Sindhu Murthy, Guanglei Zhao

原文摘要

Final states with several jets from the decays of heavy particles pose a combinatorial problem: the jets must be assigned, at least implicitly, to their parent particles. The Combinatorial Residual Network (CoReNet) is a classifier that encodes the assumed decay chain in its architecture, building the event representation level by level along the decay hierarchy and combining all jet assignment hypotheses, evaluated with shared weights, with learned weights. The exchange symmetries of the decay are built in, the network size does not depend on the number of hypotheses, and no generator-level jet assignments are used in training. Developed for the $b\bar{b}b\bar{b}$ final state and used in several CMS searches, CoReNet with 1508 parameters performs well above kinematic baselines on fast-simulated Higgs boson pair production against QCD multijet events and trains in minutes on a single GPU, and its hypothesis weights select the truth-matched jet pairing in most signal events in which it is defined. Since only the encoded decay chain is specific to the final state, we test the construction on $HH \to b\bar{b}W^+W^-$ against semileptonic $t\bar{t}$, where encoding the decay chain of the background as well improves the classification at a cost of about $10^{3}$ parameters. In both final states, CoReNet performs comparably to a state-of-the-art transformer-based network more than two orders of magnitude larger. The implementation is publicly available at https://github.com/cms-cmu/CoReNet.

hep-ex · cs.LG · hep-ph · physics.data-an

新论文 · v1arXiv:2611.20510

WTR-Drive: World-Task Decomposition with Structured Risk Supervision for End-to-End Driving

Haoyu Xing, Shaobing Ding, Guanglei Zhao, Guanhua Zhao, Nawu Peng, Mingyang Hou

原文摘要

Proposal-conditioned scene predictions can lack a common object-level reference across candidate trajectories. Aggregate planning scores also leave the objects and times associated with violations implicit. We present WTR-Drive (World-Task-Risk Driving), a Drive-JEPA-based planner that separates shared scene estimation from proposal-conditioned reasoning. A proposal-independent World Memory estimates object states, map structure, and future motion by re-reading the original visual features at each refinement round. Proposal feedback updates a residual Task branch without writing back to World Memory. This branch guides refinement through candidate-specific retrieval and gated visual feedback. A final Task readout supplies candidate-conditioned features for scoring. We derive structured risk targets from existing candidate-scoring rollouts without additional simulator calls. For at-fault collision and time-to-collision violations, the targets encode event existence, association with shared object slots, and the first violation time bin. On the NAVSIM navtest split, WTR-Drive achieves 94.66 PDMS on v1 and 88.24 EPDMS on v2 (expert-frame sequential evaluation). These scores are 0.96 and 0.44 points above the published Drive-JEPA values, respectively. Candidate-level analysis shows that higher best-candidate scores can coexist with lower selected-trajectory scores, revealing a gap between candidate quality and selection effectiveness.

cs.RO