跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+479新增论文
+361其中 AI 相关
+63已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 13:44各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 13:44库内论文最新更新时间:2026-11-14 02:59

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

23,827 已收录论文19,941 AI 相关6,921 有修订112 HF 社区发现

浏览论文库

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

找到 17,708 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v3arXiv:2509.17100

The SAGES Critical View of Safety Challenge: A Global Benchmark for AI-Assisted Surgical Quality Assessment

Deepak Alapatt, Jennifer Eckhoff, Zhiliang Lyu, Yutong Ban, Jean-Paul Mazellier, Sarah Choksi, Kunyi Yang, Po-Hsing Chiang 等 41 位作者

原文摘要

Advances in artificial intelligence (AI) for surgical quality assessment promise to democratize access to expertise, with applications in training, guidance, and accreditation. This study presents the SAGES Critical View of Safety (CVS) Challenge, the first AI competition organized by a surgical society, using the CVS in laparoscopic cholecystectomy, a universally recommended yet inconsistently performed safety step, as an exemplar of surgical quality assessment. A global collaboration across 54 institutions in 24 countries engaged hundreds of clinicians and engineers to curate 1,000 videos annotated by 20 surgical experts according to a consensus-validated protocol. The challenge addressed key barriers to real-world deployment in surgery, including achieving high performance, capturing uncertainty in subjective assessment, and ensuring robustness to clinical variability. To enable this scale of effort, we developed EndoGlacier, a framework for managing large, heterogeneous surgical video and multi-annotator workflows. Thirteen international teams participated, achieving up to a 17% relative gain in assessment performance, over 62% reduction in calibration error, and a 17% relative improvement in robustness over the state-of-the-art. Analysis of results highlighted methodological trends linked to model performance, providing guidance for future research toward robust, clinically deployable AI for surgical quality assessment.

cs.CV

新论文 · v1arXiv:2611.15610

Contrastive Bootstrap Representation Learning for Label-Efficient Agricultural Image Classification

Hazem Ahmed, Ali Hamdi, Ammar Mohammed

原文摘要

Expert annotation remains a major bottleneck in agricultural image classification, where collecting images is often easier than obtaining reliable labels from domain specialists. Self-supervised learning can reduce this dependence by pretraining transferable representations on unlabelled imagery. Contrastive and bootstrap methods provide two established but distinct training signals, motivating an empirical study of a formulation that applies both signals within one representation path under severe downstream label scarcity. We present Contrastive Bootstrap Representation Learning (CBRL), which jointly optimises SimCLR-style NT-Xent contrastive learning and bidirectional BYOL-style exponential-moving-average target prediction within a shared online projection space. Using a ViT-L/16 backbone and 10% of the downstream labels, we report single-seed point estimates on four primary agricultural test benchmarks plus an exploratory 33-image New Plant Diseases evaluation. CBRL records the highest macro-F1 point estimate on the four primary benchmarks. On DeepWeeds, its 79.77% test macro-F1 is 32.29 points above the random-initialisation, label-only baseline and 15.78 points above the next-highest comparison point estimate; on PlantVillage, its 98.14% macro-F1 is 10.43 and 0.43 points higher, respectively. On PlantDoc, however, all methods fail to reach practically useful performance. These results identify the evaluated joint formulation as a promising candidate for label-limited transfer, but they do not establish objective synergy, statistical superiority, or robustness across stochastic runs.

cs.CV · cs.AI · cs.LG

版本更新 · v2arXiv:2611.03776

Proceedings of the CSCW 2026 Workshop on Women's Health as Cooperative Work: Participatory AI Across Care, Community, and Policy

Sherilyn Francis

原文摘要

This submission indexes contributions to the CSCW 2026 workshop, "Women's Health as Cooperative Work: Participatory AI Across Care, Community, and Policy," held on October 11, 2026. The workshop examines women's health as cooperative work spanning patients, caregivers, clinicians, communities, institutions, and digital technologies. Contributions explore participatory AI, coordination breakdowns, the distribution of care labor, governance, decision-making authority, and accountability across care, community, and policy contexts. The index provides paper titles, authors, affiliations, thematic areas, and unique report numbers to support discovery of the corresponding individual arXiv submissions. The workshop proposal is separately published under DOI 10.1145/3785651.3818821.

cs.HC

新论文 · v1arXiv:2611.15609

GLCR: Global-Local Collaborative Routing for Multi-Task Electromagnetic Signal Processing

Fang Lu, Yao Lu, Zhuangzhi Chen, Sicheng Zhang, Shanqing Yu, Yun Lin, Qi Xuan, Guan Gui

原文摘要

Deep neural networks for electromagnetic signal processing are typically developed as single-task experts with fixed inputs and objectives, limiting cross-task transferability. Electromagnetic foundation models offer broader task coverage but incur substantial pretraining and inference costs. To balance accuracy and efficiency, we adopt model routing to dynamically dispatch unknown signals to matched experts within a heterogeneous pool. We construct HeteroSignal-7, a multi-task routing benchmark with 140,000 samples from seven datasets covering six task types, paired with seven classification and waveform-recovery experts and a unified evaluation protocol. We then propose GLCR, a two-stage routing method combining global dispatch with local discrimination of similar tasks. First, a lightweight one-dimensional convolutional neural network (CNN) with an additive-margin head predicts one of seven routing classes. Second, a gradient-boosted-tree specialist uses four physical statistics to re-evaluate samples whose top two candidates match a confusion pair automatically identified from validation errors. The pipeline is trained across the full signal-to-noise ratio (SNR) range and requires neither SNR labels nor noise estimation at inference time. GLCR outperforms all 19 baselines, achieving 96.16% routing accuracy and a 76.30% system score, exceeding the respective second-best baselines by 1.16% and 1.14%. It achieves the lowest routing latency among the compared methods at 1.43 ms per sample and reduces expected overall system FLOPs by 5.9 times compared with executing all experts. This work provides a public evaluation platform and an efficient, reproducible baseline for heterogeneous expert routing in electromagnetic signal processing.

