跳到正文
研踪PaperTrail

版本更新

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

部分采集异常

全站更新概况

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

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

统计口径与数据新鲜度

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

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

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

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

论文修订列表

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

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

LAFP: Preserving Latent Action Structure in Latent Policy Learning via Flow Matching

Jiexi Lyu, Xizhou Bu, Qingqiu Huang, Chufeng Tang, Xiaoshuai Hao, Hongbo Wang, Wei Li

原文摘要

Learning high quality latent actions from large-scale unlabeled videos, coupled with limited real-world interaction data for training an action decoder, has emerged as a promising paradigm for scalable latent policy learning. However, existing approaches typically rely on behavior cloning, which tends to collapse inherently multimodal action distributions into unimodal ones, thereby degrading the pretrained latent action structure. While flow matching provides a potential alternative, directly applying it leads to a misalignment between latent actions and physical actions during action decoder training, due to the stochastic nature of the learned policy. To address these, we propose Latent Action Flow Policy (LAFP), which leverages flow matching for latent policy learning and introduces an inference-time interpolation mechanism to mitigate stochasticity-induced misalignment. Experimental results demonstrate that LAFP consistently outperforms prior methods on most downstream imitation learning tasks, achieving an 8.2\% improvement in average success rate while incurring less than 1x additional inference overhead.

cs.CV

版本更新 · v2arXiv:2605.26176

PitchBench: Measuring Pitch Hearing in Audio-Language Models

Milan Liessens Dujardin, Song-Ze Yu, Craver Corbyn Thomas-Smith, David M. Chan, Karina Nguyen

原文摘要

Audio-language models (ALMs) are increasingly used in real-world applications that require music understanding, including tutoring, captioning, recommendation, and production. Yet existing benchmarks rarely evaluate a fundamental component of this understanding: pitch hearing. Pitch underpins the identification of notes, chords, and melodies and the grounding of captions in musical events, but it remains unclear how reliably ALMs perceive fine-grained pitch across sound sources, acoustic conditions, and response formats. We introduce PitchBench, an evaluation suite comprising 28 tasks that assess absolute and relative pitch perception under variations in loudness, note duration, sound source, time stretching, background noise, and other acoustic conditions. Tasks range from identifying isolated pitches to tracking voices in four-part musical textures. Evaluating frontier ALMs, we find that pitch hearing remains highly unreliable. Models perform poorly across settings, with accuracy varying sharply depending on the notation or prompt format, indicating instruction drift. Specialized DSP and neural pitch baselines achieve mean scores of approximately 73.2% and 75.2%, respectively, compared with approximately 53.9% for the strongest ALM. We release PitchBench as an evaluation benchmark, a training dataset, and a Python package with data generation tools to support future research on pitch-aware audio-language modeling.

cs.SD · cs.AI

版本更新 · v3arXiv:2606.04627

MIRAGE: Mobile Agents with Implicit Reasoning and Generative World Models

Zhichao Yang, Yuanze Hu, Haojie Hao, Longkun Hao, Dongshuo Huang, Hongyu Lin, Gen Li, Lanqing Hong 等 10 位作者

原文摘要

Mobile agents are increasingly expected to operate everyday applications from screenshots and language goals, where reliable control requires reasoning over screen affordances, multi-step navigation, and future state changes. However, many agents externalize this computation as long textual chains of thought, which slows interaction, increases supervision cost, and complicates deployment. We introduce MIRAGE, a framework that learns continuous latent reasoning representations from visible textual reasoning traces. MIRAGE transfers explicit reasoning into compact hidden states, enabling the agent to reason internally without decoding long rationales. It also incorporates a generative world-model objective: latent reasoning vectors are aligned with future screenshots, encouraging the agent to anticipate upcoming interface states before acting. This turns hidden computation into both a compressed thought representation and a forward-looking model of environment dynamics. At inference time, MIRAGE reasons in continuous latent space, reducing token generation while improving execution efficiency. On AndroidWorld, MIRAGE matches explicit chain-of-thought supervised fine-tuning in the 4B ablation with a 3-5x lower decoded-token budget and improves a comparable instruction-tuned baseline by 10.2 points; on AndroidControl, it improves action grounding while generating over 75% fewer tokens.

cs.AI

版本更新 · v4arXiv:2606.14299

What Drives Test-Time Adaptation for CLIP? A Controlled Empirical Study from an Update Perspective

Jiazhen Huang, Xiao Chen, Zhiming Liu, Yaru Sun, Jingyan Jiang, Zhi Wang

原文摘要

Vision-Language Models (VLMs) such as CLIP have become a standard backbone for open-vocabulary recognition, yet their zero-shot predictions remain vulnerable to distribution shifts encountered at deployment. Test-Time Adaptation (TTA) has recently been extended to CLIP as a lightweight solution, leading to a rapidly growing body of TTA4CLIP methods. However, empirical progress in this area has largely outpaced our understanding of what truly drives adaptation, where their gains originate, and under which shifts they remain reliable. In this paper, we take a step back from the pursuit of state-of-the-art accuracy and conduct a systematic controlled study of TTA4CLIP. We first organize existing methods into three unified paradigms according to what is updated at test time. We then introduce TTABC, an open-source TTA Benchmark for CLIP, which standardizes evaluation protocols and integrates more than 20 representative methods. Our controlled empirical analysis focuses on three key areas. First, we determine the driving factors in parameter-based methods, revealing that adaptation gains are primarily driven by test-time evidence and reliable proxies rather than heavy optimization. Second, we explore evidence utilization beyond heavy parameter tuning, showing that competitive and efficient performance can be achieved through cross- or current-sample evidence and lightweight prototype updates. Finally, we demonstrate that there is no silver bullet for TTA: no single adaptation paradigm is universally optimal, and the preferred paradigm depends on the nature of shift. We hope our benchmark and study provide a clearer understanding of the current TTA4CLIP landscape and establish a foundation for further research. The project page is available at https://walawalagoose.github.io/TTABC/

