跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+479新增论文
+361其中 AI 相关
+64已有论文修订
+92新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 21:56各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 21:56库内论文最新更新时间:2026-11-14 02:59

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

23,827 已收录论文19,941 AI 相关6,922 有修订112 HF 社区发现

浏览论文库

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

找到 23,827 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v2arXiv:2608.30368

SpectraTac: A Compact Camera-Free Optical Tactile Sensor with Distributed Color Sensing

Hao Wu, Haotian Guo, Yu Feng, Yutong Wang, Yanzhe Wang, Jianshu Zhou

原文摘要

Tactile sensing is essential for physical interaction in robotics and human--machine systems. However, combining rich tactile information with compact hardware, low cost, and low computational overhead remains challenging. This work presents SpectraTac, a compact, camera-free optical tactile sensor that combines active red--green--blue (RGB) illumination with spatially distributed color sensing. Contact deforms a compliant transparent elastomer and modulates its internal light field, producing spatially differentiated changes in color and intensity. Three distributed color sensors capture these responses as low-dimensional spatio-spectral features, avoiding cameras, imaging optics, and high-dimensional image processing. The device measures 19.2 mm in diameter and 4 mm in height, with a material cost below USD~5. A data-driven decoding framework simultaneously estimates three-dimensional (3D) force and the contact region from the optical measurements. For 3D force prediction, the sensor achieved mean absolute errors (MAEs) of 0.161, 0.164, and 0.429 N along the x-, y-, and z-axes, respectively. The nine-region contact-classification accuracy was 99.9%. We further evaluated real-time 3D force tracking and contact-region-based human--machine interaction through an interactive control task. These results indicate that distributed color-resolved optical sensing offers a compact, low-cost alternative to camera-based tactile sensing for robotics, wearable sensing, and interactive systems.

cs.RO

新论文 · v1arXiv:2611.11192

Beyond Code Translation: Agentic Android-to-HarmonyOS Migration

Yinghang Ma, Wuyang Dai, Song Wang, Filipe Cogo, Zhen Ming, Jiang

原文摘要

Migrating Android applications to HarmonyOS is an important yet challenging software engineering task. Existing large language model (LLM)-based migration approaches primarily translate code at the method or file level, overlooking project-wide dependencies and workflow coordination. Moreover, ArkTS, the primary language for HarmonyOS, is relatively low-resource, and migrated applications often lack sufficient tests for reliable verification, making end-to-end migration error-prone. We present A2HTrans, an agentic framework for end-to-end Android-to-HarmonyOS application migration. Rather than performing isolated code translation, A2HTrans decomposes applications into functionality-aware migration tasks, prioritizes them through dependency analysis, and orchestrates translation, validation, and iterative repair within a unified execution workflow. To improve migration reliability, A2HTrans employs a tool-augmented verification strategy that combines compiler-based syntax checking with LLM-based semantic validation and automated repair. We evaluate A2HTrans on 14 Android applications spanning diverse sizes and domains using Claude-Sonnet-4.6 as the underlying migration model. Compared with Claude Code, A2HTrans preserves 8.3% more functional completeness, improves behavioral correctness by 8.0%, and reduces migration time by 28.8%. These results demonstrate that structured agentic execution substantially improves the reliability and efficiency of project-level cross-platform software migration.

cs.SE

版本更新 · v2arXiv:2611.03196

Dhara Bench: An Evidence-Oriented Retrieval Benchmark for Indian Knowledge Systems

Avinash Holenarasipur Nagendra, Anand Kaniyaar Sriranga Prasad, Kousik Sarathy Sridharan, Mohan Raghavan

原文摘要

Dhara Bench is a retrieval benchmark for Indian Knowledge Systems (IKS), with 325 questions in 12 categories and 60,121 text chunks from 15 source groups. The categories were developed based on 4,500 questions submitted to the Dhara application; the evaluation set combines corpus-aligned application queries with expert-contributed questions. The annotations comprise 7,578 question-chunk relevance links involving 6,847 distinct corpus chunks. For 34 composite and multi-hop questions, 401 conjugate groups specify alternative sets of passages that jointly support each question. Chunk identifiers and hierarchical references connect the judgments to their source texts. The paper describes corpus preparation, annotation, and validation, and reports a fixed BM25 baseline implemented with Pyserini with $k_1=0.9$ and $b=0.4$. Across all questions, BM25 achieves MRR@20 of 0.315, Recall@10 of 0.182, and nDCG@10 of 0.205. On the group-annotated subset, complete-evidence scores are CE_Recall@20 = 0.294 and CE_MRR@20 = 0.141. The category results expose particularly weak verse retrieval, while group scores reveal gaps between finding individual passages and completing their support. The corpus and evaluation code are available at https://github.com/Avinash2236/Dhara-Bench.

cs.IR · cs.CL

版本更新 · v3arXiv:2610.23002

Robotic Spatiotemporal Editing: A Unified Interface for Controllable Action Generation via Masked Action Reconstruction

Yanbang Li, Bu He, Yi Tian, Yu-Chiao Huang, Chenyu Zhang, Ruoqu Chen, Yuanzhe Liu, Yuxiang Gao 等 9 位作者

原文摘要

