跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

统计 2026-11-16 02:20 — 2026-11-17 02:20(北京时间) · 点击数字查看对应简报;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:2605.19919

Beyond Action Residuals: Real-World Robot Policy Steering via Bottleneck Latent Reinforcement Learning

Dongjie Yu, Kun Lei, Zhennan Jiang, Jia Pan, Huazhe Xu

原文摘要

Pretrained imitation policies have become a strong foundation for robot manipulation, but online adaptation can further improve policy performance within their pretrained behavioral support. A central question is therefore how reinforcement learning (RL) should adapt policies after offline pretraining. Existing lightweight methods commonly apply residual corrections directly in action space. We investigate how the steering interface affects online RL. In this work, we propose Z-Perturbation Reinforcement Learning (ZPRL), an approach that steers pretrained policies through a compact bottleneck latent rather than through policy weights or output actions. Building on an offline-learned bottleneck policy interface introduced by previous work, ZPRL turns this representation into an online RL control space through reward-driven residual perturbations while freezing the pretrained policy. We instantiate ZPRL on flow-matching policies and evaluate it on eight simulation tasks and four real-world tasks. Across diverse manipulation settings, ZPRL improves sample efficiency with competitive or better final performance. In the real world, ZPRL improves the average success rate on four tasks by 33.7 percentage points over imitation base policies. Our qualitative and quantitative results also indicate that ZPRL combines task success with smooth actions without explicit temporal filtering or smoothness regularization. These results suggest that a compact, task-aligned bottleneck latent provides an effective interface for online RL adaptation. Videos and code can be found at https://manutdmoon.github.io/ZPRL/.

cs.RO

版本更新 · v3arXiv:2602.11042

Characterizing the Trainability of Instantaneous Quantum Polynomial Circuit Born Machines

Kevin Shen, Susanne Pielawa, Vedran Dunjko, Hao Wang

原文摘要

Instantaneous Quantum Polynomial Circuit Born Machines (IQP-QCBMs) have been proposed as quantum generative models that combine a classically tractable training objective - based on the maximum mean discrepancy (MMD) - with a potential quantum advantage motivated by sampling-complexity arguments. While recent works have explored this model across various application domains, fundamental questions remain: does the model suffer from exponentially vanishing loss gradients, known as the barren plateau problem - a pervasive obstacle in quantum machine learning - and how do regimes of trainability relate to regimes of possible quantum advantage? Here, we address both questions analytically. To study trainability, we derive closed-form expressions for the variances of the partial derivatives of the MMD loss function and establish general upper and lower bounds. We explicitly characterize how trainability depends on the generator set and the spectrum of the chosen kernel, identifying regimes in which low Hamming-weight kernels avoid exponential gradient suppression under structured topologies. Regarding potential quantum advantage, we reformulate the anti-concentration property in terms of the same generator-set quantities that govern trainability, enabling a unified analysis. We show that sparse IQP architectures can produce classically intractable output distributions while simultaneously remaining trainable, at least at lower-weight frequencies. Our analytical results corroborate the numerical observations of prior work and provide principled guidelines for designing scalable IQP-QCBM architectures.

quant-ph · cs.LG

版本更新 · v3arXiv:2510.04532

More Than Meets the Eye? Uncovering the Reasoning-Planning Disconnect in Training Vision-Language Driving Models

Xurui Song, Shuo Huai, JingJing Jiang, Jiayi Kong, Jun Luo

原文摘要

Vision-Language Model (VLM) driving agents promise explainable end-to-end autonomy by first producing natural-language reasoning and then predicting trajectory planning. However, whether planning is causally driven by this reasoning remains a critical but unverified assumption. To investigate this, we build DriveMind, a large-scale driving Visual Question Answering corpus with plan-aligned Chain-of-Thought (CoT), automatically generated from nuPlan. Our data generation process converts sensors and annotations into structured inputs and, crucially, separates priors from to-be-reasoned signals, enabling clean information ablations. Using DriveMind, we train representative VLM agents with Supervised Fine-Tuning and Group Relative Policy Optimization and evaluate them with nuPlan's metrics. Our results, unfortunately, indicate a consistent causal disconnect in reasoning-planning: removing ego/navigation priors causes large drops in planning scores, whereas removing CoT produces only minor changes. Attention analysis further shows that planning primarily focuses on priors rather than the CoT. Based on this evidence, we propose the Reasoning-Planning Decoupling Hypothesis, positing that the training-yielded reasoning is an ancillary byproduct rather than a causal mediator. To enable efficient diagnosis, we introduce a novel, training-free probe that measures an agent's reliance on priors by evaluating its planning robustness against minor input perturbations. In summary, we provide the community with a new dataset and a diagnostic tool to evaluate the causal fidelity of future models.

cs.AI · cs.CL · cs.RO

新论文 · v1arXiv:2611.10760

ConwayNet: Interpretability, Activation Coherence, and Noise Resilience via a Game-of-Life-Inspired Lateral Inhibition in Artificial Neural Networks

Yair Cohen, Scott M. Gilmore

原文摘要

Deep neural networks achieve universal function approximation by stacking interconnected nonlinearities, but as a consequence they are sensitive to noise and resist mechanistic interpretation. In contrast, the local update rules of cellular automata, such as Conway's Game of Life, give rise to not merely interpretable but programmable dynamics. We explore a bridge between these worlds: a lateral inhibition in neural networks based on continuous Game-of-Life rules that derives inhibitory and excitatory responses from the layer input and blends them into the activation map in a state-conditioned way. The mechanism is differentiable and architecture-agnostic, and its regulation is imposed rather than learned: the rule's parameters are fixed and are not optimised, while the rule's values and derivatives shape training throughout the network. Wired into fully connected, convolutional, wide-residual and graph convolutional networks, it gives rise to several properties. Activation maps become coherent across space, depth and seeds, with coarse structure persisting through depth while fine detail is renewed at every layer. The co-activation graph of the hidden units departs from an Erdős--Rényi random graph: it is laid out on the image and its giant component grows in steps, as in a spatial graph. Networks started from nearly identical initialisations, under label noise, disagree on thirty times fewer test images. Saliency maps rest on the object rather than the background, and resilience to pixel noise not seen in training is substantially improved.