cs.CV · cs.LG

版本更新 · v3arXiv:2608.28212

MuSP-Bench: Advanced Multimodal Benchmarking of Music Understanding across Score and Performance

Milan Liessens Dujardin, Song-Ze Yu, Kevin Miao

原文摘要

Musicians commonly communicate musical intent through scores and performances. To investigate whether models can reason across both modalities, we introduce MuSP-Bench, a human-authored benchmark of 490 questions assessing understanding across Musical Scores and Performances, both individually and in combination. The benchmark spans interpretive and long-horizon reasoning across classical piano and orchestral works, represented through ABC notation, score images, MIDI, and audio. Our evaluation of frontier multimodal large language models reveals substantial difficulties in understanding musical scores and even greater challenges in reasoning about audio.

cs.MM · cs.SD

版本更新 · v2arXiv:2512.13935

Informing Acquisition Functions via Foundation Models for Molecular Discovery

Qi Chen, Fabio Ramos, Alán Aspuru-Guzik, Florian Shkurti

原文摘要

Bayesian Optimization (BO) is a key methodology for accelerating molecular discovery by estimating the mapping from molecules to their properties while seeking the optimal candidate. Typically, BO iteratively updates a probabilistic surrogate model of this mapping and optimizes acquisition functions derived from the model to guide molecule selection. However, its performance is limited in low-data regimes with insufficient prior knowledge and vast candidate spaces. Large language models (LLMs) and chemistry foundation models offer rich priors to enhance BO, but high-dimensional features, costly in-context learning, and the computational burden of deep Bayesian surrogates hinder their full utilization. To address these challenges, we propose a likelihood-free BO method that bypasses explicit surrogate modeling and directly leverages priors from general LLMs and chemistry-specific foundation models to inform acquisition functions. Our method also learns a tree-structured partition of the molecular search space with local acquisition functions, enabling efficient candidate selection via Monte Carlo Tree Search. By further incorporating coarse-grained LLM-based clustering, it substantially improves scalability to large candidate sets by restricting acquisition function evaluations to clusters with statistically higher property values. We show through extensive experiments and ablations that the proposed method substantially improves scalability, robustness, and sample efficiency in LLM-guided BO for molecular discovery.

cs.LG · cs.AI · q-bio.QM

版本更新 · v3arXiv:2610.08299

Pauli Decomposition by Character Theory: A Memory-Bounded Algorithm for Qubits and Qudits

Mohammadreza Khellat, Mohammad Masoumi, Saman Nasoori, Soroush Nasoori

原文摘要

Pauli decomposition of an $n$-qubit operator is expensive if each of the $4^n$ Pauli strings is treated as an unstructured object. Labeling those strings by the configuration space $(\mathbb{Z}_2)^n$ makes them displacement operators $X^{\otimes x}Z^{\otimes z}$ on the computational space: shifts by~$x$ and multiplications by characters $Z^{\otimes z}$ in the computational basis. That labeling organizes the operator into $2^n$ fibers of length $2^n$, one per shift~$x$, each collecting the computational-basis amplitudes that hop by~$x$. Expanding each fiber function in the character basis of $(\mathbb{Z}_2)^n$ --- a length-$2^n$ Walsh--Hadamard transform --- recovers the Pauli coefficients at total cost $O(n\cdot4^n)$. The same fiber / shift--character picture extends to $(\mathbb{Z}_p)^n$ (Heisenberg--Weyl qudits). \texttt{paulikit} is a memory-bounded realization for qubits: for matrix-sparse inputs, peak memory need not densify to a full $2^n\times2^n$ operator. Performance is checked on a stated low-end GNU/Linux platform for a coupled-oscillator sweep beyond a billion Pauli terms.

quant-ph · cs.MS

版本更新 · v3arXiv:2606.21755

RoverDevKit: An open, physics-grounded tradespace toolkit for conceptual design of lunar micro-rovers

Jon Reifschneider

原文摘要

The number of planned lunar micro-rovers is increasing, yet few open, benchmarked tools exist to explore trade-offs in their design. Rover sizing is a highly coupled problem with a feedback loop between vehicle mass and mobility: a heavier rover sinks deeper into loose regolith, deeper sinkage increases power demand, more power requires a larger array, and the array adds mass. We present RoverDevKit, an open-source tradespace exploration toolkit with an evaluator that couples a closed-form wheel-soil model with bottom-up mass, solar-power, thermal-survival, and traverse models. The evaluator is fast enough to serve as the fitness function of a multi-objective genetic algorithm (NSGA-II): a search comprising 3,000 mission evaluations takes under a minute on a single laptop core. We use it to map trade-offs among distance traveled, vehicle mass, and slope capability on mare, polar, highland, and crater-rim missions. The limiting factor varies by mission: energy storage at high latitude, slope traction on loose highland regolith, and traverse range on mare and crater-rim terrain. The wheel-soil model reproduces measured single-wheel drawbar pull from two independent datasets with accuracy consistent with the 20-30% error typically reported for this class of model, and the mass model predicts published 5-50 kg rover masses with median absolute percentage error of 10.5%. A comparison with five published rover designs in the same mass class shows that they lie near the predicted Pareto front.

