跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+979新增论文
+781其中 AI 相关
+119已有论文修订
+95新增 AI 导读

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

统计口径与数据新鲜度

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

浏览论文库

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

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

用语义数据目录弥合 Solid 数据空间中的发现鸿沟

Bridging the Discovery Gap in Solid Dataspaces with a Semantic Data Catalog

Florian Hölken, Alexander Paulus, Tobias Meisen, André Pomp

AI 速读 基于摘要

作者提出一个面向 Solid 的、符合 FAIR 原则的语义数据目录,以缓解多 Solid 服务器去中心化数据空间中的数据发现难题。

cs.DB

查看原文摘要

Dataspaces are an emerging concept to enable secure and controlled data sharing between multiple stakeholders. However, most existing dataspace architectures, such as those based on the concepts of IDSA (International Data Spaces Association) and Gaia-X, are heavily concept-driven and require significant effort to implement, making it difficult to quickly build a functional dataspace. Solid (Social Linked Data) offers a compelling alternative by providing a lighter and more practical approach. However, for Solid to function as a true dataspace, like traditional dataspaces, it must be built in a decentralized manner, i.e., the dataspace must consist of more than a single Solid server. However, this decentralization introduces a key challenge: Data Discovery. Unlike traditional dataspace architectures, which often include predefined components such as data catalogs to facilitate data discovery and access, Solid does not inherently provide such mechanisms. As a result, managing and locating relevant data across multiple Solid servers and pods becomes a significant barrier to usability. To address this gap, we present a FAIR-compliant data catalog for Solid. Our catalog follows the FAIR principles (Findability, Accessibility, Interoperability, and Reusability) by integrating semantic models that describe all available data sources within the Solid ecosystem. This approach enables enhanced data discovery, improves accessibility through standardized metadata, enhances interoperability between different data sources, and promotes data reuse across applications. By bridging this critical gap, our catalog improves the usability of Solid-based dataspaces, making them a viable option for decentralized and open data ecosystems, such as smart city applications.

版本更新 · v2arXiv:2608.00799

CADENA:逐步式CAD逆向工程

CADENA: Stepwise CAD Reverse Engineering

Soslan Kabisov, Gennadiy Savrasov, Maksim Elistratov, Antonio Rodriguez, Daniil Ignatiev, Nikita Gavrilov, Rustam Uzdenov, Alexey I. Boyko 等 12 位作者

AI 速读 基于摘要

CADENA 以逐步生成并每步比对当前几何与目标的方式,将3D网格重建为参数化CAD程序,并引入按机械零件类别评测的 CADENA-Bench。

cs.CV

查看原文摘要

Computer-Aided Design (CAD) underpins modern engineering, yet converting existing shapes into editable models still demands substantial expert effort. Most AI systems emit the entire CAD program in a single pass, never inspecting the intermediate geometry. In contrast, human engineers build a part feature by feature, checking after each operation what remains to be modeled. We introduce CADENA (Spanish for "chain"), a model that reconstructs a 3D mesh as a parametric CAD program, growing its sequence of operations one at a time and comparing the target with the currently predicted geometry at every step. We also address the lack of benchmarks for evaluating reverse-engineering methods on mechanical parts, introducing CADENA-Bench, a benchmark that measures performance across categories of mechanical parts. CADENA outperforms prior methods on CADENA-Bench and on the DeepCAD, Fusion 360, and MCB datasets. Code is available at https://github.com/zhemdi/cadena, model weights at https://huggingface.co/kulibinai/cadena, and CADENA-Bench at https://huggingface.co/datasets/kulibinai/cadena-bench.

新论文 · v1arXiv:2611.24902

本地挖掘、全局验证:挖掘出的时序规则的精确恢复、编译与失真

Mine Locally, Verify Globally: Exact Recovery, Compilation, and Distortion of Mined Temporal Rules

Nikolaos Kekatos, Priyanka Sinha, Stylianos Basagiannis, Antonio Anastasio Bruto da Costa, Alexios Lekidis, Pabitra Mitra, Tom Nianios

AI 速读 基于摘要

研究分布式监控中如何聚合各观察者挖掘出的时序规则覆盖、判断是否需要时序窗口状态,并刻画事件丢失下的检测表现。

cs.DC · cs.LO · cs.NI

查看原文摘要

Specification mining extracts temporal rules that describe relationships between events in recorded system traces. Applying these rules in distributed monitoring systems is more difficult because observations come from different nodes, whose clocks may not be synchronized, and events may be lost or reordered during transmission. In this paper, we study how to aggregate the coverage of mined rules across observers, determine whether their temporal windows are needed during monitoring, and characterize their detection under event loss. Our evaluation uses IPv6 packet traces collected from 21 receivers across four continents. We show that local mining followed by global confirmation recovers centralized rule coverage under suitable conditions while substantially reducing communication overhead. In contrast, merging traces with unaligned clocks can distort coverage by introducing incorrect temporal matches. A window-gain criterion identifies rules that require temporal state, while our loss analysis and broker experiments demonstrate why contiguous losses can be more damaging than independent losses. The results identify separate requirements for aggregating observations, selecting monitor state, and handling event loss.

版本更新 · v2arXiv:2610.14226

CAPTOR:用于胸腹盆腔肿瘤CT的视觉-语言基础模型

CAPTOR: a vision-language foundation model for Chest-Abdomen-Pelvis Oncologic CT

Séléna Jean-Mactoux, Sophie Loizillon, Ghina Jardali, Amandine Crombé, Nathalie Lassau, Alexandre Bône

AI 速读 基于摘要

作者报告CAPTOR是一个基于解剖结构化预处理的视觉-语言基础模型,在肿瘤胸腹盆腔CT的分类、检索和生存预测任务上优于五个CT基础模型。

cs.CV · cs.AI

查看原文摘要