Generative policies can synthesize robot behaviors, yet controlling and editing them through diverse spatiotemporal references remains challenging. In the real world, human intent requires robot behaviors that satisfy constraints on where, when, and how actions are executed. Our key insight is that spatiotemporal control references, such as keypoints, flows, orientations, and keyposes, can be viewed as partial specifications of the same temporal Cartesian action space. We introduce the MAP (Masked Action Space) interface to unify these action references and formulate controllable manipulation as an action inpainting problem. Our Inpainting Policy (IP) reconstructs missing action dimensions of the end-effector, combining progress-guided alignment with multi-mask training supporting unseen action-constraint combinations. We further adopt a training-free RePaint variant that iteratively inpaints the action during denoising to reduce control error. On ManiSkill and LIBERO-10, our policy achieves average task success rates of 92.67% and 64.67%, respectively.Real-world experiments demonstrate spatiotemporal control with average positional and rotational errors of 44.3 mm and 7°, respectively, showing that our policy can use diverse references to guide executable robot behaviors.

cs.RO

新论文 · v1arXiv:2611.11189

TEAM: Topology-Aware, Semantic-Sensitive, General Transformer for Multimodal-Attributed Graphs

Yushuo Li, Xunkai Li, Zhengyu Wu, Ronghua Li, Guoren Wang

原文摘要

Multimodal-Attributed Graphs (MAGs) organize heterogeneous data in graphs whose nodes are characterized by modalities such as text and images rather than traditional unimodal attributes. However, many representative MAG methods organize propagation around node-level states and topology-defined neighborhoods, which can obscure fine-grained modality contributions: a bounded neighborhood may contain semantically weak evidence, while compatible context need not be confined to it. To address both limitations, we propose TEAM, a modality-centric framework that constructs and encodes graph context with node-modality tokens rather than treating each node as a single interaction unit. Concretely, TEAM unfolds the local topology into a Modality Encoding Tree and performs tree-anchored semantic evidence acquisition, organizing local structural context while expanding the accessible evidence space outside the constructed local Tree. We further introduce the Modality-Source Context Transformer (MSCT), which encodes the selected node-modality tokens and coordinates interactions among modality-source groups. By retaining textual and visual attributes as separate interaction units until readout, it supports fine-grained cross-node cross-modal exchange without first collapsing them into whole-node features. Across the evaluated baselines, TEAM attains the highest reported mean on all graph-learning metrics, all three G2Text metrics, and both G2Image metrics. On Toys, it surpasses the strongest baseline by 3.37 and 2.93 percentage points in Accuracy and Macro-F1, respectively.

cs.LG

版本更新 · v2arXiv:2611.04371

Embodied AI for Scientific Discovery: From Physical Action to Scientific Evidence

Wenhao Xu, Changwei Wang, Shunpeng Chen, Yukun Song, Sifan Zhou, Kaize Luo, Shibiao Xu, Yuehua Zhao 等 9 位作者

原文摘要

Scientific experiments are increasingly selected, executed and interpreted by learned systems that act through physical interfaces. Robot learning builds physical competence, whereas AI for science chooses which experiment to run, each reporting different endpoints. This review treats their interface as one problem, embodied AI for science, where the experiment itself is partially observed: specimen state, apparatus state and measurement processes are latent, actions are costly and irreversible, and missingness depends on execution and outcome. We organize the literature by three closures operating at distinct levels: operational closure (the experiment realized is the one intended), epistemic closure (the result updates beliefs or selects subsequent experiments) and evidential closure (the record supports a claim). We analyze workflows through a record-linked evidence cycle - Record, Diagnose, Calibrate, Confirm - as analytic functions with feedback. A taxonomy crosses these closures with six delegated decisions and five embodiment classes. Our formulation separates commanded, realized and observed conditions and models diagnosis with explicit resource, risk and sample-change costs. We compare experiment-selection methods by terminal decision, review perception, protocol compilation, visuomotor policies, world models, recovery and transfer by evidence emission requirements, and compare chemistry, materials, biology, microscopy and field workflows by what their records establish. An appendix provides an evidence map of 28 workflows (26 physical, two software-boundary), characterizing validation pathways and claim confirmation requirements. We propose evaluation that separates actions, valid experiments, campaigns and confirmed claims, framing open challenges as controlled comparisons with measurable failure conditions.

cs.AI

版本更新 · v2arXiv:2511.09895

SE-Diff: Simulator and Experience Enhanced Diffusion Model for Comprehensive ECG Generation

Xiaoda Wang, Kaiqiao Han, Yuhao Xu, Xiao Luo, Yizhou Sun, Wei Wang, Carl Yang

原文摘要

Cardiovascular disease (CVD) is a leading cause of mortality worldwide. Electrocardiograms (ECGs) are the most widely used non-invasive tool for cardiac assessment, yet large, well-annotated ECG corpora are scarce due to cost, privacy, and workflow constraints. Generating ECGs can be beneficial for the mechanistic understanding of cardiac electrical activity, enable the construction of large, heterogeneous, and unbiased datasets, and facilitate privacy-preserving data sharing. Generating realistic ECG signals from clinical context is important yet underexplored. Recent work has leveraged diffusion models for text-to-ECG generation, but two challenges remain: (i) existing methods often overlook the physiological simulator knowledge of cardiac activity; and (ii) they ignore broader, experience-based clinical knowledge grounded in real-world practice. To address these gaps, we propose SE-Diff, a novel physiological simulator and experience enhanced diffusion model for comprehensive ECG generation. SE-Diff integrates a lightweight ordinary differential equation (ODE)-based ECG simulator into the diffusion process via a beat decoder and simulator-consistent constraints, injecting mechanistic priors that promote physiologically plausible waveforms. In parallel, we design an LLM-powered experience retrieval-augmented strategy to inject clinical knowledge, providing more guidance for ECG generation. Extensive experiments on real-world ECG datasets demonstrate that SE-Diff improves both signal fidelity and text-ECG semantic alignment over baselines, proving its superiority for text-to-ECG generation. We further show that the simulator-based and experience-based knowledge also benefit downstream ECG classification.

