跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+806新增论文
+644其中 AI 相关
+92已有论文修订
+95新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

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

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

面向生物学家的AI:代理系统时代基础模型的知识边界

AI for Biologists: The Knowledge Boundaries of Foundation Models in the Age of Agentic Systems

Tian Cai, Andrew Kleist, Jaimin Patel, Duccio Malinverni, Alexander K. Taylor, Malvika Sharan, Renato Umeton, M. Madan Babu

AI 速读 基于摘要

这篇综述讨论生物基础模型与基于大语言模型的代理系统,提出用数据、架构、训练方案、评估方案和后分析五个设计要素来界定模型输出的可靠范围(知识边界)。

q-bio.BM · cs.AI

查看原文摘要

Artificial intelligence (AI) is changing how biological research is done. Biological foundation models trained on millions of nucleotides, protein, and single-cell measurements predict protein structures, mutation effects, and cellular responses to genetic perturbations. Agentic systems, AI assistants built on large language models, can run multistep analyses from plain-language requests and increasingly call foundation models as tools. Yet it is often unclear when these models' outputs can be trusted. We frame this as a model's knowledge boundary: the range of inputs, tasks, and conditions over which its outputs are reliable. This review explains how foundation models are built and proposes that five design elements (data, architecture, training scheme, evaluation scheme, and post-analysis) define this boundary. We examine evidence on where current models succeed or fail and present standardized descriptions of model limits so that researchers, and the agents acting for them, can use these tools reliably.

新论文 · v1arXiv:2611.17013

DiffSSMEye:基于结构化状态空间扩散的条件高频眼动合成

DiffSSMEye: Conditional High-Frequency Eye Movement Synthesis with Structured State-Space Diffusion

Kamrul Hasan, Mehedi Hasan Raju, Oleg V. Komogortsev

AI 速读 基于摘要

提出一种以S4层为骨干的条件去噪扩散模型,按用户身份与任务合成1,000 Hz高频注视速度序列。

cs.HC

查看原文摘要

Synthesizing high-frequency eye movements requires preserving long-range temporal dependencies and subject-specific oculomotor dynamics. However, methods based on generative adversarial networks (GANs) and variational autoencoders (VAEs) can struggle to preserve these characteristics simultaneously. We introduce DiffSSMEye, a conditional denoising diffusion probabilistic model with bidirectional Structured State Space Sequence (S4) layers for generating five-second gaze-velocity sequences at 1,000 Hz. Generation is conditioned on a coarse gaze reference, user identity, and task, where identity and task embeddings are incorporated through feature-wise linear modulation. Identity-preservation, multi-resolution spectral, and integrated-drift losses complement noise prediction to constrain biometric consistency, frequency structure, and displacement error. Subject-disjoint evaluation on GazeBase across seven tasks yields mean real--synthetic embedding cosine similarities of 0.91--0.95. DiffSSMEye also achieves the lowest median spatial errors among these baselines for horizontal and random saccade tasks. These results demonstrate improved spatial accuracy and biometric feature consistency for subject-specific gaze synthesis.

新论文 · v1arXiv:2611.17012

徒有其名的匿名化:对欧盟委员会依据DMA第6(11)条针对Google搜索数据所采取匿名化措施的批判性评述与重识别演练

Anonymous in Name Only: A Critical Review and a Reidentification Exercise on the European Commission's Anonymization Measures for Google Search Data under Article 6(11) of the DMA

David Sánchez, Benet Manzanares, Josep Domingo-Ferrer

AI 速读 基于摘要

作者批判性评述欧盟委员会依据DMA第6(11)条要求Alphabet对Google搜索数据实施的匿名化措施,并用真实数据演示低成本的再识别、记录链接与敏感属性推断攻击。

cs.CR · cs.IR

查看原文摘要

In July 2026, the European Commission (EC) set out the anonymization measures Alphabet must implement to share Google Search data with competing search engines under Article 6(11) of the Digital Markets Act. As the first concrete illustration of how the EC operationalizes anonymization under the EU digital rulebook, this methodology could become a regulatory benchmark. In this paper, we show why it should not. We critically review the anonymization measures proposed by the EC, from the characterization of residual risk to the suppression thresholds and the reliance on contractual safeguards. For each of those issues, we highlight significant conceptual flaws, and, where applicable, we illustrate these flaws with empirical observations from real Google Search data provided by Alphabet and protected under the EC's measures. Importantly, we present examples of low-effort reidentification, record linkage, and confidential attribute inference achieved through straightforward and automatable attack patterns. Our findings show that the approach of the EC relies on unjustified heuristics rather than formal privacy guarantees, underestimates the risks inherent in free-text search queries, and sacrifices data utility without achieving meaningful protection. We also demonstrate that the proposed measures do not meet any of the three anonymization criteria established by the European Data Protection Board (EDPB): no record isolation, no linkage, and no inference. Practitioners and regulators are therefore cautioned against treating these measures as a sound anonymization practice.

新论文 · v1arXiv:2611.17011

随机探索确实是随机的

Random Exploration is Random

Yingkang Luo, Hua-Dong Xiong, Hanbo Xie, Caroline Phelps, Madeline Harms, Ryan Smith, James Waltz, Robert Wilson

AI 速读 基于摘要

基于大规模 Horizon Task 数据,作者报告即使使用表达能力更强的神经网络模型,长视野下的选择仍比短视野更难预测,提示随机探索中的变异性在很大程度上是真正的随机性。

q-bio.NC · cs.LG

查看原文摘要

Decision making often requires balancing exploitation of familiar options with exploration of uncertain alternatives. One strategy for exploration is random exploration, in which choices become more variable and less tied to the option that currently appears best. However, it remains unclear whether this variability reflects genuine stochasticity or instead a deterministic structure that traditional cognitive models fail to capture. We examined this question using the Horizon Task in an aggregated dataset of 1,392 participants completing over 1,270,695 trials. In this task, exploration becomes more valuable when participants have more future choices, and choice variability increases under longer horizons. We tested whether more expressive neural network models could recover deterministic structure from this additional variability. Although neural networks provided better overall fits to behavior than the traditional model, long-horizon choices remained consistently less predictable than short-horizon choices. These findings show that limited model expressiveness cannot fully account for the increased variability associated with random exploration, suggesting random exploration truly is substantially random.

新论文 · v1arXiv:2611.17005

