跳到正文
研踪PaperTrail

版本更新

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

部分采集异常

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

27,409 已收录论文22,787 AI 相关8,342 有修订112 HF 社区发现

论文修订列表

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

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

The Price of Intelligence: A Quality-Adjusted Price Index for AI Services

Louis Yiven Zhu

原文摘要

How fast AI inference prices have fallen depends on how an index holds quality constant. We build quality-adjusted price indices for text and code inference sold through APIs, joining 21,024 posted prices to a capability scale fitted to 4,605 benchmark scores. From January 2025 to July 2026, matched-model methods record an annual fall of 0.07 in log price per token. Our pre-specified hedonic index falls at 0.51 a year in logs (95% interval 0.11 to 0.89), entirely through the rising capability of the models on sale. Across three treatments of measurement error and two anchor sets it runs from 0.34 to 0.89. Excluding six anchors flagged for possible contamination leaves model rankings intact (rank correlation 0.998) yet lowers the rate by 0.40 to 0.51 under two treatments. Agreement on rankings therefore does not license claims about levels or increments. Per completed task, the data do not establish a quality-adjusted decline.

econ.GN · cs.LG

版本更新 · v3arXiv:2603.11132

WebWeaver: Breaking Topology Confidentiality in LLM Multi-Agent Systems with Stealthy Context-Based Inference

Zixun Xiong, Gaoyi Wu, Lingfeng Yao, Miao Pan, Xiaojiang Du, Hao Wang

原文摘要

Communication topology is a critical factor in the utility and safety of LLM-based multi-agent systems (LLM-MAS), making it a high-value intellectual property (IP) whose confidentiality remains insufficiently studied. Existing topology inference attempts rely on impractical assumptions, including control over the administrative agent and direct identity queries via jailbreaks, which are easily defeated by basic keyword-based defenses. As a result, prior analyses fail to capture the real-world threat of such attacks. To bridge this realism gap, we propose \textit{WebWeaver}, an attack framework that infers the complete LLM-MAS topology by compromising only a single arbitrary agent instead of the administrative agent. Unlike prior approaches, WebWeaver relies solely on agent contexts rather than agent IDs, enabling significantly stealthier inference. WebWeaver further introduces a new covert jailbreak-based mechanism and a novel fully jailbreak-free diffusion design to handle cases where jailbreaks fail. Additionally, we address a key challenge in diffusion-based inference by proposing a masking strategy that preserves known topology during diffusion, with theoretical guarantees of correctness. Extensive experiments show that WebWeaver substantially outperforms state-of-the-art (SOTA) baselines, achieving about 60\% higher inference accuracy under active defenses with negligible overhead.

cs.CR · cs.AI

版本更新 · v2arXiv:2610.40025

One Polynomial Field for Every Euler Step and the Flow: Polynomial Dynamics for P and PSPACE

Olivier Bournez

原文摘要

We construct, for each deterministic Turing machine that halts on all inputs, one polynomial vector field with rational coefficients that performs the same logical computation at unit Euler step, at every smaller or variable step in $(0,1]$ with divergent sum, and along the flow. This unifies discrete-time and continuous-time computation by polynomial dynamics, which earlier characterizations treated separately. For a machine making $T$ transitions in space $H$, a logical scale $h=2^{-s}$ with $s=O(H)$ suffices, with physical time $O(s(T+s))$, drift disturbances up to $h^{2K}$ for a fixed exponent $K$, and $2Ks+3$ fractional bits at unit step. On a fixed compact domain, polynomial time and robust eventual decision characterize P and PSPACE, respectively, with polynomial scale thresholds and no supplied stabilization horizon in the space case. Without sign, floor or conditional primitives, margin amplification at bounded speed, overlapping polynomial gates and interval-product estimates give the common realization, from which we derive shared logical traces, fixed-field PSPACE-complete prediction and a robust safety family with polynomial certificates common to all Euler steps and the flow.

cs.CC · cs.LO · math.DS

版本更新 · v3arXiv:2506.11796

Solving Stochastic Inverse Problems in Embedding Space

Elias Najarro, Nicolas Bessone, Sebastian Risi

原文摘要

Solving an inverse problem consists in finding the unknown parameters of a system from observations. This task is particularly challenging when observations have a strong stochastic component, producing diverse yet equivalent patterns. Self-organizing systems are a notable case: simple local rules can generate complex stochastic patterns. Many natural systems rely on such processes, making self-organization central to understanding natural phenomena. Inverse methods based on direct comparison of observed values struggle in this setting, as such comparisons cannot capture feature similarities between variable outcomes; as a result, the loss fails to meaningfully inform the optimizer. In this work, we show that the difficulty posed by stochasticity in observable patterns can be overcome by reformulating the inverse problem in an embedding space. By mapping stochastic patterns onto an invariant embedding space, where equivalent patterns have similar representations, we can effectively recover unknown causal parameters without the need for handcrafted objective functions or heuristics. We show that embedding models trained on large image datasets produce robust representations that capture these invariances. We evaluate the method on three self-organizing systems: a physical, a biological, and a social one; namely, a reaction-diffusion system, a model of embryonic development, and an agent-based model of social segregation. We show that the method reliably recovers parameters despite stochasticity in the pattern outcomes. We further apply the method to real biological patterns, highlighting its potential as a tool for both theorists and experimentalists to investigate the dynamics underlying complex stochastic pattern formation.

nlin.AO · cond-mat.dis-nn · cs.CV · cs.LG