cs.LG · cs.AI

版本更新 · v2arXiv:2608.00635

FlowPilot: Real-Time World-Action Modeling for Agile UAV Navigation

Runqing Wang, Ding Yu, Pengyuan Min, Xinhong Zhang, Wei Xiao, Yu Hu, Jie Chen, Fu Zhang 等 9 位作者

原文摘要

We present FlowPilot, the first world-action model for real-time onboard UAV navigation from depth. Unlike map-then-optimize pipelines that require local reconstruction or end-to-end policies that lack explicit scene prediction, FlowPilot jointly denoises future depth observations and executable trajectories with flow matching. A dual-stream mixture-of-transformers couples video and action experts through shared attention, allowing future-scene prediction and trajectory generation to inform each other. At deployment, the model runs action-centrically and outputs only a trajectory. To generate smooth, state-consistent references, actions are parameterized as degree-7 Bernstein polynomials: the current state constrains the initial control points, and the network predicts five free control points, yielding C^2-continuous references with closed-form velocity, acceleration and jerk. FlowPilot is trained on a three-level depth pyramid spanning high-throughput simulation, photorealistic simulation, and real onboard data. In closed-loop simulation, it outperforms learning- and optimization-based baselines under increasing clutter and commanded speeds up to 10 m/s. On a physical quadrotor, FlowPilot achieves a mean inference latency of 10.2 ms on a Jetson Orin NX and reaches a peak speed of 10 m/s during outdoor flight using only onboard sensing and computation.

cs.RO

新论文 · v1arXiv:2611.11179

Guidance at Pure Noise Erodes Speaker Similarity in Few-Step Token-Conditioned Flow-Matching TTS

Jaeho Lee, Han-Lim Choi

原文摘要

Text-to-speech systems built from a language model and a flow-matching mel decoder now run the decoder with two to four Euler steps instead of the official ten or more. At two steps the word error rate (WER) is unchanged, but speaker similarity (SIM) drops by one to six points. This paper shows that most of this loss comes from classifier-free guidance on the first step. At pure noise the network can only return the conditional mean, so guidance shifts every trajectory by nearly the same vector. Later steps do not remove this shift, and its size grows with the length of the first step, so it is negligible with ten or more steps and accounts for most of the loss with two. Two training-free samplers are derived from this analysis. First-step unguided sampling (FSU) leaves the first step unguided and recovers $84$--$91\%$ of the two-step SIM loss on CosyVoice~2/3 with no significant WER increase. FSU-Mid replaces the two Euler steps by one midpoint step with an unguided first evaluation, recovers $77$--$85\%$ on IndexTTS-2 and matches the ten-step teacher on CosyVoice~2 and GLM-TTS. Both use three network function evaluations, one fewer than the official two-step sampler, and FSU-Mid gives the highest mean recovery among eight published guidance rules re-run at two steps on four decoders.

cs.SD · cs.AI

版本更新 · v2arXiv:2605.12541

PPG2ECG: Physiology-Guided Latent Rectified Flow for Electro-Hemodynamic PPG-to-ECG Generation

Xiaoda Wang, Minxiao Wang, Kaiqiao Han, Defu Cao, Ching Chang, Yidan Shi, Runze Yan, Xiao Luo 等 13 位作者

原文摘要

Electrocardiography (ECG) is the clinical standard for cardiac assessment but requires dedicated hardware that does not scale to daily-life monitoring. Photoplethysmography (PPG) is ubiquitous in wearables but lacks ECG-specific diagnostic morphology and is corrupted by motion and sensor noise. PPG-to-ECG generation aims to bridge this gap by recovering electrical morphology and timing from peripheral pulse signals. However, existing methods largely rely on statistical alignment and data-driven generation. They fail to explicitly structure the latent space around physiology-aware electro-hemodynamic factors and lack constraints from forward physiological dynamics. To address these challenges, we propose PPG2ECG, a physiology-guided latent rectified flow framework. PPG2ECG introduces an electro-hemodynamic simulator that co-models ECG and PPG through shared cardiac phase dynamics. Guided by this simulator, a Physiology-Aware AutoEncoder learns a structured electro-hemodynamic latent space. Then we integrate this simulator guidance into a PPG-conditioned latent rectified flow, enforcing ECG-side morphology consistency and ECG-to-PPG forward hemodynamic consistency during generative transport. Experiments on the large-scale MC-MED dataset demonstrate that PPG2ECG significantly improves PPG-to-ECG generation and downstream cardiovascular disease classification, proving its ability to generate ECGs that are both signal-faithful and physiologically plausible under the ECG-to-PPG hemodynamic pathway

eess.SP · cs.AI · cs.LG

版本更新 · v3arXiv:2606.07665

AgentCompile: An LLM-Guided Compiler for Direct CUDA Inference

Xuanzhe Li, Ziyan Weng, Zhiyu Zhu, Junhui Hou

