跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

浏览论文库

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

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

Does Predictive Performance Translate to Causal Performance? Evaluating tabular foundation models as nuisance learners for causal effect estimation

Andrew R Weckstein, Issa J Dahabreh, Marinka Zitnik, Sonia Hernández-Díaz, Sebastian Schneeweiss

原文摘要

Tabular foundation models based on prior-data fitted networks (PFNs) achieve strong predictive performance, but their value for causal inference is unclear. We evaluated whether PFNs, which predict through in-context learning, could match or outperform conventional nuisance learners in supporting accurate causal estimation and reliable uncertainty quantification (inference). Learners modeled propensity scores and outcome regressions within doubly robust estimators of average causal effects, with and without cross-fitting, across synthetic and semi-synthetic settings with varying confounding complexity and effect heterogeneity. Under simple parametric data-generating processes, the PFNs were competitive with correctly specified parametric regressions and ensembles containing them. In more complex settings, they outperformed all conventional learners evaluated, including richly specified Super Learner ensembles, for both accuracy and uncertainty quantification. As sample size increased, only the two PFN models (TabPFN and Mitra) consistently approached nominal confidence interval coverage, whereas under-coverage persisted for conventional learners. In some settings, PFNs achieved near-nominal coverage and well-calibrated standard errors even without cross-fitting. At the smallest sample size (n=200) and in the higher-dimensional semi-synthetic settings, PFNs and other flexible learners exhibited poor coverage without cross-fitting. For PFNs, this appeared to be driven by propensity score overfitting consistent with in-sample memorization of treatment labels. These findings highlight the promise of prior-data fitted networks as in-context nuisance learners for causal estimation, while underscoring the need for further evaluation in challenging settings.

stat.AP · cs.AI · cs.LG · stat.ME · stat.ML

新论文 · v1arXiv:2611.11379

Self-Supervised Collapse Prevention with Score-Based Entropy Maximization

Adarsh Kappiyath, Silpa Vadakkeeveetil Sreelatha, Xiatian Zhu, Yann LeCun, Lu Yin, Amir Bar

原文摘要

Diffusion models have demonstrated the effectiveness of score-based objectives for generative modeling, yet their potential for self-supervised representation learning remains underexplored. We introduce Entropy-Based Regularization (EBReg), a framework that uses latent score estimation to regularize the latent distribution during self-supervised training. EBReg jointly learns an encoder and a latent score model, and utilizes the learned score to provide a diversity-preserving signal that prevents representational collapse. Motivated by a mutual-information lower bound, we formulate the objective as view alignment with smoothed marginal entropy maximization and optimize the marginal entropy without explicit density evaluation. The same score model can additionally be used at test time to refine corrupted representations toward the training latent distribution. Empirically, EBReg learns competitive representations on ImageNet-1K, achieving 75.57% linear-probe accuracy with ViT-L. Across diverse architectures, score-guided test-time adaptation further improves robustness on ImageNet-C, yielding an average relative accuracy gain of approximately 5%.

cs.LG

新论文 · v1arXiv:2611.11376

Fractional distance-edge-monitoring in lexicographic products

Xiumin Wang, Minglei Mao, Yaping Mao, Ralf Klasing

原文摘要

We give an exact formula for the fractional distance-edge-monitoring number of $G\circ H$, where $G$ is connected of order $m\ge2$ and $H$ has order $n\ge2$. By the previously established endpoint-monitoring property, the fractional monitoring program reduces to fractional vertex cover, whose linear-programming dual is fractional matching. Writing $d_c(H)$ for the critical difference of $H$, we obtain $\operatorname{dem}_{f}(G\circ H)=(mn-D(G,H))/2$, where $D(G,H)=\max_{A\in\mathcal{I}(G)}\bigl(d_c(H)|A|-n|N_G(A)|\bigr)$ and $\mathcal{I}(G)$ denotes the family of all independent sets of $G$, including the empty set, while $N_G(A)$ is the open neighborhood of $A$. This formula characterizes the products attaining $mn/2$ and gives an equality criterion for the fractional matching lower bound of Ma, Cheng, Mao and Wang. Under the stated hypotheses, the lower bound of Ma et al. is attained if and only if either factor has a fractional perfect matching or $H$ is edgeless. Two outer trees show that the factor orders and fractional matching numbers do not determine the product value.

cs.DM

新论文 · v1arXiv:2611.11375

Linear Objective Problems: A Complexity Framework for Bilevel Optimization

Christoph Grüne, James B. Orlin, Lasse Wulf

原文摘要

Many bilevel and robust optimization problems are complete for the second level of the polynomial hierarchy, but such results are usually proven one problem at a time with problem-specific reductions. A recurring obstacle is that the lower level must select an optimal solution rather than merely a feasible one, whereas standard reductions preserve only whether a solution exists, not which solutions are optimal. We introduce linear objective problems (LOP), a framework for optimization problems whose solutions are explicit subsets of a ground set and whose objective is linear in these elements. We define tight solution-embedding reductions, which map the optimal solutions of one problem element by element onto the optimal solutions of another, without having to recognize optimal solutions, which is coNP-hard in general. This gives a notion of LOP-completeness, with Satisfiability as the canonical complete problem, even with unit weights. We show that many classical problems are LOP-complete, including Vertex Cover, Dominating Set, TSP, Knapsack, and Steiner Tree, and we introduce a duality that transfers LOP-completeness between minimization and maximization problems. As our main application, we prove a meta-theorem for min-max regret optimization under interval uncertainty: for every LOP-complete problem, the min-max regret version is $Σ_2^p$-complete. Instead of a separate proof for each nominal problem, it suffices to show that the nominal problem is LOP-complete. This recovers known results for the interval min-max regret versions of Knapsack and Maximum Benefit Set Cover and yields completeness for over 50 further problems.