面向非线性时间最优模型预测控制的数据高效实时神经模仿集成架构

An Integrated Architecture for Data-Efficient Real-Time Neural Imitation of Nonlinear Time-Optimal Model Predictive Control

Maarten De Baecke, Flavia Sofia Acerbo, Andrea Giusti, Wilm Decré

AI 速读 基于摘要

提出自知情采样(SIFS)与完整训练控制架构,用神经网络模仿长时域非凸TOMPC,并在Furuta摆上实现从1.4 Hz到1 kHz的实时控制。

eess.SY · cs.LG · cs.RO

查看原文摘要

Nonlinear time-optimal model predictive control (TOMPC) enables highly performant control of constrained systems, but its computational cost prohibits real-time use on fast dynamical systems. Neural network imitation of the TOMPC control law can reduce online computational costs, yet existing work mostly targets quadratic cost formulations in simulation and addresses the challenges of neural controllers in isolation. This work imitates a long-horizon nonconvex TOMPC with hard terminal constraints, whose high computational cost limits training-data generation. We present (i) \emph{self-informed sampling (SIFS)}, a data-efficient expert-sampling strategy that uses a learned time-to-go to query the expert only where the policy deviates from time-optimal behavior, (ii) a complete training and control architecture that jointly addresses dataset correlation, suboptimal expert labels, covariate shift, constraint satisfaction and model mismatch, and (iii) real-world validation on a Furuta pendulum. SIFS matches standard dataset aggregation performance in roughly one-third of the training time and with less than half the training data. The resulting controller matches the region of attraction of the expert TOMPC while raising the control frequency from 1.4~Hz to 1~kHz. On hardware, the controller swings up and stabilizes the pendulum along trajectories closely matching the expert TOMPC solution.

新论文 · v1arXiv:2611.16993

不知道反而更好:孟加拉国的数字识别、家庭权威与产后心理健康

It Was Better Not to Know: Digital Recognition, Family Authority, and Postpartum Mental Health in Bangladesh

Shajnin Haque Aishy, Sabbir Bin Abdul Latif, Md. Golam Zel A Husna, Jannatun Noor

AI 速读 基于摘要

基于孟加拉国20位母亲的访谈研究,探讨社交媒体如何让母亲偶然识别产后抑郁,却因家庭权威而难以将识别转化为支持。

cs.HC

查看原文摘要

Postpartum mental distress affects roughly one in five mothers in low- and lower-middle-income countries, yet recognition and support remain limited where formal mental-health care is scarce, and family relationships govern health decisions. We report a five-month interview study with 20 mothers in urban, urban slum, and rural Bangladesh who had given birth within the previous two years. Mothers encountered the concept of postpartum depression incidentally, through Facebook and YouTube recommendations rather than deliberate search or clinical guidance, and then used these platforms for private sensemaking without disclosing. Recognition, however, rarely traveled beyond the self: mothers could identify their distress while families dismissed it, leaving them with knowledge but no authority to act. Participants sought validation as a precondition for support and described recovery as relational rather than clinical or digital. We argue that postpartum technologies should engage partners, families, and community health workers rather than placing recognition solely on mothers.

新论文 · v1arXiv:2611.16991

AnalogLayoutWorld:面向智能体模拟版图设计的开放基准

AnalogLayoutWorld: An Open Benchmark for Agentic Analog Layout Design

NovaSilicon Team

AI 速读 基于摘要

作者提出一个开源智能体基准 AnalogLayoutWorld,用 40 个专家评审任务评估编码智能体从固定晶体管级网表完成端到端模拟电路版图生成的能力。

cs.AI

查看原文摘要

Coding agents have demonstrated strong capabilities in software development, yet their ability to tackle long-horizon engineering tasks governed by physical constraints remains less understood. We study this question through analog circuit layout, which demands domain knowledge, geometric reasoning, and iterative interaction with design and verification tools. We introduce \textbf{AnalogLayoutWorld}, an open-source agent benchmark with 40 expert-reviewed tasks for end-to-end layout generation from fixed transistor-level netlists. It combines an integrated design environment with independent physical and post-layout electrical verification, as well as objective layout quality metrics co-designed with analog layout experts. Across 13 model--harness configurations, 91.1\% of attempts produce GDS layouts, but only 23.0\% satisfy the benchmark's acceptance criteria. We also evaluate Novara, an internally developed agent system, which achieves the highest reported aggregate score. Our analysis links performance differences to test-time scaling under fixed budgets, suggesting that reasoning efficiency and effective use of verification feedback help sustain design quality as task complexity grows.

新论文 · v1arXiv:2611.16984

ElasticDino:使用弹性变形生成稠密语义特征

ElasticDino: Dense Semantic Features Using Elastic Deformations

Ulysse Mizrahi, Sean Zaretzky, Dov Danon, Amit H. Bermano

AI 速读 基于摘要

ElasticDino 是一种轻量适配器,通过空间弹性变形将 ViT 特征对齐到输入图像结构,高效生成高分辨率、像素对齐的稠密语义特征图。

cs.CV · cs.AI

查看原文摘要

Vision transformers (ViTs) serve as the backbone for countless vision tasks, including dense prediction tasks, such as segmentation and depth estimation, even though the quadratic complexity of self-attention severely limits feature resolution and induces spatial artifacts. In this work, we introduce ElasticDino, a lightweight adapter which produces high-resolution feature maps, adhering to the fine details of the input image. As a key insight, we observe the consistency of artifacts across channels, and simultaneously resolve them to match the input image structure. Using a slim architecture based on spatial deformations, ElasticDino produces pixel-aligned, high-resolution feature maps efficiently. Leveraging deformations allows strictly preserving sharp semantics, and thereby avoiding the smoothness biases inherent to alternative approaches. Due to the absence of ground truth, we employ pixel-level semantic segmentation and depth estimation with linear heads to predict a set of downstream dense tasks, guiding the deformation process without leaking task-specific semantics into the model. We demonstrate superior accuracy over current methods on a range of popular dense task benchmarks, with better computational performance.

新论文 · v1arXiv:2611.16981

Compiling Known Rules into Compact Neural Agents: Weight-Space Programming on Unseen Games

Jens Lehmann

原文摘要