版本更新 · v2arXiv:2605.08290

Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time

Kalana Kalupahana, Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi

原文摘要

We design the first regret guarantees for robust dynamic pricing that decouple the dependence on the corruption $C$ and the time horizon $T$. In dynamic pricing, a seller with unlimited supply of a good interacts with a stream of buyers over \( T \) rounds, with the goal of maximizing revenue. At each round $t$, the seller posts a price $p_t$, and the buyer purchases the good only if their unknown valuation $v^\star$ exceeds this price. The seller observes only the binary feedback $\mathbb{I} \left\{ p_t \leq v^\star \right\}$, indicating whether a sale occurred. In the \emph{robust} pricing setting, a malicious adversary is allowed to corrupt this feedback in at most $C$ rounds. Even if the learner knows the corruption $C$, the best known regret bound is $\mathcal{O}(C\log\log T)$ by Gupta et al. [2025]. This leaves as an open problem to ``decouple'' the dependence on $C$ and $T$. In this work, we resolve this open problem. In particular, we develop a robust variant of binary search that achieves regret $\mathcal{O}(C+\log T)$ when the corruption $C$ is known and $\mathcal{O}(C+\log^2 T)$ when the corruption is unknown.

cs.LG · cs.AI

版本更新 · v2arXiv:2601.04135

LLMberjack: Guided Trimming of Debate Trees for Multi-Party Conversation Creation

Leonardo Bottona, Nicolò Penzo, Bruno Lepri, Marco Guerini, Sara Tonelli

原文摘要

Online debates on platforms like Reddit or Kialo are structured as reply trees: each message can receive several replies, which in turn can each receive several replies, producing a branching structure rather than a linear conversation. Turning one path (or a mix of paths) through such a tree into a natural, turn-by-turn conversation among multiple speakers (a process we call linearization) requires deciding which messages to keep, in what order, and who each message is addressed to. To this aim, we present LLMberjack, a platform for creating multi-party conversations starting from existing debates, originally structured as reply trees. The system offers an interactive interface that visualizes discussion trees and enables users to construct coherent linearized dialogue sequences while preserving participant identity and discourse relations. It integrates optional large language model (LLM) assistance to support automatic editing of the messages and speakers' descriptions. We provide preliminary evidence about the platform's utility by showing how tree visualization facilitates the creation of coherent, meaningful conversation threads and how LLM support enhances output quality while reducing human effort. The tool is open-source and designed to promote transparent and reproducible workflows to create multi-party conversations, addressing a lack of resources of this type.

cs.CL · cs.HC

版本更新 · v2arXiv:2610.21312

Spectrum Is Not Enough: A Random-Matrix Account of Data-Free Preconditioning for Differentially Private Learning

Shilin Zhang, Kangning Wang

原文摘要

At a fixed privacy budget, curvature is exactly the object the budget makes unavailable. A recent answer estimates it from synthetic probes, at neither privacy cost nor distribution shift, and validates a probe by the eigenvalue decay it reproduces. That test reads the spectrum, not the basis, and what a probe reconstructs is unknown. This paper gives a random-matrix account of data-free preconditioning, organized by one dichotomy. Of the two Kronecker factors, the error-signal factor $ G $ and the architecture-determined bulk of the activation factor $ A $ are reconstructible without data up to an explicit error-energy bound; only the data-induced spikes of $ A $ are not. We verify that bound with zero violations along a full training trajectory, though it stays one to nearly three orders of magnitude above the gap it bounds. We locate the failure boundary at a Baik-Ben Arous-Péché threshold: a bulk-only probe suffers an exact damage $s^2/(1-s^2)$ from a spike of strength $s^2$, invisible once its amplitude exceeds the scaled-bulk threshold $( \sqrt {c}/(1+ \sqrt {c}))^{1/2}$, $c = d/n$. The test in use is basis-blind: rotating only the probe eigenbasis at a near-exact matched spectrum inflates the residual by $2.3 \times $ to $89.8 \times $, and a closed-form volume law fixes the within-spectrum ordering of the critical volume while a two-oracle construction proves that no functional of the probe spectrum fixes its magnitude. Over forty seeds on three modalities, per-layer tuning does not transfer to accuracy, no data-free arm beats the flat probe, public-data curvature does on both modalities tested, and the ordering inverts on PathMNIST under real DP noise. The account yields a probe-design protocol and falsifiable predictions for the regimes where data-free curvature can be trusted.

cs.LG

版本更新 · v2arXiv:2609.31948

Duplex-MPE: Benchmarking Multi-Party Interaction in Full-Duplex Dialogue

Chengqian Ma, Wenhao Feng, Weixuan Jin, Gaole Dai, Tianyu Xie, Yuexiao Ma, Zhaolu Kang, Xiangyu Zhao 等 10 位作者

原文摘要

Real-time full-duplex speech models can listen while speaking, enabling natural interaction without rigid turn boundaries. Existing benchmarks evaluate turn-taking, interruption handling and multi-round dialogue, but largely centre on a designated user rather than an assistant participating in a shared conversation among several people. We introduce Duplex-MPE to evaluate when such an assistant should answer, remain silent or stop speaking. The benchmark contains 2,000 scenarios with three or four human speakers and one assistant, each paired across explicit and implicit addressing of the same request. Models receive continuous conversation audio without transcripts or supplied turn boundaries. Four scores measure fresh response initiation, answer accuracy, silence preservation and stopping when a human resolves a request. We evaluate eight open-weight speech systems: MiniCPM-o 4.5, Moshi, FLM-Audio, Voila, Freeze-Omni, Realtime-Venus-Audio, Moshika-RL-Seamless and PersonaPlex. MiniCPM-o 4.5 leads on three scored capabilities, while frequent speech from other systems can coexist with inaccurate answers or failures to remain silent. A transcript-based Gemini 3.1 Pro reference responds 64.3 percentage points more often to explicit than implicit requests; paired tests detect no significant response-presence difference for the speech systems.

