跳到正文
研踪PaperTrail

版本更新

查看已发布论文的最新修订,在详情页对照实际观测到的版本。

部分采集异常

全站更新概况

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

arXiv 最近完成扫描:2026-11-19 06:59 · 全站最近入库:2026-11-19 06:59各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-19 06:59最近发现新增版本:2026-11-19 06:59库内论文最新更新时间:2026-11-18 08:00

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

26,871 已收录论文22,375 AI 相关8,156 有修订112 HF 社区发现

论文修订列表

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

找到 8,156 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 06:57(北京时间)
版本更新 · v6arXiv:2603.13535

From Proxy to Certificate: Two-Sided Ollivier-Ricci Bounds from Balanced Forman Curvature

Giorgio Micaletto, Tebe Nigrelli

原文摘要

Balanced Forman (BF) curvature is used in graph learning as a cheap stand-in for Ollivier-Ricci (OR) curvature, yet it does not lower-bound OR curvature. We show that the BF value of an edge certifies a two-sided interval for its lazy OR curvature without solving any optimal transport problem, that BF coincides with a quadrangle-augmented Jost-Liu (JL) bound with its positive parts removed, and that when the 2-hop neighborhood is available, the interval can be sharpened at a cost of $\mathcal O(d_{\max}^{2.5})$ per edge. On 23 benchmark graphs, our quadrangle-augmented bound is tighter than the bounds of JL and Tian-Lubberts-Weber (TLW) on 13.8-100% of the edges and reduces their mean gap to the exact curvature by a median of 31.2%; intersected with the bounds of TLW, the intervals settle the curvature sign of more than half of the edges on 21 of the 23 graphs. On 15 real networks with up to 1,049,866 edges, a certify-then-solve procedure answers sign queries exactly while solving a median of 5.9 times fewer transport problems, for median speedups of 2$\times$ over exact evaluation, measured against a min-cut solver that is itself about two orders of magnitude faster than the widely used $\mathtt{GraphRicciCurvature}$. The main results are machine-checked in Lean 4.

stat.CO · cs.DM · cs.LG · math.CO · math.DG

版本更新 · v3arXiv:2603.01367

DUEL: Exact Likelihood Reshapes Masked Diffusion Scaling Laws and Beyond

Gilad Turok, Yair Schiff, Chris De Sa, Volodymyr Kuleshov

原文摘要

Masked diffusion models (MDMs) are trained to predict tokens in every order but generate in one. As such, MDM likelihood is an intractable sum over all orders. The evidence lower bound (ELBO) is used as a proxy for likelihood, but it is a loose bound and assumes positions are unmasked uniformly at random. Frontier MDMs, however, select positions with deterministic rules such as confidence. To resolve this mismatch we introduce DUEL, a framework that unifies common deterministic MDM samplers. DUEL computes the likelihood exactly, under the sampler that is actually used during generation. DUEL is a simple plug-and-play algorithm applicable to any pretrained MDM with no retraining. To compute the likelihood of a text sequence, simply replay generation, reveal the true tokens instead of sampled ones, and sum their log-probabilities. Evaluating with DUEL instead of the ELBO changes what we conclude about MDMs. The perplexity gap between MDMs and autoregressive (AR) models shrinks by up to 32% in-domain and 82% zero-shot. In scaling laws, the reported 16x MDM-AR compute gap falls to 9x under DUEL, showing over 1/3 of it is an evaluation artifact. Scoring multiple-choice answers with likelihood via DUEL instead of the ELBO improves LLaDA-8B accuracy on all six tasks, by up to 9.7 points. DUEL also selects samplers correctly: it matches a gold-standard LLM judge on every decided comparison, which generative perplexity and MAUVE fail to do. DUEL reveals that MDMs are more competitive with AR models than the ELBO suggests.

cs.LG

版本更新 · v3arXiv:2602.17659

When Vision Overrides Language: Evaluating and Mitigating Counterfactual Failures in VLAs

Yu Fang, Yuchun Feng, Dong Jing, Jiaqi Liu, Yue Yang, Zhenyu Wei, Daniel Szafir, Mingyu Ding

原文摘要

Vision-Language-Action models (VLAs) promise to ground language instructions in robot control, yet in practice often fail to follow language faithfully. When presented with instructions that lack strong scene-specific supervision, VLAs suffer from counterfactual failures: they act based on vision shortcuts induced by dataset biases, repeatedly executing well-learned behaviors and selecting objects frequently seen during training regardless of language intent. To support systematic study, we introduce LIBERO-CF, the first counterfactual benchmark for VLAs that evaluates language following capability by assigning alternative, feasible task instructions under the same LIBERO scene layouts. Our evaluation reveals that counterfactual failures are prevalent yet underexplored across state-of-the-art VLAs. To mitigate these failures, we propose Counterfactual Action Guidance (CAG), a simple yet effective dual-branch inference scheme that explicitly strengthens language conditioning in VLAs. CAG combines a standard VLA policy with a parallel language-unconditioned branch, amplifying the difference between their action predictions induced by language instructions. This design reduces reliance on vision shortcuts, improves robustness on counterfactual tasks, and requires neither additional demonstrations nor modifications to the base VLA architecture or its pretrained weights. Extensive experiments demonstrate consistent improvements across diverse VLAs. On LIBERO-CF, our training-free variant, TF-CAG, improves $π_{0.5}$ by 9.7% in language grounding and 3.6% in task success. When using a separate Vision-Action (VA) module, VA-CAG achieves larger gains of 15.5% and 8.5%, respectively. In real-world evaluations, VA-CAG improves language grounding by 9.4% and task success by 17.2% on average.

cs.CV · cs.RO

版本更新 · v2arXiv:2611.02490

How Contextual Information in Physical Environments Shapes Decisions with AI

Omar Elgohary, Amanda Elvarsdottir, Vannessa Lee, Zhu-Tian Chen

原文摘要