Weight-space programming (WSP) uses language models to construct neural network weights without training. We test whether known game mechanics can be compiled into compact agents that generalise to held-out levels, renderings and start states within a game family. Writers receive simulator source with held-out level data removed for 20 privately authored, unpublished ARC-AGI-3-style game families. With a fixed 57k-parameter recurrent architecture, the strongest writer reaches 56% held-out-level success with feedback, while the four main writers' Python players reach 97-100%. An exploratory free-architecture condition reaches 68-90%. Learning from support-level examples transfers much less well, but these learners lack the source information given to writers. Written networks have a program-like structure: 93% of parameters are zero, and 90% of the rest are small integers or powers of two. NumPy players under comparable computation caps reach 91%, versus the networks' 79%. Training the strongest writer's architectures from scratch yields about 1% success within our budget. Written fixed-network weights are fragile, and standard PPO removes most of their success. Prompts for noise robustness increase tolerance by about four orders of magnitude for two of three writers, but PPO makes larger updates and still removes most success. These results demonstrate rule-to-network compilation in this setting, while showing limited benefits over Python programs and no successful combination with the tested PPO fine-tuning.

cs.AI · cs.LG

版本更新 · v3arXiv:2111.13630

基于SpatialConfiguration-Net的高效多器官分割:低GPU内存需求

Efficient Multi-Organ Segmentation Using SpatialConfiguration-Net with Low GPU Memory Requirements

Franz Thaler, Christian Payer, Horst Bischof, Darko Stern

AI 速读 基于摘要

作者提出基于SpatialConfiguration-Net的多器官分割模型,通过整合器官空间配置先验并优化架构与推理脚本,在尽量不显著影响预测质量的前提下降低GPU内存占用和计算时间。

eess.IV · cs.CV · cs.LG

查看原文摘要

Even though many semantic segmentation methods exist that are able to perform well on many medical datasets, they are often not designed for direct use in clinical practice. The two main concerns are generalization to unseen data with a different visual appearance, e.g., images acquired using a different scanner, and efficiency in terms of computation time and required Graphics Processing Unit (GPU) memory. In this work, we employ a multi-organ segmentation model based on the SpatialConfiguration-Net (SCN), which integrates prior knowledge of the spatial configuration among the labelled organs to resolve spurious responses in the network outputs. Furthermore, we modified the architecture of the segmentation model to reduce its memory footprint as much as possible without drastically impacting the quality of the predictions. Lastly, we implemented a minimal inference script for which we optimized both execution time and required GPU memory.

新论文 · v1arXiv:2611.16968

Morphological Simplification in Alzheimer's Disease: Computational Analysis and Identification From Connected Speech

Mohamed Zakaria Kurdi

原文摘要

Purpose: Morphology is often regarded as relatively spared in Alzheimer's disease (AD) and is rarely modeled in connected speech. This study asked which morphological features distinguish speakers with AD from healthy controls, how well morphology classifies AD compared with other linguistic levels and BERT-based models, and whether the signal exceeds transcript length and vocabulary. Method: Fifty-five automatic measures in eight families, seven of them new and theory-motivated, were computed from participant speech in the ADReSS Cookie Theft descriptions (78 AD, 78 controls) and analyzed with group comparisons, equivalence tests, SHAP, family ablation, likelihood-ratio tests, feature-selection classifiers, and BERT-based models. The automatic measures were validated manually, and models were transferred to two other corpora. Results: Nineteen of 38 measures differed between groups: speakers with AD produced fewer suffixed and inflected words, shorter verbs and nouns, and fewer present-progressive but more past-tense forms (largest effect r = -0.42), whereas errors were rare and statistically equivalent between groups. Eight measures survived adjustment for length and lexical frequency. With test-set feature selection, morphology reached a macro-F1 of 0.85, on par with syntax and above fine-tuned BERT (0.80 over five seeds); fully cross-validated selection gave 0.62. Adding morphology to BERT improved AUC (0.91 vs. 0.89) but not macro-F1. Transfer was limited, although two thirds of the effects kept their direction in mild cognitive impairment. Conclusions: AD connected speech shows morphological simplification and temporal reanchoring rather than breakdown. Morphology is more informative than its reputation suggests. Keywords: Alzheimer's disease; morphology; connected speech; ADReSS; inflection; tense and aspect; SHAP; machine learning; BERT

cs.CL

版本更新 · v2arXiv:2609.18051

CLASP:面向鲜食蓝莓采收的集群级自主选择性采摘机器人及软体滚动带夹爪

CLASP: A Cluster-Level Autonomous Selective Picking Robot with a Soft Rolling-Band Gripper for Fresh-Market Blueberry Harvesting

Yixuan Xia, Yilin Cai, Natalia Belen Espinoza, Changying Li, Zilfina Rubio Ames, Xin Zhang, Yue Chen

AI 速读 基于摘要

作者提出并田间验证了 CLASP——一种以果簇为作业单元、用软体主动滚动带夹爪按成熟度选择性采摘鲜食蓝莓的自主机器人。

cs.RO

查看原文摘要

Fresh-market blueberries require selective, gentle picking, which is labor-intensive and expensive. Over-the-row machine harvesters are fast but non-selective, bruising mixed-ripeness fruit and limiting yield to the processing market. Selective robotic harvesters typically target individual fruits rather than fruit clusters, which limits harvesting efficiency for small, densely clustered blueberries. This paper presents CLASP, a Cluster-Level Autonomous Selective Picking robot with a Soft Active Rolling-Band Gripper (SARB-Gripper). Two compliant bands envelop the cluster and roll against the fruit, drawing mature berries off in sequence, while closed-loop regulation of the pulling force keeps the applied load below the immature detachment threshold. A global-to-local perception pipeline pairs an eye-to-hand camera for global cluster detection and target selection with an eye-in-hand camera for local localization and cluster orientation estimation. Field measurements confirm a clear detachment-force separation between mature and immature fruit, and the SARB-Gripper reproduces a commanded pulling force to within \SI{3.7}{\percent}, enabling selective harvesting at the cluster level. In end-to-end field trials, CLASP autonomously grasped 23 of 25 presented clusters (\SI{92}{\percent}). With the component cost of approximately \$3326 per unit, CLASP offers a scalable approach to selective cluster-level harvesting for fresh-market blueberries.

新论文 · v1arXiv:2611.16966

区间图与有界秩宽图上约束满足问题的PTAS