cs.LG

版本更新 · v3arXiv:2611.03233

Axion 1.0: Open Agent Foundation Models, Simplified

Yuqi Jia, Yunjie Tian, Jiayu Zheng, Yijun Liang, Jingchen Sun, Mengyu Zhao, Di Fu

原文摘要

We introduce Axion 1.0, a fully open agent foundation model that combines strong and broad agentic capabilities with a remarkably simple training recipe. Axion 1.0 is trained in only three stages: two lightweight supervised fine-tuning stages followed by reinforcement learning, without dedicated mid-training, direct preference optimization (DPO), or on-policy distillation (OPD). The first SFT stage develops strong self-contained reasoning through model-aware data construction, where we synthesize challenging problems and adversarially strengthen them based on the base model's own successful solution strategies. The second stage extends these capabilities to tool-dependent reasoning through a scalable pipeline for constructing diverse and automatically verifiable tasks grounded in real-world data sources and deterministic computation. Finally, reinforcement learning further strengthens long-horizon reasoning and interaction with external tools and environments. Despite this compact training recipe, Axion 1.0 achieves strong performance across a broad suite of agentic benchmarks and is competitive with leading commercial models on several of them. Equally importantly, Axion 1.0 is open beyond model weights: we release the complete recipe, including data construction, generation, filtering, verification, prompts, and training code, enabling the entire development process to be reproduced and extended. Axion 1.0 demonstrates that strong agent foundation models can be both open and simple, offering a practical and reproducible path toward advancing open agentic intelligence.

cs.AI

版本更新 · v3arXiv:2606.03217

An Asymptotic Theory of Chain-of-Thought in In-Context Learning

Kaito Takanami, Cengiz Pehlevan

原文摘要

Chain-of-thought (CoT) reasoning has become a widely used mechanism for eliciting multi-step reasoning in large language models by generating intermediate reasoning steps at inference time. Yet the scaling behavior of generalization with CoT depth remains poorly understood. To address this question, we study a theoretically solvable model of CoT for in-context weight prediction in linear regression, where test-time reasoning is represented as an iterative refinement of the weight-parameter estimate. Using tools from random matrix theory under high-dimensional asymptotics, we derive an exact formula for the generalization error as a function of reasoning depth, pretraining data amount, and context length. Our analysis reveals a sharp phase transition separating exponential and polynomial improvement, saturation, and overthinking, and characterizes how the optimal reasoning depth scales. We further show that deeper reasoning is most effective with sufficiently rich pretraining and in-context information, whereas limited pretraining or context makes longer reasoning prone to error amplification or saturation. We also validate these predictions through experiments on fully learned linear attention and softmax attention models. Our results provide a unified theoretical account of how test-time CoT depth affects generalization.

stat.ML · cond-mat.dis-nn · cs.LG

新论文 · v1arXiv:2611.15603

Are Scaling Laws of Universal MLIPs Universal?

Theo Keane, Anthony Onwuli, Richard Tomsett, Robert M. Forrest, Jonathan J. Bean

原文摘要

Neural scaling laws enable the prediction of returns from larger training datasets, but machine-learned interatomic potential (MLIP) datasets are heterogeneous and expensive to generate, and equal numbers of structures need not contain equal amounts of useful information. We study data scaling under fixed model configurations for M3GNet, MACE, and PET trained on subsets of a combined MatPES-MP-ALOE training pool. Across training structure subsets from 10,000 to 640,000, together with the full 1.16-million-structure training set, we compare uniform random sampling, three chemistry- and structure-informed stratification policies, iterative DIRECT, and furthest-point sampling using embeddings from three pretrained MLIPs. Models are evaluated using cohesive-energy, force, stress, and aggregate losses on both a held-out test set from the parent distribution and the distribution shifted MP-r$^2$SCAN test set. We observe power-law scaling improvements with increasing data, but the fitted scaling exponent, apparent error floor, and relative sample efficiency depend on the model architecture, target quantity, data sampling policy, and test set distribution. Sampling-policy rankings can reverse across test distributions: chemical stratification can improve cross-dataset performance while degrading in-distribution performance, whereas the embedding-space diversity policies frequently under-perform random sampling. Relative loss is strongly associated with test-to-train chemical-space divergence. These results show that structure count is a necessary but insufficient scaling variable for MLIPs. For training MLIPs, the return on additional first-principles calculations depends not only on how many additional structures are included, but also on how their chemical and configurational content aligns with the model's intended use.

cs.LG · cond-mat.mtrl-sci · cs.AI · physics.chem-ph

新论文 · v1arXiv:2611.15602

CoCode-World: Shared 3D Proxy Representation for Multi-Player World Models