原文摘要

Transformer inference increasingly relies on specialized compiler and runtime support, while recent LLMs can generate nontrivial CUDA kernels. However, unconstrained generation guarantees neither correctness nor performance. We present \textsc{AgentCompile}, an LLM-guided CUDA inference compiler that combines two complementary uses of LLMs. First, the LLM provides advisory metadata for compiler-derived region summaries and bounded candidate spaces. The compiler then instantiates template-based CUDA candidates, validates correctness, selects implementations by measured latency, and falls back when specialization is unsupported or unprofitable. Second, under compiler-defined contracts, the LLM directly generates five classes of decode-critical kernels to accelerate inference, prompted by distilled optimization principles. \textsc{AgentCompile} integrates these kernels into a serving runtime with paged KV cache, continuous batching, preemption, chunked prefill, and bucketed full-step CUDA Graph replay. Across six evaluated model families, \textsc{AgentCompile} achieves speedups of \textbf{2.23--6.98$\times$} over PyTorch eager for single-request generation, and \textbf{1.04--1.16$\times$} over vLLM for both single-request generation and multi-request serving. Our code is publicly available at https://github.com/veneno1213822/AgentCompile.

cs.PL · cs.AI

版本更新 · v2arXiv:2605.12492

Pion: A Spectrum-Preserving Optimizer via Orthogonal Equivalence Transformation

Kexuan Shi, Hanxuan Li, Zeju Qiu, Yandong Wen, Simon Buchholz, Weiyang Liu

原文摘要

We introduce Pion, a spectrum-preserving optimizer for large language model (LLM) training based on orthogonal equivalence transformation. Unlike additive optimizers such as Adam and Muon, Pion updates each weight matrix through left and right orthogonal transformations, preserving its singular values throughout training. This yields an optimization mechanism that modulates the geometry of weight matrices while keeping their spectral norm fixed. We derive the Pion update rule, systematically examine its design choices, and analyze its convergence behavior along with several key properties. Empirical results show that Pion offers a stable and competitive alternative to standard optimizers for both LLM pretraining and finetuning.

cs.LG · stat.ML

版本更新 · v2arXiv:2605.21160

FISolver: Data-Driven Discovery of First Integrals via Backward Generation and Guided Reinforcement Learning

Jingfeng Zhong, Zhengxiang Liu, Zhijie Wang, Shuai Li

原文摘要

The discovery of first integrals is of profound scientific significance for understanding physical conservation laws in dynamical systems. However, existing symbolic computation systems and Large Language Models (LLMs) struggle with this task due to the scarcity of high-quality training data and the reliance on mathematical intuition for finding solutions. This paper introduces FISolver, an LLM-based solver designed to bridge this gap. First, we propose a novel "Backward Generation" algorithm that systematically constructs large-scale datasets of (differential equations, first integrals) pairs by deriving equations from sampled integrals, effectively overcoming the data scarcity bottleneck. Second, we perform supervised fine-tuning on a compact mathematical model and further enhance its capabilities using reinforcement learning with a Levenshtein Distance-based shaped reward function. Additionally, we introduce data synthesis and blending techniques that enable effective adaptation to specific hard instances with sparse examples. Experiments demonstrate that FISolver, with significantly lower computational cost, substantially outperforms larger mathematical LLMs and commercial solvers like Mathematica on complex benchmarks, establishing a new data-driven paradigm for automated mathematical discovery.

cs.LG

新论文 · v1arXiv:2611.11177

When Are Nearby Experts Composable? Cross-Task Model Merging in Neural Thickets

Suxin Ji, Hungtao Wan, Mingjun Liu, An Zhang

原文摘要

Random perturbations around a shared checkpoint can produce experts for distinct tasks, but shared origin does not ensure that their gains survive composition. We formulate expert-pair selection for joint base-relative retention, measured by strict joint success and worst-task gain with unconditional abstention accounting. An exact finite-difference decomposition and an arbitrarily small orthogonal counterexample show why proximity and orthogonality alone are insufficient. We instantiate this formulation with quality-constrained spectral selection, a fixed-budget framework combining cross-task screening, layerwise pair geometry, separate validation, and Base fallback. Across six checkpoints, 21 task pairs, and five independent perturbation pools, the procedure improves strict joint success over Top-1 averaging throughout and leads the four-method model-scale comparison on four of six checkpoints. For the five models with at least 1.5B parameters, matched quality-only, global-cosine, and spectral ranking attain 49.1%, 50.5%, and 53.1% joint success. Under this matched protocol, the spectral selector also yields the highest worst-task gain and Weak Pareto rate and the lowest regression rate. Mean worst-task gain reaches +0.61 percentage points, while 17.1% regression and 13.0% abstention show that composability remains conditional. Project page: https://anonymous.4open.science/r/Thickets-Merge/.

cs.AI · cs.CL · cs.LG

新论文 · v1arXiv:2611.11174

What Changed in Engineering Writing After Generative AI Chat Assistants: Evidence from 1.8 Million Articles

Taner Cokyasar

原文摘要