AI assistants in augmented reality may advise users about parts of the physical world they cannot directly observe. We ask whether contextual information from the situation helps users make better decisions with fallible AI. In an AR visual- search study (N = 32), we varied target prevalence and scene visibility while participants judged whether a key was present, with or without AI assistance. Lowering target prevalence and revealing part of the desk together improved observed AI-assisted accuracy, but our analysis did not demonstrate that this gain came from participants making better use of context. Context also changed which answers seemed plausible: when keys were rare, participants became more skeptical of Present suggestions, but this shift applied to both correct and incorrect suggestions rather than improving selective acceptance of correct advice. Revealing part of the desk also increased decision time, with little evidence of better AI use. Overall, contextual information can shape AI- assisted decisions and increase decision effort without necessarily helping users judge when the AI is correct.

cs.HC

版本更新 · v3arXiv:2609.06596

Reportable Shortcuts with RLBWTs

Travis Gagie

原文摘要

Backward search over a run-length compressed Burrows-Wheeler transform (RLBWT) takes one step per pattern character, even when long stretches of the pattern match material that recurs throughout a highly repetitive collection. We describe shortcuts: for a precomputed set of pairs $(α,β)$ of strings, a backward search that has just matched $β$ and finds $α$ immediately to its left in the pattern can cross $α$ in one step. Since a shortcut is taken only after its pair has been recognized in the pattern, the search returns a report of the shortcuts it took along with the usual BWT interval. Our motivation is pangenome graphs, where such pairs mark the places where a pattern passes through a vertex, so the report gives the path a match takes through the graph. We work out the case of a single linear reference $R$, with $β$ ranging over the length-$\ell$ windows of $R$ starting at multiples of $\ell$, and $α$ over the $2^t \ell$ characters preceding such a window. We show that the search counts correctly, that under stated conditions it crosses a stretch of the pattern matching $m$ consecutive windows of $R$ with $O(\log m + m / 2^τ)$ shortcuts, where $2^τ\ell$ is the longest shortcut, and that the shortcuts can be built efficiently from the RLBWT. On the Pizza&Chili cere collection of 37 genomes, shortcuts make backward search 2.3 to 4.2 times faster on exact patterns of length 200 to 1000, and 1.7 to 2.0 times faster with 1% of the characters substituted, for 86% more space. On 11 gigabases of genomes of seven bacterial species, they make it 1.6 to 1.9 times faster on exact patterns for 32% more space. On whole chromosome 19 haplotypes against 16 to 64 others from the Human Pangenome Reference Consortium, shortcuts in both directions make Boyer-Moore-Li search for maximal exact matches of length at least 1000 about 8 times faster.

cs.DS

版本更新 · v2arXiv:2610.34499

Can Statistics Tell Whether an Undeciphered Text Is Language? Calibrated Tests on the Voynich Manuscript

Xin Zhang, Victor S. Sheng

原文摘要

Statistics are often the only evidence of whether a text in an unread script records a language, but meaningless text shares many of them. A test means little until it is run on texts whose answer is known. We build such tests and apply them to the Voynich manuscript, whose text may be meaningless copying or a language hidden by a cipher. We write both accounts as programs, fit them with the same search budget and check them on held-out statistics. The copying process of Timm and Schinner predicts these statistics better than any cipher with one key, but ciphers with two keys, or that encode only the word classes of a real text, do equally well. A trace of language that needs no decipherment says more. In 28 texts in 16 natural languages the same word pairs keep sharing a line, and the manuscript shows this at half the strength of the weakest. Word codes fall to this level only with heavy miscopying or a plaintext whose word pairs recur weakly, such as abbreviated Latin. Solvers that read enciphered controls find nothing readable in the manuscript under letter ciphers, word codes or codes with one word per letter or syllable. One cipher remains, a nomenclator with two keys, which writes frequent words whole and spells the rest, and whose scribe miscopies more than half of the words. Our tests exclude it in all languages but Arabic and Hebrew. Planted messages show that a short message could still hide.

cs.CL · cs.CR

版本更新 · v2arXiv:2607.05427

Entering the Elite, But Remaining Outside Its Core? The Temporal Structure of Gender Inequality in the Global Citation

Marek Kwiek

原文摘要

This study analyzed the gender dynamics of the global citation elite using the annual Top 2% Stanford/Elsevier lists for 2019-2024. While previous analyses have discussed women s representation (inclusion), I discuss what happens once male and female scientists are within the elite (position and persistence). The database used included 1.22 million person-year observations (N = 1,216,089) and 465,707 unique scientists and scholars from more than 150 countries. I studied entry, exit, and permanent membership in the elite. The share of women in the top 2% increased from 18.35% in 2019 to 20.85% in 2024. However, women were more strongly represented among first-observed entrants than among continuing members, and their share decreased from 21.58% among single-year members to 17.69% among scientists present in all six annual lists. Women were located closer to the lower boundary of the elite in terms of citation index deciles (the lowest decile included 26.88% of women). Men, in contrast, were closer to its upper boundary (the highest decile included only 15.23% of women). Logistic regression models estimated a lower probability of women s membership in the durable core of the elite (odds ratio estimate [OR] = 0.886). Consequently, increasing the inclusion of women in the elite does not mean their equal position within or equal persistence of membership in it. I draw conclusions about temporal gender dynamics within the global citation elite and gender inequalities in science more generally.

cs.DL

版本更新 · v2arXiv:2609.00700

Value Over Language Model: Detecting Original Contribution in Writing

Vibhhu Sharma, Thorsten Joachims, Sarah Dean

原文摘要

LLMs have been rapidly adopted across writing tasks, prompting the development of tools for detecting LLM-generated text. Yet, these tools largely measure how much of a document's surface text was written by an LLM and aren't fundamentally designed to measure how much of the information content or ideas originated from the LLM itself rather than being supplied by the user in the prompt. In this work, we design a framework that measures how much value a person adds on top of what a language model could have easily produced by itself. The method requires no training or labeled data and never scores the document's surface text, insulating it from stylistic confounders. Instead, it extracts the document's content at increasing levels of granularity, uses an LLM to reconstruct the document from each partial representation, and compares these reconstructions with those produced from the task description alone. We call this framework Value Over Language Model (VOLM), which measures a document's contribution relative to a replacement-level document that an LLM could produce from the task description alone. We evaluate VOLM with a specific instantiation of this framework across three domains: news articles, ICLR peer reviews, and argumentative essays. VOLM separates human-authored documents from matched LLM-generated documents produced from generic task descriptions, while remaining substantially invariant to content-preserving transformations, including LLM-based reconstruction and round-trip translation. We further find that increasingly constrained content extractors reduce residual differences between LLM-generated and humanized text, demonstrating the importance of disentangling informational content from stylistic variation. We hope these results encourage further work on specialized instantiations of the framework and on assessing human contributions in LLM-assisted writing more generally.

