跳到正文
研踪PaperTrail

版本更新

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

部分采集异常

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

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

统计口径与数据新鲜度

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

最近完成检查:2026-11-22 06:41最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

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

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

论文修订列表

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

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

The Straight and Narrow: Do LLMs Possess an Internal Moral Path?

Luoming Hu, Jingjie Zeng, Liang Yang, Hongfei Lin

原文摘要

Enhancing the moral alignment of Large Language Models (LLMs) is a critical challenge in AI safety. Current alignment techniques often act as superficial guardrails, leaving the intrinsic moral representations of LLMs largely untouched. In this paper, we bridge this gap by leveraging Moral Foundations Theory (MFT) to map and manipulate the fine-grained moral landscape of LLMs. Through cross-lingual linear probing, we validate the shared nature of moral representations in middle layers and uncover a shared yet different moral subspace between English and Chinese. Building upon this, we extract steerable Moral Vectors and successfully validate their efficacy at both internal and behavioral levels. Leveraging the high generalizability of morality, we propose Adaptive Moral Fusion (AMF), a dynamic inference-time intervention that synergizes probe detection with vector injection to tackle the safety-helpfulness trade-off. Empirical results confirm that our approach acts as a targeted intrinsic defense, effectively reducing incorrect refusals on benign queries while minimizing jailbreak success rates compared to standard baselines.

cs.CL

版本更新 · v3arXiv:2606.23566

LangMAP: A Language-Adaptive Approach to Tokenization

Clara Meister, Suchir Salhan, Andrzej Szablewski, Pietro Lesci, Paula Buttery, Tiago Pimentel

原文摘要

Language-specific tokenizers improve tokenization quality and the downstream performance of models on those languages. Using one with an existing pretrained model requires either training a new model from scratch or adapting the vocabulary of the pretrained one. We propose Language-adaptive Maximum a Posteriori (LangMAP) Tokenization, which extends the UnigramLM algorithm to the multilingual setting by replacing its single distribution over the vocabulary with one distribution per language over the same vocabulary. LangMAP can be used to train a multilingual language model from scratch, or to adapt a pretrained model's tokenizer to individual languages without changing its vocabulary. Language labels are required to estimate the per-language distributions; at inference, the algorithm selects the highest-probability segmentation across languages, i.e., it does not need a language label. In experiments where we adapt a pretrained tokenizer with LangMAP, we observe that LangMAP's new segmentation has consistently higher morphological boundary recall than the original tokenizer. In code data, it improves alignment with abstract syntax tree (AST) leaf boundaries in all configurations we try. Despite ostensible improvements in segmentations, in language model fine-tuning experiments, we do not observe significant differences in performance for most language-task pairs.

cs.CL

版本更新 · v2arXiv:2608.25197

Exact algorithms for optimal discretization

László Kozma, Junqi Tan

原文摘要

The optimal discretization problem asks, given two disjoint sets of points $R$ and $B$ in the plane, for a minimal family of horizontal and vertical lines that separate the two sets, so that no cell delimited by the lines contains points from both sets. The problem arises as a pre-processing in supervised machine learning, and has received significant attention in parameterized algorithmics. Answering the question raised by Bonnet, Giannopoulos, and Lampis [IPEC 2017] and Froese [PhD thesis, 2018], it was shown by Kratsch, Masařík, Muzi, Pilipczuk, and Sorge [SODA 2021] that optimal discretization admits a fixed-parameter algorithm with running time $2^{\mathcal{O}(k^2 \log k)} \cdot n^{\mathcal{O}(1)}$, where $k$ is the solution size and $n = |R| + |B|$. In this paper we give an algorithm for optimal discretization that runs in time $\mathcal{O}(1.9602^n)$. We also study the related point separation problem that asks to separate all input points by axis-parallel lines. For this problem we obtain an algorithm with runtime $\mathcal{O}(1.8899^n)$. Our guarantees follow from structural observations about bichromatic and monochromatic point sets. To our knowledge, these are the first improvements over the trivial $2^n$ bound for both problems.

cs.DS

版本更新 · v2arXiv:2605.17912

WorldArena 2.0: Extending Embodied World Model Benchmarking on Modality, Functionality and Platform

Zhuohang Li, Yiding Ma, Yu Shang, Lei Jin, Shengyuan Wang, Jianjie Fang, Zhaolu Wang, Xvyuan Liu 等 29 位作者

原文摘要

World models have emerged as a central paradigm for embodied intelligence, enabling agents to predict action-conditioned future and reason about environmental dynamics. However, existing embodied world model benchmarks are still largely confined to vision-only prediction, offline embodied applications, and simulator-based evaluation, making them insufficient for assessing increasingly comprehensive world models. In this work, we introduce WorldArena 2.0, an expanded benchmark that systematically broadens embodied world model evaluation along three dimensions: modality, functionality, and platform. Along the modality dimension, WorldArena 2.0 extends evaluation from vision-only to visuotactile modalities, enabling assessment of multimodal perception and prediction. Along the functionality dimension, it extends beyond policy evaluation and planning to assess world models as interactive RL environments for policy optimization. Along the platform dimension, it moves beyond simulator-only evaluation to a diverse suite of simulated and real-world robotic settings across multiple embodiments. Under a standardized protocol, WorldArena 2.0 comprehensively evaluates perceptual quality, interactive utility, and cross-platform performance, providing a comprehensive testbed for tracking progress toward embodied world models. The project page including codes and demos is available at: https://world-arena.ai/.