Qirui Li, Xin Zhang, Yabo Chen, Jinkun Hao, Paul L Rosin, Yu-Kun Lai, Haibin Huang, Yin Chen 等 10 位作者

原文摘要

Multiplayer generative world models must produce observations that agree on shared entities despite different camera motions and occlusions. Explicit world representations provide spatial control, but precise modeling of individual game maps limits scene diversity, while shared geometry alone cannot ensure consistent appearance across views. We present CoCode-World, a shared 3D proxy framework that separates structural control from visual synthesis for two-player video generation. Programmable proxies specify scene layout, motion, and occlusion, while RGB references guide character and scene appearance. To coordinate visual details across players, we concatenate paired proxy videos, appearance references, and target views in a consistent spatial layout and generate both views jointly with a pretrained video model. This formulation uses the model's native attention for cross-view communication within a single generation branch, with LoRA adaptation learning proxy adherence and appearance correspondence from paired observations. We construct a two-player GTA~V dataset that pairs synchronized RGB observations with proxy videos derived from shared map geometry and game-engine state. Experiments demonstrate appearance transfer to characters and scene styles unseen during training, with improvements in video quality and cross-view player identity over the evaluated baseline. Ablations further examine how proxy construction and cross-view communication affect generation. Project page: https://iapple233.github.io/CCW/.

cs.CV

新论文 · v1arXiv:2611.15601

Cat Royale Comprehensive Dataset: A Dataset for Pose Detection, Segmentation, Animal Action Recognition and Scene Understanding

Zane K. J. Hartley, Joseph Ho, Alan Chamberlain, Michael P. Pound, Steve Benford

原文摘要

Animal focused computer vision datasets are of a growing interest in the fields of both Computer Vision and Animal behaviour. The ability to make sense of complex scenes via a variety of Computer Vision tasks has substantial implications for behavioural understanding and welfare. The perfection of these tasks will help lead to better health and emotional outcomes for wild and domestic animals. In this work we present the Cat Royale Comprehensive Dataset (CRCD), a large, comprehensive, multi-modal dataset for feline understanding, based on a huge database of over 500 hours of video captured during the Cat Royale artwork and research project. Our dataset contains annotations for a range of computer vision problems including 20,000 images with instance segmentation masks, 5000 images with multi-subject pose coordinates, over 800 video clips with action classes, and over 800 clips with detailed text description. This is the first such dataset to link this wide range of annotation types together for multi-modal use. We release this entire dataset, and our custom annotation tools will also be made available, in order to allow for ongoing expansion. We also provide a series of benchmarks for the tasks of Instance Segmentation, Pose detection, Temporal Action Localisation, and finally video-text retrieval. The totality of this multi-modal dataset is the data needed to solve both these individual computer vision tasks as well as enabling more complex multi-modal tasks making use of a combination of annotations.

cs.CV

新论文 · v1arXiv:2611.15600

MemCredit: From Relevance to Utility for Decision-Time Memory in Long-Horizon Web Agents

Quanjiang Guo, Sijie Wang, Qianyang Zhu, Ben Zhang, Jinchuan Zhang, Ke Yan, Zhao Kang

原文摘要

Large language model (LLM) agents increasingly operate over long Web interaction histories, making memory management critical for reliable and efficient decision making. Existing methods primarily optimize storage, retrieval, or compression, but the memories most semantically relevant to the current state are not necessarily those that most improve the agent's action. We introduce MemCredit, a decision-centric memory framework that shifts memory selection from semantic relevance to decision utility. MemCredit estimates the state-, reference-context-, and policy-conditional marginal contribution of individual memories through controlled counterfactual interventions, and distills these intervention-derived credits into a lightweight utility estimator. At inference time, semantic relevance is used only for high-recall candidate generation, while predicted utility arbitrates which memories are retained under a fixed token budget, without modifying the underlying agent policy or requiring additional environment interaction. We evaluate MemCredit on ALFWorld and WebShop against representative memory baselines. On ALFWorld, MemCredit achieves 86.57 SR@50 under a 500-token historical-memory budget, compared with 65.67% for BM25 retrieval. Counterfactual analysis further shows that memory utility is sparse, strongly state dependent, and poorly captured by semantic relevance. These results suggest that decision utility provides a more effective principle than relevance alone for long-horizon agent memory management.

cs.AI

新论文 · v1arXiv:2611.15597

When Local Definitions Are Missing: Stable Errors in Language Models

Zengqing Wu, Chuan Xiao

原文摘要

Contracts, technical manuals, and online communities often give familiar words special meanings and define them in one place. A language model that reads a passage without that definition may use the usual meaning and give an answer that sounds right but is wrong. We study this with multiple-choice questions whose correct answers depend on a local definition. The questions come from a synthetic vocabulary, commercial contracts, Reddit community glossaries, and the documentation of a decentralized exchange. We ask three language models each question with and without the definition. Without using the answer key, we then test whether their repeated answers and stated confidence reveal their own errors. Separately, we give a small open model the answer key and test whether it can predict which questions larger models get wrong. We report three findings. (1) Familiar words that a source redefines cause the most errors. Models often repeat the same wrong answer, and neither repeated answers nor stated confidence reliably flag it. (2) The source definition fixes most errors on synthetic questions, but a definition drawn from the model's own prior knowledge does not. In real contracts, the source definition fixes only about half of the errors. (3) Given an answer key, a small model can rank questions by how likely larger models are to get them wrong. These results call for tests that check answers against the full source, including its local definitions.