cs.RO · astro-ph.IM

版本更新 · v2arXiv:2606.02479

Retrieve What's Missing: Coverage-Maximizing Retrieval for Consistent Long Video Generation

Minseok Joo, Dogyun Park, Taehoon Lee, Kyujin Lee, Hyunwoo J. Kim

原文摘要

Long-horizon video generation is a key capability of video world models, yet maintaining geometric consistency remains challenging. Memory-augmented generative models address this by retrieving historical frames, but their effectiveness depends on two key design choices: what 3D-geometric evidence should represent past observations, and how memory frames should be selected from this evidence. Pose-based field-of-view overlap provides lightweight but coarse geometric evidence, while explicit 3D scene memories offer finer spatial information at the cost of geometry estimation, alignment, and incremental updates over long rollouts. We propose Coverage-Maximizing Retrieval-Augmented Generation (CovRAG), a depth-based memory retrieval framework that uses pretrained 3D priors to construct a target-view coverage map as lightweight 3D memory evidence. For frame selection, CovRAG maximizes residual coverage gain, iteratively retrieving frames that explain target-view regions not covered by the temporal context or previously selected memories. To improve scalability in long-video generation, we introduce sliding-window depth caching for efficient geometry estimation. Experiments on RealEstate10K and DL3DV10K show that CovRAG improves long-horizon geometric consistency over the evaluated memory-retrieval baselines while maintaining low retrieval latency.

cs.CV

版本更新 · v2arXiv:2609.30258

Temporal Gradient Inversion for Private Trajectory Reconstruction in Embodied Reinforcement Learning

Sudip Bhujel, Shanghao Shi, Ruiquan Huang, Ning Zhang, Yang Xiao

原文摘要

Distributed learning in embodied reinforcement-learning agents offers a degree of privacy by retaining raw sensor data on-device and transmitting only policy gradients to the server. Yet temporal structure can amplify this leakage beyond single-frame attacks. We introduce Temporal Reconstruction Attack on Consecutive Encodings (TRACE), an amortized temporal gradient-inversion attack that autoregressively reconstructs the sequence of private observation-action trajectories from per-step policy-learning gradients. The attack exploits two structural signals ignored by prior single-frame methods: (i) cross-time correlation between successive embodied gradients, which we formalize via a conditional mutual-information bound, and (ii) closed-form action recovery from policy-head gradient structure, which we prove exact when standard entropy regularization is sufficiently small. On held-out embodied scenes, TRACE reaches $18.8$ dB PSNR with near-perfect action recovery at $3$-$4.5$ ms per reconstructed frame, dominating the learning-based baseline across all reconstruction metrics and exceeding optimization attacks while running orders of magnitude faster. Further evaluation demonstrates TRACE's broader applicability across recurrent, residual, and compact transformer victim architectures, multi-modal inputs, and larger discrete action spaces. Defense experiments suggest that protecting temporal gradient streams may require sequence-aware privacy mechanisms.

cs.LG

版本更新 · v2arXiv:2608.00967

TrajWiki: Source-Grounded Memory Trajectories for Long-Horizon Dialogue Agents

Jingyu Sun, Yuyang Xue, Mingyang Li, Zhengtao Yao, Jiachen Li, Yang Cui, Wenhao Cai, Haozhe Liu 等 12 位作者

原文摘要

Large language model agents have shown strong capabilities in generating coherent and contextually appropriate responses, yet robust long-horizon dialogue remains limited by the lack of external memory that is traceable, updatable, and diagnostically transparent. Existing memory-augmented agents often store memories as isolated records or overwritable states, making it difficult to preserve how information originates, evolves, conflicts, or becomes obsolete over time. We propose \textbf{TrajWiki}, a trajectory-based memory framework for long-horizon conversational agents. Instead of treating memory as static entries, TrajWiki represents each memory as a source-grounded evolution trajectory, maintained through immutable episodic snapshots and claim-level operations such as \texttt{ADD}, \texttt{REVISE}, and \texttt{DEPRECATE}. To reduce fragmentation and retrieval cost, TrajWiki further introduces \textbf{Memory Wiki}, a persistent intermediate layer that incrementally compiles dialogue history into structured and interlinked wiki pages capturing salient entities, events, quantities, topics, and conflicts. At inference time, queries are routed hierarchically from relevant wiki pages to linked memory trajectories, then to corresponding snapshots and source messages for evidence-grounded answer synthesis. Experiments on LoCoMo and MedMT show that TrajWiki improves long-horizon dialogue performance across both open-source and closed-source LLM backbones, while providing greater interpretability and diagnostic visibility into memory evolution, retrieval failures, and answer generation.

cs.AI

版本更新 · v2arXiv:2605.10163

Coarsening Linear Non-Gaussian Causal Models with Cycles

Francisco Madaleno, Francisco C. Pereira, Alex Markham

原文摘要