A PTAS for Constraint Satisfaction Problems on Interval Graphs and Bounded Rank-Width Graphs

Ian DeHaan, Euiwoong Lee

AI 速读 基于摘要

作者为约束图为区间图或有界秩宽图的布尔Max-2-CSP给出了多项式时间近似方案(PTAS),并解决了Max-Cut在区间图上的可近似性问题。

cs.DS

查看原文摘要

We present a polynomial-time approximation scheme (PTAS) for all Boolean arity-two maximum constraint satisfaction problems (Boolean Max-2-CSP) where the constraint graph is either interval or has bounded rank-width. This class of problems includes, for example, Max-Cut, Max-DiCut, Max-2-Lin(2), and Max-2-SAT. In particular, this settles the approximability of Max-Cut on interval graphs. To achieve these results, we show the following. 1. For any $\varepsilon > 0$, there is an $n^{\mathcal O(r \varepsilon^{-2})}$-time $(1 - \varepsilon$)-approximation for Boolean Max-2-CSP on graphs of rank-width at most $r$. 2. There is a polynomial-time algorithm that, for any interval graph $G = (V, E)$ and $\varepsilon > 0$, finds a subgraph $H = (V, F)$ of $G$ such that $|F| \geq (1 - \varepsilon) |E|$ and $H$ has rank-width at most $\operatorname{poly}(\varepsilon^{-1})$. Our techniques additionally extend to all bounded-alphabet arity-two max CSPs.

新论文 · v1arXiv:2611.16961

思考的价值:在混合决策模型中学习何时推理

The Value of Thinking: Learning When to Reason in Hybrid Decision Models

Zhengxu Yu, Ke Xu, Meng Fang, Haitham Ammar, Weilin Luo, Jun Wang

AI 速读 基于摘要

提出零或T思考范式与混合决策模型HDM,用自路由模块估计“思考的价值”,按请求价格决定是否进行完整自回归推理。

cs.AI

查看原文摘要

Existing adaptive-reasoning methods shorten the explicit reasoning a model writes, or skip it by switching modes; either way the answer is still written out token by token. \emph{Rather than deciding how much to think}, we explore a different paradigm, \emph{zero-or-$T$ thinking}: a single model either answers from the implicit thinking inside one forward pass, generating no token, or performs full autoregressive reasoning at a cost of $T$ tokens when that is worth paying. We realise it in a \emph{hybrid decision model} (HDM), where one frozen backbone serves both modes and a lightweight \emph{self-routing block} chooses between them. The block estimates the \emph{value of thinking}, the utility the slow mode is expected to add over the fast one, from what that implicit thinking has already produced, and the slow mode runs only where that value exceeds a price $λ$ set per request. Where no per-decision label exists, as in episodic agentic tasks, we introduce \emph{Calibrated Decision Policy Optimisation} (CDPO), a reinforcement-learning recipe that trains the block from episode-level returns. We evaluate HDM on MMLU-Pro, AGIEval, GPQA-Diamond, JevBench, BANKING77 and MiniWoB. Specifically, on JevBench HDM-4B scores $0.857$ against Jev's $0.851$ ($+0.7\%$) at a median $0.179$\,s against $0.652$ ($-72.5\%$). On the agentic venue MiniWoB HDM-27B cuts token cost by $80.1\%$.

新论文 · v1arXiv:2611.16956

Lara Mini Base:语言多样性是资源,而非权衡

Lara Mini Base: Language Diversity as a Resource, Not a Trade-off

Translated, Maria Pia Adinolfi, Isabelle Andrieu, Grazia Fiorella Anfuso, Melania Annunziata, Daniele Antonini, Marta Arena, Luca Barone 等 206 位作者

AI 速读 基于摘要

Lara Mini Base 是一个从零训练、覆盖 45 种语言(含全部 24 种欧盟官方语言)的 MoE 基础模型,以 7.2B 总参数、0.6B 激活参数在 ≤2B 激活参数的开放基础模型中取得最高平均分,并声称 MoE 架构缓解了语言间的容量竞争。

cs.CL · cs.AI

查看原文摘要

General-purpose language models are trained mostly on English: over open models we review, at most, non-English pretraining data makes up only a 12% share. Models built for European languages give them far more, but score well below general-purpose models of the same size. A common concern is that, in small models, languages compete for capacity. We present Lara Mini base, a model trained from scratch on 6T tokens in English and 44 other languages, which together cover all 24 official languages of the European Union. As training progresses, the 44 other languages together come to outweigh English. To give these languages enough capacity at low cost, Lara Mini base uses a mixture of experts architecture with 7.2B total and 0.6B active parameters. Among open base models with up to 2B active parameters, it achieves the highest average score across standard English, multilingual, math, and code benchmarks, ahead of models trained on 4 to 6 times as many tokens. Its margin is largest on multilingual benchmarks in the languages it supports and on math benchmarks. It supports contexts of up to 128k tokens. We find that our MoE architecture reduces capacity competition between languages. For a single user on one GPU, without quantization, it generates text at least 1.8 times faster than any model with a higher average score. We release the weights of Lara Mini base under the CC BY-NC-SA 4.0 license. In addition, we will release T-HellaSwag, a higher-quality machine translation of the commonsense reasoning benchmark HellaSwag into 110 language variants.

新论文 · v1arXiv:2611.16955

一种用于预测晚期年龄相关性黄斑变性进展的疾病特异性视网膜衰老生物标志物

A Disease-specific Retinal Aging Biomarker for Predicting Progression to Late Age-related Macular Degeneration

Hexin Dong, Benjamin Hou, Puzhen Wu, Mingquan Lin, Emily Y. Chew, Zhiyong Lu, Yifan Peng

AI 速读 基于摘要

作者提出并验证基于眼底图像的AMD年龄(FAA),用于量化疾病特异性视网膜衰老,并证明其比实际年龄更能预测晚期AMD进展。

cs.CV

查看原文摘要