cs.AI · cs.CL

版本更新 · v2arXiv:2610.27041

Robustness of Internal Signals for Hallucination Detection in Vision-Language Models

Allison Chen, William Yang, Salma Abdel Magid, Jonathan Williams, Olga Russakovsky, Esin Tureci

原文摘要

When given an image and a text prompt, vision-language models (VLMs) can produce seemingly sophisticated text responses. However, they are also prone to hallucinate objects in their output, which can have detrimental consequences in safety-critical applications. To detect these hallucinations, certain methods interestingly leverage internal signals from the VLM as it generates the text response; potentially, these methods use the same signals that led to a hallucination to detect it. We conduct an in-depth analysis to understand the robustness of these detection methods. First, we show that a naive baseline of a generated word's token position in the VLM text response achieves competitive performance. Further, we reveal how some detection methods rely on token position and use this heuristic as a shortcut. Second, we explore detection methods' sensitivity to language and vision modalities. Our experiments suggest that strong detection performance is often driven by detecting language-based hallucinations, and when methods rely on token position, they tend to be less visually grounded and exhibit reduced robustness when hallucinations occur earlier in a text response. Lastly, we demonstrate that different detection methods can carry complementary signals; when ensembling methods together, adding weaker methods to an ensemble of higher performing ones still offers performance improvements. Altogether, while there may be useful internal VLM signals to detect hallucinations, our investigation reveals important limitations of the current methods that try to leverage them.

cs.CV · cs.AI

版本更新 · v2arXiv:2610.14070

What Does the Effective Dimension of a Hybrid Quantum Neural Network Actually Measure?

Md Masum Mia, Amith Khandakar, Mohamed Arselene Ayari

原文摘要

Hybrid quantum neural networks (QNNs) pass features from a classical backbone into a variational quantum circuit, and many studies log a scalar called the effective dimension as a sign of capacity or model quality. The effective dimension is usually defined as the participation ratio (PR) of the quantum Fisher information matrix (QFIM), but studies in practice log a PR of cheap parameter sensitivities instead, and the meaning of that scalar is rarely tested. We show that the logged scalar equals the PR of Pauli-Z output sensitivities, that each sensitivity is at most n times its QFIM diagonal entry on n qubits, and that a PR of the QFIM diagonal overstates the full-matrix PR by an exact factor set by the off-diagonal mass. We then test the scalar on CIFAR-10 and EuroSAT with four frozen backbones, one of them a random projection, over 4 to 16 qubits, 1 to 4 layers, three entangling patterns, and three seeds. At a fixed circuit, CIFAR-10 accuracy spans 23.14% to 86.44% while the scalar stays between 6.63 and 9.13, and its correlation with accuracy changes sign across seeds in 7 of the 14 configurations. Depth raises the share of active parameters from 0.39 to 0.91, near a ceiling we derive, and initial gradient variance falls by a factor of 34.5 from 4 to 16 qubits. Removing entanglement raises accuracy by 5.3 to 8.2 points at the same parameter count. The effective dimension therefore describes circuit geometry rather than model quality, so capacity, trainability, and accuracy each need their own diagnostic.

quant-ph · cs.AI

版本更新 · v2arXiv:2602.00192

AI-Generated Image Detectors Exploit Global Artifacts: Evidence from Inpainting Exchange

Elif Nebioglu, Emirhan Bilgiç, Adrian Popescu

原文摘要

Modern diffusion-based inpainting enables realistic, localized image manipulation, raising critical challenges for reliable detection. We show that state-of-the-art AI-generated image detectors largely fail to identify \emph{what} was synthesized and instead exploit a \emph{global} artifact introduced as a side effect of the generation pipeline: latent-diffusion inpainting passes the entire image through a VAE encoder--decoder, inducing a subtle but pervasive spectral shift even in unedited regions. We turn this observation into a simple, model-free diagnostic, \emph{Inpainting Exchange} (INP-X), that restores the original pixels outside the edited region while preserving all synthesized content. To study the effect at scale, we build a benchmark of $30$K matched real, standard-inpainted, and exchanged triplets ($90$K images) spanning four datasets and three inpainters. INP-X requires no model access and is a single compositing step, yet it collapses pretrained detectors, commercial APIs, and bias-aware methods toward chance (commercial APIs: $>$$90\%\!\to\!\sim$$55\%$; the bias-aware DDA: $97.6\%\!\to\!58.4\%$). We give formal propositions linking the effect to high-frequency attenuation from the VAE information bottleneck, and we causally isolate it with a factorial battery and a variance decomposition that attributes $97\%$ of the background spectral shift to the autoencoder round-trip alone. A perceptual study ($n{=}153$) shows the shift is also perceptible to humans, whose accuracy falls from $63.8\%$ to $56.2\%$ ($p{=}0.002$): significantly reduced, though not eliminated. Finally, we show that mechanism-driven mitigations (mixed-distribution and localization-supervised training) improve robustness, but detecting INP-X edits remains an open problem. Our benchmark and code are available at: https://github.com/emirhanbilgic/INP-X

cs.CV · cs.AI

版本更新 · v3arXiv:2606.11552

教扩散模型从左到右推测

Teaching Diffusion to Speculate Left-to-Right

Lexington Whalen, Yuki Ito, Ryo Sakamoto

AI 速读 基于摘要

通过三种训练期干预,缩小扩散草稿模型的双向生成与自回归目标模型从左到右验证之间的目标错位,从而提升推测解码的接受长度。

cs.CL · cs.LG

查看原文摘要