Recent work on causal abstraction, in particular graphical approaches focusing on causal structure between clusters of variables, aims to summarize a high-dimensional causal structure in terms of a low-dimensional one. Existing methods for learning such summaries from data assume that both structures are acyclic. Acyclicity is helpful for causal effect identification and reasoning, but it excludes the many systems of scientific interest that contain feedback loops. We show that in the linear non-Gaussian (LiNG) setting, the acyclicity assumption on the high-dimensional structure can be relaxed while still allowing recovery of a low-dimensional causal directed acyclic graph (DAG). LiNG models with cycles are observationally identifiable only up to an equivalence class whose members differ only within their feedback loops. Our low-dimensional DAG, which is invariant across all members of this class, is therefore identifiable from observational data alone. While existing approaches for learning this equivalence class have exponential time complexity, our low-dimensional summary is learned in worst-case cubic time and comes with finite-sample guarantees. We provide open source code and experiments on synthetic data to corroborate our theoretical results.

stat.ML · cs.AI · cs.LG

版本更新 · v3arXiv:2605.29761

S2MDF: A Plug-And-Play Layer for Intersection-Free Multi-Object Signed Distance Fields

Deniz Sayin Mercadier, Federico Stella, Aurel Bizeau, Nicolas Talabot, Pascal Fua

原文摘要

Compositional implicit surface representations model scenes as collections of objects, each encoded by a Signed Distance Field (SDF). A fundamental limitation of this approach is that multiple SDFs can produce geometries that interpenetrate, violating physical plausibility. Existing mitigation strategies rely on soft penalty terms that reduce but do not eliminate intersections, and require careful loss weighting. To truly prevent interpenetration, we propose a hard constraint on vector-valued SDFs and introduce S2MDF, a lightweight plug-and-play module that enforces the constraint on any object-compositional SDF representation without architectural modifications. It introduces negligible computational overhead and is compatible with linearly-interpolated standard meshing algorithms such as Marching Cubes. It can be applied during training or as a post-processing step. Experiments on multiple state-of-the-art compositional methods show that S2MDF reduces intersections to numerical precision while preserving reconstruction quality, outperforming existing mitigation strategies.

cs.CV · cs.CG

版本更新 · v3arXiv:2602.06756

f-Differential Privacy Filters: Validity and Approximate Solutions

Long Tran, Antti Koskela, Ossi Räisä, Antti Honkela

原文摘要

Accounting for privacy loss under fully adaptive composition---where mechanism choice and privacy parameters may depend on the history of prior outputs---is a central challenge in differential privacy (DP). Here, privacy filters are stopping rules ensuring a prescribed global budget is not exceeded. A leading candidate for optimal filter design is $f$-DP, which characterizes the full extent of adversarial hypothesis testing and recovers $(\varepsilon,δ)$-DP through piece-wise linear trade-off functions, while enabling tight $(\varepsilon,δ)$-DP accounting in standard compositions via tensor products. Yet whether such filters can be correctly defined under $f$-DP remains unclear. We show that the natural $f$-DP filter---tracking path-wise accumulating tensor products and stopping when the prescribed curve is crossed---is fundamentally invalid, precluding the direct use of standard efficient numerical Fast-Fourier-Transform accounting in the fully adaptive setting. We characterize this failure, establishing necessary and sufficient conditions for the natural filter's validity. Furthermore, we prove a fully adaptive central limit theorem for $f$-DP, establishing Gaussian convergence of cumulative privacy losses under full adaptivity. As a demonstration, we construct a closed-form approximate GDP filter for subsampled Gaussian mechanisms that provably outperforms RDP-based accounting in asymptotic regimes ($q\ll 1$ and $q\approx 1$) without tracking the full trade-off function, demonstrating that the slack in RDP is not intrinsic to adaptive composition---though CLT-based approximations are known to be optimistic at realistic subsampling rates, a limitation that remains an open challenge.

cs.CR

版本更新 · v3arXiv:2510.04302

When Guessing is Rewarded: Rethinking Language Model Evaluation with Distributional Uncertainty Scoring

Thomas F Burns

原文摘要

Standard language model evaluation assigns scores to single predicted answers, rewarding high-confidence responses regardless of how residual probability mass is distributed over alternative options. This creates a systematic pressure toward overconfident guessing: under accuracy-based schemes, a model maximises its expected score by always committing to an answer rather than abstaining, even when its uncertainty is high. While penalty-based approaches partially address this by raising the confidence threshold for strategic guessing, they still treat all sub-threshold responses identically, ignoring a fundamental distinction in how models can express uncertainty - for example between hedging toward incorrect answers versus hedging toward "I don't know" responses. This paper introduces a novel evaluation metric to solve this problem of not considering a model's entire probability distribution over answer choices. The metric naturally distinguishes between harmful overconfidence in wrong answers and uncertainty expressed through abstention, providing scores in an interpretable default range. Through theoretical analysis and illustrative examples, the metric is shown to offer a more nuanced and aligned evaluation paradigm that incentivises models to express genuine uncertainty rather than guessing. Adapting 12 existing evaluation benchmarks to the metric's variants and measuring performance on six language models shows that for half of the tested benchmarks scores are negative across all tested models, indicating significant tendencies towards hallucination.

cs.CL

版本更新 · v2arXiv:2604.00955

Enhancing Gradient Inversion Attacks in Federated Learning via Hierarchical Feature Optimization

Hao Fang, Wenbo Yu, Bin Chen, Xuan Wang, Shu-Tao Xia, Qing Liao, Ke Xu

原文摘要