Age-related macular degeneration (AMD) is a leading cause of irreversible vision loss in older adults. While chronological age is a primary risk factor, it inadequately reflects individual variations in retinal aging, limiting effective AMD risk stratification and timely intervention. Here, we propose and validate fundus-based AMD age (FAA), which quantifies disease-specific retinal aging in AMD and captures accelerated AMD-related retinal aging, thereby improving prognostic precision over chronological age. Trained on 36,782 images from 2,192 participants in the Age-Related Eye Disease Study (AREDS) dataset and validated across AREDS and AREDS2 cohorts, our model demonstrates significant improvements over traditional chronological age-based approaches. Specifically, integrating the proposed FAA into Cox proportional-hazards models significantly enhances prediction performance. FAA improved the C-index from 0.836 to 0.888 and reduced the 5-year Brier score from 0.050 to 0.046 in AREDS, with consistent gains observed in AREDS2 (C-index 0.715 to 0.756; 2-year Brier 0.078 to 0.076). FAA showed improved prognostic performance across the two datasets and under different phenotype definitions (reading center-defined vs. specialist-defined grading), supporting its potential utility for AMD risk stratification. These findings highlight the advantage of incorporating FAA into AMD risk prediction frameworks, supporting further evaluation of FAA for AMD risk stratification.

版本更新 · v2arXiv:2601.16809

AI代理编写的代码在开源项目中能存活吗?

Will It Survive? Deciphering the Fate of AI Agent-Authored Code in Open Source

Musfiqur Rahman, Mahi Begoug, Emad Shihab

AI 速读 基于摘要

作者对215个开源仓库中AI代理与人类编写的代码进行生存分析,发现代理代码并非“一次性”的,其被修改的时间并不早于人类代码,但具体差异取决于代理类型、合并时间和统计方式。

cs.SE · cs.AI

查看原文摘要

AI coding agents such as GitHub Copilot, OpenAI Codex and Devin now open pull requests (PRs) that are merged into open-source projects. Industry reports suggest that AI-assisted code is revised or reverted soon after it is written, which raises the concern that agent code is "disposable". However, little is known about what happens to agent code after it is merged. Knowing how long this code survives, and why it is changed, can help maintainers decide how much review it needs. We performed a survival analysis of the 648,959 lines that 2,794 merged PRs added outside vendored and generated paths in 215 open-source repositories from the AIDev dataset, comparing agent-attributed and human code within the same repositories. Agent-attributed code is not modified sooner than human code. When each PR is weighted equally, agent-attributed lines are modified later (HR = 0.83, 95% CI [0.75, 0.93]). This difference comes from the supervised assistants, mainly Copilot and Codex (HR = 0.76). Code from Devin does not differ from human code over the whole period (HR = 0.95), but among PRs merged after mid-May 2025, code from both the supervised assistants and Devin is modified later. Without PR weighting, the difference is not statistically significant. When agent-attributed code is modified, the intent of the change is similar to that of human code (Cramer's V = 0.080). A file's size and recent changes predict whether agent-attributed code will be modified better than its code tokens do (AUC-ROC 0.78 vs. 0.70), and process features predict when it will be modified only weakly (Macro F1 of 0.31 against 0.25 for a random guess). Our findings suggest that agent code is not disposable, but whether it survives longer than human code depends on the agent, on when the code was merged and on how the comparison is computed.

新论文 · v1arXiv:2611.16947

SignalAudit-QD:面向AI查询预测中外部信号的可复现审计资源

SignalAudit-QD: A Reproducible Audit Resource for External Signals in AI-Query Forecasting

Amir Rafe, Iman Jamshidi, Gourab Sil, Subasish Das

AI 速读 基于摘要

作者发布一套可复现的审计资源,用固定20词美国AI面板检验带日期的公开信号在查询历史之外是否提供增量信息,并报告一个边界明确的负结果案例。

cs.IR

查看原文摘要

SignalAudit-QD is a reproducible audit resource for testing whether a dated public signal adds information beyond query history in a fixed 20-term U.S. AI panel. It aligns two archived Google Trends extractions with eight USPTO AI-patent publication streams and releases origin-indexed predictions, paired losses, provenance, executable tests, and tamper-evident run manifests. Both inputs are retrospective reconstructions obtained after the modeled 2020--2023 origins; the task is therefore a pseudo-origin assay within frozen measurement vintages, not a historical deployment simulation. In the designated one-month comparison, adding a two-component patent block to a level ridge changes macro mean absolute error by +0.0012 Trends points, with conditional 95% moving-block interval [-0.0363,+0.0387]. This establishes neither aggregate benefit nor equivalence. Alternative dimensions, semantic mapping, patent definitions, a second extraction, and a three-month horizon remain unresolved; persistence-anchored and nonlinear hosts instead show model-specific worsening, tiny for the anchored fit. Matched timing controls expose availability assumptions, while a planted-signal assay detects only the largest tested injection. A within-query high-interest alert demonstrates the released interface but not online utility. The contribution is a bounded negative case study and an extensible evidence schema for auditing external-signal claims in temporal information retrieval.

新论文 · v1arXiv:2611.16942

AI 扩张压力下的数据中心治理

Data Center Governance Under AI Expansion Pressures

Yacine Jernite, Sasha Luccioni, Bruna Trevelin, Angela Lee, Carolina Molina, Xinying Chu

AI 速读 基于摘要

摘要指出数据中心收益是全球性的、负面影响却高度本地化,在 AI 快速扩张下,地方政府与社区正借助现有联邦及州/地区法规对数据中心的建设与运营施加压力。

cs.CY

查看原文摘要

The promised benefits of data centers are global, but their negative impacts are very much local, affecting the energy bills, aquifers and living environments of citizens across the United States. While governments and authorities have historically provided data centers with incentives such as tax credits and exemptions, AI's aggressive growth in scale has changed this dynamic, and recent months have seen them issue bills and file lawsuits in order to ensure that data centers remain a net positive influence on their legislatures. Existing pieces of federal legislation -- such as the Public Trust Doctrine, the Pollution Prevention, Clean Air and Safe Drinking Water Acts -- exist to manage natural resources, but their scope remains contested, and the current federal government's stance on competitiveness and growth of AI has put the onus on regional governments to endeavor to protect local resources. There are also state- and regional laws and regulations that are relevant for building and operating data centers since, in practice, they require substantial land, electricity, water, and infrastructure at a local level. Given this situation, communities are currently provided with the opportunity to raise their concerns regarding the potential negative impacts of how data centers are built and operated, and have existing regulations that can be used to put pressure on data center operators.

新论文 · v1arXiv:2611.16935

Mantis 2:通用传染病预测模型

Universal Infectious Disease Forecasting with Mantis 2

Carson Dudley, Reiden Magdaleno, Yutong Bi, Anthony Valencia, Xiaofeng Liu, Marisa Eisenberg

AI 速读 基于摘要

作者通过调节模拟数据与观测数据的训练配比,发现模拟数据在本地历史有限时价值最大,并据此构建了可同时预测最多六个变量、提前十六周的通用传染病预测模型 Mantis 2。

cs.AI · q-bio.PE

查看原文摘要

Public health agencies need to anticipate how outbreaks will unfold, when they will peak, and how long demand on health services will remain elevated. We previously developed a foundation model, Mantis, which was trained entirely on simulated outbreaks---enabling us to generate the diversity and scale of training data needed to support forecasting across diseases. However, our previous work left unresolved when simulation improves predictions and how it should complement observational data. Here, we varied the balance of simulated and observed training data while holding forecasting tasks fixed and varying the available surveillance history. We found that simulation-rich training was particularly valuable with limited local history, and its relative advantage diminished as more observations became available. We also found that simulation-based training reduced exceptionally large forecast errors, suggesting that mechanistic knowledge can help compensate for limited local evidence. Building on these findings, we developed Mantis 2, which combines simulated and observational training to jointly forecast up to six variables sixteen weeks ahead. Across 30 forecasting tasks, Mantis 2 achieved the best aggregate probabilistic accuracy over short, medium, and long horizons among the machine learning, statistical, and baseline models evaluated. It missed roughly 30\% fewer outbreak peaks than the strongest comparison model, with successfully anticipated peaks identified more than six weeks in advance on average. We publicly release Mantis 2, enabling public health agencies and researchers to forecast disease outcomes without developing a separate model for each disease or location.

新论文 · v1arXiv:2611.16933

Kezek:将单声道双人对话拆分为每说话人音轨,用于全双工对话数据

Kezek: Splitting Mono Two-Person Conversations into Per-Speaker Tracks for Full-Duplex Dialogue Data

Bagzhan Karl, Alizhan Karl

AI 速读 基于摘要

Kezek 是一个将恰好两人的单声道录音拆分为保留原始时长与时序的每说话人音轨的模型,并针对对话数据需求报告了短回复保留率等指标。

eess.AS · cs.AI

查看原文摘要

Full-duplex spoken dialogue models learn turn-taking, overlaps and backchannels from conversations recorded with one channel per speaker, but most available conversational audio is a single mono mix. We present Kezek, a model that turns a mono recording of exactly two people into one track per person with the original length and timing; overlaps and short replies ("yeah", "mm-hm") stay on the track of the person who said them. Kezek decides who speaks when and who is who once for the whole recording (stage 1: a two-voice activity model guided by a speaker fingerprint trained to be insensitive to phase), and a conditioned time-domain separator only carries out that decision (stage 2), with outputs that always sum to the input. Standard separation metrics miss the failures that matter for dialogue data, so we report short-reply retention, leakage onto the other person's solo, channel swaps and coverage. Against the open pipeline pyannote -> DialogueSidon on the same recordings, Kezek keeps more short replies (0.83 vs. 0.69 on Open Yap test; 0.80 vs. 0.71 over the other's speech on unseen telephone speech from CallHome English), mostly because it returns the whole recording while the external pipeline drops part of it (on the audio both return, reply retention is about the same: 0.859 vs. 0.865 on Open Yap); it also leaks less, swaps channels less often, and runs 4-5 times faster (about 230 hours of audio per GPU-hour). We also report negative results and an ideal-mask ceiling that locate the remaining gap: quiet replies under a louder voice. Code and weights are released under permissive licences.