cs.CL · cs.IR

新论文 · v1arXiv:2611.15596

Bug Finding With Agentic Symbolic Execution

George Granberry, Wolfgang Ahrendt, Andy Gordon, Moa Johansson

原文摘要

Symbolic execution, in tools such as CrossHair for Python, is a powerful technique for finding bugs, but two barriers hinder its adoption: the human effort of annotating code with assertions, and the need to model the execution environment outside Python, such as an external database. To overcome both, we design an agentic harness that orchestrates the symbolic execution tool CrossHair together with an AI coding agent. Without human intervention, it instruments a repository with assertions, synthesizes a constraint-aware symbolic environment for the database, runs symbolic execution, and constructs a concrete test as evidence for each bug it reports. We evaluate our harness on 1,156,044 lines of Python code over 11 popular open-source Python web applications (Zulip, NetBox, Apache Superset, and others). With the synthesized environment, CrossHair executes 81% of the 5,406 contracted functions, against 4.5% without it. Our pipeline finds 1,050 bugs, each reproduced by a test against the unmodified application, 221 of them by CrossHair, and 312 of them are missed by a baseline in which the same LLM inspects the code. The two find different kinds of bugs: CrossHair's are mostly crashes on input-domain corner cases that validation admits, such as empty strings, missing fields and unusual characters, while inspection's are mostly bugs that produce wrong output. Our framework thus lets symbolic execution supplement inspection-based bug finding.

cs.SE · cs.AI · cs.LO · cs.SC

新论文 · v1arXiv:2611.15595

From Isolated Protocols to Integrated Pipelines: Benchmarking IoT Communication in the MASA Living Lab

Antonio Solida, Enrico Rossini, Marcello Pietri, Marco Picone, Carlo Augusto Grazia

原文摘要

The performance of real-time IoT communication systems depends not only on individual transport protocols, serialization formats, and data-processing stages, but also on how these components interact within the complete communication pipeline. Selecting an appropriate communication stack is therefore application-dependent and requires considering processing capabilities, network characteristics, communication patterns, and reliability requirements. This paper provides an experimental, evidence-based analysis of these interactions through a controlled benchmark of integrated communication pipelines deployed in the MASA living lab. We jointly evaluate local processing overhead, end-to-end latency, jitter, throughput, and delivery reliability across different combinations of transport, messaging, serialization, and compression mechanisms. Results show that component-level processing costs do not directly predict end-to-end performance. In particular, differences of only tens of microseconds in serialization or compression costs can coexist with several-millisecond differences in end-to-end latency, while middleware buffering and transport behavior substantially affect timing performance. The results demonstrate that communication-stack components should be evaluated as integrated pipelines and under representative operating loads rather than ranked independently.

cs.NI

版本更新 · v3arXiv:2608.16666

Chronocooked: A Benchmark for Interval Timing in Reinforcement Learning Agents

Amrapali Pednekar, Alvaro Garrido-Perez, Yara Khaluf, Pieter Simoens

原文摘要

Interval timing is considered an important aspect of human cognition. As artificial agents increasingly function alongside humans, their interval timing abilities need to be studied. However, research in this area remains limited and scattered. This paper presents Chronocooked, a reinforcement learning (RL) benchmark environment that enables a systematic study of interval timing abilities in RL agents. The suite comprises cooking scenarios involving interval timing tasks inspired by psychology literature. Each task is accompanied by evaluation metrics to study different aspects of interval timing in RL agents, namely, task performance, human-like timing and scalability. We report baselines using a non-recurrent model (CNN), a recurrent model (LSTM), and a biologically inspired recurrent model (CTRNN). The CNN model showed limited ability to perform the basic timing tasks. In contrast, both recurrent models with sufficient memory successfully performed the timing tasks, exhibited temporal control in the Fixed Interval (FI) task, and qualitatively reproduced human-like psychometric curves in the Temporal Bisection task. However, no quantitative evidence of human-like timing behavior was found. A systematic study of interval timing in artificial agents may offer complementary perspectives for improving task performance in fields like human-robot interactions (HRI), while also contributing to broader research on time perception.

cs.AI

新论文 · v1arXiv:2611.15589

EMS-Nav: Embodied Multi-Scale Navigation

Zenghui Yang, Xinan Wang, Danyang Li, Zhe Xu, Zheng Yang, Jingao Xu, Qiang Ma

原文摘要

Industrial inspection robots must reach work areas and specific equipment. These destinations span spatial scales from regions to objects, so robots must relate each target to its surroundings to interpret the task and determine where to go. Existing methods support multi-scale navigation through rich environment representations, but at substantial computational and storage cost. These costs limit deployment where wireless coverage is incomplete and robots must rely on onboard computation to keep navigating. We introduce EMS-Nav, a biologically inspired multi-scale navigation framework for online, on-device operation. Its core innovation is to organize perception, spatial understanding, and navigation around regions, making local spaces the basic units of both environmental understanding and computation. EMS-Nav groups objects and their relationships into functionally meaningful spaces and builds a hierarchy from local areas to the broader environment. This organization supports efficient map construction alongside the interpretation and execution of language goals at different scales. In multi-scale navigation experiments, EMS-Nav achieves the highest success rates across all four target categories: objects, rooms, regions, and specific instances. It outperforms state-of-the-art open-vocabulary mapping and navigation methods, improving overall first-attempt success by 9.39 percentage points over the strongest baseline while reducing mapping overhead and language-model input size. Local deployment in real indoor environments further demonstrates its applicability to on-device embodied navigation. By establishing regions as the organizing basis for perception, spatial understanding, and language-guided action, EMS-Nav provides a system that combines multi-scale understanding with computational efficiency to support diverse language goals on resource-constrained robots.