cs.LG

新论文 · v1arXiv:2611.10758

Unified Framework with Convex-Concave Decomposition and Sparse Topological Learning for Skeleton-Based Clinical Assessment

Quang-Anh N. D., Duc Pham Minh, Minh-Anh Nguyen, Hien Quang Kha, Manh Hung Ha, Minhhuy Le, Oscal Tzyh-Chiang Chen

原文摘要

Skeleton-based rehabilitation assessment faces fundamental limitations of fixed topologies which cannot model compensatory patterns, uniform joint treatments overlook clinically important deviations, and lack of geometric understand- ing. We propose Concave-Convex Decomposition Sparse Topological Graph Convolutional Network (CC2-STG), a multi-stream model that combines geo- metric decomposition, sparse feature learning, and adaptive topology. Our framework decomposes joint relationships into complementary convex-concave distance functions to model both local and global movement characteristics, with sparse regularization with proximal optimization selecting clinically relevant geo- metric features, while multi-scale topological analysis captures non-anatomical joint dependencies in pathological movements. Experiments on the KiMoRe and UIPRMD datasets validate the effectiveness of our approach, achieving state-of-the-art performance on clinical pathological movement assessment.

cs.CV · cs.AI

版本更新 · v4arXiv:2505.05848

RefRef: A Dataset and Benchmark for Reconstructing Refractive and Reflective Objects

Yue Yin, Enze Tao, Weijian Deng, Dylan Campbell

原文摘要

Modern 3D reconstruction and novel view synthesis approaches have demonstrated strong performance on scenes with opaque, non-refractive objects. However, most assume straight light paths and therefore cannot properly handle refractive and reflective materials. The lack of datasets specialized for these effects has impeded efforts to fairly and thoroughly evaluate performance and thereby make progress in this domain. Most existing datasets focus on opaque scenes, while those targeting refractive objects are often limited to thin glass with negligible ray bending, untinted single-material objects, or backgrounds treated as infinitely-distant, leaving key failure modes under strong refraction untested. To address this gap, we introduce the RefRef dataset. It contains 150 synthetic and 60 real scenes spanning varying levels of geometric complexity and diverse background types that expose the limitations of existing methods. For the purpose of benchmarking, we also provide an oracle method that, given the object geometry and refractive indices, calculates accurate light paths for neural rendering, and a simple two-stage baseline that relaxes these assumptions. We evaluate these against state-of-the-art methods and show that the task is far from solved.

cs.CV

新论文 · v1arXiv:2611.10756

Mirage: Provable Defense Against LLM KV Cache Timing Side Channels with Topology-Aware Isolation

Xiaobei Yan, Tianwei Zhang

原文摘要

Large Language Models (LLMs) are increasingly deployed as shared multi-tenant services, relying on advanced optimizations like KV cache and prefix sharing to improve throughput and reduce latency. However, these optimizations introduce a critical vulnerability: attackers can exploit time-to-first-token (TTFT) variations between KV cache hits and misses to infer sensitive prompt tokens via prefix-matching side-channel attacks. Existing defenses indiscriminately restrict cross-tenant cache sharing, which incurs prohibitive performance overhead and negates the fundamental efficiency benefits of the KV cache. We propose Mirage, a topology-aware emission obfuscation framework that provably bounds timing leakage without sacrificing the performance gains of cache sharing. Instead of stalling the GPU or forcing redundant recomputations, Mirage delays token emission at the gateway so the attacker observes a natural cache miss distribution, while the GPU seamlessly continues serving other requests at full speed. Mirage uses a Privacy Odometer that persistently tracks the topological novelty of prefix fan-out expansions to distinguish aggressive probing from benign traffic. Once a prefix exceeds a safety threshold, Mirage engages a two-phase policy that uses a dynamic estimator to pad the TTFT to a calibrated cache-miss baseline. On a 500-sample public corpus across three models, Mirage suppresses the timing side-channel to near the random-guessing floor, while maintaining a significantly lower TTFT than defense baselines. We further show that Mirage withstands a strong adaptive adversary and the same principle carries over to semantic caching layers.

cs.CR · cs.AI

版本更新 · v5arXiv:2510.13068

NeuroRVQ: Multi-Scale Biosignal Tokenization for Generative Foundation Models

Konstantinos Barmpas, Na Lee, Dimitrios Chalatsis, William Raftery, Yannis Panagakis, Dimitrios A. Adamos, Nikolaos Laskaris, Alexandros Koliousis 等 10 位作者

原文摘要

Biosignals such as electroencephalography (EEG), electrocardiography (ECG), and electromyography (EMG) encode physiological activity across multiple temporal and spectral scales, yielding representations that are rich but challenging for machine learning. Foundation models trained to predict masked signal tokens have shown promise in learning generalizable biosignal representations, yet their performance depends on the tokenizer's ability to preserve high-frequency dynamics and reconstruct signals with high fidelity. We introduce NeuroRVQ, a modality-adaptive biosignal tokenizer family designed for high-fidelity signal reconstruction. To capture the full frequency spectrum, NeuroRVQ decomposes biosignals into frequency-specific representations via multi-scale temporal convolutions, each encoded into hierarchical RVQ codebooks to preserve high-frequency detail, combined with a novel phase-aware training loss that respects the circular topology of Fourier phase. By tuning the temporal resolution, number and size of temporal kernels and RVQ depth, this design adapts to the spectro-temporal characteristics of each biosignal modality. To validate that tokenizer quality drives downstream performance, we train a simple masked-token foundation model for each modality (NeuroRVQ-FM) using the corresponding NeuroRVQ tokenizer. The NeuroRVQ-FM family achieves competitive or superior downstream performance compared to existing modality-specific foundation models, demonstrating that high-fidelity tokenization is a critical factor for effective biosignal modeling.