新论文 · v1arXiv:2611.16928

STEALTH:与低层张量硬件无关的隐写文本编码

STEALTH: Steganographic Text Encoding Agnostic to Low-Level Tensor Hardware

William Fleshman

AI 速读 基于摘要

作者提出 STEALTH,用指数竞赛采样与无速率 spinal 码,使语言模型隐写文本在收发端浮点精度、量化、GPU 架构或并行打分方式不一致时仍可解码。

cs.CR · cs.AI · cs.LG

查看原文摘要

Provably secure linguistic steganography hides a message inside text sampled from a language model, so that without the key, a stegotext is computationally indistinguishable from an honest model sample. Nearly every such scheme assumes the receiver can recompute the sender's token probabilities exactly bit for bit. We show this assumption is fragile: across three model families, bit-exact schemes decode almost none of our messages once the receiver's floating-point precision, quantization, or GPU architecture differs from the sender's, or even when the receiver merely scores a text in parallel versus one token at a time, with the same model, precision, and hardware held fixed. We present STEALTH, a scheme built for exactly this setting. The sender draws each token with an exponential race driven by keyed pseudorandom noise, so a receiver's probability mismatch flips a token only when the race is close; a rateless spinal code, decoded by beam search, absorbs the resulting flips without the sender and receiver ever agreeing on a single distribution. We prove stegotexts remain indistinguishable from honest samples under this construction. Empirically, STEALTH decodes every message we sent for every receiver in the sender's model family, at every precision and quantization level, on smaller models, and on a different GPU architecture. STEALTH is even robust across different model families with separate vocabularies and tokenizers, decoding every message we tested. Our approach carries far more payload per token than prior robust schemes, and trained steganalyzers and a targeted statistical test both fail to distinguish its stegotexts from honest model output.

新论文 · v1arXiv:2611.16925

第8届LSVOS挑战赛报告:移动端统一多模态理解

Report of the 8th LSVOS Challenge: Mobile Unified Multimodal Understanding

Chang Liu, Henghui Ding, Tong Yang, Dayoung Kil, Seong-heum Kim, Qilin Xiang, Ronghao Zheng, Ziyang Zhang 等 13 位作者

AI 速读 基于摘要

第8届LSVOS挑战赛MUMU赛道要求单一统一模型在0.5B参数与8GB峰值显存预算内同时完成多概念图像标注、开放词汇目标检测和简短图像描述,报告总结了赛制与前三名方案。

cs.CV

查看原文摘要