This study asks what changed in engineering articles after conversational language models became publicly available on November 30, 2022, and develops methods for measuring such change in a field without a uniform abstract index. It assembled 1,839,962 articles published from 2015 to 2025 in 256 engineering journals, tracked twelve measures of wording, style, and article structure, and compared each with the projection of its own pre-2023 trend. Building the monthly series showed that records dated only by year fall on January 1 and create false January peaks unless removed. In abstracts, 31 words associated with language model output appeared 82% more often than projected (55.4 against 27.0 per 10,000 words in 2025), while four control words of the same formal register fell 16%. Words that soften a claim, such as may, fell 13%, words that strengthen one, such as clearly, rose 20%, and long words rose 11%. Author counts, reference lists, page counts, and publication volume stayed within 4% of trend. The change appears in all fourteen subject categories, and false release dates, dropping any one journal or word, and word lists chosen from the data support it. A random sample of 12,866 full texts from the same corpus, including subscription articles and weighted back to it, shows the same words rising 99% in article bodies. Statements disclosing AI writing assistance, measured apart from mentions of language models, went from none to 3.7% in 2025, four in five of them at one publisher. The design is descriptive, not causal.

cs.DL · cs.CL

版本更新 · v3arXiv:2610.02068

Sequential Capacity of Quantum Processes with Finite Memory

Yibin Wang

原文摘要

How complex can the responses of a quantum process become as it runs longer with fixed internal memory? We measure this complexity by sequential response capacity, the depth of an adaptive tree of experiments whose acceptance probabilities separate possible processes by a prescribed gap. Each experiment uses a fresh complete run, and one fixed process must realize every response along a path. For any fixed common visible dimension of at least two and internal memory cap, we prove that capacity has order $K\log((K+1)/γ)$ for $K$ transitions per run and probability gap $0<γ\leq1$. Time-dependent single-qubit phase channels without internal memory already attain the fixed-gap $K\log K$ growth, realizing each path with zero-or-one response probabilities. Under the same tester permissions, classical stochastic processes that measure in a fixed basis at every transition have only linear capacity at fixed dimensions and gap. For phase sequences selected by a classical address stored inside the process, we then quantify how known independent Pauli noise changes this logarithmic enhancement. With ideal tester controls and weak residual phase noise after correction, we prove matching capacity bounds at a fixed small gap. At fixed address size and fixed positive residual noise, the logarithmic enhancement saturates once the phase-sequence length exceeds the inverse noise scale, and capacity then grows linearly with sequence length.

quant-ph · cs.LG

版本更新 · v2arXiv:2605.12190

Information-Theoretic Generalization Bounds for Sequential Decision Making

Futoshi Futami, Masahiro Fujisawa

原文摘要

Information-theoretic generalization bounds based on the supersample construction are a central tool for algorithm-dependent generalization analysis in the batch i.i.d. setting. However, existing supersample conditional mutual information (CMI) bounds do not directly apply to sequential decision-making problems such as online learning, streaming active learning, and bandits, where data are revealed adaptively and the learner evolves along a causal trajectory. To address this limitation, we develop a sequential supersample framework that separates the learner filtration from a proof-side enlargement used for ghost-coordinate comparisons. Under a row-wise exchangeability assumption, the sequential generalization gap is controlled by sequential CMI, a sum of roundwise selector--loss information terms. We also establish a Bernstein-type refinement that yields faster rates under suitable variance conditions. The resulting bounds specialize to online learning, streaming active learning with importance weighting, and stochastic multi-armed bandits.

stat.ML · cs.LG

新论文 · v1arXiv:2611.11172

Do Benign-Trained Hidden-State Probes Detect Tool Errors Under Adversarial Conditions?

Bibek Bhandari, Kshitij Lingthep

原文摘要

Although hidden-state probes efficiently monitor model operation, it remains unclear whether probes trained on benign tool use remain useful for detecting incorrect actions under adversarial conditions. In this research, we assess this problem from the perspective of operational tool-action correct- ness. we use four AgentDojo suites, four conditions, and three models: Qwen2.5-7B-Instruct, Qwen2.5-14B-Instruct, and GLM- 4.6V-Flash (9B). We perform a five-fold, task-grouped out-of-fold (OOF) evaluation for each model. We train step-specific logistic- regression probes only on benign and non-defended trajectories and evaluate them on held-out trajectories for benign, prompt- injection, system-override, and tool-poisoning conditions. We compare our hidden-state probe to mean tool-call-token entropy, negative mean tool-call-token log-probability, and self-consistency uncertainty. The paired tests highlight six significant differences after Holm correction. All of the tests involve Qwen2.5-14B- Instruct under the system-override condition, with all three scalar uncertainty metrics obtaining higher area under the receiver operating characteristic curve (AUROC) and average precision (AP) than the hidden-state probe. These results suggest that benign-trained hidden-state probes should not be assumed to reliably detect operational tool-action errors under adversarial conditions.

cs.CR · cs.AI · cs.CL

新论文 · v1arXiv:2611.11170

ClusLoad: Cluster-Guided Model Sharing for Scalable Distribution Transformer Load Forecasting

Fangzhou Lin, Guoshun He, Yi Wang, S. Supraja

原文摘要