cs.LG · cs.AI · cs.HC

新论文 · v1arXiv:2611.10751

Constrained Look-ahead Guidance for Interference-Aware Flow Editing

Doudou Zhang, Qi Chen

原文摘要

Diffusion and flow models enable powerful generative modeling, but controlled editing remains challenging due to the need to balance source fidelity and edit compliance along the generative trajectory. We propose a principled, inversion-free framework for flow-based image editing from a trajectory centric perspective. Rather than relying on inversion or heuristic guidance, we introduce a one-step look-ahead mechanism that evaluates the effect of candidate updates on both edit and fidelity rewards estimated via denoising, and adjusts the current update based on this evaluation. At each step, our method applies reward-driven corrections guided by the look-ahead evaluation under an explicit fidelity constraint, resulting in stable and coherent trajectory evolution. This look-ahead design mitigates gradient interference between edit and fidelity objectives by anticipating their interaction in future states, leading to improved trade-offs. Experiments demonstrate that the proposed approach achieves stronger semantic edits while better preserving source content compared to existing strong baselines.

cs.LG · cs.CV

新论文 · v1arXiv:2611.10750

AERO: Adaptive Ensemble-Disagreement Routing for Oracle Feedback in Sample-Efficient Online RLHF

Shrey Singhal, Nannan Huang, Haytham M. Fayek

原文摘要

Aligning Large Language Models (LLMs) with human preferences via Reinforcement Learning from Human Feedback (RLHF) has driven substantial improvements across a wide range of tasks, but the cost of acquiring preference labels remains the dominant bottleneck in the alignment pipeline. While many recent alignment methods improve sample efficiency through active exploration over candidate responses, they typically query the oracle uniformly across contexts, even for contexts where the learned reward estimates are already reliable enough to provide synthetic labels. We propose Adaptive Ensemble-disagreement Routing for Oracle feedback (AERO), a fully online RLHF algorithm built on a Dyna-style model-based RL architecture, in which an ensemble-based Epistemic Reward Model (ERM) serves both as a reward posterior for exploration and as a learned preference-feedback model for synthetic labeling. AERO uses ensemble vote entropy, a Query-by-Committee disagreement measure, combined with an adaptive thresholding mechanism to decide which contexts require oracle feedback and which can instead receive ERM-based synthetic preference labels, concentrating expensive labels where they are most informative. Empirical results across different model families and scales show that AERO achieves highly competitive alignment performance while reducing the required oracle-query budget compared to online DPO and strong active-exploration baselines.

cs.LG

新论文 · v1arXiv:2611.10748

REINS: A Self-Evolving Agent Harness for Real-Time Trajectory Planning

Zhihong Cui, Hengyu Liu, Haoran Tang, Shijun Liu, Amir Taherkordi, Tor Skeie

原文摘要

Agent harnesses -- runtime scaffolds that wrap an LLM's reasoning loop with tool dispatch, verification, and persistent memory -- have become the standard substrate for deploying LLMs as autonomous agents, as demonstrated by Claude Code and Codex in software engineering. In trajectory planning, however, this paradigm has not taken hold: existing LLM-based trajectory planning methods either keep the LLM in the decision loop, exceeding the millisecond-level control budget, or offload it to offline rules or training-time supervision -- leaving the runtime planner non-evolving. Intermediate hybrids still lack the verification-and-consolidation loop that makes harnesses reliable. We ask: what runtime harness would let an LLM planner meet real-time constraints while self-evolving into a deployable one? We propose REINS, a harness built on three LLM-planner couplings: LLM outputs are (i) grounded to a learned variable-level dynamics model, (ii) verified via calibrated predicates and forward rollout, and (iii) consolidated into an indexed rule memory that serves future scenes in O(log n) without re-invoking the LLM. The harness closes a self-evolution loop: familiar scenes resolve by memory lookup; novel scenes invoke the LLM, whose verified outputs enrich the memory. Without modifying LLM weights, REINS attains 98%+ compliance, nearly 50% collision reduction, and 1.9-4.6 ms latency on simulated and real-world benchmarks at the tactical decision layer, with LLM invocation rate monotonically declining as memory matures. Code: https://github.com/ZhihongCui/REINS

cs.RO · cs.AI

版本更新 · v3arXiv:2610.05570

Poisson-GENERIC Neural Operators: Exact Metriplectic Structure in Function Space via Casimir Entropies

Jason Sulskis, Sathya Ravi

原文摘要

Existing thermodynamically consistent neural operators enforce GENERIC degeneracy by projecting the reversible operator, introducing state dependence without guaranteeing Jacobi. We instead use a compatible Lie--Poisson pencil $L=αD+λ(uD+Du)$ for nonlinear transport and constant Poisson multipliers otherwise. Augmenting the observed field $u$ with a latent entropy density $s$ makes $S=\int s$ a Casimir, so $L\,δS/δz=0$ without projection. The energy combines a fixed mechanical quadratic, a learned gauge-free potential, and a convex internal energy; the friction operator $M=AA^\top$ enforces $M\,δE/δz=0$ pointwise and supports diffusion and damping without a separate transport generator. Skewness, positivity, and both degeneracies hold for any parameters; the continuum pencil satisfies Jacobi, verified on the alias-free band; the closed-form heat and damped-wave friction operators are representable; physical energy is bounded under coercivity assumptions; and a discrete-gradient integrator preserves both laws in discrete time. On four PDEs in 1D and 2D with three backbones (FNO, Transolver, CNO), at equal optimizer steps the model wins 62/72 seed-level comparisons against unconstrained baselines, recovers the exact transport and wave symbols, matches heat and Burgers dissipation within 12\%, and dissipates nothing on advection; at equal wall-clock the unconstrained FNO is the more accurate ten-frame surrogate. What the structure gives at any budget is the energy balance: over a hundred frames, in and out of distribution, the model never raises the physical energy and conserves it where dissipation vanishes, whereas the unconstrained FNO loses a quarter of a conserved energy off distribution and projected GENERIC-FNO creates energy on most frames. Late-time under-damping on heat and explicit-integrator divergence on the wave are reported as limits.