This report summarizes the Mobile Unified Multimodal Understanding (MUMU) track of the 8th Large-scale Video Object Segmentation (LSVOS) Challenge, held in conjunction with ECCV 2026. MUMU asks for a single unified model that jointly performs multi-concept image tagging over quality, scene, and event vocabularies, open-vocabulary object detection, and concise image captioning, within a budget of 0.5B parameters and 8 GB of peak inference memory. Submissions are ranked by a weighted task score scaled by an efficiency factor. We describe the tasks, rules, and evaluation protocol, report the final results, and review the methods of the top three teams. All three leading solutions build on the compact Florence-2-base model, but extend it in different ways: lightweight tagging heads with cross-task inference refinement, a shared low-rank adapter trained on coverage-aware multi-source data with task-dependent decoding, and a training-free pipeline that maps captions to tags and applies detection test-time augmentation. The results show that a compact prompt-based vision-language model can serve all three outputs when supervision, decoding, and cross-task cues are designed for each task, while open-vocabulary detection on novel categories remains the main bottleneck.

版本更新 · v4arXiv:2609.02948

FrOGS:跨化学条件独立合金构型采样的离散神经采样器

FrOGS: Discrete Neural Sampler for Independent Alloy Configurations Across Chemical Conditions

Kyucheol Min, Elyssa Hofgard, Tess Smidt

AI 速读 基于摘要

FrOGS 是一种混合离散神经采样器,通过耦合自回归模型与连续时间马尔可夫链,在单一损失下联合训练,实现跨化学条件的独立构型采样和无偏配分函数估计。

cond-mat.mtrl-sci · cond-mat.stat-mech · cs.LG

查看原文摘要

Predicting the thermodynamic properties of an alloy requires sampling its configurations across many chemical conditions and recovering free energies on a common absolute scale. Markov chain Monte Carlo (MCMC) is the standard tool, but it requires separate simulations at different conditions, and auxiliary free-energy methods such as thermodynamic integration are used to place results on a common absolute scale. Modern discrete neural samplers typically use reverse KL divergence as the objective and can be mode-seeking or biased. We present Free energy Offering Generative Sampler (FrOGS), a hybrid discrete neural sampler that couples an autoregressive model to a continuous-time Markov chain (CTMC) to be trained jointly under a single shared loss. FrOGS draws i.i.d. configurations, returns an unbiased estimate of the partition function, and gives consistent estimates of thermodynamic observables. We train a single model across a wide range of chemical conditions to produce estimates on a common absolute free-energy scale. FrOGS matches exact finite-size results on the 2D Ising model and reference phase diagrams for AgPd and CuAu, without mode collapse. We additionally compare to SEGAL, a published autoregressive baseline, and find that only FrOGS recovers the stability range of the CuAu$_3$ phase.

版本更新 · v2arXiv:2609.21495

Scentree:面向多阶段随机规划的场景树生成框架

Scentree: a framework for generating scenario trees for multistage stochastic programming

Cristian Pachón-García, Albert Solà Vilalta, F. -Javier Heredia

AI 速读 基于摘要

Scentree 是一个开源 Python 包,利用机器学习与多元时间序列模型从历史数据或分布样本生成场景扇并缩减为场景树,以支持多阶段随机规划中的不确定性建模。

stat.CO · cs.SE

查看原文摘要

We present scentree, an open-source Python package for constructing scenario trees for multistage stochastic programming models using either historical data or samples drawn from a probability distribution. It combines machine learning and multivariate time series models to obtain a scenario fan that captures dependencies in the stochastic processes. This scenario fan is subsequently reduced into a scenario tree that preserves representativeness of the stochastic process, providing a flexible and extensible framework for uncertainty modeling in stochastic programming problems. The framework can also be naturally applied to two-stage stochastic programming problems. Key contributions are the joint modeling of the stochastic process, preserving correlations between all random variables, and the automation of the complete workflow, including forecasting model selection, parameter estimation, scenario fan generation, and scenario tree construction. In addition, scentree does not assume any underlying data distribution, reducing the statistical expertise required to produce a scenario tree, and is modular by design, allowing external forecasts and other partial executions of the workflow.

新论文 · v1arXiv:2611.16922

批处理、打包与证明:面向CKKS的更高效可验证计算

Batch, Pack, and Prove: More Efficient Verifiable Computation for CKKS

Ignacio Cascudo, Anamaria Costache, Daniele Cozzo, Dario Fiore, Antonio Guimarães, Eduardo Soria-Vazquez

AI 速读 基于摘要

作者提出新算术化、BatchFold多项式承诺、packing打包技术和SparsePack协议,消除CKKS可验证计算中证明尺寸大、范围证明O(N)开销和缺乏亚线性验证等瓶颈,并在神经网络架构上实现证明尺寸和速度的显著提升。

cs.CR

查看原文摘要

An important challenge in homomorphic encryption (HE) is ensuring the integrity of the encrypted computations. Although verifiable computation can address this in theory, making it practical is far from trivial. [Cascudo et al. CRYPTO 2025] recently proposed a solution to this problem for the CKKS scheme. In particular, they propose new succinct arguments that efficiently prove arithmetic circuits and range checks over the ring $R_q = \mathbb{Z}_q[Y]/(Y^N+1)$, and combine them to prove computations on CKKS ciphertexts. Despite the important progress, their work faces scalability challenges: the size of the polynomial commitment proofs, a large $O(N)$ overhead in range proofs, and the lack of an explicit method for efficient -- sublinear in circuit size -- verification. In this paper we present new techniques that remove all these bottlenecks. First, we provide a more efficient arithmetization of CKKS computations. Second, we introduce BatchFold, a new polynomial commitment for $R_q$ that supports batched evaluations and achieves shorter proofs. Third, we design packing, a novel algebraic technique that eliminates the need to commit to massive polynomials and removes the $O(N)$ overhead in range proofs. Finally, we introduce SparsePack, an efficient protocol for proving the evaluations of sparse, circuit-dependent polynomials, leveraging both packing and batched evaluations. We evaluate the efficiency of our solution on a generic neural network architecture, achieving proofs several orders of magnitude smaller and faster than prior approaches.

版本更新 · v3arXiv:2603.10655

间歇性柯西行走在三维搜索中适应目标形状与尺寸并达到最优

Intermittent Cauchy walks enable optimal 3D search across target shapes and sizes

Matteo Stromieri, Emanuele Natale, Amos Korman

AI 速读 基于摘要

作者分析三维间歇性Lévy行走,发现柯西行走(μ=2)在多种目标几何下接近最优,并证明凸目标检测时间尺度为n/Δ。

cs.DS · math.PR

查看原文摘要

