跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+758新增论文
+578其中 AI 相关
+94已有论文修订
+95新增 AI 导读

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

统计口径与数据新鲜度

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

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

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

24,106 已收录论文20,158 AI 相关7,049 有修订112 HF 社区发现

浏览论文库

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

找到 24,106 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
版本更新 · 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.09785

这些程序员够熟可以吃了吗?评估大语言模型在翻译中如何处理词汇知识冲突

Are These Programmers Ripe Enough to Eat? Evaluating How LLMs Handle Lexical Knowledge Conflicts in Translation

Dongxu Wu, Sara Court, Micha Elsner

AI 速读 基于摘要

作者构建受控汉英翻译任务,考察大语言模型在提示提供的词义与模型先验词汇知识冲突时如何取舍。

cs.CL · cs.LG

查看原文摘要

External lexical resources can help large language models (LLMs) translate texts in low-resource languages and specialized domains, but these resources may conflict with models' prior lexical knowledge. To isolate this conflict, we construct a controlled Mandarin-to-English translation task in which familiar source words are assigned new meanings within and across semantic categories. We treat these prompt-supplied meanings as contextual knowledge (CK) and systematically evaluate the effects of word frequency, sentence context, and prompt framing on the translated outputs. Across nine models, CK reliance is greater for less frequent source words and in sentence contexts that support the supplied meanings. Prompt framing can reduce CK reliance, but seven of nine models favor CK even when explicitly instructed to ignore the supplied meanings. Within model families, larger models are more likely than smaller models to utilize CK in their outputs. Three follow-up experiments further show that modal weakening lowers CK reliance, the effect of repetition depends on prompt layout, and the effect of reasoning varies across models. Overall, our controlled study reveals how CK reliance varies across conditions and models, motivating new methods to detect and evaluate lexical conflicts and guide models' lexical choices in LLM-based translation.

版本更新 · v2arXiv:2610.02945

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

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

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

AI 速读 基于摘要

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

cs.AI · cs.CL

查看原文摘要

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

版本更新 · v2arXiv:2605.05921

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

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

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

AI 速读 基于摘要

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

cs.AI · cs.HC

查看原文摘要

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

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

新论文 · v1arXiv:2611.09778

可解码POMDP的拟多项式时间规划

Quasipolynomial-Time Planning for Decodable POMDPs

Oliver Dobson, Varun Jog, Chun Hei Michael Shiu

AI 速读 基于摘要

作者提出对每个固定ρ>0的ρ-可解码POMDP给出拟多项式时间近似规划算法,并论证可解码性是比可观测性更弱且易检验的统一假设。

cs.LG · cs.DS · cs.IT · math.OC · stat.ML

查看原文摘要

We study planning for finite-horizon partially observable Markov decision processes (POMDPs) with finite state, action, and observation spaces. Both exact and approximate planning are known to be computationally hard in this setting, so prior work has explored natural assumptions that make planning easier. Recent work [Golowich et al., 2022] gave quasipolynomial-time approximate planning algorithms for observable POMDPs. These are POMDPs whose observation channels satisfy an $\ell_1$-observability condition, but notably, no assumptions are required on the transition dynamics. In a similar vein, for every fixed $ρ>0$, we give quasipolynomial-time approximate planning algorithms for $ρ$-decodable POMDPs. We show that decodability is implied by both $\ell_1$- and $\ell_2$-observability and is strictly weaker than observability. Moreover, we show that the optimal decodability constant can be computed in polynomial time, whereas computing the optimal $\ell_1$-observability constant is NP-hard in the worst case. We also show that the fast filter-forgetting guarantee underlying the approach of [Golowich et al., 2022] does not extend directly from $\ell_1$-observability to constant $\ell_2$-observability. Thus, decodability is an easy-to-check, unifying assumption under which quasipolynomial-time approximate planning for POMDPs is possible.

新论文 · v1arXiv:2611.09777

蛇形机器人自主全身移动-操作

Autonomous Whole-body Loco-manipulation Using a Snake Robot

Adarsh Salagame, Henry Noyes, Haroon Hublikar, Alireza Ramezani

AI 速读 基于摘要

作者提出在蛇形机器人 COBRA 上不区分推进与操作功能,用接触隐式动力学模型与轨迹优化实现侧向蜿蜒中自主推动物体到目标位置。

cs.RO · eess.SY