cs.LG

新论文 · v1arXiv:2611.10746

RoadState: A Domain-Prior-Enhanced Vision-Language System for Industrial-Grade Lane-Level Map Updating

Deguo Xia, Zihan Li, Jiaqi Wang, Dong Xie, Xiyan Liu, Liuhui Zhang, Jizhou Huang, Mengmeng Yang 等 14 位作者

原文摘要

Lane-level map updating requires temporally consistent, physically valid, and auditable road-scene semantics despite occlusions, ambiguous lane markings, temporary obstacles, and viewpoint changes. We present RoadState, a production-deployed vision-language system that transforms sequential road-scene observations into structured lane-level semantics for Baidu Maps' map-updating pipeline. Its core model, RoadState-VLM, formulates road-scene understanding as autoregressive state estimation, predicting the current structured road state from the previous observation and symbolic state together with the current observation. We introduce Geometric Chain-of-Thought (Geo-CoT), which uses a directed acyclic graph of semantic dependencies as a domain prior to improve semantic consistency and reasoning fidelity across interdependent road-state dimensions. Extensive experiments on a real-world dataset show that RoadState-VLM achieves 94.33% mean accuracy across six road-state dimensions, outperforming the strongest fine-tuned VLM baseline. Ablation studies further demonstrate the complementary effectiveness of Geo-CoT and temporal transition context. A cascaded routing pipeline directs routine cases to lightweight models while reserving complex cases for RoadState-VLM. Since its deployment in March 2025, RoadState has supported lane-level map updating across more than 360 cities and reduced overall production costs by 30%. Together with human-in-the-loop auditing, the system maintains robust performance under stress-test conditions. These results demonstrate how domain-prior-enhanced reasoning, structured state interfaces, selective routing, and human quality control can bridge the gap between VLM-based road-scene understanding and large-scale lane-level map updating.

cs.CV · cs.AI

新论文 · v1arXiv:2611.10744

Writer-independent handedness identification from offline Bangla handwriting under controlled acquisition

Tanzim Hasan Prappo, Sayeed Hassan, Sayem Ali, Sukhendra Nath Dhar, M. Shahidur Rahman

原文摘要

Handedness is a soft-biometric cue for forensic document examination and writer profiling, yet reported accuracies from offline handwriting rarely keep writers, texts and image acquisition apart, so models may recognise the writer or capture conditions rather than the writing hand. Such controlled evidence is missing for Bangla. Using our BanglaHand dataset of 42 writers (21 left- and 21 right-handed), who each wrote six shared prompts and two own texts under controlled collection and photography, we evaluate handedness identification with all images of each test writer held out, whole-writer permutation tests and photometric controls. An ink-gradient descriptor identified the handedness of unseen writers with 77.4% balanced accuracy (95% writer-bootstrap interval 67.7-86.5%; p=0.001) and frozen ImageNet embeddings with 69.5-72.0%. Part of this signal is stroke darkness: in a post hoc analysis, right-handed writers' strokes were darker at their centres for equal stroke width, consistent with higher pen pressure and not explained by lighting drift. With ink density and brightness regressed out, the descriptor still reached 64.5% (p=0.027), whereas writing-only shape features were weaker (60.8%; p=0.090). Handedness is thus identifiable from offline Bangla handwriting under controlled acquisition, and photometric controls are essential to interpret such cues.

cs.CV · cs.CY · cs.LG

新论文 · v1arXiv:2611.10743

Performance Analysis of Entanglement Swapping DV-QKD over MIMO FSO Channels

Sushil Kumar, Soumya P. Dash, George C. Alexandropoulos

原文摘要

This paper studies multiple-input multiple-output (MIMO) free-space optical (FSO) quantum communication systems employing polarization-encoded discrete-variable quantum key distribution (DV-QKD), based on entanglement swapping, with the goal of extending secure communications beyond the reach of a direct link. The FSO channels are subject to atmospheric absorption, diffraction, beam wander, pointing errors, and turbulence-induced fading, while background noise and detector imperfections degrade the performance. An eavesdropper controlling the channels and the relay is also considered. To analyze the performance of the considered system, both hops MIMO channels are decomposed into parallel spatial eigenchannels via singular value decomposition (SVD), photon loss is modeled using Kraus operators, and a threshold-detector model is developed for the relay. Based on these models, closed-form per-eigenchannel expressions for the relay gain are derived, which are then used to obtain expressions for the quantum bit error rate (QBER) and the secret key rate (SKR). Numerical results demonstrate that entanglement swapping maintains a low QBER over longer distances than direct transmission, extending the communication range beyond the noise-limited cutoff of the direct link, at the cost of a lower SKR at short distances. The crossover distance beyond which entanglement swapping prevails is determined mainly by the background noise and the detector technology, and it is demonstrated to increase with MIMO configurations. Moreover, the reach gain is shown to be maximized for a midpoint relay. Finally, since each swapping event requires a single-pair emission from both sources, a near-deterministic entangled-photon source is required, which spontaneous parametric down-conversion sources do not provide at practical key rates, whereas MIMO substantially relaxes this requirement.

cs.IT · eess.SP

版本更新 · v2arXiv:2606.17478

From Hidden States to Confessions: Auditing Deception in Reasoning Models

Kexin Chen, Dongxia Wang, Haonan Zhang, Yanhui Li, Xinyu Deng, Yi Liu

原文摘要