cs.CC · cs.DM · math.CO · math.OC

新论文 · v1arXiv:2611.11374

Small Data Generative AI for Culturally Specific Artistic Creation: A Case Study on the Sonic Space of sarir

Arshia Sobhan, Paul Triana, Philippe Pasquier

原文摘要

Large-scale generative AI (GenAI) models have become increasingly integrated into contemporary creative practice, yet they often reproduce cultural biases and fail to meaningfully engage with non-Western artistic traditions. In response, this paper explores a small-data approach that foregrounds artist-curated and culturally informed dataset creation and model training. Through a case study on sarir (the distinctive sound produced by the reed pen in Persian calligraphy), we demonstrate how small-data GenAI can operate within a highly situated cultural context that lies beyond the representational reach of large-scale GenAI models. We construct a bespoke sarir audio dataset and train two models, RAVE and StyleGAN2, adapting each to the sonic domain through audio synthesis and spectrogram generation. The resulting models learn the fine-grained timbral and gestural nuances of sarir, enabling both real-time interaction and extended generative output. By comparing these results with state-of-the-art text-to-audio models, we clearly demonstrate the disparity in their performance and highlight the expressive possibilities unlocked through the small data approach. This focused case study demonstrates the feasibility of small-data GenAI for culturally specific artistic creation and underscores the value of further investigations that extend this approach to other cultural materials and artistic domains.

cs.SD · cs.CY

新论文 · v1arXiv:2611.11372

LLM-based Multi-Criteria Deep Reinforcement Learning for Dynamic Efficient 5G UPF Selection

Abdelrahman Soliman, Ahmed Refaey Hussein, Lei Lei

原文摘要

User plane function (UPF) selection in 5G networks is an active area of research, with various limited approaches proposed to enhance network efficiency and manage resources effectively. In this paper, we address this gap in the related literature by proposing a Deep Reinforcement Learning (DRL) UPF selection method that utilizes a dynamic, multi-objective reward function and validating it on a real-world 5G emulation platform. The proposed method is based on the large language models' (LLMs) translation of network operator intents and the network data analytics function (NWDAF) abnormality alerts. The experimental results validated in the real-world experimental setup demonstrate that our dynamic DRL solution achieves an effective balance between latency, power consumption, and traffic distribution, outperforming the heuristic baselines and fixed DRL by 16.89%. These findings highlight the real-world applicability of our approach for dynamic, intent-driven UPF selection.

cs.LG · cs.AI · cs.CL · cs.NI

新论文 · v1arXiv:2611.11371

D3Tree: Learning to Prune Block-Diffusion Draft Trees for Efficient Verification

Hong Nie, Zhangchi Gao, Jun Yu, Bo Wang, Jianqing Sun, Shengping Liu

原文摘要

Block-diffusion drafters propose a whole block of tokens in one forward pass, and draft trees built from their position-wise marginals increase the expected accepted length of speculative decoding. Every tree node occupies a query row in target verification, so under concurrent serving low-yield branches compete with other requests for verification capacity. Existing tree methods select verified nodes by draft probability under a fixed or cost-selected per-request budget, and thus always retain a prefix of the drafter's ranking. We present D3Tree, which learns which nodes of a block-diffusion draft tree are worth verifying. A tree-size head with 2H+2 parameters predicts each candidate's conditional survival from the draft state, the candidate embedding, and its draft log-probability. Thresholding the product of these scores along parent chains yields an ancestor-closed subtree whose size adapts to each request and decoding round. The head is trained on a frozen drafter with conditional labels on the full candidate tree; an optional joint mode also steers the drafter toward the retained reference path. At serving time, D3Tree verifies whole trees under light load and, under heavy load, allocates one batch-wide node budget by predicted survival, sized to the target's matrix-multiplication tiles. Retained trees share one ancestor-masked target pass, while construction, pruning, and scheduling run on the GPU and overlap with the host. Across six vision-language verifiers and 17 text and multimodal benchmarks, D3Tree is fastest in 70 of 72 load settings, with 3.2-4.0x speedup over autoregressive decoding for one request and 1.3-1.8x at 64 concurrent requests, where fixed-budget trees fall below autoregressive speed. Under a time-varying arrival trace, it has the lowest mean end-to-end latency in every arrival phase.

cs.LG · cs.AI

新论文 · v1arXiv:2611.11370

A Simple Phase-King Protocol with Predictions

Antonia Giannoulea, George Papadoulis, Nikos Leonardos, Aris Pagourtzis

原文摘要