Large-scale device-level load forecasting for distribution transformers is challenged by substantial cross-device heterogeneity and the deployment burden of maintaining device-specific forecasting models. Existing approaches typically rely either on device-specific models, which are difficult to scale to large transformer populations, or on global models, which reduce deployment complexity but may overlook heterogeneous load patterns across devices. To address this trade-off, this study develops a trend-clustered forecasting framework that enables model sharing among transformers with similar temporal behaviors. Representation Learning for Time Series using Time-Embeddings (T-Rep) is employed to learn compact temporal representations of transformer load series, which are subsequently grouped using a Gaussian mixture model (GMM). Representative transformers are sampled within each cluster to train cluster-specific Patch Time Series Transformer (PatchTST) models while retaining device-level predictions. The framework is evaluated using real-world 15-min operational data from nearly one thousand distribution transformers. The proposed framework reduces mean absolute error (MAE) by approximately 20% relative to the direct PatchTST baseline, achieves a high-load warning accuracy of 95.66%, while requiring only seven cluster-specific forecasting models. These results demonstrate that behavior-based device organization provides an effective balance between forecasting accuracy, deployment scalability, and risk-oriented operational support for distribution transformer management.

cs.LG

新论文 · v1arXiv:2611.11169

Map2SLAM: From Streaming Map Prediction to Real-Time SLAM

Jian Gao, Lin-Zhuo Chen, Yihang Chen, Jiagang Chen, Jiacheng Dong, Xun Cao, Nan Xue, Yinghao Xu 等 9 位作者

原文摘要

Streaming 3D foundation models (3DFMs) estimate camera poses and dense geometry online, but they fall short of SLAM: their predictions are fixed once emitted, so loop closures cannot correct accumulated drift. With such models already providing strong geometric capability, a central question for SLAM becomes how to schedule their inference and how to keep its results as revisable state. We present Map2SLAM, which keeps LingBot-Map frozen, trains only a lightweight retrieval head, and builds SLAM on the model's inference interface, turning its predictions into observations of an external persistent SLAM state. The front-end tracks every incoming frame with the model's causal streaming inference and decides which frames are written to the persistent state as keyframes. The back-end asynchronously decides when and which past frames to re-observe, re-running the model's joint inference over them with fresh context; verified loop observations correct the trajectory online, and segment observations refine dense geometry after the sequence. All invocations share a single frame encoder pass per image, whose cached features also drive loop retrieval, so frequent re-invocation incurs no additional encoding cost. Map2SLAM achieves state-of-the-art performance on KITTI, VBR, and Oxford Spires, reducing mean ATE by over 40% compared with the best uncalibrated baselines, while maintaining real-time tracking at over 28 FPS at a resolution of $518\times154$ on an NVIDIA RTX 5090D GPU. Please visit our project page at https://robbyant-research.github.io/Map2SLAM/.

cs.CV

新论文 · v1arXiv:2611.11165

The Race Is Decided Early! A Kernel Law Predicts Lock-In in Majority-Vote Test-Time RL

Jaeho Hwang, Sehong Park, Daejin Choi, Uiwon Hwang

原文摘要

Test-time reinforcement learning with majority-vote rewards trains a language model on unlabeled questions by rewarding the samples that agree with its most frequent answer. During training, each question locks into one answer, on hard questions often a wrong one, but which answer it locks into is known only after training. In this paper, we show that this outcome is decided early, in a short race driven by sampling noise between the answers that are close at the start, and we derive the probability of each outcome. With a separate logit for each answer, the runner-up wins with a normal tail probability of the initial gap, scaled by an explicit noise constant. In a network, however, the answer logits depend on shared parameters, and through the kernel of these parameters the updates of the trailing answers also change the gap of the two leaders. This spillover shifts the boundary between the starts won by each leader, and a closed form computes the shifted probability from a kernel probe and the start logits. In LoRA experiments with three models from two families, predictions made before training with the kernel frozen at its start value forecast which answer each question locks into better than a logistic model refitted on the outcomes, although they use no fitted constants. The closed form matches these predictions on the runs in which a check before training finds that the two leaders stay above the other answers, and it explains why a law that ignores the spillover needs a strongly inflated step.

cs.LG

新论文 · v1arXiv:2611.11164

Tutorial: Vision-Based Formation Control with Differential-Drive Robots

Christian Marowski, Byung-Cheol Min

原文摘要

This tutorial presents a step-by-step introduction to multi-robot formation control using differential- drive robots, an overhead camera, and Python. ArUco markers are used to estimate robot positions and orientations, while desired pairwise displacement vectors define a circular formation. By comparing measured and desired relative positions, the controller computes movement vectors that are converted into differential-drive wheel commands, with basic proximity-sensor-based obstacle avoidance. The tutorial guides readers through hardware and software setup, robot pose estimation, formation geometry, feedback control, system integration, and formation-error evaluation. Motivated by the need to bridge the gap between theoretical understanding and practical implementation in robotics education, we emphasize how mathematical concepts are translated into coordinated behaviors on physical robots. Although the implementation uses a specific robotic platform, the underlying perception and formation-control principles can be adapted to other differential-drive robots and simulation environments. The accompanying open-source GitHub repository provides the Python implementation, setup instructions, and demonstrations to support hands-on learning and further exploration of multi-robot systems.

cs.RO

版本更新 · v2arXiv:2401.07174

On the (In)Compatibility between Group Fairness and Individual Fairness

Shizhou Xu, Thomas Strohmer

原文摘要