As LLMs acquire stronger reasoning capabilities, deceptive behavior becomes an increasingly serious safety concern. Existing deception monitors typically either score visible transcripts or derive scalar probe scores from representation vectors, leaving little inspectable evidence about why a response is suspicious. We introduce StateWitness, an audit decoder for deception monitoring. It reads a target model's hidden states to answer audit queries and produce confession-style reports of potential failures or violations. We evaluate generalization beyond the decoder's audit training data across two target reasoning models and seven deception datasets. StateWitness achieves 0.916 mean AUROC, with relative gains of 11.6% and 25.0% over the best black-box and activation-probe baselines, respectively, under the same evaluation protocol. When combined with existing monitors, StateWitness reduces missed deceptive examples in simple threshold ensembles. Beyond scalar detection, the decoder returns query-level answers, schema reports, and token- or sentence-level evidence traces for human inspection. We envision StateWitness as one monitoring layer in a broader defense-in-depth strategy.

cs.CL · cs.AI

版本更新 · v4arXiv:2607.24743

ClinFusion: A Vision-Centric Multimodal LLM System for Holistic Medical Understanding

Hangjie Yuan, Yichen Qian, Zhiwei Tang, Xianzhe Xu, Sicheng Yang, Lirong Wu, Jinwang Wang, Pengju Wang 等 25 位作者

原文摘要

Multimodal large language models (MLLMs) hold immense potential to revolutionize clinical practice, yet deploying them in the medical domain is fundamentally a vision-centric challenge: models must absorb knowledge from heterogeneous 2D and 3D medical images, and evaluation protocols must align with radiologists' clinical practice and provide an accurate, fine-grained and factualness-driven assessment. In this paper, we introduce ClinFusion, a vision-centric MLLM designed for holistic medical understanding that systematically addresses these limitations. We propose a compositional and cascaded vision encoder architecture featuring a Cascade Spatial-Aware Locality Fusion operator that unifies diverse 2D and native 3D medical image understanding within a fused encoder. We further introduce a vision-grounded evaluation framework, including MedIF-Bench for instruction-following assessment and a region-of-interest-grounded method for clinically aligned and factualness-driven report generation evaluation. We show that ClinFusion sets a new state-of-the-art across a comprehensive suite of 2D and 3D multimodal medical benchmarks---spanning visual question answering, report generation, and instruction following---as well as textual medical tasks, outperforming leading open-source medical MLLMs (\textit{e.g.}, Hulu-Med, Lingshu) on 20 out of 24 benchmarks and demonstrating multimodal capabilities better than powerful proprietary models such as GPT-5.2 and Gemini-3-Flash on 13 out of 16 benchmarks, and can be further augmented with agentic tool use for retrieval-augmented and tool-assisted clinical workflows. A blinded evaluation by board-certified radiologists confirms that ClinFusion produces the highest-ranked reports, and validates our RoI-grounded metric as achieving the strongest correlation with expert judgment among all automatic evaluation metrics examined.

cs.CV · cs.AI · cs.CL

版本更新 · v4arXiv:2610.05900

Sub-Voxel Displacement and Ipsilateral Territory Decoupling for 3D Bilateral Coronary Artery Tree Reconstruction in Cardiac CT Angiography

Zeyu Jia, Xin Ming

原文摘要

Reconstructing topologically complete, sub-voxel-accurate 3D bilateral coronary artery trees from cardiac CT angiography (CCTA) requires simultaneously recovering continuous centerline trajectories and separating dense left/right coronary territories without cross-ostial collisions. We present a five-stage tubular drift and ipsilateral territory decoupling framework (M1-M5). Stage M1 pairs a 398,843-parameter multi-scale 3D pyramid encoder with a four-head tubular field network predicting vesselness probability, signed tubular boundary distance, unit tangent vectors, and continuous 3D centripetal displacement vectors. Stage M2 introduces recall-preserving multi-task optimization with 7-group AdamW parameter decoupling, L2-SP backbone regularization, and per-step anchor shrinkage. Stage M3 calibrates cylindrical Valsalva-sinotubular-junction wall coordinates and native-resolution orifice contact expectations for robust left and right ostial rooting. Stage M4 constructs a scalar-potential-weighted minimum-cost arborescence followed by normal-plane cross-sectional pullback and centripetal trajectory pruning. Stage M5 enforces coverage-guarded ipsilateral-field-coupled bilateral collision reduction and subtree handover. Across a 14-case held-out development cohort (Dev-14, 17-arm forward incremental build and 9-arm leave-one-out ablation) and an independent 50-case out-of-sample evaluation cohort (OOS-50) benchmarked against seven external architectures (nnU-Net, 3D UX-Net, Swin-UNETR, MedNeXt, CS2-Net, clDice-UNet, and Point-UNet), M1-M5 reduces bilateral chamfer distance on Dev-14 from 3.4381 mm to 2.2759 mm and achieves 2.7671 mm on OOS-50 with 7.11% bilateral collision rate and 79.7% distal branch completeness.

cs.CV · q-bio.TO

新论文 · v1arXiv:2611.10740

Evaluating Physically Grounded Procedural Reasoning in VLMs through Real-World Execution: Crochet as a Testbed

Maximiliano Wardle

原文摘要

Vision-Language Models (VLMs) can generate procedures that look convincing on paper, but do they work in practice? In this paper, we propose crochet as an ideal testbed for physically grounded procedural reasoning in VLMs. Crochet cannot be reliably simulated or automated: the only way to know what a pattern produces is to make it by hand, yet verification is tangible and cheap, requiring nothing but a hook and a ball of yarn. We introduce FoundationChain, a deceptively simple test of procedural reasoning: given an image of a basic crochet object, can VLMs infer how it was made and generate a pattern that produces the same result? We crochet 40 patterns generated by four VLMs by hand. Even at this scale, physical execution not only reveals failures that automated proxies cannot detect, but also enables a more precise diagnosis of their causes and consequences: while models write fluent, convincing patterns, only four are free of errors, and our analysis exposes deficiencies in visual, geometric and procedural reasoning.

