跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1680新增论文
+1333其中 AI 相关
+187已有论文修订
+59新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-17 23:35各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-17 23:35库内论文最新更新时间:2026-11-17 02:59

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

25,786 已收录论文21,491 AI 相关7,725 有修订112 HF 社区发现

浏览论文库

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

找到 19,087 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
新论文 · v1arXiv:2611.09805

基于图神经网络的可扩展图相似性学习

Scaling Graph Similarity Learning with Graph Neural Networks

Ahmet Tüzen, Helge Langseth, Kjetil Nørvåg

AI 速读 基于摘要

提出 FiLSim 框架,探索简化 GNN 流程能否在标准基准上保持竞争力并扩展到大规模图,同时用序列图编辑策略构造带可靠 GED 标签的大规模数据集。

cs.LG · cs.AI

查看原文摘要

Graph similarity computation is an important task in graph mining with many real-world applications, such as chemical compound analysis, program dependence comparison, and social network analysis. The problem is computationally challenging: Graph Edit Distance (GED) and Maximum Common Subgraph (MCS), which quantify the distance between graphs and identify their largest shared subgraph, respectively, are NP-hard to compute exactly. To address these computational challenges, Graph Neural Networks (GNNs) have been applied to this problem. However, existing GNN-based approaches have primarily focused on small-scale graph datasets, while scalability to larger scales remains underexplored. In this work, we propose FiLSim, a scalable GNN-based framework, and investigate whether a simplified GNN pipeline can maintain competitive performance on standard benchmarks while scaling to large graphs. We additionally propose a sequential graph-editing strategy to construct large-scale graph datasets with reliable GED labels to evaluate scalability. The proposed framework is evaluated on four benchmark datasets and four newly created large-scale datasets, demonstrating its effectiveness and scalability. FiLSim remains accurate on graphs with more than 150{,}000 nodes, where the baseline methods run out of memory or fail to learn, and scores all test pairs within seconds on a single GPU.

新论文 · v1arXiv:2611.09803

Maya a1:是选项内容还是选项位置在影响模型?非自回归决策模型中的顺序敏感性

Maya a1: Do the Options Read the Model, or Does Their Position? Order Sensitivity in a Non-Autoregressive Decision Model

Mohammed Nayeem Khan, Logesh L

AI 速读 基于摘要

作者重新工程化 Laya 检查点并测试选项排列顺序对答案的影响,发现发布版模型存在明显的顺序敏感性,而带选项打乱的微调可显著降低翻转率。

cs.AI · cs.CL

查看原文摘要

Laya answers typed multiple-choice questions in one forward pass by scoring a hidden state at one [MASK] marker per option. We re-engineer the checkpoint (421M parameters; a 2-layer option head with no positional tensor; a documented but unused parallel layout) and test whether the answer depends on where an option is listed. Presenting 951 Qwen-verified questions under every cyclic rotation of their options (or six random permutations for 12 options), the released checkpoint changes its answer for 25.8% [22.9-28.7] of questions (19.7% on the 605 English-language items alone); accuracy with the gold option first versus last differs by 10.1 points, and the flips concentrate where the model's own confidence is low (54% versus 8% across confidence terciles). Fine-tuning with Laya's trainer on 2,818 teacher-verified rows with option shuffling cuts the flip rate to 7.2%; the identical rows without shuffling give 11.4%, so shuffling is responsible for 4.2 points of the improvement. A confidence-weighted vote over orderings gives 69.7% against 69.1% for a single base pass at 4.1x the compute. Labels are LLM-made and the test sets are teacher-filtered. We also fine-tune with the authors' parallel layout on the same rows: flip rate 0.5%.

新论文 · v1arXiv:2611.09799

函数均值估计中隐私与平滑的次序问题

On the Order of Privacy and Smoothing in Functional Mean Estimation

Haotian Chen, Yu-Wei Chen, Qifan Song, Jordan Awan

AI 速读 基于摘要

在函数均值估计中比较“先平滑后加隐私”与“先加隐私后平滑”两种流程的均方误差,并给出Banach空间下高斯扰动的GDP保证。

math.ST · cs.CR

查看原文摘要

Differential privacy (DP) is a leading framework for privacy protection, yet privacy mechanisms tailored to functional data analysis (FDA) remain relatively underexplored. For functional mean estimation, we investigate a fundamental question regarding the ordering of privatization and estimation by comparing two canonical pipelines: Fit-Then-Protect (FTP), which smooths trajectories before privatization, and Protect-Then-Fit (PTF), which privatizes observations at discrete time points before smoothing. When data are observed without error, we prove that FTP achieves strictly smaller mean squared error than PTF asymptotically (as the sample size increases) under the same $μ$-Gaussian differential privacy ($μ$-GDP) budget in both finite-dimensional Hilbert spaces and infinite-dimensional reproducing kernel Hilbert spaces (RKHS). Simulation studies support our theory and explore settings with observation error and fitting constraints, demonstrating that FTP outperforms PTF under small observation noise, whereas PTF can become preferable in high-noise settings. In addition to this comparison, we establish a novel GDP guarantee for Gaussian perturbations taking values in a Banach space, extending existing results beyond the RKHS setting.

新论文 · v1arXiv:2611.09798

并行智能体团队:测试时计算扩展的更优方式

Test-Time Compute Scales Better with Parallel Agent Teams

Junlin Wang, Haozhe Chen, Ang Li, Rahul Chalamala, Zhuang Liu

AI 速读 基于摘要

作者提出并行智能体团队方法,通过并行采样多个小型协作团队并保留最佳团队结果,在长程任务上更有效地扩展测试时计算。

cs.AI

查看原文摘要