查看原文摘要

Snake robots can leverage their hyper-redundant morphology for both locomotion and manipulation through distributed body contact but whole-body loco-manipulation is particularly challenging since the entire body serves simultaneously as propulsive mechanism and manipulation tool Prior work on wheeled legged and snake robot platforms has decoupled these functions through dedicated appendages body segmentation or grippers We present closed-loop loco-manipulation with our snake robot COBRA without this distinction such that any part of the body may make contact We develop a contact-implicit dynamic model unifying robot-ground robot-object and object-ground interactions within a Moreau-Jean time-stepping framework and formulate a trajectory optimization over the full-order dynamics guided by a geometric planner and nominal proportional controller to autonomously push an object to a goal location during sidewinding We validate the planner and controller on hardware across varied configurations and present simulation results for a simplified trajectory optimization that resolves robot-object and object-ground contacts

版本更新 · 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.

新论文 · v1arXiv:2611.09773

Aaronson-Ambainis 猜想的证明

A proof of the Aaronson-Ambainis conjecture

David Turturean

AI 速读 基于摘要

作者证明低次有界多项式在离散立方体上必有有影响的变量,从而证实 Aaronson-Ambainis 猜想。

cs.CC · quant-ph

查看原文摘要

Aaronson and Ambainis conjectured that every bounded polynomial of low degree on the discrete cube has an influential variable. They showed that the conjecture implies that the acceptance probability of every quantum algorithm making $T$ queries can be approximated on most inputs by a classical algorithm making $\mathrm{poly}(T)$ queries. We prove their conjecture: every function $f\colon\{-1,1\}^n\to[-1,1]$ of degree at most $d\ge1$ has a variable of influence at least $c\,\operatorname{Var}(f)^{5/2}/d^{6}$, where $c>0$ is an absolute constant. In the original formulation, for polynomials of degree at most $d$ with values in $[0,1]$ on $\{0,1\}^n$ and variance at least $\varepsilon$, this gives a variable of influence at least $(\varepsilon/d)^{7}$. The proof is elementary, with steps inspired by works of others. Thus, as Aaronson and Ambainis anticipated, superpolynomial quantum speedups in the query model require structure, such as a promise on the inputs.

版本更新 · v2arXiv:2605.23362

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

Instance-Optimal Estimation with Multiple LLM Judges on a Budget

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

AI 速读 基于摘要

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

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

查看原文摘要

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

新论文 · v1arXiv:2611.09771

跨域 TARA 到 NAC 规则映射方法:从汽车 OEM 网络到储能系统

A Cross-Domain TARA-to-NAC Rule Mapping Methodology: From Automotive OEM Networks to Energy Storage Systems

Krishna Teja Medam, Thiago Quinelato

AI 速读 基于摘要

提出一套六步方法,把 ISO/SAE 21434 威胁分析与风险评估得出的网络安全目标映射为可追溯、落在指定执行点的网络访问控制规则,并在汽车 OEM 工厂网络与公用事业级电池储能两个场景做桌面推演。

cs.CR · cs.NI · eess.SY

查看原文摘要

Threat analysis and risk assessment under ISO/SAE 21434 ends with cybersecurity goals, but existing methods give little structured guidance for turning those goals into enforceable network access control rules. Compliance standards such as IEC 62443, ISO/SAE 21434, and ISO/IEC 27001 are usually applied as parallel efforts rather than as one enforcement architecture. This paper presents a six-step methodology that maps cybersecurity goals from a threat analysis and risk assessment to network access control rules, each placed at a named enforcement point and traceable to the threat records behind it. It also presents a unified compliance framework that treats IEC 62443 and ISO/IEC 27001 as a fixed substrate and domain-specific regulation as an interchangeable overlay. The methodology is applied to an automotive original equipment manufacturer plant network, addressing multi-tier supplier authorization and legacy operational technology devices, and then to utility-scale battery energy storage, where North American Electric Reliability Corporation Critical Infrastructure Protection standards and ISO/IEC 27019 replace the automotive-specific standard while the substrate stays constant. In the automotive example, 37 threat entries and 24 cybersecurity goals yield 23 rules covering 11 of the 13 in-scope goals; the energy example yields six rules. Three derived rules have no equivalent in the cited standards. Both examples are desk-based: the methodology is applied to them, not tested on them. The result is a reusable pattern for translating risk assessment into enforcement across critical infrastructure sectors, with empirical validation left as future work.