cs.CL · cs.CV

版本更新 · v6arXiv:2610.00329

Non-Commutative Lie-Algebraic State-Space Models: Finite-Division Variety Laws, Semidirect Cascades, and Gradient Saddle Escape

Zeyu Jia

原文摘要

Structured state-space sequence models (SSMs) achieve linear-time inference and logarithmic-time parallel training via associative scans, yet diagonal transitions generate solvable semigroups unable to track non-solvable group words or 3D rigid-body manifolds. We present Non-Commutative Lie-Algebraic State-Space Models (Lie-SSMs), parameterizing recurrent updates on Lie algebra tangent spaces via the matrix exponential. First, using an o-minimal cylindrical flag collar, we establish an unconditional single-layer finite-division criterion for contracting $SO(3)$ and $SU(2)$ heads, proving odd-prime Sylow abelianity, odd-$p$-core centrality, and exponent-30 commutator obstructions excluding $S_5$ in $SO(3)^m, SU(2)^m,$ and $SO(4)^m$ while identifying the sharp threshold $d^*(S_5)=d^*(A_6)=5$ in $SO(5)$. Second, Depth-2 semidirect and Schreier $2$-cocycle cascades resolve $S_5$, $2I\cong SL_2(F_5)$, and $\mathrm{Heis}(F_p)$ in $O(\log T)$ scan depth, whereas unnormalized contracting coupling collapses exponentially without Directional RMSNorm. Third, we characterize the $Θ(\varepsilon^{c-1})$ Chen--Magnus--Hall--Witt commutator saddle and $1/|[G,G]|$ coset-centroid dilution, proving generic first-order symmetry breaking at $\varepsilon=0$ and teacher-forced local Polyak--Łojasiewicz convergence under dense prefix supervision and factored readouts ($99.90\%/99.40\%$ on $S_5$ at $T=128$; $100.00\%$ on $D_{16}$). Across $SE_2(3)$ Left-Jacobian odometry, Hillis--Steele/Blelloch GPU scans ($48.24\times$ forward, $20.27\times/10.28\times$ full-layer speedup at $T=2048$), and three 3D IMU benchmarks (UCI HAR, UCI HAPT-PT, and 17-subject REALDISP), Lie-$SO(3)$ models reach $95.69\%\pm 0.14\%$ on HAR, $88.44\%\pm 0.83\%$ episode logit-vote ($83.97\%\pm 1.20\%$ C3 window in 30-subject 5-fold CV; $87.16\%\pm 0.64\%$ 9-subject split) on HAPT-PT, and $84.23\%\pm 1.00\%$ on REALDISP.

cs.LG

新论文 · v1arXiv:2611.10739

Pulse waveform morphology encodes haemodynamic signatures of impending stroke

Cheng Ding, Jiaming Liu, Jian Wu, Hongxia Xu, Daoqiang Zhang

原文摘要

Stroke is a disorder of the circulation, yet the haemodynamic state that immediately precedes it has rarely been observed, because continuous physiological recordings before a stroke are seldom available. Photoplethysmography (PPG), recorded by every pulse oximeter and by hundreds of millions of wearable devices, captures the peripheral pulse beat by beat, but its morphology is largely discarded. Here we ask whether pulse waveform morphology encodes haemodynamic signatures of impending stroke. Using in-hospital stroke as a natural experiment that provides continuous PPG before physician-adjudicated stroke recognition, we studied intensive-care (MIMIC-III, $n=176$) and emergency-department (MC-MED, $n=154$) cohorts and described each beat with interpretable descriptors of pulse timing, amplitude, contour and variability. At a nominal 360-min horizon, morphology separated pre-recognition from stable windows with $F_1$ scores of 0.941 and 0.989 (sensitivity 0.998 and 0.980), with models transferred unchanged to the second cohort, and outperformed heart rate alone on identical windows. The signature was dominated by systolic crest time and its change from each patient's own baseline, feature attribution was concordant across cohorts (Spearman $ρ=0.865$), and morphology recorded in the first two hours of care stratified the subsequent clinical course ($F_1$ 0.714 and 0.691). In high-risk patients without stroke, 29% and 14% of windows were positive, but five-window persistence rules limited alerts to 17% and 2% of patients. The results demonstrate that the routinely recorded pulse thus carries haemodynamic imprint of the period preceding stroke, positioning pulse morphology as a candidate continuous cerebrovascular biomarker.

cs.AI

新论文 · v1arXiv:2611.10738

Matchability-Aware Conformal Prediction for Open-Ended Language Model Generation

Ilia Azizi

原文摘要

Large language models (LLMs) often do not produce calibrated uncertainty estimates for their answers. We propose CAELUM, a framework that builds semantic prediction sets while separating aleatoric from epistemic uncertainty. CAELUM samples answers using an ensemble of clarification prompts, clusters them by semantic equivalence, and estimates the aleatoric and epistemic components via kernel-based von Neumann entropy before calibrating nonconformity scores with split conformal prediction. We use a weight $w_λ(x)=1+U_{\mathrm{ale}}(x)+λ\,U_{\mathrm{epi}}(x)$ to control for the contribution of the epistemic uncertainty of each instance and fit a coefficient $λ^\star$ to minimize prediction set size. When the objective is nonflat and selection is stable across splits, $λ^\star$ could be a diagnostic, where large values may indicate epistemic dominance (retrieve, abstain) and $λ^\star\to 0$ aleatoric dominance (clarify). For individual queries, a log ratio $R(x)$ compares the weighted epistemic component with the aleatoric component. Theoretically, we demonstrate that the coverage is capped by matchability, the fraction of items whose reference answer appears in any sampled cluster. Empirically, this matchability can be predicted from the original question features using a lightweight classifier. We use those predictions to define a stratum and derive a conformal coverage bound within it. Across 30 LLM and dataset combinations (4-32B), mean coverage is 0.74 in the learned stratum versus 0.65 overall, averaged over the 78 evaluations using the learned classifier. Project page: https://unco3892.github.io/caelum/