Objectives: Radiologists interpreting oncologic chest-abdomen-pelvis (CAP) CT must also detect non-oncologic conditions, yet existing CT foundation models are trained on single anatomical regions or on non-oncologic data. We developed and evaluated CAPTOR, a vision-language foundation model for oncologic CAP CT that uses an anatomically structured preprocessing strategy to learn from whole examinations. Materials & Methods: CAPTOR is a contrastive vision-language model pretrained on 25,512 predominantly oncologic CAP CT-report pairs (single or multiple series) from a retrospective multicenter dataset (North America, Europe, Asia). It was compared with five CT foundation models, a larger-scale variant (CAPTOR-100K) and an ablation without anatomical preprocessing (CAPTOR-NoPre) on classification and retrieval using held-out internal and public test sets, and on survival prediction using TumorImagingBench. Confidence intervals and pairwise comparisons used patient-level bootstrap and permutation tests. Results: On 10,794 test studies, CAPTOR achieved higher AUC than all five models on CAP (0.767 vs. 0.695 for the next-best model; p<0.001) and oncologic subsets (0.784 vs. 0.734; p<0.001), with superior retrieval on both, and ranked first on three of four oncologic survival benchmarks. Despite substantially fewer training examinations, it performed comparably to CAPTOR-100K. Removing the anatomically structured preprocessing reduced classification performance, including on the institutionally held-out test subset (macro-AUC 0.737 vs. 0.691 for CAPTOR-NoPre, p<0.01). Conclusion: Anatomically structured preprocessing enabled whole-examination CAP CT interpretation, including multiple-series acquisitions, and improved downstream performance. CAPTOR outperformed state-of-the-art CT foundation models on CAP and oncologic subsets while matching a substantially larger-scale variant.

新论文 · v1arXiv:2611.23198

降采样观测频率下学习型与运动学轨迹预测的对比

Learned versus Kinematic Trajectory Prediction under Reduced Observation Frequency

Nukhbala Gadzhiev, Alexander Morochko

AI 速读 基于摘要

在Argoverse 2上把历史观测从10 Hz降采样到5/2/1 Hz后,作者报告频率专用LSTM RNN相对常速度/常加速度模型的优势并未消失,但行人场景下常速度模型更准。

cs.LG · cs.RO

查看原文摘要

Trajectory prediction models for automated driving are usually trained on data with a fixed sampling frequency, while positions received via vehicle-to-everything (V2X) communication arrive at 1-10 Hz. We study whether a learned predictor that uses only the observation history keeps its advantage over constant velocity (CV) and constant acceleration (CA) models when the history frequency drops. On the Argoverse 2 motion forecasting dataset, the 5 s history of the focal agent was downsampled from 10 Hz to 5, 2, and 1 Hz, and the 6 s future was predicted without maps or neighboring agents. An LSTM-based recurrent neural network (RNN) trained for each frequency was compared with the same network trained at 10 Hz and applied to sparse histories after linear interpolation. Hypotheses and thresholds were fixed before training, the main RNNs were trained with ten seeds each, and results on 24,984 test scenarios have bootstrap confidence intervals over scenarios and seeds. The average displacement error of the frequency-specific RNN grew by 3.1% at 5 Hz, 10.1% at 2 Hz, and 20.3% at 1 Hz. Contrary to our hypothesis, its advantage over the better kinematic model did not vanish on straight motion and was 24-30% on both straight motion and turns at every frequency, while for pedestrians CV was more accurate. The 10 Hz model with interpolation was at most 1.3% less accurate than the frequency-specific model down to 2 Hz but 11.5% less accurate at 1 Hz. Each hypothesis was only partly supported.

新论文 · v1arXiv:2611.21497

CYBER-BRIDGE项目:面向欧盟跨境网络安全、合规与取证的人工智能平台

The CYBER-BRIDGE project: An AI-Powered Platform for Cross-Border Cybersecurity, Compliance and Forensics in the EU

Nikolaos Kekatos, Georgios Koutidis, Charalampos Bratsas, Stefan Bucur, Alexandra-Mihaela Chirlejan, Mihaela Curcă, Angelos Fountoulakis, Michael Ioannou 等 15 位作者

AI 速读 基于摘要

CYBER-BRIDGE项目提出统一架构与哈希链证据层,将AI驱动的威胁情报共享、多框架合规评估和跨境数字取证整合,以弥合欧盟中小企业和关键基础设施运营者的网络韧性差距。

cs.CR · cs.AI · cs.CY

查看原文摘要

Cross-border cyber attacks on European SMEs and critical-infrastructure operators expose a structural cyber-resilience gap: cybersecurity (threat sharing, detection, response), compliance (framework assessment, certification) and digital forensics (cross-jurisdictional evidence) are jointly regulated by NIS2, the CRA, GDPR and the LED, yet their tooling evolved in silos and rarely interoperates across Member States. The EU-funded CYBER-BRIDGE project integrates the three domains under one architecture and a hash-chained evidence layer: AI-driven CTI sharing with ENISA-aligned notification, multi-framework assessments with retrieval-augmented advisory, and RFC 3161-anchored custody with lawful GDPR/LED exchange, all aligned with MITRE ATT&CK. A sanitised replica of the back-end image hosts a Cyber-Range for upskilling. The contribution is not the individual tools but the reconciliation mechanism that lets one incident produce, from a single evidence record, a cross-border CTI advisory, the regulatory notifications its deadlines demand and a re-verifiable forensic pack; we set out why binding three differently regulated evidence regimes onto one record is non-trivial and how the shared evidence layer resolves the resulting tensions. This paper introduces the project's scope, requirements, pilots, architecture and toolkits; quantitative KPIs follow in later deliverables.

版本更新 · v2arXiv:2607.04688

URSA:面向实用性逆合成评估的化学感知基准

URSA: Chemistry-Aware Benchmark for Utilitarian Retrosynthesis Assessment

Bogdan Zagribelnyy, Ivan Ilin, Nikita Bondarev, Anton Morgunov, Arkadii Lin, Maksim Kuznetsov, Rim Shayakhmetov, Vladimir Aladinskiy 等 10 位作者

AI 速读 基于摘要

作者提出URSA评估框架,从化学合理性角度对专用逆合成系统与通用大语言模型的合成路线规划能力进行基准比较。

cs.LG · cs.AI · cs.CE · cs.CL

查看原文摘要