We study the compatibility between utility-optimized statistical parity and individual fairness. While individual fairness seeks to treat similar individuals similarly, optimal statistical parity aims to provide similar treatment to individuals who share relative similarity within their respective sensitive groups. Although both fairness perspectives are desirable, they often conflict in practical applications. Our goal in this work is to analyze the existence of this conflict and its potential solution. In particular, we establish sufficient (sharp) conditions for the compatibility between the optimal (post-processing) statistical parity $L^2$ learning and the ($K$-Lipschitz or $(ε,δ)$) individual fairness requirements. When a conflict arises, we first relax the optimal statistical parity solution to the Pareto frontier, representing the optimal trade-off between $L^2$ error and statistical disparity, and then examine its compatibility with individual fairness. Our analysis identifies regions along the Pareto frontier that satisfy individual fairness constraints. Additionally, we provide individual fairness guarantees for the composition of a trained model with the optimal post-processing step, enabling practitioners to assess the compatibility of post-processed models. This provides practitioners with a principled approach to achieving Pareto-optimal statistical parity while maintaining individual fairness constraints.

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

版本更新 · v2arXiv:2602.08315

Reusable Conditional Resampling via Flow Matching for Constraint-Based Causal Discovery

Shunyu Zhao, Yanfeng Yang, Shuai Li, Kenji Fukumizu

原文摘要

Constraint-based causal discovery requires many conditional independence (CI) tests. Generative CI tests are attractive in nonlinear and high-dimensional settings because they can model complex conditional distributions, but often suffer from high per-test costs and limited reusability across query-dependent conditional resampling tasks in graph search. We propose a generative nonlinear CI testing and graph search framework for PC-style causal discovery. We introduce Langevin-RePaint for conditional imputation. Building on Langevin-RePaint and joint flow matching modeling, we propose the Flow Matching based Conditional Independence Test (FMCIT), which reformulates generative CI testing from query-specific conditional modeling into a reusable conditional resampling framework. We establish theoretical guarantees for FMCIT's type-I error control. FMCIT reuses a single trained generative model to generate randomized copies throughout graph search. We then introduce GPC-FMCIT, which embeds FMCIT into a guided PC pipeline with screening, guidance, refinement, and orientation. By using low-cost screening to shrink the search space, constructing edge-specific candidate conditioning sets from local graph structure, and invoking FMCIT only in a budget-controlled refinement stage, GPC-FMCIT reduces both the deployment cost of individual nonlinear CI queries and the overall query complexity. On synthetic nonlinear structural equation models, GPC-FMCIT improves CPDAG recovery over PC-stable baselines and requires far fewer FMCIT queries than direct FMCIT-based PC search, and on hESC gene-expression data it yields smaller graphs than PC/FisherZ in a descriptive comparison. Overall, our results suggest that, through the joint design of reusable conditional resampling and controlled graph search, generative nonlinear CI testing can become a practical component of PC-style causal discovery.

cs.LG · stat.ML

版本更新 · v2arXiv:2611.01472

Causal Optimal-Transport Attention: Positional Priors and Length Extrapolation

Ming Lian

原文摘要

Causal masking obstructs the column balancing used by optimal-transport (OT) attention. We study an unbalanced OT operator that uses only current and earlier rows and characterize its induced positional prior. For bounded scores and any fixed balancing strength below one, its fixed point assigns vanishing mass to every fixed window as context grows. With constant scores, the prior has an exact scale-invariant form. We classify positional encodings by whether they prevent this dilution. We also derive finite-length window-mass bounds for log-distance priors with exponents near one. Preregistered experiments use 25M- and 100M-parameter language models. The OT operator improves loss extrapolation over softmax, while exploratory comparisons favor an explicit distance bias at a fraction of the cost. Changing only the bias beyond the training length moves long-context loss in the predicted direction on all 30 tested checkpoints. During training, learned exponents approach one even when constrained above it. A margin chosen from prior calculations controls distant-mass growth in the tested setting.

cs.LG

新论文 · v1arXiv:2611.11156

Federated learning for remote IoT over LPWAN: Preliminary insights from structural health monitoring

Lakshmiprasanna Bandaru, Anshika Singh, Tarutal Ghosh Mondal, T. Jothi Saravanan, Siddhartha S. Borkotoky

原文摘要

Realizing federated learning (FL) in remote regions lacking reliable cellular infrastructure is challenging, as it requires dependable communication among participating devices. Low-power wide-area networks (LPWANs) offer an attractive communication solution for such scenarios. However, their limited data rates necessitate careful investigation of the communication-learning trade-offs and mechanisms to reduce communication overhead. This paper presents an investigation of the Long Range (LoRa) LPWAN technology for FL-based structural health monitoring (SHM), a representative remote IoT application. We consider a SCAFFOLD-based FL framework for multi-class anomaly detection and analyze the latency-accuracy trade-off. We also examine strategies for allocating the LoRa spreading factor (SF) during model-update exchange. Numerical results show that, with appropriate SF allocation, LoRa-supported FL-SHM can achieve competitive learning accuracy. In particular, jointly accounting for link distances and clients' dataset sizes when selecting the SF provides a favorable balance between convergence performance and communication latency. These preliminary findings offer useful insights into the design of FL systems over LPWANs for remote IoT deployments.

cs.NI

版本更新 · v2arXiv:2609.39383

From Search to Signal: Search-Value Credit for Evolutionary Automatic Heuristic Design

Yilun Yuan, Tianyu Zhou, Zhenzhou Tang

原文摘要