stat.ML · cs.CL · cs.LG · stat.ME

版本更新 · v4arXiv:2601.23258

Agnostic Language Identification and Generation

Mikael Møller Høgsgaard, Chirag Pabbaraju

原文摘要

Recent works on language identification and generation have established tight statistical rates at which these tasks can be achieved. These works typically operate under a strong realizability assumption: that the input data is drawn from an unknown distribution necessarily supported on some language in a given collection. In this work, we relax this assumption of realizability entirely, and impose no restrictions on the distribution of the input data. We propose objectives to study both language identification and generation in this more general "agnostic" setup. Across both problems, we obtain novel interesting characterizations and nearly tight rates.

cs.LG · cs.AI · cs.CL

新论文 · v1arXiv:2611.10737

The Lagrangian Brain: A Constraint Mechanics of Mind and Machine

Yuhang He, Si Wu

原文摘要

A brain is in one state at a time, yet most of what decides its next state is absent from it: the patterns its world never produces, the statistics of a lifetime, a goal that lies ahead. In mechanics a wire acts on a bead only through a force that appears when the bead presses on it, and Lagrange computed such forces with one multiplier for each constraint. We propose that a brain follows the same mechanics. Everything a circuit knows, is told or wants is a constraint on its single state and acts through its own multiplier, which accumulates the violation and pushes the state back. Neurons and synapses carry the multipliers, each with its own time constant: inhibitory interneurons carry what never happens, adaptation the cost of staying in one state, synapses the statistics of experience, and feedback to apical dendrites the future. From this hypothesis follow Dale's law, the reciprocal wiring and balance of excitation and inhibition, the paradoxical responses of cortex and the frequencies of brain rhythms. Belief becomes the time one trajectory spends in each state, learning becomes sleep proposing laws and waking refuting the false ones, and planning becomes a wave from the goal meeting a wave from the present. Connectionism and symbolism are the limits of frozen and of instantaneous multipliers, and between them the time a circuit runs becomes the depth of its computation. A machine built on these principles, trained without gradients on 1000 solved puzzles, solves all 422,786 Sudoku-Extreme test puzzles with one trajectory each. It rediscovers the rules of Sudoku by sleeping and waking, plans shortest paths in mazes of 64 times the training area, and tracks permutations exactly on strings 25 times longer than in training, where Transformers fail. A mind, on this view, is life that learns its own constraints.

cs.AI

版本更新 · v2arXiv:2609.37351

Typed Edge-Tensor Non-Reciprocal Port-Hamiltonian Deliberation for Counterfactual Open-World Deductive Reasoning

Zeyu Jia

原文摘要

Scaling test-time computation in continuous latent spaces offers an attractive alternative to verbose token-by-token generation for multi-step deductive reasoning. However, unregularized recurrent latent updates suffer from a deliberation drift cliff when rolled out beyond training horizons, while strictly energy-conserving or symmetric message-passing dynamics cannot break parent-to-child causal symmetry or suppress cyclic modus-ponens amplification on cyclic distraction graphs. We introduce Typed Edge-Tensor Non-Reciprocal Port-Hamiltonian Deliberation (TE-BPHD), a neuro-symbolic continuous-time latent reasoning architecture that couples skew-symmetric port-Hamiltonian conservation with relation-typed non-reciprocal directional transport and monotone dissipative damping on a semantic entity-state manifold. We prove (i) unconditional input-to-state stability and exponential contraction of autonomous rollouts across arbitrary inference depths without external norm projection, (ii) strict directional DAG reachability separation over symmetric message passing, and (iii) exact cycle-suppression margins under finite cyclic horn perturbations. Across counterfactual open-world deductive benchmarks (PrOntoQA-OOD up to depth 15, ProofWriter-OWA Cyclic at depths 5-10, FOLIO-Symbolic, and Cluttr-Relational), TE-BPHD eliminates the deep-horizon drift cliff, improves depth-10 cyclic reasoning accuracy to 90.0% (+/- 0.8%) over symmetric port-Hamiltonian and standard Transformer baselines, and supports zero-retraining adaptive Lyapunov halting that reduces average solver evaluations by 44% with negligible accuracy loss.

cs.LG · cs.AI · cs.CL

新论文 · v1arXiv:2611.10736

Tunnels: Compressing the Solution Subgraph of Regular Path Queries

Adrián Gómez-Brandón, Gonzalo Navarro

原文摘要

Regular path queries (RPQs) are increasingly expected to return the paths that match them, not only their endpoints. Since the number of matching paths can be exponential or infinite, a standard way to deliver them (PMR) is the subgraph $\Hs$ of the product between the graph and the query automaton that contains exactly the nodes lying on some solution path. We show that $\Hs$ can be compressed much further when the graph is available to the decoder: most of $\Hs$ can be regenerated by re-running small parts of the traversal, and only the places where the traversal would waste significant effort on dead branches need to be stored. We formalize this as \emph{tunnels}: regions of $\Hs$ that are re-expanded from a stored entry point with a bounded amount of extra work, either an absolute budget or one proportional to the output produced. We handle the three classes of RPQs: constant-to-variable, constant-to-constant, and variable-to-variable. In the latter, we study the combination of tunnels with cutting the query at a selective articulation point of the automaton and encoding the answer as a union of Cartesian products of leftward and rightward traversals. Our experimental results show improvements of 2 to 3 orders of magnitude over the baseline space of PMR, for an acceptable increase in traversal time.

cs.DS

新论文 · v1arXiv:2611.10734

Tiny Evidence Region Localization with Selective Contrastive On-Policy Self-Distillation