Synthesis planning aiming to find pathways of reactions for a target molecule is one of the most important and challenging tasks in drug discovery. Recent progress has produced both specialized deep-learning retrosynthesis systems and general-purpose large language models, but objective comparison remains difficult due to the lack of flexible, chemically interpretable benchmarking protocols. In the current study, we are introducing the URSA (Utilitarian RetroSynthesis Assessment) evaluation framework that provides the opportunity to benchmark the synthetic routes not only from a formal perspective, such as convergence to commercially available starting materials, but also from a chemical plausibility perspective, mimicking the way expert chemists evaluate the reactions and routes. The study covers a comprehensive evaluation of both conventional end-to-end retrosynthesis solutions and LLMs for the synthesis planning task on a set of novel, diverse target molecules with undisclosed synthetic routes, which represent realistic tasks in the daily drug design routine. Although LLMs can support high-level strategic planning and even achieve SOTA performance in the OOD set, the Pareto frontier for estimated run cost and chemically plausible route solvability consists entirely of specialized retrosynthesis planners.

新论文 · v1arXiv:2611.17240

物体作为地址:视觉Transformer注意力中的实例绑定

Objects as Addresses: Instance Binding in Vision Transformer Attention

Khalil Sabri, Guillaume-Alexandre Bilodeau, Nicolas Saunier, Wassim Bouachir

AI 速读 基于摘要

作者在八个预训练ViT中发现,实例分离更多体现在注意力的查询-键路由而非token内容上,同一物体的patch倾向于共享一个可移动的“注意力地址”。

cs.CV

查看原文摘要

Humans naturally parse visual scenes into coherent individual objects rather than scattered features, a capability cognitive science calls object binding. While recent work shows that pretrained Vision Transformers (ViTs) intrinsically acquire this ability, how native self-attention computations mechanistically keep object instances separate remains unresolved. By studying this across eight pretrained ViTs, we found that instance separation is expressed more strongly in attention routing than in token content: selected query-key relations distinguish individual objects more reliably than value similarity or residual representations. Inside heads, patches belonging to one individual tend to read from a common image region, which we term their attention address. Visually distinct parts of one person share an address, whereas identical duplicated instances receive separate, movable addresses. These shared destinations arise in part because query interactions with the spatial structure of keys direct attention toward consistent regions for one object and elsewhere for another. In DINOv2 and most other backbones we tested, editing this query component at the selected head redirects its attention address toward another individual. Grouping patches by this query component separates same-category instances, reaching .615 FG-ARI versus .289 for the same clustering of final-layer features, which tend to merge them.

新论文 · v1arXiv:2611.17226

面向协同过滤的LightGCN层论启发式结构化评分扩展

Sheaf-Inspired Structured Scoring Extensions of LightGCN for Collaborative Filtering

Ksenia Belkovskaya, Timur Lidzhiev, Maria Stebliy, Alexander Tarakanov

AI 速读 基于摘要

在固定三层LightGCN骨干上比较多种成对结构化评分器,考察其对排序质量与目录覆盖度的影响。

cs.IR · cs.CE · cs.CG · cs.LG

查看原文摘要

Graph-based collaborative filtering learns user and item representations by propagating embeddings over a user--item interaction graph. We investigate a modular, sheaf-inspired scoring extension placed on top of a three-layer LightGCN backbone. The motivation comes from cellular sheaves, where local vector spaces are related by linear restriction maps; here, this idea motivates structured, pair-dependent transformations of user and item embeddings rather than a change to graph propagation. We compare the identity inner-product scorer, diagonal, rank-one low-rank, and full matrix residual scorers, and a parameter-matched residual MLP baseline (\texttt{mlp\_full}) on Amazon-Book, Gowalla, MovieLens-1M, and Yelp2018. We report ranking quality and catalog coverage at cutoffs 10 and 20. The selected structured variants show modest, dataset-dependent changes in ranking quality and sometimes substantial changes in coverage. Our method is inspired by sheaf geometry but does not construct a cellular sheaf or implement sheaf-Laplacian diffusion; the experiments therefore do not establish a causal benefit from sheaf geometry itself.

新论文 · v1arXiv:2611.17185

面向交互式与可微光照的神经渲染代理

Neural Render Proxies for Interactive and Differentiable Lighting

Sergio Sancho, Alexander Rath, Marco Manzi, Pascal Chang, Amit H. Bermano, Derek Nowrouzezahrai, Markus Gross, Marios Papas

AI 速读 基于摘要

作者提出一种神经渲染代理(NRP),通过将渲染解耦为路径采样与发光计算,实现固定相机与材质下静态场景的可交互、可微重光照。

cs.GR · cs.CV

查看原文摘要

Within the CG animation production pipeline, the challenges artists tackle in Lighting can be immense. Even minor adjustments require re-rendering massive scenes with slow offline renderers; global illumination has to be sampled and complex shaders have to be evaluated, leading to iteration times of minutes to hours per frame. To accelerate this process, we introduce a novel neural render proxy (NRP) that enables differentiable relighting of static scenes with fixed camera and materials at interactive rates. Our main insight is the decoupling of traditional rendering into path sampling and emission computation. From a single, light-agnostic render pass, we collect light transport data in the form of path samples. This enables rapidly sampling lighting conditions on the fly, and training a scene-specific lightweight neural network that learns how light is transported from any scene location to any image pixel. This approach is compatible with non-differentiable production renderers, induces minimal memory requirements during inference, and scales only with resolution and the number of light sources and parameters, but independently of scene and appearance complexity. Our evaluation demonstrates interactive frame rates for relighting (~30-60 Hz) while closely approximating the visual fidelity of ground-truth path tracing. In addition, the differentiable NRP enables fast, gradient-based inverse workflows, allowing artists to efficiently solve for lighting parameters from intuitive image-space edits or generative targets.

版本更新 · v3arXiv:2608.11426

趋同是否不可避免?将输出同质性追溯至基座模型

Is Convergence Inevitable? Tracing Output Homogeneity Back to Base Models

Alexandrine Fortier, Hazel Chen, Peter West

AI 速读 基于摘要

作者提出语言模型输出同质性可能源于预训练而非对齐,SFT 只是揭示或放大这一现象。

cs.CL

查看原文摘要