Federated Learning (FL) has emerged as a compelling paradigm for privacy-preserving distributed machine learning, allowing multiple clients to collaboratively train a global model by transmitting locally computed gradients to a central server without exposing their private data. Nonetheless, recent studies find that the gradients exchanged in the FL system are also vulnerable to privacy leakage, e.g., an attacker can invert shared gradients to reconstruct sensitive data by leveraging pre-trained generative adversarial networks (GAN) as prior knowledge. However, existing attacks simply perform gradient inversion in the latent space of the GAN model, which limits their expression ability and generalizability. To tackle these challenges, we propose \textbf{G}radient \textbf{I}nversion over \textbf{F}eature \textbf{D}omains (GIFD), which disassembles the GAN model and searches the hierarchical features of the intermediate layers. Instead of optimizing only over the initial latent code, we progressively change the optimized layer, from the initial latent space to intermediate layers closer to the output images. In addition, we design a regularizer to avoid unreal image generation by adding a small ${l_1}$ ball constraint to the searching range. We also extend GIFD to the out-of-distribution (OOD) setting, which weakens the assumption that the training sets of GANs and FL tasks obey the same data distribution. Furthermore, we consider the challenging OOD scenario of label inconsistency and propose a label mapping technique as an effective solution. Extensive experiments demonstrate that our method can achieve pixel-level reconstruction and outperform competitive baselines across a variety of FL scenarios.

cs.CV

版本更新 · v3arXiv:2606.07085

Porting Declarative UI to HarmonyOS: A Heuristic-guided Approach for lightweight LLMs

Kunwu Zheng, Pengyu Xue, Zhen Yang, Tianlong Chen, Xiran Lyu, Peishi Lai, Mengying Zhao, Junjie Chen 等 13 位作者

原文摘要

As an emerging operating system, HarmonyOS has a significant demand for software migration, where the User Interface (UI) translation accounts for a critical link. However, recent UI development has shifted to declarative paradigms, e.g., Kotlin Jetpack Compose (KJC) for Android, SwiftUI for iOS, and ArkUI for HarmonyOS, making prior translation approaches inapplicable because they target either backend logic or legacy imperative UIs. Thus, related research is limited. To systematically evaluate KJC/SwiftUI-to-ArkUI migration, we build a parallel benchmark of 100 KJC and 100 SwiftUI files across eight scenarios, plus 52 real-world UI pages from nine open-source apps. Evaluating nine direct-translation setups (including diverse LLMs and agents), we find Compilation Success Rate (CSR) spans 0.00%-35.00%; common strategies (reference screenshots and compiler-guided repair) lift capable setups to 94.00%-99.00% CSR but fail on lightweight LLMs. By manually analyzing a 3,102-sample subset, deriving a regular-expression pattern for each failure family, and applying these patterns to generalize the resulting taxonomy to the full 29,593-sample set, we find residual errors rooted in (1) broken structure, (2) nonexistent APIs, and (3) missing resources (e.g., colors, strings, and icons). Accordingly, we propose ArkTrans, a declarative UI translation framework that maps these roots to deterministic structure supply, ArkUI knowledge and resource reference injection via a demonstration example, and iterative repair targeting residual errors, via four steps: Metadata Extraction, Skeleton Construction, LLM-driven Translation, and Compiler-Guided Iterative Repair. With Qwen3.6-27B, ArkTrans raises CSR from 0.00% to 70.00% on KJC and 64.00% on SwiftUI, achieving strong visual fidelity, and attains 65.63%/80.00% CSR on real-world pages, far outperforming the best common strategy at lower token cost.

cs.SE

版本更新 · v2arXiv:2610.39311

Tight Asymptotic Bounds on the Size of Order Graphs

Ruben Becker, Adrián Gómez-Brandón, Gonzalo Navarro, Nicola Prezza

原文摘要

Order graphs were introduced by Arroyuelo et al.\ (TODS 2024) as a generalization of the ring index, to support worst-case optimal joins on relations of arity $d$ while storing few columns: the index stores one column per edge, so its size is proportional to the number of edges of an order graph. It was known that the minimum number of edges lies between $Ω(2^d\sqrt d)$ and $O(2^d d)$, and the lower bound had been claimed to be $42$ for $d=6$. We first exhibit an optimal order graph with only $40$ edges for $d=6$, and show that the proof of that lower bound holds only for unions of cycles, whereas order graphs can be smaller than the smallest set of cycles. We give a corrected statement and proof that holds for every order graph: there must be at least $\max_m\binom dm\lceil m/2\rceil$ edges. This bound is $40$ (hence tight) for $d=6$. We then settle the asymptotic question: the minimum size is $Θ(2^d\sqrt d)$. This is obtained via an explicit construction, based on symmetric chain decompositions of the Boolean lattice, with at most $(d-1)\binom{d}{\lfloor d/2\rfloor}+2^d$ edges. The upper bound is within a factor $4+O(d^{-1/2})$ of the lower bound, and both numerically and asymptotically better than trie switching. Finally, we cast the problem as a set cover with connectivity constraints, which yields an exact ILP formulation and a greedy heuristic. With them we find optimal order graphs for $d\le 6$ in the bidirectional and for $d \le 7$ in the unidirectional model, showing that our lower bounds are tight there, and improve the best known order graphs for $d=7$ and $8$.

cs.DS

版本更新 · v2arXiv:2602.00123

Visual Affect Analysis: Predicting Emotions of Image Viewers with Vision-Language Models