Yujuan Pang, Wenhao Xu, Yinglei Teng

原文摘要

Multimodal large language models have made progress in general visual tasks. However, limitations remain in fine-grained visual tasks requiring evidence from minute image regions. Existing methods primarily train models using evidence-related regions while overlooking the influence of extensive background regions, resulting in a limited ability to resist interference from irrelevant regions. We propose selective positive-negative on-policy self-distillation (SPN-OPSD), which considers both evidence and background regions. Supervision from both views improves the model's ability to resist interference from irrelevant regions. Furthermore, selective token-level distillation provides more informative supervision, improving the model's ability to attend to evidence regions in Fine-Grained Visual Tasks. On Qwen3.5-2B, SPN-OPSD improves accuracy on V* Bench, ZoomBench, and MME-RealWorld-Lite from 76.44%, 45.92%, and 57.43% to 84.82%, 54.56%, and 59.56%, respectively. Similar gains are also observed on Qwen3.5-0.8B.

cs.CV · cs.AI

新论文 · v1arXiv:2611.10733

Spectrogram-Based CNN Autoencoder for One-Class Anomaly Detection in Machining Vibration Signals

Sebastian Zeleny, Christian Gawron

原文摘要

This work presents a one-class anomaly detection framework for vibration-based condition monitoring in machining processes using a convolutional neural network autoencoder. Three-axis vibration signals acquired during industrial broaching are transformed into time--frequency spectrograms and combined into a compact three-channel representation, enabling convolutional feature learning on multivariate time-series data. The autoencoder is trained exclusively on normal process data and detects anomalous strokes based on reconstruction errors. Labeled validation data are used for threshold calibration and an independent test set is reserved for final performance evaluation. To improve sensitivity to short-lived process instabilities such as chatter, a localized residual-based metric termed Segmented Vertical Error (SVE) is introduced. Experimental results on approximately 10{,}000 broaching strokes show a clear separation between normal and anomalous process conditions under strong class imbalance. The processing pipeline is additionally evaluated on an external public turning dataset as a proof of concept, indicating preliminary applicability beyond the original broaching setup. The results suggest that spectrogram-based autoencoder models can provide a practical and scalable basis for one-class anomaly detection in industrial vibration monitoring.

cs.LG

版本更新 · v3arXiv:2510.22969

Multi-Agent Conditional Diffusion Planning for Decentralized Wireless Resource Allocation

Kechen Meng, Sinuo Zhang, Rongpeng Li, Yansha Deng, Chan Wang, Zhifeng Zhao

原文摘要

In wireless communication systems, efficient and adaptive resource allocation is essential for enhancing overall Quality of Service (QoS). Compared with conventional Model-Free Reinforcement Learning (MFRL), Model-Based RL (MBRL) first learns a generative world model for subsequent planning, enabling more stable training through the reuse of historical experience. However, deploying MBRL in large-scale wireless networks remains challenging due to high-dimensional stochastic dynamics, strong inter-agent cooperation, and stringent communication constraints. To overcome these challenges, we propose a Multi-Agent Conditional Diffusion Model Planner (MA-CDMP) for decentralized communication resource management. Following the Decentralized Training with Decentralized Execution (DTDE) paradigm, MA-CDMP models each communication node as an autonomous agent and employs Diffusion Models (DMs) to capture environment dynamics. An inverse dynamics model is further incorporated to guide action generation, improving sample efficiency and policy scalability. Moreover, to efficiently approximate large-scale agent interactions, we introduce a Mean Field (MF) mechanism to assist the classifier in conditional DMs. This mitigates inter-agent non-stationarity and enhances cooperation with minimal communication overhead. We further establish an upper bound on the distributional approximation error induced by MF-based diffusion generation, guaranteeing convergence stability and reliable modeling of multi-agent stochastic dynamics. Extensive experiments demonstrate that MA-CDMP consistently outperforms existing MARL baselines in terms of average reward and QoS metrics, showcasing its scalability and practicality for real-world wireless network optimization.

cs.AI · cs.MA

新论文 · v1arXiv:2611.10730

Breaking Precision Walls in First-, Second-, and Zeroth-Order Optimizers: One Constant, Set in Advance

Lngel Kyo

原文摘要

Under power-law signal decay across directions, an optimizer can fit strong directions and miss weak ones while average loss hides it. A precision wall measures the steepest decay where the weakest direction recovers within 5% in a fixed budget. On low-rank matrix sensing and quadratics one constant sets the wall: once it dominates the denominator, Adam or grafted Shampoo is momentum descent at step $η/c$, setting the wall; in Shampoo, matching grafting's constant to damping restores the wall after three hypotheses failed. In zeroth-order Adam, $\varepsilon$ acts against $\varepsilon^\ast$ from a mean-square spectral model; below $\varepsilon^\ast$ error hits a noise floor. Set from true curvature or spectrum on new shapes, the rule raised the wall above the same-step default by a forecast amount: on two sensing shapes by $1.96, 1.15$ (Adam) and $1.59, 1.74$ (grafted Shampoo), and on two Hadamard-rotated quadratics by $1.12, 0.73$ (zeroth-order Adam, longer budget), rising on all seeds; fixed-step momentum at that step reaches those walls. A cosine-scheduled default (small constant giving weak modes large steps) is higher on one sensing shape, matched on new seeds of the other, and lower with the rule's constant. A default step retuned per budget catches up on rotated quadratics and population logistic regression, fails at 1 query/step on two diagonal quadratics (catching up at 16), and exceeds the rule on digits logistic regression (full-batch and minibatches, where gradient noise sets the $η= 0.01, 0.1$ default walls). On logistic regression the rule did not raise the first-order wall: same-step default Adam was higher (its wall on 4 new shapes at the forecast stability limit), while in zeroth order on the population loss setting $\varepsilon$ raised the wall by $0.98, 0.88$.

cs.LG