The lack of diversity in LM content is widely attributed to the alignment process, but how and where exactly in the pipeline this collapse begins is unknown. We argue that output homogeneity is likely learned during the pretraining phase, and only revealed or magnified during the alignment process. Specifically, we find that semantic convergence is observed from the first alignment stage--the instruction-tuning phase (SFT)--suggesting that homogeneity might already exist in the pre-alignment model. To investigate this, we conduct controlled SFT experiments examining how training data influences output convergence on specific input/output pairs. We find that convergence can be revealed and amplified, but not introduced by the SFT data, supporting its role as a catalyst rather than a cause. To further test whether homogeneity originates before alignment, we measure convergence in base models. We find that instruct-like collapse can be induced through prompting alone, even without alignment. Taken together, our results suggest that semantic convergence may arise naturally from the objectives underlying LM training, making it difficult to mitigate through post-alignment interventions alone.

新论文 · v1arXiv:2611.17098

速度即算力:美国本土 AI 数据中心供电的技术经济分析

Speed-to-Power Dominates Energy Costs for AI Data Centers: Technoeconomic Analysis of Powering AI in the Continental United States

Alex C. Newkirk, Daniel L. Gerber, Erica R. H. Fuchs, Alex Hubbard, M. Granger Morgan, Arman Shehabi, Sarah J. Smith, Constantine Samaras

AI 速读 基于摘要

作者提出“速度调整后的度电成本”,把建设速度带来的算力收益纳入比较,发现直流耦合微电网因部署更快,在多数美国地点成为经济上最优的 AI 数据中心供电方案。

cs.AI · eess.SY

查看原文摘要

The rapid growth of artificial intelligence is driving demand for new data centers at large scale and on short deployment timelines. To power them, firms connect to the commercial grid or contract generation directly, but interconnection and gas-turbine delays now incentivize on-site generation. We compare grid-connected and off-grid data center energy infrastructure (AC- and DC-coupled solar-plus-storage, islanded natural gas, and grid interconnection) across the continental U.S. Using an open-source technoeconomic framework built on empirically calibrated AI training loads, climate-driven cooling, stage-by-stage power conversion, and physics-based battery degradation, we model designs providing equivalent energy services. Our central contribution is a speed-adjusted cost of energy that values the compute unlocked by faster construction, making options with different deployment timelines directly comparable on one physically consistent basis. We find DC coupling reduces lifetime energy costs by 18% ($0.09/ kWh) on average versus AC counterparts by eliminating inverters and improving efficiency. Though rarely cheapest on unadjusted energy cost, DC-coupled microgrids' faster deployment makes them the lowest-cost modeled option in 85% of U.S. locations once foregone compute is valued, or 55% under accelerated natural gas timelines. For AI infrastructure, deployment speed rather than unit energy cost determines the economically preferred path to power.

新论文 · 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.16929

SPADE:面向AI文本检测的软提示

SPADE: Soft Prompts for Ai-text DEtection

Alex Jiang, Didier Schwab, Chuyuan Li

AI 速读 基于摘要

SPADE 通过度量提示对文本的解释程度(PMI)作为判别信号,为每个类别训练一个软提示,从而提升AI生成文本检测的跨数据集泛化能力。

cs.CL · cs.AI

查看原文摘要

The easy access to Large Language Models (LLMs) has made AI-generated texts on the web increasingly ubiquitous, making AI-text detection a crucial task. Prompts greatly influence the generation process, but existing detectors focus solely on the generated texts --- supervised methods learn from labeled texts only, and zero-shot methods rely on the text's probability distributions --- ignoring the underlying generation process, which limits their robustness in open-world scenarios. We introduce SPADE: Soft Prompts for Ai-text DEtection, a novel framework for detecting AI-generated text that transfers better across datasets. Specifically, we measure the prompt's influence and use it as a discriminative signal. We characterize the prompt's influence by introducing a Pointwise Mutual Information (PMI) term that captures how much a prompt explains a text. Based on this quantity, SPADE trains one soft prompt per class to amplify the separation, and predicts the class whose prompt best explains the candidate text. Extensive experiments on several benchmarks against various detectors demonstrate the robustness and effectiveness of our method, achieving state-of-the-art (SOTA) performance on out-of-distribution (OOD) datasets.

新论文 · v1arXiv:2611.16883

最优多联骨牌围栏

Optimal Polyomino Fences

Alexis Langlois-Rémillard, Mia N. Müßig, Helmut Podhaisky, Erika Roldan, Günter Rote, Maximilian Brömme, Matthes Norden, Maximilian Prietzel 等 10 位作者

AI 速读 基于摘要

该论文用动态规划方法研究多联骨牌围栏问题,证明了五联骨牌和六联骨牌围栏的最优性,并给出了高达15联骨牌的启发式解和上界,还将问题推广到三维。

math.CO · cs.CG · cs.DM

查看原文摘要

The $n$-omino fence problem asks how many cells can be surrounded by placing every $n$-omino exactly once in the grid. We present a new dynamic programming approach for this problem, allowing us to prove optimality for the pentomino and hexomino fence and to classify all possible pentomino orders by optimal area. For the first time we also provide strong heuristic solutions and upper bounds for all fences up to $n = 15$, after which we even approximate the $500$-omino fence with computational experiments. Finally, we generalize the problem to 3D, where we prove optimality for pentacubes and derive heuristic solutions for hexacubes and heptacubes.

新论文 · v1arXiv:2611.16833

早期引用实践与科学写作中人工智能使用迹象的关联

Earlier citation practices are linked to signs of artificial intelligence use in scientific writing

Hongkan Chen, Yongyuan He, Qingshan Zhou, Yi Bu

AI 速读 基于摘要

作者报告,早期引用行为(引用较旧文献、跨子领域较少、更多重复引用)与后续科学写作中较少出现AI辅助迹象相关,且这种关联在2023年前已存在。

cs.DL

查看原文摘要