Filip Nowicki, Hubert Marciniak, Jakub Łączkowski, Bartosz Wilczek, Krzysztof Jassem, Tomasz Górecki, Vimala Balakrishnan, Desmond C. Ong 等 9 位作者

原文摘要

Vision-language models (VLMs) show promise for large-scale affect inference from images, but their alignment with human affective ratings remains unclear. We benchmarked 16 proprietary and open-source VLMs on three validated affective image datasets: the International Affective Picture System, the Nencki Affective Picture System, and the Library of AI-Generated Affective Images. In a zero-shot setting, models performed two tasks: (i) top-emotion classification and (ii) prediction of human ratings on 1--7/9 Likert scales for discrete emotions and affective dimensions. We also evaluated rater-conditioned prompting on the LAI-GAI dataset using de-identified participant metadata. Best models showed strong discrete emotion classification (60%--80% on six-emotion tasks; 60%--75% on a 12-category task), with anger and surprise predicted least accurately. For continuous ratings, models aligned moderately to strongly with human judgments ($r > 0.75$) but showed consistent biases, especially weaker performance on arousal and overestimation of response intensity. Rater-conditioned prompting had only small, inconsistent effects. Overall, VLMs captured broad affective patterns but sometimes lacked the nuance, although newer model generations performed better.

cs.HC · cs.CV

版本更新 · v2arXiv:2611.05227

Regret Equals Integrated Covariance: Exact Identities for the Value of Information in Stochastic Optimization

Irene Aldridge

原文摘要

For a stochastic program $\min_{z\in Z} c^T z + h(z)$ with a random cost vector $c$, regret, or the expected value of perfect information, is usually computed by re-solving the problem scenario by scenario. We show that regret is determined by the covariance between the cost vector and the optimal decision $π^s(c)$. The identity is exact and holds without regularity assumptions once the covariance is integrated along the path from the mean to each scenario. With $c_s=E[c]+s(c-E[c])$, $Reg=-\int_0^1 s^{-1} Cov(c_s,π^s(c_s))\,ds$. Three consequences follow. First, the plain covariance is always an upper bound: $0\le Reg\le-Cov(c,π^s(c))$. Second, when the optimal decision rule is affine, as in unconstrained and equality-constrained (e.g., budget-constrained Markowitz) quadratic programs, regret equals exactly one half of the covariance. For purely linear objectives, an affine rule forces zero regret. Third, the ratio of regret to covariance lies in $[0,1]$ and is governed by the shape of the covariance profile along the path. The noise level at which this profile first becomes positive is a decision-stability margin that tightens the bound. The identity also holds scenario by scenario for any predicted cost, so it applies to linear and combinatorial programs with discontinuous decision rules. We give dimension-free concentration bounds and a central limit theorem for the plug-in estimator. Across 7 problem classes, 8 cost distributions, and the shortest-path benchmark of Elmachtoub and Grigas (2022) with $10^6$ draws per configuration, the identities hold to within quadrature error, and the covariance bound holds in every scenario.

econ.EM · cs.IT · cs.LG

版本更新 · v4arXiv:2511.15856

GLOBE: Accurate Surrogates for Boundary-Driven PDEs via Domain-Inspired Architectures and Equivariance

Peter Sharpe

原文摘要

We introduce GLOBE, a nonlinear neural surrogate for boundary-driven, homogeneous, weakly nonlinear PDEs that draws inductive bias from boundary-element methods and equivariant ML, representing solutions as superpositions of learnable Green's-function-like kernels evaluated from boundary faces to targets. The architecture is translation-, rotation-, and parity-equivariant; discretization-invariant; and units-invariant via rigorous nondimensionalization. On AirFRANS (steady incompressible RANS over NACA airfoils), a compact ~117k-parameter GLOBE model has lower mean-squared error than published values for the strongest reported ML surrogates on both the interpolation and low-data splits, in single-run comparisons under the released AirFRANS normalization. The model evaluates fields at arbitrary points, handles non-watertight meshes, and generalizes under Reynolds number and angle-of-attack distribution shifts. We further introduce a hierarchical Barnes-Hut acceleration that exploits the kernel's far-field decay to reduce evaluation cost from quadratic to near-linear in the number of boundary elements, with a tunable opening angle that recovers exact dense evaluation in the zero-angle limit. Quantitative validation focuses on 2D AirFRANS; on 3D DrivAerML cars, GLOBE predicts surface and volume fields on the full meshes, and we compare it with a matched Transolver baseline. Together, these results show that boundary-element-inspired inductive biases can substantially improve the accuracy of ML surrogates for boundary-driven PDEs while scaling to large 3D meshes.

cs.LG · physics.flu-dyn

版本更新 · v2arXiv:2608.18495

Physics-Unrolled Neural Operator for Accelerating High-Fidelity Wireless Ray Tracing

Rafid Umayer Murshed, Saif Ur Rahman, Mingyue Tang, Elahe Soltanaghai

原文摘要

Site-specific wireless design relies on ray tracing to predict how signal strength varies across a floorplan, but a converged indoor radio map takes tens of seconds to simulate and planning a single building requires thousands of them. A learned surrogate can remove most of that cost, yet training one runs into a second problem: high-fidelity labels are exactly what is too expensive to produce at scale, so the affordable labels come from finite-ray simulations that carry residual Monte Carlo noise. We address this with RayNO, a physics-unrolled neural operator that reconstructs the converged output of a ray tracer from one cheap low-fidelity run and scene priors. Rather than treating a radio map as a generic image, RayNO refines the field through three stages matched to reflection, diffraction, and scattering, each supervised by a label of matching physical complexity. We prove that when the label error is conditionally unbiased the learned operator can end up closer to the high-fidelity reference than the labels it was trained on, and we verify that condition directly in the simulator using repeated independent ray seeds. Across diverse floorplans, RayNO outperforms image-to-image baselines, wireless learning models, monolithic neural operators, and classical multi-fidelity regression on both image-quality and wireless deployment metrics, while reducing the cost of a high-fidelity map from roughly 28 s to 0.11 s.