cs.SD · eess.AS

版本更新 · v2arXiv:2609.12899

Physical-State-Guided Diffusion Sampling for Full-Waveform Inversion

Chen Min, Haowen Jiang, Zheng Ma, Xiong-Bin Yan

原文摘要

Full waveform inversion (FWI) reconstructs subsurface velocity models from seismic mea surements but faces the challenges of ill-posedness and nonlinearity, making accurate inversion dependent on suitable initialization and effective prior constraints. Classical methods stabi lize the inversion and improve convergence by designing hand-crafted regularization terms, yet these terms provide limited descriptions of complex geological structures. Recent diffusion based methods learn more detailed structural priors from data and integrate them into inverse problem solvers. We propose Physical-State-Guided Diffusion Sampling (PSG), which decouples diffusion posterior sampling into two mutually interacting processes: regularized FWI optimiza tion and conditional diffusion sampling with linear guidance. PSG shows overall improvements in reconstruction accuracy, preservation of prior structure, and robustness over classical and diffusion-based baselines across diverse OpenFWI inversion scenarios. Through domain decom position, PSG can generalize without retraining to more complex, realistic velocity fields with structural patterns distinct from those represented by the prior learned from training datasets and larger spatial domains than the training models. Overall, PSG offers a flexible framework for integrating learned priors with physical constraints, with potential for extension to other nonlinear inverse problems.

cs.LG

版本更新 · v3arXiv:2603.12696

HaltNav: Reactive Visual Halting over Lightweight Topological Priors for Robust Vision-Language Navigation

Zihui Yu, Pingcong Li, Bichi Zhang, Sören Schwertfeger

原文摘要

Vision-and-Language Navigation (VLN) is shifting from rigid, step-by-step instruction following toward open-vocabulary, goal-oriented autonomy. Achieving this transition without exhaustive routing prompts requires agents to leverage structural priors. While prior work often assumes computationally heavy 2D/3D metric maps, we instead exploit a lightweight, text-based osmAG (OpenStreetMap Area Graph), a floorplan-level topological representation that is easy to obtain and maintain. However, global planning over a prior map alone is brittle in real-world deployments, where local connectivity can change (e.g., closed doors or crowded passages), leading to execution-time failures. To address this gap, we propose a hierarchical navigation framework HaltNav that couples the robust global planning of osmAG with the local exploration and instruction-grounding capability of VLN. Our approach features an MLLM-based brain module, which is capable of high-level task grounding and obstruction awareness. Conditioned on osmAG, the brain converts the global route into a sequence of localized execution snippets, providing the VLN executor with prior-grounded, goal-centric sub-instructions. Meanwhile, it detects local anomalies via a mechanism we term Reactive Visual Halting (RVH), which interrupts the local control loop, updates osmAG by invalidating the corresponding topology, and triggers replanning to orchestrate a viable detour. To train this halting capability efficiently, we introduce a data synthesis pipeline that leverages generative models to inject realistic obstacles into otherwise navigable scenes, substantially enriching hard negative samples. Extensive experiments demonstrate that our hierarchical framework outperforms several baseline methods without tedious language instructions, and significantly improves robustness for long-horizon vision-language navigation under environmental changes.

cs.RO · cs.CV

版本更新 · v2arXiv:2609.32400

SkillDRE: Dual-Stage Red-Team Evolution of Agent Skills via Pre-Execution and Runtime Feedback

Pengyu Zhu, Jingyi Yang, Yi Liu, Li Sun, Sen Su

原文摘要

Agent skills package instructions, executable code, and task-specific resources into reusable artifacts that agents can improve using execution feedback. The same mechanism also enables attackers to evolve malicious skills, making them more effective and less detectable. However, a candidate skill may pass pre-execution scanning yet fail to realize its target under runtime defenses, while a revision that repairs execution may introduce new scanner findings. We introduce SkillDRE, a fully automated framework for evolving complete malicious skill packages through a dual-stage feedback loop. Given a benign task and its associated skills, SkillDRE autonomously constructs and validates a task-conditioned malicious objective and a verifiable judge rule. It then holds both fixed while evolving the skill implementation, with preservation of legitimate task capability. SkillDRE combines scanner-guided evolution with runtime-guided refinement informed by execution outcomes observed under runtime defense. Each runtime-guided revision returns to the pre-execution stage for rescanning and further optimization before re-execution, forming a cross-stage closed loop. Evaluated on SkillsBench across four victim models, SkillDRE achieves an average attack success rate of 45.28%, exceeding the strongest baseline by 40.3%, while its final submitted skills receive no SkillScan findings and largely preserve benign-task performance. These results show that two-stage defense feedback can serve as a useful learning signal for adaptive red teaming and that evaluating either defense stage in isolation can miss the resulting attack capability. Codes is available at https://github.com/whfeLingYu/SkillDRE

cs.CR · cs.AI

版本更新 · v2arXiv:2610.42063

Counting Square Tilings with a Fixed Set of Polyominoes Is #EXP-Complete