As artificial intelligence (AI) becomes more common in scientific writing, some authors show fewer signs of AI assistance than expected across successive periods. We analysed OpenAlex publication histories for 71,133 authors with at least one eligible first-authored English-language publication each year from 2023 through September 2026. Using abstract-based writing scores, we defined resistance as the predicted minus observed share of abstracts classified as AI-assisted. Positive scores indicate fewer such abstracts than expected. Early resistance was positively associated with later resistance, although the share with positive scores fell. Environmental characteristics contributed more than individual characteristics to predicting later scores, although overall predictive power was low. Having a collaborator with a non-positive early score was associated with lower subsequent resistance. Authors with positive mean scores in both 2023-2024 and 2025-2026 cited older work, drew on fewer subfields and more often cited sources they had used before than authors with non-positive mean scores in both periods. These differences were evident before 2023. The adjusted gap in reference reuse rose from 3.24 percentage points before 2023 to 7.95 in 2025-2026. The findings link variation in signs of AI assistance to earlier differences in how scientists used prior work.

新论文 · v1arXiv:2611.14516

TorchCurves:可微参数曲线

TorchCurves: Differentiable Parametric Curves

Alex Shtoff

AI 速读 基于摘要

TorchCurves 是一个 PyTorch 库,把向量值参数曲线当作可学习的基本单元,支持对曲线输入和系数进行自动微分。

cs.LG · stat.ML

查看原文摘要

We present TorchCurves, a PyTorch library that treats vector-valued parametric curves as learnable primitives. Its central operation maps batches of scalar inputs to points on curves represented in B-spline or Legendre polynomial bases, with differentiation through both inputs and coefficients. Curve coefficients can be optimized jointly with the surrounding model or produced by another network. The library provides trainable modules, reusable basis modules, and a functional interface, supporting applications ranging from continuous feature embeddings to Kolmogorov-Arnold networks and functional regression. Its implementation combines classical evaluation algorithms with vectorized PyTorch operations, emphasizing readability and maintainability without custom hardware kernels. Timing experiments compare curve evaluation against NumPy and SciPy and KAN training against EfficientKAN across a range of problem sizes. The results illustrate where this generality remains computationally practical and where overhead is substantial. Library is available on GitHub at https://github.com/alexshtf/torchcurves.

版本更新 · v3arXiv:2606.12683

从AGI到ASI

From AGI to ASI

Tim Genewein, Matija Franklin, Alexander Lerchner, Laurent Orseau, Samuel Albanie, Adam Bales, Cole Wyeth, Stephanie Chan 等 14 位作者

AI 速读 基于摘要

该报告探讨后AGI时代机器智能如何沿连续谱继续发展,重点分析从人类水平AGI到人工通用超级智能(ASI)的过渡路径、摩擦与开放研究问题。

cs.AI · cs.CY · cs.LG

查看原文摘要

Over the last decade, building human-level artificial general intelligence has moved from far-fetched speculation to being a concrete next-decade target for many of the largest AI organizations. Achieving this goal would have profound and far-reaching impacts on human society, which raises many complex questions for the decade ahead. This report investigates how AI itself might continue to develop in a post-AGI world along the continuum of machine intelligence. The endpoint of this continuum, Universal AI, is theoretically well understood, which provides some formal grounding for the main focus of this report: the transition from human-level AGI to artificial general superintelligence, which can intuitively be understood as a system that is more intelligent and cognitively capable than large organizations of humans. After characterizing ASI, the report discusses four potential pathways from AGI to ASI: scaling AGI, AI paradigm shifts, ASI emerging from large-scale multi-agent collectives, and recursive improvement. The report then discusses possible frictions and bottlenecks along these pathways. Determining whether the impact of these frictions will be negligible or substantial raises a number of concrete open research questions. While large uncertainties for predicting ASI progress remain, it cannot be ruled out that AI progress might continue to accelerate over the next years. This would imply that the image of a single transformative step change, caused by the introduction of human-level AGI into our society, could be inaccurate. More apt might be the prospect of a series of transformative societal changes caused by AI-enabled progress and breakthroughs across many areas of science and technology. Preparing for this prospect requires a massively interdisciplinary endeavor of global scope and interest.

新论文 · v1arXiv:2611.14338

信息论视角下调节性T细胞定位作为IL-2干扰滤波器

An Information-Theoretic Perspective on Regulatory T Cell Localization as an IL-2 Interference Filter

Alexander Wietfeld, Kristina A. Ganzinger, Wolfgang Kellerer, Andrew W. Eckford

AI 速读 基于摘要

作者将相邻免疫激活位点建模为分子通信系统,用三维IL-2场耦合T细胞群体动力学,分析Treg聚集作为IL-2“汇”对邻近位点干扰的抑制效果。

cs.IT · cs.ET

查看原文摘要

Diffusible signals enable communication between immune cells but can also create interference between nearby activation sites. In lymph nodes, effector T cells (Teff) concentrate around antigen-presenting cells (APCs), release interleukin-2 (IL-2) following antigen recognition, and sense IL-2 through cell-surface receptors. Experiments show high-uptake regulatory T cells (Treg) clustered around IL-2-producing cells. However, it is unclear how strongly responses at neighboring activation sites are coupled through diffusible IL-2, and how this coupling is influenced by the spatial organization of Treg acting as IL-2 sinks. We interpret two neighboring sites as a molecular communication system and study the effect of clustering using a three-dimensional IL-2 field coupled to T cell population dynamics. Across a broad parameter sweep, clustering Treg produces a larger mean reduction in neighboring-site interference than adding dispersed Treg. Compared with no Treg, clustered Treg suppress interference while largely preserving the strong local response with corresponding consequences for population expansion and survival. Information-theoretic analysis shows improved discrimination between weak and strong local sources at short separation, whereas at larger separation clustering primarily reduces the remaining estimated neighboring-source information. These findings support a spatial-filtering role for Treg clustering in maintaining locally informative immune responses.

版本更新 · v3arXiv:2506.03013

将 Hugging Face 模型编目到软件工程活动:自动化与发现

Cataloguing Hugging Face Models to Software Engineering Activities: Automation and Findings

Alexandra González, Xavier Franch, David Lo, Silverio Martínez-Fernández

AI 速读 基于摘要

作者构建了覆盖146项软件工程任务的分类体系,并通过仓库挖掘为 Hugging Face 上的预训练模型建立面向软件工程的目录,最终得到5,027个软件工程预训练模型。

cs.SE · cs.LG

查看原文摘要