Large language models generate candidate programs for automatic heuristic design, while evolutionary search evaluates and selects them to guide further generation. Online post-training uses rewards from candidate evaluations to adapt the generator. Retained programs can also guide later generation as parents. This motivates rewards that reflect their reuse opportunities beyond immediate fitness. We propose Search-value credit (SVC), which constructs response-level rewards from actual admission to the retained set and a short-term parent-exposure proxy. Admission determines reward eligibility; the proxy weights eligible responses by reuse opportunities under existing parent-selection rules. Rewards are computed after candidate evaluation, without evaluating descendants. SVC retains the search and learning procedures of the Co-Evolution of Algorithms and Language Model (CALM) framework. Across four combinatorial optimization tasks with the same base model and response budget, SVC achieves the best mean final search performance on three tasks among six conditions. Under identical prompts and parents on traveling salesman and capacitated vehicle routing tasks, SVC-trained generators yield a higher mean proportion of responses whose programs outperform the best prompting parent than those trained with CALM's native reward. These findings support reward construction using search retention and selection information.

cs.LG · cs.AI · cs.NE

新论文 · v1arXiv:2611.11152

Full Fine-Tuning is not the Problem: Why Adam Fails and SGD Succeeds in Few-Shot CLIP Adaptation

Nairouz Mrabah, Ismail Ben Ayed, Eric Granger

原文摘要

Few-shot CLIP adaptation is often treated as a parameterization problem. Full fine-tuning is assumed to overfit, so parameter-efficient fine-tuning (PEFT) methods are preferred. In this paper, we show that this conclusion conflates parameterization with optimization. Across 11 datasets, 3 CLIP backbones, and 5 shot levels, dense full fine-tuning with plain SGD outperforms representative PEFT methods under the reported evaluation protocol, whereas Adam/AdamW collapses. We trace this collapse to unreliable support-set preconditioning. The few-shot second moment systematically underestimates the corresponding full-data statistic, already at initialization. Adam's inverse-square-root normalization converts this error into an oversized adaptive update. Matching Adam's first-step update budget to SGD resolves most of the collapse, whereas numerator-side alignment does not explain the failure. Shampoo and SOAP also fail, so richer preconditioning alone does not resolve the problem. Theory formalizes how few-shot estimation error is amplified into unsafe updates. SGD succeeds because it avoids unreliable preconditioners and stays close to pretrained CLIP. Interpolation probes show low-loss connections along tested directions, and curvature probes show favorable directional curvature. These results identify optimizer-induced preconditioning, not dense full fine-tuning itself, as the main source of failure in few-shot CLIP adaptation.

cs.LG · cs.CV

新论文 · v1arXiv:2611.11151

Fast Approximate $\ell_p$ Chamfer Distance via Lopsided Embeddings and Structured JL

Ying Feng, David P. Woodruff

原文摘要

For two $d$-dimensional point sets $A, B$ of size $n$, the Chamfer distance from $A$ to $B$ is defined as $\text{CH}(A,B)=\sum_{a \in A} \min_{b \in B} \mathsf{dist}(a, b)$, where $\mathsf{dist}$ is some underlying distance measure. We present efficient algorithms for approximating the Chamfer distance under the $\ell_p$ norm for $1 < p \le 2$. For the general case $1 < p < 2$, we utilize lopsided $\ell_p$ to $\ell_1$ embeddings with weak guarantees. We show that they are sufficient for preserving the Chamfer distance. In the high-dimensional regime, we use Fast Matrix Multiplication techniques to speed up the lopsided embeddings. These lead to $O(nd\cdot \mathrm{poly}(\log \log n, \log(1/\varepsilon))/\varepsilon^2)$ total time. For the specific Euclidean case ($p=2$), we leverage the Fast Johnson-Lindenstrauss Transform based on Toeplitz matrices and re-analyze the previous $\ell_1$-specific Chamfer algorithm in $\ell_2$. These achieve a runtime matching the recent state-of-the-art $\ell_1$ result of $O(nd(\log \log n + \log (1/\varepsilon))/\varepsilon^2)$, improving upon the previous $O(nd \log n/\varepsilon^2)$ bound for $\ell_2$. We also give additional results for the angular distance and upper and lower bounds in the streaming setting.

cs.DS · cs.LG

版本更新 · v2arXiv:2605.05709

Conceal, Reconstruct, Jailbreak: Exploiting the Reconstruction-Concealment Tradeoff in MLLMs

Md Farhamdur Reza, Richeng Jin, Tianfu Wu, Huaiyu Dai

原文摘要

Intent-obfuscation-based jailbreak attacks on multimodal large language models (MLLMs) transform a harmful query into a concealed multimodal input to bypass safety mechanisms. We study these attacks through the lens of a reconstruction-concealment tradeoff: the transformed input must sufficiently obscure harmful intent while preserving enough information for the victim model to recover the underlying request. Through a reconstruction and concealment analysis of representative black-box methods, we find that existing transformations struggle to balance this tradeoff, limiting their effectiveness. In contrast, we show that character-removed variants, constructed by randomly removing characters from the original query, achieve a better balance, motivating their use as the basis for our attack construction. Building on this observation, we propose concealment-aware variant construction, which selects character-removed variants with low harmful keyword/phrase alignment and high mutual diversity, and instantiates them through five prompting strategies that distribute the transformed information across text and image channels. We further introduce keyword/phrase-related distractor images that depict the harmful concept in diverse contexts, providing more effective distraction than generic distractor images. Experiments across diverse closed-source and open-source MLLMs show that the proposed strategies substantially outperform the evaluated baselines. Code and reproduction instructions are available at https://github.com/Farhamdur/CRJ.

cs.AI