Qiuyu Chen, Baao Xie

原文摘要

An important question in counting complexity is whether exact counting can remain hard under restrictions that make feasibility easy. Tilings of squares by a fixed family of polyominoes provide a stringent test of this question, since tileability is polynomial-time decidable and the only varying input is a binary-encoded side length. We prove that there exists a fixed finite family of connected polyominoes for which counting translation-only square tilings is #EXP-complete under polynomial-time metric reductions, while the counting function belongs to #E. The resulting separation reveals that solution multiplicities can retain computational information that feasibility alone cannot capture. The proof develops a two-stage numerical isolation technique that combines a boundary-amplified Wang system with a rigid geometric compiler to recover accepting-computation counts while controlling all noncanonical tilings.

cs.CC

版本更新 · v2arXiv:2610.35013HF 社区推荐

Multiscale Policy Optimization for Long-Horizon LLM Agents

Tao Ren, Hui Yang, Jia Deng, Tingyang Chen, Qiyao Wang, Shuo Tang, Ziyang Zeng, Yuhua Jiang 等 19 位作者

原文摘要

Long-horizon LLM agents interact with their environments through complete assistant turns while generating each action token by token. We observe that critic values vary primarily across turns, motivating optimization anchored at turns with finer credit allocation among tokens. We propose Multiscale Policy Optimization (MPO), combining Multiscale Advantage Estimation (MAE) and turn-level importance sampling to align credit assignment and policy updates at the turn scale. Extensive experiments across search, tool-use, and automation tasks with 4B and 30B-A3B models demonstrate consistent gains over strong RL baselines.

cs.AI

版本更新 · v2arXiv:2610.30675

OneLatent: Latent Reasoning for Efficient Foundation Recommendation Models

Hao Jiang, Peiru Du, Pengfei Yao, Mengting Li, Siyuan Lou, Kuo Cai, Sheng Yu, Qiang Luo 等 13 位作者

原文摘要

Large language models (LLMs) have demonstrated strong reasoning capabilities, motivating their use as the backbone of foundation recommendation models (FRMs). Existing methods enhance recommendations through explicit Chain-of-Thought (CoT) reasoning under a Think-then-Answer paradigm. However, explicit CoT incurs substantial inference overhead by generating lengthy reasoning traces and relies on manually designed templates that struggle to capture diverse, dynamic user interests. We propose OneLatent, an efficient latent reasoning framework that compresses explicit reasoning traces into several learnable latent tokens, enabling Latent-Reason-then-Answer inference without generating verbose traces. OneLatent first introduces Multi-View Adaptive CoT (MV-ACoT), which creates diverse, high-quality teacher-generated supervision by exploring user interests from multiple perspectives and automatically adapting reasoning complexity to each instance. Building on pretrained FRMs, it then uses a three-stage latent-token alignment paradigm to progressively internalize CoT traces into learnable latent tokens. Finally, a multistage curriculum-based post-training strategy activates latent-token reasoning for downstream recommendation tasks. Experiments on an industrial-scale Kuaishou dataset and the public Kuaishou LLM-Rec benchmark show that OneLatent consistently outperforms explicit CoT-based methods and traditional baselines. Compared with the Think and No-Think variants of FRMs, OneLatent improves SID@64 by 17.44% and 9.33%, respectively, while achieving over 17x higher online inference throughput. We further develop a production serving system for scalable, real-time FRM inference. An online A/B test in Kuaishou's local-services advertising scenario shows that deploying OneLatent with this system yields an estimated 9.6% revenue lift over strong online baselines, including OneRec and OneReason.

cs.IR

版本更新 · v2arXiv:2607.11210

Decoupling Corruption and Horizon in Robust Contextual Pricing

Matteo Castiglioni, Francesco Emanuele Stradi

原文摘要

We study robust repeated contextual pricing, where valuations depend linearly on the features. At each round $t\in[T]$, a seller observes a context, posts a price, and receives only a possibly corrupted binary sale feedback. When the seller knows an upper bound $C$ on the number of corrupted rounds, we design an algorithm with regret $\mathcal O(Cd+d^2\log T)$, where $d$ is the context dimension. This is the first guarantee for robust contextual pricing that separates the dependence on the corruption budget $C$ from the horizon $T$, closing the problem left open by Gupta, Guruganesh, Paes Leme, and Schneider (2025). In this work, we go even further by developing a randomized algorithm that attains regret of order $\mathcal{O}(Cd+d^2\log T+d\log^2T)$ with high probability, without knowing the number of corrupted rounds $C$. Finally, we show that randomized algorithms that do not know $C$ cannot guarantee regret of order $\mathcal{O}(C)+o(\log^2 T)$ with high probability, even in the one dimensional non-contextual case.

cs.GT

版本更新 · v2arXiv:2607.15593

Scaling LLM Agent Tool Access: The MCP Gateway

Mingxin Li, Enge Song, Yueshang Zuo, Xiaodong Liu, Rong Wen, Qiang Fu, Gianni Antichi, Jian He 等 30 位作者

原文摘要