Context: Open-source Pre-Trained Models (PTMs) provide extensive resources for various Machine Learning (ML) tasks, yet these resources lack a classification tailored to Software Engineering (SE). Objective: To address this gap, we derive a taxonomy encompassing 146 SE tasks and apply an SE-oriented classification to PTMs in a popular open-source ML repository, Hugging Face (HF). Method: Our repository mining study followed a five-phase pipeline: (i) identification of SE tasks from the literature; (ii) collection of PTM data from the HF API, including model card descriptions and metadata, and the abstracts of the associated arXiv papers; (iii) text processing to ensure consistency; (iv) a two-phase validation of SE relevance, involving humans and LLM assistance, supported by five pilot studies with human annotators and a generalization test; and (v) data analysis. This process yielded a curated catalogue of 5,027 SE PTMs. Results: We find that most SE PTMs target code generation and coding, emphasizing implementation over early or late development stages. In terms of ML tasks, text generation dominates within SE PTMs. Notably, the number of SE PTMs has increased markedly since 2023 Q2, while benchmarking remains limited: only 5.55\% of all SE PTMs in our catalogue provide evaluation results. Conclusions: Our catalogue reveals documentation and transparency gaps, highlights SE activity imbalances, and supports automated SE scenarios, such as the selection of suitable PTMs.

版本更新 · v2arXiv:2607.22864

Spatial-IQ:通过分层能力测试解构空间智能

Spatial-IQ: Deconstructing Spatial Intelligence via Hierarchical Capability Tests

Patrick Rim, Tom Long, Ekta Prashnani, Ruth Rosenholtz, Ben Boudaoud, Peter Xenopoulos, Alex Wong, Joohwan Kim 等 9 位作者

AI 速读 基于摘要

提出分层诊断框架 Spatial-IQ,将堆叠 3D 结构中的物体计数拆解为 9 个感知与认知子任务,用于定位多模态大模型空间推理失败的具体环节。

cs.CV · cs.AI

查看原文摘要

Multimodal large language models (MLLMs) excel at visual interpretation but fail on spatial reasoning tasks that humans solve reliably. Existing benchmarks evaluate these models as black boxes, limiting their ability to identify the underlying causes of lower performance: when a model fails a spatial reasoning task, it remains difficult to ascertain whether the hurdle is perceptual, such as recognizing object boundaries, or cognitive, such as reasoning about occlusion to infer hidden geometry. We introduce Spatial-IQ, a hierarchical diagnostic framework that decomposes object counting in stacked 3D structures into 9 perceptual and cognitive sub-tasks organized by the developmental stages of human spatial cognition, with mental rotation as an additional target probe. Using NVIDIA Isaac Sim, we procedurally generated a diverse dataset of roughly 80,000 stacked 3D structures with per-task ground truth. We evaluate models across three output formats (free-response text, multiple-choice images, and image editing) alongside a human baseline. The Spatial-IQ framework shows that top-performing models often succeed at the target task (object counting) without succeeding on the lower-level sub-tasks intended to support it, and that models differ in how much of these hierarchical chains they preserve, often revealing shortcut behavior that raw target-task accuracy alone would obscure. Finally, we demonstrate that training models with chain-of-thought (CoT) supervision over our hierarchical sub-tasks, combined with reinforcement learning with verifiable rewards, significantly improves both spatial consistency across sub-tasks and target-task accuracy, supporting the value of the proposed decomposition as both a diagnostic tool and a training signal.

新论文 · v1arXiv:2611.09889

SciCheck:深度学习训练完整性验证框架

SciCheck: A Framework for Verifying the Integrity of Deep Learning Training

Alexander Nguyen, Dylan Gresham, Gaby G. Dagher, Min Long

AI 速读 基于摘要

提出 SciCheck 框架,用统计判据加随机片段抽查,在溯源账本上验证深度学习训练过程的完整性。

cs.CR

查看原文摘要

Deep learning training is difficult to verify within a scientific workflow: its architecture, hyperparameters, and procedure are rarely fixed until training has been attempted, and two honest runs never produce the same weights, so recomputation cannot serve as a check. We present SciCheck, a framework in which the scientist explores training configurations freely and posts a blueprint to a provenance ledger for each candidate they want verified, and a verifying scientist judges the resulting run in two layers: a statistical judge model that compares per-step gradient statistics against the verifier's own reference run, and a spot-check that re-executes randomly chosen training segments whose checkpoints are committed to the ledger one epoch at a time. On an MLP, a CNN, and an autoencoder at 100k-500k parameters, under gradient sign flipping, label poisoning, and fabricated runs, SciCheck reaches F1 of 0.966, 0.906, and 0.976 while rejecting 0-4.4% of honest runs. For the attacks we test, the spot-check accounts for most of this accuracy, and we characterize what each layer can detect. The effective-signal statistic falls as $(1-2s)^2$ under a sign flip of severity $s$, so gradient statistics alone catch strong enough sign flips, while fabricated runs that replay genuine statistics look no more anomalous than honest runs to any statistical detector we test. The spot-check catches fully fabricated segments with probability at least $1-(1-s)^k$ for $k$ sampled segments when the draws stay hidden until the run is committed, which roughly matches our measurements and lets a verifier choose $k$ for a target soundness. Verification costs 1.5-2.3x one retraining, mostly for the verifier's reference run; each submission's spot-check takes under 1.5 s, and per-epoch commitments reduce checkpoint storage 5-17x compared with keeping every checkpoint.

新论文 · v1arXiv:2611.09882

FlowMoP:随机多人运动预测

FlowMoP: Stochastic Multi-Person Motion Prediction

Aadya Agrawal, Ho Kei Cheng, Alexander Schwing

AI 速读 基于摘要

提出基于条件流匹配的多人三维运动预测框架,联合生成多智能体多样且交互感知的未来运动分布。

cs.CV · cs.LG

查看原文摘要