Large language models (LLMs) achieve remarkable performance across a wide range of tasks, but their autoregressive decoding process incurs substantial inference costs due to inherently sequential token generation. Speculative decoding addresses this bottleneck by employing a lightweight draft model to propose multiple future tokens that are subsequently verified in parallel by a larger target model. Recent work has demonstrated that diffusion language models are well suited for this setting, as they can generate entire blocks of draft tokens in parallel and thereby alleviate the sequential constraints of autoregressive drafting. A subtlety of this regime is that block-diffusion drafters generate tokens bidirectionally within a block, whereas verification is performed by an autoregressive target model that evaluates tokens in a strictly left-to-right manner, leaving a gap between the symmetric training-time objective and the asymmetric verification-time reward. In this work, we offer an empirical analysis of three training-time interventions that narrow this gap: token positional weighting, a first-error focal loss that targets the position that breaks the accepted prefix within each block, and a chain loss term that substitutes a differentiable surrogate for the expected accepted length. The three interventions act along orthogonal axes (position, block-conditional first error, joint prefix) and compose additively; they are likewise orthogonal to test-time alignment mechanisms such as multi-draft self-selection, with which they can in principle be combined. Across four target models and six reasoning, code, and dialogue benchmarks, the three interventions raise accepted draft length by 21-76% per benchmark over a position-uniform baseline, without adding additional forward passes and without changing the inference pipeline or the rejection-sampling exactness contract.

版本更新 · v3arXiv:2605.21921

凸多边形的加权部分三角剖分

On weighted partial triangulations of convex polygons

Antonio Blanca, Alexandre Stauffer, Izabella Stuhl

AI 速读 基于摘要

研究凸多边形加权部分三角剖分的精确采样问题,并给出期望运行时间接近最优的采样算法。

cs.DM · math.CO

查看原文摘要

We study the problem of sampling weighted partial triangulations of a convex polygon with $n+2$ sides. We consider the distribution $π_{n,λ}$ under which each partial triangulation $σ$ is assigned probability proportional to $λ^{|σ|}$, where $λ>0$ is a model parameter and $|σ| \in \{0,\dots,n-1\}$ denotes the number of diagonals in $σ$. This model belongs to a broad class of weighted geometric partition problems that include lattice triangulations and dyadic tilings, and is closely related to several classical combinatorial structures, including the full triangulations of a convex polygon and the associated Catalan structures. Our main result is a simple exact sampling algorithm for $π_{n,λ}$ with expected running time $O\big((\min\{n,n\sqrtλ\}+1)\log n\big)$, which is optimal up to the logarithmic factor.

版本更新 · v2arXiv:2611.03501

当机器人比物体更重:惯性失配如何影响机器人策略学习

When Robots Outweigh Objects: How Inertia Mismatch Shapes Robot Policy Learning

Younghyo Park, Antonia Bronars, Pulkit Agrawal

AI 速读 基于摘要

通过受控仿真实验考察机器人与物体质量差异(惯性失配)对强化学习和行为克隆策略学习的影响,并探索在不更换硬件的前提下降低接触惯性的可行做法。

cs.RO

查看原文摘要

Conventional robot arms can be extremely heavy compared with the everyday objects they manipulate, creating a significant inertia mismatch at contact. Even a small accidental bump from a heavy arm can knock a light object out of place. Modern learning methods have nevertheless demonstrated a wide range of successful manipulation behaviors on these platforms, suggesting that even extreme inertia mismatch can be overcome with sufficient data. However, it remains unclear whether high inertia imposes a hidden cost on learning, potentially worsening scaling with data or lowering the performance ceiling of modern robot learning methods. We investigate this question through controlled simulation experiments that vary robot and object masses. We find that reinforcement learning succeeds across a broad range of mass combinations, while behavior cloning learns more reliable policies when a lighter robot manipulates a heavier object. Heavier robots require more demonstrations to attain the same performance as lighter robots. Finally, because new hardware is rarely an option, we explore ways to lower an existing arm's inertia at contact with existing hardware, either by choosing a lower-inertia workspace before collecting data or by steering the demonstrator toward lower-inertia configurations during the task. In both cases, the lower-inertia demonstrations are imitated more reliably. Project website: https://younghyopark.me/inertia-mismatch/

版本更新 · v3arXiv:2508.12035

ToxiEval-ZKP:面向分子毒性修复任务的结构隐私验证框架

ToxiEval-ZKP: A Structure-Private Verification Framework for Molecular Toxicity Repair Tasks

Fei Lin, Tengchao Zhang, Ziyang Gong, Fei-Yue Wang

AI 速读 基于摘要

作者提出将零知识证明引入分子毒性修复任务的评估流程,使模型开发者能在不披露分子结构的前提下向外部验证者证明生成分子满足多维毒性修复标准。

cs.CR

查看原文摘要

In recent years, generative artificial intelligence (GenAI) has demonstrated remarkable capabilities in high-stakes domains such as molecular science. However, challenges related to the verifiability and structural privacy of its outputs remain largely unresolved. This paper focuses on the task of molecular toxicity repair. It proposes a structure-private verification framework - ToxiEval-ZKP - which, for the first time, introduces zero-knowledge proof (ZKP) mechanisms into the evaluation process of this task. The system enables model developers to demonstrate to external verifiers that the generated molecules meet multidimensional toxicity repair criteria, without revealing the molecular structures themselves. To this end, we design a general-purpose circuit compatible with both classification and regression tasks, incorporating evaluation logic, Poseidon-based commitment hashing, and a nullifier-based replay prevention mechanism to build a complete end-to-end ZK verification system. Experimental results demonstrate that ToxiEval-ZKP facilitates adequate validation under complete structural invisibility, offering strong circuit efficiency, security, and adaptability, thereby opening up a novel paradigm for trustworthy evaluation in generative scientific tasks.

版本更新 · v2arXiv:2611.05359

GSCV++:基于标准视频编解码器的轻量级3D高斯泼溅序列压缩

GSCV++: Lightweight 3D Gaussian Splatting Sequence Compression via Standard Video Codecs

Qi Yang, Yingzhan Xu, Kai Zhang, Li Zhang

AI 速读 基于摘要

提出一种轻量级3D高斯泼溅序列压缩流程,通过改进预处理、3D到2D映射与视频编码配置,借助标准视频编解码器实现压缩。

cs.CV

查看原文摘要