cs.RO · cs.CV

版本更新 · v2arXiv:2605.15464

Where and What to Reward? Understanding Generalization Between Verifiable and Open-Ended Domains in Reinforcement Learning

Shangjian Yin, Yu Fu, Yue Dong, Zhouxing Shi

原文摘要

Reinforcement learning with verifiable rewards (RLVR) is widely used to improve the reasoning capability of language models, since model-generated answers can be easily verified by a rule-based verifier. In contrast, reinforcement learning from human feedback (RLHF) is mainly used to optimize open-ended conversation with a learned reward model, because such responses are not easy to verify. RLVR and RLHF are usually trained separately with their own domain data and training protocols. How gains transfer between these domains is unclear, partly because comparisons change both where a model is trained (the prompts) and what is rewarded (by a verifier or a reward model). We separate the two in a controlled study of RL on multiple base models that fixes the optimizer and the number of training prompts, and varies only the source domain of the prompts (math, multi-domain, chat, or mixtures) and the reward. We find that RLHF on open-ended prompts substantially improves conversational ability and also brings large gains in reasoning and coding, whereas RLVR improves reasoning but its gains in open-ended conversation plateau far below those of RLHF, suggesting that RL on open-ended prompts with a reward model can serve as an effective approach for generalizing across domains.

cs.LG · cs.AI · cs.CL

版本更新 · v2arXiv:2601.00913

CleanGS: Pareto-Guided Post-Hoc Cleanup of 3D Gaussian Splatting Scenes

Jyotirmaya Shivottam, Om Kumar, Subhankar Mishra

原文摘要

A pretrained 3D Gaussian Splatting (3DGS) reconstruction can reproduce its capture views well while retaining off-object structure that becomes visible under reframing. We present CleanGS, a post-hoc cleanup method that removes such structure without retraining the underlying representation. Given calibrated views and binary target masks, CleanGS scores candidate three-view subsets using mask reliability, camera baseline, viewing-direction diversity, and complementary sparse 3D support. Rather than collapsing these objectives a priori, it computes the exact Pareto front over subsets of the reduced candidate pool and selects a balanced on-dominated subset using weighted Chebyshev scalarization. The selected views then drive rasterization-aware two-of-three voting to retain a subset of the original Gaussians. We evaluate the exported asset directly and introduce a fixed-pose widened-field protocol that exposes structure outside the original framing. Across 18 scenes, CleanGS achieves 19.03 dB standard and 17.83 dB widened-field PSNR, compared with 16.44/16.29 dB for FlashSplat and 15.28/15.10 dB for GaussianCut with the same three masks. CleanGS leads five of six photometric metrics and remains within 0.32 dB of the uncleaned reconstruction in standard PSNR. Its filtering-and-export stage takes a median of 20 seconds and 1.9 GB peak memory, compared with 3.1 minutes and 41.6 GB for FlashSplat and 4.2 minutes and 34.9 GB for GaussianCut. Code is available at https://github.com/smlab-niser/clean-gs/.

cs.CV · cs.LG

版本更新 · v3arXiv:2607.16051

Loop the Loopies!

Zitian Gao, Yilong Chen, Yihao Xiao, Xinyu Yang, Ran Tao, Joey Zhou, Bryan Dai

原文摘要

We present Loopie, the most powerful open-source looped Transformer to date. The Loopie series consists of two Mixture-of-Experts (MoE) models: a 20B-parameter model with 2B active parameters and a 6B parameter model with 0.6B active parameters. Looped Transformers have long faced a challenge: given an N-fold pre-training compute, increasing the parameter count by a factor of N usually outperforms looping N times. Loopie addresses this challenge. Extensive ablation studies, including comparisons with a vanilla 30B-A3B model, show that Loopie substantially outperforms vanilla Transformer baselines trained with the same compute budget. With a novel post-training method, Loopie develops strong reasoning abilities and achieves frontier-level reasoning performance.

cs.CL · cs.AI

版本更新 · v2arXiv:2605.08960

CrystalREPA: Transferring Physical Priors from Universal MLIPs to Crystal Generative Models

Chengqian Zhang, Yucheng Jin, Duo Zhang, Tiejun Li, Han Wang

原文摘要

Crystal generative models mainly learn what stable crystals look like, with little explicit supervision for what makes them stable. We reveal a substantial representation gap between state-of-the-art crystal generative models and pretrained universal machine learning interatomic potentials (MLIPs) via energy probing, and show this gap can be closed by a simple training-time alignment. We propose Crystal REPresentation Alignment (CrystalREPA), a plug-and-play framework that aligns the atom-wise hidden states of generative encoders with frozen MLIP representations through an element-aware contrastive objective, transferring stability-aware atomistic priors with marginal training overhead and no additional inference cost. Across three generative frameworks, ten MLIP teachers, and two benchmark datasets, CrystalREPA consistently improves the thermodynamic stability, structural validity, and structural fidelity of generated crystals. Equally important, we find that an MLIP's transfer effectiveness is poorly predicted by its accuracy on standard leaderboards (e.g., Matbench Discovery) but strongly predicted by the distinguishability of its atom-wise representation space, yielding a practical, accuracy-independent criterion for selecting MLIP teachers for generative transfer. Code is available at https://github.com/Chengqian-Zhang/CrystalREPA.

cs.LG