Predicting the future motion of multiple people is inherently stochastic: the same observed history admits many plausible continuations depending on intent, coordination, and social context. Yet the dominant paradigm in multi-person 3D motion prediction remains deterministic, with existing methods producing a fixed number of outputs per agent. In contrast, we present a conditional flow matching framework that jointly generates diverse future motions for multiple agents, modeling both global trajectories and root-relative poses. A B-spline reparameterization compresses the generative state space while enforcing temporal smoothness, and a dual-stream transformer conditions each agent's predictions on observed neighbor motion for interaction-aware forecasting. Our method achieves state-of-the-art performance on CMU-Mocap (UMPM) and 3DPW, outperforming deterministic baselines on joint position error, pose error, and final displacement error despite producing a full predictive distribution. We additionally establish the first motion prediction baseline on WorldPose, a large-scale professional soccer dataset, where social conditioning demonstrably concentrates predictive uncertainty along interaction-constrained directions.

版本更新 · v2arXiv:2603.04399

SimpliHuMoN:简化人体运动预测

SimpliHuMoN: Simplifying Human Motion Prediction

Aadya Agrawal, Alexander Schwing

AI 速读 基于摘要

作者提出一种简洁的端到端 Transformer 模型,用统一的架构同时处理姿态预测、轨迹预测及二者联合的人体运动预测。

cs.CV · cs.LG

查看原文摘要

Human motion prediction combines the tasks of trajectory forecasting and human pose prediction. For each of the two tasks, specialized models have been developed. Combining these models for holistic human motion prediction is non-trivial, and recent methods have struggled to compete on established benchmarks for individual tasks. To address this, we propose a simple yet effective transformer-based model for human motion prediction. The model employs a stack of self-attention modules to effectively capture both spatial dependencies within a pose and temporal relationships across a motion sequence. This simple, streamlined, end-to-end model is sufficiently versatile to handle pose-only, trajectory-only, and combined prediction tasks without task-specific modifications. We demonstrate that this approach achieves state-of-the-art results across all tasks through extensive experiments on a wide range of benchmark datasets, including Human3.6M, AMASS, ETH-UCY, and 3DPW.

版本更新 · v2arXiv:2610.02945

面向AI辅助数学发现的持续图记忆与社区基础设施

Continual Graph Memory and Community Infrastructure for AI-Assisted Mathematical Discovery

Eric Hanchen Jiang, Junyi Zhang, Jinxi Yu, Jiachen Lu, Zhi Zhang, Michael Simon, Justin Baker, Richard Cai 等 30 位作者

AI 速读 基于摘要

作者提出Ansatz研究框架与Ansatze社区平台,用持续图记忆区分模型接受的结论与人工整理探索,并支持数学研究的检查、引导与形式化验证。

cs.AI · cs.CL

查看原文摘要

Mathematical discovery requires preserving partial ideas and the evidence supporting their reuse. We present Ansatz, a research harness whose continual graph memory separates model-accepted claims and dependencies from curated exploration, and Ansatze, a community platform for inspecting, guiding and checking this work. On First Proof, Ansatz recorded nine local verifier closures in each of two ten-problem batches; a partial result in the Second Batch also counted as a pass under the study's criterion. These model-assessed outcomes include continued searches and differ from expert validation. Component studies and re-review expose disagreements and their dependency reach. Open-problem investigations produced candidate results, with five Lean formalizations reported. The platform connects problem discovery, research records, manuscript analysis and formal checking while preserving distinct evidence states. Together, these systems support cumulative human-AI research through persistent investigation and inspectable contributions.

版本更新 · v2arXiv:2605.05921

意图建构与意义建构:人类与AI引导的数学发现交互

Intentmaking and Sensemaking: Human Interaction with AI-Guided Mathematical Discovery

Alex Bäuerle, Adam Connors, Alexander Novikov, Adam Zsolt Wagner, Ngân Vũ, Fernanda Viegas, Martin Wattenberg, Lucas Dixon

AI 速读 基于摘要

通过对11位数学家使用进化编码智能体AlphaEvolve三个月、逾2300次实验的研究,提出并刻画“意图建构”(intentmaking)作为“意义建构”(sensemaking)的对应过程。

cs.AI · cs.HC

查看原文摘要

Artificial intelligence offers powerful paradigms for scientific discovery, orchestrating autonomous inner search loops over long horizons. However, discovery remains bottlenecked by the friction of the outer human-AI loop: the cycle where domain experts formulate research objectives, diagnose reward hacks, and extract meaning. We present findings from a study with 11 expert mathematicians using AlphaEvolve, an evolutionary coding agent, across more than 2,300 experiments over three months. We identify and characterize intentmaking, the iterative process of discovering, defining, and refining experimental goals through system interaction, as a reciprocal counterpart to sensemaking. We observe that domain experts effectively alternate between steering the search space (intentmaking) and extracting mathematical insights (sensemaking). Our findings suggest an approach to designing AI tools for scientific discovery that moves beyond the existing question--answer model, treating them as collaborative instruments rather than opaque black-box oracles.

版本更新 · v2arXiv:2605.23362

预算约束下多LLM评审的实例最优估计

Instance-Optimal Estimation with Multiple LLM Judges on a Budget

Junghyun Lee, Sanghwa Kim, Yassir Jedra, Alexandre Proutière, Se-Young Yun

AI 速读 基于摘要

在固定预算下,研究如何将评估查询分配给价格与可靠性各异的多个LLM评审和不同难度的实例,以最准确地估计得分向量。

cs.LG · cs.IT · math.ST · stat.ML

查看原文摘要

Evaluating large language models increasingly relies on LLM-as-a-judge protocols, but such evaluations remain costly: different judges have different prices and reliabilities, and the difficulty of each prompt-response pair can vary substantially. This raises a basic allocation question: under a fixed budget, how should one distribute evaluation queries across heterogeneous judges and instances to obtain the most accurate score estimates? We formalize this question as budgeted heteroskedastic multi-judge estimation under independent, unbiased score observations. Given $K$ prompt-response pairs and $J$ judges with known costs but unknown query-judge variances, our goal is to estimate the bounded score vector while minimizing an $\ell_p$-error. Our first contribution is to analyze the inverse-variance weighted estimator (IVWE) and to derive the oracle allocation that minimizes its leading error bound. Since this allocation depends on the unknown variances, we then address the unknown-variance setting by proposing EST-IVWE, an adaptive algorithm that constructs and uses optimistic variance estimates to stabilize the empirical allocation. We prove that EST-IVWE matches the oracle IVWE rate up to lower-order terms in the budget. Our second and central theoretical contribution is a local minimax lower bound matching the leading allocation-dependent rate, establishing asymptotic instance-optimality up to logarithmic factors. An Assouad-type construction based on local, variance-preserving perturbations yields this bound both in expectation and with constant probability. A complementary Fano-type change-of-measure argument captures the logarithmic dependence on the confidence level with a different (suboptimal) allocation geometry. Finally, we numerically validate our approach on synthetic data and resampled HelpSteer2 evaluations, demonstrating improvements over naïve uniform allocation.