This paper presents GSCV++, a lightweight pipeline for 3D {G}aussian {S}platting (GS) sequences {C}ompression with standard {V}ideo codecs. To meet the requirements of low-complexity and hardware compatibility from the industry, GSCV++ jointly improves preprocessing, 3D-to-2D mapping, and practical video compression configuration of GS compression. First, for preprocessing, energy-adaptive inter-frame spherical harmonic (SH) alternative current (AC) dimensionality reduction (EA-SHDR) is proposed to produces a compact and stable temporal SH AC feature space. It can reduce the data volume of following mapping and practical compression, as well as less complexity while eliminating redundant information. Second, for 3D-to-2D mapping, prior-based Inter-MiniPLAS (P-MiniPLAS) is designed to generate smooth 2D feature maps through prior-based weighting factor inference and small scale remapping. Compared with vanilla Parallel Linear Assignment Sorting (PLAS) and Morton scan, P-MiniPLAS ensures the generated 2D maps are more suitable for the video codec while maintaining a low level of computational complexity. Third, for practical compression, content-aware generalized compression (CA-GC) is developed to use a non-uniform bit-depth split for coordinate map generation, and a coding unit size selection is introduced for efficient compression complexity control, which fully exploits the performance of video codecs without involving normative changes. Experiments demonstrate that GSCV++ reports over 20\% in intra- and 60\% in inter-prediction rate-distortion gains compared with state-of-the-art (SOTA) methods. GSCV++ also achieves faster 2D map generation, encoding, and decoding than other SOTA methods using the same type of video codecs. Ablation studies verify the effectiveness and robustness of the proposed modules and provide insights for subsequent research.

版本更新 · v5arXiv:2506.10912

打破坏分子:多模态大语言模型准备好进行结构级分子解毒了吗?

Breaking Bad Molecules: Are MLLMs Ready for Structure-Level Molecular Detoxification?

Fei Lin, Ziyang Gong, Cong Wang, Tengchao Zhang, Yonglin Tian, Yining Jiang, Ji Dai, Chao Guo 等 12 位作者

AI 速读 基于摘要

该论文提出首个面向通用多模态大语言模型的分子毒性修复基准任务ToxiMol及自动评估框架ToxiEval,并系统评测43个主流模型。

cs.AI · cs.CL

查看原文摘要

Toxicity remains a leading cause of early-stage drug development failure. Despite advances in molecular design and property prediction, the task of molecular toxicity repair, generating structurally valid molecular alternatives with reduced toxicity, has not yet been systematically defined or benchmarked. To fill this gap, we introduce ToxiMol, the first benchmark task for general-purpose Multimodal Large Language Models (MLLMs) focused on molecular toxicity repair. We construct a standardized dataset covering 11 primary tasks and 660 representative toxic molecules spanning diverse mechanisms and granularities. We design a prompt annotation pipeline with mechanism-aware and task-adaptive capabilities, informed by expert toxicological knowledge. In parallel, we propose an automated evaluation framework, ToxiEval, which integrates toxicity endpoint prediction, synthetic accessibility, drug-likeness, and structural similarity into a high-throughput evaluation chain for repair success. We systematically assess 43 mainstream general-purpose MLLMs and conduct multiple ablation studies to analyze key issues, including evaluation metrics, candidate diversity, and failure attribution. Experimental results show that although current MLLMs still face significant challenges on this task, they begin to demonstrate promising capabilities in toxicity understanding, semantic constraint adherence, and structure-aware editing.

版本更新 · v3arXiv:2511.13770

博弈论调控的分布式协调用于空域扇区过载缓解

Game-theoretic Regulated Decentralized Coordination for Airspace Sector Overload Mitigation

Jaehan Im, Daniel Delahaye, David Fridovich-Keil, Ufuk Topcu

AI 速读 基于摘要

提出一种受调控的分布式博弈协议,让各扇区基于最佳响应动态自主调整航班起飞时刻,在有限合作下缓解空域扇区过载并保证收敛到纯纳什均衡。

eess.SY · cs.GT · cs.MA · math.OC

查看原文摘要

Decentralized air traffic management systems offer a scalable alternative to centralized control, but often assume high levels of cooperation. In practice, such assumptions frequently break down since agents, each representing an airspace sector, may operate independently and prioritize local objectives. We address the problem of sector overload in decentralized air traffic management by proposing a regulated decentralized protocol that models self-interested behaviors based on best response dynamics. Each agent adjusts the departure times of its assigned flights to reduce its own congestion, without requiring centralized joint optimization. A tunable cooperativeness factor models the degree to which each agent accounts for overload in other sectors, while a minimal admissibility rule prevents local updates from creating new overloads. We show that this regulatory restriction is sufficient to guarantee finite-time convergence of best response dynamics to a pure Nash equilibrium under partial cooperation. In addition, we identify a sufficient condition under which an overload-free solution corresponds to a global minimizer of the potential function. Numerical experiments using one month of European flight data demonstrate that the proposed algorithm substantially reduces overload even with only minimal cooperation, achieving performance close to a centralized global mixed-integer optimizer and exceeding a centralized first-come-first-served baseline while requiring substantially less computation than centralized optimization. We further evaluate departure delay and fairness to quantify the operational cost of overload mitigation.

版本更新 · v2arXiv:2611.05127

面向医疗AI的多方法评估:整合基准测试、自动评分器与专家评估

Towards Multi-Method Evaluation of AI in Health: Integrating Benchmarks, Autoraters, and Expert Evaluation

Sarah Montgomery-Taylor, Hamsa Subramaniam, Rob Brisk, Liam Foster, Jack Ching, Andrew Marshall, Jim Taylor, John Hernandez 等 33 位作者

AI 速读 基于摘要

提出一个以关键用户旅程为锚点、覆盖AI系统生命周期并融合基准测试、LLM自动评分与专家人工审核的医疗生成式AI多方法评估框架。

cs.CY

查看原文摘要