版本更新 · v3arXiv:2604.08095

The estimates for Boolean surface area of polynomial threshold functions

Fan Chang, Joseph Slote, Chun-Kai Tseng, Alexander Volberg, Haonan Zhang

原文摘要

Polynomial threshold functions (PTFs) are an important low-complexity class of Boolean functions, with strong connections to learning theory and approximation theory. Recent work on learning and testing PTFs has exploited structural and isoperimetric properties of the class, especially bounds on average sensitivity, one of the central themes in the study of PTFs since the Gotsman--Linial conjecture recently solved by OpenAI, \cite{GLsol}. In this work we study PTFs through the lens of the Boolean surface area (or Talagrand boundary) \[ \mathbf{BSA}[f]=\mathbb{E}|\nabla f|=\mathbb{E}\sqrt{s_{f}(x)}, \] a natural measure of vertex-boundary complexity on the discrete cube. Our main result is that every degree-$d$ PTF has polylogarithmic Boolean surface area: \[ \mathbf{BSA}[f]\le C_d(\log(en))^{C_d}. \] The proof is based on the PTF Restriction Lemma of Kabanets, Kane, and Lu \cite{KKL2017} and proceeds through a tail bound for the pointwise sensitivity. In particular, it controls all subcritical fractional moments of the sensitivity. We also record a random block partition principle for Boolean surface area and an alternative recursive argument following Kane's work \cite{DK} on average sensitivity, which independently yields the second bound \[ \mathbf{BSA}[f]\le \exp(C(d)\sqrt{\log n}). \] This bound was obtained in \cite{FSVZ} without clarifying the magnitude of $C(d)$, which we do below. For lower moments $\bE |\nabla f|^η \le C(d, η)$ there is no dependence on $n$ for $0<η<1$.

cs.CC · math.AP · math.CA · math.PR

版本更新 · v2arXiv:2610.13426

Goal-Oriented Ordered Autoencoding for Successive Refinement in Progressive Communication

Qi Liao, Dario Bega

原文摘要

Goal-oriented communication often struggles to sustain downstream task performance under variable and unpredictable bandwidth. We address this problem by proposing GO-OAE (Goal-Oriented Ordered AutoEncoding), which learns a progressively refinable quantized latent sequence, optimized directly for task utility rather than source reconstruction. Each component of the sequence is represented for transmission by its code index, and the learned ordering enables inference from any received prefix of the index sequence, with performance improving as more indices arrive. We prove that optimizing the goal-oriented distortion objective is equivalent to solving a weighted conditional information bottleneck formulation, and introduce an unbiased multi-prefix importance sampling (MPIS) estimator, to reduce GO-OAE training computational cost from O(BK) to O(Bm) with m << K, and reduces the estimator variance by a factor of 1/m. Experiments show that, on MiniImageNet, GO-OAE achieves over 96% of the lossless upper-bound classification accuracy using 324 bits per image (683X compression vs. raw RGB), and already attains over 94% of the upper bound with only 70% of the transmitted indices. It consistently outperforms reconstruction-optimized codecs and ordered autoencoders trained with uniform prefix sampling across all transmission budgets, demonstrating effective communication at extreme compression rates.

cs.IT

版本更新 · v3arXiv:2610.28356

CountVideoBench: A Benchmark to Evaluate Prediction Biases on the Object Counting task by Video-Language Models

Marc Chapus, Carlos Crispim-Junior, Véronique Eglin, Atilla Baskurt

原文摘要

Object counting in videos remains a poorly characterized capability of multimodal large language models. Counting questions are included in many existing VideoQA benchmarks, but the ground-truth count distributions in these benchmarks are heavily skewed toward small values. Across the nine benchmarks we survey, the median ground-truth count is at most five, and the three most frequent values together account for between 45% and 93% of the videos. The resulting mean accuracy is then dominated by the most frequent counts; a value-dependent bias at a rare count contributes negligibly to the average and remains invisible. We introduce CountVideoBench, a benchmark of 2,600 synthetic videos covering 26 cardinalities in the interval [5, 50] (100 videos each), grouped into six clusters of consecutive counts that span the range while enabling near-neighbor comparisons. Each video contains a single class of static objects under a controlled camera motion, removing object motion and reducing recognition as confounds. We evaluate sixteen video-language models from nine architecture families in a zero-shot setting. No model exceeds 27.6% Exact Match. The dependence of accuracy on cardinality varies across models, ranging from monotonic decline to a non-monotonic peak-and-collapse pattern, which rules out increasing difficulty with cardinality as the dominant explanation of counting failure. Every model further concentrates its predictions on its own set of preferred integers, with accuracy peaks coinciding with these values and collapsing at adjacent counts. These findings highlight the need for balanced, diagnostic counting benchmarks to reliably assess this fundamental visual capability.

cs.CV · cs.AI · cs.LG

版本更新 · v2arXiv:2610.29111

SU(2)-Equivariant Spinor Message Passing for Molecular Magnetism

Erh-Wei Sheng, Beom Seok Kang, Yuchao Lin, Danish Khan, Anima Anandkumar

原文摘要