版本更新 · v2arXiv:2609.30467

基于检索的开放式评估在哪里失败?从长篇医学答案事实性验证中自动归纳分类体系

Where Does Retrieval-Based Open-Ended Evaluation Fail? Automatic Taxonomy Induction from Long-Form Medical Answer Factuality Verification

Heyuan Huang, Jirui Dai, Alexandra DeLucia, Sonal Joshi, Mahsa Yarmohammadi, Jie Gao, Bernal Jiménez Gutiérrez, Mark Dredze

AI 速读 基于摘要

作者针对开放式医学答案的检索式事实性验证,构建两套失败分类体系,并用自动模式归纳与压力测试揭示检索与验证环节的系统性失败模式。

cs.CL · cs.IR

查看原文摘要

Retrieval-based factuality evaluation, where LLM-generated claims are verified against evidence from authoritative medical corpora, has become the dominant paradigm for scalable hallucination detection in high-stakes clinical settings. Despite the urgency of reliable and transparent medical fact verification, most systems measure performance with aggregate metrics like F1, which obscure where and why failures occur. Existing RAG diagnostics require gold answers or annotated gold evidence, neither of which exists in this regime. We introduce two comprehensive taxonomies, grounded in a case study on the open-ended MedExpert dataset and 3 closed-ended datasets, decomposing failures into retrieval-stage errors along five quality dimensions, and verifier-reasoning errors into six consecutive steps. We adapt an automatic pattern induction pipeline using LLM-as-Judge to label evidence quality and classify verifier reasoning errors at scale, and then stress-test our findings across 4 retrieval methods and 6 frontier verifier models. Our analysis reveals that scaling model size, adding reasoning effort, expanding to authoritative web sources, and applying medical fine-tuning do not resolve these failure modes, demonstrating that they represent fundamental limitations of the retrieve-then-verify paradigm in open-ended medical settings rather than artifacts of outdated systems. We release our code and data at https://anonymous.4open.science/r/Medical_RAG_eval-4AB5 for the full reproducibility of our results.

版本更新 · v2arXiv:2610.30086

Orbitol:基于Wyckoff轨道的晶体生成

Orbitol: Crystal Generation on Wyckoff Orbits

Ivan Žugec, Joshua Rosenthal, Ivor Lončarić, Jan-Willem van de Meent, Tin Hadži Veljković

AI 速读 基于摘要

Orbitol 用 Wyckoff 轨道令牌替代原子令牌,在给定空间群下生成满足对称性约束的晶体结构,并用于压电晶体候选筛选。

cs.LG

查看原文摘要

Generative models propose crystalline materials by learning composition and geometry, but unconditional sampling gives no direct control over the space group, which constrains whether responses such as piezoelectricity are symmetry-allowed. We present Orbitol, a crystal generator built on the Crystalite diffusion Transformer that replaces atom tokens with Wyckoff-orbit tokens. Given a space group and a collection of occupied Wyckoff positions, Orbitol generates the atom type and free coordinates of each orbit together with a compatible lattice, so every valid structure is invariant under the operations of the requested group. It generates structures two to three orders of magnitude faster than the symmetry-aware baselines at the evaluated settings. On MP-20, 13.8% of Orbitol's attempts yielded stable or metastable, unique and novel structures that retained the requested space group after relaxation, compared with 10.8% for SGFM, the next best model. We also introduce SPARC, a score that combines retention of the raw detected space group with agreement between the retained-group and training distributions. Finally, we used Orbitol to generate candidates in piezoelectric crystal classes. Of the structures selected by internal screening, 89% passed our density functional theory checks, and 79% also matched no Materials Project or Alexandria entry with the same space group. Their median figure of merit was nine times that of the piezoelectric materials computed in the Materials Project, and 24% of the new candidates ranked in that set's top 10%.

新论文 · v1arXiv:2611.08263

通过解耦行为预训练扩展神经运动解码

Scaling Neural Motor Decoding via Decoupled Behavioral Pretraining

Divyansha Lachi, Vinam Arora, Shivashriganesh P. Mahato, Alexandre Andre, Eva L. Dyer

AI 速读 基于摘要

提出 BEEMO 框架,将行为表征学习与神经表征学习解耦,利用大量无配对行为数据提升神经运动解码性能与跨任务迁移。

cs.LG · cs.AI

查看原文摘要

Recent neural decoding approaches achieve strong performance by training on large collections of paired neural-behavioral recordings, but such datasets are expensive, invasive, and difficult to scale. In contrast, behavioral data is abundant and easy to collect, raising the question of whether neural decoding can benefit from decoupling behavioral and neural representation learning. We introduce BEEMO, a flexible multi-session framework that enables training with arbitrary mixtures of paired neural-behavioral recordings and unpaired behavioral data. A behavior decoder learns movement dynamics directly from behavioral trajectories, while neural activity is incorporated through cross-attention layers when available, allowing behavioral and neural supervision to scale independently. Across multiple intracortical motor datasets and tasks in nonhuman primates, we show that incorporating unpaired behavioral data improves decoding performance, particularly when transferring to new tasks, and that adding even a small amount of behavioral data from the target task further improves transfer. By decoupling neural and behavioral data, we unlock a new dimension for scaling: unpaired behavioral data, which is substantially cheaper and easier to collect than paired neural recordings, can be used directly to improve decoding performance. We further show that behavior-only pretraining, without any neural pretraining, achieves performance comparable to models pretrained on substantially larger neural datasets. Together, our results suggest that scaling behavioral data offers a practical and cost-effective path toward neural decoding models that generalize across subjects and tasks. Code is available at https://github.com/nerdslab/beemo.