cs.RO · cs.AI · cs.CV

版本更新 · v2arXiv:2511.19757

What does it mean to understand language?

Colton Casto, Anna Ivanova, Evelina Fedorenko, Nancy Kanwisher

原文摘要

Language understanding entails not just extracting the surface-level meaning of the linguistic input, but constructing rich mental models of the situation it describes. Here we propose that because processing within the brain's core language system is fundamentally limited, deeply understanding language requires exporting information from the language system to other brain regions that construct mental models of minds, objects, and places, and that compute perceptual and motor representations. Building on earlier theorizing and empirical work, we argue that recent progress in cognitive neuroscience provides both the conceptual foundation and the methods to directly evaluate this hypothesis, thus opening up a new strategy to reveal what it means, cognitively and neurally, to understand language.

cs.CL

新论文 · v1arXiv:2611.15587

VWEN: A Curated Small Language Model for Vietnamese Paraphrasing

Sang Quang Nguyen

原文摘要

We present VWEN, a 0.8B-parameter model for Vietnamese paraphrasing at a requested level of change and for five related tasks: generating several paraphrases, simplification, gist, register transfer and paraphrase judgement. VWEN is Qwen3.5-0.8B fine-tuned on about 7k samples chosen by a four-stage pipeline: rules and deduplication, a bidirectional entailment filter, a divergence score that assigns low and high paraphrase levels, and selection for coverage and instruction-following difficulty. We compare it with paraphrase-only recipes from the same pipeline and with training on the ViSP corpus under matched and larger step budgets. On high-divergence paraphrasing, VWEN reaches a success rate (requested level reached and meaning preserved) of 0.61 against 0.46 for the ViSP model at matched compute, a difference that holds on inputs resembling ViSP. Given four times more training examples, the ViSP model closes the gap on such inputs but not on questions, which ViSP lacks and which it often turns into statements. Across all comparisons the entailment filter is the most effective stage. Training on paraphrases alone erases abilities of the base model that the multi-task data preserves.

cs.CL

新论文 · v1arXiv:2611.15585

Marginal-Preserving Coupled Diffusion Composition for Long-Horizon Planning

Hengrui Zhang, Qiyu Wang, Yuhu Cheng, Brooks Paige, Xuesong Wang

原文摘要

Compositional diffusion planners extend short-horizon trajectory models to long-horizon goal-conditioned planning by generating and stitching multiple local trajectory chunks. However, in multimodal environments, local plausibility is not sufficient for global consistency: independently initialized chunks may denoise toward incompatible overlap modes, producing plans that are individually feasible but incoherent after stitching. Existing remedies typically add search, guidance, pruning, or graph-based structure at inference time, increasing computational cost or relying on task-specific machinery. We instead investigate graph-structured dependence among chunk-wise initial diffusion noises as a lightweight coordination mechanism for compositional trajectory planning. We propose \textbf{M}arginal-Preserving \textbf{C}oupled \textbf{D}iffusion \textbf{C}omposition (MCDC), a training-free inference method for pretrained compositional diffusion planners. Instead of sampling chunk noises independently, MCDC constructs coupled Gaussian initializations whose per-chunk marginals remain exactly standard Gaussian, as required by the pretrained denoiser, while neighboring chunks receive positively correlated noise components. This preserves the standard-Gaussian initialization marginal of each chunk while biasing adjacent chunks toward compatible overlap-mode choices. We prove exact marginal preservation and show, under a simple multimodal overlap model, that positive coupling increases the probability of compatible mode selection. On OGBench long-horizon stitch tasks, MCDC consistently improves over independent compositional diffusion sampling while retaining nearly the same inference time, and achieves a favorable success--cost trade-off compared with search-based composition methods.

cs.AI

新论文 · v1arXiv:2611.15584

AI4Plasma II: Geometry-Aware Surrogate Modeling for Variable Electrode Gap GEC Plasmas

Hao Yang, Zhenyu Zou, Wenshuai Jie, Luowei Yin, Yufeng Wei, Daniel Zhengyu Huang, Zhichao Peng, Chun Chen 等 14 位作者

原文摘要

Industrial plasma process development requires broad exploration of operating and geometric parameters. Geometric parameters, particularly electrode spacing, affect discharge structure and processing uniformity. Exploring these parameter spaces through repeated high-fidelity simulations can be computationally expensive. Surrogate models can offer rapid predictions, but geometric variation complicates their application because the computational domain and discretization may change across samples. In this work, six geometry-aware surrogate models based on prescribed and learned geometry mappings, extended-domain representation, continuous coordinates, and geometry-native discretizations are compared in terms of their data requirements for accurate predictions of full plasma fields and ion density profiles near the wafer. The simulation dataset spans pressure, voltage, frequency, and electrode gap, with each reference case requiring an average simulation cost of 5.32 CPU h. To achieve a 2% mean error across the four plasma fields, prescribed-mapping Geo-FNO and Transolver require 100 training cases, compared with 250-1000 for the other models. Predicting ion density profiles near the wafer is more demanding and reveals larger differences among models, with prescribed-mapping Geo-FNO requiring the fewest training cases for the profile accuracy targets considered. To further reduce the data required for accurate predictions near the wafer, we introduce charge-separation weighting into the training loss, which reduces the prescribed-mapping Geo-FNO's minimum tested training requirement for a 5% profile error from 1000 to 100 cases. These results support prescribed-mapping Geo-FNO as a practical starting point for the variable-gap problem studied here when a suitable geometry mapping is available, while Transolver achieves the highest prediction accuracy with sufficient training data.