Predicting molecular magnetic properties often requires costly electronic-structure calculations that account for spin-orbit coupling. Inspired by the spinor nature of the underlying electronic states, we introduce eSpinor, an SU(2)-equivariant graph neural network that propagates spinor features alongside the integer-rank tensors used in conventional equivariant models. We initialize spinors from eigenvectors of an approximate Hamiltonian that includes spin-orbit coupling. The network preserves their rotation laws and makes predictions independent of arbitrary eigenbasis choices. Comparisons with geometry-only and Hamiltonian-informed baselines assess the benefit of this architecture beyond supplying electronic information. On cobalt single-molecule magnet candidates, eSpinor improves magnetic anisotropy predictions, including for unseen ligands. It also improves excitation-energy predictions for dysprosium candidates with unseen ligands, extending the benefit to rotationally invariant scalar targets. For a dysprosium magnetic resonance imaging probe, it predicts real electron-spin correlations and low-field nuclear relaxation rates more accurately despite static crystal-field errors similar to the Hamiltonian-informed baseline. This dynamical advantage extends from water to methanol without retraining. These results support spinor message passing as a useful inductive bias for molecular magnetism in the tested systems and show why model selection should be guided by accuracy on the intended physical observables.

cs.LG

版本更新 · v2arXiv:2608.20317

CMASS: A ClimbMix Agentic Search Suite for Evaluating Search Agents Across Heterogeneous Tasks

Sahel Sharifymoghaddam, Lingwei Gu, Yijun Ge, Jimmy Lin

原文摘要

Evaluating advances in agentic search requires testing whether methods generalize across tasks and corpus scale. Changing web search services impede controlled comparisons, while small corpora assembled around benchmark questions provide a limited test of generalization. We introduce CMASS, the ClimbMix Agentic Search Suite, which projects three search benchmarks---BrowseComp-Plus, Total Recall QA, and DeepSearchQA---and the multi-hop question-answering dataset HotpotQA onto a shared, fixed corpus. The target, ClimbMix, is a pre-training corpus of 553M documents and approximately 400B tokens, assembled independently of the benchmark questions. Our projection pipeline verifies grounding, answer uniqueness, and set completeness through independent agent audits, controlled revision, and human review. The 423 questions span entity identification, multi-hop reasoning, exhaustive answer sets, and aggregation. Evaluations of three models expose substantial headroom for open-weight agents and show that high answer accuracy can coexist with incomplete evidence coverage. By enabling measurement of accuracy alongside evidence coverage, search effort, and closed-book performance, CMASS supports developing agents that find sufficient evidence and produce complete answers efficiently. The pipeline code and dataset are available at https://cmass.tech

cs.IR

版本更新 · v4arXiv:2507.15117

A meta-modal logic for bisimulations

Alfredo Burrieza, Fernando Soler-Toscano, Antonio Yuste-Ginel

原文摘要

We propose a novel modal study of bisimulations. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are bisimilar to the current one under a given bisimulation. We show that bisimulations are definable in this object language via frame validity (for the forth and back conditions) and model validity (for the atomic harmony condition). Additionally, some other related notions (refinements, simulations, bisimulations for a restricted set of variables, and $n$-bisimulations) are also shown to be definable. Second, we provide a sound and complete axiomatisation of the class of all pairs of Kripke models that are bisimulation-related. Third, we show that the satisfiability problem of this logic is decidable and PSPACE-complete via a translation to standard modal logic $K$ under a simple frame condition. All our results are encoded and verified by Isabelle/HOL.

cs.LO · math.LO

版本更新 · v3arXiv:2609.26603

Hierarchical GNNs for power flow: letting physics shape the hierarchy

Carmine Delle Femine, Leire Garin Atxaga, Asier Diaz-Iglesias, Juan Pablo Maroto Herrera, Ane Miren Florez-Tapia, Marco Quartulli, Izaro Goienetxea Urkizu

原文摘要

Hierarchical latent communication improves the generalization of a power-flow model, shared across three grids, to new operating scenarios. The module exchanges information through two reduced graphs inside the corrective network of GENCO, replacing two of its local correction steps. We compare Kron-derived transports, a same-anchor Quotient construction and the flat GENCO Base architecture, all trained under one protocol of our own with about a hundred times fewer optimizer updates per grid than GENCO's reference training: 200 epochs on three grid topologies, fewer than 1,900 training scenarios per grid and three initialization seeds per model. Evaluation uses 200 newly generated, preselected scenarios per grid. On the training topologies, Kron reaches a macro family-balanced voltage error of $0.851\pm0.110$, 51.3% below a per-bus mean fitted on training solutions (1.747). Kron is below this reference on 98.5% of the 600 fresh scenarios, and both hierarchical models outperform it on every training topology in all three seeds. The flat baseline reaches $5.660\pm0.899$ and does not outperform the reference on any training topology, so Kron's 85.0% reduction relative to it compares architectures within our training regime. Kron is also 31.0% below Quotient ($1.235\pm0.225$). These results demonstrate generalization across operating scenarios within the studied topologies, with one set of learned parameters shared across grids. On two topologies unseen in training, the current models do not yet outperform the fitted reference in calibrated transfer; extrapolation to new topologies is the next development objective.

cs.LG · cs.AI

版本更新 · v2arXiv:2609.03118

Efficient Co-simulator Integration with Application to Smart Grids

Talha Ibn Aziz, Jihoon Og, Ioanis Nikolaidis, Omid Ardakanian

原文摘要