Test-time scaling improves the performance of a fixed model by spending more computation at inference. There are two common ways to spend it on agents when a verifier can score every attempt. Best-of-N sampling runs many independent agents and keeps the best result but saturates quickly. One large team of collaborating agents can score higher but stops improving as it grows. Can we get the best of both? Our method, parallel agent teams, does so by sampling many small teams in parallel and keeping the best team's result. We test it on 12 long-horizon tasks from GPU kernels and formal proofs to exploit development. With a 27B model and a budget of 100 agents, parallel teams of ten beat parallel agents on 10 of 12 tasks and beat one team of 100 on all four tasks where we ran such large teams. At equal dollar cost the same parallel teams beat a frontier model on half the tasks. A simple statistical model shows that individual agents lose because their many samples have a low mean and that one large team loses because a single sample gets no gain from variance. Sampling many small teams in parallel balances a high mean with the gain from variance. Parallel agent teams thus offer a more effective way to scale test-time compute.

新论文 · v1arXiv:2611.09795

AR-Edit:无需反演的训练无关自回归视频编辑

AR-Edit: Training-Free Autoregressive Video Editing without Inversion

Hovhannes Margaryan, Quentin Bammey, Christian Sandor, Vicky Kalogeiton

AI 速读 基于摘要

作者提出 AR-Edit,利用 DMD 蒸馏自回归视频扩散模型中自注意力 value 的稳定性,缓存并注入源视频 value,实现无需训练、无需反演的实时流式视频编辑。

cs.CV

查看原文摘要

Editing a video stream in real time, without access to future frames, is essential for interactive applications. Existing training-free video editing methods, however, assume full offline access to the entire sequence, while streaming approaches either rely on additional training or are limited to specific editing techniques. We show that this limitation can be removed by analyzing the self-attention dynamics of DMD-distilled autoregressive (AR) video diffusion models. We uncover a key asymmetry: queries and keys remain stable and aligned with their source counterparts across denoising timesteps, while values diverge and encode the evolving content. Inherited from the non-distilled bidirectional teacher, this asymmetry is strongest at high noise, where few-step streaming models operate. The resulting mechanism is simple: a single forward pass suffices to capture source identity in the value features, which can be reused throughout generation. Starting from pure Gaussian noise and injecting only these source values reconstructs the input with fidelity matching or surpassing inversion-based methods, effectively eliminating inversion. Based on this insight, we introduce AR-Edit, a training-free, inversion-free method that caches source values once and selectively injects them during denoising. Across multiple AR backbones, AR-Edit enables real-time streaming editing with superior source preservation and tonal fidelity at minimal overhead.

版本更新 · v3arXiv:2512.22838

超越重叠:面向外存向量搜索的分层图抽象

Beyond Overlap: Hierarchical Graph Abstraction for Out-of-Core Vector Search

Lizheng Chen, Pinhuan Wang, Shaonan Ma, Jie Zhang, Qing Wang, Zhengyi Yang, Heng Zhang, Mingxing Zhang 等 12 位作者

AI 速读 基于摘要

提出分层外存 ANNS 引擎 GANNS,用内存驻留的图抽象在 SSD 访问前实现逻辑重叠,兼顾精度与 I/O 效率。

cs.DB · cs.IR

查看原文摘要

At billion scale, approximate nearest neighbor search (ANNS) often becomes an out-of-core problem: the full vector collection and index structures exceed memory capacity, making query performance dominated by SSD accesses and DRAM-SSD data movement. Existing systems struggle to strike a balance between accuracy and efficiency: physical-overlap methods replicate vectors or index entries across partitions, enlarging the SSD-resident index and incurring extra I/O; quantization-based methods reduce memory usage, but their approximate distances are less reliable and often require costly raw-vector reranking from SSD to preserve recall. We present GANNS (Graph-Abstraction ANNS), a hierarchical out-of-core ANNS engine that improves accuracy and I/O efficiency simultaneously. GANNS stores each cluster as a disjoint SSD partition with scale-aware indexes, while a memory-resident graph abstraction provides logical overlap before SSD access. During serving, GANNS uses query hotness and cluster priorities from the graph abstraction to prune low-value clusters and improve access locality. Across five datasets under strict memory constraints, GANNS delivers representative QPS improvements of 2.0--4.7x over state-of-the-art baselines, while preserving accuracy.

版本更新 · v2arXiv:2609.39078

参数对称性决定过参数化非线性网络中的表征几何

Parameter Symmetries Determine Representational Geometry in Overparameterized Nonlinear Networks

Marvin Theiss, Lukas Braun, Andrew M. Saxe, Erin Grant

AI 速读 基于摘要

作者提出参数对称性通过加法、复制与缩放三种基本特征变换作用于表征,并给出表征几何的闭式分解,说明过参数化下功能固定时表征仍可能退化。

cs.LG

查看原文摘要

Representations are routinely used across machine learning, psychology, and neuroscience to draw inferences about the computations of biological and artificial systems. Such inferences presume that the geometry of these representations reflects the computation being performed. For artificial neural networks, however, the extent to which the function a network computes constrains this geometry remains unclear. One key obstacle is that these networks admit parameter symmetries: changes in parameterization that preserve function exactly while reshaping representational geometry. Here, we show that a broad class of parameter symmetries acts on representations through just three primitive feature transformations: addition, duplication, and scaling. This feature-level characterization yields a closed-form decomposition of representational geometry into essential and auxiliary components, revealing how representational degeneracy can exist without and grows with overparameterization even when function is held fixed. Finally, we establish conditions under which implementation-level selection rules resolve this degeneracy, yielding identifiable geometries in which features are weighted according to their contributions to the network's function. Together, our results delineate when representational geometry can support inferences about computation, and when it cannot.

新论文 · v1arXiv:2611.09780

LLM排行榜中的策略竞争与趋同

Strategic Competition and Convergence in LLM Leaderboards

Naveen Raman, Fei Fang, Yiling Chen