cs.LG · cs.AI

版本更新 · v2arXiv:2603.28764

Geometry-aware similarity metrics for neural representations on Riemannian and statistical manifolds

N Alex Cayco-Gajic, Arthur Pellegrino

原文摘要

Similarity measures such as centred kernel alignment (CKA) or representational similarity analysis (RSA) are widely used to compare the representational geometries employed by different neural networks to solve the same task. Yet, because existing methods compare the extrinsic geometry of representations in state space, rather than their intrinsic geometry, they may fail to capture subtle yet crucial distinctions between fundamentally different computations. Here, we introduce metric similarity analysis (MSA), a novel method which leverages tools from Riemannian geometry to compare the intrinsic geometry of neural representations under the manifold hypothesis. We show that MSA can be used to (i) disentangle neural computations of deep networks in rich vs. lazy learning regimes, (ii) compare the dynamics of recurrent neural networks and state-space models, and (iii) investigate the statistical manifolds of diffusion models. Overall, we introduce a mathematically grounded and broadly applicable framework to understand the mechanisms behind neural computations by contrasting their intrinsic geometries.

cs.LG · cs.AI · math.DG · q-bio.NC

版本更新 · v3arXiv:2512.23818

Energy-Tweedie: Score meets Score, Energy meets Energy

Andrej Leban

原文摘要

Denoising and score estimation are classically linked through Tweedie's formula, which relates the posterior mean under Gaussian noise to the Stein score of the noisy marginal. In this work, we extend this perspective beyond Gaussian noise to a broad class of Gibbs (energy-based) noise distributions, with the generalized Gaussian family as an example. We derive the Energy-Tweedie identity: when the denoising posterior is viewed through the lens of scoring rules, the path derivative of a kernel scoring rule defined by the noise potential recovers the Stein score of the noisy marginal. Thus, the familiar correspondence between Gaussian noise, posterior means, squared loss, and Tweedie's formula is lifted to a distributional correspondence between Gibbs noise distributions, full posterior laws, kernel scoring rules, and the Energy-Tweedie identity, which gives a Tweedie-style relation for each noise potential. Among its consequences, this identity gives a posterior-samples-to-score route to score estimation, yields a principled criterion for estimating unknown noise parameters, and enables diffusion-style sampling along user-chosen paths through the noise-parameter space, supplying the score-based perspective on recent generative methods trained with scoring rules.

stat.ML · cs.LG

版本更新 · v2arXiv:2605.10654

Active Learning for Gaussian Process Regression Under Self-Induced Boltzmann Weights

Jixiang Qing, Henry Moss, Matthias Sachs

原文摘要

We consider the active learning problem where the goal is to learn an unknown function with low prediction error under an unknown Boltzmann distribution induced by the function itself. This self-induced weighting arises naturally in problems such as potential energy surface (PES) modeling in computational chemistry, yet poses unique challenges as the target distribution is unknown and its partition function is intractable. We propose \texttt{AB-SID-iVAR}, a Gaussian Process-based acquisition function that approximates the intractable Bayesian target distribution in closed form while avoiding partition function estimation, and is applicable to both discrete and continuous input domains. We also analyze a Thompson sampling alternative (\texttt{TS-SID-iVAR}) as a higher variance Monte Carlo variant. Despite the unknown target, under mild conditions, we establish that the terminal prediction error vanishes with high probability, and provide a tighter average-case guarantee. We demonstrate consistent improvements over existing approaches in this setting on synthetic benchmarks and real-world PES modeling and drug discovery tasks. Our code is available at https://github.com/TsingQAQ/SIDAL

cs.LG · cs.AI

版本更新 · v2arXiv:2602.15400

One Agent to Guide Them All: Empowering MLLMs for Vision-and-Language Navigation via Explicit World Representation

Zerui Li, Hongpei Zheng, Fangguo Zhao, Yanyan Shao, Jian Zhou, Sihao Lin, Shijie Li, Qi Wu

原文摘要

A navigation agent must understand high-level semantic instructions and reason about precise spatial structure. Multimodal Large Language Models (MLLMs), with their strong generalization, are a promising foundation for such agents. We propose GTA, a decoupled design that separates low-level spatial state estimation from high-level semantic planning. We introduce an explicit metric world representation that combines accumulated geometry with navigation history and exposes this information to the MLLM through a multimodal interface for decision-making. We further introduce counterfactual branch reasoning that checks anticipated outcomes against subsequent observations and revises navigation decisions when they disagree. The world representation grounds waypoint selection in reconstructed metric geometry. GTA achieves 48.8% Success Rate (SR) on the full R2R-CE val-unseen split and 46.2% on a 260-episode English RxR-CE val-unseen subset. Additional comparisons on shared R2R-CE episodes and mechanism ablations support the framework's effectiveness. We also demonstrate transfer to wheeled, quadrupedal, and aerial robots. Project page: https://zeruili22.github.io/GTA/