The evolution of the electric power grid towards a ``smart grid'' is an example of an emerging large-scale cyber-physical system. To study the potential of cyberattacks or other sources of extreme events, high-fidelity co-simulation is one of the few realistic strategies. In this work, we demonstrate a practical and high-performance co-simulation strategy for smart grids, which provides lessons about co-simulation integration that can be carried over to other cyber-physical systems. Specifically, we present a co-simulation platform based on the Mosaik framework that integrates several federates including OpenDSS for power flow, a refined NS-3 for communication networks, and custom Python-based simulators for on-load tap changer control, distributed state estimation, and data collection. We compare synchronization strategies -- exhaustive lock-step time advancement versus an optimized event-driven approach that exploits lower-bound time stamps (LBTS) and next-event prediction -- and introduce targeted refinements to NS-3 event handling and relevance filtering of internal events. Performance is evaluated on two standard IEEE benchmark systems: the 13-node test feeder with tap-changer voltage regulation and a large-scale 33-bus system augmented with 32 European low-voltage feeders (1,793 nodes total) performing distributed state estimation with thousands of phasors and smart meters. Experimental results demonstrate that the refined event-based synchronization that uses LBTS-based NS-3 event filtering reduces execution time by up to 50\% over non-filtered LBTS, and more than 4$\times$ in the tap control scenario compared to naïve lock-step methods, while strictly preserving temporal correctness and simulation accuracy.

cs.NI

版本更新 · v2arXiv:2608.06779

Genotypic Triggers: Exposing Pharmacogenomic Blind Spots via Host-Specific Backdoors in Generative Antimicrobial Peptide Models

Doniyorkhon Obidov, Xiaolong Guo, Yonghui Li, Kaichen Yang

原文摘要

Large Language Models (LLMs) have accelerated drug discovery, particularly in the automated design of antimicrobial peptides (AMPs). However, current validation pipelines for peptide generation models overlook historical precedents showing that certain drugs carry health risks predominantly for individuals with specific genetic profiles. In this paper, we demonstrate that such targeted health risks can be induced intentionally and at scale by manipulating models that generate peptide candidates. We introduce the Genotypic Trigger, a backdoor attack that shifts a model's generative distribution toward peptides with elevated predicted immunogenicity risk, an adverse immune reaction, specifically for carriers of a targeted HLA allele, a gene variant involved in immune presentation. Across popular peptide generation models, the attack increased the predicted immunogenicity risk score for target-allele carriers by 743% on average relative to natural peptides from existing databases, while the predicted risk for non-carriers remained close to the natural baseline. Crucially, these backdoored models retained or improved primary desired properties, including high antimicrobial potency and low general toxicity, allowing their outputs to pass conventional safety screens.

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

版本更新 · v3arXiv:2609.21718

A Novel Path-Tracking Algorithm for Automated Tractor-Trailer Forward and Backward Maneuvers

Alexandre Lombard, Florent Perronnet, Théo Rigal, Nicolas Gaud, Abdeljalil Abbas-Turki

原文摘要

Fully autonomous tractor-trailer systems are increasingly deployed in logistics, agriculture, and industrial environments, where precise and robust path-tracking capabilities are essential. However, the articulation between the tractor and the trailer introduces additional nonlinearities and significantly complicates lateral and longitudinal control, particularly during reversing maneuvers. This paper introduces a novel path-tracking algorithm specifically designed for articulated vehicles with a single trailer. The proposed method combines a lateral control law applied at the trailer level with a short-horizon predictive adjustment of the tractor steering angle, ensuring stable convergence toward the desired path in both forward and backward motion. The approach is geometry-based and requires no per-vehicle calibration or training. Simulation studies in a high-fidelity physics simulator show steady-state or final lateral errors of $0.02$--$0.05$~m on straight-line, circular, and reverse docking trajectories, which is of the same order of magnitude as, or lower than, the errors reported in the literature. Real-world experiments on a small-scale tractor--trailer robot, with the whole controller running on a low-cost microcontroller, further confirm the feasibility of the approach, with lateral errors below 13~mm during repeated reverse docking maneuvers despite a pose detection latency of about 200~ms.

cs.RO · eess.SY

版本更新 · v5arXiv:2604.08552

Automated Standardization of Legacy Biomedical Metadata Using an Ontology-Constrained LLM Agent

Josef Hardi, Martin J. O'Connor, Marcos Martinez-Romero, Jean G. Rosario, Stephen A. Fisher, Mark A. Musen

原文摘要

Descriptive scientific metadata in public repositories are often incomplete and inconsistent with community standards and ontologies, limiting data FAIRness. Large language models (LLM) offer a promising approach to automatically standardizing such metadata when the LLM is provided with knowledge of the relevant standards in machine-actionable form. Entry of metadata standards through prompt engineering offers only fixed snapshots of the relevant standards, however, and it relies on an LLM's pretrained knowledge to interpret and satisfy constraints related to the standard. We evaluate whether giving an LLM access to metadata specifications and authoritative terminology at runtime improves automated metadata standardization. We present ARMS, a tool-using LLM agent that retrieves complete CEDAR metadata templates and that queries authoritative biomedical terminology services dynamically at execution time. We compared ARMS with a prompt-engineering approach on 839 legacy metadata records describing experiment datasets with expert-standardized records serving as the reference standard. Across the corpus, ARMS outperformed the prompt-engineering approach in converting legacy metadata to standards-compliant form, increasing precision from 0.56 to 0.93 and recall from 0.51 to 0.85, with improvements across all field categories and assay types. The largest gains occurred for ontology-constrained fields where precision increased from 0.36 to 0.92. Our findings show that access to appropriate metadata standards can substantially improve LLM-based standardization of legacy metadata. ARMS improves metadata standardization by giving LLMs runtime access to the authoritative resources that define valid metadata. Representation of metadata standards in machine-actionable form enhances the task of rectifying legacy metadata using LLM technology, especially when those standards can be queried dynamically.