版本更新 · 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:2608.11624

学习说服揭示大语言模型放弃正确信念的脆弱性

Learning to Persuade Exposes How Easily LLMs Abandon Correct Beliefs

Nimet Beyza Bozdag, Emre Can Acikgoz, Gokhan Tur, Dilek Hakkani-Tür

AI 速读 基于摘要

作者提出对抗性说服威胁,并用对抗强化学习训练说服者智能体,展示其能大幅提升让目标模型改变答案的成功率。

cs.CL · cs.AI

查看原文摘要

Persuasion is a core dynamic of natural language communication, shaping how large language models (LLMs) update beliefs, resolve disagreements, and reach decisions. As LLMs increasingly debate, advise, and think collaboratively with humans and each other, resistance to harmful persuasion becomes a core requirement for reliable behavior. Yet a single targeted persuasive argument can be enough to collapse model accuracy to near zero, even when the argument is factually false. We formalize this threat as adversarial persuasion and introduce an adversarial reinforcement learning framework that trains persuader agents to change a target model's answer in a single interaction. First, we show that RL-trained persuaders raise persuasion success from approximately 24% to over 93% against the training-time persuadee. Second, we find that these learned strategies generalize across four out-of-distribution benchmarks, maintaining 89-95% persuasion success against the training-time persuadee. They also transfer to unseen models, achieving 83% success on Qwen-14B, 79% on Llama-3.1-8B, and 25% on GPT-4o-mini, although effectiveness can be limited for frontier models, with only 4% success on GPT-5-mini. Third, we demonstrate that a curriculum that bootstraps on more persuadable open-weight models before targeting harder models further increases GPT-4o-mini attack success from 25% to 38%. Moreover, our results reveal that optimized persuaders increasingly rely on credibility-based tactics, including fabricated citations and false authoritative evidence. Together, these findings expose a critical weakness in current LLM agents. Even when they initially reason correctly, they can be steered toward false conclusions by optimized natural language influence. This positions persuasion robustness as a necessary safety criterion for multi-agent and human-AI decision-making systems.

版本更新 · 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.09769

AnimWeb-Bench:从视频生成动画网页代码的基准测试

AnimWeb-Bench: Benchmarking Animated Webpage Code Generation from Videos

Zhongyi Zhang, Jingyu Xiao, Shuqing Li, Michael R. Lyu

AI 速读 基于摘要

作者提出首个从视频生成完整动画网页代码的基准 AnimWeb-Bench,并设计静态外观与动画保真度二维评测协议,对14个多模态大模型和3个编码智能体进行了评测。

cs.SE · cs.CV

查看原文摘要

Animation is pervasive on the Web, the CSS animation property alone appears on over three-quarters of webpages. Yet existing webpage code generation benchmarks target static screenshots, user-triggered interactions, or isolated motion graphics, leaving the ability of multimodal large language models (MLLMs) and coding agents to reconstruct complete animated webpages largely unexplored. To fill this gap, we introduce AnimWeb-Bench, the first benchmark for animated webpage code generation from videos. It comprises 124 real-world webpages spanning 7 application domains and 33 animation types, with 91.9% of pages combining multiple types, each paired with a reference video and the static assets of the original webpage. We further propose a human-aligned, two-dimensional evaluation protocol: Static Appearance Fidelity measures structure, text, color, and visual similarity on aligned keyframes, while Animation Fidelity tracks UI components across frames and compares their position, size, velocity, and appearance with those in the reference video. Evaluating 14 MLLMs and three coding agents reveals: (1) reproducing webpage animations is substantially more difficult than reproducing static appearance; (2) explicit frame inspection and render feedback improve the reconstruction quality of coding agents; and (3) rapid, continuous changes are harder to reproduce than discrete state transitions. Our code and dataset are available at https://starry1001.github.io/AnimWeb-Bench-website/ .

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

从泛化误差的PAC界到参数估计误差的PAC界

From PAC bounds on the generalization error to PAC bounds on the parameter estimation error

Mihaly Petreczky, John Leth, Emma Lukacs, Balint Daroczy

AI 速读 基于摘要

作者提出利用PAC泛化误差界导出的oracle界,为动态系统推导有限样本参数估计误差界,并以线性与双线性系统为例说明。

cs.LG

查看原文摘要