cs.LG · physics.plasm-ph

新论文 · v1arXiv:2611.15583

Your Secrets Are Showing: Deep Image Hiding Models Are Surprisingly Easy to Attack

Hao Liu, Jing Yu, Weizhi Liu, Lingling Yuan, Fengyong Li, Keke Gai, Zhaoxia Yin, Xinpeng Zhang

原文摘要

In this work, we ask whether an attacker can go beyond detecting a hidden image and tell what it depicts, even without knowing which model hid it. We show that, for deep image hiding, this is surprisingly easy. To test this, we build an evaluation dataset of stego images generated by 11 hiding models. These models span two families (invertible neural networks and autoencoders), use different backbones (CNN, Transformer, and Mamba), and include both spatial- and frequency-domain hiding methods. We demonstrate that training HiNet [17] in the usual way yields a single decoder that can extract secret content from unseen models across these settings. Both humans and machines can recognize what it reveals. A frequency analysis shows that most models favor mid- and high-frequency embedding. Guided by this finding, we strengthen cross-model extraction by enhancing cover textures and suppressing secret textures during training. The attack extends to out-of-distribution secrets and to multi-image hiding. It even exposes private content hidden by AIRPNet [13], a recent image restoration method that uses steganography for privacy protection. What surprised us most is that decoders from every hiding model we test exhibit this ''universal'' extraction ability to varying degrees. Our code and datasets will be open-sourced.

cs.CR

新论文 · v1arXiv:2611.15579

FoveaDet: Software-Hardware Co-Design of Foveated CNN-Transformer for Object Detection

Deepak Mewada, Apporva Saraf, Ashwin Lele

原文摘要

Deploying real-time object detection on power-constrained edge platforms is challenging as processing full-resolution frames is often computationally redundant. Inspired by biological foveation which assigns variable resolution based on visual saliency, we propose a novel software-hardware co-design framework called FoveaDet. On the software side, FoveaDet dynamically identifies salient regions to predict fixation points, followed by aggressive patch pruning in Vision Transformers (ViT) to discard irrelevant background data. To mitigate slowdowns from sequential patch generation, we implement optimized interpolation and patch selection algorithms. Evaluated on standard GPUs, this foveated approach reduces floating-point operations by 65.4% to 92.2% and accelerates inference by 4.76x, while suffering a negligible mAP drop compared to dense baselines. To eliminate hardware bottlenecks, we complement the algorithm with a custom RISC-V core featuring specialized instructions to accelerate the foveated processing pipeline. FoveaDet provides a scalable, efficient architecture capable of unlocking advanced vision processing on severely constrained mobile platforms.

cs.CV

新论文 · v1arXiv:2611.15578

Constructing and Validating Memorisation Audits for EHR Foundation Models

Inigo Stibbe, Joshua Placidi, Padmanabhan Ramnarayan, A. Aldo Faisal

原文摘要

Autoregressive electronic health record (EHR) foundation models may disclose training information at inference, yet clinical predictability makes patient-specific memorisation difficult to distinguish from generalisation. We evaluate fixed-window token reconstruction, sensitive-attribute disclosure, and random patient-level canaries in GPT-2-style models trained on MIMIC-IV, across early, best-validation, and final checkpoints. Reconstruction improves with additional context, but training--held-out differences remain small. Trajectory-unique prompts containing limited clinical information produce no excess sensitive disclosure for training patients. In a matched model with random binary patient-level canaries, training-patient label-recovery AUROC increases from 0.512 to 0.549 while held-out recovery remains at chance. An overfit 1,000-patient positive control achieves near-perfect recovery, confirming sensitivity to strong memorisation. These results reveal weak cohort-level memorisation but no reliable patient-level disclosure under the evaluated attacks. They motivate clinically grounded inference-time audits that can detect patient-specific memorisation in existing models without retraining with canaries.

cs.LG

版本更新 · v2arXiv:2601.21359

Graph-Free Root Cause Analysis

Luan Pham

原文摘要

Failures in complex systems demand rapid Root Cause Analysis (RCA) to prevent cascading damage. Graph-free RCA methods typically assume that the root cause has the highest anomaly score. This assumption fails when faults propagate, because a small deviation at the root cause can grow into a larger anomaly downstream. Our key observation is that a root cause deviates in both its internal properties (e.g., resource usage) and external properties (e.g., latency), whereas components affected by propagation deviate only in external properties. We propose CIE, a framework that ranks components by combining their internal and external anomaly scores. We formalize a class of component-based systems and state conditions under which CIE provably ranks the root cause first. The guarantee holds under arbitrary amplification for a conjunctive score, and under bounded amplification and a stronger root-cause condition for the default additive score. On 735 failures in nine datasets from three microservice systems, CIE achieves 68% Top-1 accuracy averaged over 11 fault types, a 21% relative improvement over the best of twelve baselines, while requiring 8 ms per diagnosis.