Inspired by recent work (Ben-David, Dzulfikar, Ellen, and Gilbert, $\textit{Byzantine Agreement with Predictions}$, PODC 2025) we study synchronous binary Byzantine Agreement in the learning-augmented setting, where each process receives predictions about which processes are honest or Byzantine. We present a deterministic Phase King protocol for the anauthenticated setting, combining early stopping with a specifically designed prediction-aware king selection procedure. For at most $t<n/3$ Byzantine processes, the protocol handles arbitrarily many prediction errors, improving upon the $O(n^{3/2})$ bound of Ben-David et al., and terminates within $O(P)$ communication rounds, where $P=1+\min\{\mathbf{B}/n,f\}$, $\mathbf{B}$ is the total number of incorrect prediction bits held by honest processes, and $f$ is the actual number of Byzantine processes. Our protocol uses $O(n^2P)$ messages and $O(n^2P\log n)$ bits, avoiding the initial cubic bit cost of exchanging complete prediction vectors. In comparison to very recent independent work (Dufay, Dzulfikar, and Gilbert, $\textit{Predictions Can Only Help! Communication Efficient Byzantine Agreement with Predictions}$, DISC 2026), which achieves the same error tolerance and round complexity but better communication bounds, our construction provides a much simpler Phase King approach that completely avoids involved preprocessing constructions, rendering it more practical, especially for achieving agreement in time-evolving networks. We believe that the novel prediction-aware king selection technique of our scheme is of independent interest and can find further applications in learning-augmented distributed consensus.

cs.DC

版本更新 · v2arXiv:2604.24549

GradMAP: Gradient-Based Multi-Agent Proximal Learning for Grid-Edge Flexibility

Yihong Zhou, Hongtai Zeng, Thomas Morstyn

原文摘要

Coordinating large populations of grid-edge devices requires learning methods that remain decentralised in deployment while still respecting three-phase AC distribution-network constraints. This paper proposes gradient-based multi-agent proximal learning (GradMAP) to address this challenge. GradMAP trains independent neural network policies for each agent that makes online decisions without communication. During offline training, GradMAP embeds a differentiable power grid environment and uses implicit differentiation to propagate exact AC power flow gradients. To speed up training while maintaining performance, GradMAP reuses expensive environment gradients through a proximal surrogate within a trust region defined in the more direct policy-output space, instead of the probability distribution space used in PPO. Using a single workstation-class NVIDIA RTX PRO 5000 Blackwell GPU with 48~GB of memory, GradMAP trains 1,000 agents on the IEEE123 network in 15 minutes and 100,000 agents on the IEEE8500 network in 40 minutes, without parameter sharing. In both cases, GradMAP achieve the lowest mean daily maximum voltage violation and the lowest energy cost among all evaluated methods, including standard multi-agent reinforcement learning methods and gradient-based learning methods extended to the multi-agent setting by us. The training time to convergence is also the lowest, with a 5x to more than 10x training speedup compared to other methods.

cs.LG · cs.AI

新论文 · v1arXiv:2611.11368

BiVerify: Closing the Loop Between Backward and Forward Verification for Mathematical Self-Correction

Rui Zou, Xin Zhao, Mengqi Wei, Ji-Rong Wen

原文摘要

Large language models (LLMs) have made substantial progress in mathematical reasoning but still produce incorrect solutions to complex problems, indicating the need for more reliable self-correction mechanisms. Mathematical self-correction typically identifies errors through verification, which can proceed backward or forward. The two directions provide complementary verification capabilities. Backward verification checks a candidate answer against the original constraints, bypassing complex intermediate reasoning, but cannot ensure correct reasoning or objective completeness. Forward verification follows the problem conditions and current solution, enabling it to locate reasoning errors and assess objective completeness, but may overlook key constraints in complex solution chains. We propose BiVerify, a dynamically scheduled framework for bidirectional mathematical verification. BiVerify begins with backward verification to screen the answer against the original constraints, followed by forward verification of the reasoning process; subsequent direction switching, state resetting, and re-verification are governed by verification outcomes. Upon failure, the system revises the candidate or verification flow until the same candidate passes both directions. We also introduce shared mathematical tools that separate logical reasoning from precise computation. We systematically evaluate BiVerify on five challenging mathematical reasoning benchmarks using multiple mainstream DeepSeek, GPT, and Gemini models. BiVerify exceeds the strongest representative public baseline evaluated in this work by 13.5 percentage points in average accuracy, with the margin reaching 31.2 percentage points on GPT. Further analysis shows that BiVerify's overall performance exceeds that of either verification direction alone.

cs.AI

版本更新 · v2arXiv:2512.12658

UniDoc: Towards Unified Thinking in Documents

Qixin Xu, Haozhe Wang, Che Liu, Fangzhen Lin, Wenhu Chen

原文摘要

Answering questions over long, visually rich documents demands both cross-page structural reasoning and fine-grained visual understanding. Existing approaches sacrifice one for the other: retrieval-augmented methods fragment documents and lose inter-page structure; monolithic vision-language models preserve structure but scale poorly beyond a few pages. This impasse stems from a false premise: that the macroscopic task of evidence retrieval and the microscopic task of detailed reasoning must either be split into separate systems or be processed identically. By decoupling their perceptual resolutions rather than their architectures, a single model can achieve the structural holism of monolithic processing alongside the efficiency of targeted retrieval. UniDoc realizes this through two resolution-adaptive stages: a Fast Reading stage processes all pages at low resolution to structurally identify evidence pages, and a Focused Thinking stage re-processes only those pages at high resolution for multimodal inference. To train this pipeline, we construct 30K multi-hop reasoning instances with stage-level supervision. On MMLongBench-Doc, UniDoc yields relative accuracy gains of 55.7% on Qwen2.5-VL-7B and 16.9% on Qwen3-VL-8B, while significantly reducing token cost relative to uniform high-resolution processing. Error analysis identifies page retrieval and fine-grained visual reasoning as the remaining bottlenecks, delineating concrete targets for future work.