General-purpose generative AI (GenAI) models are being rapidly adopted in healthcare, but they are challenging to assess with traditional evaluation frameworks. These conceptual, methodological, and practical challenges parallel decades of work in evaluating clinician and health system quality and safety. We describe the adaptation of methods from several fields, combined with emerging technical approaches, into a structured, multi-method evaluation framework designed to give well-rounded assessments of GenAI in health at scale. The approach first anchors evaluation to Critical User Journeys (CUJs) to help prioritize out of a large choice space, and maps these to a phased AI system lifecycle (base model development, product development, and post-deployment monitoring), since evaluation at each stage requires different methodological approaches. In this context, the approach then integrates three distinct evaluation methods (closed-question benchmarks, LLM-as-a-judge autoraters, and expert human review) across three core domains: accuracy, safety, and usefulness. Taken together, this approach provides a strategic framework for bridging the gap between benchmarking results and performance in the real world with the goal of supporting decision-making and accountability across development, procurement, and deployment for product teams, health systems, and regulators.

版本更新 · v2arXiv:2610.13937

Constructive Arboricity in Almost-Linear Time for Dense Graphs

Iman Gholami, Mohammad T. Hajiaghayi, Mahdi JafariRaviz, Alireza Kaviani, Soheil Mohammadkhani, AmirMohammad Shahrezaei

原文摘要

The arboricity of a graph is the minimum number of forests needed to partition its edges. We present an algorithm that computes the exact arboricity of a simple graph and constructs an optimal forest partition in $\min\{n^{2+o(1)},m^{4/3+o(1)}\}$ time, where $n$ and $m$ denote the numbers of vertices and edges. This improves the previous $O(m^{3/2}\log(n^2/m))$ bound of Gabow. In particular, it runs in almost-linear time, $m^{1+o(1)}$, on dense graphs with $m=Θ(n^2)$. We also give an algorithm that constructs a partition into at most one more forest than optimal in $m^{1+o(1)}$ time. To our knowledge, it is the first almost-linear time algorithm for this problem.

cs.DS

版本更新 · v2arXiv:2609.28489

射影爆破:一种形式化与多中心的证明

Projective blowups: a formal and multicentered proof

A. Mayeux

AI 速读 基于摘要

作者报告在 Lean 4 中机器验证了多中心爆破的泛性质,并称这是任意定理证明器中首次对(单中心或多中心)爆破的形式化。

math.AG · cs.LO

查看原文摘要

We give a machine-checked proof, in Lean 4, of the universal property of multi- centered blowups: given a finite family Z of closed subschemes of a scheme X, presented on each chart by ideals, there is a scheme BlZ X over X, terminal among X-schemes on which every member of the family becomes an effective Cartier divisor. To the best of our knowledge this is the first formalisation of blowups, single- or multicentered, in any theorem prover. The proof is organised around the universal property of the multicentered dilatation of a ring. The comparison isomorphisms on overlaps, the cocycle identity, and the independence of the chosen presentation are obtained from the uniqueness part of this universal property. We give the exact theorem statement as formalized, the proof architecture, and the main new mathematical ingredients, together with the corresponding Lean code.

版本更新 · v2arXiv:2610.00685

Backdoor Purification for LoRA-Tuned LLMs via Null-Space Projection

Jianwei Li, Jung-Eun Kim

原文摘要

With the rapid adoption of large language models (LLMs) and parameter-efficient fine-tuning (PEFT) methods, the risk of backdoor attacks has become more severe. Existing backdoor purification methods typically rely on at least one of the strong assumptions, such as prior knowledge of triggers, access to clean references, or aggressive retraining, and they often lack comprehensive evaluations. These constraints substantially limit their practical applicability. To overcome these challenges, our work proposes purifying LoRA-tuned LLMs without these assumptions and even without post-hoc retraining of the suspect parameters. Our objective is to significantly reduce the attack success rates (ASR) while preserving both (i) the base model's general capabilities and (ii) the new downstream skills learned through the adapter. Through a series of examinations, we progressively scale our approach from a single layer in a text classification setting to a full-parameter LLM in the generative task. Through careful data curation and feature approximation, we extract high-fidelity backdoor directions and, for each layer or head, construct orthogonal null spaces in both the input and output channels, onto which the LoRA updates are projected. Empirically, our null-space projection method reduces the ASR from nearly 100% to less than 10%, while preserving the base model's benign performance and the adapter's learned abilities during downstream task adaptation.

cs.AI · cs.CR · cs.LG

版本更新 · v2arXiv:2310.07884

候选人数随机的秘书问题:先验分布信息如何发挥作用

Secretary Problems with Random Number of Candidates: How Prior Distributional Information Helps

Junhui Zhang, Patrick Jaillet

AI 速读 基于摘要

研究候选人数 N 为随机变量且已知其分布 p 的秘书问题变体,分析单阈值策略的近似保证与采样设定下的样本复杂度。

cs.DS

查看原文摘要

We study variants of the secretary problem, where $N$, the number of candidates, is a random variable with distribution $\mathbf p$. The decision maker, given prior distributional information about $\mathbf p$, wants to maximize the probability of success -- picking the largest number among the $N$ candidates -- using only the sequentially revealed relative ranks of the candidates. When $\mathbf p$ is fully known (full information setting), we show that single-threshold type of strategies can achieve $1/e$-approximation to the optimal probability of success among all possible strategies. In the sampling setting, we give an algorithm that finds a strategy with additive suboptimality at most $ε$ and provide its sample-complexity guarantee. We also give a sampling lower bound; for small $ε$, the upper and lower bounds match up to a logarithmic factor in $1/ε$.

版本更新 · v2arXiv:2602.20698

双重污染与异构批次下的高维稳健均值估计

High-Dimensional Robust Mean Estimation from Doubly Corrupted and Heterogeneous Batches

Maryam Aliakbarpour, Vladimir Braverman, Yuhan Liu, Junze Yin

AI 速读 基于摘要

针对用户级任意污染与样本级小比例污染并存的双重污染模型,作者提出SoS算法在高维协方差受限分布下达到min-max最优的ℓ2误差,并扩展到用户局部均值有偏移的异构情形。

cs.LG

查看原文摘要