cs.RO

版本更新 · v2arXiv:2609.08740

PAC-Bayesian Bounds for Learning Partially Observed Stochastic Linear Time-Invariant State-Space Systems with Inputs and Sub-Gaussian Noise

Mihaly Petreczky, Mohamad Al Ahdab, John Leth

原文摘要

In this paper we derive a Probably Approximately Correct (PAC)-Bayesian error bound for partially observed linear time-invariant (LTI) stochastic dynamical systems in state-space form with inputs and sub-Gaussian noise. Such bounds are widespread in machine learning, and they are useful for characterizing the predictive power of models learned from finitely many data points. The bound derived in this paper relates the expectation of prediction errors with the prediction error generated by the model on the data used for learning. In addition, we show that it can also be used to derive bounds for the parameter estimation error. In turn, this allows us to provide finite-sample error bounds for the prediction error and parameter estimation error for a wide class of system identification algorithms. Furthermore, as LTI systems are a sub-class of recurrent neural networks (RNNs), these error bounds could be a first step towards PAC-Bayesian bounds for RNNs.

cs.LG · math.OC

版本更新 · v2arXiv:2603.24006

Video Object Segmentation under Aquatic Domain Shift: A Diagnostic Benchmark and Restoration Adapter

Hongshen Zhao, Jingkang Tai, Yuhang Wu, Wenkang Zhang, Xi Lan, Shangyan Wang, Tianyu Zhang, Wankou Yang

原文摘要

Underwater video object segmentation (VOS) requires temporally consistent dense segmentation in scenes where water acts as a participating optical medium. Wavelength-dependent attenuation, scattering, turbidity, and unstable illumination alter object appearance, weaken mask-level localization cues, and destabilize temporal association, yet existing VOS benchmarks provide limited support for diagnosing these aquatic factors. We introduce UW-VOS, a large-scale diagnostic benchmark with 1,431 video sequences, 307,267 mask annotations, 411 semantic categories, and 16 fine-grained attributes. UW-VOS supports both standard VOS evaluation and factorized analysis of aquatic appearance degradation, spatial localization ambiguity, and temporal identity discontinuity. We further propose the Aquatic Restoration Adapter (ARA), a physics-derived parameter-efficient module that transfers the inverse structure of underwater image formation into bottleneck feature space and can be instantiated in different VOS backbones. Experiments show that representative open-air VOS methods suffer an average 13-point $\mathcal{J}\&\mathcal{F}$ drop on UW-VOS. ARA matches or surpasses full fine-tuning in both Transformer- and memory-based VOS backbones, and outperforms standard PEFT counterparts under a matched setting. These results establish UW-VOS as a diagnostic platform for underwater video perception and ARA as a compact feature-restoration module for aquatic domain adaptation. Project repository: https://github.com/hszh/UW-VOS.

cs.CV

版本更新 · v3arXiv:2604.08039

LINE: LLM-based Iterative Neuron Explanations for Vision Models

Vladimir Zaigrajew, Michał Piechota, Gaspar Sekula, Paweł Gelar, Przemysław Biecek

原文摘要

Interpreting the concepts encoded by individual neurons in deep neural networks is a crucial step towards understanding their complex decision-making processes and ensuring AI safety. Despite recent progress in neuron labeling, existing methods often limit the search space to predefined concept vocabularies or produce overly specific descriptions that fail to capture higher-order, global concepts. We introduce LINE, a novel, training-free iterative approach tailored for open-vocabulary concept labeling in vision models. Operating in a strictly gray-box setting, LINE leverages a large language model and a text-to-image generator to iteratively propose and refine concepts in a closed loop, guided by activation history. We demonstrate that LINE achieves state-of-the-art performance across multiple model architectures, yielding AUC improvements of up to 0.15 on ImageNet and 0.05 on Places365, while discovering, on average, 25% of new concepts missed by predefined vocabularies. Beyond identifying the top concept, LINE provides a complete generation history, enabling polysemanticity evaluation and producing supporting visual explanations that rival gradient-dependent activation maximization methods. The LINE source code is available at https://github.com/CredibleAI/LINE

cs.CV · cs.AI · cs.LG

版本更新 · v2arXiv:2601.05903

HAPS: Hierarchical LLM Routing with Joint Architecture and Parameter Search

Zihang Tian, Rui Li, Jingsen Zhang, Xiaohe Bo, Wei Huo, Xu Chen

原文摘要

Large language model (LLM) routing aims to exploit the specialized strengths of different LLMs for diverse tasks. However, existing approaches typically focus only on selecting LLM architectures, treating candidate models as fixed while overlooking parameter adaptation, which can substantially affect task performance. In this paper, we introduce HAPS, a hierarchical LLM routing framework that jointly searches over model architectures and parameters. Specifically, a high-level router selects among candidate LLM architectures, while a low-level router generates input-conditioned LoRA parameters for the selected architecture, expanding each candidate from a single fixed behavior into a region of reachable behaviors. The low-level router is built on the backbone of the high-level router, so that architecture selection and parameter generation share a common representation of the prompt. We further optimize the whole framework with a reinforcement learning objective. Extensive experiments show that HAPS consistently outperforms strong routing baselines across reasoning- and knowledge-intensive benchmarks, with analyses of its components, design choices, scalability, cost, and mixed open- and closed-source deployment further demonstrating the robustness of these gains. Our code is available at https://github.com/zihangtian/HAPS.

cs.CL