cs.DB · cs.AI

版本更新 · v5arXiv:2603.15033

Models Designed to Forget: Machine Unlearning via Key Deletion

Sonia Laguna, Jorge da Silva Goncalves, Moritz Vandenhirtz, Alain Ryser, Irene Cannistraci, Julia E. Vogt

原文摘要

Machine unlearning for vision models is rapidly becoming a practical requirement, driven by privacy regulations, data errors, and the need to remove harmful or corrupted training images. Despite this, most existing approximate unlearning methods tackle the problem from a post-hoc perspective. They attempt to erase the influence of targeted samples through parameter updates that typically require access to the full training data. This creates a mismatch with real deployment scenarios where unlearning requests can be anticipated, revealing a fundamental limitation of post-hoc approaches. We motivate unlearning by design, a novel paradigm for approximate methods in which models are directly trained to support forgetting as an inherent architectural capability. We instantiate this idea with Machine UNlearning via KEY deletion (MUNKEY), a memory-augmented transformer that decouples instance-specific memorization from model weights. Here, unlearning corresponds to removing the instance-identifying key, enabling zero-shot forgetting without weight updates or access to the original samples or labels. Across natural image benchmarks, fine-grained visual recognition, and medical datasets, MUNKEY outperforms all post-hoc baselines. Our results establish that unlearning by design enables fast, deployment-oriented unlearning while preserving predictive performance.

cs.LG

版本更新 · v2arXiv:2610.25821

Optimal Priors for Betting Tests with Bounded Payoffs: An Exact Expected-Time Characterization

Francesco Orabona

原文摘要

Testing by betting is a powerful framework that recasts hypothesis testing as a betting game. A popular approach spreads the initial wealth over fixed bets according to a prior distribution, using a universal portfolio algorithm. For suitable priors, this approach achieves the optimal expected rejection time as the error probability goes to zero at a fixed alternative. Yet, priors with this guarantee can behave quite differently near the null. This motivates the question: Which prior should we use in testing-by-betting algorithms? We study bounded scalar payoffs and, under technical conditions, prove a sharp formula for expected rejection time, uniform over all bounded alternatives as the error probability tends to zero. The formula shows how the prior's mass around the zero bet determines the cost of adapting to an unknown alternative. We characterize the priors that attain the best possible leading constant when the error probability and alternative vary together. We also show that no valid test can uniformly improve on this cost across ranges of alternatives near the null. In particular, the uniform prior can require arbitrarily more observations than suitable priors that concentrate around the zero bet. A general inversion argument converts our results into sharp expected times to reach a prescribed confidence-sequence width. We also give a concrete prior choice and an FFT-based algorithm with almost linear computational complexity.

math.ST · cs.IT · stat.ME

版本更新 · v2arXiv:2606.01950

Learning Action-Conditional and Object-Centric Gaussian Splatting World Models for Rigid Objects

Jens U. Kreber, Lukas Mack, Joerg Stueckler

原文摘要

World models enable intelligent agents to predict the consequences of their actions on the environment. In this paper, we propose Multi Rigid Object Gaussian World Model (MRO-GWM), a novel model that learns action-conditional dynamics of rigid objects in 3D. Using object-centric Gaussians, we can represent arbitrary object shapes and multi-object scenes. We develop a novel temporal-spatial transformer architecture that predicts future rigid body motion from a history of object Gaussians and future actions. Objects are represented by Gaussians in an object-centric frame, which allows to describe object motion as a rigid body transformation. Our model is trained on reconstructions from multiple viewpoints, which requires the model to also handle partial observations of objects due to occlusions. We analyze prediction performance of our approach on synthetic datasets composed of typical household objects with multi-object dynamics and interactions by a robot end effector. We also evaluate our model in model-predictive control for non-prehensile manipulation in simulation and for image-based tracking and prediction of object motion in simulated and real-world scenes.

cs.RO · cs.CV · cs.LG

版本更新 · v2arXiv:2606.29742

MicroAgent: Context-Augmented Multi-Agent Framework for Automatic Microservice Decomposition

Zishan Su, Junjie Huang, Shiwen Shan, Xingyan Chen, Hui Zeng, Yuxin Su, Yanlin Wang, Michael R. Lyu

原文摘要

The adoption of Microservice Architecture (MSA) has revolutionized software engineering by enhancing scalability, agility, and maintainability over traditional monolithic applications. As more developers transition their legacy systems to microservice-based architectures, effective microservice decomposition-partitioning monolithic applications into highly cohesive services-becomes vital. However, this decomposition task presents significant challenges. Manual approaches are time-consuming and labor-intensive. Existing automated methods often fail to capture the necessary semantic insights from complex applications, while naive applications of Large Language Models tend to overlook crucial contextual information and design principles, leading to suboptimal results. To address these challenges, we propose MicroAgent, a Context-Augmented Multi-Agent Framework for Microservice Decomposition. Our framework divides the decomposition process into five distinct subtasks and assigns each to a specialized agent. To enhance the effectiveness of each agent, we provide tailored, multi-granularity context that keeps its analysis focused and mitigates information overload. Furthermore, to ensure the decomposition adheres to established design principles, we integrate analytical tools that guide the agents' decision-making. Experimental evaluations on 10 Java Web applications demonstrate that MicroAgent achieves an average decomposition accuracy of 89.2%, outperforming the state-of-the-art method by 24.6%. We also conduct a case study to highlight the practical benefits of our design.