cs.LG · cs.SE

版本更新 · v3arXiv:2603.25507

Lightweight GenAI for Network Traffic Generation: Fidelity, Augmentation, and Classification

Giampaolo Bovenzi, Domenico Ciuonzo, Jonatan Krolikowski, Antonio Montieri, Alfredo Nascita, Antonio Pescapè, Dario Rossi

原文摘要

Network Traffic Classification (NTC) increasingly relies on data-driven models, yet its practical deployment is often constrained by limited labeled data, strict privacy requirements, and the cost of collecting representative traffic traces. While Network Traffic Generation (NTG) provides an effective means to mitigate data scarcity, conventional generative methods struggle to model the complex temporal dynamics of modern traffic and often incur high computational costs. In this article, we investigate lightweight Generative Artificial Intelligence (GenAI) architectures for practical NTG. Rather than generating raw packet bytes or relying on large foundation models, we synthesize compact flow-level traffic representations derived from early packet-header information, enabling transformer-based, state-space, and diffusion models with only a few million parameters. We present a modular GenAI pipeline for NTG and evaluate it along four complementary axes: (i) synthetic traffic fidelity, (ii) synthetic-only training for reduced raw-data sharing in NTC, (iii) data augmentation under low-data regimes, and (iv) computational efficiency. Experiments on two heterogeneous datasets show that lightweight transformer-based and state-space models preserve both static and temporal traffic characteristics, while providing useful synthetic data for downstream NTC. Among them, transformer-based models offer the best fidelity-efficiency trade-off, combining high-quality traffic generation with moderate computational overhead.

cs.NI · cs.AI · cs.LG

新论文 · v1arXiv:2611.15577

Orthogonal Code-Based Parallel Signaling for PLCA in Shared-Medium Ethernet

Mohamed Elattar, Ahmed Abdelkader, Zhe Lou, Georg Carle

原文摘要

Physical Layer Collision Avoidance (PLCA) enables collision-free channel access in shared-medium Ethernet by granting each node an exclusive transmission opportunity (TO) in a sequential, cyclic manner. This sequential, node-based access structure, however, is the root cause of PLCA's fundamental limitations, causing access latency to grow with network size and idle TOs to accumulate when traffic is sparse, a limitation inherited by existing PLCA extensions. To address this, we propose OC-PLCA, an orthogonal code-based parallel signaling mechanism for PLCA. Rather than signaling sequentially, all nodes with pending traffic transmit their unique Walsh-Hadamard code simultaneously to signal their intent to transmit. Since these codes are mutually orthogonal, each node independently identifies the complete set of active nodes, allowing the transmission cycle to include only active nodes and eliminating idle TOs entirely. We further investigate the impact of quantization on active node detection, and propose a grouping-based extension that preserves unambiguous detection for networks of an arbitrary number of nodes. Theoretical analysis shows that OC-PLCA reduces signaling overhead by 88% for an 8-node network, with the reduction growing as network size increases. Simulation results confirm significant reductions in observed access latency across a range of network loads and heterogeneous node activity.

cs.NI

新论文 · v1arXiv:2611.15576

Can Model Answer Probabilities Represent Survey Populations? Conditional Prediction and Joint Validity in Jev Survey Simulation

Zengqing Wu, Chuan Xiao

原文摘要

Survey simulations require realistic combinations of answers, but predictive accuracy alone does not establish that a model can generate them. We evaluate the option probabilities returned by Jev, a TypeSafe decision model, using linked responses to 20 binary items from five archived survey waves. We compare population-only prediction, prediction given recorded answers, and sequential completion that uses generated answers to predict later responses. Joint comparisons hold the starting population information fixed, and two three-question cases are completed in both question orders. We evaluate predictive scores, answer frequencies, and associations against the survey records. Recorded answers can improve predictive scores while associations remain distorted. Large conditional errors also occur. For example, among men who described themselves as having traditional values, the model predicted that 16% would see men and women as similar in workplace abilities, compared with 56% in the survey. Sequential completion has mixed effects on joint validity, and reversing question order produces different joint distributions in both tested cases. Order checks and classical marginal bounds clarify what can be assessed before linked validation answers are available. The findings support validating the joint events a simulation uses and separating empirical constraints from model assumptions. The evidence concerns selected binary tasks and one model version.

stat.AP · cs.AI · cs.CY

新论文 · v1arXiv:2611.15574

RipBench: A Unified Benchmark for Multi-Level Rip Current Detection, Classification and Segmentation

Andrei Dumitriu, Aakash Ralhan, Florin Miron, Florin Tatui, Radu Tudor Ionescu, Radu Timofte

原文摘要