Probably Approximately Correct (PAC) bounds on the generalization error (the difference between the empirical prediction error computed on the training data and its expectation) are an established tool in statistical machine learning, and there have been several extensions of these bounds to dynamical systems. In parallel, in recent years, there has been growing interest in finite-sample bounds for parameter estimation error in system identification. The latter bounds tend to be algorithm-specific, relying on reformulating the identification algorithm as a least-squares regression problem. This is in contrast to classical PAC bounds, which are algorithm-agnostic and can be applied to any identification algorithm based on minimizing a cost function involving the empirical loss. In this paper, we show how oracle bounds derived from PAC bounds can be used to derive finite-sample bounds for dynamical systems. As an illustration of this approach, we present finite-sample parameter-estimation bounds for linear and bilinear systems with bounded inputs and noise. These bounds apply to identification algorithms based on minimizing a regularized empirical loss function. The key ingredient is to establish an oracle inequality, i.e., an inequality between the true prediction error of the learned model and the minimum achievable true prediction error, and then use either the convexity of the true loss or system-theoretic properties of the loss function to derive bounds on the parameter estimation error. We also analyze the rates of the obtained bounds and compare them with those of classical asymptotic results.

新论文 · v1arXiv:2611.09764

k-Clique 假设已死,且是彻底地死了

The k-Clique hypothesis is dead, for good

Virginia Vassilevska Williams, Or Zamir

AI 速读 基于摘要

作者提出一个对足够大的 k 在 n^{(ω/3−c)k} 时间内求解(并计数加权)k-Clique 的算法,据此声称推翻了长期存在的 k-Clique 猜想。

cs.DS · cs.CC

查看原文摘要

We present an algorithm that solves the $k$-Clique problem for any large enough $k$ and any $n$-vertex graph in $n^{\left(\fracω{3}-c\right)k}$ time, where $ω\geq 2$ is the matrix multiplication exponent and $c>0$ is a positive constant independent of both $ω$ and $k$. This refutes the long-standing $k$-Clique conjecture, regardless of the value of the matrix multiplication constant, even if $ω=2$. In fact, our algorithm solves the more general problem of counting weighted $k$-Cliques.

新论文 · v1arXiv:2611.10099

Enmo Safety: External, Non-invasive, Model-agnostic Oversight for Off-the-Shelf Language Models

Mohammed Nayeem Khan, Sarun Kumar K. S., Allan Kevin T., Chirag Vaidya, Vrishank Tiwari

原文摘要

We study a safety harness that improves itself without touching model weights. Enmo Safety wraps a chat model with a deterministic input assessment, trigger-matched safety guidance, spotlighting of untrusted content, and an output guard. A reflector model turns failures into one bounded update per round, and an update is kept only if it lowers harm without raising refusal of benign prompts on a held-out dev split. Every version is snapshotted and every decision ledgered. We evaluate a bare model, the seed harness and the evolved harness on six open benchmarks (HarmBench, AdvBench, JailbreakBench, XSTest, AgentHarm, deepset prompt-injections). On 150 items and on a 290-item holdout, none of the before/after differences on two models was statistically significant. A fourth iteration ran six policy models on a fresh 300-item split: the harness cut the unsafe rate significantly on two models (12.9% to 7.1%, p = 0.035; 10.2% to 3.6%, p = 0.036), not on the other four, and raised agentic-harm labels on two. Whether the rules fired was unrelated to outcome (Fisher p from 0.30 to 1.0), and the helpfulness clauses made agentic harm worse than no harness on obfuscated attacks. A reworded clause and an input-normalisation step form harness v22, at a measured cost in benign tool-task refusal. Each cell is one run, so these estimates do not establish a general safety improvement. Code, harness versions and ledger: https://github.com/rioryugen/enmo_safety

cs.CR · cs.AI · cs.SE

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

版本更新 · v3arXiv:2602.15815

隐私过滤器被残差刻画:自由自然过滤器的特征与自适应性的代价

Privacy Filters are Captured by Residues: A Characterization of Free Natural Filters and the Cost of Adaptivity

Matthew Regehr, Bingshan Hu, Ethan Leeman, Pasin Manurangsi, Pierre Tholoniat, Mathias Lécuyer

AI 速读 基于摘要

论文用贝尔曼方程刻画隐私过滤器的最坏情况隐私损失,提出统一现有过滤器的残差过滤器,并研究自然过滤器的自由性与自适应代价。