Modern data systems often require aggregating information from multiple sources: some might be entirely untrustworthy, while the remaining presumably reliable sources may still suffer from a small amount of corruption. We study robust mean estimation under this practical scenario, which is formulated through the double corruption model: samples are divided among $N$ users, each with $n$ samples. $\varepsilon$ fraction of the users could be arbitrarily corrupted, while each of the remaining ``good'' users still have $α$-fraction ($α>0$) of corrupted samples. The goal is to estimate the unknown mean $μ$ with small $\ell_2$ error. This is a challenging scenario because we must handle two types of adversarial corruption: user-level corruption and sample-level corruption. When the unknown distribution has covariance matrix bounded by the identity matrix, we design a sum-of-squares (SoS) algorithm that achieves an $\ell_2$ error of $\sqrtα$ with probability at least $2/3$ as long as the total number of samples $nN=\widetildeΩ(d/α)$. The estimation error and sample complexity are min-max optimal under the mild condition. For comparison, treating all $nN$ samples as $(\varepsilon+α)$-corrupted and applying standard robust mean estimation only achieves an error of $\sqrt{\varepsilon+α}$. Thus, our new algorithm removes the adverse effect of untrustworthy users and achieves the optimal error as if only sample-level corruption is present. Also, our SoS algorithm extends to the heterogeneous setting where each user's local mean could be additionally shifted by $\sqrtβ$ in $\ell_2$ distance. We show that an error of $O(\sqrt{α+β})$ can be achieved with probability at least $2/3$ when $nN=\widetildeΩ(d/(α+β))$.

版本更新 · v3arXiv:2610.32057

HyScale:面向可学习稀疏注意力的长上下文训练扩展系统

HyScale: Scaling Long-Context Training for Learned Sparse Attention

Yangshen Deng, Xinjing Huang, Yulong Wang, Yunzhuo Liu, Jun Hu, Shuyong Tan, Chun-Chih Tseng, Mingji Han 等 11 位作者

AI 速读 基于摘要

HyScale 将可学习稀疏注意力中的 top-k 选择视为索引集合而非激活,通过 FlashTopK 与选择重放加速百万级 token 的长上下文训练。

cs.AI · cs.DC

查看原文摘要

We present HyScale, a long-context training system for learned sparse attention. Learned sparse attention is a promising architecture for million-token contexts, widely adopted in production since DeepSeek-V3.2. Selection, however, grows into the training bottleneck. For each query, it scores every previous token whereas sparse attention reads only $k$; worse, current systems materialize a full score table and repeat selection during recomputation. Our key insight is that the output of selection is not an activation, but rather a set of indices. Building on it, HyScale introduces FlashTopK and selection replay. FlashTopK finds each query's exact top-$k$ on the fly without a score table, while selection replay reuses forward-pass selection in recomputation. Together with holistic system optimizations tackling end-to-end challenges, HyScale speeds up GLM-5.1 training on 1M-token sequences by $2.07\times$ over Megatron-LM on 512 H20 GPUs. It also speeds up the CSA layers of DeepSeek-V4-Flash and the QSA layers of Qwen3.8-Flash-Next by $2.01\times$ and $1.57\times$ at 1M tokens on 32 H800 GPUs.

版本更新 · v2arXiv:2610.12235

语言模型作为AI研究世界模型

Language Models as AI Research World Models

Zijun Wang, Zewen Liu, Minhua Lin, Zhaotian Weng, Zhan Shi, Bing He, Yisi Sang, Dakuo Wang 等 13 位作者

AI 速读 基于摘要

该研究探讨将语言模型用作研究世界模型(RWM),以预测候选实验干预的结果,并利用真实实验经验提升预测与实验选择效率。

cs.CL

查看原文摘要

AI research agents automate the cycle of proposing, implementing, and evaluating experiments, opening a path toward recursive self-improvement. Yet their ability to propose experiments outpaces their capacity to execute them in real environments, making outcome prediction a key capability for sustained self-improvement under limited experimental budgets. We investigate language models as Research World Models (RWMs), which predict the outcomes of candidate interventions across research environments. Our evaluation draws on over 2,600 experimental records from nine research environments spanning pretraining, post-training, and inference, representing more than 171,000 H100 GPU-hours of experimentation. Research knowledge acquired from real experimental experience improves RWM predictions of unseen interventions within the same environment (Spearman +0.27), and can be reused across environments. For example, using only pretraining experience from OLMo3, Marin, and Nanochat, an RWM reduces selection regret in the Qwen3 environment by 78% compared with zero-experience setting. These benefits extend to multi-round Autoresearch under a fixed selection budget: RWMs with in-env and cross-env research knowledge increase the best gain achieved by 15.8% and 11.6%, respectively. Ablations across 13 language models used as RWMs show that adding research knowledge can improve intervention ranking more than changing models or increasing reasoning effort alone. These findings support language models as RWMs and motivate accumulating experimental data for future RWM training.

版本更新 · v3arXiv:2605.12827

GraphIP-Bench:窃取图神经网络有多难,我们能阻止吗?

GraphIP-Bench: How Hard Is It to Steal a Graph Neural Network, and Can We Stop It?

Kaixiang Zhao, Bolin Shen, Yuyang Dai, Shayok Chakraborty, Yushun Dong

AI 速读 基于摘要

提出统一基准 GraphIP-Bench,在同一黑盒协议下系统评测图神经网络模型窃取攻击与所有权防御,并揭示防御在提取后代理模型上的失效缺口。

cs.CR · cs.AI · cs.LG

查看原文摘要

Graph neural networks (GNNs) deployed as cloud services can be *stolen* through *model-extraction attacks*, which train a surrogate from query responses to reproduce the target's behaviour, and a growing line of ownership defenses tries to prevent or trace such theft. The title of this paper asks two questions: *how hard is it to steal a GNN?*, and *can we stop it?* Prior work cannot answer either, because experiments use inconsistent datasets, threat models, and metrics. We introduce *GraphIP-Bench*, a unified benchmark which evaluates both sides under a single black-box protocol. It integrates twelve extraction attacks, twelve defenses spanning watermarking, output-perturbation, and query-pattern-detection families, ten public graphs covering homophilic, heterophilic, and large-scale regimes, three GNN backbones, and three graph-learning tasks, and it reports fidelity, task utility, ownership verification, and computational cost on shared splits, queries, and budgets. We further add a joint attack-and-defense track which runs every attack on every defended target and measures watermark verification on the resulting surrogate, which exposes the protection that a defense retains after extraction. The empirical picture is short: stealing a GNN is easy at medium query budgets and most defenses do not change this; several watermarks verify reliably on the protected model but lose most of their verification signal on the extracted surrogate, which exposes a gap that single-model evaluations miss; and heterophilic graphs are systematically harder to steal, while a cross-architecture mismatch between target and surrogate reduces but does not prevent extraction. We release *GraphIP-Bench* with reproducible scripts and configurations, and integrate the attacks and defenses into the PyGIP library.