AI 速读 基于摘要

作者将排行榜竞争建模为开发者在不同能力上分配资源的博弈,分析能力画像趋同(单一化)与性能水平收敛的条件,并用LM Arena和OpenRouter数据做经验观察。

cs.GT · cs.CY · cs.SE

查看原文摘要

Leaderboards are a popular way to compare large language model (LLM) capabilities and can influence how model developers invest resources. We ask when competition on leaderboards leads developers to produce models with similar capability profiles, which we call monoculture, or similar performance levels. We study this by formulating leaderboard competition as a game in which model developers invest resources across capabilities to maximize their win rate. We show that similar production functions can induce similar capability profiles, while comparative advantage can sustain distinct capability profiles. We then study convergence in performance levels and show that diminishing returns can lead to an increasingly crowded competitive frontier. Using data from LM Arena and OpenRouter, we find that developers improve more in categories where they lag competitors, while still retaining category-specific advantages. At the same time, we find that the frontier of models becomes increasingly crowded, alongside increasingly diversified model usage patterns. Our results suggest that increasing competition does not need to produce interchangeable models, but can instead sustain competitive models with distinct strengths.

版本更新 · v2arXiv:2605.06919

大语言模型能否对检索信息持保留态度?

Can LLMs Take Retrieved Information with a Grain of Salt?

Behzad Shayegh, Mohamed Osama Ahmed, Fred Tung, Leo Feng

AI 速读 基于摘要

评估八个大语言模型能否根据检索上下文中表达的不确定性调整回答,并提出无需改权重的交互策略来减少遵从错误。

cs.CL

查看原文摘要