LLM agents increasingly rely on tool calling to complete tasks. Model Context Protocol (MCP) standardizes tool calling between LLM agents and tool providers. It reduces integration cost and drives rapid growth in tool scale. In production deployments, tool access becomes difficult to scale. On the tool provider side, legacy services are not directly callable through MCP; the rapid protocol development creates ongoing compatibility cost. On the agent side, the number of mounted tools is limited by the LLM context window and inference overhead; mounting a large tool set increases token usage and inference latency and can reduce task success rate. Moreover, for stateful MCP backends with multiple replicas, preserving session affinity increases client-side complexity. We present a cloud-scale MCP Gateway system. It breaks the direct-connect model on the data plane and offloads legacy service integration, consolidating incompatible MCP variants, access control, tool recommendation, and session-aware routing at the gateway. The conversion module supports 315 OpenAPI services in the cloud and integrates MCP transport variants. Session-aware routing decouples the scalability of the gateway layer and the MCP service layer. The hybrid retrieval engine sustains $\sim$98\% Top-15 recall; it scales agent tool access to 3{,}000+ tools with improved tool selection accuracy. We also share the lessons learned from deploying the gateway system in production.

cs.DC · cs.AI · cs.NI

版本更新 · v2arXiv:2610.31397

Parameter-Efficient Adaptation of Large Language Models to a Low-Resource Agglutinative Language: A Corpus, Datasets, and a Reproducible Benchmark for the Bashkir Language

Mullosharaf K. Arabov, Svetlana S. Khaybullina

原文摘要

Bashkir is a low-resource agglutinative language written in Cyrillic and remains poorly represented in modern LLMs. We present an open resource suite and a systematic benchmark of adaptation methods: the Bashkir Web Corpus (71,567 documents, 46.9M tokens, 16 sources) and three labelled datasets for binary, multiclass and multilabel text classification; the benchmark covers the first two. Experiments use eight architectures (82M-8B: DistilGPT2, GPT-2 base/medium, Phi-3-mini, Mistral-7B, YandexGPT-5-Lite-8B, mBERT, XLM-R) and three adaptation groups (full fine-tuning, QLoRA, in-context learning), plus continual pretraining (CPT). (1) QLoRA on 3.8-8B models outperforms encoder-only fine-tuning on binary classification: YandexGPT-5-Lite-8B with CPT reaches macro-F1 0.748 vs 0.653 (XLM-R) and 0.650 (mBERT); pairwise differences are significant after Holm correction (p<0.001). (2) YandexGPT-5-Lite-8B significantly outperforms Mistral-7B and Phi-3-mini on multiclass classification, BPB and native-speaker ratings (mean 3.28 vs 2.52 and 2.22; n=100; alpha=0.69-0.77; p<0.05); on binary classification its QLoRA advantage is not significant (p>=0.084). (3) CPT effects depend on model and task: perplexity improves for Phi-3-mini (+0.58) and YandexGPT-5-Lite-8B (+0.33) but worsens for Mistral-7B (-1.15, p<0.001); on binary classification CPT helps Mistral-7B most (+4.0 macro-F1). (4) Tokeniser fertility on Bashkir varies 2.67x (2.92-7.80) and tracks adaptation quality, while perplexity across tokenisers is not comparable. Cyrillic tokenisers with Russian pretraining are preferable; LLM judges reproduce native ratings for grammar and coherence (rho=0.33-0.46) but not language correctness (rho=0.16, p=0.11); native evaluation remains necessary. All artefacts are open-licensed.

cs.CL

版本更新 · v2arXiv:2608.01321

BiCAA: Bidirectional Credit Assignment for Search-Augmented Agent

Yibin Huang, Bin Xu, Hailong Cao, Conghui Zhu

原文摘要

By iteratively retrieving and integrating external evidence, multi-step search enables search-augmented agents to tackle complex question answering. However, vanilla GRPO assigns rewards based solely on final answers, providing limited guidance for intermediate search steps. To provide fine-grained process feedback, we evaluate the value of each search step: it should acquire evidence that advances problem solving while avoiding redundant retrieval. Building on these complementary criteria, we introduce BiCAA, which combines Forward Solvability Gain (FSG) and Subsequent Reasoning Gain (SRG) for bidirectional credit assignment. To reward progress in evidence acquisition, FSG quantifies changes in ground-truth answer likelihood after each interaction. SRG compares the subsequent action's likelihood with and without the current interaction to approximately measure its support for subsequent reasoning, using this support as a proxy signal for non-redundant search to encourage effective and efficient search. BiCAA calibrates local feedback through asymmetric fusion; for policy optimization, it integrates accumulated process rewards with terminal outcome supervision. Across seven open-domain QA benchmarks and two Qwen backbones, experiments show improvements in average F1, particularly on multi-hop tasks.

cs.CL

版本更新 · v2arXiv:2607.28347

LLMs struggle to simulate human belief updates in controlled environments

Sebastian Pohl, Harsh Mehta, Pranav Mambayil, Abdul Ghafoor, Franziska Lesigang, Yufang Hou, Christian Hilbe

原文摘要

LLMs are increasingly deployed as proxies for human study participants in social science experiments, yet the fidelity of this practice has rarely been tested directly. We test whether six LLMs can simulate individual human belief updates, comparing LLM outputs 1-to-1 against ground truth data from 391 UK participants on Prolific, who updated their stances on three discussion topics after reading Reddit comments. Each participant was simulated by an LLM conditioned on a persona derived from their demographic and personality trait data. Given participants' actual initial stances, five of the six models showed no systematic directional bias in their simulated post-stances, although the size of their individual-level errors varied considerably between models. All six models fail to simulate initial stances themselves and to produce faithful belief updates from self-generated stances. Three systematic biases emerge across all models: overrepresentation of neutral positions, more frequent but smaller belief shifts than humans, and a failure to rank comments by convincingness. Demographic and personality trait personas had no consistent effect on fidelity. We conclude that without grounding in realistic initial stances, LLM simulations of human belief dynamics cannot be considered reliable, a condition that current multi-round social media simulations rarely meet.