cs.CR · cs.DS

查看原文摘要

We study privacy filters, which enable privacy accounting for differentially private (DP) mechanisms with adaptively chosen privacy characteristics. We show that the worst-case privacy loss of interacting with any privacy filter is characterized by a Bellman equation. We apply this theory to develop residue filters, which unify existing privacy filters. We develop the Gaussian DP (GDP) residue filter, which strictly improves upon the naïve GDP filter. We show that, in the average case, this new filter asymptotically permits as many pure DP queries as in the non-adaptive case and a factor $π/2$ more pure DP queries than the naïve GDP filter. We also show that residue filters capture the natural filter, which promises greater utility by leveraging exact privacy accounting techniques. Earlier privacy filters consider only simple privacy parameters such as Rényi-DP or GDP parameters. Natural filters account for the entire privacy profile of every query, promising more efficient use of a given privacy budget. We show that, contrary to other forms of DP, natural privacy filters are not free in general. We present a characterization of when a family of private queries admits free natural filters for a given budget. In particular, only families of privacy mechanisms that are totally-ordered when composed admit free natural privacy filters with respect to an arbitrary privacy budget. Finally, we show that, while the natural approximate-DP filter can fail in the presence of an adaptive adversary, it cannot fail too badly: the output remains approximate-DP with parameters at most poly-logarithmically worse than the intended privacy parameters.

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

新论文 · v1arXiv:2611.09756

面向边缘环境目标检测的轻量级卷积神经网络

A lightweight convolutional neural network for target detection in an edge environment

Hughes Perreault, Ola Ahmad, Daniel Czuboka

AI 速读 基于摘要

作者提出一种面向边缘设备部署的轻量级CNN,结合实时热点检测算法用于威胁或目标识别与分类。

cs.CV

查看原文摘要

This paper proposes a novel, lightweight convolutional neural network (CNN) designed for edge device deployment. The CNN is developed to recognize and classify threats or targets of interest. The model is equipped with a real-time hotspot detection algorithm, which enables it to process information quickly and accurately, resulting in improved inference time of up to 20 fps and a detection range of more than 400 meters with typical thermal situational awareness sensors. The proposed CNN has been rigorously tested and validated to demonstrate its high accuracy, sensitivity, and low false positive rate, providing a reliable solution for edge devices to detect potential targets. Additionally, the lightweight design of the CNN allows for easy deployment, making it an ideal solution for extending the security bubble for edge devices. The proposed model can be used for a variety of applications, including surveillance, security, and object recognition.

版本更新 · 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.

新论文 · v1arXiv:2611.09747

对抗性调度器下的争用解决

Contention Resolution Against an Adversarial Scheduler

Michael A. Bender, Martín Farach-Colton, Andrew Krapivin, Pritom Kundu, John Kuszmaul, Margaret Kuszmaul, William Kuszmaul, Jingxun Liang

AI 速读 基于摘要

研究在对抗性调度器可任意决定每步哪些玩家参与的新模型下,争用解决协议能达到的效率上界与下界。

cs.DS

查看原文摘要

In the classical contention-resolution problem, a set of players share a broadcast channel, and a player succeeds in a given time step if it is the only player to broadcast during that step. Implicit in the classical problem is the assumption that every player is free to act on every step: once a player arrives, it participates until it succeeds. We study what happens when that assumption is removed. In our model, an adversarial \emph{scheduler} decides, on each step, which subset of the players gets scheduled to participate in the step. An unscheduled player simply sleeps through the step. We measure a protocol by its \emph{efficiency}: the number of players divided by the expected number of steps in which at least one player was active. Our first result says that, so long as the players are given access to a global clock and to shared randomness, they can achieve efficiency $Ω(1/\log n)$. The players are able to achieve this bound without requiring any channel feedback, and even if the adversarial scheduler is adaptive. We also give a matching lower bound of $O(1 / \log n)$, which holds even with channel feedback, and even for an oblivious scheduler. Our upper bounds all require the players to have access to a shared global clock and to shared randomness. Our final result says that this type of implicit shared state is necessary. If the players have neither a global clock nor shared randomness, then no protocol can achieve efficiency better than $O(\log n / n)$; and this holds even if the other aspects of the problem are designed to be as favorable for the players as possible (the channel gives ternary feedback and the adversary is oblivious).