Rip currents are a serious and often under-addressed threat to beach safety and the leading cause of coastal drownings worldwide. They are difficult to detect due to their amorphous structure, similarity to the background, and large variability in viewpoints and environments. Despite their dangers and growing interest in automated detection, existing research remains fragmented across datasets, metrics, models, and approaches, leading to an incomplete understanding of model performance. We introduce RipBench, a unified benchmark that enables controlled evaluation of rip current detection spanning multiple tasks, including classification, axis-aligned and oriented object detection, and instance, semantic, and panoptic segmentation, on the same data with standardized splits. This allows direct comparison of model performance on all levels of visual abstraction. Across $304$ videos ($303{,}491$ frames, $51{,}011$ of them annotated for all six tasks) collected from diverse coastlines, our results expose a clear performance gap between coarse recognition and precise spatial understanding: frame-level classification reaches $F_2 = 0.93$, while the best detector and the best instance segmenter reach $0.72$ and $0.66$, with model rankings that change from task to task. Video-level confidence intervals, a blind inter-annotator study of the spatial labels, stratified analyses by viewpoint and visual signature, and video views with temporal baselines (single-seed, short-schedule reference runs) accompany the benchmark. All tasks are supported with carefully curated annotations and evaluated using standard metrics, with a focus on the $F_2$ score to emphasize recall in this safety-critical setting. RipBench, along with multiple baselines per task, is publicly available at https://RipBench.ai to support progress in real-world, multi-task vision for beach safety.

cs.CV

版本更新 · v3arXiv:2609.02753

The Import Tax: A Longitudinal Measurement of Startup Cost in the Python Ecosystem

Trinath Sai Subhash Reddy Pittala

原文摘要

Python programs pay for their imports at every process start, a cost that is invisible in steady-state benchmarks but dominant for command-line tools, test workers, and serverless cold starts. Python 3.15 adds explicit lazy imports (PEP 810) on largely anecdotal evidence. We measure the import cost of the 500 most-downloaded PyPI packages, every quarterly release since mid-2021, under six CPython versions (3.9-3.14) on two platforms (Apple M5/macOS and Intel Xeon/Linux), 66,816 cells in all, with targeted experiments that isolate individual effects. Values are for macOS (Linux in parentheses). Import cost is heavily skewed (median 12.3 ms, 99th percentile 400 ms). Among packages that import in more than 2 ms, namespace distributions excluded, the median package spends 68% of its import time in the standard library (68% on Linux with the interpreter on local storage, 79% on network storage). Precompiling bytecode removes almost all of the cold-start penalty on Linux and 92% of it for the median package on macOS, but only a third of the summed macOS penalty: packages with native libraries pay a security assessment of each library that the system has not seen before, again in every fresh environment. A package's own import code grows by a median 4.0% (5.0%) per year; installing each release with the dependencies of its time changes its trend by a median of only 0.15 (0.35) percentage points (CPython 3.9). CPython 3.14 runs package code faster than 3.9 but imports more and slower standard-library modules, a net 1.16x (1.07x) slowdown. Submodules that dependents import beyond the top level add nothing for the median package and at most 11.7 (49.5) ms for nine packages in ten. On CPython 3.15, global lazy mode cuts the imports that dependents perform to 0.41x (0.39x) of their cost, and 38 of 461 packages fail under it, many only on first use of a name. Harness, code, and dataset are public.

cs.SE

版本更新 · v2arXiv:2608.24763

MoTE: Mixture of Task Experts for Multi-Task Video Understanding

Muhammad Asad Ali, Umar Khan, Nadia Robertini, Didier Stricker

原文摘要

Procedural video-language models must solve heterogeneous tasks from the same visual evidence, including action recognition, forecasting, and procedure prediction. Dense transformer decoders share the same feed-forward networks across tasks, which can entangle task behavior and make controlled capability expansion difficult. Sparse Mixture-of-Experts (MoE) decoders provide conditional computation, but token-level learned routing is not naturally aligned with task-level procedural objectives. We propose MoTE (Mixture of Task Experts), a decoder architecture that converts large language model feed-forward networks into task-specific experts while keeping the multimodal backbone shared. Each example follows one sample-level task route, so active task-expert computation remains independent of the number of stored task experts. We instantiate this design as VideoLLM-MoTE and evaluate it on five COIN benchmarks using explicit task routes. The five-expert model activates ~2B LLM parameters per sample and achieves higher average top-1 accuracy than recent VideoLLM baselines. Under the same expert topology, it improves over dense all-expert activation and learned sparse-routing controls. These results show that task-structured routing provides an interpretable and compute-efficient decoder alternative for multi-task video-language learning.

cs.CV · cs.LG

版本更新 · v2arXiv:2605.07665

Debiased Counterfactual Generation via Flow Matching from Observations

Hugh Dance, Johnny Xi, Peter Orbanz, Benjamin Bloem-Reddy

原文摘要

Estimating the full counterfactual distribution under an intervention is central to treatment risk assessment and counterfactual generation tasks. Existing approaches model the counterfactual distribution as a standalone generative target, without exploiting its relationship to the observational data. In this work, we show that under standard assumptions, observational distributions and marginal counterfactual distributions over outcomes are tightly linked: they have identical support and tail behavior, remain statistically close under weak confounding, and share any outcome features which are invariant to confounders. These properties motivate learning counterfactual distributions not from scratch, but via a deconfounding flow from the observational distribution. We formulate this problem via flow-matching and derive a semiparametrically efficient estimator based on a novel efficient influence function correction. We subsequently extend our estimator to target minimal-energy flows in high-dimensions, which we show can be especially simple targets between observational and counterfactual distributions. In experiments, deconfounding flows outperform existing debiased counterfactual distribution estimators, while also mitigating known failure modes of flow-based methods.

stat.ML · cs.LG