cs.SE

版本更新 · v3arXiv:2606.04003

A sharp analysis of Root-MUSIC: locations of correct and extraneous roots

Hana Huber, Weilin Li

原文摘要

Root-MUSIC is a spectral estimation algorithm that approximates the unknown signal frequencies by constructing a high-degree polynomial and finding a subset of roots which are closest to the complex unit circle. Previous works found asymptotic expectation formulas for the performance of Root-MUSIC under the implicit assumption that the aforementioned root selection criterion does not select extraneous roots -- those which are unrelated to the correct parameters. This paper removes the need for this assumption by showing all extraneous roots lie outside an annulus of a certain thickness and therefore are not selected by the algorithm. This paper also provides sharp and non-asymptotic error bounds for the correct roots in terms of fundamental model parameters. All results hold under a natural separation condition on the correct signal frequencies and are applicable in both the single- and multi-snapshot models. Numerical simulations confirm our theory. The main mathematical insight of this paper is a geometric property of the Root-MUSIC polynomial: its correct roots are highly stable to noise while its extraneous roots must lie outside of an annulus.

eess.SP · cs.IT

版本更新 · v2arXiv:2610.30089

ProactEgoMem: Benchmarking Proactive Memory in Streaming Egocentric Video

Ruotong Liao, Meikel Kokowski, Xiaoxiao Sun, Yongqin Xian, Laura Bravo Sánchez, Shiye Su, Federico Tombari, Serena Yeung-Levy 等 9 位作者

原文摘要

Today's multimodal assistants are typically prompted to interpret the visual evidence presented to them. To offload the cognitive burden of remembering across long horizons, wearable assistants should instead proactively acquire and maintain useful memory as the user's surroundings evolve. Doing so on the user's behalf requires identifying what matters, understanding the scene in real time, and initiating memory maintenance in the background while the user stays focused on their activities. We introduce ProactEgoMem, a benchmark that evaluates proactive memory in streaming egocentric video. Three tasks ground the evaluation in ambient environmental needs: Information Capture (IC) preserves transient yet dense visual information, State Tracking (ST) follows changing object states, and Location Tracking (LT) records object movements. The benchmark defines its protocol at two levels of proactiveness: the Notification Level asks for a single timely notification that satisfies the user's intent, while the deeper Intervention Level asks the agent to maintain memory on the user's behalf through an active start-to-stop tool lifecycle. Parallel ProactEgoMem-Daily and ProactEgoMem-Sci tracks contain 300/100 clips covering daily and scientific use cases, paired with 1000/500 questions in ProactEgoMem-QA, which measures the quality of the proactively acquired memory. Across proprietary, open-source, video-language, and streaming baselines, even the strongest models fail to capture memory both timely and accurately. ProactEgoMem provides a rigorous evaluation foundation for proactive multimodal assistance and for video agents that co-exist with their users.

cs.CV

版本更新 · v2arXiv:2605.25692

Homomorphic Quantum Error Correction

Kornikar Sen, Miguel A. Martin-Delgado

原文摘要

We study the algebraic compatibility between quantum homomorphic encryption and stabilizer quantum error correction in an honest-but-curious model, restricting the encryption to the transversal block-Pauli mask $(X^aZ^b)^{\otimes n}$ controlled by two secret key bits $a$ and $b$. We prove a necessary and sufficient criterion for an $[[n,1,d]]$ stabilizer code to remain compatible with this mask, namely that the transversal $X$ and $Z$ operators commute with every stabilizer generator, and we specialize it to a classical-code criterion for Calderbank--Shor--Steane codes. Combining code-space preservation with the logical action of the mask, every stabilizer code falls, with respect to each of the two transversal mask operators, into exactly one of three classes: incompatible, compatible but trivially acting, or compatible with a nontrivial logical Pauli action; the two operators need not fall into the same class. We verify this classification by exact symplectic computation for rotated and planar surface codes, toric codes, triangular and toric color codes, the $[[15,1,3]]$ code and several small codes, and find that the class is fixed by the lattice size and the boundary presentation rather than by the topological phase: the surface-code family realizes all three classes, whereas color codes realize only the two compatible ones. For encrypted computation we show that the Shor code does not implement the logical $T$ gate by a transversal $T^{\otimes 9}$, whereas suitable triorthogonal codes do so up to a Clifford correction. We formulate logical-Pauli masking as a code-independent algebraic template. Syndrome extraction and recovery are key-independent whenever the mask preserves the code space, so that the client only needs the block size and the class of the code to decrypt.

quant-ph · cs.CR · cs.IT

版本更新 · v4arXiv:2602.18377

Theory and interpretability of Quantum Extreme Learning Machines: a Pauli transfer matrix approach

Markus Gross, Hans-Martin Rieser

原文摘要