cs.CV

版本更新 · v6arXiv:2509.20789

Aligning Inductive Bias for Data-Efficient Generalization in State Space Models

Qiyu Chen, Guozhang Chen

原文摘要

The remarkable success of modern AI has been closely tied to scaling laws, yet the finite supply of high-quality data makes data efficiency--learning more from less--an increasingly important frontier. A model's inductive bias is a critical lever for data efficiency, but foundational sequence models such as State Space Models (SSMs) often rely on fixed, task-agnostic biases. When this fixed prior is misaligned with the underlying structure of a task, the model may require additional samples to overcome its own bias before learning the relevant signal. In this work, we introduce a principled framework for understanding and aligning the inductive bias of linear time-invariant SSMs. We first formalize this bias through an SSM-induced kernel and show theoretically and empirically that its spectrum is governed by the model's frequency response. This characterization motivates Task-Dependent Initialization (TDI), a fast power-spectrum matching method that aligns the initial SSM bias with the task's spectral characteristics before downstream training. Across controlled synthetic experiments, trainable one-layer SSMs, and deep SSMs on diverse real-world benchmarks, TDI can improve data-efficient generalization primarily when task-relevant spectral structure is present and the default SSM bias is spectrally mismatched. Our results provide both a theoretical lens and a practical tool for task-adaptive inductive bias, suggesting a path toward more data-efficient sequence modeling.

cs.LG

新论文 · v1arXiv:2611.11365

MG-Cache: Multi-Granularity Caching for Accelerating Diffusion Transformer Inference

Zesen Chen, Youxuan Xu, Shigang Li

原文摘要

Diffusion Transformer (DiT) models, while having become a powerful backbone for generative synthesis, suffer from high inference cost on generating high-resolution images. Diffusion caching has emerged as a promising acceleration technique to reduce inference cost. However, existing caching strategies fail to accurately identify the varying importance of different computational modules and rarely coordinate cache reusing across the timestep and layer granularities, making it difficult to control error accumulation. To address these limitations, we propose multi-granularity caching (MG-Cache) for DiTs, a novel and fully training-free approach to exploit computational redundancy both on timesteps and Transformer layers. Our core innovation contains a two-stage caching strategy: an offline timestep profiling analysis that identifies redundant timesteps for cache reuse, followed by an adaptive layer-wise caching strategy that combines input stability with importance of each Transformer layer to selectively cache stable Attention and MLP submodules. Extensive experiments on mainstream open-source DiT models validate the effectiveness of our approach, achieving significant acceleration while maintaining high fidelity to the uncached output, with up to a 4.18x acceleration on HunyuanVideo.

cs.LG · cs.PF

新论文 · v1arXiv:2611.11364

OOM: Offload-Optimized Full-Parameter MoE Training via Memory-Execution Co-Design

Ruijia Yang, Shiyuan Lin, Chengxi Liao, Zeyi Wen

原文摘要

Offloading model state to host memory and streaming layer weights let a single multi-GPU node train large mixture-of-experts (MoE) models. GPU memory then becomes a performance budget, shared by resident expert state, retained activations, and execution worksets. The best allocation depends on the expert execution path, batch size, and sequence length. We present OOM (Offload-Optimized MoE), a full-parameter MoE training system that co-designs expert execution and memory allocation. For expert-parallel execution, OOM updates resident experts on their owning GPUs and jointly plans state residency and MoE activation retention according to pipeline dependencies. For local execution, OOM bounds GPU worksets through dependency-aware partitioning; in hybrid models, it also retains attention results on the host to avoid costly recomputation and selectively regenerates layer boundaries through cheaper layers to make room. Calibrated cost models guide joint configuration within GPU and host budgets to minimize step time; OOM selects among the configured paths through short executions. On four H100s, OOM trains with 1M-token contexts, whereas FSDP2, ZeRO-Offload, and MegaTrain exhaust GPU memory at 512K. It also trains a 122B-parameter MoE model, on which all three exhaust host memory. On four 24 GB RTX 4090s, it trains 512K-token contexts and 1,024 1K-token sequences per step without gradient accumulation. Across matched-global-batch comparisons, OOM delivers 1.58x and 4.08x geometric-mean (up to 2.14x and 7.77x) throughput over CPU-offloaded FSDP2 on the two platforms while using the least host memory among the evaluated systems -- as little as 1/3.0 of FSDP2's.

cs.DC · cs.LG

版本更新 · v2arXiv:2611.00627

Autonomous Analysis of Thermoelectric Materials Big Data by Multi-Agentic AI and Construction of a Knowledge Base and Specialized AI

Yusuke Hashimoto, Takaaki Tomai

原文摘要

Large databases of paper-derived experimental materials data hide essential information on materials. Their analysis is demanding, large-scale and complex, making manual knowledge extraction very difficult. To address this challenge, we developed Multi-Agentic AI (MAA) for automated, autonomous analysis of materials experimental big data and a specialized AI built on the obtained knowledge. MAA's nine role-specific AI agents, under predefined instructions and quality checks, autonomously perform data extraction, compositional feature generation, machine-learning modeling, feature-importance analysis and knowledge-base recording, iterating while inheriting previous knowledge. Delegating numerical processing to code makes large-scale data tractable; recording every choice and result enables later tracing to sources. In four thermoelectric-data experiments varying theme and cycle counts, the knowledge graph grew: knowledge clustered by theme and vocabulary was shared across themes. The specialized AI, searching and reading these records, answered materials questions citing sources. Retrospective verification also revealed errors, traced through the records to their sources.