cs.CL · cs.SI

版本更新 · v2arXiv:2603.05633

A Survey on Stacked Intelligent Metasurfaces: Fundamentals, Recent Advances, and Challenges

Chandan Kumar Sheemar, Sourabh Solanki, Wali Ullah Khan, George C. Alexandropoulos, Symeon Chatzinotas

原文摘要

Stacked intelligent metasurfaces (SIMs) cascade several closely spaced programmable metasurface layers so that an electromagnetic wave undergoes repeated modulation-propagation interactions before leaving the stack. The stack thereby implements, at the speed of propagation and with few radio-frequency chains, high-dimensional analog transformations that would otherwise require digital precoding, combining, spatial filtering, focusing, or inference. Since 2023, SIM research has produced more than two hundred articles, a dedicated magazine special issue, and two survey-level overviews organized around applications and wave-domain computing. This article complements them with a model-to-hardware perspective. First, we present the electromagnetic modeling hierarchy of SIMs, making explicit the assumptions under which the models coincide, their validity regimes, and their computational complexity, with a common notation for hardware non-idealities and power consumption. Second, we present a methodology-first taxonomy (SIM-aware channel acquisition, model-based optimization, statistical-CSI design, learning-based control, and hardware-aware robust design), compare the families in terms of CSI requirements, complexity, convergence, and hardware constraints, and reconcile conflicting findings in the literature. Third, we synthesize applications by the physical role of the SIM. Fourth, we quantitatively compare experimentally demonstrated multilayer prototypes, separate validated from conceptual architectures, and discuss thermal, tolerance, and calibration issues. Fifth, we provide a tutorial-style performance and trade-off analysis anchored in reported results. Finally, we map evidence-based challenges to research directions with measurable targets. Lessons learned are summarized at the end of every section.

eess.SP · cs.IT

版本更新 · v2arXiv:2610.37918

Venus-DefakerOne2: A Vision-Forensics Foundation Model with Broader Coverage

Chenfan Qu, Yachao Liang, Mingqi Fang, Jiangwei Xie, Zhenming Wang, Baoyue Zhang, Changjiang Jiang, Zheng Chang 等 31 位作者

原文摘要

Real-world forgery is inherently heterogeneous: it manifests not only as digital manipulation but also as physical spoofing, and is carried not only by images but also by videos. Despite substantial progress, a unified anti-forgery foundation model covering such a broad threat spectrum remains absent. In this paper, we present Venus-DefakerOne2, which substantially extends the forensic capability boundary along both the forgery-form and media-type dimensions. Trained on tens of millions of open-source and in-house samples, it incorporates two key designs. Tide-Style-Tuning alternates LoRA and full-parameter fine-tuning to balance computational efficiency, generalization, and hard-sample fitting while mitigating catastrophic forgetting. Entropy-based Test Adaptation determines the optimal prediction modality by analyzing prediction entropy. Venus-DefakerOne2 achieves new state-of-the-art performance across a comprehensive suite of benchmarks, including DeepFake faces (96.7%), AI-generated images (93.3%), tampered documents (87.6%), manipulated natural images (89.6%), physical spoofs (93.1%), and AI-generated videos (96.0%). It significantly outperforms both specialized expert models and its predecessor, DefakerOne, establishing itself as a powerful and versatile foundation model for binary-decision forensic tasks.

cs.CV

版本更新 · v3arXiv:2608.25304

SAUSS: Stochastic Approximation with Unbiased Simulated Scores for Limited Dependent Variable Models

Sokbae Lee, Yuan Liao, Myung Hwan Seo, Youngki Shin

原文摘要

Simulated maximum likelihood is widely used in latent-variable models where likelihood evaluation requires intractable integrals or probabilities. With a fixed number of simulation draws, its estimating equation is generally biased. We develop Stochastic Approximation with Unbiased Simulated Scores (SAUSS), combining score simulation with stochastic gradient descent. The Hajivassiliou--McFadden identity, an instance of Fisher's identity, expresses the likelihood score as the conditional expectation of the complete-data score given the observed data. Exact conditional draws yield an unbiased simulated score for any fixed number of draws. The estimator averages stochastic gradient iterates computed using mini-batches of fixed size regardless of sample size, avoiding repeated full-sample likelihood evaluations. Under local regularity and initialization conditions, we establish asymptotic normality and a functional central limit theorem for the partial-sum process of the iterates under multi-pass sampling from an observed sample. These results support plug-in and random-scaling confidence intervals that remain asymptotically valid when algorithmic uncertainty is non-negligible relative to sampling uncertainty. We develop multinomial probit as a leading application. In simulations and two applications, SAUSS returns estimates in every reported run, including cases where the simulated maximum likelihood implementation returns none. When both return estimates, SAUSS gives comparable estimates in less time.

stat.ME · cs.LG · econ.EM

版本更新 · v4arXiv:2606.01963

Entropy Bounds for Local Coordination and Graph Amenability

Ron Peretz, Dean Kraizberg

原文摘要