版本更新 · v2arXiv:2605.24183

AvalancheBench:通过潜在世界恢复评估企业智能体驱动的语义查询处理

AvalancheBench: Evaluating Enterprise Agent-Driven Semantic Query Processing Through Latent World Recovery

Darek Kleczek, Fuheng Zhao, Alexander W. Lee, Julien Tissier, Pawel Liskowski, Ugur Cetintemel, Anupam Datta

AI 速读 基于摘要

提出多模态企业分析基准 AvalancheBench,用潜在世界规格生成观测数据,考察数据智能体能否在端到端分析中正确决定何时及如何使用语义算子,并量化错误在问题间的“雪崩式”传播。

cs.DB · cs.AI · cs.LG

查看原文摘要

As LLMs improve, data agents are emerging as a new interface for analytics, while semantic query processing engines use LLMs to operate over structured and unstructured data. Existing benchmarks largely evaluate agents and semantic query engines in isolation, leaving it unclear whether agents can decide when and how to use semantic operators in end-to-end analysis. We introduce AvalancheBench, a multimodal enterprise analytics benchmark that generates observed data from latent world specifications and evaluates data agents on their ability to recover that world. The benchmark's 3 validated tasks contain 58 questions spanning text, images, and documents. Questions are provided together as a multi-part analytical brief and may share intermediate results, exposing the avalanche effect: errors can propagate through legitimate dependencies, and inappropriate reuse can cause otherwise unrelated questions to fail. AvalancheBench measures analytical fidelity, monetary cost, and capability-adjusted token cost (CATC), a new metric that weights token use by model capability to separate technical efficiency from provider pricing. We evaluate 5 model-harness configurations across 3 agent harnesses using Snowflake Cortex AISQL as the engine, with the best configuration reaching macro analytical fidelity of 0.82. Agents fail primarily in constructing the analysis: failing to recover facts that require semantic computation costs 45.1% of lost points, yet incorrect operator outputs account for only 2.5%, versus 36.3% from agents misusing or avoiding semantic operators. Misinterpreting requirements costs the most, at 51.5%. Errors also spread between questions: 29% of lost points come from reusing another question's results. Finally, monetary cost and CATC produce different Pareto frontiers, distinguishing economically attractive configurations from those that are technically resource efficient.

版本更新 · v2arXiv:2609.08990

平面中最小膨胀树的次线性近似算法

A Sublinear Approximation Algorithm for Minimum Dilation Trees in the Plane

Sarita de Berg, Jacobus Conradi, Peter Kramer, André Nusser, Sampson Wong

AI 速读 基于摘要

作者提出欧几里得平面中最小膨胀树的第一个次线性近似算法,近似比为 Õ(n^{14/15}),并在多项式时间内运行。

cs.CG

查看原文摘要

The dilation of a geometric graph measures how much longer the path between pairs of points becomes when restricted to graph edges, rather than following the direct path through the ambient space. The minimum dilation tree of a point set is the spanning tree with minimum dilation, where edge lengths in the tree are given by distances in the ambient space. In the Euclidean plane, computing the minimum dilation tree is NP-hard, but no hardness of approximation result is known. On the other hand, the minimum spanning tree is an $(n-1)$-approximation to the minimum dilation tree, but no asymptotically-better approximation algorithm is known for general point sets in the Euclidean plane. We give the first sublinear approximation algorithm for the minimum dilation tree in the Euclidean plane. Our approximation ratio is $\tilde{O}(n^{14/15})$ and our algorithm runs in polynomial time. This resolves an open problem proposed by Eppstein in 1996.

版本更新 · v2arXiv:2604.06541

量子启发的张量网络自编码器用于异常检测:一种基于MERA的方法

Quantum-Inspired Tensor Network Autoencoders for Anomaly Detection: A MERA-Based Approach

Emre Gurkanli, Michael Spannowsky

AI 速读 基于摘要

作者提出并检验一种受MERA启发的多尺度张量网络自编码器,用于对撞机喷注的基于重建的异常检测,并在其基准设定下与稠密自编码器及树张量网络等基线比较。

hep-ph · cs.LG · quant-ph

查看原文摘要

We investigate whether a multiscale tensor-network architecture provides a useful inductive bias for reconstruction-based anomaly detection in collider jets. Jets are produced by a branching cascade, so their internal structure is naturally organised across angular and momentum scales. This motivates an autoencoder that compresses information hierarchically and can reorganise short-range correlations before coarse-graining. Guided by this picture, we formulate a Multiscale Entanglement Renormalization Ansatz (MERA)-inspired autoencoder acting on ordered jet constituents. To our knowledge, a MERA-inspired autoencoder has not previously been proposed, and this architecture has not been explored in collider anomaly detection. We compare this architecture to a dense autoencoder, the corresponding tree-tensor-network limit, and classical baselines within a background-only reconstruction framework. The paper is organised around two main questions: whether locality-aware hierarchical compression is genuinely supported by the data, and whether the disentangling layers of MERA contribute beyond a simpler tree hierarchy. To address these questions, we combine benchmark comparisons with a training-free local-compressibility diagnostic and a direct identity-disentangler ablation. In the nominal benchmark, the MERA-inspired model attains a higher mean AUC than the dense autoencoder at all three latent dimensions while using roughly one-third of its trainable parameters. The locality-preserving multiscale structure is well matched to jet data, and, at the strongest compression bottleneck, the trained disentanglers move substantially away from the identity and are accompanied by a positive mean performance shift. Overall, the study supports locality-aware hierarchical compression as a useful and parameter-efficient inductive bias for reconstruction-based jet anomaly detection in this benchmark setting.