cs.AI · cond-mat.mtrl-sci · cs.MA

版本更新 · v4arXiv:2610.10500

Taxonomic Classification with Tag Arrays

Travis Gagie, Gonzalo Navarro

原文摘要

We present a tool, KATKA, for taxonomic classification with tag arrays. Compared to Ahmed et al.'s state-of-the-art tool Cliffy ({\it Genome Research}, 2025) on the SILVA dataset from their paper and a readset similar to one of theirs, KATKA is faster, more accurate, much smaller and drastically easier to build.

cs.DS · q-bio.GN

版本更新 · v2arXiv:2609.12841

A Graph-Based Approach for Mapping Kernel-Level Telemetry to MITRE ATT&CK

Matteo Lupinacci, Luigi Arena, Francesco Blefari, Angelo Furfaro

原文摘要

Mapping observed system behavior to standardized frameworks such as MITRE ATT&CK is essential for threat-informed defense. Existing automated methods mostly depend on Cyber Threat Intelligence reports, which offer only retrospective accounts of attacks. Kernel-level telemetry, i.e., system calls, instead provides first-hand evidence of adversary behavior, but its volume and complexity have limited its use for automated mapping. Its content also makes it unsuitable for cloud-based analysis: command lines carry credentials, events carry user identifiers and network endpoints, and during an incident the telemetry reveals which defenses failed. In this work, we present Trace2ATT&CK, a framework that maps kernel-level telemetry to ATT&CK techniques entirely within the defender's infrastructure. Trace2ATT&CK collects events via eBPF, reconstructs the attacker's activity as a process-centric provenance graph, and condenses it into a compact execution graph. This graph is classified by locally deployed open-weight LLMs, using either pure prompting or retrieval-augmented generation (RAG) grounded in the ATT&CK knowledge base, producing ranked technique candidates with supporting rationales. We evaluate Trace2ATT&CK on 347 Linux Atomic Red Team tests with seven open-weight LLMs. The best local configuration reaches an HR@5 of 66.57\% at the technique level. RAG improves over base prompting in every model and setting, by up to $+15.44$ percentage points, and the execution graph substantially outperforms raw telemetry while never exceeding the LLM context window. Finally, a frontier cloud model used as an upper-bound reference quantifies the cost of local inference at 24--28 percentage points. These results show that ATT&CK mapping from kernel-level telemetry is feasible without disclosing sensitive evidence to third-party services.

cs.CR · cs.AI

版本更新 · v3arXiv:2504.08639

Constructing Witnesses for Lower Bounds on Behavioural Distances

Ruben Turkenburg, Harsh Beohar, Franck van Breugel, Clemens Kupke, Jurriaan Rot

原文摘要

Behavioural distances provide a robust alternative to notions of equivalence such as bisimilarity in the context of probabilistic transition systems. They can be defined as least fixed points, whose universal property allows us to exhibit upper bounds on the distance between states, showing them to be at most some distance apart. In this paper, we instead consider the problem of bounding distances from below, showing states to be at least some distance apart. Contrary to upper bounds, it is possible to reason about lower bounds inductively. We exploit this by giving an inductive derivation system for lower bounds on an existing definition of behavioural distance for labelled Markov chains. This is inspired by recent work on apartness as an inductive counterpart to bisimilarity. Proofs in our system will be shown to closely match the behavioural distance by soundness and (approximate) completeness results. We further provide a constructive correspondence between our derivation system and formulas in a modal logic with quantitative semantics. This logic was used in recent work of Rady and van Breugel to construct evidence for lower bounds on behavioural distances. Our constructions provide smaller witnessing formulas in many examples.

cs.LO

版本更新 · v2arXiv:2603.15300

GATE-AD: Graph Attention Network Encoding For Few-Shot Industrial Visual Anomaly Detection

Aggelos Psiris, Yannis Panagakis, Maria Vakalopoulou, Georgios Th. Papadopoulos

原文摘要

Few-Shot Industrial Visual Anomaly Detection (FS-IVAD) is a critical task in modern manufacturing, where automated product inspection systems must identify rare defects using only a handful of normal, defect-free training samples. Existing approaches typically model normality by assessing each patch largely through its individual appearance, e.g., through similarity to stored normal features, reconstruction from support samples, or distance from a learned normal representation. This paper introduces GATE-AD, whose key contribution is to instead model few-shot normality through local contextual relations: a patch is considered normal when it can be consistently recovered from its learned dependencies with its spatial neighbors. To realize this formulation, frozen self-supervised ViT patch tokens are organized on a spatial neighbor graph and processed by a Graph Attention Network (GAT), while representation alignment and a Scaled Cosine Error (SCE) objective enable reconstruction-based anomaly scoring. Node masking and attention dropout further regularize learning in the low-shot regime. On MVTec AD, VisA, and MPDD, GATE-AD achieves strong detection and localization performance across $1$- to $8$-shot settings, attaining the highest image-level AUROC in $10$ of $12$ settings and the highest image-level AP in $8$ of $12$ settings under a unified evaluation protocol, while also achieving the lowest inference latency among the compared methods. In order to facilitate reproducibility and further research, the source code of GATE-AD is available at https://github.com/gthpapadopoulos/GATE-AD.