Quantum reservoir computers (QRCs) have emerged as a promising approach to quantum machine learning, since they utilize the natural dynamics of quantum systems for data processing and are simple to train. Here, we consider $n$-qubit quantum extreme learning machines (QELMs) with initial-state encoding and continuous-time reservoir dynamics. Applying the Pauli transfer matrix (PTM) formalism reveals the encoding-generated features and their linear transformation by quantum channels, and thereby provides a nonlinear vector autoregression model as an interpretable classical representation of a QELM. We show that the nonlinear information processing capacity of a QELM factorizes into the ability of the encoding to represent a given target function and the decodability of the relevant Pauli features after the effective PTM. Comparing geometric and statistical decodability reveals features that are algebraically hidden yet recoverable through data correlations. We relate the decodability of Pauli features to the spreading of measurement operators under Heisenberg evolution (Krylov growth). Focusing on the unitary channel, we discuss how structured Hamiltonians, when paired with certain observables, can impair model performance, as reflected in a low rank of the readout and the effective PTMs. We trace this effect to Hamiltonian symmetries and derive asymptotic rank estimates for symmetry-resolved observable families. Our decodability analysis disentangles the contributions of encoding, reservoir dynamics, and measurement observables, and thus provides interpretable diagnostics that can inform the design of QELMs and reduce reliance on exhaustive hyperparameter search. As a specific application, we consider forecasting nonlinear dynamical systems and show that the readout of a trained QELM closely matches the expression of the underlying flow map at leading orders.

quant-ph · cs.LG

版本更新 · v3arXiv:2503.16089

Query-Efficient Fixpoints of $\ell_p$-Contractions

Sebastian Haslebacher, Jonas Lill, Patrick Schnider, Simon Weber

原文摘要

We prove that an $ε$-approximate fixpoint of a map $f:[0,1]^d\rightarrow [0,1]^d$ can be found with $\mathcal{O}(d^2(\log\frac{1}ε + \log\frac{1}{1-λ}))$ queries to $f$ if $f$ is $λ$-contracting with respect to an $\ell_p$-metric for some $p\in [1,\infty)\cup\{\infty\}$. This generalizes a recent result of Chen, Li, and Yannakakis [STOC'24] from the $\ell_\infty$-case to all $\ell_p$-metrics. Previously, all query upper bounds for $p\in [1,\infty) \setminus \{2\}$ were either exponential in $d$, $\log\frac{1}ε$, or $\log\frac{1}{1-λ}$. Chen, Li, and Yannakakis also show how to ensure that all queries to $f$ lie on a discrete grid of limited granularity in the $\ell_\infty$-case. We provide such a rounding for the $\ell_1$-case, placing an appropriately defined version of the $\ell_1$-case in $\textsf{FP}^{dt}$. To prove our results, we introduce the notion of $\ell_p$-halfspaces and generalize the classical centerpoint theorem from discrete geometry: for any $p \in [1, \infty) \cup \{\infty\}$ and any mass distribution (or point set), we prove that there exists a centerpoint $c$ such that every $\ell_p$-halfspace defined by $c$ and a normal vector contains at least a $\frac{1}{d+1}$-fraction of the mass (or points).

cs.CC · cs.CG

版本更新 · v2arXiv:2607.14386

CIPHER: A Decoupled Exploration-Selection Framework for Test-Time Scaling of Data Science Agents

Maxime Heuillet, Sharadind Peddiraju

原文摘要

Enterprise data science and analytics spans closed-ended information extraction with verifiable answers and open-ended insight discovery. Agents are evaluated on one or the other, so there is no evidence on whether one system can serve both. We present \texttt{CIPHER}, a data science agent built on a Decoupled Exploration--Selection (DES) framework that applies test-time scaling at the plan level: generating $N$ candidate analysis plans, selecting $M{<}N$ for parallel execution, and aggregating the results. We evaluate $48$ distinct design choices for the DES framework (spanning generation, selection, budget and aggregator capacity) jointly on $357$ tasks from Infi-DA-Bench (closed-ended) and InsightBench (open-ended), on a proprietary and an open-weights base model. A single zero-tuning configuration is competitive against purpose-built specialist baselines under matched models, within $1.2$pp of \texttt{DataWise} and $1.3$pp of \texttt{Agent-Poirot}. The joint sweep exposes that generation and aggregation are the most influential performance levers, while random selection --- the only strategy with zero overhead --- matches its tuned alternatives. These results offer new insights on the design of test-time scaling strategies, and on how a fixed inference budget is best allocated across them, for agents deployed on enterprise analytics workloads.

cs.AI

版本更新 · v2arXiv:2610.31489

An Improved Bound for Testing $k$-Colorability

Bangjie Xu

原文摘要

We study the sample complexity of testing $k$-colorability in the dense graph model. A graph is $\varepsilon$-far from being $k$-colorable if at least $\varepsilon n^2$ edge deletions are required to make it $k$-colorable. We prove that a uniformly random induced subgraph on $O(k\log k/\varepsilon)$ vertices is non-$k$-colorable with probability at least $2/3$ whenever the original graph is $\varepsilon$-far from $k$-colorable. The proof combines a palette-based coloring process with a container-style encoding-and-reconstruction argument. This yields $O(k\log k/\varepsilon)$, which is no worse than the previous state of the art $O(k\log (1/\varepsilon)/\varepsilon)$ throughout the nonvacuous parameter range, and is an improvement when $\log k=o(\log(1/\varepsilon))$. For each fixed $k$, combining this upper bound with the known $Ω(\log k/\varepsilon)$ lower bound gives $Θ(1/\varepsilon)$ dependence on $\varepsilon$.

cs.DM