We study local coordination on finite graphs, equivalently, the ability of randomized local protocols with independent private randomness to produce highly correlated outputs at neighboring vertices. Hutchcroft, Rospuskova, and Tamuz (2026) showed that if such local coordination can be achieved with low cost, then the graph admits a low-cost leader profile, or equivalently an appropriate bounded-radius decomposition, with a square-root loss in the cost. We substantially improve this bound for unbiased binary outputs. If the average disagreement is $\varepsilon$, we construct a leader profile of cost $O(\varepsilon\log(1/\varepsilon))$. The key ingredient is an information-theoretic influence measure: after fixing an ordering of the independent information sources, we assign to each binary output the increments of mutual information revealed along that ordering. For two outputs that disagree with probability $p$, the corresponding measures are within binary entropy $h(p)$ in total variation. Combined with a grand coupling theorem, this yields the improved bound. We also show that a universal linear bound is impossible. We construct graphs with binary local profiles of cost $O(\varepsilon)$ for which every leader profile has cost $$ Ω\!\left(\varepsilon\sqrt{\log(1/\varepsilon)}\right). $$ The construction uses weighted majority functions and can be implemented as an action-symmetric Nash equilibrium, giving a negative answer to the question of HRT whether leader equilibria are always optimal up to a constant factor. Finally, we show that the binary assumption is essential: for general real-valued outputs, the square-root dependence of the HRT theorem is sharp up to a universal constant.

cs.GT · cs.IT · math.PR

版本更新 · v3arXiv:2603.09930

Fine-grained Motion Retrieval via Joint-Angle Motion Images and Token-Patch Late Interaction

Yao Zhang, Zhuchenyang Liu, Yalan He, Thomas Ploetz, Yu Xiao

原文摘要

Text-motion retrieval aims to learn a semantically aligned latent space between natural language descriptions and 3D human motion skeleton sequences, enabling bidirectional search across the two modalities. Most existing methods use a dual-encoder framework that compresses motion and text into global embeddings, discarding fine-grained local correspondences, and thus reducing accuracy. Additionally, these global-embedding methods offer limited interpretability of the retrieval results. To overcome these limitations, we propose an interpretable, joint-angle-based motion representation that maps joint-level local features into a structured pseudo-image, compatible with pre-trained Vision Transformers. For text-to-motion retrieval, we employ MaxSim, a token-wise late interaction mechanism, and enhance it with Masked Language Modeling regularization to foster robust, interpretable text-motion alignment. Extensive experiments on HumanML3D and KIT-ML show that our method outperforms state-of-the-art text-motion retrieval approaches while offering interpretable fine-grained correspondences between text and motion. The code is available in the supplementary material.

cs.CV · cs.IR

版本更新 · v3arXiv:2610.39937

BiHashFormer: Hash-Driven Dual-Branch Transformer for Efficient Object Detection in HRW Shots

Jingchen Huang, Wenxi Li, Chenyang Lyu, Moran Liu, Haozhe Lin, Yuchen Guo

原文摘要

Recent advances in gigapixel-level imaging have brought High-Resolution Wide shots to the forefront of research. However, these images present significant challenges: extreme sparsity of foreground, gigapixel-level resolutions and interleaving of foreground and background. This causes traditional detectors and attention mechanisms to be hindered by background, resulting in inefficiency and inaccuracy. To tackle this problem, we propose BiHashFormer, a dual sparsified branch transformer built on hashing. RoI Selector will predict the foreground proportion for top-k selecting target-containing windows. The compression branch processes windows selected and refines attention into HashAttention by discarding half of the key-value pairs, reducing cost and improving efficiency. The compensation branch uses HashMiner to perform low-cost hash searches in the remaining regions, recovering features of missed objects. Experiments confirm that the selection relationship in HashAttention is one-way and reveal the preference of different queries for keys. In experiments on the gigapixel benchmark PANDA, BiHashFormer reduces 37.5% backbone FLOPs while improving AP50 to 81.0%. Moreover, this parallel dual-branch structure allows the model to avoid inference delays caused by inter-branch dependencies, while achieving much greater stability than single-branch models, specially with low rates of RoI selection.

cs.CV

版本更新 · v2arXiv:2512.14233

PentestEval: Benchmarking LLM-based Penetration Testing with Modular and Stage-Level Design

Ruozhao Yang, Mingfei Cheng, Gelei Deng, Tianwei Zhang, Junjie Wang, Xiaofei Xie

原文摘要

Penetration testing is essential for assessing and strengthening system security against real-world threats, yet traditional workflows remain highly manual, expertise-intensive, and difficult to scale. Although recent advances in Large Language Models (LLMs) offer promising opportunities for automation, existing applications rely on simplistic prompting without task decomposition or domain adaptation, resulting in unreliable black-box behavior and limited insight into model capabilities across penetration testing stages. To address this gap, we introduce PentestEval, the first comprehensive benchmark for evaluating LLMs across six decomposed penetration testing stages: Information Collection, Weakness Gathering and Filtering, Attack Decision-Making, Exploit Generation and Revision. PentestEval integrates expert-annotated ground truth with a fully automated evaluation pipeline across 346 tasks covering all stages in 12 realistic vulnerable scenarios. Our stage-level evaluation of 9 widely used LLMs reveals generally weak performance and distinct limitations across the stages of penetration-testing workflow. End-to-end pipelines reach only 31% success rate, and existing LLM-powered systems such as PentestGPT, PentestAgent, and VulnBot exhibit similar limitations, with the evaluated autonomous agents showing particularly low success rates under our benchmark settings. These findings highlight that reliable autonomous penetration testing requires stronger structured reasoning and fine-grained stage-level diagnosis. PentestEval provides the foundational benchmark needed for future research on fine-grained, stage-level evaluation, paving the way toward more reliable LLM-based automation.