cs.CV

新论文 · v1arXiv:2611.11359

NuJEV: Structured Visual Judgments for Consistent Nuclei Quantification

Yonghuang Wu, Pengfei Wang, Zhenyang Liang, Yize Ma, Pengfei Song, Guoqing Wu, Jinhua Yu

原文摘要

Nuclear quantification requires locating and typing nuclei, beyond generating a count. Inspired by Jev's structured decisions in place of free-form generation, we introduce NuJEV for nuclear perception in Qwen3-VL-2B. We jointly train visual LoRA and a parallel head to predict nuclear presence, centers, and types. One image encoding feeds both the nuclear head and original language decoder. The decoder interprets region and type requests, with counts computed from the predicted nuclei. On 2,732 PanNuke test images, NuJEV achieves a five-query mean absolute error ($\mathrm{MAE}_5$) of 1.844 overall and 5.268 on dense images, with localization/typed F1 of 0.816/0.682. A matched encoder ablation shows 41.0\% lower dense error with visual adaptation. For language requests, NuJEV reduces request MAE by 76.2\% relative to direct generation. Our code will be released as open source.

cs.CV

新论文 · v1arXiv:2611.11355

Attacking Slide Puzzle CAPTCHAs Based on Time and Space Generative Adversarial Networks

Rui Guo, Xuelian Xie, Botao Xu, Kesheng Liu, Wenxian Wang, Haizhou Wang

原文摘要

CAPTCHAs can protect websites from malicious attacks. As a typical representative of behavior CAPTCHAs, slide puzzle CAPTCHAs have become increasingly popular in recent years due to their user-friendliness and high security. Previous attack methods on slide puzzle CAPTCHA mainly face challenges in the following four aspects. (1) The defense mechanisms of previous slide puzzle CAPTCHAs were relatively simple. The current slide puzzle CAPTCHAs have added complex interferences, detected slide trajectory features in the two-dimensional space, and added other defense mechanisms. (2) The previous notch detection methods were difficult to accurately locate the notch positions. (3) Previous attack trajectories were limited to the horizontal dimension, making them impossible to pass the existing detection. (4) The previous attack trajectories were generated by fitting functions, which were relatively simple and could not well simulate the slide characteristics of human users. In response to the above challenges, firstly, we systematically analyze the defense strategies of six most popular slide puzzle CAPTCHAs: Capy, Dingxiang, Geetest, Kyger, Shumei and Tencent. Secondly, for each type of CAPTCHA, we construct a notch detection dataset and a slide trajectory dataset separately. Thirdly, we use advanced YOLOv11 to detect the notch positions and train generative adversarial networks (GAN) to generate attack trajectories. As far as we know, we are the first to generate attack trajectories by directly learning human slide trajectory characteristic. According to the experimental results, this method cracked six most popular slide puzzle CAPTCHAs with success rates of over 90\%, and the attack time is only about 5 seconds, indicating that the security of existing slide puzzle CAPTCHAs is facing challenge. At the same time, we propose various methods to enhance the security of slide puzzle CAPTCHAs.

cs.CR

版本更新 · v4arXiv:2606.18157

Reducing Prize-Collecting Stroll and Related Routing Problems to Prize-Collecting TSP

Hong Li

原文摘要

We consider prize-collecting variants of the metric traveling salesperson problem (TSP). The prize-collecting stroll problem (PCS) is the path version of the prize-collecting TSP (PCTSP). Given a complete metric graph, two distinct prescribed terminal vertices $s,t$, and nonnegative penalties on vertices, PCS asks for an $s$-$t$ tour minimizing its length plus the total penalty of vertices that are not visited by it. We study a common generalization of PCTSP, PCS, and several related prize-collecting routing problems, which we call the prize-collecting $Φ$-TSP. In this model, an interface $Φ$ specifies a set of prescribed vertices together with their parity and connectivity requirements. We show that, if a polynomial-time $ρ$-approximation algorithm for PCTSP is available, then, for every fixed $\varepsilon>0$, there is a polynomial-time $(ρ+\varepsilon)$-approximation algorithm for the prize-collecting $Φ$-TSP when the number of prescribed vertices is bounded by a fixed constant. Consequently, PCS can be approximated as well as PCTSP up to an arbitrarily small additive loss, closing the gap between the best-known approximation guarantees for the two problems.

cs.DS

版本更新 · v3arXiv:2610.11991

Quantitative Verification of Infinite-State Networks

Dhruv Nevatia, David Basin

原文摘要

Many network protocols and distributed systems combine recursion, unbounded local state, and quantitative behaviour such as cost, latency, or reliability. Existing decidability results for networks of pushdown systems are largely qualitative, and do not extend to quantitative analyses, which must jointly track traces and weights. We present a framework for the quantitative verification of acyclic networks of weighted pushdown systems. Finitely summarising a recursive network component requires collapsing the infinite family of runs obtained by pumping its nested loops, and doing so exactly, rather than by over-approximation, is a standing difficulty. We give a class of weight domains where this is possible: pumping semirings, those in which the weights accumulated by such a family collapse to a closed form; informally, the domain must be unable to count iterations. The class admits domains with infinite ascending chains, such as the arctic semiring and downward-closed languages. Over these, we give a terminating saturation algorithm computing quantitative reachability exactly, resting on two ideas: segment tree algebras, a compositional representation of runs, and thermal extensions, which symbolically separate accelerated weights so that further acceleration remains exact. We use this to compute upward and downward closures of context-free languages uniformly, and to lift the algorithm to acyclic networks over "thin" pumping semirings, yielding the first quantitative safety and reachability analyses for networks of pushdown systems.