Efficiently locating rare targets requires balancing the exploration of novel space with the exploitation of local vicinities. While this tradeoff is well-documented in simplified environments, its behavior in realistic three-dimensional environments remains unclear. Here we analyze intermittent Lévy walks in three dimensions and show that search efficiency becomes strongly dependent on target geometry, with volume, surface area, and elongation governing performance across the Lévy spectrum. Against this geometric complexity, the Cauchy walk ($μ= 2$) emerges as a robust, near-optimal solution across a wide range of target geometries. Specifically, we prove that for convex targets of surface area $Δ$ in a domain of volume $n$, the optimal expected detection time scales as $n/Δ$, and that the Cauchy walk achieves this scaling up to polylogarithmic factors, while other Lévy strategies are suboptimal in different geometric regimes. Our findings provide a theoretical framework for biological movement patterns, including marine predator foraging and immune surveillance, and inform the design of efficient search algorithms for engineered systems such as autonomous nanoscale explorers.

新论文 · v1arXiv:2611.16919

超越词错误率:流式听写ASR的失败分类体系

Beyond Word Error Rate: A Failure Taxonomy of Streaming Dictation ASR

Harras Mansoor, Muhammad Wisal, Hassan Bhatti, Masood Shakir

AI 速读 基于摘要

作者提出按识别、输出格式、语言处理和音频丢弃四层分类流式听写ASR的错误,发现WER相近的系统在耳语、双语等场景下失败模式差异显著。

cs.CL · cs.SD

查看原文摘要

Speech recognition (ASR) systems are usually compared by word error rate (WER) on recorded files, after punctuation, capital letters and number format are removed. In dictation, the audio is streamed live and the text goes into the user's message as written, so what matters is which mistakes the user has to fix. The test set, streamed to eleven ASR systems, comprises 106 scripted English dictations from one speaker (read in a quiet room, with a fan on, and whispered), 20 clips in each of eleven other language and dialect sets, and 400 recordings that join clips in two languages. Every error was sorted by a fixed rule into four levels: recognition, output formatting, language handling and, for the self-hosted models, audio dropped before the model. Systems with similar WER failed in different ways. Zoom Scribe and OpenAI's GPT-Live-Transcribe have almost the same WER on quiet English (7.4% and 7.3%), but 34.7% and 8.8% on whispered English. Zoom and both AssemblyAI models left out 26-28% of whispered words, and still 21-26% with their end-of-turn detection relaxed or off; seven other systems left out at most 3%. Qwen3-ASR's 32% came from the speech detection in our own deployment (6% when relaxed). Across 107 EARS speakers, the same four systems lost 7-31% of whispered words, while six others lost under 2%. With only English selected, Gemini, Deepgram and our self-hosted Whisper lost the non-English part of a two-language recording in 86-99% of recordings, against 33-46% with both languages selected, while GPT-Live-Transcribe, OpenAI's realtime Whisper and Meta lost it in at most 20%. Running Whisper behind a Silero voice activity detector that drops audio judged to be silence raised whispered WER from 10.1% to 51.4%. Most English results come from one read speaker. The code, the recordings, both references and every transcript are released.

版本更新 · v3arXiv:2610.32477

CauProphet:教会智能体像人类一样发展因果认知

CauProphet: Teaching Agents to Develop Causal Cognition like Humans

Kaiwen Wu, Chaochao Lu

AI 速读 基于摘要

作者提出 CauProphet,让 LLM 智能体在任务中构建并持续更新结构化因果信念与因果认知,从而把因果知识迁移到后续决策。

cs.AI

查看原文摘要

Large language model (LLM) agents increasingly support long-horizon tasks by leveraging external memory and past experience. However, existing agents mainly retrieve records or summaries, lacking the ability to form and refine causal understanding of the world. Inspired by human causal cognition, we introduce CauProphet, an agent that develops and updates causal knowledge within its Causal Cognition. For each task, CauProphet combines relevant knowledge in Causal Cognition with current evidence to construct a Causal Belief, a structured belief capturing causal factors and the effects of possible actions. It uses this belief for decision-making and continuously updates both the belief and Causal Cognition as new observations emerge, enabling causal knowledge that persists beyond individual experiences. Evaluations demonstrate that CauProphet progressively acquires causal knowledge and transfers it to future decision-making. In financial research, CauProphet leverages prior discoveries to improve downstream analyses and outperforms all baselines in mean rank correlation with next-day returns, achieving a 25.4% improvement over a baseline agent. It also improves prediction accuracy from 21.3% to 28.6% in dynamic real-world settings. Further experiments validate its ability to perform reliable causal analysis and action selection across scientific and everyday tasks, demonstrating the potential of causal experience learning for next-generation LLM agents. The project repository is available at https://github.com/OpenCausaLab/CauProphet.

新论文 · v1arXiv:2611.16913

CADET:构建带可执行演示的PCB布线实例

CADET: Construction of PCB Routing Instances with Executable Demonstrations

Hyungseok Song, Won-Seok Choi, Seohui Bae, Han-Seul Jeong, Junseok Park, Youngjoon Park, Soonyoung Lee

AI 速读 基于摘要

CADET联合生成合成PCB板与EDA引擎动作演示,构建RouteDemos数据集,并训练布线策略在真实测试板上提升无DRV完整布线率。

cs.AI · cs.LG

查看原文摘要

Printed circuit board (PCB) routing is the stage of physical layout that finds paths connecting the placed pads of each net. Public datasets in this domain are few, and most contain only the final states of routed boards, not demonstrations of the electronic design automation (EDA) engine actions that produce them. To close this gap, we propose CADET (Constructing executAble Demonstrations for Engine-grounded Training), which jointly generates synthetic boards and demonstrations built from EDA engine actions. The resulting RouteDemos provides 100,000 synthetic boards routed with zero design rule violations (DRVs), together with their demonstrations. Their distributions over 17 statistics resemble those of 142 real reference boards. CADET trains a routing policy on these demonstrations with behavior cloning and fine-tunes it with reinforcement learning (RL). On real test boards, the policy raised the rate of complete DRV-free routing from 38.0% to 67.2% over an RL-only baseline. This rate was comparable to that of the open-source autorouter FreeRouting and exceeded those of the other baselines, including GPT-6 Astra. We release the dataset and its generation code as open source at https://github.com/LGAI-Research/CADET.