cs.SE · cs.AI · cs.CR

版本更新 · v2arXiv:2610.15122

Targeting the Right Situations: Mutation Testing of Fuzzy-Powered Situation Hyperspace

Nawshin Mannan Proma

原文摘要

Ensuring the safety of autonomous Unmanned Aerial Vehicles (UAVs) operating in underground mines is challenging due to the vast and uncertain Operational Design Domain (ODD). Traditional validation approaches, such as random testing, often result in inefficient situation coverage, allocating computational resources to low-risk scenarios while failing to expose critical edge cases. Building on prior work in risk-prioritized Situation Coverage, this paper investigates whether Fuzzy Logic-based risk estimation effectively correlates with real system failures. To this end, we conduct a mutation testing study within our SCALOFT simulation framework. A fixed set of software mutants is systematically injected and evaluated under two testing strategies: (i) uniformly random situation generation and (ii) Fuzzy-Guided risk-prioritized situation generation. Experimental results show that the Fuzzy-Guided approach achieves a higher mutation score and is more effective at exposing difficult-to-detect faults compared to random testing.

cs.RO

版本更新 · v2arXiv:2609.23555

Resolution-Flexible Decoding for Hybrid Neural Video Representations

Taiga Hayami, Masaya Takabe, Hiroshi Watanabe

原文摘要

Neural video representations (NVRs) represent videos using neural network parameters and, in hybrid formulations, frame-wise latent embeddings. In conventional hybrid NVRs, the spatial size of frame-wise latent embeddings and the decoder upsampling schedule depend on the target resolution, potentially requiring large and non-uniform upsampling factors. In this paper, we propose a resolution-flexible decoder framework for hybrid NVRs. The decoder is constructed from uniform \(2\times\) upsampling stages, whose target feature sizes are obtained by tracing the spatial resolution backward from the final output resolution. After each upsampling stage, the feature map is aligned with the target size by minimal padding or cropping when necessary. To support this progressive decoding process, we further use intermediate reconstruction supervision and a reconstruction-difficulty-aware frame sampling strategy based on recent frame-wise losses. The framework preserves the basic representation format of hybrid NVRs and can therefore be applied to different backbones. Experiments on the UVG dataset at resolutions of \(1080\times1920\) and \(810\times1440\) show that the proposed approach improves reconstruction quality over the corresponding NVR baselines.

eess.IV · cs.CV

版本更新 · v2arXiv:2503.06993

CAPT: Class-Aware Prompt Tuning for Federated Long-Tailed Learning with Vision-Language Model

Shihao Hou, Chikai Shang, Jiacheng Yang, Xinyi Shang, Shreyank N. Gowda, Yan Yan, Yang Lu

原文摘要

Effectively addressing the joint effects of non-IID data and long-tailed distribution remains a key challenge in federated learning. While fine-tuning vision-language models (VLMs) like CLIP has shown promise in tackling non-IID scenarios, it often degrades tail-class performance when both heterogeneity and long-tailed distributions are present, even leading to overall performance falling below the zero-shot baseline. To overcome this, we propose Class-Aware Prompt Tuning (CAPT), a novel framework leveraging pre-trained VLMs to effectively learn from non-IID and long-tailed data. Specifically, CAPT introduces a dual-prompt mechanism that synergizes class-aware and general prompts, enabling the model to preserve class-specific information while capturing global trends. Furthermore, to guide the prompts in learning targeted knowledge, we propose a heterogeneity-aware clustering strategy with two key components: similarity-based clusters aggregate class-aware prompts to reinforce tail-specific knowledge, while heterogeneity-based clusters aggregate general prompts to balance diverse representations and promote robust generalization. Extensive experiments demonstrate that CAPT significantly outperforms state-of-the-art methods, e.g., by improving overall accuracy by 6.1% on ImageNet-LT and 8.8% on Places-LT over baselines, while also substantially enhancing tail-class performance across other benchmarks.

cs.LG · cs.CV

版本更新 · v2arXiv:2604.17652

Self-Supervised Super-Resolution for Sentinel-5P Hyperspectral Images

Hyam Omar Ali, Antoine Crosnier, Romain Abraham, Baptiste Combelles, Fabrice Jégou, Bruno Galerne

原文摘要

Sentinel-5P (S5P) plays a critical role in atmospheric monitoring; however, its spatial resolution limits fine-scale analysis. Existing super-resolution (SR) approaches rely on supervised learning with synthetic low-resolution (LR) data, since true high-resolution (HR) data do not exist, limiting their applicability to real observations. We propose a self-supervised hyperspectral SR framework for S5P that enables training without HR ground truth. The method combines Stein's Unbiased Risk Estimator (SURE) with an equivariant imaging constraint, incorporating the S5P degradation operator and noise statistics derived from signal-to-noise ratio (SNR) metadata. We also introduce depthwise separable convolution U-Net architectures designed for efficiency and spectral fidelity. The framework is evaluated in two settings: (i) LR-HR, where synthetic LR data are used for direct comparison with supervised learning, and (ii) GT-SHR, where super-resolved images surpass the native spatial resolution without HR reference. Results across multiple bands show that self-supervised models achieve performance comparable to supervised methods while maintaining strong consistency. Qualitative analysis shows improved spatial detail over bicubic interpolation, and validation with EMIT data confirms that reconstructed structures are physically meaningful. Code is available at https://github.com/hyamomar/Sentinel-5P-Super-Resolution/tree/main/self_supervised

cs.CV