cs.FL · cs.LO · cs.PL

新论文 · v1arXiv:2611.11349

AOP-Smart-Finder: A High-Throughput Human-AI Hybrid Framework for AOP Discovery and Evidence Mapping from Large-Scale Literature

Qinjiang Niu, Lu Yan

原文摘要

The rapid growth of scientific literature and the high heterogeneity of biological terminology and mechanistic descriptions make it difficult for researchers to integrate scattered research evidence, identify connections among biological events, and construct mechanistic networks. Here, we developed a high-throughput human-AI hybrid framework, AOP-Smart-Finder, for biological event discovery, relationship mining, and Adverse Outcome Pathway (AOP) construction and evidence mapping from large-scale literature. This framework integrates Large Language Models (LLMs), AOP-Smart retrieval-augmented generation (RAG) technology, and Python-based automation, supporting two analysis modes: one based on a single compound and the other based on a predefined set of biological events. In the di(2-ethylhexyl) phthalate (DEHP) case, the system processed 12,983 articles within 30 min and included 1,093 of them, from which it extracted 1,589 biological events (including 458 official key events [KEs] and 1,131 candidate KEs) and 2,519 key event relationships (KERs). In the amyotrophic lateral sclerosis (ALS) case, the system identified 55 stressors from 437 articles and extracted 278 biological events and 548 event relationships. Following manual curation and Weight of Evidence (WoE) evaluation, a mechanistic network comprising 16 KEs and 23 KERs was ultimately constructed. This framework can either use existing AOPs as knowledge guidance for mechanistic expansion and evidence supplementation, or discover novel event connections and construct mechanistic networks around user-specified research topics. It provides a high-throughput, traceable, human-AI hybrid methodology for complex biological mechanism elucidation and AOP discovery driven by large-scale literature.

cs.CL · q-bio.QM

新论文 · v1arXiv:2611.11348

Separation of Skilling Context for Standard Operating Procedure-based Agents

Mitsuhiro Nakayama, Toshiaki Sota, Takehiko Yamaguchi, Michiaki Tatsubori

原文摘要

Standard Operating Procedures (SOPs) are kept concise for human readability, so LLM agents that generate executable skills from them lack the tacit knowledge and implementation details needed for automation. Human intervention fills these gaps, but must be repeated as SOPs evolve---a problem we call \textit{SOP-skill drift}. We propose managing SOPs and Contextual Knowledge (CK) separately, together with a \textit{contract-aware} evaluation that distinguishes genuine violations from CK-resolved differences. On eight Indeed-derived workflows (single LLM), it raises the functional-equivalence rate from 12\% to 58\%. Under three SOP-revision perturbations, previously extracted CK already covers 79.5\% of newly introduced automation gaps.

cs.AI

新论文 · v1arXiv:2611.11346

IntentLens: Grounding Underspecified Multimodal Queries for Recommendation via Tool-Augmented Reasoning

Xiao Chen, Dong Fang, Haitao Li, Qing Li

原文摘要

As intelligent personal assistants are increasingly deployed in real-world scenarios, recommendation paradigms are shifting from passive preference matching to inferring user intent from underspecified multimodal inputs. In practical interactions, users typically issue a reference image paired with a vague natural language query, keeping key visual attributes, personalized preferences, and item-side constraints implicit. Existing recommendation methods either leverage historical user interactions augmented with multimodal item features or assume fully articulated textual queries; both paradigms struggle to resolve underspecified multimodal queries for accurate item matching. To address this limitation, we propose IntentLens, a tool-augmented recommendation framework that grounds ambiguous multimodal queries into query-relevant evidence prior to user-item matching. IntentLens follows a ground-then-rank pipeline: a shared multimodal LLM leverages visual tools, user memory modules, and item attribute retrieval tools to (i) infer latent user intent from image-text inputs and (ii) augment each candidate item with fine-grained, query-conditioned evidence. Subsequently, a lightweight ranker scores candidates based on the grounded representations. To facilitate research in this novel setting, we construct two benchmarks with underspecified multimodal queries, namely \textsc{GoogleReview-MMTool} and \textsc{Yelp-MMTool}. Extensive experiments on these benchmarks demonstrate that IntentLens outperforms competitive MLLM and retrieval baselines, and exhibits strong generalization to unseen categories and datasets.

cs.IR

版本更新 · v2arXiv:2605.15906

A Causally Grounded Taxonomy for Image Degradation Robustness Evaluation

Stefan Becker, Simon Weiss, Wolfgang Hübner, Michael Arens

原文摘要