Large language models have demonstrated impressive retrieval-augmented capabilities. However, a crucial area remains underexplored: their ability to appropriately adapt responses to the certainty of the retrieved information. It is a limitation with real consequences in high-stakes domains like medicine and finance. We evaluate eight LLMs on their context-certainty obedience, measuring how well they adjust responses to match expressed context certainty. Our analysis reveals systematic limitations: LLMs fail to reproduce their prior outputs after observing an uncertain context, respond to expressed certainties in a distorted way, and overrely on complex contexts. To address these, we propose an interaction strategy combining prior reminders (feeding the model's own context-free answer back into the prompt), context-certainty recalibration, and context simplification. This approach reduces obedience errors by 25% on average, without modifying model weights, demonstrating the efficacy of interaction design in enhancing LLM reliability. Our contributions include a principled evaluation metric, empirical insights into LLMs' uncertainty handling, and a portable strategy to improve context-certainty obedience across diverse LLMs.

版本更新 · v3arXiv:2504.04619

增量最小生成树的新算法及其时序图应用

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications

Xiangyun Ding, Yan Gu, Yihan Sun

AI 速读 基于摘要

作者提出 AM-tree 数据结构,用于增量最小生成树,并在理论上达到与 link-cut tree 相同的界,同时报告了在实践中优于 link-cut tree 的性能,还讨论了如何用时序图处理中的多类设置-问题组合来求解。

cs.DS

查看原文摘要

Processing graphs with temporal information (the temporal graphs) has become increasingly important in the real world. In this paper, we study efficient solutions to temporal graph applications using new algorithms for Incremental Minimum Spanning Trees (MST). The first contribution of this work is to formally discuss how a broad set of setting-problem combinations of temporal graph processing can be solved using incremental MST, along with their theoretical guarantees. Despite the importance of the problem, we observe a gap between theory and practice for efficient incremental MST algorithms. While many classic data structures, such as the link-cut tree, provide strong bounds for incremental MST, their performance is limited in practice. Meanwhile, existing practical solutions used in applications do not have any non-trivial theoretical guarantees. Our second and main contribution includes new algorithms for incremental MST that are efficient both in theory and in practice. Our new data structure, the AM-tree, achieves the same theoretical bound as the link-cut tree for temporal graph processing and shows strong performance in practice. In our experiments, the AM-tree has competitive or better performance than existing practical solutions due to theoretical guarantees, and can be significantly faster than the link-cut tree (7.8-11x in updates and 7.7-13.7x in queries).

新论文 · v1arXiv:2611.09770

ROSE:面向多模态大语言模型终身知识编辑的风险感知正交子空间导航

ROSE: Risk-Aware Orthogonal Subspace Navigation for Lifelong Knowledge Editing in Multimodal Large Language Models

Lingyun Song, Ziyao Chen, Kang Pan, Xiaolin Han, Yifei Zhang, Xiaoqi Wang, Yudai Pan, Xuequn Shang

AI 速读 基于摘要

提出ROSE框架,通过将参数更新限制在已编辑子空间的正交补中,并引入风险掩码与多粒度知识融合,以缓解多模态大模型终身知识编辑中的局部性侵蚀与灾难性遗忘。

cs.CL · cs.AI · cs.CV

查看原文摘要

Multimodal Large Language Models (MLLMs) require continuous factual updates to stay current, yet lifelong knowledge editing remains a daunting challenge. The primary obstacle is the severe Locality Erosion and Catastrophic Forgetting, where sequential edits inevitably interfere with pre-trained capabilities and prior updates. In this paper, we propose \textbf{ROSE}, a \textbf{R}isk-aware \textbf{O}rthogonal \textbf{S}ubspace navigation framework for lifelong knowledge \textbf{E}diting. ROSE addresses forgetting by aiming to restrict parameter updates to the orthogonal complement of previously edited subspaces. Crucially, it introduces a risk-guided mechanism that utilizes a dynamically computed risk mask to safeguard specific factual parameter subspaces essential for model stability. During inference, ROSE employs a multi-granularity knowledge integration strategy, featuring prototype-anchored semantic gating and perturbation-driven subspace fusion to precisely activate edited knowledge for relevant queries while limiting interference on unrelated inputs. Comprehensive experiments on two prominent multimodal benchmarks show that ROSE is competitive with state-of-the-art approaches across five key metrics, while maintaining outstanding stability over $1,000$ sequential updates. Our code is available at https://github.com/sunlitsong/ROSE.

版本更新 · v2arXiv:2606.02294

正则化大邻域搜索

Regularized Large Neighborhood Search

Germain Vivier-Ardisson, Laurent Demonet, Axel Parmentier, Mathieu Blondel

AI 速读 基于摘要

作者提出正则化大邻域搜索(RLNS),将大邻域搜索启发式转化为组合可行解集上的高效 MCMC 采样器,并配套 Fenchel-Young 损失,用于无需全局求解器的端到端学习。

cs.LG

查看原文摘要

Operations research practitioners typically tackle NP-hard combinatorial problems using large neighborhood search (LNS), a scalable heuristic that iteratively refines a current solution by locally re-optimizing subsets of its variables. In contrast, most existing approaches for integrating combinatorial optimization layers into neural networks still assume access to an exact global solution, which is computationally intractable. We bridge this gap by introducing regularized LNS (RLNS). By regularizing or perturbing local subproblems, we turn the LNS heuristic into an efficient MCMC sampler over the combinatorial set of feasible solutions, with associated Fenchel-Young losses. Under entropic regularization, we prove that RLNS performs exact block Gibbs sampling. Furthermore, adjusting the number of RLNS iterations allows us to interpolate between pseudolikelihood and exact maximum likelihood estimation, for end-to-end learning without global solvers. We demonstrate our approach on $k$-subset selection, generalized assignment, and stochastic vehicle scheduling problems.

新论文 · v1arXiv:2611.09768

语言作为特质、礼貌作为策略:LLM社交推理智能体中语言效应的受控测试

Language as Trait, Politeness as Strategy: Controlled Tests of Linguistic Effects in LLM Social-Deduction Agents

Yuchen Li, Lisa Liu, Runqi Zou, Shuxuan Kuang, Qingquan Zhang, Julian Togelius

AI 速读 基于摘要

作者在LURK Werewolf框架中只改写同一话语的自然语言表达(语言复杂度范围与礼貌策略),通过重放对局检验这些语言差异是否改变其他LLM智能体的信任判断与行动。

cs.CL · cs.AI

查看原文摘要

Large language model (LLM) agents coordinate through conversation, and the same message can be phrased in simpler or more complex language, bluntly or politely. We test whether such differences change how other agents judge and act, using the LURK Werewolf framework, which separates each utterance's speech-act predicate from its natural-language realization. We rewrite only the realization, check that the game content is preserved, and replay each game day from saved checkpoints against a re-sampled control. We vary linguistic range consistently across a speaker's messages and politeness strategy per utterance. Across 30 games and 4,335 replays, neither manipulation changes the trust other agents place in the speaker, and no effect on votes or night actions survives correction for multiple comparisons; the largest uncorrected effect is that shifting range away from a neutral paraphrase changes about 4 percentage points more of the other players' votes. In natural play, 88% of face-threatening speech is bald on-record regardless of role.

新论文 · v1arXiv:2611.09763

5G波束赋形的链路级性能比较:基于互易性的SVD与基于码本的预编码

Link-Level Performance Comparison of 5G Beamforming: Reciprocity-Based SVD vs. Codebook-Based Precoding

S. M. Haider Ali Shuvo, Seda Dogan-Tusha, Monisha Ghosh

AI 速读 基于摘要

在3GPP合规的链路级仿真中比较SRS-SVD与CSI-RS-PMI两种下行预编码方案,发现二者各有优势,并可用简单分类器按用户选择更优方案。

cs.NI · eess.SP

查看原文摘要

Downlink (DL) precoding in mid-band MIMO relies on uplink (UL) sounding reference signals (SRS) with reciprocity-based singular value decomposition (SVD) or channel state information reference signals (CSI-RS) with codebook-based precoding matrix indicator (PMI) feedback. Although SVD precoding offers unquantized beamforming, it depends on a channel estimate from SRS transmitted at the limited user equipment (UE) power, whereas Type-I PMI is quantized but derived from a high-power CSI-RS based channel estimate. In this paper, we compare SRS-SVD and CSIRS-PMI for single-user MIMO through an end-to-end, 3GPP-compliant link-level simulation at 3.75 GHz with 100 MHz bandwidth, using a 192 antenna element gNB mapped into 32 ports, the 3GPP Release 19 UE antenna model, and ray-traced (RT) channels in Manhattan and Chicago. We show that neither scheme is uniformly superior: CSIRS-PMI serves weak and shadowed users better and reduces outage, whereas SRS-SVD achieves higher spectral efficiency (SE) and enables more multi-layer transmission for users with strong channels. The results on the Clustered Delay Line (CDL)-C statistical channel also confirm this crossover. We further show that by utilizing a simple logistic regression based on the received power of the standard CSI reference signal (CSI-RSRP) and the channel quality indicator (CQI), the gNB can select the optimal transmission scheme with around 90% accuracy, achieving an SE that closely approaches an ideal per-user selection.

新论文 · v1arXiv:2611.09759

思维链的紧致层级定理

A Tight Hierarchy for Chain of Thought

Thanh Le, A. Pavan, N. V. Vinodchandran

AI 速读 基于摘要

作者报告了首个针对思维链(CoT)计算的层级定理,证明增加 CoT 推理步数会严格提升 transformer 的计算能力。

cs.LG · cs.CC

查看原文摘要

Chain-of-thought (CoT) reasoning has emerged as a powerful paradigm for extending the computational capabilities of transformer-based models. A growing body of recent work has begun to uncover the fine-grained computational power of transformers augmented with CoT, as well as their connections to classical complexity theory. In this work, we advance this line of research by establishing the first hierarchy theorem for CoT-based computation. Our main result shows that for any reasonable resource bound $r(n) \geq n$ and any $\varepsilon > 0$, \[ \mathrm{CoT}(r(n)) \subsetneq \mathrm{CoT}(r(n)^{1+\varepsilon}), \] where $\mathrm{CoT}(r(n))$ denotes the class of decision problems solvable by transformers using $O(r(n))$ CoT reasoning steps on inputs of length $n$. Our result shows that increasing the number of CoT reasoning steps provably yields strictly greater computational power, establishing CoT steps as a fundamental resource in transformer-based computation. Unlike classical hierarchy theorems, which are typically proved via diagonalization, our approach leverages known coarse-grained simulations between CoT-augmented transformers and Turing machines in both directions. Building on these connections, we adapt the classical padding technique from complexity theory to this setting to obtain a tight hierarchy. A key technical contribution of our work is the implementation of padding within the transformer-based CoT model.

新论文 · v1arXiv:2611.09758

无扩散得分匹配用于精确条件采样

Diffusion-free Score Matching for Exact Conditional Sampling

Thomas Wedenig, Robert Peharz

AI 速读 基于摘要

提出 DISCO,一种无需时间索引得分场的得分匹配方法,仅估计扰动数据分布的单一得分,从而支持从任意条件分布中精确采样。

cs.LG

查看原文摘要

The success of modern score-based generative models is largely driven by diffusion-based training, which learns a collection of time-indexed score fields corresponding to progressively noisier versions of the data distribution. While such models achieve impressive sample quality, leveraging them for sound probabilistic inference---particularly sampling from arbitrary conditionals of the model---remains challenging. This difficulty arises because conditioning information is only available for clean data and not for the higher noise levels required to generate exact conditional samples. In this paper, we introduce DIffusion-free SCOre matching (DISCO), a principled approach that sidesteps the need for time-dependent score fields altogether. Our method is based on an objective that, while reminiscent of diffusion-based training, estimates only a single score of the (slightly perturbed) data distribution, for which the exact conditional score is readily obtained. In experiments, DISCO is competitive with state-of-the-art diffusion models in terms of sample quality. More importantly, DISCO yields a more faithful representation of the underlying data distribution and---crucially---enables accurate sampling from arbitrary conditionals, outperforming standard heuristic samplers. This capability opens the door to principled and flexible probabilistic reasoning with score-based models.

版本更新 · v2arXiv:2605.11673

Incremental Matrix Assembly for Preplanned Dynamic Tetrahedral Meshes

Manish Acharya, David Hyde

原文摘要

Local topology edits require updating assembled operators even when most of a tetrahedral mesh remains unchanged. We implement and evaluate incremental matrix assembly for preplanned edits, assuming a fixed pool of candidate elements with precomputable contributions. A preallocated sparse layout allows operator values to be updated from edited elements without rebuilding the sparsity structure. We compare full reassembly, local recomputation, and persistent incremental updates using a shared layout. Across tested meshes with up to 460k tetrahedra, incremental assembly achieves 6-27 times assembly speedups over a vectorized full-reassembly baseline for a proxy graph Laplacian and 2-17 times for linear elasticity. Frame times decrease by 1-3% when the linear solve dominates and by 18-20% in the tested synthetic dynamic elasticity loop with shorter solves. Local Recompute often achieves comparable frame times. For fixed time-step coefficients, directly maintaining the combined elasticity system also avoids a global matrix-combination pass. The Laplacian matches full reconstruction exactly in every tested frame; elasticity differences remain at rounding scale, reaching a maximum entry difference of 4.2 times 10^(-16) over 5,000 frames.

cs.GR

版本更新 · v3arXiv:2511.16558

在图上以多项式时间模拟高斯玻色采样

Simulating Gaussian boson sampling on graphs in polynomial time

Konrad Anand, Zongchen Chen, Mary Cryan, Graham Freifeld, Leslie Ann Goldberg, Heng Guo, Xinyuan Zhang

AI 速读 基于摘要

作者报告,与图上高斯玻色采样(GBS)相关的一个分布以及另一个与玻色采样相关的分布,都可以在经典计算下以多项式时间采样。

quant-ph · cs.DS

查看原文摘要

We show that a distribution related to Gaussian Boson Sampling (GBS) on graphs can be sampled classically in polynomial time. Graphical applications of GBS typically sample from this distribution, and thus quantum algorithms do not provide exponential speedup for these applications. We also show that another distribution related to Boson sampling can be sampled classically in polynomial time.

版本更新 · v2arXiv:2609.17212

高斯多用户信道容量域

The Gaussian Multiuser Channel Capacity Region

John M. Cioffi

AI 速读 基于摘要

该工作利用接收机子集消息原子、高斯单用户等效与连续解码来刻画高斯多用户信道的容量域。

cs.IT

查看原文摘要

This work characterizes a Gaussian multiuser-channel capacity-region using receiver-subset message atoms, Gaussian single-user equivalents, and successive decoding. A memoryless multiuser-channel model specifies both the channel conditional distribution and the independent-use input distribution. For all linear Gaussian channels, independent Gaussian user signaling and receiver-local worst-case-noise/MMSE-GDFE transformations provide a single-user-equivalent basis for the complete capacity-region construction. Each user distributes its input autocorrelation among a finite set of receiver-subset atoms, whose rate sums satisfy the applicable receiver constraints. Minimum-energy and weighted-rate-sum designs optimize these allocations, while fixed-allocation linear programs determine feasible atomic rates and synchronized time-shared successive-decoding implementations. The resulting framework includes Gaussian multiple-access, broadcast, and interference channels, with numerical examples illustrating their rate regions and receiver designs.

版本更新 · v2arXiv:2610.07473

From Dialogue to Diagnostic Hypotheses: Evaluating LLM Agents for Psychiatric Assessment

Milad Mohammadi, Fatemeh Akrami Shamsabadi, Zahra Mohseni, Amirhossein Safdarian, Malekfarhad Malek, Hadi Moradi, Hesham Faili

原文摘要

Although LLMs show promising diagnostic reasoning on supplied clinical evidence, their ability to elicit such evidence through free-form psychiatric interviews remains less understood. We evaluate interview quality and diagnostic hypotheses using simulated patients and human participants. For controlled simulation, we introduce PsyCPG, transforming clinical cases into structured patient profiles. On 30 paired cases, experts rate PsyCPG simulations higher in quality than raw-case role-play (4.50 versus 3.83/5). We introduce PsyCIDRA, a dual-agent framework: its interviewer agent uses a notepad tool, expert-written skills, and ICD-11 reference tools to guide interviews; its diagnostic agent analyzes the transcript and produces a report for expert review, ranking differential diagnoses with supporting, conflicting, and missing evidence. Across four models and 53 development cases, PsyCIDRA achieves higher observed diagnostic agreement than direct prompting. On 81 held-out simulated cases, exact-code rank-1 accuracy reaches 60.5% versus 51.9%. We conduct 101 interviews with human participants; two psychologists, blinded to interview condition and model reports, independently assess interview quality and transcript-supported hypotheses. In separate arms, PsyCIDRA agrees with experts on whether to issue a hypothesis in 79.6% of cases versus 65.4% for direct prompting. This study provides an empirical basis for understanding and evaluating LLM agents in free-form psychiatric interviewing.

cs.AI

新论文 · v1arXiv:2611.09746

基于连续小波变换特征提取的人血浆样本激光诱导击穿光谱分类

Continuous wavelet-based feature extraction for laser-induced breakdown spectroscopy classification of human plasma samples

Md Mahmudur Rahman, Atqiya Munawara Mahi, Nazim Ahmed Belabbaci, Mohammad Arif Ul Alam

AI 速读 基于摘要

该研究评估用连续小波变换(CWT)从激光诱导击穿光谱(LIBS)中提取谱峰特征,并结合SVM区分SARS-CoV-2阳性与阴性人血浆样本。

cs.AI

查看原文摘要

Extracting discriminative features from laser-induced breakdown spectroscopy (LIBS) spectra is important for the classification of complex biological samples. This study evaluates continuous wavelet transform (CWT)-based spectral peak extraction for distinguishing human plasma samples labeled as SARS-CoV-2-positive or negative. Plasma specimens from 181 individuals, comprising 53 positive samples and 128 negative controls, were deposited as 5 μL droplets on silicon substrates and dried before analysis. Spectra were acquired using a nanosecond Nd:YAG laser operating at 1064 nm, with 100 single-shot measurements collected per specimen and averaged after intensity-based outlier rejection. CWT-based peak detection was coupled with a support vector machine (SVM) classifier. The reported leave-one-out evaluation yielded an accuracy of 93.00%, sensitivity of 94.67%, and specificity of 91.61%; these estimates remain provisional pending reconciliation with specimen-level predictions. Features identified by the CWT pipeline included emission lines assigned to Ca II, K I, and N I. The workflow provides a basis for examining spectral features associated with the studied plasma groups. Independent validation and assessment of specimen, substrate, and acquisition-related variability are required to establish generalizability and diagnostic relevance.

新论文 · v1arXiv:2611.09745

多尺度闭运算指数(MCI):用于度量二维点集间结构相似性

Multiscale Closing Index (MCI) for measuring structural similarity between 2D point sets

Nicolò Zava, Angel Franco-Alvarez, Samy Blusseau, Santiago Velasco-Forero, Maria-Jose Jimenez

AI 速读 基于摘要

作者提出一种基于多尺度数学形态学、取值在0到1之间的二维点集结构差异度量MCI,并在合成点云上考察其对多种扰动的响应。

math.MG · cs.CG · cs.CV

查看原文摘要

We introduce Multi-scale Closing Index (MCI), a new dissimilarity measure for evaluating the alignment of two 2D point sets. MCI is bounded between 0 and 1 and is based on multiscale mathematical morphology operations, with smaller values indicating greater structural agreement. The measure was motivated by the need to assess the quality of registration between point sets representing cell populations in biological images. To evaluate its behaviour under controlled conditions, we generated synthetic point clouds from Perlin-noise-based spatial structures, following established approaches for simulating biologically plausible spatial organization. We assessed MCI between those point clouds and different transformed versions, obtained by local perturbation, point removal, translation, rotation and addition of impulsive noise. Across these experiments, the dissimilarity MCI increased gradually and consistently with perturbation severity, while showing a clear discontinuity between clouds originating from the same underlying spatial structure and point clouds generated from different structures. We further compared MCI with commonly used point-set distances, including Hausdorff-based measures and Sliced Wasserstein distance. These experiments show the ability of MCI to capture structural agreement and quantify deviations between point sets, highlighting its potential as a complementary metric for evaluating two-dimensional point-set registration.

新论文 · v1arXiv:2611.09744

面向分层架构恢复的QAOA:可行性、局限与分解的作用

QAOA for Layered Architecture Recovery: Feasibility, Limits, and the Role of Decomposition

Julien Cardinal, Andrew Chedid, Imen Benzarti, Ghizlane El Boussaidi, Christophe Pere, Jean-Marc Robert

AI 速读 基于摘要

该研究将分层架构恢复(LAR)建模为QUBO并用QAOA求解,发现分解比增大电路或采样预算更关键。

cs.SE

查看原文摘要

Layered architecture recovery (LAR) reconstructs a system's architectural layers from its package dependencies, and is defined as a combinatorial optimisation problem solved with classical search. We investigate whether the Quantum Approximate Optimization Algorithm (QAOA) can be applied to LAR, and with what practical limitations. We formulate LAR as a Quadratic Semi-Assignment Problem, transform it into a Quadratic Unconstrained Binary Optimisation (QUBO) problem in which each package is penalised unless it is assigned to exactly one layer, and encode it as an Ising Hamiltonian solved by QAOA. To reach instances beyond the qubit budget of a single circuit, we also apply an impact-guided decomposition that solves the problem as a sequence of smaller sub-problems. We evaluate the approach on three real Java systems ($15$, $18$, and $24$ qubits), studying the effect of circuit depth and sampling budget (RQ1), a comparison with a classical Tabu Search baseline (RQ2), robustness to simulated quantum noise (RQ3), and the decomposition (RQ4). We find that monolithic QAOA is feasible and accurate on the two smaller systems but fails on the $24$-qubit instance, that the sampling budget rather than circuit depth governs its accuracy, and that it is competitive with but does not outperform Tabu Search. Decomposition restores reliable recovery on the $24$-qubit instance, raising the optimal rate from $6.7\%$ to $93.3\%$; its accuracy is governed by the size of each sub-problem and, unlike the monolithic pipeline, improves as the sampling budget is reduced. Our results indicate that, in the current noisy intermediate-scale regime, problem decomposition, rather than larger circuits or more sampling, is the key to applying QAOA to software architecture recovery.

新论文 · v1arXiv:2611.09741

NIH资助的图谱计划中学科内与跨学科的研究合作

Research Collaborations Within and Across Disciplines in NIH-Funded Atlas Programs

Michael P. Ginda, Yongxin Kong, Katy Börner

AI 速读 基于摘要

该研究比较HTAN、HuBMAP和SenNet三个NIH图谱联盟的内部合作模式及其与科学影响力的关系。

cs.SI · cs.DL

查看原文摘要

The National Institutes of Health (NIH) fund several programs (aka consortia) that support the construction of organ-specific or whole person atlases. These initiatives are designed to build comprehensive open reference datasets while advancing knowledge graphs, analytics, visualizations, and user interfaces needed to explore multiscale human atlas data. Here, we compare the Human Tumor Atlas Network (HTAN), Human BioMolecular Atlas Program (HuBMAP) and Cellular Senescence Network (SenNet) to examine collaboration by consortium component (CC) and researcher role and its relation to scientific impact. We retrieved 884 NIH award records and identified 1,255 focal publications acknowledging these awards, involving 8,952 researchers; compiled 99,108 citing publications covering 93% of the focal publications; constructed co-authorship networks; and as single-project publications or internal collaborations (IC), including intra-CC and inter-CCs collaborations. within each atlas program. Results show that IC publications are rare but involve many funded projects and principal investigators (PIs). Technology-oriented CCs tend to engage in intra-CC collaboration, whereas experimental-oriented CCs often collaborate across CCs of the same type. Compared with other researchers, PIs exhibited a significantly stronger association with inter-CCs than with single-project publications. IC publications have higher mean Relative Citation Ratios than single-project publications. Inter-CCs publications have significantly higher cumulative and annual citation levels in the first five post-publication years. Study methods and results can be used to inform the funding, management, and impact reporting for future Big Science programs that bring together 300+ experts from different disciplines to address major research challenges.

新论文 · v1arXiv:2611.09740

统一多模态模型在浅水无人机图像畸变评估与复原中的零样本基准测试

Zero-Shot Benchmarking of Unified Multimodal Models for Shallow-Water UAV Image Distortion Assessment and Restoration

Dario Scilla, Omar A. Lopez, Mattia Rosso, Kasper Johansen, Matthew F. McCabe

AI 速读 基于摘要

作者报告了首个针对统一多模态大模型在浅水无人机图像水致畸变评估与复原上的系统性零样本基准,结果显示识别畸变并不等于能可靠复原。

cs.CV

查看原文摘要

Shallow-water UAV imagery provides centimeter-scale observations of benthic environments, but water-induced distortions complicate interpretation. To our knowledge, we present the first systematic zero-shot benchmark of unified multimodal large language models (MLLMs) for both assessing water-induced distortions and restoring shallow-water imagery within the same model framework. We evaluate five open-weight unified MLLMs with frozen pretrained weights and without access to paired reference images or descriptions of the true seabed. The benchmark contains 1,000 image pairs: 600 semi-synthetic UAV scenes created by applying synthetic water distortions to real shallow-water imagery and 400 fully synthetic through-water scenes. Three independent human annotations cover five distortion types. We evaluate four assessment prompts (P0-P3), from direct instruction to structured task decomposition, on all 1,000 images and four diagnosis-guided restoration prompts (R0-R3) on a common 100-image subset. Assessment varies substantially by model and prompt, with systematic prediction biases and a best pooled balanced accuracy of 0.654 for distortion presence. The best pooled PSNR gain is +0.255 dB, no unified MLLM improves pooled LPIPS, and some outputs alter scene structure or hallucinate content. Two restoration-only baselines also show limited transfer: InstructIR achieves a pooled PSNR gain of +0.040 dB, while PromptFix degrades all four pooled metrics under every prompt. These results show that recognizing shallow-water degradation does not imply reliable physical restoration and provide a reproducible baseline for future work.

新论文 · v1arXiv:2611.09735

5G-NetBotSim: A Synchronized Co-Simulation Framework for Connected Robots over ROS and srsRAN-based 5G Network

Narges Golmohammadi, Bhaskara Venkata Raju Garuda, Ayan Joshi, Sabur Baidya

原文摘要

Connected robotic applications increasingly rely on wireless communication for teleoperation, coordination, and distributed autonomy. However, robotic simulators often use ideal links or abstract delay models that do not capture cellular scheduling and protocol processing effects. We present 5G NetBotSim, a realtime co simulation framework integrating ROS/Gazebo workloads with an executable, full stack srsRAN 5G network emulator. The framework provides isolated User Equipment (UE) robot contexts and stage level timing across the host, gNB, UE, ROS, and robot execution stages. We evaluate human to robot teleoperation and robot to robot leader follower coordination under controlled channel quality conditions. Results show how CQI and MCS variations propagate to throughput, communication latency, and robot performance. In leader follower coordination, higher channel quality reduces mean tracking error from 0.558 m to 0.460 m, a 17.6% reduction. These results demonstrate protocol stack in the loop co simulation for joint network and robotic-application evaluation.

cs.NI

新论文 · v1arXiv:2611.10097

A Privacy-Aware Deep Learning Benchmark for Facial Emotion Recognition

Larissa Palhares, Maria Machado, Hudson Bruno, Raphael Ramos, Andrew Vale, Barbara Barbosa, Inara Souza, Fabio Grassiotto

原文摘要

Facial Expression Recognition (FER) traditionally relies on raw RGB images, introducing privacy risks, sensitivity to illumination variations, and susceptibility to identity-confounding visual shortcuts. As an alternative, this work proposes a lightweight, privacy-aware pipeline using exclusively geometric representations-facial landmarks (478 points) and blendshapes (52 coefficients, ARKit standard)-eliminating persistent raw video storage. Six neural architectures trained from scratch on fused CREMA-D and RAVDESS datasets were benchmarked against an ImageNet-pretrained ResNet50 baseline under a 5-fold subject-independent cross-validation protocol. Geometric models consistently outperformed the pixel baseline on unseen subjects with 12-124 times fewer parameters, while demonstrating superior robustness on subtle emotional expressions such as sadness. Ablation studies reveal that blendshapes capture the primary discriminative signal, while landmarks provide essential complementary spatial topology. These results demonstrate that compact geometric representations preserve affective semantics, eliminate downstream transfer learning dependency on visual backbones, and enable efficient, privacy-aware emotion recognition.

cs.CV · cs.AI

版本更新 · v2arXiv:2605.11884

Sobolev Regularized MMD Gradient Flow

Chenyang Tian, Bharath K. Sriperumbudur, Arthur Gretton, Zonghao Chen

原文摘要

We analyze Sobolev descent, a regularized variant of maximum mean discrepancy (MMD) gradient flow based on a gradient penalty on the MMD witness function. This regularization mitigates the non-convexity of the MMD objective, and yields provable \emph{global} convergence guarantees in MMD, in both continuous and discrete time. A surprising appeal is that our convergence analysis does not rely on isoperimetric assumptions on the target distribution. Instead, it is based on a regularity condition on the difference between kernel mean embeddings. We extend Sobolev descent such that it is applicable in both sampling (from an unnormalized target distribution)---using Stein kernels---and generative modeling settings, unlike previous works, where a gradient flow is suitable for only generative modeling or sampling but not both. We empirically validate the method on a broad range of tasks across both settings.

cs.LG

新论文 · v1arXiv:2611.10096

Coordinated Mixed-Precision KV Cache Quantization for Efficient LLM-based Multi-agent Systems

Weizhong Huang, Jinchao Zhang, Xiawu Zheng

原文摘要

LLM-based multi-agent systems solve complex tasks through collaboration, but their growing, simultaneously resident key-value (KV) caches create a memory bottleneck. Applying single-model quantization policies independently ignores differences in agents' precision needs, potentially degrading collective reasoning. We introduce Coordinated Mixed-Precision KV Cache Quantization (CoMixKV), which combines online sensitivity estimation with joint agent-layer bit-width allocation under a shared memory budget. To our knowledge, CoMixKV is the first mixed-precision KV-cache quantization framework to jointly allocate precision across simultaneously resident agent caches under such a budget. The estimator derives sensitivity from a local attention-error bound using recent queries, keys, and values, without calibration data, trial quantization, or additional model passes. A shared controller combines these scores with remaining quantizable capacity and byte-level storage costs to minimize total estimated error. Allocations are refreshed as agents start or finish and new observations become available. Selected widths apply only to newly quantized blocks; recent states retain native precision and previously quantized blocks remain unchanged. Across four benchmarks and three LLM backbones at average 2-bit, 3-bit, and 4-bit settings, CoMixKV achieves strong accuracy against the evaluated quantization baselines. At the average 3-bit setting on Gemma-4-31B-it, it achieves 68.35% average accuracy, exceeding the strongest quantized baseline by 0.59%. On Qwen3-32B, it reduces peak KV-cache memory by 32.08% and achieves a 1.38x inference speedup over FullKV.

cs.LG

新论文 · v1arXiv:2611.09730

What to Delegate, What to Preserve: Human Preferences for Agentic AI Across Everyday Life and Work

Sarah Wheeler, Veronica Rammouz, Yaoyao Qian, Zexuan Liu, Mengyi Wei, Anthony Rios, Tianzhi He, Kyrie Zhou

原文摘要

AI agents can execute multi-step tasks on users' behalf, yet the boundaries of acceptable delegation remain unclear. We report a scenario-based survey of 289 U.S. adults with prior AI experience covering 45 use cases across nine life domains. Each respondent evaluated one scenario per domain, producing repeated measures of automation preference, trust, collaboration, AI leadership, privacy concern, and willingness to pay. Automation preferences varied substantially across domains. Generalized estimating equation models showed that greater trust in the AI agent, desired AI leadership, prior task-specific AI use, and anticipated financial savings were associated with greater automation preference. In contrast, concerns that automation would reduce personal fulfillment predicted lower automation preference. Open-ended responses further revealed a preference for bounded autonomy, with participants often favoring substantial AI execution while retaining human involvement, oversight, or final authority. We argue that delegation is best understood as a configuration of execution, collaboration, leadership, and authority.

cs.AI · cs.HC