Image degradations arise throughout acquisition, processing, and transmission, altering both visual appearance and downstream machine-perception performance. They are studied across synthetic corruption benchmarks, perceptual image quality assessment (IQA), low-level vision, and physically grounded imaging-system analysis. However, these communities rely on incompatible grouping schemes and backend-specific severity definitions, making results difficult to compare across datasets, degradation models, and tasks. We propose a causally grounded framework for organizing and interpreting image degradations. Rather than introducing new degradations or redefining existing benchmarks, we provide an interpretive representation and measurement layer that makes implicit assumptions explicit. Each degradation is characterized by two orthogonal axes: its dominant causal source in the imaging pipeline and its dominant perceptual effect. This dual-axis abstraction yields a compact taxonomy spanning algorithmic corruptions, perceptual distortions, low-level imaging artifacts, and physically motivated camera or system failures. To make severity semantics observable without modifying existing implementations, we quantify each native severity level using full-reference image quality metrics: PSNR, SSIM, and LPIPS. This separates causal origin, perceptual appearance, measured distortion strength, and downstream task impact while preserving native parameterizations. We demonstrate the framework through COCO-Degradation, a taxonomy-aligned benchmark for evaluating object detector robustness under diverse low-level imaging conditions. By connecting causal source, perceptual effect, and measured severity, the proposed framework supports more interpretable and reproducible evaluation of how low-level visual degradations affect machine perception.

cs.CV

新论文 · v1arXiv:2611.11344

Spatial Harness: Grounding Spatial Reasoning in Executable World States with Physics Engines

Chentao Cao, Zhanke Zhou, Sangni Duan, Bo Han, Hang Li

原文摘要

Spatial reasoning requires understanding how objects and observers are arranged in a scene and how their relations change with viewpoint or movement. Vision-language models (VLMs) typically perform both steps through model-internal reasoning, forming an implicit scene interpretation from partial views and imagining the consequences of spatial transformations. A misread scene can lead to a wrong answer, while even a correct interpretation does not ensure that imagined transformations satisfy spatial constraints. We introduce Spatial Harness, which represents scenes as explicit and executable world states to ground spatial reasoning in physics-engine feedback. A Perceiver integrates scene constraints extracted from the question with specialized visual estimates to place objects and cameras in a shared coordinate frame. The resulting state is instantiated in a physics engine, where a Reasoner executes viewpoint changes and uses computed measurements and rendered views to guide reasoning. We evaluate on MindCube, SAT, MMSI-Bench, and SpatialRGPT-Bench with open- and closed-weight VLMs. On MindCube, Spatial Harness improves Qwen3.5-27B from 52.70% to 71.14%, surpassing pySpatial by 7.52 percentage points. Given identical annotated object and camera poses, it reaches 98.25% versus 71.81% for model-internal reasoning. Code is publicly available at: https://github.com/tmlr-group/Spatial-Harness

cs.LG

版本更新 · v2arXiv:2607.29549

AMTFV: Agentic Mathematical Tool-Flow Verification for LLM Self-Correction

Rui Zou, Yutao Zhu, Mengqi Wei, Ji-Rong Wen

原文摘要

Large language models have demonstrated strong mathematical problem-solving capabilities, yet reliably verifying their candidate answers remains challenging. Existing representative methods mainly revise outputs through natural-language reflection or assist verification by directly generating verification programs; the former may not reliably support exact computation, whereas the latter prematurely couples mathematical modeling with low-level implementation. We propose AMTFV (Agentic Mathematical Tool-Flow Verification). By introducing Mathematical Tool Flow (MTF) as an interrupt--execute--resume interface, AMTFV decouples verification modeling from concrete execution and supports exact computation through a mathematical toolbox. Specifically, the verification agent first constructs a verification workflow, encodes the mathematical objects and computational intent requiring reliable execution in an MTF request, and sends it to the mathematical toolbox agent. The latter parses the request, generates executable calls, and dispatches them to the backend for exact computation. Tool outputs then support candidate-answer adjudication, answer revision, and verification-workflow revision. We evaluate AMTFV on five challenging mathematical reasoning datasets with seven model configurations from DeepSeek, GPT, and Gemini. Experimental results show that AMTFV outperforms the representative baselines evaluated in this study overall; under an individual model configuration, it improves average accuracy over the strongest baseline by up to 8.3 percentage points, with larger gains on samples of medium and high verification complexity.

cs.AI

版本更新 · v4arXiv:2310.01830

AI-Generated Images as Data Source: The Dawn of Synthetic Era

Zuhao Yang, Yu Wei, Fangneng Zhan, Kunhao Liu, Muyu Xu, Xiaoqin Zhang, Ling Shao, Shijian Lu

原文摘要

The advancement of visual intelligence is intrinsically tethered to the availability of large-scale data. In parallel, generative Artificial Intelligence (AI) has unlocked the potential to create synthetic images that closely resemble real-world photographs. This prompts a compelling inquiry: how much visual intelligence could benefit from the advance of generative AI? This paper explores the innovative concept of harnessing these AI-generated images as new data sources, reshaping traditional modeling paradigms in visual intelligence. In contrast to real data, AI-generated data exhibit remarkable advantages, including unmatched abundance and scalability, the rapid generation of vast datasets, and the effortless simulation of edge cases. Built on the success of generative AI models, we examine the potential of their generated data in a range of applications, from training machine learning models to simulating scenarios for computational modeling, testing, and validation. We probe the technological foundations that support this groundbreaking use of generative AI, engaging in an in-depth discussion on the ethical, legal, and practical considerations that accompany this transformative paradigm shift. Through an exhaustive survey of current technologies and applications, this paper presents a comprehensive view of the synthetic era in visual intelligence. A project associated with this paper can be found at https://github.com/mwxely/AIGS .

cs.CV