arXiv Papers with Code in Computer Science (September 2026)
Authors:Nathan Tsoi, Michael J. Munje, Tejas Oberoi, Rishab Maheshwari, Pengen Zheng, Tanush Chauhan, Peter Stone, Joydeep Biswas
Abstract:
Robot navigation in dynamic, human‑centered environments requires socially‑compliant decisions grounded in robust scene understanding. Recent Vision‑Language Models (VLMs) exhibit promising capabilities such as object recognition, common‑sense reasoning, and contextual understanding, capabilities that align with the nuanced requirements of social robot navigation. However, it remains unclear whether VLMs can accurately understand complex social navigation scenes (e.g., inferring the spatial‑temporal relations among agents and human intentions), which is essential for safe and socially compliant robot navigation. While some recent works have explored the use of VLMs in social robot navigation, no existing work systematically evaluates their ability to meet these necessary conditions. In this paper, we introduce the Social Navigation Scene Understanding Benchmark (SocialNav‑SUB), a Visual Question Answering (VQA) dataset and benchmark designed to evaluate VLMs for scene understanding in real‑world social robot navigation scenarios. SocialNav‑SUB provides a unified framework for evaluating VLMs against human and rule‑based baselines across VQA tasks requiring spatial, spatiotemporal, and social reasoning in social robot navigation. Through experiments with state‑of‑the‑art VLMs, we find that while the best‑performing VLM achieves an encouraging probability of agreeing with human answers, it still underperforms simpler rule‑based approach and human consensus baselines, indicating critical gaps in social scene understanding of current VLMs. Our benchmark sets the stage for further research on foundation models for social robot navigation, offering a framework to explore how VLMs can be tailored to meet real‑world social robot navigation needs. An overview of this paper along with the code and data can be found at https://larg.github.io/stars.
Authors:Qi Lyu, Jiahua Dong, Hao Shen, Xudong Wang, Hongyuan Yu, Baichen Liu, Henghui Ding, Zhi Han, Nicu Sebe, Ivan Laptev, Fahad Shahbaz Khan, Salman Khan
Abstract:
World Action Models (WAMs) couple visual dynamics prediction with action generation, yet they do not explicitly support the reuse of action experience across manipulation tasks. Furthermore, existing WAMs struggle to capture underlying cross‑task semantic relationships that could guide target action prediction, as redundant background elements interfere with the extraction of key visual information. To address these challenges, we develop a novel Action Experience Dictionary (AED) that encodes historical physical action trajectories into shared action embeddings to support skill reuse and model cross‑task relationships. Specifically, we first aggregate historical actions to align with visual observations and retrieve action embeddings from the AED using a pretrained action tokenizer. Subsequently, we visually condition the pooled embeddings through cross‑attention and prepend them to noisy action tokens, providing interaction context and action intent for prediction. To model action‑related motion and reduce reliance on irrelevant background cues, we introduce a motion‑aware transition loss that supervises visual feature change prediction over random temporal intervals. Experiments on simulation benchmarks and in real‑world cross‑embodiment settings verify the effectiveness of our AED. The project code is available at https://github.com/JiahuaDong/AED .
Authors:Ziren Gong, Guo Chen, Yongjia Li, Yihua Shao, Fabio Tosi, Stefano Mattoccia, Matteo Poggi, Hao Tang, Fei Ma, Shuyan Li, Ziyang Yan, Nicu Sebe, Ling Shao, Jianfei Cai, Qi Tian, Ming-Hsuan Yang
Abstract:
4D scene reconstruction aims to recover the evolving geometry, appearance, and motion of dynamic environments from visual observations. Despite substantial progress in neural scene representations, reconstructing dynamic scenes remains challenging due to non‑rigid motion, occlusions, temporal inconsistencies, and the trade‑offs between reconstruction fidelity and computational efficiency. Recent advances in Neural Radiance Fields (NeRF) and 3D Gaussian Splatting (3DGS) have introduced diverse approaches to representing and reconstructing dynamic scenes, yet their relationships, underlying design choices, and evaluation protocols remain fragmented. In this paper, we present a unified perspective on 4D scene reconstruction, organizing existing methods around their scene representations, temporal modeling strategies, reconstruction pipelines, and optimization objectives. Through this framework, we examine how different design choices affect geometric fidelity, appearance consistency, motion representation, and computational efficiency. We further consolidate commonly used datasets and evaluation metrics, identify limitations in current experimental practices, and discuss open challenges in reconstructing complex, dynamic real‑world environments. By connecting methodological developments with their underlying assumptions and evaluation evidence, this work provides a structured foundation for understanding existing approaches and identifying future research directions. An evolving collection of relevant papers and resources is available at https://github.com/ZiyangYan/Awesome‑4D‑Scene‑Reconstruction.
Authors:Kevin Yu, Tao Guo, Constantinos Antoniou, Panagiotis Angeloudis
Abstract:
Neural trajectory predictors can reach low prediction error while violating dynamics, actuator limits, or state constraints, especially when controls are unobserved and dynamics are partially specified. We introduce the Markovian Dynamics Enforcer (MaDE), a time‑invariant post‑hoc operator mapping state‑transition proposals onto a learned feasible dynamics manifold, trained on feasible states without ground‑truth controls. For each transition it infers a control and recomputes the state through a completion model of known physics plus a learned residual. It then corrects that control by gradient‑based inequality reduction, so inequality satisfaction is best‑effort within an iteration budget. Since every correction iterate re‑enters the completion model, the returned state is dynamically consistent by construction relative to that model and the supplied previous‑state anchor. MaDE drives dynamics residuals to essentially zero on fully specified simulated systems, and on an underspecified system leaves a smaller true‑dynamics residual than the baselines. Designed to attach to arbitrary predictors, the frozen operator is evaluated downstream of recurrent, structured state‑space, and transformer predictors. On recorded vehicle trajectories the one‑step residual against a kinematic bicycle model is 0.0071 to 0.0072 for MaDE and 0.1703 to 0.1714 for raw predictors. MaDE raises average displacement error by a factor of 1.57 to 1.83.
Authors:Tanishq Rachamalla, Aryan Das, Srishti Kaushik, Swalpa Kumar Roy
Abstract:
Hyperspectral remote sensing has advanced across diverse deep learning paradigms, including spectral spatial CNNs, Vision Transformers, Mamba, graph neural networks, Kolmogorov Arnold networks, and self supervised masked autoencoding. Yet progress remains hindered by fragmented repositories, incompatible tensor conventions, and non standardized evaluation. Hyperspectral Image Models addresses these challenges through a modular framework unifying 55 representative models across six paradigms with a common registry, automatic 4D/5D tensor adaptation, and standardized constructors. It integrates 24 benchmark scenes from Airborne, Spaceborne, UAV, and Mars CRISM sensors, with caching, label remapping, PCA, explicit band selection or raw spectra, optional spatial max pooling, and arbitrary PxP patch extraction. To prevent inflated accuracy from overlapping windows, it supports class balanced random partitioning and spatially disjoint regional blocking with Chebyshev guard bands that eliminate train test pixel overlap. Experiments use a single config with deterministic seeds and complete provenance, generating LaTeX benchmark tables and classification maps. Across 1,320 model scene evaluations and 6,600 seeded runs, scene difficulty dominates architecture, with mean accuracy ranging from 96.40% on Botswana to 56.70% on Houston 2018, versus a 15 point spread across paradigm means. No paradigm universally dominates, while sub 1 M parameter models can match architectures two orders of magnitude larger. Code is publicly available at https://github.com/Tanishq251/Hyperspectral‑Image‑Models.
Authors:Xuhua Chen, Zhenhan Yin, Yuan Zhang, Lingfeng Zhang, He Zheng, Tong Mu, Shun Zuo, Dian Zhou, Di Wu, Xuan Zhou, Shaojie Wan, Rongtian Shen, Qiulong Xu, Yiduo Li, Yinglong Wang, Yanqian Wang, Kun Wang, Tao Zhang
Abstract:
World‑action models (WAMs) augment robot policies with action‑conditioned environment dynamics, yet existing approaches largely rely on future observation reconstruction or generic latent prediction and lack structured, control‑oriented world representations tightly coupled with action generation. We introduce Magic‑W0, a world‑action foundation model that jointly models structured physical state evolution and continuous actions. Magic‑W0 represents interaction as a Structured World Transition consisting of Current State, Transition, and Future State. Current State combines vision‑language context with Current 3D Geometry; Transition is represented by 3D Motion capturing action‑induced three‑dimensional changes; and Future State is represented by Future Semantics describing task‑relevant outcomes. To couple prediction and control, we propose a layer‑aligned world‑action interaction architecture in which evolving action hypotheses condition world‑transition prediction, while predicted world representations continuously inform action generation. Magic‑W0 is pre‑trained on large‑scale egocentric human manipulation, UMI, real‑robot, and simulation data, with latent supervision for geometry, 3D motion, and future semantics from pre‑trained visual models. Inference‑time interventions show that structured world representations respond systematically to changes in candidate actions and that action‑related information propagates through shared 3D representations into future semantic predictions. On RoboDojo‑Sim, Magic‑W0 achieves an average Score of 27.10, the highest among the compared WAMs. Across multiple real‑robot tasks, it also demonstrates strong downstream performance after fine‑tuning with limited downstream data, supporting generalization and rapid adaptation.
Authors:Di Wu, Rongtian Shen, Ping Liu, Yan Shen, Zhenhan Yin, Shun Zuo, Xuhua Chen, He Zheng, Lingfeng Zhang, Jianglin Zhang, Tao Zhang
Abstract:
Vision‑language‑action (VLA) models face a timing gap between low‑rate inference and high‑rate robot execution. We characterize this gap through end‑to‑end latency measurements of model inference and the robot execution chain. Repeated Flow Matching denoising contributes substantially to inference cost, while robot‑side delays mainly arise from perception acquisition, communication scheduling, and physical response. Analysis of the velocity field shows relatively stable magnitude and direction in early integration, followed by stronger directional correction near the terminal steps. Based on this stage heterogeneity, we propose two‑stage non‑uniform denoising, reducing the number of steps from 10 to 2 and model‑inference time from 61.557 ms to 21.956 ms. We also develop a distributed real‑time VLA framework with independent inference, action‑publication, and robot‑control rates, modular observation acquisition, and action‑provenance logging. Using π0.5 as the baseline, we evaluate six real‑time execution methods on a long‑horizon physical garment‑folding task. Legato performs best overall among training‑based methods, while Temporal Smoothing leads among training‑free methods; both perform strongly in task success, completion time, action continuity, and acceleration smoothness. Combining two‑step denoising with representative execution methods substantially reduces inference cost with a small reduction in task performance. These results motivate joint optimization of model‑inference efficiency and robot‑system timing.
Authors:Dalton Raphael Harmsen, Swier Garst, Thomas van Osch, Zarè Palanciyan, Joaquin Vanschoren
Abstract:
Cross‑lingual transfer describes how knowledge in a source language benefits a target language. Measuring it quantitatively requires broad multilingual pre‑training, as prior work has done with cross‑lingual transfer matrices. We ask whether transfer is predictable from freely available typological features, and whether the prominence of high‑resource source languages reflects typology or data quality and quantity. We show that typological databases contain cheap and dense signals about cross‑lingual transfer. Our typology‑only random forest on a 24‑language prior‑work transfer matrix scores leave‑one‑language‑out ρ=0.705 and R^2=0.49, beating a non‑typological control at ρ=0.62, which verifies the ability of typology‑only predictions to reconstruct costly measured cross‑lingual transfer. The signal survives leave‑one‑script‑out and leave‑one‑family‑out protocols, so script and family confounding do not explain the effect. By decomposing the transfer into a typology term and a resource‑and‑script bias term, we find the best‑source ranking sensitive to this bias. In contrast, typology is not affected by this bias, which makes it a zero‑compute screening tool that replaces hundreds of training runs with a model fit. Our code is available \hrefhttps://github.com/dharmsen/typo‑x‑ling‑transferhere.
Authors:Stan Birchfield
Abstract:
This book presents a code‑first introduction to computer vision, spanning classical 2D image processing, classical 3D vision, and deep learning. Organized as 44 short chapters across three parts, the book builds each topic from first principles: image arithmetic and morphology; convolution, pyramids, and frequency‑domain filtering; feature detection, optical flow, and stereo; projective geometry, camera calibration, and structure from motion; and the full arc of modern deep learning, from a single neuron through convolutional networks, backpropagation, classic architectures, transfer learning, object detection, and semantic and instance segmentation, concluding with engineering considerations like mixed‑precision and parallel training. Every technique is implemented directly in Python and NumPy or PyTorch and checked numerically against the corresponding OpenCV or PyTorch library function, so readers see not just the mathematics but its concrete behavior on real and synthetic data. The material was distilled with AI assistance from freely available online course notes, condensing extensive working code into concise mathematical exposition while preserving verified, reproducible results throughout. It is intended as a self‑contained reference for students and practitioners who want to understand computer vision algorithms and their Python implementations.
Authors:Xinyue Xu, Jiahao Zhang, Lijie Hu, Peter Hase, Hao Wang
Abstract:
Sparse autoencoders (SAEs) reveal visual structure in diffusion transformers (DiTs), but interpreting a feature does not establish whether it can be used to control generation. We introduce D‑Scope (Diffusion Scope), a framework that connects feature interpretation to generation control through shared visual evidence. D‑Scope aggregates SigLIP~2 embeddings of highly activating image patches into visual centroids. Matching target text descriptions against these visual centroids in the shared image‑text embedding space then enables retrieval of individual features without per‑feature text annotations. The underlying patches provide evidence for inspecting each selection, while spatially masked interventions test the corresponding decoder direction at varying strengths under fixed generation conditions. We characterize 150 SAEs across two model families and five layers, and introduce a benchmark of 100 target concepts with ten contexts each spanning under‑specified and explicit‑conflict conditions. Our empirical results show that high reconstruction fidelity can coexist with low dictionary utilization and limited visual‑evidence coverage. Under per‑case best‑of‑sweep strength selection, contrastive retrieval yields larger mean regional SigLIP~2 gains than direct retrieval across the tested steering configurations, without consistently improving outside‑region preservation. D‑Scope provides an inspectable framework for evaluating sparse DiT features through their visual evidence and the effects of their decoder directions on generation. The demo is available at https://jiahaozhang‑public.github.io/d‑scope/.
Authors:Łukasz Rudnik, Agnieszka Polowczyk, Alicja Polowczyk, Przemysław Spurek
Abstract:
The rapid advancement of generative video models has enabled the synthesis of increasingly realistic and temporally coherent videos, while also raising concerns about the generation of harmful content. The reliance on large‑scale web datasets during training inevitably exposes these models to undesirable material, making concept unlearning an essential mitigation. Existing methods mainly target static visual concepts, such as objects, identities, or unsafe appearance, largely overlooking motion unlearning. Furthermore, these approaches often pay little attention to preserving the surrounding scene. As a result, successful concept removal may unintentionally alter the background, composition, or overall video dynamics. We argue that effective unlearning should ideally change only what is targeted, while minimizing unnecessary changes to the remaining scene. In this work, we introduce FOMO, to the best of our knowledge the first training‑based selective video unlearning method that directly treats preservation of the original scene as a priority. We formulate unlearning around two complementary objectives: what to change and what to preserve. Our method localizes concept‑related representations and modifies them, while the preservation mechanism maintains non‑target scene information without requiring auxiliary data. Beyond simply erasing unwanted concepts, FOMO explicitly redirects the generation toward a specified safe alternative. We further extend this formulation to motion unlearning, where the concept is defined by temporal behavior rather than a fixed spatial region. Our solution achieves effective unlearning across unsafe content, object, and motion concepts, while achieving the best trade‑off between concept removal and scene preservation. Code: https://github.com/gmum/FOMO Project Page https://gmum.github.io/FOMO
Authors:Shaoyang Guo, Ziming Liu
Abstract:
Although conventional world models ‑ auto‑regressive or diffusion models based on transformers or convolutional networks ‑ may learn surface statistics of world dynamics, can they learn the exact world dynamics from its observed history? Leveraging cellular automata as a simple testbed, we find the answer to be no in many cases. Conventional architectures predict most pixels correctly yet rarely complete a rollout: a CNN predicts 96.3% of cells but completes 18.9% of rollouts; a joint diffusion model completes none. We trace the gap to three failure modes of these world models ‑ namely, they fail to exactly capture spatial locality, temporal locality or temporal stability. Simple changes repair each: (1) for spatial locality, two‑dimensional rotary positions lift a transformer from 39.1% to 100% on the Game of Life; (2) for temporal locality, handing each token its cell's previous‑frame neighbourhood lifts the same transformer from 25.8% to 99.9% on unseen rules; (3) for temporal stability, causal freezing lifts the same diffusion weights from 42.2% to 99.9%. None of the three changes touches the architectural backbone; each only modifies the information flow within it. We also compare joint and ordered sampling on billiards and, in an exploratory study, on a simulated Burgers equation.
Authors:Qize Yu, Lianrui Fan, Boyu Chen, Jiaqi Liang, Xini Ding, Yue Chen, Zetian Song, Yuran Wang, Yi Zou, Kaixuan Wang, Tianxing Chen, Wenxuan Song, Bohan Zhou, Mingleyang Li, Siqiao Huang, Yuqi Ye, Caigao Jiang, Wei Wei, Ruihai Wu, Hang Zhang, Yixiao Ge, Shuchang Zhou, Shilong Liu, Xianming Liu, Ping Luo, Shiyu Huang
Abstract:
Precise grounding matters. It specifies which object is the target and where that object is, even in clutter and for tiny objects, and it has to be fast enough for closed‑loop control. Yet vision‑language‑action (VLA) and world‑action models (WAMs) take perception from general‑purpose vision‑language and video‑generation backbones, which still fail in these settings. We introduce GroundingPI, a 4B grounding foundation model that generates points and boxes as quantized coordinates in a shared vocabulary. Training combines multimodal and spatial pretraining, supervised fine‑tuning, and reinforcement learning with GRPO, using supervision from public datasets and dedicated data engines. Against 44 baselines across 34 grounding benchmarks spanning 11 perceptual capabilities, GroundingPI establishes a new state of the art, averaging 73.68%, above the larger GPT‑6 Astra (71.54%). As a downstream visual backbone, GroundingPI improves performance on robotic manipulation and autonomous driving. On RoboTwin 2.0, it outperforms every mainstream backbone we evaluate in all four out‑of‑distribution settings, by up to 24.8% relative to the strongest backbone. On RoboCasa‑GR1, GroundingPI trained with 50% of the demonstrations outperforms those baselines trained with 75%. On nuScenes, used as the visual backbone, GroundingPI attains an average open‑loop L2 error of 0.296 m. We systematically analyze GroundingPI's pretraining in scale and data composition. Downstream autonomous driving and robotic manipulation improve as the pretraining is scaled. Analyzing the data recipe across these 11 perceptual capabilities shows dense grounding's substantial benefits for both, and OCR's potential as a catalyst for perceptual learning. These results support grounding as a perceptual foundation, and dedicated perceptual pretraining as a promising direction for foundation models of physical intelligence.
Authors:Qize Yu, Lianrui Fan, Bowen Ping, Xini Ding, Zetian Song, Junbo Niu, Kaixuan Wang, Tianxing Chen, Yue Chen, Minghua He, Yuran Wang, Jie Huang, Haojun Zhang, Min Chen, Hao Li, Wenxuan Song, Ruihai Wu, Xianming Liu, Shilong Liu, Shuchang Zhou, Ping Luo, Shiyu Huang
Abstract:
Autoregressive (AR) grounding models serialize spatial predictions, introducing sequential latency and imposing a causal order on output tokens. We view grounding as visual evidence extraction: objects, locations, and spatial relations are jointly constrained by the image and query, yet their dependencies do not imply an intrinsic left‑to‑right generation order. This distinction makes bidirectional diffusion a natural fit, allowing spatial hypotheses to emerge in parallel and be jointly refined through iterative denoising. We introduce GroundAnything, a 4B‑parameter grounding foundation model that reconciles fast parallel decoding with precise localization through blockwise denoising. Training combines grounding pretraining from public datasets and dedicated data engines, direct AR‑to‑diffusion conversion with joint AR and diffusion objectives, supervised fine‑tuning, and GRPO‑based reinforcement post‑training. Across 30 grounding benchmarks, our autoregressive variant, GroundAnything‑VLM, establishes a new overall state of the art among similarly sized models at 72.42%, remaining competitive with GPT‑6 Astra (71.35%). With entropy‑guided decoding, GroundAnything also surpasses the prior state of the art at this scale, averaging 61.75% versus 53.32% for the fast MTP‑based LocateAnything model. We further explore decoding strategies, showing that an optional self‑speculative mode achieves a 4.51× speedup over the AR counterpart with a 0.74 percentage‑point drop in COCO F1mIoU. Infrastructure experiments show that progressive inference optimizations translate parallel decoding into practical speedups. These support efficient visual grounding in latency‑sensitive real‑world systems.
Authors:Aravindh Mahendran, Michael King, Matthew Koichi Grimes, Antoine Yang, Tyler Zhu, Joseph Heyward, Tengda Han, Shiry Ginosar, Chen Sun, Dima Damen, Simon Osindero, Noah Snavely, Simon Lynen, João Carreira, Viorica Pătrăucean
Abstract:
We push the frontier of large‑scale spatial intelligence in Vision‑Language Models (VLMs) and introduce the first benchmark that probes geographical layout understanding from real‑world videos, spanning up to 1km distances. Inspired by the cognitive science literature, we evaluate models against the hierarchical stages of human spatial awareness: anchoring via landmarks, connecting them through routes, and integrating these into global mental maps. Extensive experiments reveal a fundamental divergence in how current AI models process spatial information. Instead of utilising true path integration or forming geometric survey knowledge, we find that VLMs rely almost entirely on 2D visual recognition and text‑matching to bypass complex spatial reasoning. The benchmark is publicly available at https://perception‑test‑challenge.github.io/kilometervision.html.
Authors:Minye Shao, Chaohui Yu, Yixuan Wu, Fan Wang, Ling Shao, Yang Long
Abstract:
Foundation models can serve as clinical agents through tool‑use harnesses. However, conventional medical benchmarks assess reasoning over preselected evidence rather than the ability to seek it across clinical records and longitudinal imaging. We propose CASE: a series of role‑specific Clinical Agents for Seeking Evidence, together with a tool‑use harness and an agentic post‑training framework for compact vision‑language policy models. We further introduce a longitudinal multimodal benchmark built on UK Biobank, comprising 50,401 clinical questions derived from real‑world ICD‑10‑coded diagnoses of 4,739 participants. Each question links to a patient‑specific environment containing clinical context and multi‑sequence MRI from baseline and follow‑up visits, where agents autonomously select which visits, organs, modalities, slices, and specialist tools to inspect and compare. Supervised fine‑tuning transfers evidence‑seeking workflows from 14,734 frontier‑model interaction trajectories, followed by agentic reinforcement learning on the learner's own environment interactions. Privileged on‑policy self‑distillation and rubric‑based LLM feedback refine evidence‑to‑conclusion reasoning without prescribing tool sequences. Experiments show that CASE moves beyond question‑answer imitation toward transferable investigation policies, strengthening evidence‑grounded longitudinal reasoning. Under matched evaluation conditions, our Qwen3‑VL‑8B based agent achieves over 16% and 10% relative improvements in answer accuracy over GPT‑5.4 and Claude Opus 4.8. Code will be available at https://github.com/VinyehShaw/CASE.
Authors:Shouli Wang, Yanfeng Jia, Zhihao Ou, Zitao Su, Ruize He, Haotong Xie, Hao Peng, Juanzi Li, Xiaozhi Wang
Abstract:
During reinforcement learning with verifiable rewards (RLVR), large language models (LLMs) can exploit loopholes in their environments to obtain high rewards without improving the intended capabilities, i.e., reward hacking. Despite its risks to training efficiency and safety, monitoring and mitigating reward hacking during training remain challenging, which is limited by a lack of testbeds that reproduce hacking and reliably identify it. We introduce CATCH, a controllable testbed for studying reward hacking in coding RL. CATCH deliberately exposes environmental loopholes and provides execution‑based gold labels by comparing success under a vulnerable evaluator with task correctness under an independent audit. It also can control the model's initial hacking tendency through supervised fine‑tuning data mixtures and the difficulty of earning rewards through reward designing, enabling systematic comparisons of hacking dynamics and interventions. Experiments show that CATCH can produce diverse RL training trajectories with clear reward hacking, and analyses demonstrate that both initial models and reward difficulties shape the emergence of reward hacking. We further evaluate the effectiveness of different reward hacking detection and mitigation methods. A key finding is that a chain‑of‑thought monitor initially suppresses hacking, but this protection erodes as the policy model learn to mislead the monitor with code comments. This highlights the need to evaluate hacking mitigations throughout training with CATCH. The source code and resources are publicly released at https://github.com/THUAIS‑Lab/CATCH.
Authors:Shu Yu, Chaochao Lu
Abstract:
Online reinforcement learning has been extended to flow matching for diffusion model (DM) image generation. However, this paradigm faces three limitations: (1) Window selection. Existing methods manually set the stochastic differential equation (SDE) sampling window, i.e., the denoising steps where exploration noise is injected. We instead determine it from each model's denoising trajectory. (2) Reward saturation. Current methods rely on scoring models trained on human annotations; we find that such scores are extremely high and nearly indistinguishable on the latest SOTA open‑source DMs, making advantage estimation largely ineffective. (3) Sample inefficiency. A single scalar reward collapses different failure modes into almost identical scores, leaving minimal gradient guidance for targeted improvement. To address these issues, we propose CAST (Causal Advantage‑Structured Training), an RL fine‑tuning method for pretrained DMs, which (1) identifies the denoising step at which each model fixes the objects and their spatial arrangement in the image and uses that timing to set the SDE window, (2) decomposes each prompt via Causal Scene Graphs (CSG) into verifiable‑atoms, i.e., minimal semantic units such as an object, count, attribute, or spatial relation that can each be checked independently, and rewards each atom separately, and (3) projects the signed atom‑level advantages into pixel space through teacher‑forced attention and uses them to spatially weight the SDE policy objective. We fine‑tune two of the strongest open‑source DMs, FLUX.2‑dev and Qwen‑Image‑2512, with CAST, and evaluate them on GenEval 2, a compositional benchmark, and on Qwen‑Image‑Bench for overall quality. Within almost the same training budget, CAST's improvement over the base model on the most challenging GenEval 2 prompts is up to 3.07x that of Flow‑GRPO, while overall generation quality also improves.
Authors:Yang Wu, Jinpeng Li
Abstract:
Electroencephalography (EEG) emotion recognition serves as a pivotal interface for human‑computer interaction, yet the physiological variability across individuals complicates the already challenging task of fusing heterogeneous physiological signals (e.g., EEG and eye movements). However, most prevalent domain adaptation paradigms are tailored for unimodal scenarios, failing to address the heterogeneity of multimodal signals. Furthermore, they predominantly rely on feature‑level alignment, overlooking the fundamental data‑level discrepancy, which risks compromising fine‑grained discriminative information during aggressive adaptation. To bridge these coupled gaps, we propose Instance‑based Domain Expansion and Adversarial Learning (IDEAL), a unified framework that synergizes instance‑level curriculum expansion with feature‑level hierarchical adversarial alignment. IDEAL first introduces a multi‑model collaborative screening mechanism, which propagates high‑confidence target samples to explicitly bridge the distributional gap at the data level via a quantity‑quality equilibrium strategy. We provide a theoretical analysis that this instance expansion strategy strictly tightens the upper bound of the target risk. Subsequently, a hierarchical adversarial network, augmented with the angular‑contrastive constraints, progressively aligns representations from low‑level statistics to high‑level semantics while preserving class separability. Extensive experiments on four benchmark datasets demonstrate that IDEAL significantly outperforms state‑of‑the‑art methods. To facilitate reproducibility and future research, our source code is publicly available at https://github.com/WY‑BCI‑Club/IDEAL.
Authors:Soohan Lim, Hyundong Jin, Yo-Sub Han
Abstract:
Code watermarking supports provenance tracking for code generated by LLMs. Modifying token selection to embed watermarks as an LLM generates code can create a trade‑off between detectability and functional correctness. Other methods instead watermark completed code using predefined transformations or trained neural models. Recurring patterns can make watermark choices predictable across programs, while treating patterns common in unwatermarked code as watermark evidence can cause false detections. We therefore introduce SEW, which embeds and detects watermarks in already generated code through three components: (i) code style rules collected from style guides and transformation rules, with style choices determined by a secret key and each program's structural context; (ii) style‑preference calibration, which evaluates watermark evidence using style probabilities estimated from human‑written code; and (iii) context‑aware style aggregation, which combines evidence from structurally matching locations assigned the same code style choice, preventing repeated applications of that choice from inflating watermark evidence. On CodeContests across three LLMs and three programming languages, SEW achieves a mean relative improvement of 12.44% in TPR@FPR5% over the baselines and is robust to four non‑LLM code‑editing attacks, with only a 0.94% mean relative decrease. Our code is available at https://github.com/suhanmen/SEW.
Authors:Huimin Pan, Yufan Ren, Kunpeng Song, Siyang Wang, Xiwen Zhang, Xiaoyun Hu, Zhuoxu Duan, Hanrui Zheng, Jialeng Ni, Nathan Zhao, Sibo Ma, Zhenxuan Fan, Zhongyang Che, Danny Bao, Jiacheng Wei, Jerry Bai, Xiaoyu Yue, Xiaoyang Guo, Chenyi Chen
Abstract:
Egocentric human video offers a scalable data source for dexterous manipulation, yet using it to train humanoid robots presents two challenges: (1) an embodiment gap, as human hands differ structurally from robot end‑effectors and low‑cost egocentric recordings lack the torso kinematics required by conventional retargeting; and (2) heterogeneous data quality, including noisy hand‑pose tracking and weakly aligned text annotations. We introduce IronMind, a vision‑language‑action (VLA) model that uses egocentric human video and heterogeneous robot data to pretrain policies for humanoid dexterous manipulation. To bridge the embodiment gap, IronMind bypasses explicit body‑retargeting by using a camera‑space action representation, the native reference space of egocentric video, and semantically aligning robot and human action dimensions. Across total pretraining budgets from 250 to 10,000 hours, validation loss decreases approximately log‑linearly with data scale. Larger pretraining budgets also improve out‑of‑distribution real‑robot manipulation after post‑training: across six challenging tasks with unseen objects, affordances, and reasoning prompts, the 10,000‑hour model achieves a 55.0% success rate, compared with at most 11.7% for every pretraining budget up to 5,000 hours and 5.0% without pretraining. At the same pretraining budget, the camera‑space action representation also outperforms the torso‑frame baseline. Together, these findings support pretraining with a camera‑space action representation on large‑scale human egocentric data as a scalable foundation for humanoid robot manipulation.
Authors:Bhuvanesh Verma, Ali Abusaleh, Alexander Mehler
Abstract:
Argument Mining (AM) is a critical NLP task that remains significantly under‑resourced in Arabic. This paper presents \testttSTAR‑Ar, a BERT‑BiLSTM‑CRF architecture for argument discourse detection and classification, as our system for Daleel 2026, the inaugural Arabic argument mining shared task. The task requires the identification and classification of argumentative discourse units (ADUs) in debate and editorial texts.We jointly model these two objectives as a token‑level sequence labeling task using a BERT‑BiLSTM‑CRF architecture that combines contextual transformer embeddings with structural transition constraints to support accurate span detection. \testttSTAR‑Ar achieves an F1‑score of 72.69 on validation and 73.7 on test data. Our domain‑specific analysis shows that models trained exclusively on editorials underperform those trained on debates, a disparity we primarily attribute to the smaller size of the editorial dataset. The code for \testttSTAR‑Ar is available at \hrefhttps://github.com/ENTAILab/daleel_2026_Arabic‑Argumentative‑Discourse‑Mining\faGithub~TTLab at Daleel 2026
Authors:Zuming Zhang, Jie He, Yizhe Zhang, Jeff Z. Pan
Abstract:
Textual skills provide reusable guidance for large language model agents, but existing approaches often rely on manually curated skill banks or reinforcement learning with indirect and delayed feedback. We introduce SkillFM (Skill Flow Matching), a generative framework that synthesizes task‑conditioned textual skills directly without test‑time skill retrieval. Our framework combines a codec for encoding and reconstructing textual skills in a continuous latent space with a conditional flow model trained using improved MeanFlow. At inference time, the learned velocity field enables single‑step latent sampling, and an LLM‑based decoder converts the sampled representation into textual guidance for a frozen downstream agent. We evaluate the framework on embodied tasks, question answering, and web shopping. On ALFWorld and Search‑QA, our method achieves the best overall performance among the compared vector‑based skill approaches. Our analyses further demonstrate that latent skill generation is an effective alternative to retrieval‑based skill augmentation. Our code and training skill libraries are available at https://github.com/lulushang999/SkillFM.
Authors:Shulin Tian, Junsu Kim, Shuai Liu, Hao Li, Yujiao Shen, Sihan Li, Zhe Yang, Yeongon Kim, Feiyu Li, Jialin Wu, Yichi Zhang, Wenhui Wang, Runmao Yao, Yuhao Dong, Zhaoxi Chen, Fangzhou Hong, Antonino Furnari, Jingkang Yang, Hongyuan Zhu, Ziwei Liu
Abstract:
Real‑world embodied tasks, from everyday activities to professional procedures, require agents to act under physical constraints while tracking evolving object and task states. Tool use sits at the heart of such tasks, as many everyday and professional activities are tool‑mediated. Understanding them requires reasoning about affordances, hand‑tool‑object geometry, procedural progress, and causal effects on target objects. Yet despite strong performance on perception‑oriented video tasks such as captioning and general video QA, current multimodal video models remain limited in this form of tool‑centric embodied reasoning. Progress in this direction has been limited by the lack of real‑world egocentric data and diagnostic benchmarks. To address this gap, we introduce EgoTools, the first comprehensive suite for egocentric tool‑use understanding. It consists of two complementary components: EgoTools‑Data, a large‑scale corpus of 100 hours of tool‑centric egocentric recordings with synchronized audio, dense captions, reasoning‑heavy narrations, and supplementary 3D information; and EgoTools‑Bench, a diagnostic benchmark of 1,000 QA pairs across four tracks that cover tool‑use understanding from perception and geometry to procedure and causal reasoning. Experimental results show that current models still struggle to ground tool use in visual evidence: Gemini‑3.1‑Pro achieves 66.9% overall accuracy but only 51.7% on Perception & Grounding. Beyond evaluation, we validate EgoTools‑Data as a training resource. On the full 1,000‑question benchmark, full supervised fine‑tuning improves Qwen3‑VL‑8B‑Instruct from 50.0% to 60.9%, under strict source‑video separation. Together, these results establish EgoTools as a unified resource for both training and diagnostic evaluation of real‑world egocentric tool‑use understanding.
Authors:Junjing Zheng, Zhiyi Zhou, Ningrui Yang, Hongying Meng
Abstract:
Remote sensing object counting estimates how many buildings, vehicles, or ships appear in overhead images. Most supervised counters predict a density map, whose sum gives the object count, and assume similar categories, sizes, and backgrounds. Applying them across regions, sensors, or categories often requires target data or further training, which may be costly or unavailable. We study source‑only counting. Training for the counting task and model selection use one group of images that shares an object category and similar imaging conditions, with one point marking each object. Target images and information remain unavailable until the model is fixed. This reduces data preparation but makes transfer harder. A model trained on one source may place high density values, called responses, on real objects and repeated background structures. Road edges, parking grids, roof boundaries, and water boundaries may then be counted as objects, creating candidate origin ambiguity. COBICount separates response generation, acceptance, and background suppression. Candidate Evidence (CE) generates possible responses. Candidate Acceptance (CA) keeps compact responses centered on objects. Bias Isolation (BI) reduces responses associated with repeated background structures. Their outputs form the final density map. Trained on RSOC Building and evaluated directly on DOTA Large Vehicle, Small Vehicle, and Ship, COBICount achieves the lowest mean absolute error (MAE) averaged over the target domains among the compared methods, 174.132. It uses 5.07 million parameters and 17.41 billion floating point operations for a 512x512 input. COBICount improves transfer without target data or training for each target. The code will be available at: https://github.com/yixuxi22/COBICount.
Authors:Gengyuan Zhang, Xiao Han, Xinyu Xie, Tong Liu, Volker Tresp
Abstract:
Multi‑image understanding requires MLLMs not only to recognise the content of individual images, but also to organise visual evidence distributed across them. We study this problem through multi‑image re‑representation, viewing prompted Chain‑of‑Thought reasoning and agentic visual tool use as different ways of re‑organising visual evidence during reasoning. We introduce Mosaic, a general‑purpose multi‑image visual harness that enables an MLLM to actively construct visual intermediates with ten composable image operations. We compare five re‑representation settings on existing multi‑image benchmarks and on MosaicBench, a new grounding‑focused benchmark for fine‑grained multi‑image understanding. Our experiments show that the relative benefits of textual and visual re‑representation are strongly task‑dependent. Visual re‑representation is particularly effective for tasks requiring precise visual evidence, including hypothesis testing, precision comparison, and orientation‑sensitive reasoning, while tasks dominated by higher‑level semantic content show smaller or less consistent gains. Building on this finding, we train MosaicAgent‑8B to use Mosaic with reinforcement learning using only accuracy and format rewards. Without demonstration trajectories or rewards for specific tool‑use, the agent learns to compose visual operations over multiple steps and exhibits diverse problem‑solving patterns unpromptedly. Code and data will be released at https://github.com/gengyuanmax/Mosaic.
Authors:Wenxin Wu, Lingyong Yan, Lei Sha, Shuaiqiang Wang, Jiashu Zhao
Abstract:
LLM agents increasingly rely on reusable Skills for complex, multi‑step tasks, creating a critical supply‑chain attack surface where poisoned Skill content steers agent decision loops under benign requests. Existing skill poisoning attacks either colocate actuation with its contextual pretext or distribute actuation across multiple Skills, but do not explicitly separate the rationale for execution from the operation itself. In this work, we reveal that untrusted agent decisions fundamentally depend on two conceptually distinct Risk‑Realization Factors (RRFs): an actuation factor (specifying what concrete operation is performed) and a pretext factor (providing the situational rationale for why the agent must perform it). Guided by this abstraction, we propose a coordination‑based attack paradigm: decoupling pretext from actuation. Rather than fragmenting the malicious actuation, we preserve it as an intact operation within a downstream Steering Skill, while delegating the pretext factor to an upstream Grounding Skill that subtly alters persistent environment artifacts through routine utility operations. The intact actuation thus hides in plain sight, appearing completely legitimate and task‑driven only when evaluated against the fabricated pretext. Building on this formulation, we develop an automated framework that discovers authentic execution dependencies, synthesizes coordinated pretext‑actuation skill pairs, and iteratively refines poisoned skill instructions via runtime closed‑loop feedback. Extensive evaluations across single‑session and persistent cross‑lifecycle scenarios demonstrate that decoupled skill poisoning achieves high attack success, exposing a critical blind spot in isolated Skill security audits. Our automated framework code is available at https://github.com/Wenxin‑buaa/CoordPoison.git.
Authors:Bohan Zhang, Linan Yue, Weibo Gao, Pengyu Chen, Hong Guo, Yanqi Hao
Abstract:
Large language models (LLMs) offer strong reasoning capabilities but are often costly to access through commercial APIs, while small language models (SLMs) are easier to deploy locally yet remain weaker in reasoning. This capability‑deployment gap has motivated LLM‑SLM collaboration, which aims to improve SLM reasoning using LLM capabilities while preserving the deployment advantages of SLMs. Existing approaches mainly follow two paradigms. Knowledge distillation uses LLM‑generated answers and reasoning trajectories to train SLMs offline, but requires parameter updates and additional training. Alternatively, online collaboration routes difficult problems to an LLM or leverages LLM‑generated guidance and corrections when an SLM encounters difficulties. Although effective, online collaboration requires repeated LLM access. Moreover, the guidance produced for a particular problem is discarded after inference and cannot benefit subsequent problems involving similar reasoning states. In the paper, we focus on a more constrained setting in which the LLM is accessed only offline, the SLM parameters remain fixed, and online inference is performed solely by the SLM. To this end, we propose Reusable Latent Correction (RLC), which converts one‑off natural‑language guidance from a black‑box LLM into persistent corrective experiences in the hidden space of an SLM. RLC stores these experiences in an external bank and retrieves them according to the SLM's current reasoning state, enabling the SLM to reuse LLM‑derived corrections during inference without any online LLM calls. Experiments across multiple reasoning benchmarks and SLM scales show that RLC consistently improves SLM reasoning without parameter updates or online LLM calls. Code is available at https://github.com/ZBH031/reusable‑latent‑correction.
Authors:Wenjin Wang, Jiazhen Lei, Yuxin Sha, Nuwa Xi, Meng Zhao, Xingxi Yin, Qi Liu, Yuliang Shen, Zixun Sun
Abstract:
Autonomous AI agents can turn authors' goals into interactive narratives by independently organizing and carrying out generation and revision. As agents generate and revise extensive content, authors struggle to grasp its overall structure, local details, and relationships, complicating continued guidance. We present NarrativeSteward, an authoring environment that organizes outlines, worldbuilding, and narrative graphs as linked artifacts for agent implementation and author guidance. Agent dialogue and project‑wide structural review help authors understand the evolving work and guide local and cross‑layer revisions, while change records and execution verification help authors assess the resulting work. Technical tests validated the system's change records, recovery mechanisms, and execution diagnostics. In a 12‑participant within‑subject study, NarrativeSteward supported easier formulation of revision requests and inspection of changes, and greater perceived understanding of changes and story structure, than general‑purpose agents. Qualitative findings show how reviewing the work and feedback helps authors develop requirements and guide subsequent delegation. We open‑source NarrativeSteward at https://github.com/Tencent/NarrativeSteward.
Authors:Chanryeol Lee, Chanhyuk Lee, Yeonwoo Choi, Donggyun Kim, Seunghoon Hong
Abstract:
Long‑context inference with Large Language Models (LLMs) is bottlenecked by the linearly growing memory of the key‑value (KV) cache. Existing compression methods reduce the cache through token eviction or approximation, but degrade sharply at aggressive compression budgets. We propose PatchKV, a training‑free framework that compensates KV cache compression methods by carrying part of the context in the model's weights. PatchKV pairs an off‑the‑shelf compressed KV cache with a context‑specific weight patch, which is computed once at context‑loading time and served for downstream queries for the context. The weight patch is derived in closed form via ridge regression, by aligning the block‑wise activations of context‑derived reference query tokens under the full cache and the compressed cache. Once merged into the model, the patch leaves the forward graph and per‑query inference cost unchanged in the single‑context, multi‑query setting. Across long‑context QA (SCBench with up to 170K tokens, SQuAD, NIAH) and math (GSM8K) benchmarks on three model architectures, PatchKV consistently improves cache compression methods, suggesting an alternative direction to compensate them at aggressive budgets.
Authors:Jingqiu Wang, Yan Wang
Abstract:
Vision‑Language‑Action (VLA) models have recently incorporated world models to provide richer dynamic supervision beyond sparse action labels. However, explicitly predicting future images or videos may include control‑irrelevant appearance, while guidance derived from holistic future visual representations and shared global action features may fail to establish timestep‑specific correspondence between actions and local visual changes. To address this issue, we propose MotionWeave, a motion‑centric future‑dynamics framework for action‑chunk prediction with two modules: the Action‑Induced Motion Grounder (AIMG) and the Horizon Residual Composer (HRC). Specifically, AIMG conditions on action and proprioceptive representations to construct horizon‑specific queries that localize interaction regions associated with each future action timestep from current visual tokens. HRC extracts differences between interaction representations at adjacent horizons, encodes them as temporal motion cues, and injects them into action tokens through a gated residual. During training, robot‑arm masks rendered from future frames are used to construct KL‑based motion‑grounding supervision, while inference uses only the current observation. On six MetaWorld tasks, MotionWeave achieves a 75.3% average success rate, an absolute gain of 8.6% over π0 (66.7%), especially on sustained‑interaction tasks. Our code is available at https://github.com/autu‑mn/MotionWeave.
Authors:Weihao Shen, Wei Chen, Fuwei Zhang, Guojun Liu, Qingsong Hua, Wei Lin, Fuzhen Zhuang
Abstract:
Generative retrieval has emerged as a general retrieval paradigm, representing items with discrete Semantic IDs (SIDs) and retrieving them through autoregressive identifier generation. When SIDs are constructed with residual quantization (RQ), standard retrieval training supervises only the selected codes and discards the residual trajectories that produce them. The same hard code can nevertheless arise from different preferences over competing codewords, while the residual trajectory also contains information about subsequent quantization decisions. As a result, hard SID supervision collapses distinct quantization behaviors into identical targets and leaves information available during indexing unused in retrieval training. We introduce ResTD, a Residual Trajectory Distillation framework that transfers this discarded indexing information into retrieval training. Treating the frozen RQ indexer as a process teacher, it distills residual‑induced codeword preferences into SID‑decoding states. This supervision recovers distinctions hidden by hard assignments and allows earlier decoder states to capture information about subsequent quantization decisions before the corresponding SID suffix is generated. In this way, richer information from SID construction is incorporated into retrieval learning while preserving the original retrieval index and inference procedure. Experiments on multilingual e‑commerce retrieval show consistent improvements over strong baselines and matched training controls. Controlled comparisons show that residual‑derived targets outperform the tested codebook‑only soft targets. Representation probes further show that future codebook preferences become more recoverable from earlier decoder states. ResTD can also be readily extended beyond retrieval to generative recommendation. Code is available at: https://github.com/Nevaeh7/iclr2027_ResTD.git.
Authors:Tianyu Zhang, Zhaoyang Jia, Houqiang Li, Dong Liu
Abstract:
Generative image compression produces visually plausible reconstructions at low bitrates, yet their behavior as the rate approaches zero remains largely unexplored. When pushed below normal operating rates, representative codecs undergo semantic collapse: rather than gracefully losing source‑specific detail, they produce malformed or unrecognizable content. Our analysis identifies two factors. As the bitrate decreases, reconstruction losses increasingly conflict with semantic objectives on gradients and visual results, while pixel‑space and reconstruction‑oriented VAE diffusion models become less efficient on semantic preservation. Guided by these findings, we introduce RAE‑CoD, a compression‑oriented diffusion (CoD) built in a representation autoencoder (RAE) space with direct alignment between compressed and source representations, preserving recognizable, naturally structured content for a 256×256 image with as few as 16 bits. We evaluate this framework using five vision foundation models (VFM) and a blinded vision‑language model protocol. On MSCOCO‑30K, RAE‑CoD stands out from all evaluation. At 0.001‑0.008 bpp, it reduces relative VFM feature MSE and Fréchet Distance ratio by at least 25.7% and 69.1% over the best competitors. Meanwhile, semantic recognizability and quality of the reconstructions remain nearly constant while source consistency falls smoothly, replacing abrupt semantic collapse with a graceful transition toward unconditional generation. Code will be released at https://github.com/LuizScarlet/RAE‑CoD.
Authors:Weihao Shen, Wei Chen, Fuwei Zhang, Guojun Liu, Qingsong Hua, Wei Lin, Fuzhen Zhuang
Abstract:
Generative retrieval with semantic identifiers (SIDs) makes successive decisions over a document hierarchy. Relevant documents for the same query may share coarse prefixes and diverge at finer depths, with branching patterns varying across queries. These paths reveal how relevance is distributed across successive refinements, yet standard full‑SID supervision treats them as separate training targets. To make this allocation explicit, we formulate multiresolution relevance as consistent conditional distributions induced by a single document‑level relevance measure across the SID hierarchy. We introduce RARS, Resolution‑Aligned Relevance Supervision, which uses the resulting refinement‑level distributions to supervise a shared query representation. RARS aggregates document relevance over prefixes and trains a prefix‑conditioned predictor to allocate relevance among sibling branches. All relevance‑bearing children participate in local competition, and each local loss is weighted by the relevance mass reaching its parent. This objective trains the query encoder to capture both the coarse structure shared by relevant documents and their finer branch allocations. The predictor is discarded after training, preserving standard autoregressive retrieval at inference. Experiments on three multilingual ESCI locales show consistent improvements over matched full‑SID training under autoregressive decoding. RARS also outperforms grouped soft‑target, decoder soft‑target, and sampled‑tree supervision under a common retrieval rule. The gains persist across alternative identifier structures and relevance definitions. Code is available at: https://github.com/Nevaeh7/RARS
Authors:Jinsung Jeon, Seung-won Hwang
Abstract:
Precise numerical reasoning with Large Language Models (LLMs) is essential for expanding their applicability to complex real‑world tasks. However, text‑based tokenization often fragments numbers, significantly hindering precise arithmetic reasoning. Meanwhile, numerical embeddings, despite arithmetic precision, rely on context‑agnostic substitution that disregards the semantic role of numbers as identifiers. To combine the complementary strengths, we propose ANI (Adaptive Numerical Injection), a hybrid framework that governs the selective injection of numerical features based on the semantic context. By employing a context‑aware gating mechanism, we selectively inject numerical embeddings (specifically FoNE) into the latent space, explicitly preserving nominal identifiers while enhancing quantitative operands. Through extensive evaluations across various LLMs, we demonstrate that ANI enhances MATH performance by 9.5 points over the official reference model, while maintaining robust performance on general linguistic benchmarks.
Authors:Mykhailo Minin
Abstract:
Physics‑informed computational methods usually optimize parameters within a functional representation whose structure is fixed in advance. This work proposes a Physics‑Informed Method of Group Data Handling (PI‑GMDH), in which representations of coupled physical fields are progressively constructed during solution. Candidate functional directions are evaluated through the first variation of the complete physical and observational objective, introduced in packages, and followed by block‑coordinate damped Gauss‑Newton coefficient optimization. The framework is demonstrated with tensor‑product Chebyshev functions on the incompressible Navier‑Stokes equations using a two‑dimensional time‑dependent Taylor‑Green benchmark. Under the tested configuration, adaptive PI‑GMDH reached validation and held‑out test losses of 5.299e‑19 and 5.296e‑19 with 204, 201, and 175 active functions for u, v, and p. Complete degree‑by‑degree and all‑terms PI‑GMDH variants, together with selected PINN and KAN reference configurations, are used to examine the effect of structural construction policy. The results show that, for this controlled synthetic benchmark, selective progressive construction can provide a favorable combination of accuracy, representation size, and wall‑clock time. The comparison is illustrative rather than a claim of universal superiority over alternative physics‑informed approaches.
Authors:Junyao Gao, Sibo Liu, Weidong Zhang, Cairong Zhao, Jun Zhang
Abstract:
This report presents MegaAvatar, a controllable talking avatar generation framework built on top of the Wan2.2‑TI2V‑5B model. Compared with previous talking‑avatar methods that mainly rely on audio or reference‑image conditioning, we introduce additional SMPL‑X‑derived 3D guidance, enabling global control over body pose and head motion. Specifically, we render the driving SMPL‑X sequence into dense mesh frames and encode them with a lightweight 3D convolutional encoder, whose outputs are injected into the latent tokens to provide overall motion control. Furthermore, we extend Wan2.2‑TI2V‑5B with additional audio and face cross‑attention modules to enable fine‑grained expression control and preserve the input identity, respectively. In addition, we implement an audio‑to‑SMPL‑X model to predict an SMPL‑X sequence conditioned on the reference image and input audio, allowing MegaAvatar to support audio‑driven inference without user‑provided SMPL‑X frames. Experiments show that MegaAvatar achieves high‑quality talking avatar generation with controllable body and head motion, speech‑synchronized facial expressions, and consistent identity preservation. MegaAvatar also supports inference with flexible resolutions and video lengths. Codes, dataset, models will be avaliable in https://github.com/Jeoyal/MegaAvatar
Authors:Gyujeong Park
Abstract:
Randomised copies of a connectome are the usual baseline for asking whether measured wiring matters, and the answer depends on what the randomisation preserves. We evolved embodied foraging agents whose brains are a compressed adult Drosophila connectome (FlyWire v783; 512 cell‑type groups and 1,000 Kenyon cells) alongside agents built on randomised wiring, in pre‑registered experiments with ten seeds, four ecologies and 600 generations. Two standard randomisations, a column shuffle and degree‑preserving edge swaps, route 10.6 to 10.7 % of olfactory output directly onto descending motor groups, against 0.012 % in the connectome. On the registered primary endpoint, fitness averaged over the run, no difference was detected; at the last common‑garden probe the connectome was behind both controls (‑0.22 and ‑0.20 fitness units on seed means). Against controls that keep every sensory‑output and motor‑input edge and rewire only the interior, the seed‑mean difference lay within a +/‑0.10 equivalence bound (+0.002 and ‑0.074, unchanged under a calibration that also matches activity spread), although per ecology the interior column shuffle was ahead by 0.26 in one of four ecologies at ten seeds, a lead that ten further pre‑registered seeds did not replicate. Rewiring the connectome so that it acquires the shortcut raised its fitness by 0.44 (10 of 10 seeds) and its dependence on olfaction from 0.15 to 0.99; graded doses raised both in step; at comparable swap counts the full dose was ahead of an interior‑only sham by 0.53 (10 of 10 seeds); and a sham that rewired the same boundary edges without creating shortcuts matched the connectome (+0.007) while the full dose was ahead of it by 0.60. What a null preserves at the sensory‑motor boundary can decide an evolutionary connectome comparison, and sensory‑to‑motor path statistics belong next to the degree statistics a null is said to preserve.
Authors:Elia Onofri, Roberto Di Pietro
Abstract:
Automatic evaluation of faithfulness increasingly relies on a large language model acting as a judge, yet the most reliable judges are proprietary frontier models, costly and ill‑suited to high‑throughput monitoring. We investigate whether a panel of cheap open‑weight judges (4‑‑9B) can be aggregated to stand in for a frontier one, what the substitution sacrifices, and when it is worth making. We propose RAIM, an aggregation scheme robust to the members' correlated errors, coupling a cross‑fitted stacked logistic regression with an admissibility test that, read from the members' own outputs, identifies when aggregating them improves on their best member and stays within reach of the frontier judge. We instantiate RAIM with ten judges from disjoint families across eight faithfulness benchmarks. Against Claude Sonnet, the panel retains a median 93% of its Cohen's κ and gives up only 2.9 points of balanced accuracy on average; read as paired differences, it clearly improves on one benchmark and clearly worsens on three (only two by a non‑negligible margin), leaving four unresolved. At a sixty‑fourth of the frontier's inference price, the operative expense is a one‑time in‑domain calibration on 50‑‑100 labelled records. The panel is also competitive with purpose‑trained detectors on their home benchmarks (within 1.3 accuracy points of GPT‑4o and 1.9 of the LLM‑AggreFact leader), and beats the strongest one we reran by 6 points on our grounded sets. Whether aggregation pays depends on the members themselves: where several capable members err on different items, the panel improves on its best judge and approaches the frontier; where one dominates, the stacker recovers the leader, and only there does the frontier remain materially ahead. Both conditions are read off the calibration set at no further cost, so a cheap panel can stand in for a frontier one wherever this audit admits it.
Authors:Weili Xu, Jisen Li, Yuqing Jian, Chenxi Li, Zhizhou Sha, Yifan Yu, Qingyang Wu, Chenfeng Xu, Zhongzhu Zhou, Tianyi Zhang, Ben Athiwaratkun
Abstract:
Large language model (LLM) inference is increasingly moving toward lower precision to realize the throughput of hardware accelerators, but aggressive post‑training quantization (PTQ) can degrade model quality. We present QATFactory, an open‑source framework for deployment‑aligned quantization‑aware distillation (QAD) and reinforcement learning (QARL). QATFactory simulates deployment‑time quantization while performing matrix multiplications in BF16, allowing models to adapt to quantization noise without requiring training hardware that natively supports the target format; for example, it supports NVFP4 training on H100 GPUs, which lack FP4 Tensor Cores. The framework supports NVFP4, MXFP4, and \textllama.\textcpp's Q4_K format; dense and mixture‑of‑experts models; and both full‑parameter and LoRA‑based training. It exports checkpoints directly to vLLM and \textllama.\textcpp without an additional lossy conversion step or added inference overhead. With QATFactory, we conduct extensive experiments on models ranging from 8B to 230B parameters and evaluate exported checkpoints in production inference engines. Across models and formats, QAD consistently improves deployed‑model quality over strong PTQ baselines. On Qwen3.5‑9B, QAD achieves average benchmark accuracies of 68.9% under NVFP4 and 66.0% under MXFP4, outperforming the best PTQ results of 65.4% and 56.4%, respectively. Through our experiments, we found that although both FP4 formats quantize weights and activations at deployment, the best training strategy is format‑dependent: NVFP4 generally performs better when only weights are quantized during training, whereas MXFP4 benefits from quantizing both weights and activations. At a fixed training token budget, training on fewer 32K sequences improves average accuracy by 1.9 points over training on more 4K sequences.
Authors:Xu Huang, Ye Huang, Zijun Liao, Yuwei Niu, Xiaojie Li, Menghan Zhou, De Wen Soh, Xiaotong Li, Daquan Zhou
Abstract:
High‑compression tokenizers are essential for scaling latent image generative models. However, aggressive compression creates a fundamental tradeoff between reconstruction fidelity and generation efficiency: high compression image encoder always increases the learning difficulty of diffusion training, resulting in slow model convergence. Recent representation autoencoders speed up the diffusion training by improving the latent feature's expressive capability by replacing VAE encoders with pretrained semantic encoders, yet they are typically limited to moderate compression and lose pixel‑level details necessary for faithful reconstruction. To achieve both high compression and fast diffusion training, we propose DC‑SAE, a Decoupled Compact Semantic Autoencoder designed for high‑compression image generation with accelerated diffusion model convergence. DC‑SAE consists of two key components: (1) a macro‑level architecture design that leverages semantic encoders to enable higher compression ratios, and (2) a pixel‑level encoder that preserves low‑level details, ensuring high‑fidelity image reconstruction. We empirically demonstrate that DC‑SAE performs strongly on image generation tasks, achieving both compact latent representations and efficient training dynamics. Specifically, on the ImageNet dataset with 512 × 512 resolution, DC‑SAE achieves 32× spatial compression, with 29.79 PSNR and 3.37 gFID, substantially outperforming the previous state‑of‑the‑art high‑compression tokenizer baselines DC‑AE by 13.5% and 54.9% on PSNR and gFID, respectively, maintaining comparable throughput and faster diffusion model training convergence. Beyond class‑conditional generation, a 1.6B‑parameter DiT using DC‑SAE achieves 0.84 on GenEval and 86.007 on DPG‑Bench for text‑to‑image generation at 1024×1024 resolution.
Authors:Osama Mustafa
Abstract:
Pulling a fixed set of fields out of documents that arrive in many formats and under drifting schemas is usually done with hand‑written byte patterns, which break whenever a key is renamed, a value is reformatted, or a lookalike value appears first. We argue the cause is structural: one pattern must both describe the value and locate it among its surroundings. O‑Funnel separates the two. It transcribes any XML, JSON, CSV, HTML or key‑value text document into one typed tree over five constructors, gated by an oracle that rejects any capture that does not reconstruct its source. Each needed field is declared in the tree's own terms and located by fusing independent evidence (key, path, value shape, synonym, key spelling, record neighborhood, value profile), so the best‑supported node wins and a missing field is reported with a reason. Data no requirement claims becomes residue that a funnel traces back to the requirements to learn new key aliases. On 34,989 real PubMed records, O‑Funnel matches a hand‑written parser (F1 1.00). After a five‑element schema rename, the parser's regular expressions fall to 0.20 while O‑Funnel stays at 1.00, with every capture verified complete. On constructed suites that isolate regex failure modes it raises F1 from 0.43 to 1.00, and from 0.80 to 0.94 after self‑improvement; on held‑out schema‑matching instances it is competitive with classical matchers without training. O‑Funnel is a dependency‑free Python library (pip install ofunnel).
Authors:Ralf Hielscher, Tim Pöschl, Erik Wünsche
Abstract:
We consider harmonic approximation on the torus \mathbbT^d, the sphere \mathcalS^d, and the rotation group \mathrmSO(3). While several global approaches are available for computing a harmonic expansion from scattered data, their stability and, especially, their runtime depend strongly on the geometry of the nodes, in particular on a sufficiently small fill distance. Even a single large hole in the data may cause instability and long runtimes. We propose harmonic approximation via moving least squares (HAMLS), a global harmonic approximation scheme that avoids the ill‑conditioned global solve and works well in both the overdetermined and the underdetermined settings. The main idea is an intermediate transition from the scattered data to a quadrature grid, which is realized via moving least squares (MLS). This replaces one large global problem by many small local ones that can be regularized individually. The global harmonic approximation is then obtained via quadrature using a fast Fourier transform. This makes the global stage fast, stable and non‑iterative. For sufficiently smooth functions sampled at well‑distributed nodes with small fill distance h, we bound the resulting \mathrmL^2‑error by the error of the harmonic approximation obtained from exact values on the quadrature grid, plus a term of order h^K+1, where K is the polynomial degree employed in the MLS step. Numerical experiments on \mathcalS^2 with ill‑distributed nodes show that HAMLS achieves errors comparable to those of global least‑squares approximation, while being significantly faster, especially for larger bandwidths.
Authors:Sebastian Endt, Marcus Wirth, Johannes Reinhold Schlund, Marion Irene Menzel
Abstract:
Fiber orientation and compartmental microstructure are central to the characterization of white matter tissue in diffusion MRI, yet existing methods either resolve fiber orientations without quantifying microstructure, or quantify microstructure while assuming a fixed number of compartments and a single fiber direction. Nonparametric approaches that recover both require tensor‑valued diffusion encoding and computationally expensive Monte‑Carlo inversion of an ill‑posed inverse Laplace transform. We propose to reframe this problem as an object detection‑like task, adopting the Detection Transformer (DETR) architecture to jointly predict mean diffusivity (MD), fractional anisotropy (FA), main fiber direction, and signal fraction for a variable number of compartments per voxel from standard multi‑shell diffusion MRI with linear encoding. Hungarian matching during training resolves permutation invariance across compartments. We introduce mean Average Precision as a reproducible benchmark metric. Evaluated on synthetic test data with up to five compartments per voxel, our model achieves R^2=0.95 for MD, R^2=0.88 for FA, and a median angular error of 4.2°, with performance scaling naturally with compartmental signal fraction.
Authors:Zijie Zhao, Shengqian Chen, Xiaoxu Wang, Han Jiang, Yuanheng Zhu, Dongbin Zhao
Abstract:
High‑precision locomotion combines motion‑command tracking with precise regulation of task‑relevant physical states, enabling robots to interact reliably with their surroundings during motion. Joint end‑to‑end optimization can leave precision objectives insufficiently optimized, while reactive residual control adjusts actions only after deviations become observable. We present LocoWM, a world‑model‑guided preactive residual adaptation framework for high‑precision locomotion. A base policy provides command‑following locomotion, while an action‑conditioned world model predicts a sequence of future physical states from proprioceptive history and the proposed base action. A residual adapter conditions on this predicted sequence to generate additive action corrections that compensate for anticipated deviations. Two‑stage training first learns locomotion and action‑conditioned dynamics, then freezes both modules while training the adapter, separating locomotion acquisition from precision adaptation. Experiments spanning terrain leveling, acceleration compensation, and push recovery demonstrate improved control precision and disturbance robustness over end‑to‑end and reactive residual baselines. Demos and code are available at: https://zhaozijie2022.github.io/LocoWM
Authors:Zhihan Zhang, Lizi Liao
Abstract:
Reinforcement Learning with Verifiable Rewards (RLVR) has improved the reasoning capabilities of Multimodal Large Language Models (MLLMs), yet existing frameworks rely on coarse, sequence‑level reward signals that lack the fine‑grained supervision over the visually‑grounded steps within a multimodal reasoning chain. We investigate this gap through the lens of two token‑level metrics: visual dependency (i.e. how much a token's prediction relies on the input image features) and predictive entropy. Our empirical analysis reveals two key findings: (1) correct reasoning chains exhibit a markedly sharper entropy reduction as visual grounding intensifies, compared to incorrect ones; (2) pivotal tokens, those whose misprediction triggers reasoning collapse, are statistical outliers in the joint distribution of visual dependency and predictive entropy derived from correct chains. Motivated by these findings, we propose token‑level perception‑grounded advantage estimation (TPAE), which estimates token‑level advantages by measuring each token's statistical consistency with the vision‑entropy patterns of correct rollouts. TPAE leverages this granular score to modulate the sequence‑level advantage, producing a fine‑grained supervision signal that can be integrated into various RLVR frameworks. Extensive experiments on seven benchmarks show that TPAE consistently outperforms leading strong baselines, yielding more stable and efficient optimization for multimodal reasoning. The code is publicly available at https://github.com/Zhihan72/TPAE.
Authors:Hanwen Liu, Yuanfu Sun, Qiaoyu Tan
Abstract:
Deep research tasks require agents to navigate large knowledge spaces, synthesize evidence across many sources, and adapt their plans as findings emerge. Directed acyclic graph (DAG)‑based multi‑agent systems suit this setting because they support parallel execution and isolate each sub‑task within a focused dependency context. Yet existing DAG‑based agents instantiate a task‑level plan before execution and repair the graph only after failures or missing evidence are observed. This Plan‑then‑Patch strategy is brittle for deep research: the system commits most strongly when its evidence is weakest, and later revisions waste computation on branches that should not have been planned. We propose DAGent, a DAG‑based multi‑agent framework with Evaluate‑then‑Grow incremental planning: an Orchestrator grows the task graph one batch at a time, conditioning each expansion on confidence and uncertainty signals from completed nodes. A hierarchical context layer propagates compact QueryDocs by default while preserving full execution traces for on‑demand recall. The recorded DAG topology admits structural RL signals that outcome‑only recipes cannot define; DAGRPO, a GRPO adaptation, injects topology‑conditioned credit on Executor rollouts and a structural compliance regularization on Orchestrator plans. Across BrowseComp‑Plus, GAIA, and xbench‑DeepSearch, DAGent surpasses the strongest open‑source baseline by 5.3 / 5.8 / 2.0 points at the Qwen3‑235B‑A22B scale, and the lead replicates across four open‑source backbones and extends to GPT‑5 at 327K context. At the Qwen3‑8B scale, DAGRPO improves over a same‑budget outcome‑only GRPO baseline by 3.0 average Pass@1 points. A same‑architecture comparison shows that evidence‑conditioned planning reaches higher accuracy at lower per‑task token, tool‑call, and step footprints than its Plan‑then‑Patch counterpart. Code: https://github.com/hanwenliu6825/DAGent
Authors:Ruiqi Li, Xuanyi Liu, Sijia Li, Haofeng Wang, Yuxin Liu, Feng Xie, Songchao Tan, Shiqi Wang, Hanwei Zhu, Yizong Wang, Chuanmin Jia, Siwei Ma
Abstract:
Current image‑to‑video models achieve visual realism and physical plausibility, but reasoning about mental states remains unexplored. Actions are driven by belief, desire, and perception, requiring inference beyond explicit instructions. We introduce MindWorldBench to evaluate mental‑state‑conditioned video generation. We formalize this as mental‑state‑to‑behavior reasoning, where models generate actions from a world state and latent variables without explicit action prompts. MindWorldBench utilizes Zero‑Action Prompting and a counterfactual design with 744 prompts to isolate the causal effects of mental states. An automated pipeline evaluates video quality, commonsense plausibility, and mental‑state consistency. Evaluations of 11 models show that despite visual fidelity and physical reasoning, models fail to align behaviors with latent mental states. We identify a failure mode, termed Omniscient Bias, where models default to the objective world state rather than human's subjective belief. These results demonstrate a disconnect between visual generation and cognitive reasoning, suggesting a need for explicit mental‑state modeling in video generation systems. Project website: https://richard2049‑lee.github.io/MindWorldBench/
Authors:Yunbei Zhang, Janet Wang, Jihun Hamm, Chandan K Reddy
Abstract:
Can structured text replace vision for diagram reasoning? A wrong answer after textualization can arise because the representation omits information the question needs, or because the solver fails to use information that is present. We introduce a diagnostic protocol to distinguish these explanations. Using the same solver model and generation settings, we compare three input conditions: the original image, question‑blind structure extracted by a vision‑language model, or gold structure derived from the diagram source. Validity‑triggered recovery tests truncation and schema failure, question‑relevant fidelity measures preservation of answer‑critical structure, and matched edge interventions test the effect of error location. On a reserved holdout of 240 public FlowGen diagrams, evaluated under a frozen protocol, gold structure reaches 87% accuracy while direct vision and learned text both remain below 30%. The aggregate comparison includes source‑derived relation labels that may not be printed in the image and uses different learned and gold graph encodings, so it does not isolate extraction error alone. Retrying only invalid extractions makes nearly every public representation schema‑valid yet leaves accuracy essentially unchanged. The public learned‑text deficit relative to gold more than doubles with structural difficulty. Question‑relevant topology predicts correctness better than whole‑graph topology. In an exposed intervention study, a single answer‑relevant edge edit reduces the primary solver's original‑answer accuracy to near zero, while matched irrelevant edits largely preserve it. Supplied structure requires fewer solving tokens than vision, but learned acquisition removes this advantage at single use. These comparisons motivate evaluating acquired text by the answer‑relevant evidence it preserves and by the solver's ability to use that representation.
Authors:Mohamed Amine Ketata, Maximilian Schambach, Stephan Günnemann
Abstract:
Generative models for tabular data are typically trained separately for each dataset, limiting knowledge transfer and requiring the storage of many specialized models. In this paper, we introduce CDMD, a tabular diffusion model trained jointly across heterogeneous datasets with different schemas and variable numbers of numerical and categorical features. Unlike existing cross‑dataset tabular diffusion models that operate in continuous representation spaces, CDMD defines diffusion directly over the mixed‑type feature space and is trained end‑to‑end. To accommodate heterogeneous categorical domains, we introduce a schema‑restricted reverse‑process parameterization for masked diffusion models, in which the output space dynamically adapts to each feature's vocabulary. We then compose numerical and categorical feature‑level diffusion processes into a schema‑dependent row‑level process. A shared schema‑aware Transformer denoiser captures dependencies between features and parameterizes the reverse process across varying schemas. On seven real‑world datasets, a single jointly trained CDMD achieves the highest average generation quality among strong single‑dataset and cross‑dataset baselines, while using substantially fewer total parameters than the collection of separately trained models. Furthermore, pre‑training on a corpus of 337 datasets improves generation on previously unseen datasets under both limited target data and limited adaptation epochs. These results demonstrate the potential of direct mixed‑type diffusion for shared and transferable tabular data generation. Our code is available at https://github.com/ketatam/cdmd.
Authors:Siyuan Liu, Kanghui Tian, Yue Duan, Yutao He, Shangdong Yang, Jian Zhang, Yinghuan Shi
Abstract:
On‑policy distillation (OPD) improves reasoning by providing token‑level supervision from a teacher on a student's own trajectories. Existing methods primarily focus on enhancing this teacher‑side guidance (e.g., by enriching teacher inputs and refining teacher feedback), yet we find that limited student perception is another critical bottleneck in multimodal OPD. By providing oracle visual facts, the performance of OPD‑trained students can still be substantially improved for both weak and strong teachers. To address this bottleneck, we propose S‑OPD, a simple multimodal on‑policy distillation framework that explicitly strengthens student perceptual learning through two objectives. Specifically, Teacher‑calibrated Policy Contrast separates student policies under original and masked images with teacher‑based token‑level gating, strengthening the student's reliance on visual evidence during reasoning. Policy Agreement aligns student policies under original and noise‑perturbed images, further improving perceptual robustness to visual noise. Notably, our method can be seamlessly plugged into existing OPD frameworks, requiring no additional data annotations, model parameters or inference operations. Extensive experiments on eight benchmarks across student scales and distillation paradigms demonstrate consistent performance improvements, with gains of up to 4.25 points on LogicVista. When combined with existing teacher‑side supervision methods, our method can yield further gains. Code is available at https://github.com/Sirilaw/S‑OPD.
Authors:Aditya Nagarsekar, M P Ashish Bhat, Aadi Nesarkar, Vrishti Godhwani, Rahul Yedida, Aditya Challa, Danda Sravan, Snehanshu Saha
Abstract:
Model selection in computational biology often relies on validation data drawn from the training regime, even when deployment lies outside it. When validation no longer preserves which model is best, a natural alternative is to rank candidates using properties of the trained network itself. We test this idea using a novel, forward‑only proxy motivated by the norm of the Hessian, alongside common Hessian measures, across molecular property, protein fitness, and drug‑response tasks. Contrary to our hypothesis, geometry does not become more useful as validation Spearman correlation deteriorates: augmenting validation helps some shifts but significantly harms others. More surprisingly, the proxy still correlates with generalisation gap on most tasks even when Hessian trace and top‑eigenvalue relationships are weak or reversed, yet this signal does not reliably identify the deployment‑best model. A curvature bound need not preserve cross‑model rankings, and low geometric scores can even favour collapsed predictors. Thus, a generalisation signal need not be a model‑selection signal.
Authors:Kai Wang, Mingle Zhao
Abstract:
Perceiving human motion via privacy‑preserving 4D millimeter‑wave (mmWave) radar is critical for next‑generation human‑robot interaction (HRI), where point cloud scene flow serves as a foundational motion representation. Yet the extreme sparsity and noise of 4D radar point clouds make non‑rigid motion flow estimation severely ill‑posed‑‑a challenge that existing rigid‑centric methods and prior works fail to adequately address, largely because they neglect the rich Doppler velocity cues inherent in 4D radar. We propose DiFF, a generative framework that marries Doppler‑informed motion priors with a Kolmogorov‑Arnold Network (KAN)‑based conditional flow matching model. At its core, a KAN‑attention mechanism enables expressive feature extraction, while a prior‑guided generative process harnesses Doppler cues to regularize the ill‑posed solution space. Extensive experiments show that DiFF achieves state‑of‑the‑art (SOTA) performance across diverse real‑world datasets, reducing 3D endpoint error to the millimeter scale on the mmBody benchmark.
Authors:Longyu Lu, Zongwei Du, Mengtao Xing, Zhuoqun Liu, Zifan Guan, Meiguang Jin, Junfeng Ma
Abstract:
Long‑form live‑streaming TTS requires context‑dependent prosody and paragraph‑level coherence. However, many existing instruction‑based TTS systems use global or uniform conditions, providing limited explicit control over clause‑level relative prosodic changes. We introduce Speaker‑Relative Inline Prosody Control, where each Pitch, Energy, or Speed instruction targets a clause relative to the preceding clause from the same speaker, while Pause uses an absolute duration interval. In codec‑based TTS, Speed and Pause affect sequence length, whereas Pitch and Energy rely on residual codebooks. By analyzing Qwen3‑TTS RVQ codebooks, we find that Energy concentrates in early residual codebooks, whereas Pitch accumulates across a deeper prefix. We therefore propose Scope‑ and Codebook‑Aware Instruction Conditioning (SCIC), combining a Temporal Instruction Router for frame‑level tag activation with Tag‑Specific Codebook Weighting over residual codebooks. SCIC improves speaker‑relative Pitch and Energy control over standard instruction fine‑tuning using text‑token tags. We further apply multi‑reward GDPO post‑training to jointly optimize control and quality, improving control accuracy while preserving CER and speaker similarity. In long‑form synthesis, SCIC produces a more distinct paragraph‑level expressive hierarchy than speaker‑adapted SFT without instructions. Audio demos are available at: https://taoliveaigc.github.io/SCIC/
Authors:Wentao Wang, Hengyu Zhong, Yunhan Jiang, Jialiang An, Meng Lu
Abstract:
As new evidence arrives, a sequence model must update what it remembers and how memory influences predictions. While Transformers incur computation and cache costs scaling with context length, fixed‑state recurrent models offer constant‑memory inference. However, linear and spectral recurrences traditionally rely on static transitions, failing to dynamically revise how stored representations decay or rotate. While recent selective architectures introduce input‑dependent transitions, they assign independent controls to every memory mode, coupling control cost to state capacity. We show that high‑dimensional spectral memory does not require high‑dimensional control, and introduce Shared Phase and Retention Control for Efficient Adaptive Spectral Recurrence (SPARC). SPARC employs just two input‑dependent scalar signals to coordinate memory retention and phase rotation across heterogeneous complex modes, while preserving mode‑specific baseline timescales and frequencies. Its diagonal affine recurrence supports parallel associative scans for sequence‑level BPTT as well as exact structured Real‑Time Recurrent Learning (RTRL) for online credit assignment. Across partially observable continuous control, POPGym, and sequence classification, SPARC achieves a 9.09% relative return improvement on Walker‑P and a 1.36% relative accuracy gain on FordA over second‑best methods. On an NVIDIA Blackwell GPU, our implementation reduces recurrent‑mixer training latency by 18.2%‑34.2% in fixed‑token workloads and accelerates scans by 3.1x‑4.7x over an optimized RG‑LRU baseline. These results show that two shared control signals can efficiently govern adaptive spectral memory across online and full‑sequence settings. Code is available at https://github.com/Botwwt/sparc.
Authors:Abraham Yeung
Abstract:
We spent five weeks using an LLM coding agent on open problems in coding theory: finding large sets of four‑letter words, such as DNA barcodes, that stay far apart in edit distance. The agent wrote the verifiers and search code; a human chose the problem and set the verification protocol. Restricting the search to codes with a prescribed symmetry, a classical technique, shrank the problem about fourfold and raised the best known code of length 6 and minimum edit distance 3 from 114 to 120 words (E_4(6,3) \geq 120). The same pipeline improved twelve further lower bounds at lengths 6 to 9 and distances 3 to 6. We give the failures equal space. Our own search stopped at 116 and recorded the last symmetry class as topping out at 112; a second agent session, running the same search with a better operator, found the 120. A later verdict that the method did not carry over to length 7 was wrong for the same reason, and an earlier instance cost three weeks. Each time, an intermediate result was written down, never rechecked, and treated as a fact that ruled out further search. Checking final outputs, as our protocol required, does not catch such errors.
Authors:Marvin Theiss, Lukas Braun, Andrew M. Saxe, Erin Grant
Abstract:
Representations are routinely used across machine learning, psychology, and neuroscience to draw inferences about the computations of biological and artificial systems. Such inferences presume a meaningful link between representational geometry and the computation being performed. For artificial neural networks, however, the extent to which function constrains representation remains unclear. One key obstacle is that these networks admit parameter symmetries: changes in parameterization that preserve function exactly while reshaping representational geometry. Here, we show that a broad class of parameter symmetries acts on representations through just three primitive feature transformations: addition, duplication, and scaling. This feature‑level characterization yields a closed‑form decomposition of representational geometry into essential and auxiliary components, which makes precise how degeneracy in representational geometry can grow with overparameterization even when function is held fixed. Finally, we show that implementation‑level selection rules can resolve this degeneracy, yielding identifiable geometries in which features are weighted according to their contributions to the network's function. Together, our results delineate when representations can support inferences about computation, and when they cannot.
Authors:Qiyuan Chen, Xian Wu, Yanan Ma, Xianhao Chen
Abstract:
Federated learning (FL) on memory‑constrained edge devices faces a dilemma: first‑order (FO) optimization (i.e., backpropagation) demands substantial memory, whereas zeroth‑order (ZO) optimization suffers from severe convergence slowdown. To resolve this dilemma, we introduce HO‑FL, a hybrid‑order FL framework that trains a model's bottom segment with ZO optimization and its top segment with FO optimization. Each device can flexibly select its order boundary according to its memory budget while participating in the training of the same global model. Moreover, our convergence analysis reveals a new, fundamental trade‑off: clients with larger FO‑trained segments can provide more accurate updates, but favoring them can underrepresent other clients' data. We connect this trade‑off to the bias and variance of actual multi‑step local updates, yielding a sampling optimization problem and a practical dimension‑aware approximation with direct model averaging. Experiments on language tasks examine task performance, client memory, and sampling under data heterogeneity. The results show that hybrid‑order local training can retain much of the full‑FO performance with substantially lower client memory requirements. Our code is available at https://github.com/HKU‑WILL‑Lab/HO‑FL.
Authors:Jitai Hao, Quansheng Gu, Qiang Huang, Jun Yu
Abstract:
Long‑context LLM agents accumulate interaction histories that strain KV‑cache memory and attention computation. Although sparse attention reduces these costs, heterogeneous cache representations and workflows hinder integration with existing inference engines, while prior sparse‑serving abstractions support only specific layouts or workflows. We present SparseEngine, a ground‑up, sparse‑first inference engine whose shared lifecycle contract lets each method control its KV representation and computation while coordinating state transitions with common serving infrastructure. SparseEngine supports 15 methods across four categories and enables cross‑request state management through Chain Cache, which resumes KV‑eviction methods from retained history, and controllable Prefix‑Cache Pruning, which removes KV from selected history regions while preserving logical‑prefix matching. While maintaining method quality, SparseEngine delivers over 10x higher throughput with KV eviction, over 2.5x faster decoding at matched concurrency than vLLM, and over 2x end‑to‑end speedup on agent benchmarks. The code is available at https://github.com/CURRENTF/SparseEngine.
Authors:Xinkai Chen
Abstract:
A large language model (LLM) can rate depression severity directly from a social media post or mark which clinical criteria the post shows and let code turn the count into a label. The latter is easier to audit because a clinician can check each marked criterion. We compare these approaches on two Reddit corpora using three LLMs (from 9B to frontier scale) and two questionnaires (PHQ‑9, BDI‑II), and measure agreement with quadratic weighted kappa. For the two frontier models, criteria extraction scores above chain‑of‑thought on one corpus only when its decision thresholds are fitted on labeled data. Neither model's gain is significant, with or without recalibrating chain‑of‑thought on the same labels. With thresholds fixed a priori from PHQ‑9's criteria, extraction shows no gain on either corpus, even where models mark over two criteria per post. The 9B model behaves differently on a corpus from depression communities. It labels most posts severe, whether prompted directly or with chain‑of‑thought, while the a priori rule beats both without labels. After chain‑of‑thought is recalibrated on the same labels, no significant gap remains, consistent with a calibration effect. Yet higher ordinal agreement does not ensure better detection of severe cases. PHQ‑9 criteria extraction misses most severe posts, and moving from direct prompting to chain‑of‑thought and then to extraction increases misses in nearly all comparisons. On the primary corpus, a relabeled stress dataset, a model using that dataset's own features, including word counts from the text, is not significantly different from frontier criteria extraction under the a priori rule.
Authors:Zhihang Wu, Zhongqi Wang, Jie Zhang, Fengming Gu, Shiguang Shan, Xilin Chen
Abstract:
Interactive video generation (IVG) models have achieved remarkable progress in producing controllable visual content guided by user‑defined actions, yet their security vulnerabilities remain largely unexplored. In this paper, we present the first systematic study of backdoor attacks against the interactivity of IVG models. Based on this attack surface, we propose BadAction, which leverages action‑guided triggers to achieve the attack. Specifically, BadAction implants predefined motion patterns into the action sequences of backdoor samples and associates them with a static target video. Once triggered, the backdoored model generates frozen future frames that no longer respond to subsequent user actions, while preserving normal behavior on benign action sequences. In addition, we explore a stealthier attack in which multimodal triggers jointly poison action, text, and image inputs. Experiments show that BadAction achieves average attack success rates of 91.0% with action‑only triggers and 80.4% with multimodal triggers. Moreover, extensive defense evaluations show that BadAction successfully bypasses existing backdoor detection methods, revealing a critical security gap in the interactive video generation pipeline. Project page: https://wsad55.github.io/badaction01/.
Authors:Haoxuan Wang, Wayne Wu, Yan Yan, Bolei Zhou
Abstract:
Generative policies have emerged as a promising paradigm for robot learning, combining expressive generative action modeling with scalable imitation learning from large demonstration corpora. However, heterogeneous demonstrations can induce suboptimal action chunks whose errors compound over time, eventually driving the robot into out‑of‑distribution states from which recovery is difficult. Action verification offers a test‑time scaling strategy for mitigating this failure mode by sampling multiple candidate actions and using a verifier to select one for execution. Existing approaches, however, remain temporally myopic and costly to train, evaluating candidates from the current observation alone without accounting for trajectory continuity and often relying on large verifiers and additional expert demonstrations. In this paper, we introduce Temporal Verification (TeV), an efficient temporally aware action verification framework for flow‑matching VLAs. TeV first learns a temporal token that summarizes recent observation‑‑action history, enabling candidate chunks to be evaluated as continuations of the execution trajectory rather than as isolated predictions. Conditioned on this token, TeV constructs positive‑‑negative pairs without additional expert demonstrations or preference annotations and trains an energy‑based verifier contrastively to assign lower energy to higher‑quality, trajectory‑consistent action chunks. Beyond post‑hoc ranking, TeV further uses the learned energy landscape to guide intermediate flow samples toward lower‑energy regions, improving candidates before final selection. Extensive experiments in simulation and real‑world settings demonstrate that TeV provides reliably ranks action candidates, improves task success rates, and produces smoother execution trajectories.
Authors:Junyeong Song, Jaemin Yoo
Abstract:
Sessionized interaction histories contain behavioral patterns that can improve sequential recommendation. However, existing models process all sessions through the same parameterized blocks, regardless of their behavioral differences. Mixture of Experts (MoE) enables conditional computation, but it leaves open what should guide expert allocation. We propose RouteRec, a sequential recommender that uses observed session behavior as the routing criterion. RouteRec summarizes four types of behavioral evidence from sessionized histories: interaction tempo, item‑group focus, repetition and carryover, and popularity tendency. It uses these cues to route computation at macro, mid, and micro scopes. Cue‑derived scores first select expert groups; within each selected group, the current backbone state then refines expert selection. Across six public datasets and 18 dataset‑metric combinations, RouteRec ranks first in 12 and second in three, yielding the best overall average rank of 1.61 compared with 4.11 for the next‑best baseline. Additional analyses suggest that the behavioral cues guide expert allocation beyond added capacity and produce routing patterns aligned with observed behavior. Our code is available at https://github.com/jy1559/RouteRec
Authors:Thomas Serval
Abstract:
LLM services are billed per token and context windows are measured in tokens, yet the number of tokens needed for the same content varies across languages. We measure this token premium on seven tokenizers of widely used 2026 models (OpenAI o200k, Llama 3, Qwen3, DeepSeek V3/V4, Gemma 3, Mistral Tekken, and the Claude generation‑5 tokenizer via Anthropic's counting API) on NTREX‑128 (124 non‑English reference translations) and on the Universal Declaration of Human Rights for regional languages. French requires 31% to 58% more tokens than English, whereas Simplified Chinese ranges from 5% fewer to 40% more and is cheaper than French on six of the seven tokenizers. Regional and overseas languages of France pay roughly 1.6 to 3.3 times the English count. We discuss how history re‑sending, tiered pricing and fixed context windows amplify the absolute gap in agentic use. In a controlled experiment (BPE, Europarl, 50k vocabulary), adding French to tokenizer training data quickly reduces the premium, with diminishing returns and a growing cost for English. Finally, we present Baracoda FR v1.2, a byte‑level BPE prototype with Tekken's vocabulary size. On a final test of six corpora never consulted during design, with a protocol declared fixed beforehand, it uses 11.5% fewer tokens than Tekken on French and 3.7% fewer on English; results hold after removing test sentences overlapping the training data and with an equal ordinary‑token budget. It is worse on other languages and, at comparable vocabulary size, does not outperform CroissantLLM. These are segmentation results only; effects on model quality and task cost remain to be shown.
Authors:Haoxuan Wang, Griffin Galimi, Junhua Huang, Selina Song, Wayne Wu, Yan Yan, Bolei Zhou
Abstract:
Open‑world goods delivery requires mobile manipulators to follow free‑form user instructions and manipulate potentially novel objects. Existing dual‑system approaches use high‑level grounding models to convert language into grounded visual prompts, but their low‑level controllers can remain brittle under noisy perception, dynamic scenes, and contact‑rich interactions. We instead use a pretrained flow‑matching vision‑language‑action model as the low‑level control interface, leveraging its reactivity and robustness to environmental changes while treating the grounding output as a spatial cue for policy steering. Our key insight is that the pretrained VLA already provides a strong manipulation prior, while the spatial cue supplies the missing target information needed to guide actions under novel language‑‑object mappings. Concretely, we introduce a lightweight cue‑conditioned adapter. The adapter is first trained with contrastive objectives to produce salient and spatially discriminative cue representations, and is then supervised to predict a diagonal affine transformation over the generated action chunk, aligning policy steering with the cued target. Across tabletop and mobile‑base settings, our method improves instruction following and manipulation success on both in‑domain and out‑of‑domain objects, achieving up to near 2× improvement in average task success rate with negligible inference overhead.
Authors:Yihuai Hong, Shauli Ravfogel, Chen Zhao, Eunsol Choi
Abstract:
Chain‑of‑thought (CoT) traces often serve as a proxy for how Large Language Models (LLMs) arrive at their answers. However, growing evidence shows that models' CoT often fails to reflect their internal computations and can be changed without affecting their final answers. In this work, we measure and improve the alignment between the reasoning described in an LLM's CoT and what it computes internally. We propose CoT‑Interpretability Alignment (CIA), a metric that measures the agreement between a model's CoT traces and its internal reasoning strategies as detected by interpretability tools. We evaluate CIA on three tasks (two‑hop question answering, hint intervention, and integer multiplication) across three LLMs, finding that LLMs exhibit limited alignment across all tasks (44.8‑75.9%). We then experiment with improving CIA via post‑training, setting both the task accuracy and parametric faithfulness signals as a reward. Experiments show that we can substantially improve CoT parametric faithfulness while maintaining or improving the task accuracy. We provide rich analysis, such as their generalization patterns. Our work provides both a framework for auditing CoT parametric faithfulness and a pathway toward making models' explicit reasoning more trustworthy. Code and data are available at https://github.com/yihuaihong/CIA‑minimal‑repro.
Authors:Hangong Chen, Linfeng Cheng, Tahsin Zaman Jilan, Ian Fuller, Lee Caesar, Jiaye Wu, Yantian Zha
Abstract:
We present Video2SwimFish, an automated pipeline and benchmark for building controllable fish assets from real‑fish videos for underwater embodied AI. Given synchronized multi‑view videos of an individual fish, the pipeline reconstructs a metrically scaled deformable mesh from a VLM‑selected canonical frame, generates internal articulation adapted to that individual's morphology through a VLM actor‑critic loop, and extracts a Biological Locomotion Manifold (BLM) from the fish's observed midline curvature. The BLM provides a low‑dimensional action space bounded by real‑fish motion, enabling an individual swimming policy to be learned for each reconstructed fish. We release two paired datasets: synchronized top‑ and front‑view recordings of 120 individual fish across 6 species, and the controllable assets and individual swimming policies derived from them. Because every asset is tied to the animal it came from, the dataset supports a benchmark that evaluates locomotion learning not only on task success but on fidelity to that individual in trajectory shape, body curvature, and tail‑beat frequency, across trajectory following, reward‑free swimming behavior transfer from video, and a downstream case study in which a simulated BlueROV underwater robot captures one of the assets. We find that task success and locomotion fidelity do not necessarily improve together: the method achieving the highest task completion is not the method achieving the highest locomotion fidelity, and we identify faithful reproduction of individual animal locomotion as an open challenge for the community. Project website: https://hangongchen.github.io/video2swimfish‑web/.
Authors:Zixun Wang, Ben Dai
Abstract:
In semantic segmentation, a recent line of RankSEG methods directly optimizes Dice/IoU scores at inference time, improving alignment with evaluation metrics without modifying model training. Despite its theoretical and empirical success, RankSEG relies on the restrictive Conditional Independence Assumption (CIA), which ignores crucial label correlations and therefore degrades performance in ambiguous or low‑contrast scenarios. However, accounting for full label dependence is computationally prohibitive, requiring \mathcalO(d^3) time. To address this, we replace the CIA with a Spatially Localized Dependence (SLD) structure that captures local label correlations while keeping the dependence model tractable. We further overcome the remaining computational bottleneck via a Reciprocal Moment Approximation coupled with a novel fixed‑point optimization strategy that eliminates exhaustive search. The proposed algorithm achieves a highly practical \mathcalO(d \log d) complexity and consistently outperforms conventional argmax and CIA‑based RankSEG across diverse segmentation benchmarks. Improvements are significant in low‑contrast or small‑object scenarios, where label dependence offers valuable signals complementary to image information for accurate segmentation. The code of experiments is available at https://github.com/ZixunWang/RankSEG‑DEP.
Authors:Suyuan Zhao, Minghao Liu, Yizhen Luo, Zaiqing Nie
Abstract:
Single‑cell transcriptomics enables profiling of cellular states at unprecedented resolution, but its high dimensionality, sparsity, and technical batch effects pose significant challenges for representation learning. Existing single‑cell foundation models typically encode each cell independently or only model cells from the same batch for denoising, thereby underutilizing the rich relational information across batches and cell types to model gene expression patterns. We argue that single‑cell models can benefit from more informative cell‑context modeling. By comparing consistency and variation across cells, models can capture fine‑grained gene‑gene dependencies associated with cell states, which are essential for learning high‑quality representations. Inspired by the use of multiple sequence alignment (MSA) context in protein modeling, we propose CellMSA, a single‑cell representation learning framework that introduces an MSA‑inspired inductive bias into transcriptomic modeling. For each target cell, CellMSA retrieves relevant cells from different batches and biologically related cell types as context, and summarizes cross‑cell patterns into a context‑dependent gene‑pair representation. This representation is then injected into a pair‑aware target‑cell encoder for fine‑grained representation learning. We pretrain CellMSA on a large‑scale human single‑cell corpus of approximately 109 million cell observations, including 65.6 million primary observations. Experiments show that our framework consistently outperforms existing methods across multiple benchmarks. Code is available at the following repository: https://github.com/PharMolix/CellMSA.
Authors:Chin-Hung Huang, JooChul Lee, Huan He
Abstract:
Augmenting small concurrent studies with external or historical cohorts is attractive in drug development, where enrollment is slow, follow‑up is expensive, and closely related trial or real‑world data are often already available. Bayesian dynamic borrowing (BDB) provides a principled framework for adaptively controlling the influence of external data, but classical implementations often depend on hand‑specified priors and MCMC‑based inference, which can be computationally expensive and not generalizable. In this work, we study amortized neural posterior estimation (NPE) as a flexible alternative. A single network is pretrained on simulated current/external dataset pairs spanning covariate shift, outcome drift, and joint non‑exchangeability, and then returns an approximate posterior for a scalar current‑study target in a single forward pass. Through simulation studies, we find that NPE is most useful under outcome drift and joint mismatch: in the harder outcome‑drift regimes, it gives up to about five‑fold lower absolute bias than the best classical baseline and keeps Type I error close to nominal. After pretraining, posterior summaries are obtained in about 8 ms per dataset, roughly 10^3× faster than MCMC‑based borrowing baselines in our timing experiment. We further analyze Alzheimer's Disease Neuroimaging Initiative (ADNI) data and show that, when mild cognitive impairment outcomes differ across cohorts, the NPE formulation recovers the later‑cohort risk level in this example without claiming greater precision. Code is available at https://github.com/ChinHungScott/NPE‑for‑Bayesian‑Dynamic‑Borrowing‑MLHC‑.
Authors:Yansong Shi, Jiange Yang, Xijie Yang, Shaowei Zhang, Yuhan Zhu, Tao Lu, Limin Wang
Abstract:
Recent advances in robot learning have enabled manipulation policies to perform increasingly diverse tasks and generalize across environments. However, reliable execution often depends on hidden task states that cannot be determined from current observations alone, making interaction history essential. We introduce HIDE, a benchmark for evaluating manipulation memory under partial observability. HIDE comprises 15 tasks covering repetition counting, historical‑state recall, and execution‑progress tracking, with randomized initial configurations and decision points where similar observations require different actions depending on prior events. We further propose SEEK, a framework combining three complementary memory mechanisms to retain historical evidence and track execution state. Evaluations reveal substantial limitations in existing policies on HIDE, while memory augmentation improves task success in both simulation and real‑world experiments. Individual mechanisms benefit some tasks but can degrade others; their combination achieves the highest average success rate on HIDE among the evaluated configurations. These findings highlight the importance of maintaining internal representations of hidden task states and matching memory design to task‑specific information requirements.
Authors:Zhimin Gao, Pichao Wang
Abstract:
Decision models such as Jev answer questions with probabilities, which are only useful if they are calibrated. Open‑source reproductions rely on supervised fine‑tuning plus temperature scaling, while reinforcement learning from verifiable rewards (RLVR) makes reasoning models overconfident. We present a working implementation of reinforcement learning for calibrated decisions (RLCD) for reasoning models: the model samples a rationale, and we score the answer distribution it commits to afterwards with a strictly proper scoring rule. A variance identity shows that scoring the mixture of several samples rewards disagreeing rationales, and that RLVR is exactly this mixture objective without its diversity term. Optimized naively, the per‑rationale objective either switches reasoning off or is drowned out by policy‑gradient noise, which leads to a two‑stage recipe: calibrate, then reinforce. With Qwen3‑1.7B on two reasoning tasks (3 seeds, paired tests), RLCD matches or beats SFT, RFT/STaR and GRPO (each temperature‑scaled) in accuracy and beats all of them in selective prediction; on GSM8K answer verification a single query decides \gvTwoCovFive% of the items at \le5% error, versus \gvGrpoCovFive% for GRPO. When uncertainty comes from annotator disagreement, RLCD provably cannot beat cross‑entropy. Code and results: https://github.com/ZimmyGao/openjev‑rlcd.
Authors:Maoqi Liu, Junwei He, Bowen Zhang, Feiran Li, Wentao Ma, Rongyi Lin, Shuhan Zhong, Quan Fang
Abstract:
Rubric‑based reinforcement learning (Rubric‑RL) trains language models where no verifier exists. A judge checks each criterion of a rubric, and the verdicts are aggregated into a reward, most often by a weighted sum. We show that this additive aggregation is the weak point. Under a sum, criteria compensate for one another: a policy that misses the one decision that matters can buy the points back with advice nobody asked for. On clinical consultation, such a policy scores higher and answers worse. Rubric coverage rises while appropriateness on held‑out physician criteria falls below the untrained model. The medical criteria are not to blame. Grouped so that they must hold together, the same criteria, unchanged to the word, recover a third of the loss; shorter answers recover almost none. We therefore propose Protocol‑level Rubrics (ProRubric), which keeps what the criteria ask for and changes how they are aggregated. It groups a checklist into a few protocol‑level dimensions. A dimension counts only when all of its criteria hold and its failure clause does not fire. The grouping is done once, offline, and leaves the optimizer unchanged. ProRubric raises appropriateness by 10.8 points without losing coverage and has the best seven‑benchmark average at both scales. Reward validity is set not only by what a rubric verifies, but by how it aggregates. Code is available at https://github.com/Estrellajer/ProRubric
Authors:Yunhak Oh, Yoonho Lee, Junseok Lee, Namkyeong Lee, Sang-Yeon Hwang, Yinhua Piao, Hyomin Kim, Seonghwan Kim, Jaechang Lim, Woo Youn Kim, Sungsoo Ahn, Chanyoung Park
Abstract:
Single‑cell RNA‑seq representation learning is fundamentally label‑free: cell identities, states, and contexts are not fixed training targets, so what constitutes signal or nuisance is analysis‑dependent. A single representation must therefore preserve biological identity and state, remain robust to nuisance context, and retain the gene‑level variation needed for expression analysis, three demands we call the representation trilemma. To tackle this problem, we introduce scTrilemma, a latent‑bottleneck VAE that routes expression‑derived variation to the embedding, the decoder, or the prior rather than forcing all of it through one embedding. It gates gene tokens by expression, routes the cell representation through the decoder, and conditions the prior on unlabeled pseudo‑bulk context, under a single reconstruction objective and without target annotations or auxiliary representation losses. In release‑based zero‑shot evaluation on successive CZ CELLxGENE Census releases, scTrilemma leads all three demands at once and preserves biological‑state, differential‑expression, and pathway structure across multiple disease settings. Latent interventions further show that context can be removed at almost no cost to the other demands, leaving identity against fidelity as the remaining tension. Code is publicly available at https://github.com/yunhak0/scTrilemma.
Authors:Haohan Yuan, Simin Chen, Xi Niu, Hanqing Guo, Depeng Xu, Haopeng Zhang
Abstract:
Model‑attribution classifiers can often identify which language model produced a text, making model‑specific writing patterns a signal of provenance. Accurate attribution on unmodified text, however, does not show whether the prediction still identifies the original source after deliberate rewriting. We formulate this problem as targeted fingerprint transfer: rewriting one model's output so that attribution classifiers assign it to a chosen target model. We study summarization, where different models receive the same document and express the same underlying content, providing a controlled setting for conditional generation. We introduce ForgePrint, a search‑then‑distil framework that first searches for rewrites that move attribution toward a target fingerprint, then distils the selected rewrites into a one‑pass 4B Student model. On CNN/DM, the Student reaches 70.2% target success rate, outperforming both its Teacher (54.1%) and the strongest of six published rewriting baselines (39.3%), against held‑out classifiers that are never queried by the attack. It also reaches 68.3% target success when transferring summaries from an open model toward chosen commercial models. These results show that fingerprint detectability should not be conflated with source authenticity, and that text‑only attribution can provide misleading evidence of model identity under targeted rewriting, even when it is accurate on unmodified text.
Authors:Tianxiang Gao, Jinzhe Li, Zhiyuan Li, Yi Chang, Yuan Wu
Abstract:
Direct‑decision models turn text into low‑latency structured labels and scores, making them attractive for classification and automatic evaluation. Yet reliability requires more than accuracy: a model must also use the ordinal decision scale supplied by the user faithfully. We analyze JEV~1.13 and three open KEV models. Our investigation begins with ANLI, where JEV assigns 38.8% of all predictions and 51.3% of errors to Neutral despite 74.95% accuracy, nearly balanced gold labels, and balanced candidate positions. Across 36 ordinal datasets, final decisions use only 67‑‑76% of the effective gold support, versus 87‑‑102% on four nominal tasks. Randomizing candidate order weakens but does not remove this compression. Holding items and source scores fixed while balancing gold support and positions, we refine scales from K=2 to 14; utilization falls for every model and reaches 26‑‑75% at K=14, although candidate probabilities remain broad for most models. Targeted BA‑LoRA post‑training raises gold‑relative utilization from roughly 47% to 86% on eight supervised scales at both KEV sizes, showing that the compression is learned and modifiable rather than an immutable architectural limit. We call this ordinal scale‑utilization bias: decision‑stage candidate‑space compression distinct from accuracy, gold imbalance, fixed position, and candidate count alone. The code and data are available at https://github.com/Glax147/jev_ordinal_scale_bia
Authors:Xudong Tan, Peng Ye, Ming Xie, Chenyu Huang, Yaoxin Yang, Jiayuan Fan, Tao Chen
Abstract:
Multimodal mixture‑of‑experts (MoE) models combine sparse expert activation with visual‑language capabilities, yet their inference remains costly because long visual‑token sequences repeatedly incur attention, routing, dispatch, and expert‑MLP computation. Existing methods typically compress either the token or expert dimension, leaving redundancy along the other. Our analysis reveals two complementary regularities: the depth required for visual propagation varies across inputs, while text‑token routing exhibits concentrated and recurrent expert‑importance patterns. Based on these observations, we propose DecoMoE, a two‑dimensional structured compression framework that decouples visual propagation from expert computation. The Sample‑Adaptive Visual Boundary (SAVB) predicts an input‑dependent visual‑exit layer at which the visual‑token block is removed. The Routing‑Calibrated Expert Prefix (RCEP) reorders experts offline using text‑token routed mass and, from this predicted exit layer onward, retains at each MoE layer the shortest contiguous prefix covering a target routed‑mass fraction. We evaluate DecoMoE on Qwen3‑VL‑MoE and InternVL3.5‑30B‑A3B across six benchmarks. On Qwen3‑VL‑MoE, DecoMoE retains 97.91% of dense‑baseline performance while reducing computation from 27.06 to 16.73 TFLOPs and latency from 0.44 to 0.26 seconds, yielding a 1.69x speedup. Code will be available at https://github.com/ShawnTan86/DecoMoE.
Authors:Guanqun Yang, Wenlong Zhang, Tian Shi, Ping Wang
Abstract:
Anthropic's Agent Skills package reusable procedural know‑how for an LLM agent into SKILL.md directories, and open‑source aggregations have grown past 230,000 skills, making selection rather than authoring the bottleneck. The standing answer in the literature outsources selection to the agent itself: an LLM‑mediated retrieval loop that rewrites queries and refines candidates inside the agent's decision loop, paying LLM tokens on every task. We present SkillSeek, an open‑source two‑stage skill retriever built from the standard IR recipe (a BGE‑base bi‑encoder feeding a small cross‑encoder, exposed over MCP). Across a 4 × 11 grid of pool, backbone, and method on the 89‑task SkillsBench benchmark, SkillSeek reaches observed parity with the LLM‑mediated loop of Liu et al. at essentially no extra cost: plain bm25 alone records a pass rate at or above their refined loop on three of four settings, and a small cross‑encoder covers the remaining difference on the fourth. A first‑stage recall ceiling explains the pattern, and total per‑trial spend drops from USD 51.30 to USD 27.54 (within fifty cents of the no‑skill baseline). Under the SkillsBench tasks and OpenHands harness we tested, this positions the standard IR recipe as a strong default for agent‑skill retrieval, with LLM‑mediated alternatives a natural fit for cases where deterministic methods fall short.
Authors:Md Mushfiqur Rahaman, Md Mahedi Hasan, Imtiaz Ahmed, Srinjoy Das
Abstract:
Metal additive manufacturing parts are inspected by X‑ray computed tomography, where labelled data is scarce, the pores and inclusions that matter span a few pixels, and inspection must happen at the machine. We present DCM‑SAM, a defect‑conditioned adaptive mixture of LoRA experts: one frozen Segment Anything backbone carries a separate Conv‑LoRA expert bank and mask decoder per defect class, each trained in its own pass, without prompts, on synthetic slices alone, updating only 4.4% of the parameters. On benchmarks that XCT‑SAM reports, DCM‑SAM improves on every baseline for both classes from a ViT‑B backbone against their ViT‑H, and reaches 64.2% pore IoU on real NIST scans having seen no real images during training. Deployment then exposes what adaptation work rarely measures: on a Qualcomm Hexagon NPU, ViT‑H and ViT‑L compile yet cannot allocate at 1024x1024 image resolution, since activations rather than weights exceed the device ceiling, and quantizing weights does not help. ViT‑B alone runs, but the adapted encoder then fails to allocate where the stock one succeeds, until a numerically identical rewrite of the attention lets the complete DCM‑SAM run in FP16 at 1024x1024, with no operator falling back to the CPU, masks within 0.01% of pixels of the FP32 reference. Code: https://github.com/MushfiqShovon/DCM‑SAM.
Authors:Chunzheng Zhu, Jiaqi Zeng, Hongbo Zhao, Yihang Chen, Yijun Wang, Jianxin Lin
Abstract:
As vision language models are increasingly deployed in clinical diagnosis, under standing how they internally resolve competing visual and textual signals becomes a safety imperative. Existing mechanistic analyses remain confined to unimodal text and offer no explanation for why a single misleading sentence can override a correct image based diagnosis, or why a model commits to a confident answer despite insufficient visual evidence. We find that these two safety risks, arbitra tion failure where textual context overrides visual grounding and brake failure where the model commits without adequate evidence, are mediated by spatially disjoint attention head populations: arbitration heads form a mid‑to‑deep wideband reflecting cross‑layer evidence competition, while brake heads concentrate in a narrow middle‑to‑late layer band that regulates evidence sufficiency and abstention behavior. To ground these observations in causal circuitry, we introduce CRAFT, which localizes each failure mode to a minimal causal head set via dual criteria and verifies necessity and sufficiency through temporal probes and Tuned Lens trajectory analysis. Excising arbitration heads sharply reduces conflict following with negligible degradation on clean inputs, while excising brake heads restores ap propriate abstention under degraded visual evidence. The two interventions target spatially disjoint head sets and produce distinct corrective effects, underscoring the mechanistic separability of the failure modes. Experiments across multiple medical VQA benchmarks and VLM architectures validate both the localization and inter ventions, demonstrating that the identified heads causally drive each failure mode and that targeted modulation generalises without retraining. The code is available at https://github.com/zhcz328/CRAFT.
Authors:Guanqun Yang, Yingming Zhou, Jiangrui Zheng, Shudong Hao, Xueqing Liu
Abstract:
Patch retrieval, the task of finding the commit that fixes a known vulnerability, is the foundation of vulnerability management workflows, yet 60% to 63% of CVEs in the major advisory databases lack a patch link. We present PatchHolmes, a two‑phase patch retrieval system that pairs a hybrid first‑stage retriever with an agentic second‑stage inspection loop. Unlike pointwise prior work that scores each candidate independently, the Phase 2 agent reads the top‑100 listwise: it sees the full candidate list at once and selectively reads 3 to 10 commits through four budgeted tools before submitting a single best commit. On GitHubAD, PatchHolmes beats the pointwise binary classifier Favia by 25.34% Recall@1 and the retrieve‑and‑CoT baseline IRCoT by 31.40%, at one agent conversation per CVE versus Favia's ten; with the candidate set held identical, the agent adds 27.32% Recall@1 over taking the retriever's top candidate, and the same agent, transferred unchanged to PatchFinder_top10, lifts Recall@1 from PatchFinder's own top‑1 pick (24.28%) to 39.86%. Swapping the LLM backbone within the Qwen family changes Recall@1 by under 1%, and a second model family (gpt‑oss) stays far above the no‑agent floor, so the gain comes from the listwise agent loop; the entire system runs on a frozen open‑weight model over a local Git repository, without fine‑tuning or external search APIs.
Authors:Woosang Jeon, Jaeyeon Kim, Sham Kakade, Yilun Du, Amrit Singh Bedi, Arun Kumar Chithanar, Chul Lee, Taehyeong Kim, Sitan Chen
Abstract:
Next‑token prediction has driven remarkable progress in large language models, yet a growing body of evidence suggests that they can struggle on problems governed by complex global constraints. In this work, we focus on this regime and ask whether some of these limitations arise from the inference interface induced by next‑token prediction itself. We study this question through blackboard intelligence: an inference‑time perspective in which a model works on a fixed, revisable canvas and searches over candidate solution states rather than committing to a causal, left‑to‑right trajectory. We instantiate this idea with diffusion language models, whose any‑order prediction interface naturally exposes predictions over partially filled solution states. Our key observation is that mean confidence, a simple model‑internal quantity available from the standard masked diffusion objective, provides a useful proxy for global coherence and can guide inference‑time search and revision. Empirically, across ZebraLogic, Nurse Rostering, and Job‑Shop Scheduling, Blackboard consistently improves inference while holding the fine‑tuned LLaDA‑8B‑Instruct checkpoint fixed and substantially outperforms same‑scale autoregressive baselines, reaching 90.4% accuracy on ZebraLogic‑Hard, 76.4% exact feasibility on Nurse Rostering, and 80.2% optimality on JSSP. Stronger autoregressive search and refinement also fail to close the gap on ZebraLogic‑Hard, while Blackboard surpasses tested frontier LLMs there and on JSSP despite their substantially greater scale and strong test‑time reasoning. We open‑source our codebase at https://github.com/jwoosang1/blackboard‑intelligence.
Authors:Victor Wang, Thomas Hofweber, Mohit Bansal, Elias Stengel-Eskin
Abstract:
As AI systems move from static repositories to agents that are capable of continual adaptation and learning, maintaining their trustworthiness means equipping the models backing them with the ability to produce confidence estimates that dynamically reflect their changing skills and knowledge. We introduce the problem of persistent calibration, which requires a confidence estimator to faithfully reflect the knowledge contained in a model as that knowledge changes, without recurring supervision. We operationalize this by examining persistent calibration across checkpoints of open models, asking whether confidence estimators trained on earlier checkpoints can generalize to later ones. Specifically, we aim to shed light on whether confidence is dependent on knowledge, a question with implications for the reliability of confidence estimates. To measure this relationship, we define and evaluate calibration on knowledge contrast sets: subsets containing questions that one checkpoint answers correctly and another checkpoint answers incorrectly, reflecting a change in knowledge. We show that both inference‑time and fine‑tuning methods fall short on contrast‑set calibration compared to oracle methods trained on future checkpoints, even for methods that are well‑calibrated on the full dataset. We provide evidence for the hypothesis that persistent calibration is challenging because there is a vast space of possible confidence functions that are well‑calibrated on a given checkpoint, out of which only some rely on meta‑knowledge features that would generalize to other checkpoints. Towards improving contrast‑set calibration, we show that multi‑checkpoint training helps, suggesting an avenue for identifying confidence features that remain robust across changing knowledge.
Authors:Yuanhao Sun, Huawei Ji, Jiaxin Ding, Luoyi Fu, Xinbing Wang
Abstract:
A central goal of vision‑language model (VLM) distillation is to transfer both the teacher's language capabilities and its visual understanding. However, existing methods primarily supervise the student's output, leaving visual understanding implicit. Our analysis reveals that a student can match the teacher's answer without relying on the same visual evidence, raising the question: how can we ensure the student responds to the visual information that actually determines the answer? To this end, we propose Cross‑World On‑Policy Distillation (CW‑OPD), which explicitly supervises the student's response to changes in visual evidence. For each example, CW‑OPD constructs two visual worlds that share the question and scene context but differ in answer‑critical evidence, yielding different answers. We perform on‑policy distillation in both worlds and distill the teacher's cross‑world belief transition, encouraging the student to match not only \emphwhat the teacher predicts but also \emphwhy its prediction changes with the evidence. A gradient analysis shows that this term is invariant to errors shared by both worlds and supplies a corrective signal invisible to endpoint matching alone. In this way, CW‑OPD makes reliance on the relevant visual evidence an explicit distillation target rather than an implicit consequence of output matching. To diagnose whether a model truly grounds its answers in visual evidence, we introduce CWBench, which measures cross‑world consistency via Cross‑World Pair Accuracy (CWPA). Experiments on Qwen3.5‑4B show that CW‑OPD outperforms the strongest baseline by 1.2 points on average, and the 4B student exceeds DeepSeek‑V4.1 (552B) by 22.4 CWPA points on CWBench. Code is released in https://github.com/baokou‑fw2/CWAD.
Authors:Zachary Shinnick, Hemanth Saratchandran, Damien Teney, Anton van den Hengel
Abstract:
Language models are typically pretrained from random initialization. Recent work challenges this convention, showing that a brief warm‑up on abstract, algorithmically generated data can provide a better starting point for subsequent learning of natural language. In this paper, we show that in small language models, such a warm‑up improves specific capabilities that are not reflected in language‑modeling perplexity. Our warm‑up uses an abstract stack‑manipulation task that requires compositional and state‑tracking capabilities. Allocating as little as 1% of pretraining tokens to this data improves multi‑hop question answering by up to 3.9 F1 points on MUSIQUE, with additional gains on HOTPOTQA and 2WIKIMULTIHOPQA despite comparable language‑modeling perplexity. Controlled experiments show that the warm‑up substantially accelerates the acquisition of deeper reasoning chains. We also explore what drives this transfer. First, the structure of the data matters: replacing the stack task with a queue fails to produce the same gains. Second, the gains are specific: performance improves on sequential reasoning chains, with no consistent benefit on tasks that combine or compare independent facts. Third, timing matters: mixing abstract data with natural language is far less effective than an initial dedicated phase, and exposure after pretraining completely removes the benefits. The early advantage persists through billions of subsequent language tokens. These results show that early abstract training can reliably shape the capabilities language models later acquire.
Authors:Xihang Yu, Kaichen Zhou, Lorenzo Shaikewitz, Clément Jambon, Xiao Zhan, Rajat Talak, Luca Carlone
Abstract:
How can a 3D reconstruction system acquire and retain useful information to understand the geometry of a scene from partial views under a limited computation budget? Existing active view acquisition methods typically estimate uncertainty over observed or instantiated geometry, limiting their ability to reason about unseen structure, while long‑horizon reconstruction methods often retain redundant observations. We introduce Matisse, a training‑free framework that unifies active reconstruction and keyframe selection by leveraging evidence provided by a pretrained generative 3D model. Matisse estimates Evidential Uncertainty from cross‑attention evidence associated with 3D latent tokens and derives an Evidential Information Gain to guide both view acquisition and keyframe selection based on the expected reduction in posterior entropy. Matisse supports multi‑object scenes through occlusion‑aware, object‑balanced aggregation and propagates uncertainty through intermediate latents to avoid full reconstruction during planning. Matisse reduces Chamfer distance by 12.7%, 3.8%, and 9.2% on GSO30, YCB‑V, and Replica, respectively, relative to the best baseline on each dataset, and achieves a 1.50× end‑to‑end speedup over the best active reconstruction baseline on GSO30 with the same reconstruction backend. In the GSO30 keyframe selection experiment for long‑horizon reconstruction, Matisse achieves comparable Chamfer distance using 14% of the input views compared with Stream3D.
Authors:Jinmo Lee, Dooho Lee, Minho Jeong, Jaemin Yoo
Abstract:
Predicting molecular properties for compounds that differ structurally from labeled training molecules is important for drug discovery and materials design. Tabular foundation models (TFMs) offer a promising approach through in‑context learning, but their performance under structural shifts and the value of molecular comparisons in this setting remain underexplored. We study structural generalization in molecular property prediction and introduce MolPAIR (Molecular Pair‑Augmented In‑context Refinement), a framework that combines molecule‑level and molecular‑pair contexts without task‑specific parameter updates. A global tabular foundation model (TFM) first predicts a query's property from labeled molecular examples. A second frozen TFM predicts differences in prediction errors between the query and labeled reference molecules, using these comparisons to refine the initial prediction. Across 58 MoleculeACE and Polaris tasks, CheMeleon representations combined with TabPFN‑3 already outperform each evaluated baseline on a majority of tasks. MOLPAIR further improves this predictor on 46 of 58 tasks, with gains across four molecular representations and three TFM backbones. These results show that explicit molecular comparisons can strengthen tabular in‑context learning for structural generalization while keeping the molecular encoder and pretrained model weights fixed. The code and datasets are available at https://github.com/nums‑ai/MolPAIR.
Authors:Zergham Ahmed, Joshua B. Tenenbaum, Chris Bates, Samuel J. Gershman
Abstract:
Recent LLM‑based approaches to control either invoke a language model to select actions or synthesize world models that require planning at every decision, introducing latency that can limit real‑time use. We introduce Code to Control, an approach that synthesizes Python controllers which execute directly as policies. Code to Control separates program structure from parameters. An LLM synthesizes the controller structure, while derivative‑free search fits its parameters for continuous control using feedback from the environment. Once learned, the resulting controllers require neither LLM inference nor planning at decision time, enabling real‑time gameplay and, under our timing protocol, faster action selection than a PPO policy. Across a suite of Atari games, Flappy Bird, and MuJoCo tasks, Code to Control outperforms planning‑based program synthesis methods, remains competitive with deep reinforcement learning while using fewer environment interactions, transfers across substantial changes in environment dynamics, and scales to complex locomotion tasks.
Authors:Rafi Ibn Sultan, Md. Sajid Alam Chowdhury, Saleh Zare Zade, Chengyin Li, Prashant Khanduri, Marco Brocanelli, Dongxiao Zhu
Abstract:
Large Vision‑Language Models (LVLMs) commonly perform spatial reasoning through chain‑of‑thought (CoT), encoding intermediate reasoning as autoregressive sequences of discrete language tokens. Such hard thinking requires committing to a single token at each step, even when the correct spatial interpretation remains uncertain. This early commitment constitutes premature discretization: an incorrect token selection can propagate errors through subsequent reasoning. We propose Soft Spatial Reasoning, a post‑training framework that introduces soft thinking for spatial tasks in LVLMs. At each intermediate reasoning step, the LVLM forms a continuous soft state by mixing token embeddings rather than selecting a single token, allowing multiple candidate continuations to influence the next step. The appropriate degree of softness, however, can vary across reasoning steps: retaining multiple candidates may preserve a useful spatial interpretation, but if those candidates imply conflicting spatial relations, mixing them may interfere with subsequent reasoning. At the core of Soft Spatial Reasoning is AdaptSoft, a controller that uses the current hidden state and predictive uncertainty to adapt the degree of softness at each reasoning step. To train AdaptSoft, we introduce a gradient‑alignment learning objective that provides a step‑specific learning signal for softness control without intermediate reasoning supervision. Across diverse spatial benchmarks, Soft Spatial Reasoning outperforms hard and fixed‑soft CoT baselines using the same backbone, as well as a range of existing LVLMs. The source code is available at https://github.com/rafiibnsultan/Soft_Spatial_Reasoning
Authors:Rafi Ibn Sultan, Xiangyu Zhou, Md. Sajid Alam Chowdhury, Chengyin Li, Prashant Khanduri, Marco Brocanelli, Dongxiao Zhu
Abstract:
Large Vision‑Language Models (LVLMs) have made remarkable progress across visual perception tasks, yet spatial reasoning remains a persistent weakness, especially for questions that require reasoning over visual space. Recent spatial‑reasoning methods incorporate generated grounding, where models predict bounding boxes, masks, or other localization outputs for task‑relevant objects as part of their reasoning trace. However, these approaches typically optimize final‑answer correctness alone, allowing correct answers to be rewarded even when the model does not reason from confidently localized task‑relevant objects. We introduce SpatialCORE (Spatially COnfident REasoning), a post‑training framework that turns the model's own confidence in generated grounding into a learning signal for spatial reasoning. Its central idea is to reinforce grounding that is both accurate and confident, encouraging the model to reason from confidently localized task‑relevant objects. SpatialCORE realizes this through a self‑regulating spatial reward that weights each predicted bounding box's matching quality by its coordinate‑token confidence. An answer gate further ties grounding optimization to final‑answer correctness. SpatialCORE achieves state‑of‑the‑art results among open‑source and specialized spatial reasoning models across diverse benchmarks, and transfers effectively in zero‑shot settings to unseen data distributions. The source code is available at https://github.com/rafiibnsultan/SpatialCORE.
Authors:Mingda Zhang, Hanwen Zhang, Qiang Huang, Zijia Wang, Pengfei Guo, Yuchen Zhang, Jionghao Zhu, Xiaoying Tang
Abstract:
In recent years, LLM‑based multi‑agent systems have been widely applied to orchestrate tool‑using agents into executable communication graphs. However, existing self‑evolving orchestration still faces key challenges, including post‑hoc evolution that revises the team only after the trajectory ends, credit diffusion that gives every action the same terminal advantage under confounded baselines, and skill admission that is uncalibrated and never retired. To address these challenges, we propose EvoSteer, a new paradigm of Online Self‑Evolving Graph Orchestration ‑‑ the orchestrator builds a running team and repairs its plausible but failing steps from execution features and a learned value estimate. To support this paradigm, we introduce Anchored Trajectory Balance (AnchorTB), a regression‑style flow‑matching loss that assigns each orchestration action a coefficient by balancing subtrajectories against a frozen reference. Built on the learned flow, we further propose Validated Skill Admission, in which a candidate skill is tried before promotion and promoted only if paired evidence passes a sequential test under a shared nominal testing budget. Moreover, AnchorTB combines measured task‑level reference reward statistics with prefix‑dependent corrections. Experimental results on twelve datasets show that EvoSteer significantly outperforms baselines across question answering, mathematical reasoning, code generation, and interactive decision making. Our code is available at https://github.com/beita6969/evosteer.
Authors:Chuhan Chen, Yen-Chi Cheng, Ayush Saraf, Rajvi Shah, Tuotuo Li, Johannes Kopf, Chen Gao, Hung-Yu Tseng, Deva Ramanan, Matthew O'Toole, Changil Kim
Abstract:
Reconstructing and animating water scenery from nature produces compelling and immersive visual experiences. Previous work examined this task from the perspective of 2D video textures, with the goal of creating a looping video. In our work, we tackle the problem from a 3D perspective, creating a looping 4D dynamic reconstruction which can be interactively rendered from novel viewpoints from a single non‑looping 2D source video. We represent motion as a 3D static Eulerian motion field that advects canonical Gaussian splats that are cyclically reborn at fixed time periods, supervised using rendering losses. To model non‑periodic and stochastic dynamics present in real‑world scenes, we add a non‑periodic, time‑varying residual term to capture deviations from the static Eulerian motion field. We show quantitatively and qualitatively that our framework enables photorealistic animation of water scenes better than prior art.
Authors:Hongjia Zhai, Xiyu Zhang, Haoran Zhang, Zhichao Ye, Haomin Liu, Guofeng Zhang, Ian Reid, Xingxing Zuo
Abstract:
Egocentric videos of human manipulation provide valuable visual experience for embodied intelligence, yet collecting such data at scale is costly. Exocentric‑to‑egocentric video generation offers a scalable alternative by transforming abundant third‑person manipulation videos into first‑person observations. However, existing methods often struggle to faithfully preserve demonstrated hand‑object interactions (HOI) across large viewpoint changes due to insufficient fine‑grained interaction guidance and weak object‑centric anchoring. We present Exo2EgoHOI, an HOI‑aware video generative framework for interaction‑preserving exocentric‑to‑egocentric translation. To preserve fine‑grained HOI, we introduce a unified 4D HOI prior that combines scene geometry, articulated hand renderings, and dense hand‑object relation fields, together with a dual‑branch residual adapter for injecting structural and relational cues into the video generation backbone. To preserve object consistency, we introduce Decomposed Gated Cross‑Attention, which separately encodes object and background references and adaptively integrates global semantic and local appearance features as object‑centric anchors. Experiments on ARCTIC‑HOI and Ego‑Exo4D demonstrate substantial improvements in object consistency and HOI preservation while maintaining competitive visual fidelity. In particular, on ARCTIC‑HOI, Exo2EgoHOI improves object mIoU by 32.3% and reduces MPJPE and PA‑MPJPE by 34.7% and 50.0%, respectively, relative to the respective best baseline results. Project page: https://rcl‑robotics.github.io/Exo2EgoHOI/.
Authors:Sathya Kamesh Bhethanabhotla, Efstratios Gavves, André Biedenkapp
Abstract:
Partially observable environments pose a fundamental challenge in deep reinforcement learning, requiring agents to compress temporal information from observations and maintain a memory to make effective decisions. While there exist many approaches ranging from gated recurrence to attention mechanisms and model‑based RL, the search for effective representational techniques that can capture long‑term dependencies remains an active area of research. In this work we revisit Unitary recurrent networks (uRNNs) [Arjovsky et al., 2016, Jing et al., 2017], that demonstrated superior gradient flow and associative recall, expressing the recurrence and the hidden state in a complex vector space. Their norm preserving unitary dynamics enable information propagation through long sequences. To this end, we propose three different versions of uRNNs as drop‑in replacements for recurrent PPO architectures, and demonstrate that the simple recurrence and the added degree of freedom from the phase of the complex representations enable significant gains over baselines on several memory‑improvable tasks, including continuous control. We further explore how to preserve the phase information of the complex hidden state for a phase‑aware policy by drawing a parallel to how quantum states are measured. With our methods reaching up to 2‑3 × the reward in environments like rocksample and Craftax compared to the baselines, this work points towards an exciting new direction of representations for RL and the problem of partial observability. Code is available at: https://github.com/Sathya98/qurl
Authors:Cong Wei, Xuanchi Ren, Bryan Chu, Weiming Ren, Huan Ling, Jiahui Huang, Laura Leal-Taixé, Sanja Fidler, Wenhu Chen, Zian Wang, Jay Zhangjie Wu
Abstract:
Unified Multimodal Models (UMMs) often rely on separate visual representations for understanding and generation, increasing visual context length and complicating integration with established vision‑language pretraining pipelines. Recent advances in pixel‑space modeling offer an encoder‑free alternative, but extending this paradigm from images to videos is non‑trivial: video understanding and generation adopt different temporal representations, leaving the design of a unified visual interface an open question. We present PixelUMM, an encoder‑free model for unified image and video understanding and generation directly in pixel space. PixelUMM represents images as spatial patches and videos as spatiotemporal tubelets, connecting raw pixels to a shared multimodal backbone through single‑layer linear projections. Its Mixture‑of‑Transformers architecture combines shared attention with task‑specific parameters and extends clean‑pixel prediction to video generation, jointly supporting autoregressive text prediction and pixel‑space flow matching. Experiments show that PixelUMM achieves competitive performance across image and video understanding and generation tasks. We further conduct empirical studies of key design choices, including decoder design and spatial‑temporal patch size, providing insights for future pixel‑space unified multimodal models.
Authors:Xin Feng, Jin Zhao, Yizhen Zhang, Wenjie Pei, Fanglin Chen, Guangming Lu
Abstract:
Adapting image restoration models to a stream of new tasks without revisiting past data remains challenging due to catastrophic forgetting. In this work, we propose Restoring without Forgetting (RwF), a filter‑level continual adaptation framework for image restoration built upon a critical observation: task‑specific knowledge is centered in a small subset of filters and can be separated from those reconstructing general content. RwF first performs parameter‑space integrated gradients attribution to localize degradation‑critical filters in a coarse‑to‑fine manner. It then adapts to new tasks by generating task‑specific filters from a filter bank using compact factorized low‑rank transformations, further augmented with cross‑task attention and prototypical contrastive learning, and lastly assembles them back only at localized positions. Experiments on six restoration tasks show that RwF effectively avoids forgetting and achieves competitive restoration quality against all‑in‑one methods that have full data access, and outperforms LoRA‑style adaptation with ~10× fewer additional parameters. Code is available at https://github.com/funkdub/Restoring‑without‑Forgetting.
Authors:Yifan Wang, Haiping Liu, Yang Cui, Wenhao Cai, Shuhang Li, Xiaoyang Huang, Xianyang Liu, Jingyu Sun, Yizheng Sun, Cunhang Fan, Tianming Du, Jiancheng Yang, Zhenhong Li, Yunhao Zhang, Hongpeng Zhou, Jingyuan Sun
Abstract:
Electroencephalography (EEG) is recorded continuously over hours, with relevant dynamics spanning timescales from milliseconds to hours. Most EEG foundation models nevertheless process fixed windows independently, limiting their ability to capture information encoded in long‑timescale dynamics. State‑space architectures enable persistent recurrent processing, but long‑range information remains implicitly compressed in recurrent states. We present NeurDuo‑EEG, a causal EEG foundation model with channel‑resolved persistent memory. NeurDuo‑EEG introduces multi‑timescale memory management with learned consolidation and selective retrieval, enabling persistent modelling of continuous EEG with fixed‑size state. It is pre‑trained on 3,955 hours of EEG from 17 public datasets using multichannel autoregressive prediction of discrete spectral codes. Across three short‑window and two long‑sequence downstream tasks, NeurDuo‑EEG achieves the best performance on four of five benchmarks, including all three short‑window tasks and seizure detection, where AUC‑PR improves from 0.285 to 0.471 over the strongest non‑NeurDuo baseline. NeurDuo‑EEG also remains competitive on sleep staging and supports efficient streaming inference, with nearly constant per‑chunk latency as the available history grows to one hour. Notably, the Small variant achieves this with only 4.7M backbone parameters. These results demonstrate the value of persistent, multi‑timescale modelling for both long‑sequence and short‑window EEG analysis. Our code is available at https://github.com/YifaNNW/NeurDuo‑EEG.
Authors:Ali Atiah Alzahrani
Abstract:
Machine‑learning signals built from financial text treat what institutions say, and what the media repeat, as evidence about value. But whoever shapes a narrative may be trading against it. We study markets with three observable voices: institutional statements (Say), media repetition (Echo) and revealed positioning (Do). We ask when words should be followed and when they should be faded. In a linear‑quadratic model of an informed institution that speaks and trades before a partly credulous crowd, talking an asset down while buying it is optimal exactly when φ^2<2λk<φ. A distribution‑free identity then shows that when the observable Say‑Do covariance is negative, words carry negative predictive content and should be faded. For measurement, we derive (i) an exact factorised posterior over which articles are echoes, combining arrival times with embedding similarity; (ii) a return‑aligned contrastive objective that attains its bound exactly when squared embedding distances are an increasing affine function of squared outcome distances, with the tightest loss‑based certificate of which neighbour rankings survive imperfect training; and (iii) a path‑signature statistic for who moved first. In a controlled market with known ground truth, echo sentiment predicts returns with a significantly negative sign in all 29 simulated markets, the rolling Say‑Do correlation flags false‑alarm events with an AUC of 0.90, and return‑aligned embeddings organise headlines by consequence rather than topic. We also report where the tools fail.
Authors:Donghao Zhou, Haoyang He, Fan Zhang, Hao Yang, Guisheng Liu, Xin Gao, Zhongwei Wan, Xingyuan Bu, Jie Wang, Qiangpeng Yang, Shilei Wen, Chi-Wing Fu, Pheng-Ann Heng
Abstract:
Instruction‑guided video editing has made significant progress, yet existing methods use multimodal large language models (MLLMs) primarily as semantic encoders, so they often fall short in working with implicit edits that require causal or semantic reasoning. To bridge this fundamental gap in video editing, we propose ThinkV2V, a reasoning‑driven framework for complex instruction‑guided video editing, explicitly activating MLLM thinking before visual generation. At its core, ThinkV2V builds on a practical MLLM‑to‑DiT architecture to turn explicit thinking over the source video and instruction into refined conditioning signals for video editing. Further, we equip it with a dedicated training and inference recipe, combining Progressive Curriculum Training, which gradually cultivates the model from basic editing to reasoning‑intensive cases, with Inference‑Time Thinking Scaling, which iteratively refines candidate prompts and selects the most reliable one, to better elicit reasoning in challenging editing scenarios. We also curate the ThinkV2V‑150K dataset and introduce ThinkV2V‑Bench to support training and evaluation of video editing with implicit intent and causal reasoning. Experimental results demonstrate the state‑of‑the‑art performance of ThinkV2V on both complex and standard editing scenarios, in which our 5B‑scale DiT model substantially outperforms larger 10B‑scale baselines.
Authors:Joshua Meyer, Sahar Shayegan, Ritiz Tambi, Ali Khan, Sun Kim, Victor Shih, Mehdi Jamei, Andi Partovi
Abstract:
Voice agents in production must handle several requests, background speech, and customers who lose patience. We introduce VAmoS Energy, a benchmark that combines these challenges in 100 calls about utility billing and payment assistance. Each caller makes two to four requests. The agent has sixteen tools backed by a stateful Stripe billing twin and the Apache Fineract loan engine, with account access blocked until caller verification succeeds. The tasks use public household electricity data and a policy based on Pennsylvania's residential billing rules. An LLM‑as‑a‑verifier checks the agent's actions and spoken figures against explicit requirements. On a calibration run, it agrees with a code verifier on 99.1% of checks. Across fourteen voice stacks and three repeats per task, completion ranges from 17.3% to 44.7%. Grok Voice leads, and Gemini 3.8 Live and GPT‑Live follow at about the same cost per call. Background television reduces pooled completion from 38.7% to 8.6%. The simulated caller often accepts an incorrect result because it hears the agent's words but cannot inspect its actions. These findings show why voice agents need evaluation across the whole call, including what they say, what they change, and how they handle competing speech.
Authors:Volkan Dağlı, Zerrin Dağlı, Dağhan Dağlı
Abstract:
We present gap‑lean4‑port (Release v0.2.0), a machine‑checked formalization of foundational algorithms in computational discrete algebra and permutation group theory within the Lean 4 interactive theorem prover and Mathlib4. While modern proof assistants feature extensive abstract algebraic hierarchies, constructive and operational permutation group algorithms, such as Charles Sims' 1970 Schreier‑Sims algorithm, transversal tree lookups, and backtrack ordered partition refinement, have remained largely unformalized in dependent type theory. Here, we formalize the operational algorithmic core of the Groups, Algorithms, Programming (GAP) system library across four foundational modules, proving 35 machine‑checked theorems with zero unproven conjectures (sorry) and zero custom axioms under standard Lean 4 foundations (propext, Classical.choice, Quot.sound). We machine‑check: (1) Schreier‑Sims stabilizer chain hierarchies (StabLevel, StabChain) and the invariance of incremental transversal tree extensions (extendSchreierPoint_invariant); (2) single‑level and multi‑level Schreier sifting reductions (siftOneLevel, siftFull), proving that full sifting strictly fixes all base points (siftFull_fixes_all_basePoints); (3) constructive soundness and completeness of Base and Strong Generating Set (BSGS) membership testing (membershipTestKnownBase_iff_mem); (4) backtrack ordered partition cell refinement (splitCellByPred), proving mutual cell disjointness, union conservation, and exact cardinality preservation; (5) cyclotomic extension rings Z/nZ(eps_m) and machine‑check GAP's exact size theorem |Z/nZ(eps_m)| = n^m; and (6) executable Bezout inverses via Extended Euclidean GCD (Nat.gcdA) over residue rings Z/nZ. The entire codebase compiles deterministically under 'lake build RequestProject' and is openly available at https://github.com/pCwOrM/gap‑lean4‑port.
Authors:Xueting Fang, Zehui Li, Yang Yang, Camilla Giovino, Shubh K. Patel, Shailly Prajapati, Vallijah Subasri, Caihua Shan
Abstract:
Most clinical benchmarks evaluate language models (LMs) on diagnosis using complete case descriptions. In clinical practice, however, patients present information in different ways, and clinicians must obtain relevant history and determine which examinations are needed before reaching a diagnosis. Diagnostic accuracy alone therefore cannot establish whether an agent gathered essential information or conducted an appropriate clinical assessment. Furthermore, existing benchmarks lack professional clinicians' verification. To address this gap, we introduce KlinikeBench, a benchmark of 333 clinician‑authored tasks, each providing an isolated sandbox environment with a virtual patient, clinical tools, and task‑specific success criteria. More than 35 clinicians contributed to case authoring and benchmark evaluation. In an empirical study, clinicians gave simulated dialogues higher mean quality ratings than reference conversations, which is adapted from real conversation. In each task, an LM has a fixed budget of turns to communicate with the patient, ask about relevant history, request examinations, follow action constraints, and record a final diagnosis. We score these steps separately as well as together. Across 31 models and seven model families, the best‑performing models (e.g., GPT‑6‑astra and Claude Opus 5) succeed on less than 30% of tasks, even though their diagnosis accuracy reaches 90.7%. Some models benefit from talking with the patient; others diagnose well from a complete chart but perform much worse in conversation. Overall, KlinikeBench provides a testbed for evaluating the full clinical encounter and reveals a substantial gap between diagnostic accuracy and performance in interactive clinical assessment. All the code and data is available on https://zehui127.github.io/klinikebench/
Authors:Mohamed Abouzahra
Abstract:
Language agents must revise planned actions when evidence changes, permission is revoked, or a stop instruction arrives. A useful response is selective: suspend affected actions, preserve unaffected work, and resume only after sufficient repair. We introduce NAQD‑Env, a synthetic environment that evaluates these decisions against a deterministic reference policy over explicit evidence, authorization, and constraint dependencies. Eleven dependency families support evaluation on development structures, held‑out families, and held‑out combinations of structures. Metrics distinguish attempted violations from violations permitted by a simulated execution gate and jointly report policy agreement, task value, withdrawal, resumption, and event reporting. We evaluate three open‑weight instruction‑tuned models from two families under three prompt conditions on 350 frozen scenarios, yielding 3,150 model‑prompt episodes before gate replay. Across the reported conditions, withdrawal recall is at most 0.06, no valid resumption is observed at eligible opportunities, and only one episode matches the complete reference policy. Under the NAQD prompt, Qwen2.5‑7B has fewer unsafe‑attempt episodes than Qwen2.5‑3B and Llama‑3.1‑8B, but also completes less useful work and preserves unaffected actions less accurately. Exploratory supervised fine‑tuning probes increase Qwen2.5‑3B decision accuracy from 0.45‑0.54 to 0.83‑0.92; separate diagnostics reveal inappropriate withdrawal after curriculum omissions and a loss of event reporting. These results motivate evaluating selective withdrawal as a distinct component of agent reliability. The setting measures policy application with trusted structured inputs and does not establish real‑world containment or source‑verification ability.
Authors:Hyeong Kyu Choi, Bhavana Dalvi Mishra, Jiefeng Chen, Mihir Parmar, Rui Meng, Chun-Liang Li, Xiangru Tang, Sharon Li, Jinsung Yoon, Tomas Pfister
Abstract:
Frontier LLMs are increasingly used to automate scientific research through iterative search. We distinguish idea‑driven search from solution‑driven search and identify three core challenges: organizing evolving research ideas, selecting promising directions, and maintaining alignment between ideas and their implementations. To address these challenges, we introduce the Agentic Idea Manager (AIM), a fully autonomous framework for managing and exploring research directions in idea‑driven automated research. Inspired by Bayesian optimization, AIM uses an Agentic Surrogate and an Agentic Acquisition mechanism to organize discovered ideas and guide their selection. A Solution Auditor maintains idea‑solution integrity, while a Resource Planner adaptively allocates the remaining experimental budget across parallel search branches. Experiments on 10 AutoLab benchmark tasks show that AIM surpasses the strongest baseline by 1.6 percentage points on System Optimization tasks and 4.9 percentage points on long‑horizon Model Development & CUDA tasks. Notably, AIM reaches the best baseline performance up to 3.1x faster in wall‑clock time. We further provide a theoretical analysis of when searching over ideas becomes beneficial. Our analysis shows that explicit idea‑level allocation makes semantic coverage directly controllable, and that broader coverage becomes increasingly valuable when competitive research directions are sparse among many plausible alternatives. Project Page: https://imhgchoi.github.io/agentic‑idea‑manager/
Authors:Sara Falcone
Abstract:
Teleoperation systems are tuned for channel fidelity, while whether the operator experiences the device as part of the body, the Sense of Embodiment (SoE), is measured only afterwards, by questionnaire. Predictive‑processing accounts suggest controlling devices to reduce the mismatch between the operator's predictions and the returned feedback, but those predictions are unobservable, and an objective that only penalizes mismatch is minimized by removing feedback. We formulate an embodiment‑aware controller, the Universal Embodiment Engine (UEE), that infers the operator's embodiment and visuo‑proprioceptive cue weighting from implicit gaze and pupil signals and task outcome, and chooses bounded device settings under explicit preferences, cast as a discrete Active Inference agent. In simulations with 300 heterogeneous synthetic operators, the UEE found the suitable setting within half a minute for most operators, before identifying their exact type, and came close to an oracle in the second half of the session (embodiment 1.68 against 0.73 for the best fixed setting, on a 0‑2 scale). Adapting without reading the operator did no better than fixed control, and model‑free bandits did worse, whereas an expected‑utility controller with the same inference did exactly as well: the benefit comes from Bayesian inference over the operator with explicit preferences, not from the information‑seeking term of Active Inference. A naive prediction‑error minimizer withheld feedback, as its objective implies, and lost task success (0.74 vs 0.90). The benefit shrank but persisted for operators outside the controller's model family, grew with the variety of the population, and vanished when the controller trusted an uninformative signal or when cue weighting changed mid‑session without being modeled. These failures show what studies with people must establish first: calibrated signals and a model of change.
Authors:Loay Mualem, Lluís Pastor-Pérez, Vinh Tong, Andrei Manolache, Tanja Bien, Steffen Staab, Mathias Niepert
Abstract:
Supervised fine‑tuning of discrete diffusion language models masks some response tokens and trains the model to recover their original values from the visible context. The masking pattern therefore determines both the context available to the model and the tokens it learns to predict. Uniform random masking does not explicitly account for the interaction between these choices. We introduce GoldiMask, which selects tokens to reveal as context by approximately maximizing a submodular objective. This objective uses model signals to balance the benefit of revealing tokens against their value as prediction targets. GoldiMask then weights the remaining targets according to how they benefit from the selected context and their remaining learning potential. Across three backbones and three training datasets, GoldiMask achieves the highest average accuracy in most evaluated settings, demonstrating gains on both reasoning and code generation. Component ablations show that both context selection and target weighting contribute to the gains. GoldiMask also reduces decoding iterations on GSM8K and MATH‑500 under confidence‑threshold parallel decoding, while maintaining comparable accuracy at higher confidence thresholds.
Authors:Chand Sahil Mansuri, Joel Zachariah, Sadamori Kojaku
Abstract:
Representing scientific papers as points in a space lets us search for similar papers and inquire about how fields relate to one another and drive innovation. Beyond search, the vector space of papers invites generation: mixing papers through simple vector operations creates new points, mirroring combinatorial novelty, the recombination of existing ideas into new ones. However, a mixed point often represents an idea no paper has yet realized, with no papers nearby to identify the idea. We propose representing each paper by a LoRA adapter generated by the Doc‑to‑LoRA hypernetwork. Every point in the space, including mixtures, thus represents a large language model (LLM) open to questions and instructions in natural language. On papers from the American Physical Society (APS), we instruct the LLM at the average of each subfield to name the field in a few words and obtain labels closer to the official names than the labels of five baselines, as judged by word overlap and a panel of five LLM judges. We also ask the LLMs at points between two APS papers to write an abstract and obtain descriptions shifting from one paper to the other in step with the mixing weight. While Doc‑to‑LoRA is trained for generation, a small invertible transform makes the embeddings competitive for search, on par with SPECTER2 and EmbeddingGemma and close to SBERT. Because the transform is invertible, every point in the transformed space still maps back to an LLM. The embeddings thus serve both search and generation, enabling researchers to question the idea at any point in the space as a starting point for generating new ideas.
Authors:Yunus E. Zeytuncu
Abstract:
We study generalized Blaschke curves as a controlled environment for AI‑assisted mathematical rediscovery. For one fixed degree‑four Blaschke product, an agent receives numerical coordinates of the six pair‑lines determined by each of 80 boundary configurations. The target theorem is withheld from the task instructions. The saved research log reports rejected geometric hypotheses and a homogeneous cubic fitted to polygon sides. Its frozen coefficients predict 480 lines from 80 unseen parameter values, with a recorded RMS scale‑free residual of 8.88×10^‑17. Discovery‑set diagonals provide an out‑of‑fit consistency check, not a fully held‑out test. A separate one‑configuration run reports insufficient evidence for invariance. A post‑review deterministic degree‑search baseline also recovers the cubic, so the experiment does not establish an advantage over polynomial fitting. We present this single‑instance case study as a protocol for separating conjecture, numerical validation, and proof, with explicit limitations concerning agent metadata, prior knowledge, and reproducibility.
Authors:L. D. M. S. Sai Teja, Ufaq Khan, N. Siva Gopala Krishna, Satyajit Tourani, Ashshak Sharifdeen, Fida Mohammad Thoker, Bernard Ghanem, Muhammad Haris Khan
Abstract:
Vision‑language models (VLMs) increasingly reason over visual evidence that is cropped, segmented, retrieved, or revealed over time. Yet most VQA benchmarks present the complete image and question at once. We ask what models lose when the same information is fragmented. We introduce Layered‑VQA, with 93 scenes and 300 questions. Each image is decomposed into ordered RGBA layers that exactly recompose the original scene, and each question is annotated with supporting, minimal‑sufficient, and distractor layers. We evaluate eleven open‑weight VLMs from 3B to 32B parameters and two proprietary models with a scale of 187,200 conversations, graded by 1.74M open‑model cross‑judgments. We find three consistent failures. Loss in Composition: fragmenting the question has a small effect, but fragmenting the scene substantially reduces accuracy; recomposing the same layers largely restores performance. Oracle Inversion: even oracle‑selected sufficient evidence can perform worse than the complete scene. Loss in Grounding: as more evidence is required, grounding degrades much faster than answer accuracy. Together, these results show that having the right visual evidence is not enough. How that evidence is composed and presented determines whether models can use and ground it. The right evidence is not enough: VLMs need the scene it came from.
Authors:Yuhan Guo, Jinming Liu, Liang Xu, Ziqiang Li, Jianguo Huang, Zhicheng Wang, Hu Zhu, Qiuyu Chen, Yuntao Wei, Xin Jin, Wenjun Zeng
Abstract:
Large language models (LLMs) are increasingly deployed as agents for multi‑step decision‑making, yet transfer poorly to unseen environments. World‑model methods address this by training agents to predict future observations, at the cost of additional training and errors that compound when predictions are used for planning. However, for LLM agents operating in digital environments, much of this world knowledge is already internalized during pretraining, which shifts the problem from acquiring it to eliciting it. We argue that typical post‑training provides little pressure for such elicitation, since supervision under a single goal at each visited state inadvertently drives policies to rely on superficial contextual habits. We introduce EVOKE, a post‑training method that supplies this pressure through goal diversity at fixed states. Motivated by theory showing that an agent competent across diverse goals must encode a world model recoverable from its action preferences, EVOKE holds the environment state and interaction history fixed and ranks the same candidate actions under alternative goals, forcing action preferences to change, so that a policy relying on contextual habits or single‑goal correlations cannot order them correctly. This implicitly elicits the policy's pretrained world knowledge to inform decisions. We evaluate EVOKE across diverse tasks in three backbones, demonstrating improved task performance, unseen environment generalization, and data efficiency. We further conduct controlled analyses to better understand what drives these gains. These findings offer a new perspective on eliciting internalized world knowledge for transferable action through direct decision supervision.
Authors:Maham Tanveer, Jiyeon Han, Nanxuan Zhao, Hao Zhang
Abstract:
We introduce modal kinetic typography, which animates a vector glyph to express a semantic concept while keeping it legible. Our key idea is to build motion from the glyph's natural vibration modes. Specifically, a finite‑element eigenproblem assembled from the vector outline yields the glyph's softest modes, for the whole letter and for each of its parts, allowing it to bend. The problem's zero‑energy solutions, i.e., rigid translations and rotations, are applied in closed form to each part, allowing parts to also move as blocks. To animate the glyph, a frozen video diffusion model supervises only the modes' amplitudes and phases. Our modal approach addresses two weaknesses of prior work. Free‑form point optimization under video score distillation (SDS) moves each point and frame independently along noisy gradients, tearing the outline and causing jitter. In contrast, our modes are smooth along the outline and driven by a few whole‑cycle harmonics, which restricts these gradients to smooth, seamlessly looping motion. On the other hand, structured alternatives rely on skeletons or keypoints from category‑specific priors, whereas our modes come from the glyph itself; the only prior is a list naming each letter's moving parts, generated once for the whole alphabet by a language model. In modal kinetic typography, shape and motion are disentangled by construction: a single base outline is sculpted toward the concept, and the modal drive cannot alter it, so a letter can also be animated without being reshaped. Our method produces more articulated and smoother motion than Dynamic Typography and AniClipart at comparable or better concept alignment, with less glyph tearing than Dynamic Typography, and is preferred by human raters, including in a frozen‑shape setting where motion alone must carry the concept. Our results were also preferred over Astra (GPT‑6) by human raters.
Authors:Zhuo Liu, Moxin Li, Zhixin Ma, Wentao Shi, Wenjie Wang, Fuli Feng
Abstract:
Large language model (LLM) agents are vulnerable to safety risks such as injected malicious instructions or misleading information, motivating runtime defenses that prevent unsafe action in execution across diverse risks while preserving benign‑task utility. Existing system‑level defenses either focus on risk detection rather than timely prevention or rely on predefined rules with limited flexibility across diverse risks. We propose a risk‑aware harness that integrates LLM‑based monitoring for flexible risk detection and structures monitor‑guided execution around three core modules: trigger, monitor, and feedback, enabling targeted safety interventions while limiting disruption to benign task execution. To adapt the harness to different risks and deployment settings, we introduce HARDE, a two‑stage harness optimization framework that first performs isolated probing of each module to derive an optimization guide, then uses this guide to iteratively optimize the harness based on safety and utility feedback. Experiments across three attack benchmarks show that HARDE improves runtime safety while preserving utility, outperforming manually designed harnesses and naive optimization baselines. Our analysis shows that effective runtime defense benefits from complementary safety mechanisms, attack‑aware harness optimization, and harness designs matched to monitor capabilities. Our code is available at https://github.com/Liuz233/HARDE.
Authors:Hongjin Qian, Chaofan Li, Kun Luo, Wenqing Wei, Jianlyu Chen, Shuqi Lu, Yuyang Hu, Hongwang Xiao, Hui Wang, Chaozhuo Li, Qiwei Ye, Zhicheng Dou, Defu Lian, Zheng Liu
Abstract:
We present AREX‑2, an effort to advance the self‑improving capability of LLM agents, which we define as the ability to iteratively refine a solution at test time. This ability rests on two complementary capabilities: reflection, which produces a solution better than the current one, and long‑horizon execution, which keeps the iteration effective over many rounds. We hypothesize that both capabilities are domain‑agnostic, and can therefore be learned in scenarios that are well suited for supervision. Accordingly, we synthesize long‑horizon improvement trajectories from machine learning and algorithmic programming tasks, two domains that offer verifiable feedback and reward sustained iteration. Trained on this data, our agent, built on Qwen3.8‑27B, achieves strong results on MLE‑bench Lite (81.8) and Frontier‑CS (70.7), transfers to deep research with 84.0 on BrowseComp, 52.6 on HLE, 92.2 on GAIA, and 93.8 on DeepSearchQA, and keeps improving as its budget of rounds grows. These results show that long‑horizon reflective data is an effective route toward self‑improving agents.
Authors:Nitai Aharoni
Abstract:
A comparison between adaptive and fixed‑time traffic signals can change when only their timing settings change. We examine this sensitivity in 240 simulation runs on one OpenStreetMap‑derived urban network, using eight configurations, three arrival rates and ten paired demand seeds. The experiment varies the maximum green of presence‑based actuation, retimes the fixed baseline, and includes a discharge‑based phase‑termination rule. The endpoint is finite‑window time spent per offered trip, including entry waiting and penalties for removed or abandoned trips. At the highest tested load, actuation with a maximum green of twice the planned split has a mean endpoint 57.4 per cent above the original fixed plan. Reducing that multiplier to 1.25 puts it 70.7 per cent below the same plan. Against the best of three tested fixed plans, discharge‑based termination reduces the mean endpoint by 14.8, 15.8 and 18.3 per cent across the three loads. Both timing sweeps favour their shortest tested setting, so neither identifies an optimum. This exploratory study uses synthetic demand, negligible start‑up lost time and physical removal of persistently stationary vehicles. The results support testing timing sensitivity before attributing performance to a controller family; they do not establish a setting for real‑world deployment.
Authors:Eric Allen
Abstract:
Programs that compute with physical quantities often need to convert between units of measurement, and as the Mars Climate Orbiter showed, these conversions can be a rich source of errors. Meanwhile, typed unit calculi, our most rigorous formalisms for checking physical units in a program, have excluded unit conversions. Through this exclusion, they have established a powerful property: well‑typed programs are invariant under rescaling (no program can depend on how big a meter is). But losing the ability to convert between units is a significant cost. In contrast, practical languages provide conversion but no invariance theorem. We present Λ_S, a typed lambda calculus with conversion, quantification over units and dimensions, and vectors and linear maps with per‑component units, and we determine exactly how much invariance survives conversion. For terms without unit constants we prove two abstraction theorems: (i) a convert‑free term is invariant under every rescaling; (ii) a term with conversions is invariant under every rescaling that scales all units of one dimension by the same factor. The condition in (ii) cannot be weakened: under any other rescaling, some conversion of a nonzero value is not invariant. For first‑order programs, a verified decision procedure returns one of three verdicts: it certifies that no error in the declared conversion factors can change the program's answer, names the accumulated ratio through which such an error would scale it, or declines. A verified checker decides whether unit declarations are consistent and determine every conversion factor, and extracts each factor exactly. We also prove adequacy, erasure, and the n‑variable Pi theorem of dimensional analysis with conversion. Every theorem is mechanized in Lean 4, and the evaluator compiles to a native binary.
Authors:Linfeng Zhou
Abstract:
A signed authorization record authenticates what a signer asserted, but does not by itself establish that the assertion agrees with the policy and action used for a runtime decision. CATP specifies the bindings needed to carry a local pre‑execution decision into offline‑verifiable evidence. Its hook commits to the enforcement‑time policy and adapter‑normalized action and durably records the decision before returning permission. A later receipt binds the record to a self‑contained audit export. An implementation for Claude Code and Codex supports an empirical examination of these bindings. Controlled, validly signed counterexamples expose five missing consistency checks; adding them changes acceptance on the same inputs, with all 13 expected outcomes satisfied. A separate probe finds that distinct argument vectors can become the same normalized action before hashing, limiting what even a consistent receipt can establish. Eight scripted runtime cases verify hook delivery and allow/deny behavior; failure tests cover tampering, substitution, replay, concurrency and persistence errors. Median paired hook overhead is approximately 85 ms, and offline verification takes approximately 174 ms end to end on the testbed. The evidence remains conditional on a trusted runtime, monitor, host and signing key. It authenticates a decision about the normalized action, without proving execution truth, complete disclosure or autonomous task utility. The optional Groth16 study covers a narrower circuit predicate; the evaluation does not establish superiority over other systems.
Authors:Muhammad Aimal Rehman, Chi-Kuang Yeh
Abstract:
Retrieval‑augmented generation (RAG) can ground large language models in external evidence, but retrieved context does not guarantee that generated claims are factually supported. This problem is especially relevant in multi‑hop RAG, where retrieval and reasoning proceed through multiple dependent stages. We study whether claim‑level conformal factuality control, previously developed for RAG, remains effective in this setting. We apply split‑conformal claim filtering to multi‑hop RAG and evaluate it on HotpotQA, Natural Questions, and TriviaQA using Llama 3.1 8B and GPT‑4o‑mini, together with a single‑hop reference experiment. Across all six multi‑hop model‑dataset configurations, increasingly stringent conformal targets consistently increase the fraction of responses whose retained claims are fully supported. At the 95% target, this rate ranges from 95.80% to 97.20%, compared with 55.60%‑76.03% without filtering. However, the improvement is strongly selective: only 4.41%‑31.09% of generated claims are retained and 9.70%‑51.40% of responses remain non‑empty at the 95% target. These results show that conformal factuality extends to multi‑hop RAG, while demonstrating that nominal reliability must be interpreted jointly with claim retention and abstention.
Authors:Gen Matono, Shujiro Fujioka, Mayuko Nishio
Abstract:
Smoothed Particle Hydrodynamics (SPH) is well suited to a range of problems, particularly those involving large deformations in fluid dynamics. In recent years, in addition to the advancement of SPH formulations, the development of differentiable solvers has also progressed. However, unified frameworks that flexibly accommodate diverse numerical schemes, including advanced and implicit methods, while supporting continuous extension and updating remain limited. In this study, a high‑accuracy and composable differentiable SPH solver, CraftSPH, has been developed. In CraftSPH, major computational operations are implemented as independent modules, which can be combined according to the intended purpose of constructing a solver. This design enables different computational schemes to be intuitively constructed from combinations of common components and allows newly developed high‑accuracy discretization methods to be flexibly incorporated and extended. Furthermore, each module supports automatic differentiation, enabling applications to physical‑parameter estimation and to optimization that combines SPH solvers with deep learning models. Accordingly, CraftSPH provides an SPH computational framework in which high‑accuracy discretization, explicit and implicit computations, and automatic differentiation can be handled in a unified and extensible manner. To demonstrate the applicability of CraftSPH to a wide range of problems, forward analyses are conducted for Poiseuille flow, two‑ and three‑dimensional dam‑break problems, and a rising‑bubble problem. In addition, the performance of automatic differentiation is evaluated through inverse problems involving parameter estimation for the Taylor‑Green vortex and lid‑driven cavity flow.
Authors:Muhammad Usama, Dong Eui Chang
Abstract:
System prompts are the primary lever practitioners use to control language model behavior, yet what they actually do to the computation inside the transformer remains poorly understood. Across 17 instruction‑tuned models spanning 8 architecture families and 1.5B to 72B parameters, we use Centered Kernel Alignment (CKA) to compare layer‑wise representations under 20 system prompts in five functional categories. Effects are layer‑selective and instruction‑type‑dependent: persona and formatting instructions deeply restructure intermediate representations, while safety instructions barely move them, producing changes statistically indistinguishable from a minimal baseline. Restrictive safety instructions and explicitly permissive ones ("you have no restrictions") engage near‑identical computational pathways (mean CKA correlation 0.997), and this persists at commercial scale, where safety penetration remains below 10% even at 70B‑72B. A linear probing baseline exposes the mechanism: the model encodes prompt category at every layer but restructures its computation only at a small subset, so the prompt is reliably "seen" but, for safety, not deeply "acted upon." Causal activation patching confirms these layers mediate behavioral change, and representational depth predicts behavioral effect size across the full 17‑model cohort (Spearman rho = 0.761, p < 0.001). The findings provide a mechanistic explanation for the persistent jailbreak vulnerability of system‑prompt‑based safety. Code: https://github.com/Usama1002/system‑prompt‑illusion‑cka
Authors:Xinye Yang, Yuli Wang, Cheng Ting Lin, Harrison Bai
Abstract:
Patient world models and clinical agents aim to predict changes in patients' health and support clinical work. Developing these systems requires reliable histories of patient conditions, treatments, and the information available at each decision. Electronic health records (EHRs) contain these histories, but differences in how events are recorded make them difficult to use consistently. We present EHR2Trace, a system that converts EHRs from different sources into traceable patient events for model training and evaluation. It links events to source records, separates event time from information availability, and distinguishes medication orders, dispensing, and administration. A shared event representation supports both OMOP and MEDS exports, with automated validation and reproducible builds. Across three clinical datasets, EHR2Trace converted 846.4 million events, with every applicable check passing except one unit‑consistency check on MIMIC‑IV, and detected all 28 injected faults. A controlled prediction experiment showed that assigning later diagnoses to admission time substantially inflated measured performance, and that a model trained on such data lost accuracy when deployed on histories filtered by availability. EHR2Trace provides a reusable data foundation for patient world models and clinical agents, helping researchers inspect patient histories, check conversion decisions, and evaluate models with explicit data rules.
Authors:Jianming Xu, Jinfa Huang, Jingyang Lin, Zhengyuan Yang, Jiebo Luo
Abstract:
Long‑form video understanding requires multimodal agents to iteratively gather evidence over many reasoning steps. However, most existing agentic methods suffer from semantic thrashing: as append‑only working memory grows, attention to key evidence collapses, and the agent loses access to what it has already found. First, we provide a structural argument showing that append‑only memory can incorporate newly observed target evidence, but cannot remove accumulated noise or prevent ordered context growth without a rewrite operator. Second, motivated by this analysis, we propose VideoLoop, a multimodal agent with two coupled loops. The outer loop reasons over the video and the inner loop, after each step, retrieves artifacts from an unbounded filesystem of past observations and intermediate analysis, and rewrites a bounded working memory. Extensive experiments demonstrate the effectiveness of VideoLoop, which improves four popular LVLM backbones in a plug‑and‑play manner, with an average gain of 4.2% points over baseline on VideoMME (long). Further analysis of working memory suggests that VideoLoop mitigates semantic thrashing: on the hardest quarter of VideoMME (long) questions, a blind judge that reads only the agent's context answers 81.1% correctly, versus 60.9% for the append‑only agent. With Gemini 3.1 Pro, VideoLoop reaches 88.3% on VideoMME (long), 88.8% on VideoMMMU, and 80.9% on LongVideoBench (long).
Authors:Yiming Jiang, Jin Chen, Chongyang Xu, Yilun Chen, Aimin Hao, Yisheng He
Abstract:
Egocentric human demonstrations offer an accessible source of task experience, but differences in body scale and controller response, together with missing robot states, limit their value as humanoid training supervision. We present EgoAlign, a data‑construction framework that converts these demonstrations into action and state supervision compatible with a general‑purpose, continuous whole‑body controller, without collecting physical‑robot demonstrations. Using the target‑robot model and simulator, EgoAlign guides demonstration collection through execution feedback. It preserves locomotion references for visually guided periodic stepping while adapting upper‑body interaction geometry through scale alignment and controller‑in‑the‑loop refinement. A final causal replay reconstructs the corresponding robot states and motion‑token labels for training with the human observations. We assess the resulting supervision by fine‑tuning a vision‑‑language‑‑action model solely on adapted human demonstrations and deploying it zero‑shot on a physical humanoid. The resulting policies perform long‑range object relocation, navigation to unseen goal positions, and independently evaluated foot interaction. Refinement improves simulated hand alignment and physical pickup success over kinematic alignment alone, while human collection reduces on‑site acquisition time relative to teleoperation. https://lambdahumanoid.github.io/EgoAlign/
Authors:Zhida Zhang, Tao Wu, Siyu Liu, Jie Cao
Abstract:
How much of an image does a detector need to see? Small RGB regions can retain useful evidence of image synthesis even when they reveal little of the full scene. Motivated by single‑patch detection, we study patch‑wise supervision: a shared backbone classifies explicit crops, each crop receives its own loss, and patch probabilities are averaged only at inference. The procedure requires neither handcrafted residual filtering nor a learned image‑level fusion module. Experiments span single‑patch selection, multiple generator collections, and four CNN and Transformer backbones. On GenImage, the reported patch‑wise variants improve average accuracy over their whole‑image counterparts across all four backbones. Comparisons of supervision granularity, source resolution, crop size, and inference coverage further characterize the approach, while post‑processing tests and difficult‑image evaluation reveal its limitations. The historical experiments include evaluation‑based model selection, so their scores are not presented as a uniformly selected leaderboard comparison. Overall, the study identifies explicit local input and patch‑level supervision as a simple, useful combination for investigating generalizable AI‑generated image detection.
Authors:Jack Wei Lun Shi, Kaichen Zhou, Haoyu Chen, Yufeng Weng, Keane Ong, Ruojin Cai, Hang Hua, Justin K. W. Yeoh, Mengyu Wang
Abstract:
Video world models require persistent scene memory to maintain consistency during long‑horizon video generation. Existing spatial memories accumulate RGB observations or latent features, increasing storage requirements as generation proceeds. We introduce Honeycomb, a video world model built on HexMemory, our proposed low‑rank representation for storing scene features in a fixed‑size memory with a total of six spatial and spatiotemporal planes. A feed‑forward writer maps each generated chunk into new plane features. As the spatial coverage or temporal range expands, we warp the previous planes while preserving their dimensions, then fuse them with the new features through confidence‑weighted pooling and a learned residual correction. A reader retrieves latents from HexMemory to condition subsequent video generation. The writer processes only observations from the new chunk, avoiding per‑scene optimization and repeated processing of the full history. Experiments on WorldScore and RealEstate10K demonstrate strong video generation quality and robust revisit consistency while keeping HexMemory feature storage constant throughout generation. Code and additional visualizations are available on our project page at https://jackswl.github.io/honeycomb/.
Authors:Muhammad Huzaifa, Lea Schönherr, Thorsten Eisenhofer
Abstract:
Active test‑time adaptation (ATTA) improves robustness under distribution shift by updating a deployed model during inference while selectively querying supervision. However, most existing ATTA methods implicitly assume that supervision can be requested for every incoming test batch, which can incur substantial annotation cost over long test streams. In this work, we introduce budgeted ATTA in which labels are available for only a fraction of test batches. This formulation shifts the central challenge from deciding what to label within a batch to deciding when supervision should be applied over time. To address this challenge, we propose a budget‑aware approach WISE‑ATTA that allocates supervision over the test stream based on lightweight signals computed online, prioritizing periods where supervision is likely to be most useful. When a batch is selected for supervision, we further employ a drift‑based sample selection criterion that targets samples exhibiting ongoing, unconverged adaptation dynamics, enabling effective updates from a single labeled example. We evaluate this approach on synthetic corruptions (ImageNet‑C) and natural distribution shifts (ImageNet‑R/K/A). Across settings, WISE‑ATTA achieves competitive or improved performance compared to recent ATTA methods while requiring substantially fewer labels. Overall, we find that the timing of supervision is a key, yet underexplored, aspect of active test‑time adaptation. Code: https://github.com/Muhammad‑Huzaifaa/WISE‑ATTA
Authors:Jinze Yang, Yangyang Li, Xiu-Hao Deng
Abstract:
A phase that reaches a fault‑tolerant processor in additive pieces can be remembered until the last piece arrives, or executed on arrival: the first option costs classical memory carried across rounds, the second costs magic states committed before the phase is known. We determine the exchange rate α, committed T gates per bit of memory forgone, for ancilla‑free coordinatewise Clifford+T compilation. The Ramanujan bound gives α\ge2 with explicit constants, the square‑root barrier of the spectral method. An elementary determinant method, using that quaternion numerators lie on spheres in both real embeddings of \mathbbQ(\sqrt2), counts words near any rotation coset below that barrier. With a height dichotomy for the sphere sections it produces and a fibration over rational projections, it gives every α<5/2 unconditionally and uniformly over frames, by an exact SMT check of its continuum case analysis; 5/2 is where this method stops. At Clifford‑framed cosets the volume law holds up to subexponential factors: all but a vanishing fraction of z‑rotations need T‑count (3‑o(1))\log_2(1/\varepsilon), and processes whose committed pieces are near Clifford‑framed z‑rotations, including per‑rotation pipelines, have α\ge3‑o(1), which a fractional‑passthrough family attains under the Ross‑Selinger typical‑cost hypothesis. Under an equidistribution conjecture supported by exhaustive enumeration to T‑count 22, α=3 in general and memory should be shed in whole rotations. The bounds hold even when the phases cancel to the identity; side information enters through a conditional entropy; probabilistic mixing halves the costs but not the rate. With clean ancillas and a phase‑gradient catalyst, table lookups batched over coordinates drive the rate to O(1/\log\log(1/\varepsilon)), so the constant‑rate law is specific to coordinatewise synthesis.
Authors:Yuhao Liu, Yiming Zhong, Hanqing Wang, Shaocheng Yan, Yuhang Zhang, Wenzhou Lyu, Ziyang Ding, Wei Zhang, Xue Zhao, Jin Pan, Yuexin Ma, Xinge Zhu
Abstract:
Affordance perception aims to localize actionable regions supporting embodied interaction, yet 2D and 3D affordance grounding have evolved as separate problems, with different task definitions, supervision formats, datasets, and evaluation protocols. This fragmentation limits the learning of transferable object‑affordance semantics across visual and geometric spaces. We propose Token Router for Tasks, a multitask training paradigm for MLLM‑based systems that routes contextual hidden states to task‑specific branches without requiring the language head to generate predefined markers. Routed states are supervised directly by branch‑specific objectives, enabling dense prediction losses to shape shared MLLM representations. We instantiate this paradigm as UniAfford, a unified framework for generalizable 2D‑3D affordance perception, together with UniAfford‑Data, a dataset integrating pixel‑level 2D annotations, point‑level 3D annotations, and language instructions under a shared object‑affordance taxonomy, supporting heterogeneous supervision through semantic‑level 2D‑3D pairing. UniAfford adopts an MLLM as a shared semantic hub and a modality‑aware token router to produce image‑ and point‑cloud‑affordance queries. These queries respectively condition a SAM‑style pixel decoder and a SONATA‑based point decoder, enabling flexible 2D, 3D, and joint affordance inference from image‑only, point‑cloud‑only, or paired multimodal inputs. Experiments demonstrate strong zero‑shot generalization across 2D and 3D affordance benchmarks without target‑specific fine‑tuning, alongside state‑of‑the‑art branch‑wise performance under modality‑isolated protocols. Ablations validate token routing, joint 2D‑3D supervision, and decoder coupling, while language‑head diagnostics show that routed latent states carry meaningful object‑affordance semantics. Project page: https://4dvlab.github.io/UniAfford
Authors:Yang Zhang, Jiangyuan Zhao, Chenyou Fan, Jiayu Hu, Xiu Yuan, Chenjia Bai, Xiu Li
Abstract:
World‑action models (WAMs) couple future visual‑state prediction with action generation. By adapting video generators or image‑editing models pretrained at scale, a prominent line of recent WAMs inherits both predictive knowledge and the models in which it was learned. We ask whether a predictive visual latent space induced by large‑scale predictive pretraining can instead provide a sufficient foundation for effective WAM learning without inheriting a complete pretrained visual generative model. To answer this question, we introduce V‑JEPA Policy, a simple framework that builds a WAM on the latent space of a frozen V‑JEPA 2.1 encoder. An instruction‑conditioned future‑latent predictor and a flow‑matching action expert are jointly learned from scratch in a single downstream stage, with the predictor's future‑informed context key‑‑value states conditioning action generation. With 0.9B total parameters, of which 0.6B are trainable, V‑JEPA Policy achieves competitive performance with representative WAM and vision‑language‑action baselines across LIBERO, LIBERO‑Plus, and RoboCasa‑GR1. Comparing visual foundations under the same downstream framework and training budget identifies V‑JEPA latents as more effective than the discriminative, reconstructive, and video‑understanding‑oriented alternatives, particularly under distribution shifts. Beyond task‑specific learning, pretraining the predictor on DROID video‑‑instruction pairs without action labels and adapting it into a WAM yields substantial gains in downstream control and out‑of‑distribution generalization. Together, these findings establish predictive visual latents as a foundation for effective WAM learning from task‑specific demonstrations and for transferring future‑modeling knowledge acquired from broader in‑the‑wild videos. Our code is available at https://github.com/breez3young/VJEPA‑Policy.
Authors:Ido Levy, Asaf Yehudai, Segev Shlomov, Asaf Adi, Leshem Choshen
Abstract:
An agent that uses tools typically responds to what the user explicitly asks, yet completing the task may require information the user never requested. Work on proactive agents mainly studies whether and when an agent should act on its own, not what information it should pursue. We study a distinct axis of proactivity: its content. Horizontal proactivity pursues unstated information that the current context already identifies, and vertical proactivity pursues needs that only earlier evidence reveals. A need graph, recovered from a benchmark's own decomposition, records which needs depend on which, so both forms, and whether the agent stops at the right time, can be scored from a transcript without a model judge. To learn this behavior, we propose Q&D (questioner and drafter), which trains a questioner to prefer the question whose continuation retrieves more of the required evidence, with no reward model or judge. On held‑out splits of three multi‑hop question‑answering benchmarks, at equal retrieval spend, the trained questioner improves both forms of proactivity over the same model, prompted, and outperforms a prompted model 15× larger in the same role on two of the three, and the gain persists after controlling for question volume and length. Without further training, we place the questioner in an interactive customer‑service agent with a simulated customer, where it completes more tasks while asking fewer questions, and in retail it outperforms the 15× larger model with fewer follow‑up turns from the customer. These results show that proactivity depends not only on whether an agent acts without being asked, but also on what it chooses to pursue and when it stops.
Authors:Woosang Jeon, Jiwon Yang, Soo Chung, Taehyeong Kim
Abstract:
Visual distinctions are often finer than those reflected in linguistic conceptualization. Vision‑language models exhibit a similar asymmetry: a distinction can remain discriminable in frozen image geometry while being weakly addressable through the native text interface. We study this gap by separating visual discriminability from linguistic addressability in text‑to‑image retrieval. Using FactorAtlas, a fully crossed testbed of 23,040 images spanning shape, hue, pattern, and nuisance variation, we compare both readouts on held‑out images of the same distinctions. We then derive image‑side contrasts that separate each value from its alternatives for matched visual grounding, and test whether this reduces the native‑text access gap across factors and models. Direction‑specific and visual‑absence controls tie these gains to the relevant visual contrast; the gains persist after global alignment and extend to compositional retrieval and natural images. Together, these results show that visual discriminability and linguistic addressability need not coincide, and that matched visual grounding can probe and reduce the resulting access gap.
Authors:Zhangquan Chen, Yaoxin Niu, Xiang An, Mingze Sun, Zhumei Wang, Chih-Ting Liao, Hongkun Cao, Ruqi Huang
Abstract:
Multi‑turn visual search agents answer questions about high‑resolution images by iteratively deciding where to look. Reinforcement learning for these agents rewards only the final answer, leaving the search process unsupervised. Consequently, faulty routes in which the reasoning process is erroneous yet the final result is correct arise frequently, which in turn leads to ineffective training, i.e., scaling along the wrong paths. In this paper, we introduce HaPRL, the first framework to reinforce the search process with human search behavior. We first build an annotation platform and collect 1K+ human‑annotated data with fine‑grained behavioral signals. During training, a carefully designed judge scores each rollout with task‑adaptive weights, anchored on the distilled trace of how a human annotator actually searched the same image. Extensive experiments show that HaPRL consistently outperforms outcome‑based RL, and early‑stage process supervision yields 6.7x more improvement in subsequent outcome‑based scaling. Our results also demonstrate the importance of aligning model behavior with human process annotation signals, which offer new insight into the training of foundation models.
Authors:Haemin Kim, Junghyun Nam, Seokhyeon Hong, Vanessa Tan, Junyong Noh
Abstract:
Motion stitching aims to create new character animations by seamlessly combining existing motion sequences. Existing approaches often require manual selection of transition range or assume fixed transition length, restricting the types of motions that can be connected. To broaden the diversity of motions that can be synthesized, it is essential to generate transitions of varying lengths, allowing the character sufficient time to adapt its pose when the input motions differ significantly. To this end, we propose a length‑varying neural motion stitching method based on a cluster transition graph, which produces naturally connected motion sequences given two distinct input motions. Our framework consists of three stages: motion clustering, cluster pathfinding, and motion generation. First, motion clustering maps input motions to discrete clusters. Next, we identify the corresponding clusters in the cluster transition graph and search for a connecting path. In this graph, nodes represent motion clusters, and directed edges indicate valid transitions between them. The resulting path determines both the transition length and a guide sequence that informs motion generation. Finally, the path and input motions are provided to a Transformer encoder‑based motion generator to produce the final transition poses. Experimental results demonstrate that our method adaptively adjusts the motion length and successfully generates plausible transitions between distinct motions, such as crawling, basketball shooting, and slow locomotion. We also show that using a graph structure effectively estimates transition durations and produces high‑fidelity results compared to methods that assume a fixed transition length, or directly compute the time.
Authors:Junghyun Kim, Ngseo Kim, ChungWoo Lee, Seoyeon Lee, Woo-Jeong Baek, Adam Zhou, Chip Huyen, Jun-Ki Lee, Gi-Cheon Kang, Byoung-Tak Zhang
Abstract:
Vision‑Language‑Action (VLA) models remain brittle under visual distribution shifts, often relying on spurious correlations tied to domain‑specific factors rather than task‑relevant structure. We propose Domain‑Invariant Latent Lookahead (DILL), a representation‑learning framework that mitigates shortcut learning in VLA policies. Our key idea is to supervise policies with domain‑invariant future latents learned from domain‑transformed trajectory data. A Task‑Domain Encoder is trained with contrastive objectives and Gaussian disentanglement regularization to separate task‑relevant structure from domain‑specific visual variation. The learned encoder then provides future latents for VLA policy learning through lookahead prediction and domain disentanglement, encouraging the policy to focus on task‑relevant structure rather than incidental visual factors. Counterfactual task‑view evaluations show that DILL reduces shortcut reliance, while LIBERO‑Plus evaluations demonstrate improved visual robustness, with 69.1% average success, 11.4 percentage points above the strongest baseline. Real‑world manipulation experiments further support DILL's applicability beyond controlled simulation. Complementary latent‑space diagnostics show that these behavioral gains are accompanied by representations that better preserve task‑consistent structure while suppressing domain‑specific variation. Our project page is available at https://dill‑vla.github.io/.
Authors:Shenglan Li, Rui Yao, Kunyang Sun, Hong Jia, Yong Zhou, Javen Qinfeng Shi, Xinyu Zhang
Abstract:
RGB‑T object tracking leverages the complementary characteristics of visible and thermal infrared modalities to improve robustness under adverse conditions. Existing supervised methods typically rely on costly modality‑aligned bounding box annotations, while most self‑supervised approaches follow a two‑stage pseudo‑labeling paradigm, making tracker training sensitive to pseudo‑label quality and preventing joint end‑to‑end optimization. In this paper, we propose ESMTrack, a fully end‑to‑end self‑supervised RGB‑T tracking framework without offline pseudo‑label generation or dense frame‑level bounding box annotations. Given only the standard initial‑frame annotation used in visual tracking, ESMTrack learns discriminative and temporally consistent representations through two complementary objectives: a grounding triplet loss on annotated initial frames and a cross‑frame temporal triplet loss on unlabeled search frames, with reliable samples selected by forward‑backward consistency. To address modality dominance bias, ESMTrack employs a three‑branch architecture consisting of a fusion branch and two unimodal branches for RGB and thermal inputs. We quantify modality contributions using the Average Peak‑to‑Correlation Energy by measuring response discrepancies between the fusion and unimodal branches. The resulting reliability estimates guide a training‑time modality decoupling mechanism that suppresses dominant‑modality shortcuts and adaptively weights cross‑modal contrastive learning for task‑level alignment. Extensive experiments on five RGB‑T tracking benchmarks show that ESMTrack achieves competitive state‑of‑the‑art performance, strong cross‑dataset generalization, and real‑time inference speed. The source code is available at https://github.com/LiShenglana/ESMTrack.
Authors:Zifu Tao, Changqing Yin
Abstract:
Tool‑augmented data agents rely on tool outputs for analytical decisions. Yet successful execution can return plausible but incorrect evidence, requiring agents to decide whether to trust or verify it. Understanding this failure requires examining both the evidence obtained through checking and the answer ultimately adopted. We introduce ToxicBench to measure checking and adoption under numerical, label, schema, and retrieval errors, pairing clean and poisoned observations over fixed source data. In the 118‑task GPT evaluation across three adapters, poisoning lowers task success by 26 to 39 percentage points. Ordinary retries help under one‑shot poisoning, whereas repeated poisoning reveals wrong‑answer adoption after checking. Controls on three public tables isolate how supplied evidence affects recovery. After freezing the scorer, we compare its judgments with human annotations on 200 trajectories, finding 96% task‑success agreement. Human judgments support retry gains over Base and confirm adoption after checking on audited tasks. We release trajectories, versioned scoring, and reference and delivery audits. These findings highlight evidence availability and answer selection as complementary dimensions of agent reliability.
Authors:Tommaso Martorella, Alexandre Galashov, Felix Krause, Stefan Andreas Baumann, Valentin De Bortoli, Arthur Gretton, Björn Ommer
Abstract:
Distributional Diffusion Models (DDMs) replace the standard mean‑prediction denoiser with a \emphdistributional denoiser trained via a scoring rule objective, learning a stochastic approximation to p(x_1 \mid x_t) rather than its conditional mean. However, scaling DDMs to modern image‑generation settings faces two obstacles: (i) multi‑particle training incurs overhead that scales with the number of particles, (ii) DDMs use globally fixed scoring rule hyperparameters, forcing a single trade‑off across sampling budgets. We mitigate these limitations by deferring particle expansion to late transformer layers, and the hyperparameter trade‑off by introducing time‑dependent scoring rule schedules informed by the dynamical regimes of~\citetBiroli2024. Combined with a DiT‑based latent setup, these changes make DDM training practical on class‑conditional ImageNet‑256^2, achieving 4.48 FID at 4 steps and 2.38 at 50 steps with DiT‑XL/2, from a single model trained from scratch in one stage, without a teacher, self‑distillation or JVPs. The result is a stochastic few‑step generator whose FID does not degrade as the sampling budget grows from 4 to 50 NFE, and the same recipe transfers to text‑to‑image generation. Code and pre‑trained models available at https://github.com/CompVis/iDDM.
Authors:Kajetan Ożóg, Alicja Wojciechowska, Dawid Malarz, Paweł Batorski, Artur Kasymov, Przemysław Spurek
Abstract:
Establishing unbranding as a critical practice to prevent visual logos from acquiring negative connotations is standard in image generation. Large Language Models (LLMs) now face a parallel and emerging challenge. These models frequently generate brand descriptions within diverse contexts. This frequency introduces significant risks, such as trademark dilution, false attribution, and brand defamation. In response, we formally define the novel task of LLM Unbranding. We specifically address the complex challenge of managing trade dress within textual outputs. This involves neutralizing characteristic language, slogans, and stylistic markers that define brand identity. Crucially, these elements are less evident than explicit visual logos. To benchmark this task, we introduce a comprehensive evaluation dataset incorporating prominent brands from multiple commercial domains. We rigorously evaluate existing state‑of‑the‑art machine unlearning models using this benchmark. This evaluation identifies their limitations in selective textual unbranding. Finally, we propose MUTE, a novel inference‑time method that effectively neutralizes textual trade dress while preserving the LLM's general capabilities and utility. By leveraging an iterative refinement loop, MUTE systematically optimizes system instructions to safely eliminate brand leakage without requiring fragile parameter updates. Code and dataset: The evaluation dataset and code for LLM Unbranding are available at https://github.com/KajetanOzog/LLM_unbranding. The implementation of MUTE is available at https://github.com/KajetanOzog/MUTE.
Authors:Yaoxin Niu, Zhangquan Chen, Yang Zhang, Xiang An, Zhumei Wang, Chih-Ting Liao, Hongkun Cao, Ruqi Huang
Abstract:
Fine‑grained visual perception enables vision‑language models to distinguish subtle attributes and ground their answers in visual evidence. In high‑resolution scenes, processing the whole image at greater resolution spends visual tokens on irrelevant content, while isolated crops can lose the context needed to interpret the selected evidence. We introduce EviViT, a lightweight attachment that learns where a pretrained vision transformer should acquire detail. Human visual‑search traces supervise a question‑conditioned evidence density, which guides regional re‑reading from the original pixels and the allocation of visual tokens. A sparse, coordinate‑aware bridge then connects the regional features to the global scene, allowing the host to interpret precise evidence in context. Learned with the host backbone frozen, the attachment serves both the base model and compatible post‑trained descendants without refitting. Experiments across nine hosts show consistent gains in average fine‑grained accuracy. Matched‑budget comparisons further show that EviViT outperforms global‑only processing at every tested token ceiling while using fewer visual tokens.
Authors:Yulin Sun, Kele Xu, Yong Dou
Abstract:
Multimodal sentiment analysis integrates textual, acoustic and visual cues, yet current language‑model‑based fusion methods typically leave prediction‑layer branch allocation implicit. We introduce Branch‑Calibrated Multimodal Language Fusion (BC‑MLF), which explicitly models prediction‑layer branch allocation through a Branch‑Calibrated Task Head (BCHead), complemented by Fusion Token Contrastive Learning (FTCL) for sentiment‑aware fusion‑token regularization. FTCL organizes mean‑pooled fusion‑token representations according to continuous sentiment affinity, while BCHead combines fusion, text and audiovisual predictions through a lightweight sample‑adaptive constrained mixture. Without modifying the fusion backbone, BC‑MLF consistently improves the reproduced DeepMLF baseline and achieves the strongest results among the compared methods on CMU‑MOSEI and CH‑SIMS across classification and regression metrics. The controlled ablations show that sample‑adaptive prediction‑layer branch allocation consistently outperforms static branch aggregation. Code is available at https://github.com/sunyulin0421/BC‑MLF.
Authors:Takumi Asada, Hideo Furuhashi, Kenta Tabata, Renato Miyagusuku, Koichi Ozaki
Abstract:
Multimodal biomimetic underwater robots (BURs) can conduct underwater tasks suitable for the environment. Combining the characteristics of aquatic organisms enables the swimming and leggedlocomotion required for underwater exploration. Locomotion control mechanism relies on rule‑based behavior selection and the designer's discretion. This limits the robot's ability to acquire new behavioral capabilities to the predetermined range of behaviors. To address these challenges, we propose a mechanism and control system that enables the expression of multimodal locomotion capabilities from the same multi‑jointed structure. A mechanism equipped with four leg‑fins each having four axes is used. This controller achieves nonlinear behavior based on sensor modalities, rather than relying on predefined conditional rule‑based on locomotion functions. This system was validated through both physical and simulation testing based on multiple sensor data and behavioral patterns. Utilizing a potential function in multimodal locomotion control was verified to enable transitions between two or three behaviors. Implementing the control method as a multimodal controller is expected to enhance its application in underwater exploration. Our project page is at https://tasada038.github.io/multi‑jointed‑bur/.
Authors:Yaozhong Kang, Jiang Wang, Takeshi Ashizawa, Benjamin Yen, Kazuhiro Nakadai
Abstract:
The ability to navigate toward sound sources extends a robot's reach beyond its visual field, enabling response to auditory events in unknown environments. To equip robots with this capability, existing methods couple acoustic and visual information through joint audio‑visual learning in acoustic simulators. However, acoustic simulation is both low‑fidelity and expensive, producing a domain gap that prevents reliable real‑world deployment, while the discrete action spaces inherited from grid‑based simulators introduce an additional kinematic gap on physical robots. To alleviate these issues, we propose BCNav, a decoupled framework that separates the acoustic module from the learned navigation policy using direction‑of‑arrival (DOA) estimation: an estimator provides a scalar bearing to the sound source, so the navigation policy only processes depth images and a bearing angle, two inputs whose domain gaps are well characterized. We collect shortest‑path demonstrations with calibrated bearing noise injection and train the policy via imitation learning to output continuous velocity commands directly executable on ground robots. We demonstrate the method in simulation and on a physical robot, navigating unknown environments without any acoustic fine‑tuning, prior mapping, or real‑world audio data collection. Code is available at https://github.com/york1to/bcnav.
Authors:Zhengqiang Zhang, Lingchen Sun, Rongyuan Wu, Qiaosi Yi, Xiangtao Kong, Chaodong Xiao, Lei Zhang
Abstract:
Latent Diffusion Models (LDMs) typically adopt a two‑stage pipeline: an auto‑encoder (AE) is first pre‑trained to define a latent space, then a diffusion model is trained to perform denoising within it. Such a two‑stage design introduces a representation mismatch, as the latent space is optimized for reconstruction rather than adapting the denoising dynamics. We reveal that the LDM itself is an AE, and consequently present LDM‑is‑AE, an end‑to‑end one‑stage LDM training framework that eliminates the need for a separately trained tokenizer. Our key observation is that the LDM backbone actually performs a latent‑to‑feature‑to‑latent transformation at each denoising step, which can be interpreted as an internal decoding‑‑encoding process. Leveraging this structure, we split the DiT backbone into two reciprocal components, DiT‑E (i.e., DiT Encoding) and DiT‑D (i.e., DiT Decoding), and impose image‑space supervision on the intermediate features across all timesteps. Our model encourages the internal representation to align with the image domain throughout denoising, thereby establishing an explicit latent‑to‑image‑to‑latent path. At the zero‑noise timestep, our model further performs an image‑to‑latent‑to‑image mapping, corresponding to an auto‑encoding process. As a result, LDM‑is‑AE jointly learns latent representations and denoising dynamics in an end‑to‑end manner, yielding a diffusion‑native latent space tailored to the generation process. Experiments demonstrate that LDM‑is‑AE exhibits highly competitive generation performance, achieving an FID of 1.80 and 1.90 on 256x256 and 512x512 class‑conditional image generation, respectively.
Authors:Yingda Fan, Dan Lu, Xiaowei Jia
Abstract:
Time series modeling increasingly demands high‑quality supervision, yet target observations remain scarce ‑ exogenous inputs are broadly available, but target measurements are often unavailable due to cost, infrastructure, or accessibility constraints. Can models trained on observed locations reconstruct target time series where measurements have never been collected? We term this zero‑shot time series reconstruction. A naive approach ‑ directly mapping exogenous inputs to targets ‑ can yield predictions at unobserved locations, but without target signals, such models fail to capture the intrinsic dynamics of the target variable, producing overly smooth outputs that underestimate extremes. This reveals systematic errors that call for explicit modeling and calibration. We propose ZeroDiff, which constructs an informed prior from exogenous variables alone, then learns to calibrate reconstruction errors through diffusion ‑ training on observed locations and generalizing to unobserved ones. Experiments across diverse real‑world datasets demonstrate significant improvements over existing approaches. Our code is available at https://github.com/YingdaFan/ZeroDiff‑ICML2026.
Authors:Wei Da, Yavuz Ferhatosmanoglu, Evangelia Kalyvianaki
Abstract:
Dynamic layer skipping reduces LLM computation by allowing each token to execute only a subset of the model's layers. However, existing skippers rely on specialized generation loops and do not integrate with modern serving engines. As a result, fewer executed layers do not necessarily translate into lower serving latency: FlexiDepth skips 8 of Llama‑3‑8B's 32 layers on average, yet its standard generation loop decodes 14.6‑‑21.0% more slowly than the base model. We present vSkipper, a virtualization layer that makes dynamic layer skippers pluggable in serving engines while preserving continuous batching, fixed‑shape batches, paged KV caching, and captured decode graphs. At each routed layer, vSkipper groups tokens by the skipper's decision and uses routed execution only when predicted to be profitable. We implement vSkipper in SGLang and evaluate the released FlexiDepth checkpoint against upstream SGLang under identical prompts, arrivals, output lengths, and launch settings. At the knee of upstream's load curve, vSkipper reduces mean end‑to‑end latency by 36.8% on GSM8K and 13.6% on BBH. Under saturation, it increases request throughput by 11.3% and 7.4%. Serving adds no statistically resolved quality loss beyond the checkpoint's own. Across synthetic skip policies, two Qwen3 skippers, and three GPUs, we demonstrate reuse without workload‑specific tuning. To our knowledge, vSkipper is the first system to realize serving‑efficiency gains from per‑token interior layer skipping within a modern LLM serving engine. The code is open‑sourced as an SGLang fork at https://github.com/AKafakA/sglang‑vskipper/tree/vskipper‑ref
Authors:Dooho Lee, Jinmo Lee, Minho Jeong, Kijung Shin, Jaemin Yoo
Abstract:
Achieving strong performance with graph neural networks (GNNs) typically requires training and hyperparameter tuning for each dataset, incurring repeated costs and effort. Graph in‑context learning (ICL) avoids this by using a single pretrained model to predict unknown node labels directly from labeled context nodes. Existing approaches, however, rely on dense attention across nodes, making inference increasingly expensive as graphs grow. In this work, we present Ephris, a new graph in‑context learner built on sparse message passing, scaling linearly with the number of node‑feature entries and graph edges. Ephris is pretrained entirely on synthetic graphs generated from structural causal models with diverse graph structures and relational dynamics, exposing the model to varied dependencies among topology, features, and labels. We evaluate Ephris on 51 node‑classification datasets against 15 extensively tuned GNNs and existing graph ICL methods under both high‑ and low‑label train/validation/test splits. Across both settings, Ephris ranks first on all four aggregate measures: Elo, improvability, average rank, and accuracy. Its inference cost remains comparable to training a single GNN once, while being over 10 times faster than previous graph ICL models. Together, these results advance the performance‑runtime Pareto frontier, demonstrating that strong graph ICL does not require dense attention. Code and model weights are available at https://github.com/nums‑ai/ephris.
Authors:Zhenyu Liu, Zhangquan Chen, Keyi Chen, Mingze Sun, Xiang An, Haodong Jing, Ruqi Huang
Abstract:
Vision‑language models (VLMs) increasingly operate in embodied and spatially grounded settings, where accurate understanding of depth, viewpoint, and three‑dimensional relations is essential. However, improving spatial reasoning typically relies on ground‑truth answers, answer‑derived rewards, or other forms of task‑specific supervision. We introduce Spatial‑OPSD, a label‑free self‑improvement framework that instead exploits spatial structure naturally available from perception and reconstruction tools. During training, a privileged teacher receives automatically obtainable spatial priors, such as depth, reconstructed 3D relations, and camera geometry, while the student observes only the original visual‑language input. On trajectories sampled by the student itself, the teacher provides dense token‑level supervision, allowing the student to internalize spatial knowledge without ground‑truth answer labels or privileged information at inference time. To extend this supervision beyond a single round, we adopt a round‑wise recursive training scheme: the teacher remains frozen within each round to provide a stable learning target, and the improved student initializes both teacher and student in the next round, where privileged spatial priors re‑establish an informative teacher‑‑student asymmetry. This enables repeated self‑improvement while avoiding a rapidly moving teacher during optimization. Across four VLM families, a single round of Spatial‑OPSD consistently improves the five‑benchmark average, while three rounds further push a strong spatially specialized model to the open‑source frontier, achieving the highest average among the open models and the best results on three of five spatial reasoning benchmarks. Our code is available at https://github.com/vermouth599/Spatial‑OPSD.
Authors:Mei Wu, Rui Xie, Runyu Zhang, Yuqiang Li, Tianfan Fu, Bo Chen, Kai Yu, Xin Chen, Lu Chen
Abstract:
Multimodal GUI agents have achieved impressive results on general software benchmarks, yet their ability to operate professional scientific software remains largely unexplored. In materials science, sparse domain‑specific web data, specialized interfaces, and tacit workflow conventions create blind spots that general‑purpose pretraining cannot readily bridge. We present MatToolBench, the first real‑environment benchmark for evaluating multimodal GUI agents on professional materials science software, comprising 204 tasks across 10 tools in three modalities: GUI operation, OriginPro scripting, and code‑based database queries, all executed inside a Windows 11 VM. Each task is decomposed into fine‑grained sub‑criteria by domain experts, enabling interpretable partial‑credit scoring; the GUI component of our multi‑level evaluation pipeline achieves an average F1 of 0.98. For OriginPro figure‑generation tasks, we further conduct a human‑LLM agreement study to validate the use of a multimodal judge for secondary aesthetic assessment. Our experiments show that strong performance on general benchmarks does not transfer to professional scientific workflows, and that this gap is not a visual‑grounding problem alone: failures arise from domain‑specific operational knowledge, sparse pretraining coverage of scientific software, weak cross‑tool artifact handoff, and critical states exposed only visually. Even the best model reaches only 25% success rate on GUI tasks and 45% on code tasks. MatToolBench therefore serves as a challenging diagnostic benchmark and real‑environment testbed for data‑scarce, knowledge‑intensive scientific workflows.
Authors:Aidin Attar, Eleonora Cicciarella, Michele Rossi
Abstract:
We propose a new spiking neural network (SNN) design to process static images and event streams using time‑to‑first‑spike (TTFS) latencies. Our key research question is which architectural choices best accommodate local and online learning in multi‑layer convolutional SNNs. This question is addressed via an original framework combining residual‑like connections with multi‑depth feature aggregation and consensus. The full SNN pipeline features an early‑vision front end, to convert raw visual data into sparse spike latencies, a four‑layer convolutional backbone trained layerwise with unsupervised spike‑timing‑dependent plasticity (STDP), a deterministic Multi‑Depth Temporal Fusion (MDTF) and a final classifier trained with reward‑modulated spike‑timing‑dependent plasticity (R‑STDP). Rather than replacing early features in deeper layers, the proposed MDTF preserves early temporal evidence, adding sparse residual events from intermediate layers, and incorporating deeper features only when they agree in time with earlier representations. The resulting architecture is experimentally validated across MNIST, Fashion‑MNIST, CIFAR‑10, and N‑MNIST, delivering strong classification performance under a fully local learning regime. Selective multi‑depth fusion significantly outperforms traditional STDP/R‑STDP baselines on higher‑variability visual tasks (achieving +18.2 pp on Fashion‑MNIST and +29.2 pp on CIFAR‑10). Furthermore, activity‑budget analyses show that the network retains high accuracy even when removing a large fraction of late or weak spike events, confirming its high data efficiency and reduced event‑processing requirements. The codebase is publicly available at github.com/aidinattar/multi‑depth‑temporal‑fusion‑snn.
Authors:Yuwen Qian, Yidong Ouyang, Zhengyan Wan, Hongyuan Zha
Abstract:
Sampling from unnormalized distributions over large discrete state spaces becomes difficult when a multimodal target is far from a tractable reference. We introduce Iterative Exact Discrete Guidance (IEDG), a population‑exact, trajectory‑wise guidance framework for unnormalized discrete targets. Rather than learn the full reference‑to‑target correction in one step, IEDG introduces a global Boltzmann tilt along an annealing trajectory. Each stage learns a stage‑local posterior correction for an incremental Boltzmann tilt of the current source, while the resulting corrections are accumulated relative to a fixed analytic posterior. At the population optimum, exact stage posteriors recover the correct reverse dynamics, whose exact simulation reproduces the target distribution. IEDG chooses stage increments by relative effective sample size (rESS), which controls Rényi‑2 displacement and locally adapts the step size to the thermodynamic geometry of the annealing path. Our stagewise total‑variation analysis shows that limited overlap amplifies Bregman fitting error by 1/\sqrt\mathrmrESS, while posterior, simulation, and truncation errors enter additively. IEDG improves all distribution‑level errors over the neural baselines on ordered, exactly enumerated Ising 4×4, while substantially reducing one‑shot errors on Ising/Potts 16×16 across thermodynamic regimes and attaining the best neural‑sampler result on several reported local‑statistic and phase‑coverage metrics. On Max‑Cut, its best‑of‑512 and average‑sample ratios exceed all the baselines. Code and artifacts are available at https://github.com/StillFantasy123/iterative‑exact‑discrete‑guidance.
Authors:Wei Huang, Chenying Liu, Yilei Shi, Xiao Xiang Zhu
Abstract:
Building extraction from optical remote sensing (RS) imagery is fundamental to urban mapping, yet existing methods are often dataset‑specific and generalize poorly to unseen domains. Their practical use is also limited by insufficient detail recovery and weak geometric regularization, leading to blurred boundaries, irregular shapes, and merged adjacent buildings. To address these issues, we propose UniBuild, a unified building extraction framework for multi‑source RGB optical RS imagery. First, a unified multi‑dataset training scheme is constructed over heterogeneous RGB optical datasets to learn transferable building representations across sensors and resolutions. Second, a novel detail‑preserving HR‑DPT decoder is designed to integrate high‑level semantic features with high‑resolution spatial features, enhancing building detail recovery. Third, geometry‑aware regularization is introduced through a structure‑tensor‑based direction‑aware loss for boundary direction consistency and a saddle‑aware loss for suppressing false activations in narrow inter‑building gaps under low‑resolution conditions. We train and evaluate UniBuild on multi‑source RGB optical datasets, including 10 public high‑resolution datasets and two self‑collected low‑resolution datasets. Experiments show that UniBuild consistently improves building‑region accuracy, boundary sharpness, and adjacent‑building separation across diverse datasets. It also generalizes well to unseen domains and supports practical building extraction from RGB optical RS imagery up to 10\,m resolution. The predicted masks can be further converted into GIS‑compatible building footprints through simple polygonization. The trained model and inference code are released at https://github.com/zhu‑xlab/UniBuild.
Authors:Junbo Shen, Jinying Gao, Bo Lei
Abstract:
Integrating transcriptomic and electrophysiological data is essential for building multimodal foundation models for neuroscience. Patch‑seq provides paired measurements of gene expression and intrinsic electrophysiology from the same neuron, establishing a basis for training cross‑modal models. Here we introduce LangPatch, a foundation‑model‑based contrastive learning framework that uses paired Patch‑seq data to align pretrained GenePT representations with electrophysiological phenotypes through a language‑based interface. Gene descriptions and verbalized electrophysiological profiles are embedded by the same frozen text encoder. A context adapter and projection modules connect the modalities through paired contrastive learning. Across mouse visual, mouse motor, and human cortical cohorts, LangPatch achieves the highest mean transcriptome‑to‑electrophysiology prediction correlation among the evaluated foundation‑model and representation‑learning methods. It also improves held‑out cross‑modal alignment in the two mouse cohorts (FOSCTTM 0.107/0.135 vs. 0.208/0.222 for JAMIE, an existing cross‑modal Patch‑seq imputation method). It predicts transcriptomic family, type, cortical layer, and marker‑gene expression from electrophysiology, exceeding other baselines on most endpoints. More importantly, the method transfers across brain areas and species: a model trained on mouse visual cortex predicts electrophysiology in motor cortex with approximately 70% correlation retention and in human cortex with 47% (58% on acute‑slice recordings). Together, these results demonstrate alignment between molecular and functional representations of neurons, providing a building block for multimodal foundation models in neuroscience.
Authors:Oliver Keszocze, Tjark Petersen, Arved Friedemann, Matthias Bo Stuart
Abstract:
This paper explores the applicability of functional programming to the design of Application‑specific Integrated Circuits (ASICs). We investigate the impact of designing ASICs using high‑level, abstract Hardware Description Language (HDL) features versus employing low‑level optimizations on the area of the synthesized circuits. The aim is to determine whether using low‑level optimizations is beneficial and, if so, whether it is worth the added implementation effort. To carry out the investigation, we implement an unsigned bit‑serial multiply‑accumulate (MAC) unit in 16 different configurations using the functional HDL Clash. We make use of both low‑level bit‑manipulation techniques as well as Clash's high‑level constructs for circuit design. The experimental evaluation shows that some high‑level constructs of Clash have negligible influence on the resulting circuit size, suggesting that using the full power of functional programming is a viable approach to hardware design. To evaluate the impact of the used HDL itself, we also implemented versions of the MAC in Verilog. The experiments clearly show that there seems to be an inherent overhead in using Clash compared to Verilog code written by a seasoned engineer.
Authors:Paweł Batorski, Abtin Pourhadi, Paul Swoboda
Abstract:
We propose RBF‑GNN, a new pseudo‑coordinate based graph neural network architecture that takes into account Euclidean, spherical or angular coordinates and uses them to induce a powerful spatial inductive bias. Similar in architecture to SplineCNN, we improve upon the latter by replacing the less efficient sparse‑activation based B‑splines whose number grows exponentially with dimension by rational Padé basis functions. For effective training we propose a spline‑subspace initialization and a variance‑preserving weight rescaling. Experimentally, we evaluate on a number of popular neural network architectures that use SplineCNNs. We replace only the SplineCNNs with RBF‑GNN. We achieve improved results, including on semantic keypoint matching, shape matching, event based camera computer vision tasks. Code is available at https://github.com/pawelswoboda/RationalBasisCNN.
Authors:Fangyuan Tu, Xiangyue Zhang, Yiyi Cai, Yichen Peng, Kunhang Li, Bo Zheng, Zhixiang Wang, Kaipeng Zhang, Erwin Wu, Haoran Xie, Haiyang Liu
Abstract:
We present World2Motion, a framework that generates scene‑aware 3D human motion and corresponding video from a single image and a text prompt. While existing 3D motion generators learn from motion datasets, their generalization is constrained by limited coverage of environments. In contrast, video world models such as Cosmos 3 offer broader environmental priors but are not designed for full‑body motion generation; recovering motion from their generated videos requires costly two‑stage inference. To address these, we turn Cosmos 3 into a single‑stage 3D motion generator. This adaptation has two challenges: the scarcity of paired video‑‑motion data and temporal instability in the generated motion. First, we construct a training dataset combining synthetic video‑‑motion pairs with real videos paired with estimated 3D motion. Second, we propose a shift‑decoupled noise schedule that assigns different noise levels to video and motion through shared denoising progress. This design accommodates the different denoising requirements of the two modalities, reducing motion jitter. Experiments on a multi‑source interaction benchmark show that World2Motion has better motion‑‑text alignment and scene interaction compared with the evaluated 3D motion generators. It also matches the interaction success rate of the two‑stage baseline while achieving approximately 3.3× faster inference. Our project page is available at https://fyantu.github.io/World2Motion/.
Authors:Danfeng Hong, Chenyu Li, Jocelyn Chanussot
Abstract:
Vessel perception from space is crucial for a wide range of maritime applications, from traffic monitoring to environmental protection. However, most existing datasets predominantly focus on general object detection tasks in optical remote sensing (RS) images. Relying solely on single‑modality optical RS images proves inadequate for effectively perceiving vessel objects in complex maritime scenarios, where ever‑changing weather conditions (e.g., clouds and rain), the need for day‑and‑night coverage, and the inherent limitations of a single imaging modality pose significant challenges. To fill this gap, we introduce VesselBench‑800K, the largest‑to‑date benchmark dataset on a global scale for vessel perception in multimodal RS images. As its name suggests, VesselBench‑800K comprises 800,000 images, each at a resolution of 512x512 pixels, specifically curated for vessel perception tasks such as detection, counting, and density estimation. These multimodal image pairs (i.e., optical, SAR) are collected from diverse platforms, sensors, scenes, shooting heights, and synthetic sources, spanning spatial resolutions from 4.5m to 0.1m. Furthermore, we evaluate numerous state‑of‑the‑art detection, counting, and density estimation models on VesselBench‑800K through both qualitative and quantitative comparisons. By revealing previously unrecognized cues, this dataset holds immense potential to significantly advance our understanding of marine traffic. Our VesselBench dataset will be publicly available at https://github.com/danfenghong/IEEE_TGRS_VesselBench to support and contribute to community development.
Authors:Xingtong Ge, Yutong Wang, Lunjie Zhu, Haitao Lin, Fangyu Lin, Yushi Huang, Xin Zhang, Yi Zhang, Yu Liu, Jun Zhang
Abstract:
Few‑step streaming audio‑‑video generation requires both causal modeling and step distillation, yet standard training recipes face two context‑related challenges. Teacher forcing pairs clean history with a noisy target, but supervises predictive contextual representations only indirectly through velocity prediction. Meanwhile, directly reusing bidirectional score models in causal Distribution Matching Distillation (DMD) creates a mismatch between generation and scoring contexts. We address these challenges with Salt++, a two‑stage post‑training framework comprising Causal Self‑Flow (CSF) and context‑aligned autoregressive DMD. CSF exploits contextual information asymmetry by varying the history while keeping the noisy target fixed: a noise‑mixed‑history student aligns its intermediate representations with those of a clean‑history exponential‑moving‑average teacher. This self‑supervised signal encourages the student to extract semantic information and improves cross‑modal alignment. Context‑aligned AR DMD shares the causal mask and prefix across generator sampling, fake‑score training, and real‑score evaluation to match generated and reference distributions under a block‑conditional KL objective. With calibrated teacher guidance, it performs clean‑prefix few‑step distillation and then adapts to generated histories without switching objectives or requiring separate consistency distillation. At 480p, Salt++ improves visual and motion quality by 57% and 45% over OmniForcing on JavisBench under the same 4‑step causal setting. A separate scale‑wise post‑training stage extends Salt++ to 4‑step 1664×960 generation, outperforming bidirectional LTX‑2 on six of seven reported metrics. Project page: https://xingtongge.github.io/Saltpp
Authors:Yuzhe Zhang, Weijie Zhu, Haolin Yang, Ziyun Zhang, Xianwei Xue, Mengke Chen, Qiutong Pan, Huaqian Cai
Abstract:
Graph databases are increasingly queried through natural language, yet every existing benchmark evaluates isolated single‑turn queries rather than the multi‑turn sessions through which analysts actually work. We introduce CypherTurn, the first benchmark for conversational Text‑to‑Cypher evaluation, comprising 721 sessions and 5,927 turns across 7 knowledge graphs and 13 conversational phenomena. We evaluate 15 models under a guided oracle protocol and a fully autonomous agentic protocol, yielding four findings. First, the best model reaches only 64.7% execution accuracy, and session‑level correctness remains below 5%. Second, despite strong overall rank correlation, frontier models exhibit a consequential reordering of the top of the leaderboard under autonomous operation, a phenomenon we term the Autonomy Divergence, which reveals error‑management as a partially independent capability from raw generation skill. Third, scaling action budgets from x3 to x10 fails to close the autonomy gap, as the strongest frontier models self‑limit to approximately two actions per turn regardless of available budget. Fourth, single‑turn Cypher fine‑tuning degrades multi‑turn instruction following, while architecture‑appropriate specialization outperforms several frontier models. These results establish CypherTurn as an open challenge for conversational graph database reasoning. Code and data are available at https://github.com/BarryQ/CypherTurn.
Authors:Zhiwei Yang, Jiahua Yang, Huiru Lin, Xing Chen, Quanlong Guan
Abstract:
Knowledge concept tagging aims to assign specific concept or topic labels to educational content, which is essential for both educators and learners in traditional and online teaching practices. Recent work has explored large language models (LLMs) for this task, achieving promising performance. However, LLMs still struggle to select the correct concept from a large‑scale candidate set due to the high dimensionality of the decision space. In this paper, we propose a novel three‑stage Select‑Reason‑Judge (SRJudge) framework, which empowers LLMs with selective reasoning capability for fine‑grained knowledge concept tagging. Specifically, the Selector in Stage 1 first narrows the candidate concepts to a top‑K shortlist by fine‑tuning a small language model (SLM), e.g., BERT, since the top‑K predictions hit the correct concept in most cases, thereby reducing the decision space of correct candidates. Next, the Stage 2 Reasoner employs a lightweight LLM for refined reasoning over the shortlisted candidates. It further integrates an improved reinforcement learning strategy with a dynamic task‑specific reward function and a pruning mechanism to better align with human reasoning preferences. Finally, a larger LLM acts as a judger that evaluates the overall rationality of the reasoning process and its explanations to determine the final output. In addition, we construct two high‑quality datasets for further validation, i.e., the biology dataset S_Bio and the physics dataset S_Phy. Experimental results demonstrate that our method consistently outperforms state‑of‑the‑art baselines across benchmark datasets, verifying its effectiveness and superiority. Resources are available at: https://github.com/Nicozwy/SRJudge.
Authors:Jiajun Le, Yifan Lu, Zizhuo Li, Lei Cao, Junjun Jiang, Jiayi Ma
Abstract:
Despite recent advances in accuracy and efficiency, coarse matching remains an indispensable yet costly stage in existing semi‑dense matchers due to dense token‑level matching. We present UltraMatch, an ultra‑efficient and scalable semi‑dense matching framework that bypasses the quadratic computation and memory cost of dense token‑level matching by routing only a small fraction of candidate matching paths. At its core, a lightweight Transport Path Router operates on coarse block representations to rank candidate target blocks for each source block and retain only a small set, restricting subsequent token‑level matching to the selected paths and avoiding the construction of the full token‑to‑token matching matrix. We further design a sparse global Dual‑Softmax that performs matching only over the routed block candidates while retaining global competition across the sparse matching space. Beyond matching acceleration, UltraMatch employs deployment‑oriented structural reparameterization for feature extraction and a tiny fine matching head with shared parameters, further reducing inference cost and memory consumption. UltraMatch achieves competitive accuracy among semi‑dense matchers, while running 1.67× faster than SuperPoint+LightGlue with only 0.44 GiB peak inference memory. Its scalability enables inference at up to 6K resolution on a single RTX 3090, whereas existing semi‑dense matchers run out of memory before reaching 2K. Our routing strategy is also transferable, delivering about 2× end‑to‑end speedup in EDM and ELoFTR without accuracy loss. The project repository is available at https://github.com/JiajunLe/UltraMatch.
Authors:Tao Hwang, Yishi Diao
Abstract:
Large language models (LLMs) have become the foundation of personalized assistants, but maintaining persistent user memory across long‑term interactions remains challenging. Existing memory systems often focus on storage, retrieval, or consolidation, while memory writing remains less controlled: transient requests, duplicate statements, and outdated user states may enter memory and later be retrieved for personalization. In this paper, we present AMU: Admission and Memory Update for Personalized Conversations, an SLM‑guided (Small language model guided) structured framework for writing‑time memory control. AMU uses structured memory filtering to decide what should enter memory and SLM‑guided storage management to determine whether an admitted record should be stored separately, discarded as a duplicate, or fused as an update. We evaluate AMU in a controlled memory writing and retrieval setting. Experimental results show that AMU maintains cleaner and more retrievable personalized memories.
Authors:Kirill Borodin, Vasilii Kudryavtsev, Maxim Maslov, Grach Mkrtchian
Abstract:
Text‑to‑speech models loop, truncate and lose count on text that repeats a phrase many times. We show that repetition itself is what breaks them, not the length that comes with it. Every repeated sentence in our test set is paired with a control of matched sentence and word count in which no word ever repeats back‑to‑back. Six models from three architectures render the controls almost perfectly and fail the repeated twins: 94.3% against 18.2% exactly right at k >= 6. The gap survives greedy decoding, repetition‑penalty sweeps, four independent speech recognisers and 420 analysis specifications without once reversing sign; a held‑out fourth architecture lands within a point of its predicted gap, and one of two non‑autoregressive baselines shows the same failure. Varying the period of the text shows the failure grows smoothly with periodicity, half of it surviving when no word is adjacent to itself.
Authors:Gyeonggwan Lee, Seunghwan Hong, Junghun Suh
Abstract:
3D Gaussian Splatting (3DGS) is a state‑of‑the‑art technique for 3D scene rendering, offering high efficiency and excellent visual quality. However, because 3DGS relies on an initial sparse point set from Structure‑from‑Motion (SfM) and view‑dependent properties, it can suffer from geometric inaccuracies and visual artifacts, particularly in complex scenes. To address these challenges, we propose an improved 3DGS approach that regularizes the optimization process by integrating geometric priors, including surface normals and dense depth information. Surface normal regularization improves geometric consistency by aligning Gaussian covariance with local surface structures, while dense depth priors combined with an initial points from SfM enhance per‑pixel depth estimation, increasing accuracy and reducing ambiguities. These enhancements enable robust handling of diverse and complex real‑world scenarios, minimizing visual distortions and improving reconstruction quality across various environments. To validate our method, we evaluate it on challenging datasets, including street‑view scenes and highly reflective environments, while testing it across multiple SfM pipelines. Our results demonstrate compatibility across diverse environments and highlight the robustness of our approach. Experimental findings further show that our method enhances geometric accuracy and visual quality, establishing a reliable solution for real‑time 3D scene rendering in complex environments.
Authors:Zexiao Wang, Zihao Zhang, Xudong Wang, Pan Wang, Ziyi Ye, Haoyu Zhao, Zuxuan Wu, Shuicheng Yan
Abstract:
System One models such as Jev offer an efficient alternative to generative language models for tasks that require decisions rather than open‑ended responses. However, existing Jev models exhibit limited Chinese‑language decision accuracy, restricting their utility in both general and specialized settings. In this paper, we introduce Chinese‑Jev, a System One model that addresses this gap through a unified data processing and training pipeline. Our data processing protocol converts heterogeneous Chinese‑language annotations into probability targets over candidate options, enabling a shared training formulation across domains and question formats. To enable efficient inference, Chinese‑Jev adopts a lightweight encoder‑only backbone for text encoding and learns to score candidate answers through decision‑oriented training. To address the misalignment between the pre‑training distribution and downstream Chinese‑language scenarios, we first train the model on a general‑purpose corpus of 10 million examples, then fine‑tune it separately for the medical, legal, and financial domains. To evaluate decision accuracy and calibration in both general and domain‑specific Chinese‑language settings, we introduce Chinese‑Jev Bench (CJ‑Bench). After first‑stage pre‑training, Chinese‑Jev exceeds the accuracy of the closed‑source Jev model by 1.24% on general‑domain tasks while achieving a 20.3x speedup. Subsequent domain‑specific fine‑tuning yields a 4.0% accuracy improvement over Jev in medicine and achieves 92% of Jev's average accuracy across specialized domains, with a 17x speedup and an average latency of only 15 ms per example. We further demonstrate on‑device deployment of an INT8‑quantized model on mobile devices, achieving an inference latency of approximately 1.0 second per decision. The project is available at https://gulucaptain.github.io/Chinese‑Jev/.
Authors:Jingguang Li, Yebo Wu, Zuyi Guo, Kailang Ma, Xianjie Dai, Han Zheng, Benwang Chen, Li Li, Can Rong, Heye Huang
Abstract:
Long‑context reasoning is essential for complex and long‑horizon tasks, yet the performance of large language models (LLMs) degrades as context length increases. Recent approaches address this by processing input chunk by chunk while maintaining a bounded textual memory in model context. However, premature information compression can discard critical details essential for subsequent reasoning. In this paper, we introduce Commit‑on‑Evidence Memory (CoEM), which learns when to convert source evidence into compact memory facts. Specifically, under a fixed context‑memory budget, CoEM preserves potentially useful source excerpts verbatim in a pending set, allowing subsequent context to clarify their relevance before irreversible compression. As new context arrives, a learned policy revisits each pending excerpt and decides whether to promote it to the committed memory, retain it for further consideration, or discard it. A frozen verifier ensures proposed facts are accepted only if supported by retained excerpts and current context. To further guide effective memory management, we train this policy using reinforcement learning by combining fine‑grained, step‑level evidence rewards with final answer rewards. Extensive experiments demonstrate that CoEM consistently improves long‑context reasoning. When evaluated on 6,400 documents long‑context input, CoEM outperforms the strongest memory baseline by 10.4‑11.4 F1 points on Qwen3.5‑9B. Code repository: https://github.com/benmagnifico/CoEM.
Authors:Pan Zhang, Siqi Lai, Kemu Dong, Hao Liu
Abstract:
Traffic signal control (TSC) is essential for improving urban mobility and reducing congestion. Although roadside cameras are widely deployed at signalized intersections and provide rich visual observations of evolving traffic, existing TSC methods typically rely on manually engineered traffic states or separate perception modules, creating a gap between physical observations and control decisions. We present VLALight, the first vision‑language‑action (VLA) model for end‑to‑end traffic signal control from multi‑view roadside videos. VLALight directly maps visual observations to coordinated signal actions through multi‑target spatiotemporal traffic reasoning and topology‑aware cooperative perception across intersections. To establish this capability, we develop a two‑stage supervised cold‑start training strategy for visual traffic understanding and signal decision‑making, followed by cooperative agentic reinforcement learning that jointly optimizes local control and network‑wide traffic efficiency. Furthermore, VLALight introduces adaptive fast and slow reasoning modes, enabling the policy to allocate deeper reasoning only when additional deliberation provides sufficient control benefits. Through balanced mode‑aware rollouts and relative advantage optimization, VLALight learns to trade off decision quality and inference cost. Extensive experiments on seven real‑world traffic‑flow datasets across three urban networks demonstrate that VLALight consistently outperforms transportation‑based, RL‑based, and LLM/VLM‑based baselines. Ablation studies validate the effectiveness of cooperative perception, network‑level optimization, and adaptive reasoning. These results demonstrate the potential of VLA models for real‑world physical traffic control. Our project is available at https://github.com/usail‑hkust/VLALight.git.
Authors:Jiahua Yang, Zhiwei Yang, Xianpeng Zhang, Dongyu Chen, Xing Chen, Tianhuang Su, Haonan Lu, Quanlong Guan, Kai Tang, Chuangchuang Wang
Abstract:
Recently, Group Relative Policy Optimization (GRPO) and its variants have been developed for policy optimization and demonstrated notable performance gains. However, these methods usually incur substantial computational overhead due to per‑question multi‑rollout sampling and repeated per‑token probability evaluation across rollouts. Furthermore, low‑information or highly homogeneous trajectories can degrade downstream learning signal efficiency, hindering model optimization and limiting final performance. To address these issues, we propose FastRL, a novel plug‑and‑play reinforcement learning framework that simultaneously improves training efficiency and the effectiveness of policy learning. Specifically, 1) We introduce an advantage‑aware pruning strategy to selectively preserve high‑advantage trajectories while maximizing inter‑trajectory gradient diversity. 2) Then, we design an adaptive rollout sampling mechanism to dynamically adjust the sampling scale across different training stages based on historical pruning distributions, balancing exploration adequacy and computational efficiency. Experiments demonstrate that FastRL can be seamlessly integrated into GRPO, DAPO, and GSPO variants, achieving an average 2.07× training speedup on Geometry3K and GeoQA8K‑R1V, along with an approximately 1.64% improvement in average accuracy on visual reasoning benchmarks. Source codes will be available at https://github.com/Nicozwy/FastRL.
Authors:Weixuan Li, Zikun Zhou, Xinyi Zhuang, Xinyan Guo, Rui Tian, Chuyao Zhang, Lin Gao
Abstract:
Multimodal large language models (MLLMs) incur high inference latency from long visual token sequences. Existing pruning methods commonly use attention maps or output features to estimate token importance or redundancy. Several recent approaches also exploit representation changes, but when and how these changes reflect foreground saliency and semantic consistency remain insufficiently understood. We analyze visual token representation dynamics across encoder depth and uncover two findings. First, the relationship between token update magnitudes and foreground saliency is layer‑dependent: large token updates concentrate on foreground regions in two depth intervals, separated by several sink‑dominated layers at intermediate depths. Second, similarities between token update directions better distinguish same‑class from different‑class tokens than those between encoder output features. Building on these findings, we propose MSDG‑Prune, a training‑free method that uses update magnitudes and directions to preserve salient and diverse visual information. Specifically, we group tokens by update‑direction similarity and use query‑weighted saliency derived from update magnitudes across a chosen depth window for group‑wise token pruning. Extensive experiments across four MLLMs demonstrate the effectiveness and generalizability of MSDG‑Prune. On LLaVA‑NeXT, it retains 91.9% of uncompressed performance on average with only 5.6% of visual tokens, while achieving a 7.8x prefilling speedup. Code is available at https://github.com/liweixuan‑hitsz/MSDG‑Prune.
Authors:Rui Huang, Yanlin Mu, Lidong Li, Yucong Wang, Zichen Yan, Lin Zhao
Abstract:
Aerial manipulators extend robotic manipulation into 3D workspaces that are difficult for ground‑based robots to access, creating new opportunities for general‑purpose manipulation. However, extending Vision‑Language‑Action (VLA) models to aerial robots introduces distinct challenges due to the tight coupling between manipulation and flight, continuously changing observations, and safety‑critical physical interactions. These challenges demand diverse training data and systematic policy evaluation, yet collecting demonstrations and evaluating policies directly on physical aerial platforms are costly, difficult to scale, and hard to repeat under controlled conditions. We present AeroManip‑VLA, a scalable benchmark for aerial VLA data generation and policy evaluation. AeroManip‑VLA provides a GPU‑accelerated simulation framework with low‑level payload‑aware flight and manipulation control in massively parallel environments. Building on this framework, we combine reusable reinforcement learning policies with expert task rules to automatically generate demonstrations without human teleoperation across diverse objects, environments, and randomized initial conditions. The generated data include basic skills such as grasping and placing, as well as long‑horizon tasks that require both navigation and manipulation. We further introduce automated event labeling and trajectory categorization to filter demonstrations. These mechanisms enable fine‑grained analysis of task progress, behavioral outcomes, and safety‑related failures. Finally, we evaluate a range of imitation learning and VLA baselines across different task settings, revealing their performance characteristics and failure modes. Together, AeroManip‑VLA enables scalable aerial manipulation data generation, structured trajectory analysis, and systematic VLA evaluation in simulation prior to real‑world deployment.
Authors:Ke Wang, Houxing Ren, Zimu Lu, Yunqiao Yang, Zhuofan Zong, Mingjie Zhan, Hongsheng Li
Abstract:
End‑to‑end full‑duplex speech models have brought open‑source machine conversation closer to human‑like interaction, yet existing systems remain limited in two intertwined dimensions: long‑context robustness and multi‑party interaction. Real‑world scenarios such as meetings, group lessons, and social‑robot reception require a single model to track, contextualize, and respond to multiple speakers over extended durations. Progress is constrained by both data and evaluation: open multi‑party speech corpora remain small and are not designed for codec‑frame‑level full‑duplex modeling, while existing long‑audio benchmarks focus on passive listening and speech‑to‑speech benchmarks are mostly short and dyadic. We extend the Moshi paradigm jointly along the long‑horizon and multi‑party axes in English and Chinese. First, we release 57.6k hours of synthetic training data (\hrefhttps://huggingface.co/datasets/MultiTalk/MultiTalkPTMultiTalkPT and \hrefhttps://huggingface.co/datasets/MultiTalk/MultiTalkFTMultiTalkFT) for long‑form, multi‑party, English‑Chinese full‑duplex dialogue, with controllable length, participant count, turn‑taking, overlap, backchannels, interruptions, addressee shifts, and long‑range coreference. Second, we introduce \hrefhttps://huggingface.co/datasets/MultiTalk/MultiTalkBenchMultiTalkBench, built from real human recordings, for evaluating long‑form, multi‑party, bilingual full‑duplex dialogue. Conversations average 32.6 minutes and include probes for long‑range entity tracking, topic coherence, and addressee selection. Third, we train a bilingual Moshi‑style model that sustains coherent multi‑party English‑Chinese conversations over extended durations and substantially outperforms open‑source baselines including Moshi, MiniCPM‑o‑4.5, and Qwen3‑Omni‑30B‑A3B‑Instruct on MultiTalkBench.
Authors:Abhijit Sen, Bikram Keshari Parida, Shital Chauhan, Mahima Arya, Denys I. Bondar
Abstract:
Modeling the response of driven many‑body quantum systems from input‑‑output data is difficult: the dynamics are nonlinear, history dependent, and expensive to simulate as system size grows. A paradigmatic case is High‑Harmonic Generation~(HHG), where a strong field drives a medium to emit radiation that is highly sensitive to the drive and encodes long‑range temporal correlations. We introduce a dissipative quantum reservoir computing~(DQRC) framework that builds a digital twin of such a system, learning its input‑‑output map directly from data while the reservoir‑‑‑itself a small open quantum system‑‑‑stays fixed and only a classical readout is trained. We show that a minimal single‑qubit reservoir reproduces the HHG response of a substantially larger Ising spin chain, and on a representative benchmark matches and on several metrics surpasses previously reported temporal convolutional and Kolmogorov‑‑Arnold‑network models, while using a simpler, physically realizable system. A single fixed reservoir further generalizes across a broad range of drives, indicating that it learns a shared physical response structure rather than memorizing trajectories. These results establish dissipative quantum reservoirs as compact, physically grounded digital twins for nonlinear, memory‑dependent quantum dynamics. Code is available at \hrefhttps://github.com/AI‑and‑Quantum‑Computing/DQuRChttps://github.com/AI‑and‑Quantum‑Computing/DQuRC.
Authors:Yingquan Wang, Pingping Zhang, Dong Wang, Huchuan Lu
Abstract:
As a fundamental image processing task, object Re‑Identification (ReID) aims to retrieve objects across non‑overlapping cameras. Recently, with the development of deep learning, significant advancements have been made in object ReID. However, most existing methods suffer from generalization due to the limited size and diversity of ReID datasets. Meanwhile, current models tend to focus on extracting semantic patterns rather than learning identity‑aware feature distributions. To address these issues, we propose a novel feature learning framework named DiffReID for object ReID. It leverages a discriminative diffusion model to gradually learn identity‑aware distributions and generate identity‑invariant features. More specifically, with the Contrastive Language‑Image Pre‑training (CLIP) model, we first obtain identity‑aware text features by prompt tuning. Then, we propose a Vision‑guided Noise Generator (VNG) to initialize probabilistic noises and gradually corrupt identity‑aware text features. Afterwards, we take visual features as conditions and propose a Light Weight Denoiser (LWD) to denoise the corrupted text features step‑by‑step for identity‑aware distribution learning. To obtain discriminative features, we further generate identity‑invariant guided features from randomly sampling visual‑guided noises. Finally, we propose a Mutual Enhancement Constraint (MEC) to facilitate mutual learning between visual features and guided features to enhance the representation robustness and discrimination. Extensive experiments on five object ReID benchmarks demonstrate that our method shows better results than most state‑of‑the‑art methods. The source code is available at https://github.com/AWangYQ/DiffReID.
Authors:Kaichen Ouyang, Chenglei Yu, Chuanrui Wang, Tailin Wu
Abstract:
In scientific machine learning, physical fields governed by partial differential equations exhibit low‑rank structure and scale invariance. When solving equations on coarse grids, missing information leads to the closure problem: modeling unresolved physics to recover lost dynamics. Although closure terms depend on grid resolution, they represent scale‑invariant physical laws. A model truly learning physics should capture these mechanisms with low‑rank parameterization rather than memorizing grid‑specific patterns. Inspired by this, we propose the Scale‑Invariant Neural Operator (SINO), which learns on normalized physical scales via a dual‑branch architecture operating in spectral and spatial domains. SINO uses bottleneck MLPs to generate continuous convolution kernels, embedding an explicit low‑rank inductive bias that concentrates more than 95 percent of variance in 2‑3 modes, as validated by PCA across benchmarks, while drastically reducing parameters. This principled design yields 38 times steeper scaling law exponents than FNO, demonstrating superior parameter efficiency. We compare SINO with traditional models (U‑Net, DeepONet), Transformer models (Transolver, Oformer, GK‑Transformer), and frequency‑domain models (FNO, AMFNO, UFNO) on closure problems spanning externally forced Burgers turbulence, decaying Burgers turbulence, KS turbulence, Kolmogorov‑forced NS turbulence, and decaying NS turbulence. Experiments show SINO achieves 1.5‑38 times error reduction and 2‑23 times parameter efficiency over baselines, with superior scaling laws reflecting exceptional data efficiency from principled low‑rank design. Code is available at https://github.com/AI4Science‑WestlakeU/SINO.
Authors:Tianqi Zhao, Tianyi Zhuang, Shuo Duan, Guanyang Wang, Yan Shuo Tan, Qiong Zhang
Abstract:
Tabular foundation models (TFMs) are increasingly popular because they deliver strong predictions on new datasets through in‑context learning, without task‑specific training or extensive tuning. Yet released TFMs differ simultaneously in their pretraining priors, architectures, and objectives, obscuring their respective inductive biases. We therefore examine one concrete capability: irrelevant‑feature suppression. Across synthetic tasks and real‑world datasets, adding null features causes substantially greater predictive degradation in the row‑token model TabDPT, whereas the cell‑token alternating‑axis model TabPFN v2 and other TFMs remain comparatively stable. This gap motivates us to ask whether architecture contributes to irrelevant‑feature suppression. Because released TFMs remain confounded by other design choices, we train streamlined row‑token and alternating‑axis transformers under identical sparse‑to‑dense linear priors. Exact Bayes analysis shows that sparse prediction requires context‑dependent feature gating, whereas the dense endpoint requires only uniform feature weighting. Consistent with this distinction, the alternating‑axis model is substantially closer to the Bayesian optimal predictor on sparse tasks, while the architecture gap becomes negligible on dense tasks; almost all of the sparse gap arises from linear coefficient‑estimation error. Finally, in both the controlled model and frozen TabPFN v2, we examine the effect of interventions on the feature‑attention outputs on the linear coefficients, finding evidence of task‑dependent selective routing of computation through feature‑indexed pathways. Together, these results support architecture‑prior alignment: preserving an addressable feature axis provides an inductive bias for task‑adaptive relevance inference. Code is available at https://github.com/Tianqi‑Zhao/ArchitecturePriorTFMs.
Authors:Zheng Zhu, Zexi Tan, Yuming Deng, Yiqun Zhang
Abstract:
Multivariate Time Series (MTS) clustering is an important tool in temporal data mining, aiming to discover latent group structures from complex observations without supervision. Although existing deep clustering methods can learn discriminative temporal representations, the resulting latent clusters are often difficult to relate back to waveform characteristics that practitioners can directly inspect and compare, limiting their ability to assess whether the discovered patterns reflect meaningful temporal behaviors. This paper, therefore, proposes WAVE (Waveform Aligned Visual‑temporal Embedding), which treats time series and their deterministically rendered waveform plots as complementary views of the same observations. To produce discriminative representations whose cluster structures can be traced to observable waveform characteristics, WAVE aligns and integrates fine‑grained temporal variations with holistic visual patterns, while associating each discovered cluster with its centroid‑nearest authentic sample. Accordingly, interpretability in this work specifically refers to waveform‑level traceability rather than a general explanation of model decisions. Extensive evaluations across 10 real‑world public datasets show that WAVE achieves the highest macro‑averaged clustering performance and the best average rank among the compared methods, while qualitative case studies illustrate how the discovered clusters can be inspected through authentic waveform records. The source code is available at https://github.com/Zheng‑Zhu1/WAVE.
Authors:Aulia Kharis Rakhmasari, Fan Yu, Alexander Hoyle, Elliot Ash
Abstract:
Large Language Models (LLMs) struggle with region‑specific factual knowledge, particularly in financial regulation. While benchmarks such as CFinBench, provide broad coverage of financial knowledge in other regions, no comparable resource exists for European financial regulation. We close this gap by proposing an end‑to‑end pipeline for evaluating and improving LLMs on European financial regulatory question answering. Our dataset is grounded in the official Q&A corpora of the European Banking Authority (EBA) and the European Securities and Markets Authority (ESMA). We evaluate candidate answers with a pointwise LLM‑as‑a‑Judge protocol using three judges from distinct model families, retain only unanimously judged pairs, and sharpen the rejected side through a taxonomy of regulatory failure modes : law swaps, article swaps, hallucinated citations, and hallucinated text. By fine‑tuning on the resulting preference pairs exposes a divergence at the core of our findings: supervised fine‑tuning attains the highest judge score of any method yet got the lowest rule‑based Citation F1. SFT is producing longer answers with three times as many citations, most of them unsupported. DPO and GRPO offer the better trade‑off with more concise answers and the highest citation F1 among fine‑tuned models. Standard LLM‑as‑a‑Judge evaluation rewards citation density as evidence of grounding and cannot detect when those citations are fabricated. Thus, we detect a blind spot that matters wherever answers must be verifiable. We release the benchmark and evaluation stack at https://github.com/auliakharis/FinRegQA‑EU.
Authors:Hongbin Lin, Chaoda Zheng, Yiming Yang, Xiangyu Li, Shijia Chen, Jinhao Deng, Kangjie Chen, Dongbin Zhang, Jie Feng, Yu Zhang, Xianming Liu, Shuguang Cui, Boyang Wang, Zhen Li
Abstract:
End‑to‑end autonomous driving policies are commonly trained via imitation learning on logged demonstrations without observing the consequences of their own actions, leading to causal confusion in closed‑loop real‑world deployment. To address this issue, reinforcement learning (RL) post‑training offers a promising alternative by leveraging world models as interactive training environments to enable future scene generation for policy improvement. Nevertheless, existing approaches either rely on reconstruction‑based simulators, offering limited counterfactual interaction, or adopt synthetic simulators to enable long‑horizon closed‑loop interaction at the cost of a substantial sim‑to‑real gap. Recently, video world models have exhibited the ability to generate realistic multi‑step future rollouts but may not faithfully reflect action conditions, resulting in action‑vision mismatch. In this paper, we introduce RoXDrive, a plug‑and‑play closed‑loop RL framework that enables reliable policy optimization by identifying action‑faithful world‑model rollouts, consisting of two stages: 1) Model pre‑training: In addition to imitation‑based policy pre‑training, we devise an Action‑Vision Faithfulness Evaluator for inverse dynamics estimation with our geometry‑aware auxiliary trajectory supervision, enabling long‑horizon assessment of whether visual dynamics faithfully reflect the conditioning ego actions. 2) Action‑faithful RL post‑training: Agents iteratively interact with world models to form long‑horizon scene rollouts, retaining only action‑faithful ones for dense safety‑aware scoring and scene‑level closed‑loop RL post‑training. Extensive experiments on nuScenes and an in‑house dataset with over 130K training scenarios demonstrate consistent gains across planners, reducing safety violations by 27.6% with DiffusionDrive on nuScenes and 33.7% with Qwen3‑VL on the internal data.
Authors:Suhani Grover, Astik Srivastava, Viswas Dinesh, Avinash Sharma, K. Madhava Krishna
Abstract:
Transparent surfaces are ubiquitous in built environments, yet they remain a persistent failure case for robotic perception. RGB cameras perceive the background behind glass rather than the surface itself, while depth sensors such as LiDAR, time‑of‑flight, and RGB‑D often return invalid or background measurements in transparent regions. As a result, systems that rely solely on optical sensing may misinterpret glass walls, doors, or mirrors as free space, compromising safe and reliable navigation. Existing glass segmentation approaches address this by learning visual cues such as reflections, boundaries, and semantic context from RGB images. While effective under favourable lighting and viewing conditions, these cues degrade in low‑light environments, under glare, or when glass surfaces are featureless or partially occluded. In this work, we propose a multimodal framework that fuses millimetre‑wave radar with RGB‑D sensing for real‑time transparent surface segmentation. Radar reflects strongly off glass surfaces, providing a geometric cue that remains reliable precisely where vision and depth fail. We exploit this cross‑modal inconsistency to generate a radar‑guided spatial prior, which is integrated into a lightweight transformer‑based segmentation network, GlassFormer, via cross‑modal attention. We report results on a mixed‑condition test split covering all scene types and a dedicated low‑light split designed to stress vision‑only methods. GlassFormer achieves 0.88 mIoU on the mixed split, and 0.59 mIoU on the low light split, demonstrating substantial robustness gains over vision‑only baselines while maintaining real‑time performance on resource‑constrained platforms.
Authors:Fengyi Zhang, Holger Caesar, Xiangyu Sun, Zheng Zhang, Zi Huang, Yadan Luo
Abstract:
Which layers of a feed‑forward geometry model are needed to preserve both camera poses and dense 3D structure? We study layer redundancy in VGGT, π^3, and VGGT‑Ω: 3,018 pruned configurations, scored on seven camera‑pose and dense‑geometry metrics across four indoor and outdoor datasets. Four findings follow: (i) Removable layers cluster in two redundancy regions: a dominant early region and a narrower late one, while deletions spanning the intervening layers are consistently more disruptive. This recurring pattern holds across models, datasets, and metrics, and contrasts with the middle‑to‑late redundancy commonly reported in the literature. (ii) Within these regions, we observe that the joint degradation from deleting two intervals is approximately the sum of their individual degradations, reducing the number of model evaluations for pruning search from O(L^4) to O(L^2), where L is the aggregator depth. (iii) We find that CKA provides a cheaper representation‑based proxy for interval degradation, offering a practical trade‑off between pruning quality and calibration cost. (iv) Closed‑form linear calibration recovers accuracy after pruning without end‑to‑end retraining. A least‑squares analysis shows that using a shared map for special and patch tokens generally incurs excess reconstruction loss, motivating token‑aware recovery. Recovery maps fitted on just 100 calibration scenes generalize to held‑out scenes and unseen datasets. The resulting models reduce aggregator parameters by up to 44% while maintaining accuracy comparable to their intact counterparts. Code and experimental results will be available at our project page: https://xian‑bei.github.io/vggt‑family‑layer‑redundancy/
Authors:Shaohang Wei, Feifan Song, Guangyue Peng, Wenhao Yu, Wei Li, Wen Luo, Yang Xu, Yufan Shen, Luke Mao, Yang Du, Asher Qin, Houfeng Wang
Abstract:
Visual agents solve problems by interleaving reasoning with image operations, and on‑policy distillation (OPD) provides guidance from a strong teacher on student‑generated interaction trajectories. However, image operations change the evidence available for subsequent reasoning, so local errors in evidence acquisition (Acquire), reading (Read), or answer grounding (Ground) can propagate through the trajectory and lead to incorrect answers. Existing multimodal OPD methods primarily construct or contrast auxiliary views of the original image to strengthen supervision, without explicitly modeling the connections between student actions, resulting observations, and subsequent reasoning. This limits their ability to provide corrections tailored to different failure stages. We introduce Reflection on Visual Evidence (ReVuE), an on‑policy distillation method for visual agents. ReVuE compares multiple student‑generated trajectories for the same query, summarizes the observed visual evidence, and diagnoses the first failure across the Acquire, Read, and Ground stages. The resulting reflections provide training‑time context for the teacher. We group and reweight token‑level distillation losses according to how strongly these reflections affect the teacher's predictions. This design translates trajectory‑level evidence diagnosis into targeted token‑level supervision, guiding students to improve their visual evidence acquisition and reasoning. Across 11 benchmarks spanning the Qwen2.5‑VL and InternVL3.5 model families, ReVuE outperforms all evaluated OPD baselines in weighted‑average scores for perception, mathematical reasoning, and general tasks. ReVuE also reduces redundancy in reasoning and tool calls while improving tool‑call accuracy and task accuracy. Code is available at https://github.com/sylvain‑wei/ReVuE
Authors:Wenbin Hu, Huihao Jing, Haochen Shi, Yuxuan Liu, Haoran Li, Yangqiu Song
Abstract:
Group Relative Policy Optimization (GRPO) is widely used to train reasoning language models, where it computes advantages by centering and normalizing rewards across rollouts of the same prompt. For multiple rewards, GRPO sums the reward components and normalizes the total reward by its within‑group standard deviation. The corresponding variance equals the sum of all pairwise reward covariances. For a fixed centered reward, larger aggregate covariance produces smaller advantages, and vice versa, allowing update magnitudes to adapt to reward dependence. However, correlated rewards with large scales can dominate this normalization and suppress signals from smaller‑scale rewards. We propose Correlation‑Normalized GRPO (CorrGRPO), which normalizes pairwise covariances into Pearson correlation coefficients. CorrGRPO keeps the centered total reward unchanged while balancing the influence of differently scaled rewards on the correlation‑based normalization. This allows advantage magnitudes to adapt to reward correlations without the normalization being dominated by large‑scale reward components. We compare CorrGRPO with GRPO and other variants on code generation, tool calling, and agent security, using models ranging from 0.5B to 8B parameters. These tasks all involve multiple rewards that can improve together or present tradeoffs. Results show improvements across three domains, including code generation, tool calling, and agent security. Our code is available at https://github.com/HKUST‑KnowComp/CorrGRPO.
Authors:Zonghao Ying, Xiangfan Wu, Bo Yang, Huiyu Wu, Xing Zheng, Huangsheng Cheng, Xiaorong Shi, Jing Guo
Abstract:
Indirect prompt injection embeds malicious instructions within external content retrieved by LLM‑based agents, altering target behavior without user authorization. We introduce pikit, a research toolkit designed to systematically evaluate these threats across three core dimensions: attacks (13 methods), channels (16 carriers across text and file modes), and defenses (9 prevention strategies and 3 offline detection baselines). Built on a decorator‑based registry, pikit enables seamless extension of custom components without modifying core code, while a unified craft() API composes arbitrary attacks and channels in a single call. We evaluated the toolkit on the pi coding agent powered by an anonymized LLM in a production‑like environment. Benchmarking 9 prevention strategies against high‑risk attacks yields a 71.8% relative reduction in attack success rate, with few\_shot\_warning and instruction\_hierarchy providing the strongest protection. Offline detection baselines achieve perfect precision but low recall, demonstrating that heuristic detectors complement rather than replace prompt‑level defenses. To ensure reproducibility, each run automatically logs full prompts, agent event traces, session transcripts, and verdict records. Our code is available at https://github.com/Tencent/AI‑Infra‑Guard/tree/main/Research/pikit.
Authors:Chuanpu Liu, Miao Yu, Yikai Cai, Yuanhe Zhang, Zhenhong Zhou, Li Sun, Zuming Jiang, Yufei Guo
Abstract:
Large language models (LLMs) exhibit strong general capabilities that mechanistic interpretability has attributed to sparse computational circuits. However, existing circuit studies emphasize preserving functionality or explaining safety, leaving the mechanisms underlying failures across a broader range of tasks largely unexplored. Extending circuit analysis from abilities to errors, we explore the perspective that such failures may likewise arise from erroneous internal computations and that targeted tuning of the corresponding parameters can correct such errors while largely preserving other capabilities. Motivated by this insight, we introduce RESCUE (Reasoning‑Error Sparse‑Circuit Uncovering and Editing), a framework that localizes error‑associated circuits and surgically repairs them for performance enhancement. General tasks typically involve multi‑step reasoning and long‑form generation, where early deviations can cause prefixes to drift from supervised references, leading SFT‑based mask optimization to overlook circuits involved in generation‑time errors. RESCUE therefore refines these masks through reinforcement learning with multiple masked‑model rollouts, improving their relevance to observed task failures. Finally, RESCUE introduces a pruning technique and precisely fine‑tunes error circuits to correct task failures, thereby translating error localization into a sparse and targeted model update. We validate RESCUE on heterogeneous repair sets across two domains: (1) mathematical reasoning, identifying a math error circuit of 1.40% density whose repair raises accuracy from 6.0% to 75.5%; and (2) medical QA, where a similarly compact 1.44% circuit improves repair‑set accuracy from 0% to 81%. Our code is available at: https://github.com/chuanpupig/RESCUE.
Authors:Long Li, Qichao Zhao, Yue Yang, Fan Xu, Zhe Wang, Alan Wee-Chung Liew, Chao Qu, Heng Tao Shen, Shirui Pan
Abstract:
Current embodied models do not respond to their own failures, although what just went wrong could inform a small adjustment on the next attempt, the kind of reflection behind the gains of thinking in language models. We test whether they can repair a known error, which requires producing a correction and judging whether it is right. Stopped at a failure and allowed to retry, they seldom repair it through their own randomness or from a language description of the error, and best‑of‑N selection cannot pick the successful candidate after a failure. We attribute this to training only on successful demonstrations and to inputs too narrow to show what went wrong, and conclude that reflection must come from a vision‑language model (VLM), which takes in far more information, such as the episode history and text, and is more general. Prior VLM‑led work has the VLM plan every step and invoke the embodied model as a tool, placing the VLM on the critical path. We propose Spotter, which reverses the roles: the embodied model leads and executes continuously, while the VLM runs in parallel, monitors through a lightweight local screener, intervenes only when an error is detected, reflects on and corrects it, and returns control. We run Spotter with Qwen and with GPT as the VLM, and both improve the embodied models; with GPT, Spotter improves Cosmos Policy and π_0.5 by 5.6 and 7.5 percentage points on RoboCasa, and raises π_0.5 from 47.2% to 57.0% on the Hard setting of RoboTwin 2.0 and from 53% to 83% on a real robot. Because the VLM steps in only when an error is confirmed, a successful episode with Qwen takes only 13 to 16 s longer than with the embodied model alone and about 70% less time than with a VLM‑led baseline using the same model. Our code is available at https://github.com/zqc3117/Spotter.
Authors:Minkwan Kim, Junho Kim, Seungmin Lee, Changwoon Choi, Young Min Kim
Abstract:
Interactive simulations of embodied AI or spatial computing applications build on realistic 3D scenes that support daily activities. However, sparse, irregular layout structures impose scene‑specific physical constraints, making it hard to define a generalizable framework for generating similar functional context. We formalize Scene Retargeting as stably transferring the semantically coherent spatial organization across layouts, rather than relying on textual descriptions or pairwise relationships. Our cluster‑wise transfer flexibly handles mismatched object instances and adapts to distinctive floor plans. We optimize to preserve the rich semantic context of individual clusters by respecting the spatial distribution of foundation features. We can then impose physical constraints to refine wall contacts, pairwise alignment, or clear passageways and openings. Our framework outperforms state‑of‑the‑art methods on layout generation on the 3D‑FRONT dataset, and demonstrates downstream applications including real‑to‑sim transfer, analogical trajectory transfer, and multi‑reference composition.
Authors:Venkata Maguluri, Swapna Kommuri, Kritica Sinha, Ashish Sood
Abstract:
We describe KNDB, a PostgreSQL 18 table access method (TAM) that types every row with an engine‑assigned epistemic kind (MEASURED, INFERRED, or DERIVED) and resolves per‑slot conflicts inside every write‑time heapam callback. Rows land as ordinary heap tuples; seven of the 44 TAM callbacks are overridden (tuple_insert, multi_insert, tuple_update, tuple_delete, tuple_insert_speculative, tuple_complete_speculative, relation_toast_am), the other 37 delegate to heap; we provide a completeness argument over the interface as a paper artefact. This paper reports the engineering behind that decision and the adversarial evaluation that motivated it. On a confidence‑forgery workload where an attacker asserts INFERRED writes with confidence in [0.95,1.0] against honest MEASURED writes with confidence in [0.5,0.9], KNDB beats a confidence‑only baseline by 63 percentage points on the Book‑Author fusion dataset and 92.7 points on the Zheng crowdsourcing dataset. Both wins are proven load‑bearing on the kind axis by a source‑rebuild disable‑and‑test in which the lattice is neutralised and the win vanishes. Against four truth‑discovery baselines (TruthFinder, CRH, CATD, ACCU) reimplemented from the original equations and validated to within 0.3 percentage points of the published numbers, KNDB is competitive below a per‑dataset density‑saturation cell and dominant at or above it. We formalise the cell as k ~ rho_alg h_top, where h_top is per‑slot top honest surface‑form support, and validate the prediction within +/‑20% on Book‑Author and +/‑30% on Zheng. Because the kind axis is assigned by the engine from independent metadata and cannot be forged at write time, KNDB's k is unbounded. The paper is honest about where KNDB loses: CRH and ACCU outperform KNDB below saturation on Zheng, and KNDB scores zero on three temporal knowledge‑editing benchmarks whose ground truth is last‑writer‑wins.
Authors:Po-Yi Wu, Dao-Jan Chang, Shang-Ya Hsiao, Hong-Ming Chen, Yu-Cheng Su, Tsung-Wei Ke
Abstract:
Contact‑rich manipulation requires robots to sequence precise contacts, maintain stable grasps, and apply directed forces. Reinforcement learning (RL) can acquire such behaviors automatically, but its performance hinges on reward design: sparse rewards reduce the learning efficiency, while dense rewards are hard to specify. Visual reward learning addresses this by inferring rewards from action‑free demonstrations. Because it conditions only on visual observations, it fails to capture rewards beyond visual goals. We propose Tactile Reward Learning (TaRL), a framework that learns rewards from tactile demonstrations. TaRL takes a sequence of tactile deformation maps as input, and regresses task‑completion progress from both successful and failed demonstrations. Because TaRL captures local robot‑object interaction, it provides informative feedback to learn firm grasps and correctly directed forces; meanwhile, it is robust to changes in scene layout such as object position. We evaluate TaRL on four manipulation tasks in simulation and two in the real world. Used as a shaping reward, it substantially improves both sample efficiency and final success rate, raising success on Nut threading from 34% to 56% in simulation and on cube pickup from 37% to 97% in the real world. Combining tactile with visual rewards improves performance further. TaRL also generalizes across object instances: trained on box placement and directly deployed to can placement, it significantly improves policy learning on the new task. Project page is available at https://embodiedai‑ntu.github.io/tarl.
Authors:Yi Cui, Tong Zhao, Jiaxin Lei, Chuyi Yang, Yifan Cui, Ling Zhang, Yuxiang Yan, Bo Hong
Abstract:
Clinical scalp electroencephalography (EEG) offers a noninvasive window into neural dynamics of neuropsychiatric disorders. However, discriminative deep models often lack anatomically indexed physiological interpretability. We propose NeuroDyn‑EEG, a pretraining framework integrating generative priors from neural dynamics. It couples an extended Jansen‑Rit neural mass model, leadfield‑based source projection, and simulation‑based parameter inversion. Trained on synthetic parameter‑EEG pairs within physiological ranges, NeuroDyn‑EEG estimates 11 regional parameter families across 90 AAL regions plus one global parameter from standard 19‑channel EEG, using only ~2.43M trainable parameters. We evaluate the framework across three levels. First, controlled simulations demonstrate robust parameter recovery under diverse noise conditions, while real resting‑state EEG evaluations confirm spectral and phase consistency in an inverse‑forward closed loop. Second, on four clinical benchmarks (AD65, PD31, Figshare MDD, and TUAB), NeuroDyn‑EEG achieves competitive classification performance, securing the highest BACC, AUROC, and AUCPR on PD31 and MDD, and highest BACC on AD65. Third, post hoc regional analyses reveal disease‑specific alterations: local synaptic connectivity C_1 involves the most altered regions in AD65, whereas the firing threshold theta ranks first in MDD, offering testable mechanistic hypotheses. Overall, NeuroDyn‑EEG maps scalp EEG to anatomically indexed dynamical parameters, bridging representation learning and mechanistic neurophysiology. Code: https://github.com/Gnosis‑Neurodynamics/NeuroDyn‑EEG.
Authors:Jiawei Zhang, Shuhao Liu, Rong Huang, Yuancheng Li, Zhihui Li, Xiaojun Chang, Changlin Li
Abstract:
One‑dimensional (1D) variable‑length visual tokenizers enable adaptive compression by varying the number of tokens, allowing downstream autoregressive (AR) models to flexibly trade off generation quality against computational cost using a single tokenizer. However, existing approaches based on nested dropout often fail to fully exploit the representational capacity of the tokenizer, resulting in suboptimal performance in both image reconstruction and generation. In this work, we introduce NesTok, a nested self‑alignment framework tailored to dynamic visual tokenizers. NesTok introduces cross‑length training, which jointly optimizes reconstruction across token lengths while using the full‑length sequence to guide shorter counterparts, enabling shorter token sequences to approach the reconstruction quality of full‑length sequences. On ImageNet, NesTok improves substantially over standard training and achieves an rFID score of 0.98. On downstream image generation, it achieves the state‑of‑the‑art gFID score of 1.46 on ImageNet 256×256 among existing variable‑length autoregressive image generation methods. Code will be available at https://github.com/jaiwei804/NesTok.
Authors:Bravish Ghosh
Abstract:
Multi‑agent LLM systems are increasingly structured like organizations, with roles, critics and shared memory, yet they are evaluated on tasks that last minutes. We ask how such an organization behaves when the ground it stands on keeps moving. Frontier Autolab is a long‑horizon testbed in which one simulated firm, voiced by sixteen role personas and a dedicated Red Team, must re‑found itself in nine technology eras from 1990 to 2040. Each era is temporally gated: the firm decides from a dated briefing, a historian‑judge then reveals what happened and scores the decision on a five‑dimension rubric, and lessons enter a persistent Playbook. Six eras are scored against history, one against the live market and two are open forecasts. Across four trajectories (36 era decisions, 180 subscores) we find a consistent foresight‑commitment gap: in all 24 historically scored eras the judge rated the firm's recognition of the coming shift above its choice of where to build (mean gap 1.9 points on a 10‑point scale), because boards chose the layer their existing assets could reach. Organizational design shaped long‑run character. A Red Team armed with numeric kill gates produced fifty years of gated pilots and no product, and the rubric rated this firm highest; firms whose memory stored market‑structure lessons pivoted every era, while a firm whose memory stored only validation procedure kept one method throughout. We also show why such results are hard to trust. Scores rise across eras in every run while the judge's own hindsight subscore falls (within‑run r = ‑0.58), so apparent learning is confounded with recall of history, and we trace further distortions to self‑judging, briefing selection and score aggregation. We release all records and an API harness, and specify fictional and post‑cutoff eras that would turn the testbed into a benchmark.
Authors:Zonghua Gu, Zeyu Gao, Amin Saremi, Samarjit Chakraborty
Abstract:
Adversarial machine learning has focused mainly on integrity, but availability is an increasingly consequential complement. Latency attacks (also energy‑latency attacks) increase inference‑time work, energy, or response time, causing deadline misses, throughput collapse, or resource exhaustion in vehicle controllers, interactive services, or battery‑powered sensors, sometimes while preserving the nominal prediction. This survey unifies a fragmented literature spanning perception pipelines (including physical attacks on autonomous‑driving detection and tracking), input‑adaptive neural inference (sponge examples, dynamic networks), and autoregressive and agentic systems (output‑length, verbose‑image, and reasoning denial‑of‑service attacks on LLMs, VLMs, mixture‑of‑experts models, and tool‑using agents). We organize attacks by exploited computational bottleneck rather than formulation, separating what makes a computation expensive from how the attacker triggers it; the delivery channel (input, prompt or retrieved content, message, poisoning, or weight tampering) is an orthogonal attribute. Many attacks share one mechanism, intermediate‑work amplification, motivating a work‑budget defense abstraction; we distinguish caps on the work entering an expensive stage from caps on the results leaving it. We further analyze when a model‑level cost increase becomes a system‑level availability failure, which depends on critical‑path share, slack, existing ceilings, accumulation, resource sharing, and fallback policy, not on the amplification factor alone. We also provide a threat‑model taxonomy, consolidated quantitative comparisons, a defense review by control mechanism, and open challenges such as standardized evaluation, physical realizability, and whole‑system availability. Companion website: https://github.com/guzonghua/awesome‑latency‑attacks.
Authors:Gabriel Orlanski, Alex L. Zhang, Avi Trost, Vincent Sunn Chen, Frederic Sala, Aws Albarghouthi, Ludwig Schmidt
Abstract:
Agents increasingly build on code written by other agents, and they reimplement rather than reuse, growing the codebases later agents must work in. To measure how well agents design libraries for other agents, we introduce LibraryDesignBench, a two‑phase benchmark in which an agent implements a full‑featured library from a specification that defines required capabilities and potential use cases without prescribing the design. We evaluate the library through the correctness and simplicity of programs written by three user agents from different model families. The benchmark spans 242 expert‑validated programming problems across 15 library‑design tasks in four languages. On eleven of the fifteen tasks, agent designers reproduce the abstractions of the human‑written production library. Downstream agents adopt agent‑ and human‑written libraries alike but underuse them, reimplementing capabilities the library already provides. Our failure analysis finds that downstream agents write extra code mainly because agent‑written libraries are rigid or hard to use, not because capabilities are missing. We also experiment with giving designers more prescriptive, agent‑first guidance and having them test their library with subagents; this improves downstream scores and yields simpler programs. LibraryDesignBench provides both a testbed for evaluating library‑design practices for agent users and an initial design baseline that improves downstream reuse.
Authors:Yize Liu, Huang Huang, Yining Hong, Zijian Du, Zhi Cao, Li Fei-Fei, Jiajun Wu
Abstract:
Memory‑dependent robotic manipulation requires policies to use information that is no longer available in the current observation. Retaining history alone is insufficient: memory must preserve information that supports future actions. One challenge is whether a memory‑free foundation model can learn to retain and use historical information from action demonstrations alone, without external memory support. We introduce T^2Mem, a framework that develops this capability within a pretrained vision‑language‑action policy, without external reasoning models or memory‑specific annotations. T^2Mem uses test‑time training to encode observation history into compact fast weights through online self‑supervised updates, avoiding repeated processing of the full history. An observation‑grounded interface extracts vision‑language information for memory formation and supplies retrieved context to the action expert. Action supervision shapes what the memory learns to retain and use, while alternating memory‑policy learning gives each component a fixed counterpart during optimization. Across 16 RoboMME tasks, T^2Mem improves average success from 17.93% to 56.83% over the memory‑free base policy and outperforms the recurrent‑memory methods reported in the benchmark, while controlled profiling indicates at least 3x inference speedup over explicit methods. Project website: https://yzliu84.github.io/T2MEM‑project/
Authors:Rui Wang, Ruijie Wang, Bo Chen, Jiangxuan Long, Yingyu Liang
Abstract:
Self‑distillation turns knowledge distillation into a closed learning loop and offers a path toward recursive self‑improvement. Without an external teacher, however, the model must determine both what information can improve its supervision and which induced changes should be learned. Existing methods typically improve teacher‑generated data or select training examples in isolation, leaving the information transferred between these stages unmeasured. We introduce InFlow, a retrieval‑guided on‑policy self‑distillation framework that models this process as potential‑to‑realized information flow. InFlow first retrieves potentially informative sources using certainty‑calibrated hidden‑state trajectories, then measures their realized effect through the Jensen‑‑Shannon divergence between the teacher's initial and retrieval‑conditioned answer beliefs. Examples with larger belief shifts are selected for on‑policy distillation. Our analysis formalizes the information optimized by retrieval and selection and relates the answer‑level shift to the teacher‑‑student distillation gap. Across four open‑weight language models and three knowledge domains, InFlow achieves the strongest cross‑model average among the compared selection methods, with ablations supporting both stages of the framework. Our code is available at https://github.com/1240148048/INFLOW.
Authors:Shiwei Ren, Zhiang Liu, Yongchun Fang, Hongwei Chen
Abstract:
Pose‑free feed‑forward 3D Gaussian Splatting (3DGS) has demonstrated remarkable potential for generalized novel view synthesis. However, existing methods typically predict Gaussian appearance attributes represented by spherical harmonics (SH) in the same manner, overlooking the fundamental distinction between view‑independent and view‑dependent appearance, which results in suboptimal rendering quality. In this paper, we present AESplat, a novel and general framework for pose‑free feed‑forward 3DGS that introduces an effective decoupled appearance modeling strategy based on an analysis of SH, enabling higher‑quality rendering. Specifically, AESplat directly derives the zeroth‑order SH coefficient, which represents the base view‑independent appearance component, from the input images without training. The higher‑order SH coefficients are subsequently predicted by a shallow multilayer perceptron equipped with two efficient 3D‑aware inductive biases to model view‑dependent appearance variations. Extensive experiments across multiple datasets demonstrate that our method significantly outperforms state‑of‑the‑art approaches, achieving a 0.8 dB improvement in PSNR over the pose‑free method NAS3R and a 1.1 dB improvement over the pose‑required method DepthSplat on the RealEstate10K dataset. Project page: https://aesplat.github.io/.
Authors:Zixuan Gong, Zeyu Gan, Jiaye Teng, Yong Liu
Abstract:
Matrix optimizers have emerged as a promising direction, with Muon standing out as a prominent design. Revisiting Muon through its full‑Gram representation, we observe that it jointly processes marginal‑scale and interaction information. This opens an alternative way to organize geometric information hierarchically, motivating the Normalize‑Then‑Precondition framework. Specifically, it first uses diagonal‑Gram information to construct a marginally normalized update, then applies spectral preconditioning to its directional interaction geometry. Building on this framework, we develop NormPre with NormPre‑G and NormPre‑L adopting global and localized spectral preconditioning, grounded in spectral‑norm steepest descent and a regularized formulation followed by leading mode selection, respectively. To enable large‑scale training, NormPre‑G uses Newton‑Schulz iterations and NormPre‑L employs randomized sketching to approximate the leading interaction eigenspace. Theoretically, we establish \mathcalO(T^‑1/2) convergence guarantees for simplified versions of NormPre. Across extensive pretraining experiments on GPT‑2 Small, LLaMA and Qwen3, both variants consistently outperform AdamW, Muon and MANO under matched training budgets. Further efficiency and spectral analyses reveal the complementary strengths of two variants and characterize their performance‑efficiency trade‑off. We open‑source our code through a GitHub repository at https://github.com/zx‑gong/NormPre.
Authors:Jianshu Zhang, Ce Zhang, Xiyuan Yang, Chenwei Xu, Haoran Lu, Yijiang Li, Yaqi Xie, Katia P. Sycara, Han Liu
Abstract:
Manipulation behaviors vary widely across objects and scenes, but they share a small set of reusable skills, and planning with these skills helps embodied agents generalize to new tasks. Yet an agent can only plan with skills it knows. Recovering skills from observed experience, the inverse of planning, builds this knowledge over time and yields skill data for training future agents. Vision‑Language Models (VLMs) describe individual manipulation events well, but can they organize a stream of events into reusable skills? We formulate this problem as Streaming Embodied Skill Discovery (SESD): a model watches videos in sequence and maintains a persistent skill library that shapes its later decisions. To systematically measure this ability, we introduce Video2Skill, a benchmark that covers robot tabletop manipulation and human kitchen activity and tests three core capabilities: (i) locating manipulation events in time, (ii) grouping events of the same transformation, and (iii) deciding when to reuse an existing skill or create a new one. Across 19 open‑source VLMs, many models group events at near‑chance level, and scale does not consistently help. Their errors depend on how perception and library updates are coupled: joint models merge distinct transformations into one skill, while models that update the library from text descriptions duplicate recurring ones. Supervised fine‑tuning, including our counterfactual library‑state rebalancing (CLaRe), improves grouping but exposes a deeper bottleneck: trained models consolidate familiar skills yet rarely expand the library. Their libraries stall below half the reference size, and transformations unseen in training are located in time but almost never given a new skill. Recognizing when existing skills are insufficient thus emerges as the central challenge.
Authors:Wenjin Liu, Chenxi Wang, Yue Lu, Zhe Cui, Haoran Luo
Abstract:
Large language models have achieved significant progress in event forecasting, yet their probability outputs exhibit systematic calibration bias that varies heterogeneously across different domains and question types, undermining the trustworthiness of probabilistic outputs for decision‑making under uncertainty. However, existing calibration methods typically correct probability outputs after prediction is complete, without modeling the structural sources of bias within the prediction process itself. To address this challenge, we decompose probabilistic prediction over causal‑temporal hypergraphs into three stages, evidence weighting, evidence aggregation, and source fusion, and propose CHAIN, which designs stage‑specific mechanisms to mitigate bias at each stage: (i) modulating the temporal decay function by causal topological distance, (ii) aggregating approximately independent causal chains via Noisy‑OR after direction‑aware deduplication, and (iii) driving adaptive fusion by causal coverage and directional balance. Experimental results on cross‑domain forecasting benchmarks show CHAIN outperforms existing methods in expected calibration error, Brier score, and accuracy. Our project is available at https://github.com/QwenQKing/Chain.
Authors:Hada Melino Muhammad, Luan Pham, Laure Barrière, Sachin Shetty, Leonardo Pulga, Flora D. Salim
Abstract:
Identifying the root cause of an anomaly among hundreds of sensors is critical for preventing safety incidents and costly downtime in complex monitored systems. Existing studies evaluate root cause analysis (RCA) methods using top@k accuracy. We show that this metric has a fundamental blind spot: it conflates two failure modes, retrieval failure, where the true cause is never considered, and reranking failure, where it is considered but ranked too low. In this work, we introduce a retrieval‑reranking decomposition and audit four well‑known benchmarks to expose this blind spot. Our experiments show that, on benchmarks with complex faults, statistical baselines mis‑rank the true cause 79‑100% of the time, and graph‑based methods never clearly beat the best statistical baseline, whether their causal graphs are learned on short fault windows, on retrieved candidate pools guaranteed to contain the cause, or on multi‑day normal‑operation data. Meanwhile, on simple benchmarks where faults manifest significantly at their origin, retrieval is nearly solved (98‑100%). Guided by the decomposition, we build a two‑stage pipeline combining a multi‑signal retriever with an LLM reranker that, as one fixed configuration, matches or exceeds the best baseline's top@1 accuracy on all six benchmark suites (by up to +12 points), with no causal graph or labeled data required. When all methods rank the same retrieved candidates with the true cause guaranteed present, adding a short system‑description document lets the reranker lead the best baseline by +7 to +18 points on every benchmark. Code is available at https://github.com/cruiseresearchgroup/DecompRCA.
Authors:Jianshu Zhang, Keliang Wu, Chengxuan Qian, Xiyuan Yang, Ce Zhang, Ariel Tian, Anbang Liu, Haoran Lu, Han Liu
Abstract:
Embodied agents now take on ever longer tasks. For long tasks, knowing only whether a task finally succeeds or fails says little; the steps along the way matter. Progress Reward Models (PRMs) score how far a task has come at every step, and serve as dense rewards, verifiers and monitors. Yet in long tasks the current frame alone often cannot tell how far the task has come, because progress depends on what happened before. We call this problem context‑dependent progress estimation. Existing benchmarks on progress estimation mostly focus on short tasks whose progress can be read from the current observation, and whether PRMs can estimate progress when context is needed remains underexplored. We therefore build ContextProgress‑Bench, with 24 manipulation tasks for 120 episodes. The benchmark covers three settings: (i) State Recall, where information needed for progress appeared earlier but is not in the current frame; (ii) Sequence Tracking, where steps follow a fixed order, so progress requires knowing which steps are done and which comes next; and (iii) Recurrence Disambiguation, where look‑alike frames sit at very different progress. We then run a paired diagnosis: each PRM keeps the same input format in both runs, and in one run its instruction integrates the right context. Even PRMs that read the entire history get lost in estimating progress, yet with the right context the same five models cut their progress error by 77‑82%. Embodied PRMs are thus not incapable of progress estimation, but lost without the right context. We therefore propose ProgressCompass, an autonomous agentic loop that reorients an existing PRM and uses current general‑purpose VLMs to supply the context the PRM needs. Wrapped in the loop, the same frozen PRM cuts its progress error by 63% and raises its rank agreement by 76%. With such a compass, PRMs estimate progress far better on longer, more complex tasks.
Authors:Ziqi Zhao, Fanqing Meng, Haocheng Lu, Lingxiao Du, Qiguang Chen, Mengkang Hu, Xiao-Ming Wu
Abstract:
Recursive self‑improvement (RSI) aims to achieve compounding gains by having models improve themselves. While most existing RSI systems optimize external agent harnesses or prompts around a frozen base model, data‑centric RSI directly updates the model's own parameters by training on agent‑generated data. However, because validating data strategies requires expensive model training, existing methods face a fundamental dilemma: a single agent gets trapped in narrow directions and lacks exploration breadth, while naive parallel search or heavy trace sharing sacrifices long‑horizon search depth. To address this challenge, we introduce G"odel Forest, a multi‑agent framework that organizes recursive self‑improvement as an ensemble of co‑evolving search trees. In G"odel Forest, each agent autonomously grows a persistent tree, deepening, branching, or pruning data strategies based on model feedback to secure depth, while parallel trees explore distinct regions of the data space to expand breadth. Crucially, rather than leaving trees isolated or flooding them with heavy execution logs, a dynamically co‑evolving memory connects the forest: agents continuously distill their successes and failures into compact procedural lessons anchored to a global leaderboard. Through this forest ecosystem, a dead‑end in one tree instantly warns the whole forest against unpromising paths, while an empirical breakthrough quickly seeds new exploration branches in neighboring trees. Evaluated on RSIBench‑Data across six diverse domains, G"odel Forest outperforms the single‑agent baseline by an average of 10.70% while reducing wall‑clock time on five tasks. Ablations confirm that co‑evolving shared memory yields a +7.00% gain over independent parallel search, demonstrating that collective distillation is key to scalable self‑improvement. The code is available at https://github.com/evolvent‑ai/Godel‑Forest.
Authors:Shuangping Li, Peng Zhang
Abstract:
We present GenLimitLib, a source‑aligned Lean 4 library for language generation in the limit. Introduced by Kleinberg and Mullainathan at NeurIPS 2024, language generation in the limit studies a theoretical question motivated by LLMs: how to generate valid new strings from observed examples. This young and rapidly evolving field offers a natural testbed for studying large‑scale formalization. GenLimitLib contains formal developments for 30 papers. It extracts shared definitions and reusable proof components while preserving paper‑specific assumptions and statements, and records relationships across papers. In this way, GenLimitLib provides a concrete and structured view of the literature. We show through mathematical case studies and LLM experiments how our library can support both human mathematical research and AI‑assisted research. Our Library: https://github.com/pengzhang91/generation‑in‑the‑limit‑lib.
Authors:FangZhi Zhong, Xuerui Qiu, Yuqi Pan, Ya Liu, Shaowei Gu, Bo Xu, Guoqi Li
Abstract:
Long‑context reasoning in large language models incurs substantial computation and memory costs. Visual text compression (VTC) reduces input length by rendering text as images, but fixed‑resolution rendering creates a compression‑performance trade‑off: low DPI saves tokens at the expense of legibility, whereas high DPI spends tokens on irrelevant content. We introduce FocusVTC, which breaks this trade‑off through adaptive resolution while preserving general multimodal capabilities. It combines compressed low‑DPI global views with selective region enhancement, integrating enhanced views into ongoing reasoning. We construct 29.4K high‑quality Reasoning‑Evidence Localization (REL) chain‑of‑thought examples (REL‑CoT) that link reasoning traces to page indices and bounding boxes. Multi‑resolution REL supervised fine‑tuning (REL‑SFT) teaches the model to localize relevant regions, and Group Relative Policy Optimization learns when to enhance resolution and how to use the resulting observations, without a separate continual‑pretraining stage. At 72 DPI on RULER v1, FocusVTC scores 87.4 at 2.9× input compression, including tool observations, versus 57.5 for Glyph at 3.0× input compression. It surpasses its text‑input backbone on LongBench (56.40 versus 55.86), improves the MRCR macro‑average by 13.91 points, and achieves a 51.19 macro‑average on VTCBench. The MRCR latency evaluation also shows a 2.79× online end‑to‑end speedup over Text. General multimodal capabilities are preserved, with MMMU increasing from 65.12 to 66.73 and MME from 2424.02 to 2457.62.
Authors:Yuanwei Hu, Bo Peng, Yuheng Jia, Xinting Hu, Yadan Luo, Wenjie Zhu
Abstract:
Vision‑language pre‑training has reshaped image clustering, giving rise to language‑assisted image clustering (LaIC), which leverages textual semantics to complement visual representations. Despite the rapid proliferation of LaIC methods, it remains unclear how much LaIC has actually advanced image clustering, as existing studies generally suffer from major limitations, including inconsistent experimental settings, inadequate dataset selection, and limited evaluation dimensions. To address this gap, we introduce VLM4Cluster, a comprehensive benchmark for image clustering in the era of pre‑trained vision‑language models (VLMs). VLM4Cluster implements 17 representative methods spanning classical, deep, and language‑assisted image clustering, and evaluates them on 20 datasets covering classical, challenging, fine‑grained, large‑scale, and out‑of‑distribution settings. Beyond effectiveness, VLM4Cluster systematically investigates image clustering along three complementary dimensions: robustness to adversarial perturbations, generalization under distribution shifts, and computational efficiency. Our study shows that LaIC substantially advances the clustering performance frontier on many semantically demanding benchmarks, generally exhibits stronger generalization under distribution shifts, and achieves a more favorable effectiveness‑efficiency trade‑off. However, its gains become less consistent on large‑scale and fine‑grained datasets, while language assistance does not systematically reduce sensitivity to adversarial perturbations. VLM4Cluster is released at https://github.com/YuanweiHuu/VLM4Cluster.
Authors:Muyang Li, Jie Yang, Zhengyu Fang, Junchao Zhu, Zhengkun Xiao, Ruining Deng, Zhe Jiang, Shigang Chen
Abstract:
Language‑model agents are usually trained by reinforcement learning from one reward per episode, and privileged self‑distillation enriches it by letting the same policy, given a skill, teach its skill‑free self through token probabilities. However, we identify two phenomena that question this channel. Invisible Advantage: a skill in context lifts WebShop success from 42.2% to 56.2%, yet changes the probabilities of fewer than a quarter of the sampled tokens. Much to Align: a skill changes the hidden states of over 80% of response tokens, in a way that linear probes can trace back to the specific skill. To exploit this, we propose Privileged Representation On‑policy Self‑Distillation (PR‑OPD). After a GRPO warm start, the policy writes a hindsight skill for each trajectory, re‑reads its own responses with that skill as a stop‑gradient teacher, and aligns its projected hidden states to the teacher's at every layer alongside the reward objective, with no external skill library, separate teacher, or inference overhead. On ALFWorld and WebShop with two backbones, PR‑OPD achieves the best overall results in every setting, improving over GRPO by up to 4.7 points in ALFWorld success and 14.0 points in WebShop accuracy. Code is available at https://github.com/balibata/PR‑OPD.
Authors:Shengda Fan, Xin Cong, Zhong Zhang, Haotian Chen, Yankai Lin
Abstract:
Process reward models (PRMs) have become a key component for LLMs, as their step‑level feedback supports both post‑training and test‑time reasoning. However, training strong PRMs remains costly: human step annotation is difficult to scale, while Monte Carlo estimation is computationally expensive and can drift from the intrinsic correctness of steps. To get effective PRMs at low cost, we introduce TIPS (Thinking‑Induced Process Supervision), an outcome‑only reinforcement learning (RL) framework for training generative PRMs. In TIPS, the model generates a chain‑of‑thought (CoT) followed by step‑level labels and an outcome label. The reward depends solely on whether the predicted outcome matches the ground truth, and the resulting group‑relative advantage is used to optimize the entire generated response. Intuitively, when checking intermediate steps helps determine the outcome, more accurate checks can lead to better outcome judgments and higher rewards. Outcome‑only RL can therefore reinforce step‑level verification without explicit process supervision. We validate the effectiveness of TIPS across math and agent benchmarks and four backbone families. Notably, TIPS‑Qwen3‑4B‑Thinking‑2507 reaches 85.2 F1 on ProcessBench with only 3.2K outcome‑labeled trajectories, surpassing all evaluated trained PRMs and strong prompt‑only judges such as GPT‑5.4‑Instruct and Claude‑4.7‑Opus, while still trailing o1‑mini. Code and data are available at https://github.com/RUCBM/TIPS.
Authors:Hanwen Lu, Jun He, Mingjia Yang, Hao Wei, Jinhao Huang, Yi Lin, Xiang Zhang
Abstract:
Historical street‑view imagery records urban evolution, but uneven coverage leaves substantial gaps in historical records. Generating plausible past appearances requires restoring changed structures while preserving persistent scene content. We construct VIGOR‑his, a decade‑spanning cross‑view dataset containing 43,653 location‑level quadruplets across 11 cities on three continents. Its automated pipeline performs spatial pairing, consistency screening, change classification, and the generation and validation of satellite‑based change descriptions and local editing instructions. Based on VIGOR‑his, we propose CrossTimeEdit, a model that reformulates historical street‑view generation as editing, using recent street views to constrain viewpoint and unchanged appearance and temporal satellite differences as change evidence. Starting from FLUX.2 [Klein] 4B, we train CrossTimeEdit through supervised fine‑tuning (SFT) followed by online reinforcement learning (RL). We design three street‑view editing criteria, namely Instruction Alignment (IA), Background Preservation (BP), and Quality and Physical Plausibility (QP), as both RL reward dimensions and evaluation metrics. We optimize this multi‑reward objective using Within Group Relative Policy Optimization for flow‑matching models (Flow‑GRPO) with Group reward‑Decoupled Normalization Policy Optimization (GDPO), which normalizes each reward dimension before aggregation. CrossTimeEdit improves overall performance across the three editing criteria by 17.12% over the pretrained baseline and outperforms cross‑view generation models in scene consistency, visual realism, and perceptual quality. The implementation code, dataset, and model weights are available at https://luhanwen67.github.io/CrossTimeEdit‑release/.
Authors:Hadi Reisizadeh, Jiajun Ruan, Sijia Liu, Mingyi Hong
Abstract:
Unlearning in large language models (LLMs) is typically evaluated at the output level, where a model appears to suppress sensitive or undesirable content. In this work, we show that such evaluations can create an illusion of forgetting: even when output‑level leakage is eliminated, sensitive information can remain encoded in the model's hidden representations. We first provide a theoretical analysis establishing a fundamental separation between output suppression and representational erasure. Specifically, we show that the decoder can be made arbitrarily insensitive to sensitive directions, driving output‑level leakage to zero, while the hidden representations retain the underlying information. To empirically validate this phenomenon, we train generative probe decoders on hidden states across transformer layers, enabling layer‑wise measurement of information leakage. Across three widely used benchmarks, TOFU, MUSE, and WMDP, and state‑of‑the‑art unlearning methods, we find that substantial sensitive information remains recoverable from hidden representations, even when standard output‑level metrics indicate successful unlearning. To address this gap, we propose Probe‑Adversarial Representation Suppression (PARS), an unlearning objective that adversarially minimizes the extractable information from hidden representations. PARS directly targets representational leakage and provides significantly stronger guarantees of erasure under adversarial probing and relearning attacks, outperforming all evaluated baselines. Our results highlight a fundamental limitation of existing unlearning paradigms and suggest that true forgetting in LLMs requires controlling not only model outputs, but also the information encoded in hidden representations. Codes are available at https://github.com/OptimAI‑Lab/HiddenStateUnlearning.
Authors:Yuzhou Wu, Longteng Fan, Zimeng Li, Yu Wanchan, Ting Zhang, Yiyang Ma, Shihao Li, Wei Ying, Jianbin Qin, Jiajian Jing, Fangwen Chen, Yifan Wu, Zichen Zhang, Ruiqi Yang, Weibin Kong, Yihang Xu, Haoran Liu, Zonghang He, Xuyang Liu, YiFan Xiong, Siteng Huang, Tao Xu, Zhuo Xu, Long Chen, Ruoxiang Li
Abstract:
Understanding ongoing robot manipulation requires models to interpret visual observations in relation to interaction history and task progress. We introduce RoboChrono, a benchmark for streaming task understanding comprising 39 scenarios and 34,713 evaluation instances, constructed from real robot executions and complementary bare‑hand human recordings. The benchmark evaluates seven tasks grouped into recognition, alignment, and temporal grounding, covering action understanding and anticipation, visual correspondence, temporal ordering, and action localization. Zero‑shot evaluation of 18 vision‑language models reveals substantial differences across tasks. GPT‑6‑Astra achieves 98.3% accuracy on Frame Matching but 68.3% on Frame Ordering, while RynnBrain1.1‑122B‑A10B exhibits a larger gap, reaching 95.4% and 32.9%, respectively. Input ablations on matched questions with five open‑weight models further reveal distinct dependencies on visual evidence: removing visual observations reduces Current Action Recognition accuracy by 22.1 percentage points, whereas Next Action Prediction decreases by only 0.7 points. These findings show that strong visual matching does not consistently coincide with strong temporal ordering, and suggest that next‑action prediction can be supported by task and action priors even when visual evidence is unavailable. RoboChrono provides a diagnostic setting for examining these differences, highlighting the need for capability‑specific evaluation beyond aggregate scores when assessing task understanding in robot manipulation.
Authors:Minh Nhat Le, Nisarga Gondi, Yibo Peng, Ronghao Ni, Limin Jia, Beidi Chen, Haizhong Zheng
Abstract:
Large language models (LLMs) increasingly power agents that access sensitive information, use external tools, and modify software repositories. Although these capabilities offer substantial benefits, they also create security risks such as jailbreaks, prompt injection, and vulnerable code generation. Existing defenses often require retraining, fail to adapt to evolving attacks, or address only a single threat pattern. To address these limitations, we propose Self‑Evolving Defense (SED), a training‑free framework that distills harmful agent trajectories into reusable security policies without updating model weights. By retrieving relevant policies for future tasks, SED continually adapts to new attacks while retaining knowledge across attack scenarios. To evaluate the effectiveness of SED, we test it with three open‑source models (DeepSeek V4 Flash, GLM 5.2, and Kimi K3) on eight benchmarks that span jailbreaks, prompt injection, and insecure code generation. SED lowers targeted prompt‑injection success on AGENTDOJO to 0.42%, compared with 3.7% for the best baseline defense, and holds adaptive X‑TEAMING attack success on HARMBENCH to 7.8%, more than four times lower than the best baseline at 35.2%, while preserving benign task utility.
Authors:Hankun Lin, Patrick Pynadath, Ruqi Zhang
Abstract:
Self‑speculative decoding accelerates large language model (LLM) inference by drafting tokens from the target model itself, but faces a sharp tradeoff between the quality and cost of the draft. Early‑exit methods produce drafts cheaply by terminating computation at intermediate layers, but forgo the deeper representations that later layers provide and thus suffer in draft quality. Multi‑token prediction preserves draft quality by emitting from the model's final hidden states, but pays for a full forward pass to produce those states at every drafting step. We propose self‑speculative encoder‑decoder (SEED), a self‑speculative method that obtains high‑quality drafts cheaply by reusing the deep contextual representations already computed during verification. We reinterpret the standard decoder‑only transformer as an implicit encoder‑decoder: the first layers (encoder) build deep contextual representations, and the last few layers (decoder) emit tokens from them. Encoding and verification are merged into a single step: verification is performed by the full encoder‑decoder, and the contextual representations of the verified prefix are cached for reuse during drafting. Drafting is therefore very fast: between verifications, the lightweight decoder drafts multiple tokens autoregressively, each conditioned on the cached representations and on preceding drafts. Experiments across multiple benchmarks show that SEED achieves up to 2.7× average speedup on 4B‑scale models, outperforming both early‑exit and MTP‑style self‑speculative baselines and running 28% faster than the state‑of‑the‑art EAGLE‑3, while preserving or even improving the generation quality of standard autoregressive fine‑tuning. Code is available at https://github.com/lhk2004/SEED.
Authors:Zehao Jin, Ruixuan Deng, Junran Wang
Abstract:
Pretrained transformers use little of their depth to follow references in context. Thirteen base models reliably follow only 1.4‑3.6 lines, and extra pretrained loops add little. A task‑trained rank‑8 LoRA at one early layer extends this computation with all model weights frozen. Qwen3‑8B improves from 15.5% to 99% exact accuracy on 24‑line chains; a longer‑trained LoRA reaches 50 lines. Ouro‑1.4B reaches 60 lines after four loops and at least 160 after eight. The LoRA starts a relay: program lines pass on their chain identity through a short range of middle layers. Frozen heads read progressively further up the chain, and removing parent‑line attention stops the relay. A frozen‑model measurement locates the last useful intervention layer within tolerance in three of four held‑out models. Task‑specific LoRAs also improve MuSiQue. Default answers therefore understate the computation accessible through a tiny edit. Code and an interactive demo are available at https://lunamos.github.io/stop‑thinking‑too‑early/
Authors:Zhenhong Zhou, Xuanyue Zhao, Youji Liu, Yuanhe Zhang, Xiaoyu Ma, Lianyu Hu, Yang Liu
Abstract:
Audio large language models (ALLMs) can reason about the content of audio recordings to perform complex tasks. However, these capabilities usually collapse in real‑world environments when background noise and competing sources mix the target sound. Inspired by long‑term memory in human listening, we propose Long‑Term Memory‑Guided Audio Enhancement (LTM‑AE) to improve selective target perception by refining the audio representations of ALLMs without training. LTM‑AE extracts representations in hidden states from separate clean reference recordings as long‑term memory for each category, guiding enhancement toward a user‑specified listening target. We reconstruct incoming audio tokens in the selected category long‑term memory and interpolate the reconstructions with the original tokens before language backbone decoding. This interpolation controls the influence of stored auditory experience while keeping all ALLM parameters fixed. Diagnostic readouts across twenty sound categories and three ALLMs show that LTM‑AE strengthens responses to a specified target amid three interfering sources. Averaged over constrained and free‑form classification, accuracy gains over raw mixtures range from 29.53 to 46.15 percentage points across multiple open source models. For speech content recovery, LTM‑AE with an additional learned token‑level gate reduces Qwen2‑Audio's word error rate from 23.07% to 14.77%. This work takes an initial step toward using principles of human long‑term memory to enhance ALLMs for real‑world listening. Our code is available at https://github.com/aynlp/ltm‑audio‑code
Authors:Ruochen Zhang, Yao Huang, Yitong Sun, Jiahe Xie, Jin Yan, Jifan Ma, Yuanfang Guo, Xingxing Wei
Abstract:
While Multimodal Large Language Models (MLLMs) are increasingly deployed in safety‑critical domains, their reliability is threatened by multimodal implicit risks. Unlike explicit threats, these hazards emerge when individually benign text and neutral visual entities logically converge to induce unsafe outputs. Current detection methods fail to address this because they overlook the underlying risk activation mechanisms that govern cross‑modal risk activation, leading to single‑modality shortcut learning and hallucinated rationalizations. To bridge this gap, we first construct TriggerBench, the first dataset explicitly modeling risk compositionality (5,600 instances). By formally isolating Key Elements and Trigger Elements to build counterfactual contrastive pairs, TriggerBench eliminates risk residues and forces models to perform genuine logical deduction rather than superficial pattern matching, which provides a rigorous foundation for both large‑scale training and fine‑grained evaluation. Building on this, we propose a Step‑Supervised Structured Reasoning training framework and employ it to train ThinkingGuard, a specialized guard model. Inspired by Situation Awareness theory, we decouple implicit risk identification into progressive cognitive stages, and utilize a step‑reward Monte Carlo Tree Search algorithm to explore optimal reasoning trajectories, which are then distilled into the model through Dual‑Constraint Preference Alignment. Extensive experiments across both standard and implicit safety benchmarks demonstrate that ThinkingGuard achieves strong performance. Project resources are available at https://github.com/FroggyChen/ThinkingGuard.
Authors:Yansong Liu, Rui Liu, Yuan Zuo, Hongwei Zhao, Da Fu, Fuwei Zhang, Fuzhen Zhuang, Yong Chen, Zhe Li
Abstract:
Extrapolative temporal knowledge graph reasoning (TKGR) predicts future facts from historical snapshots. Most existing methods train once on an early prefix of the timeline and then use a frozen model for all future timestamps. We argue that this fixed‑prefix protocol is misaligned with extrapolation. It learns from a static prefix, whereas the target stream is non‑stationary: new entities and facts emerge, temporal dependencies shift across regimes, and recurring historical signals must be refreshed online. As a result, models trained only on early snapshots become outdated and degrade over long horizons. We address this mismatch by formulating extrapolative TKGR as continual learning over streaming snapshots. Under this view, effective extrapolation must jointly handle current dynamics, stable knowledge, and recurring historical evidence. Based on these requirements, we propose History‑enhanced Two‑Step Continual Learning (HiTS‑CL), a backbone‑agnostic continual learning framework for extrapolative TKGR. HiTS‑CL tracks current dynamics via continual fine‑tuning, preserves stable knowledge via multi‑teacher adaptive distillation, and retains recurring historical evidence via a selective memory of recent and frequent facts. We integrate HiTS‑CL into five representative TKGR backbones and evaluate it on four benchmark datasets. HiTS‑CL consistently improves extrapolation accuracy, reduces long‑horizon degradation, and outperforms strong continual‑learning baselines, including a recent method for temporal knowledge graphs. Source code and data are available at https://github.com/liuyansong98/HiTS‑CL.
Authors:Josepha Michiko Leo, Hyun-seok Min, Yehoon Jang, Irvan Zidny, Jin-Woo Chung, Sungchul Choi
Abstract:
Retrieval‑augmented generation is widely used in professional writing, yet whether retrieval grounds revision or merely injects templates is rarely tested where "correct" has a definable meaning. Patent claim amendment supplies that signal: the examiner names the attacked limitation and cites prior art, providing per‑case ground truth. We release three artifacts: (i) a corpus of 7,385 USPTO prosecution cases with XML‑aligned pre/post claims, rejection, and cited prior art; (ii) a seven‑probe battery comparing random and structural‑match retrieval as two policies under a fixed prompt scaffold; (iii) a deterministic five‑channel metric (C1‑C3 and C5 in main, C4 supplementary) requiring no LLM evaluation. Across 9,600 pre‑registered calls on four frontier LLMs (Claude Sonnet 4, Claude Haiku 4.5, GPT‑5.4, GPT‑4o‑mini), no tested model exhibits detectable classical prior‑injection behavior; retrieval effects are small and direction‑inconsistent between random and structural retrieval, and the null is unchanged under a dense (semantic) retriever, across retrieval depths k in 1,3,5,10, and under a paraphrase‑sensitive grounding metric. Revision locality reveals a model‑specific difference that the template channel misses. The four‑cell taxonomy, which we treat as exploratory, leaves the prior‑injector cell unoccupied.
Authors:Gyeonggwan Lee, Eunsoo Im, Seunghwan Hong, Junghun Suh
Abstract:
Equirectangular projection (ERP) is the standard representation for 360^\circ imagery, and robust dense feature matching on ERP underpins panoramic stereo, view synthesis, and omnidirectional SLAM. Dense matchers trained on flat images degrade systematically on ERP because the chart introduces three coupled distortions ‑‑ topological, metric, and area ‑‑ that standard coarse matching and visibility estimation do not explicitly model. We show that correcting the three distortions at the coarse‑stage interfaces where they arise ‑‑ pairwise distortions in attention, per‑pixel distortion in covisibility gating ‑‑ improves PCK@1^\circ from 0.229 to 0.275 on Matterport3D under a fixed coarse scaffold, with the refiner architecture unchanged ‑‑ our central result. Concretely, SCCM (Spherically Consistent Coarse Matching) augments a chart‑naive cross‑attention/dual‑softmax coarse matcher with two sphere‑derived priors: Spherical Positional Attention (SPA) pairs a yaw‑periodic RoPE (topology) with a tangent‑plane bias (metric), and Area‑Aware Covisibility (AAC) applies a pre‑sigmoid log‑area correction (area). The chart‑naive scaffold serves as a controlled reference, separating the scaffold‑replacement effect from the spherical‑prior effect. Instantiated in the RoMa V1 framework with the same frozen encoder, refiner architecture, and loss, SCCM also outperforms the ERP‑native EDM (0.163) and an ERP‑retrained RoMa V1 (0.198) under a unified ERP dense matching protocol, while perspective‑trained matchers largely fail on ERP. It further transfers zero‑shot to Stanford2D3D and, when trained on outdoor Holo360D, leads there as well.
Authors:Andrew Tang, Nicholas Deas, Kathleen McKeown, Vishal Misra
Abstract:
Dense retrievers decide which documents reach users and the language models that use them, yet they are typically evaluated with neutral queries. We ask whether the identity signals that real users express in their queries‑‑‑political ideology and dialect‑‑‑bias what a retriever returns. We design evaluations in two domains, political news and consumer‑health questions, each pairing a controlled synthetic set that varies only the identity signal with naturalistic queries. Across five dense retrievers and a sparse baseline, every retriever (i) retrieves articles that align with the query's own political lean and (ii) performs worse for questions written in African American Language (AAL) than in White Mainstream English (WME). Two analyses tie these gaps to queries' identity signals beyond surface vocabulary: partialling out an aggregate lexical‑asymmetry score leaves the synthetic gaps largely intact, and linear probes recover lean and dialect from the retrievers' query embeddings beyond token‑level features. Left unaddressed, such retrieval biases risk contributing to polarization and reinforcing the health disparities already faced by AAL speakers. Code is available at https://github.com/Andrewtcr/bias‑ret.
Authors:Ruichen Xu, Siyao Wang, Fang Wan, Jiacheng Qiu, Wenhan Gao, Jiaxing Zhang, Linsey Pang, Ravid Shwartz-Ziv, Prakhar Mehrotra, Yann LeCun, Yuefan Deng
Abstract:
Recovering complete physical fields from sparse observations is challenging because the measurements may not uniquely determine the underlying state. Diffusion‑based PDE solvers address this problem through iterative sampling whereas neural operators provide deterministic one‑pass predictions. We propose SCOPE (Sparse‑Context Observability‑aware Predictive Embeddings) to recover complete PDE fields from sparse observations by coupling full‑field latent prediction with physical reconstruction. A shared decoder reconstructs fields from both predicted and complete‑view representations so that representation learning is guided by both physical recovery and latent matching. We derive a quadratic risk decomposition at fixed teacher‑decoder pairs showing why optimal latent prediction need not yield optimal field reconstruction. We also establish sufficient conditions for decoder improvements on complete inputs to transfer to recovery from partial observations. Experiments across five PDE settings show that SCOPE outperforms mask‑aware neural operators on all ten forward and inverse tasks and achieves lower errors than those reported for diffusion‑based solvers including DiffusionPDE and FunDPS. Decoder‑only adaptation further improves recovery without retraining the backbone while retaining deterministic single‑pass inference.
Authors:Ruichen Xu, Siyao Wang, Fang Wan, Jiacheng Qiu, Wenhan Gao, Jiaxing Zhang, Linsey Pang, Ravid Shwartz-Ziv, Yann LeCun, Yuefan Deng
Abstract:
Physical‑field reconstruction and forecasting depend on both measurement density and spatial layout, yet evaluation under a single observation pattern does not characterize performance when that pattern changes. We introduce PDE‑OBS, an integrated benchmarking platform spanning numerical data generation, model training, and inference and evaluation under varying observation conditions. It combines 560,000 fields and trajectories from seven partial differential equation families with configurable observation operators and seven adapted baseline methods for stationary reconstruction and short‑horizon forecasting. Separating observation construction from physical records allows users to specify parameterized patterns and deterministic mixtures for training and testing while preserving prediction targets and data splits. The evaluation protocol uses references trained for each test pattern to compare models on identical test observations and targets, alongside equal‑count groups for spatial‑layout comparisons. On a 14,000‑record subset, we evaluate 441 trained models under nine test patterns, yielding 3,969 evaluations. Mean cross‑pattern error exceeds mean matched‑pattern error in all 49 PDE‑method pairs, and this finding persists in a configuration‑matched subset of 117 models. Denser test observations do not consistently reduce error for a fixed model. Mixed‑pattern training on five completed pairs reduces large single‑pattern transfer errors, although destination‑trained references usually remain more accurate. Together, the benchmark and findings support systematic evaluation of observation‑pattern sensitivity and provide a reusable workflow for developing methods under changing measurement conditions. Code: https://github.com/ru1ch3n/PDE‑OBS.
Authors:Seungyeon Yoo, Gawon Lee, Seungwoo Jung, Inkyu Jang, H. Jin Kim
Abstract:
RGB‑only end‑to‑end visual navigation policies remain vulnerable to collisions in real‑world dynamic environments, motivating a dedicated safety layer. Existing visual Control Barrier Function (CBF) approaches seek to provide safety from RGB observations, but often rely on real‑time rendering or explicit scene reconstruction and are primarily designed for static scenes, limiting their practicality for onboard deployment. We propose a teacher‑student visual distillation framework that transfers the safety behavior of a privileged CBF teacher to an RGB‑only student filter for dynamic environments. The student maps a short RGB history, robot velocity, and a nominal control action directly to a safe action, while the teacher uses ground‑truth robot and obstacle states in a real‑to‑sim dynamic Gaussian Splatting environment. To reduce the teacher‑student information gap, the teacher constructs safety constraints only from obstacles observable within the student's RGB history. It also accounts for obstacle‑velocity uncertainty to improve robustness to motion variations, while action augmentation exposes the student to diverse safe and unsafe nominal actions to better capture the safety boundary. At deployment, the student requires only RGB observations and robot velocity, without explicit 3D reconstruction or online rendering. Experiments show that the proposed method outperforms visual CBF baselines and improves the safety of RGB‑based navigation policies under dynamic obstacle motion. Project page: https://syeon‑yoo.github.io/distill‑cbf‑site/.
Authors:Dongchan Shin, Xing Han Lù, Jiaqi Deng, Jay Gala, Tomás Vergara Browne, Jaewon Moon, Fengyuan Liu, Alexandre Drouin, Siva Reddy, Alexandre Lacoste
Abstract:
Large language model (LLM) agents have demonstrated strong performance on complex web navigation tasks, yet they remain brittle in real‑world settings where user intentions are underspecified and preferences are heterogeneous. In practice, users rarely provide explicit profiles, requiring agents to infer latent preferences from implicit signals. Despite its importance for deployment, this problem setting is largely underexplored in existing benchmarks. To address this gap, we introduce AdaptArena, a benchmark for evaluating test‑time personalization of web agents via implicit preference inference. AdaptArena consists of 480 tasks, featuring both single‑preference and double‑preference scenarios. Each evaluation task must be solved by retrieving and leveraging the most relevant historical user trajectory that implicitly encodes the target preference. In addition, we introduce AdaptiveAgent, a retrieval‑based framework for standardized evaluation of implicit preference inference. Experiments reveal a substantial performance gap: while oracle agents with access to ground‑truth preferences achieve an 82.92% success rate, the evaluated LLM agents using our framework reach at most 15.62%. Furthermore, we find that correctly inferring user preferences is necessary but not sufficient for task success, as execution failures in downstream web interactions remain a significant bottleneck even when agents align with the target preference. These findings highlight implicit preference inference and robust action grounding as key challenges for deploying reliable, user‑facing web agents. We release our code: https://github.com/McGill‑NLP/web‑agents‑test‑time‑adaptations
Authors:Hao Li, MeiJia Chen, Weijie Ren, Donghan Li, Zijun Tian, Jingchun Huang, Naibo Wang
Abstract:
On‑policy distillation (OPD) trains a student to match the teacher's next‑token distributions on the student's own trajectories and has yielded substantial empirical gains. Generalized variants allow the student to surpass the teacher by extrapolating an implicit reward in output space. The language‑model head, however, attenuates this change anisotropically: much of the change encoded in the teacher's hidden states reaches the logits at a small fraction of its weight, and the sampled‑token log‑probability ratios on which output‑space extrapolation relies inject noise that the extrapolation amplifies, making training unstable. We observe that reinforcement learning (RL) shifts a model's internal representations relative to its base checkpoint, and that the direction of this shift can be measured at every layer. Motivated by this observation, we propose RIDE (RL‑Induced Direction Extrapolation), which extrapolates the RL‑induced change directly in representation space: at every layer and token position, RIDE computes the residual between the teacher and its pre‑RL checkpoint and regresses the student's hidden states toward targets displaced beyond the teacher along this residual. Conditioned on a sampled trajectory, this regression is equivalent to maximizing a linear directional reward defined by the residual under a quadratic penalty centered at the teacher, which makes explicit how the objective moves the student along the RL‑induced direction while limiting its deviation from the teacher. Across four base/RL‑teacher pairs spanning different scales, architectures, and pre‑training lineages, RIDE approaches or exceeds the RL‑trained teacher on every pair and is the only method whose mean does so, and it consistently outperforms output‑space extrapolation, which degrades the student whenever the teacher is close to its base. Project page: https://github.com/xixixixixxxx/RIDE.
Authors:Wenliang Guo, Zhanbo Huang, Yu Kong
Abstract:
We study hand‑object interaction (HOI) reconstruction from monocular RGB videos, where partial observations can produce visually plausible yet mechanically inconsistent trajectories. Existing methods mainly enforce visual and geometric agreement, leaving the underlying interaction dynamics insufficiently constrained. We propose DynamicHOI, a physics‑aware HOI reconstruction framework combining geometry‑grounded diffusion refinement with coupled hand‑object dynamics. Geometry spatially grounds visual evidence for trajectory refinement, while articulated inverse dynamics and Newton‑Euler dynamics derive hand generalized forces and object wrenches for dynamics‑level supervision. We further couple hand and object dynamics through contact‑force transfer and recover active hand actuation as an interaction‑level physical quantity. We formulate its empirical magnitude distribution into a probabilistic prior that penalizes unlikely actuation and suppresses mechanically implausible reconstructed motion. Experiments on three HOI datasets show consistent improvements in both hand and object reconstruction. The reconstructed trajectories further benefit downstream applications including hand world‑model generation and robotic manipulation learning, demonstrating the value of physics‑aware HOI modeling beyond reconstruction.
Authors:Jae-Ho Lee, Min-Yeong Park, Jun-Yeong Moon, Jung Uk Kim, Gyeong-Moon Park
Abstract:
Continual learning enables vision systems to adapt to ever‑changing data distributions. Despite significant advances, existing approaches fail to capture continuous and concurrent shifts in classes and domains, a critical capability for real‑world deployment. This work introduces Online VIL (Online Versatile Incremental Learning), a novel scenario where class concepts and visual domains evolve simultaneously online without explicit boundaries. To better adapt to the challenges of such dynamic environments that more closely resemble real‑world conditions, we propose a novel framework TopFlow, Topology preservation with Flow matching representation that contains two complementary mechanisms: Domain‑agnostic Flow Matching (DFM) and Global Topology Preservation (GTP). DFM guides the model to have domain‑agnostic representations by integrating the geodesic flow kernel into contrastive learning. In contrast, GTP maintains the global structure of the feature space without explicitly storing past examples. Our extensive experiments demonstrate that TopFlow effectively addresses the limitations of existing methods within the Online VIL scenario, achieving state‑of‑the‑art performance in challenging Online VIL. The proposed methods suggest potential directions for building continual learning systems in realistic dynamic environments. Our implementation code is available at https://github.com/KU‑VGI/Online‑VIL.
Authors:Jae-Ho Lee, Jeong-Eun Lee, Gyeong-Moon Park
Abstract:
Large vision‑language models (LVLMs) have recently achieved remarkable progress across multimodal tasks, yet object hallucination remains a persistent challenge where models generate descriptions inconsistent with the visual input. Recent work mitigates hallucinations through training‑free representation editing, typically by constructing hallucination‑related directions from teacher‑forcing (TF) contrasts between hallucinated and truthful responses. However, LVLMs operate through autoregressive (AR) decoding during generation, raising the question of whether TF‑based analysis fully reflects the generation dynamics that lead to hallucinated outputs. In this paper, we analyze the relationship between TF‑based editing and AR generation behavior and find that TF‑based editing alone may be insufficient to capture both decoding dynamics and multimodal interactions associated with hallucinations. To address this limitation, we propose DARE (Dual‑path Auto‑Regressive‑aware Editing), a hybrid hallucination editing framework that integrates two complementary contrast pathways: textual contrasts and image contrasts, together with autoregressive‑aware representation signals. Specifically, DARE constructs hallucination editing directions from (1) TF‑based textual contrasts, (2) AR‑aware representation transitions during decoding, and (3) controlled visual differences between paired images. Extensive experiments on multiple LVLM hallucination benchmarks demonstrate that DARE consistently reduces object hallucinations while preserving multimodal perception capability and inference efficiency. Our implementation code is available at https://github.com/KU‑VGI/DARE.
Authors:Jieyuan Pei, Meiyi Lu, Sining Ang, Yubo Zhao, Zhangyi Hu, Mingwei Xu, Haokai Ding, Wei Li, Zihan You, Jianwei Zheng, Li Yu, Yifeng Pan, Ji Tao, Rongjunchen Zhang, Yan Wang
Abstract:
Autonomous driving requires choosing a safe and efficient plan as surrounding traffic evolves. Generate‑and‑select planners propose multiple trajectories and score them for execution, and they have outperformed representative direct‑prediction baselines on NAVSIM. Their scorer must compare plans that were never executed. Driving logs record the future of only the executed trajectory, so matching the logged future can leave predictions for the alternatives unconstrained; a simulator, in contrast, can label the outcome of every candidate. We introduce World4Scorer, which builds the scorer as a trajectory‑conditioned JEPA‑style predictor: it predicts a state for each candidate and reads the candidate's scores from that state. Simulator outcome labels supervise the states of all candidates, and the observed future of the executed trajectory anchors the predictor to real scene evolution. Because one predictor produces every candidate's state, the anchor can constrain shared parameters used to score unexecuted plans, while the future itself is needed only during training. Generated candidates mostly score well, so a scene‑matched bank adds low‑scoring plans to the outcome supervision; framewise choices can conflict, so inertial re‑ranking keeps consecutive selections consistent. World4Scorer achieves state‑of‑the‑art NAVSIM‑v2 performance and a strong adapted‑system result on closed‑loop Bench2Drive. With the LeWM world model and planning budget fixed, outcome‑based scoring also improves manipulation planning on the OGBench‑Cube benchmark.
Authors:Pedro R. A. S. Bassi, Wenxuan Li, Szymon Plotka, Ruby Honjol, Jakub Przado, Xinze Zhou, Kang Wang, Yang Yang, Malte Jensen, Akshay S. Chaudhari, Curtis P. Langlotz, Alan L. Yuille, Zongwei Zhou
Abstract:
Multi‑cancer segmentation in computed tomography (CT) is fundamentally limited by the scarcity of tumor masks across different organs. We present Merlin Plus, the first large‑scale CT dataset with radiologist‑created tumor masks across 9 organs. Merlin Plus extends the Merlin dataset by adding 1,153 per‑voxel tumor masks and longitudinal metadata. To create these tumor masks, we developed a report‑based active‑learning framework in which radiology reports identify tumor cases for annotation and support training of a tumor segmentation model. The model generates initial masks, which radiologists review and correct to produce the final masks, reducing annotation burden while maintaining high‑quality annotations. Besides tumor masks, the longitudinal metadata in Merlin Plus enables temporal modeling of cancer progression. By directly addressing the major bottleneck of limited multi‑cancer segmentation masks, Merlin Plus supports scalable multi‑organ cancer detection, segmentation, and longitudinal analysis in CT. Dataset is available at: https://github.com/MrGiovanni/MerlinPlus
Authors:Yiming Liu, Ben Wan, Tongxuan Liu, Ao Wang, Yuqi Xiong, Fan Zhang, Hui Chen, Guiguang Ding
Abstract:
Diffusion models enable high‑quality visual generation, but iterative denoising remains computationally expensive, especially under classifier‑free guidance (CFG), which requires both conditional and unconditional evaluations. Training‑free caching reduces this cost by reuse of previously computed features or predictions. However, existing branch‑local reuse criteria do not explicitly account for how cache errors combine under CFG or how local perturbations affect the final output. We identify two misalignments in cache control: a branch‑guided mismatch, where guided error depends on both the magnitudes and alignment of branch errors, and a local‑final mismatch, where the downstream impact of a local error varies across timesteps. We propose RA‑CFGCache, a Risk‑Aligned Caching framework under CFG that incorporates both factors while keeping the sampling schedule and guidance rule fixed. CFG‑aware Guided‑Risk Composition combines existing branch‑wise proxies using CFG coefficients and offline‑calibrated cross‑branch alignment. Propagation‑Aware Rescaling further weights the resulting guided‑risk estimate with a timestep‑dependent propagation prior calibrated from isolated reuse perturbations. An online threshold controller then determines when to jointly refresh or reuse both branches. Experiments on FLUX.1‑dev, Wan2.1‑T2V‑1.3B, and CogVideoX‑2B demonstrate improved efficiency‑‑fidelity trade‑offs over evaluated training‑free caching baselines. Moreover, RA‑CFGCache is compatible with diverse base proxy families, including TeaCache‑, DiCache‑, and MagCache‑style estimators, and consistently improves fidelity at nearly unchanged latency. Code is available at https://github.com/yiming‑l21/RA‑CFGCache.git.
Authors:Jade Choghari, Pepijn Kooijmans, Mansi Agarwal, Yusuf Umut Ciftci, Aseem Doriwala, Catherine Weaver, Mouli Sivapurapu, Kai Yang, Jackson Lee, Thomas Wolf, Pragna Mannam
Abstract:
Robots operating in real‑world environments must execute complex, multi‑step bimanual tasks over long horizons rather than single, isolated actions. Current manipulation datasets struggle to support this capability: although single‑arm datasets reach hundreds of thousands of trajectories, they typically provide only one high‑level instruction per episode while the rare bimanual effort that does label subtasks annotates only a fraction of its hours. We present FineART, a densely annotated bimanual manipulation dataset of 40,543 episodes, 1,718 hours, and 533,913 subtasks across 151 tasks. We also introduce FineART‑VLA, a vision‑language‑action policy that predicts its own next subtask, and show that mid‑training it this way yields substantial gains. Specifically, success on a spatial disambiguation task increases from 32.0% to 100.0%, and step‑by‑step human subtask guidance lifts success on an unseen long‑horizon task from 16.0% to 76.0%. Furthermore, after minimal fine‑tuning on a new robot, the policy requires one‑tenth the data of baselines without mid‑training and generalizes zero‑shot to completely unseen tasks on the new hardware. We open‑source the full dataset, model weights, and training code.
Authors:Yuyan Chen
Abstract:
In diseases where clinical guidelines are incomplete, contested, or mutually contradictory, knowledge completeness and dynamic conflict‑aware synthesis are two safety‑critical properties that standard Retrieval‑Augmented Generation systems do not provide. Therefore, we present \sysname, an adaptive retrieval calibration clinical question‑answering agent for ME/CFS, a disease where diagnostic frameworks coexist and major guidelines actively contradict each other on treatment. ARCagent contributes three components. First, a 1,706‑chunk, 10‑source knowledge base with a structured inter‑guideline conflict registry spanning all active ME/CFS diagnostic frameworks. Second, a conflict‑aware retrieval calibration pipeline that re‑ranks retrieved evidence using query‑specific focus and conflict signals. Third, a benchmark scored by LLM‑as‑Judge, avoiding systematic underestimation averaging 10.1 percentage points caused by keyword matching. ARCagent achieves 95.3%, outperforming all base LLMs. Code is available at https://github.com/Yukyin/ARCagent.
Authors:Shoaib Ahmed Dipu, Md. Shaown Miah, Kamrul Hasan, Sayeed Shafayet Chowdhury
Abstract:
An event camera produces an asynchronous stream, but what is visible in that stream depends on how a downstream consumer, such as a model or detector, processes time. The same timestamp change may leave a coarse temporal representation unchanged while changing the response of a model that preserves finer timing. We characterize this dependence as observer‑relative stealth. For recorded event streams, retiming an event within its protected accumulation window leaves the accumulated integer tensor exactly unchanged. We use this exact blind space to construct Null, a gradient‑guided timestamp‑retiming attack, and define SC‑ASR_A(tau) to measure attack success while bounding the change visible to observer A. On DVS Gesture at a 10% event budget, Null reaches 81.56 +/‑ 5.81% ASR on ConvSNN and 98.67 +/‑ 0.45% on a GRU while preserving the protected tensor exactly. On DailyDVS‑200, a protocol‑scale Multi‑View Fusion Network variant reaches 99.28 +/‑ 0.11% exact‑null ASR, compared with 9.70 +/‑ 1.06% for its matched control. In a five‑attack comparison, Null is the only method with nonzero attack success at exact observer equality, reaching 81.4% on DVS Gesture and 87.35% on DailyDVS‑200. We also search the same exact blind space with an independently implemented constrained projected‑gradient optimizer, C‑PGD. At matched victim‑gradient evaluations, C‑PGD reaches 84.50 +/‑ 2.89% ASR on DVS Gesture and 89.55 +/‑ 4.39% on DailyDVS‑200, again with exact protected equality. Perturbations that are exactly hidden from the protected observer become visible under shifted, finer, overlapping, and randomized temporal views. Adding observer constraints reduces the real‑valued blind‑space fraction from 87.5% to 75.0% to 62.5%, while DVS ConvSNN ASR falls from 74.9% to 61.9% to 37.2%. These results show that stealth is not a property of the perturbation alone.
Authors:Shoaib Ahmed Dipu, Md Salman Shamil, Sayeed Shafayet Chowdhury
Abstract:
Continual learning is usually studied through mechanisms that preserve old knowledge. We develop Successional Learning Theory (SLT), a mesoscopic account in which the current representation is a resident community, the incoming task is an invader, forgetting is resident displacement, joint retention is coexistence, replay is resident reinforcement, and training moves from establishment toward stabilization. Its empirical coordinate is directional pre‑invasion compatibility, measured on the resident model before the incoming task is learned. Across eight experiments, compatibility orders later forgetting on the 20 directed Split‑CIFAR‑10 transitions (three‑repeat r=‑0.789, incoming‑task cluster 95% CI [‑0.90,‑0.72], every repeat alone r<=‑0.67), forecasts held‑out forgetting with 24% lower error than a no‑information baseline, and reproduces under controlled MNIST permutations and CIFAR‑10 rotations (r=‑0.804, ‑0.718). On an 84‑transition suite, compatibility separates coexistence from exclusion at every retention threshold (AUC 0.93‑0.97). Replay repairs every transition with at most 325 stored examples and is most efficient where displacement is largest. Compatibility reaches |r|=0.720, while activation, representation, Jacobian, and fixed‑coefficient Lotka‑Volterra specializations do not. Plasticity and feature turnover fall reliably from early to late training (15/15 and 14/15 runs). We formalize a minimum habitat‑modification bound, a displacement floor, a sufficient coexistence condition, an identifiability law with a range‑restriction corollary, successional stabilization, and local reinforcement. The identifiability law also predicts where the coordinate loses leverage, and the prediction matches three CIFAR‑100 partitions and five optimizer regimes. SLT is a pre‑adaptation diagnostic that complements replay, regularization, and projection methods.
Authors:Brandon Leblanc, Charalambos Poullis
Abstract:
Feed‑forward 3D reconstruction models have achieved impressive performance by scaling model and dataset size, but their cost excludes most research groups and precludes edge deployment. Additionally, generating 3D supervision without sensors still relies on slow, unreliable Structure‑from‑Motion, as the community lacks a COLMAP‑like system for neural 3D pseudo‑label generation. We present OTT3R (RGB‑Only Tiny Transformer for 3D Reconstruction), a knowledge distillation framework that addresses both problems on a single workstation equipped with 2 GPUs. Distilling π^3 (959M parameters) into a 102M‑parameter student yields 9.4× compression and up to 7× faster inference, trained at 1.6% of VGGT's training compute. An integrated pseudo‑label pipeline offers a reliable, high‑throughput alternative to COLMAP, generating dense per‑pixel point maps and SE(3) camera poses for a 667K‑image corpus in 3.5 hours on two commodity GPUs and succeeding on every sequence we tested, including those where COLMAP fails. The general student tracks the teacher on in‑distribution monocular depth and, zero‑shot, outperforms COLMAP on 7‑Scenes and on DTU completion, but it does not replace the teacher on out‑of‑distribution multi‑view geometry. The deployable artifact is the domain‑specialized student: after specialization at 0.2% compute, it is 4× more accurate than COLMAP on 7‑Scenes at 980× throughput, with near‑teacher completion. Code is available at https://github.com/TheFourthKaramazov/OTT3R
Authors:Ziyi Yin, Sangmin Woo, Kang Zhou, Sungyeon Kim, Aosong Feng, Haibo Ding, Jun Huan
Abstract:
Vision‑language‑action (VLA) models perform well on shorter‑horizon manipulation tasks but still struggle with long‑horizon tasks that require multiple dependent manipulations from a single command. Online reinforcement learning (RL) can improve these policies through environment interaction, yet many existing methods provide reward only after the complete task succeeds. However, such terminal supervision is sparse and does not distinguish early failures from rollouts that make substantial partial progress. We propose StructRL, an online RL framework that constructs structured intermediate supervision from verifiable subtask completions. StructRL decomposes each task into verifiable subtasks, grants intermediate rewards only after the prerequisite subtasks have been completed, and scales each reward according to completion pace. Across RoboCasa365 and LIBERO‑Long with GR00T‑N1.5 and pi 0.5, StructRL consistently outperforms evaluated online RL baselines. These results show that verifiable, structured intermediate rewards improve long‑horizon VLA post‑training. Code is available at https://github.com/amazon‑science/StructRL.
Authors:David Schnurr, Felix Sarnthein, Thomas Hofmann, Imanol Schlag
Abstract:
Tabular foundation models achieve strong performance by conditioning on labelled examples in context, but softmax attention limits their use on large datasets. Existing linear‑time alternatives, however, are mostly causal, and their potential for tabular in‑context learning (ICL) remains underexplored. To address this, we (1) revisit causal training setups, (2) compare linear sequence mixers, and (3) investigate their ICL generalisation beyond the pretraining context length. First, we show that the best training setup for causal models resembles next‑token prediction. Then, perhaps surprisingly, the most promising linear sequence mixer is causal: DeltaNet outperforms even non‑causal linear attention. However, it degrades beyond 2‑4× the pretraining context length, and existing mitigation strategies such as bidirectionality defer the problem at best. A hidden‑state oracle shows that this is not a capacity problem. Instead, our analysis points to an instability in the recurrent state, which drifts in deeper layers of causal models. Since DeltaNet's learned write rates overfit to the pretraining regime, we modulate them with a time‑dependent decay schedule intervention to stabilise length generalisation. Finally, re‑introducing non‑causality by reading out from the final state allows us to closely match a controlled softmax attention baseline on OpenML‑CC18 and TabArena.
Authors:Honam Wong, Surbhi Goel, Enric Boix-Adserà
Abstract:
Mixture‑of‑Experts (MoE) layers are central to frontier language models, and recent architectures push toward more and smaller experts. In this regime, the standard linear router becomes a bottleneck: with M experts and hidden dimension h, its per‑token cost Θ(Mh) dominates the MoE layer once M is large. We introduce MoRE (Mixture of Rank‑reduced‑routed Experts), which factorizes the router weight matrix at rank r and reduces the routing cost to O((h + M)r). We prove that rank logarithmic in M suffices for routing expressivity when the number of active experts is fixed, and is necessary up to precision factors. We also prove that logarithmic rank preserves load balance in a Gaussian memorization model, and training on a synthetic phonebook task shows that low rank does not hurt memorization. At matched active FLOPs, the factorization allows a factor of Θ(h/r) more experts. To realize this gain in wall‑clock time, we design a fused Triton kernel at inference that avoids expensive memory operations on HBM. Empirically, MoRE improves memorization on the phonebook task and performance on knowledge‑intensive Q\&A benchmarks after pretraining, while matching reasoning ability. Code available at https://github.com/Matheart/MoRE_code.
Authors:Sihang Nie, Xueru Li, Xiaofen Xing, Deyi Tuo, Cheng-Bin Jin, Jingyuan Xing, Jinxin Ji
Abstract:
Instruction‑based text‑to‑speech (ITTS) systems enable natural‑language control of expressive speech generation, but often offer limited transparency and fine‑grained control over individual text units. Character‑level controllable TTS systems provide explicit acoustic control, yet typically rely on user‑specified acoustic attributes. To bridge this gap, we propose InstCharVoice, a unified framework that grounds natural‑language instructions in character‑level acoustic control. We first construct grounded instruction annotations on the WordVoice‑5A‑zh corpus using Qwen3‑Omni. With this supervision, we train an autoregressive model to identify instruction‑relevant characters and predict their acoustic attributes before generating the corresponding speech tokens. Keyword prediction and grounding‑aware loss weighting help the model focus on instruction‑relevant characters and attributes. Experiments show improved instruction following and keyword‑level acoustic control over representative ITTS systems, with competitive speech naturalness and explicit character‑level controllability. Audio samples are available at https://xxh333.github.io/instcharvoice‑demo/.
Authors:Liner Xiang, Wenbo Zhang, Hengrui Cai
Abstract:
Reliable evaluation of large language models (LLMs) is essential for their development and deployment, yet is often costly, risky, and difficult to perform safely online. We study off‑policy evaluation for LLMs, where limited human‑labeled data from a behavior model are used to evaluate a newer target LLM. This setting is challenging because labels are scarce, behavior‑‑target distribution shift is common, and response likelihoods are often unavailable for black‑box LLMs. We propose the Optimal Transport‑based Robust Off‑Policy Evaluation (OTROPE), a likelihood‑free evaluation that performs distributional correction in a semantic space via optimal transport to align labeled behavior‑policy samples with unlabeled target‑policy samples. OTROPE combines corrected human‑labeled residuals with proxy predictors, yielding a doubly robust‑style evaluation without behavior‑policy modeling or density‑ratio estimation. We theoretically characterize why baseline evaluators fail under LLM distribution shift, and establish consistency and convergence rates for OTROPE when either the reweighted behavior distribution or the proxy predictor converges. Experiments on synthetic and real LLM evaluation tasks show that OTROPE consistently outperforms baselines while enabling ensembles of weaker LLM evaluators to approach and sometimes surpass stronger evaluators. Code is available at https://github.com/LinerXiang/OTROPE.
Authors:Yixiao Chen, Shuojin Yang, Shi-Min Hu
Abstract:
Linear RNNs offer linear‑time sequence processing and constant‑memory decoding, but their fixed‑size recurrent states must accommodate all past key‑‑value associations. Existing forgetting mechanisms and Delta Rule updates reduce interference by selectively clearing or correcting the state, yet earlier associations can still become difficult to retrieve. We introduce CyFA (Cyclic Flow Attention), a Linear RNN with relative‑time‑partitioned memory. At each step, a learned clock controls the cyclic transport applied jointly to the key and value states before the current key‑‑value pair enters the age‑zero slot, thereby organizing stored associations across relative‑time slots. We further derive an exact change to absolute‑clock coordinates that expresses CyFA as two scalar‑decay linear attention recurrences and enables efficient chunk‑wise training. Across 400M‑‑1.4B pretraining experiments with matched recurrent‑state sizes, CyFA improves recall‑intensive performance while maintaining competitive language modeling and high computational efficiency. At 400M, CyFA outperforms KDA on FDA (42.60 vs. 26.07) while requiring only 46.7% and 48.3% of KDA's forward and backward core‑operator execution times, respectively. Our code is publicly available at \hrefhttps://github.com/Chyxx/CyclicFlowAttentionthis https URL.
Authors:Xiangyu Zhou, Saleh Zare Zade, Rafi Ibn Sultan, Alexander Kotov, Dongxiao Zhu
Abstract:
Large Reasoning Models (LRMs) are commonly trained with reinforcement learning (RL) to improve their generation of chain‑of‑thought (CoT) reasoning before producing final answers. However, RL rewards are typically assigned based on final answers, providing little or no direct supervision over intermediate reasoning. This can lead to deceptive safety alignment, where the reasoning trace and final answer convey inconsistent safety signals. To systematically investigate this phenomenon, we introduce DSAR (Deceptive Safety Alignment Rate), a metric that jointly assesses reasoning traces and final answers to quantify their safety inconsistency. Across multiple LRMs and benchmarks, we find that deceptive safety alignment is pervasive under standard prompting conditions and is substantially amplified under prefilling attacks. We further provide a hidden representation analysis showing that models exhibit stronger safety discrimination at the final‑answer stage than during intermediate reasoning. To close this gap, we propose SARA (Safety‑Aware Reasoning Alignment), an RL‑based method that rewards both safety‑aware reasoning and safe final answers, encouraging early harmful intent recognition and enforcing reasoning‑answer consistency. Experiments show that SARA significantly mitigates deceptive safety alignment under both standard and adversarial settings while preserving helpfulness and utility. Code is available at https://github.com/xzhou98/SARA.
Authors:Neemias B. da Silva, Martin Lukk, Ali Sutani, Abhishek Moturu, Harris Yang, Daniel Silver, Matt Ratto, Thiago H. Silva
Abstract:
Large language models (LLMs) show considerable potential in simulating human attitudes and preferences. Prior work finds that LLM‑generated responses can compress the range of attitudes found within populations and misrepresent particular subgroups in ways that vary across models and topics. We introduce Population Fidelity, an evaluation framework that distinguishes key conditions required for a set of LLM‑generated responses to represent a population. It incorporates three dimensions: group‑level accuracy, the amount of between‑group variation, and the structure of that variation. We demonstrate the framework's utility in two ways. First, we reproduce a prior study of "machine bias" in LLM survey responses and apply the framework to its models and more recent ones, showing that poor representation reflects not only insufficient between‑group variation but also variation assigned to the wrong groups. Second, we evaluate one proposed approach to improving models' population representativeness: cultural fine‑tuning. We find that cultural fine‑tuning can improve alignment with the survey center without improving the representation of within‑population differences, a distinction that measures of aggregate agreement do not capture. We argue that representing a population requires models to reproduce several features of human attitudinal variation simultaneously. Our framework organizes these features and provides reusable code, data, and trained models for evaluating population fidelity across substantive domains and assessing proposed alignment methods.
Authors:Sanghyun Hahn, Jonghyun Choi
Abstract:
Action chunking provides temporal abstraction in reinforcement learning by selecting short action sequences instead of individual actions, but many existing approaches face two limitations in high‑dimensional robotic control. First, many rely on value functions over action chunks, which can be difficult to learn as action dimensionality and chunk length grow. Second, executing chunks open‑loop removes within‑chunk feedback, limiting reactivity in contact‑rich tasks. We present Action Chunking PPO (ACPPO), a PPO extension that uses a chunked actor while retaining a standard state‑value critic, thereby avoiding chunked Q‑functions. We further propose ACPPO‑Corr, which augments the chunk planner with a stepwise feedback corrector that adjusts planned actions online within each chunk. Across 25 simulated robotics tasks from IsaacGym and Bi‑DexHands, spanning locomotion, arm manipulation, and dexterous hand‑object interaction, ACPPO‑Corr achieves the strongest aggregate performance among evaluated methods and performs best on both decision‑frequency‑sensitive and decision‑frequency‑neutral task subsets. Ablations show that moderate chunk lengths work best and that corrector regularization is important for balancing chunk‑level planning with local feedback. These results suggest that action chunking can be effective in online PPO when chunk‑level planning is paired with closed‑loop correction. The code is available at: https://github.com/hshhahn/ACPPO.
Authors:Lei Liu, Zhaokang Liang, Qingcheng Zeng, Chenda Duan, Lu Mi, Zhen Tan, Tianyu Liu
Abstract:
Major depressive disorder (MDD) severely impacts daily activities and quality of life. Detecting MDD involves multimodal data, such as interview recordings and sensor measurements. This is particularly challenging, as these heterogeneous modalities often demand distinct, customized prediction pipelines. Existing efforts to address this challenge have explored both manually engineered multimodal architectures and agent‑assisted pipeline development. Despite their progress, it remains challenging to autonomously revise pipelines based on experimental feedback and carry verified improvements forward into subsequent designs. To this end, we propose Multimodal Exploration via Recursive Self‑Improvement Agents for Major Depression Analysis (MERID). The framework develops depression pipelines through experience‑based recursive self‑improvement (RSI). Grounded State Construction (GSC) grounds experience by aligning multimodal records with subject‑level depression targets. Coupled Pipeline Exploration (CPE) jointly modifies representations, fusion, and predictors to build successor pipelines for classification and severity estimation. Evidence‑Guided Evolution (EGE) guides revisions through feedback and verifies gains under uncertainty in small depression cohorts before inheritance. Extensive experiments on depression benchmarks show that MERID achieves the best results on multiple tasks compared with multimodal and agent‑based baselines. Further analysis highlights the value of acoustic and linguistic cues for depression detection. Our code is available at https://github.com/DiscoAILab/MERID
Authors:Zander Majercik, Sharon Zhang, William Wang, Tejan Karmali, Fangjun Zhou, Yucheng Yuan, Jean-Peïc Chou, Maneesh Agrawala, Kayvon Fatahalian
Abstract:
We present a system that aids the design of 3D obstacle course games by providing designers with rapid feedback on how obstacles can be solved. Our core contribution is a system for querying for solutions (sequences of player actions) to an obstacle that adhere to designer‑specified constraints (e.g., avoid a region, travel through a given waypoint, only perform two jumps, etc.). To solve a wide range of obstacle designs quickly, we author a high‑performance implementation of the GoExplore algorithm for exploratory search, and guide search with an obstacle solving agent trained offline using reinforcement learning (RL). To further accelerate search, the system carries out exploration using a custom GPU‑accelerated obstacle course game simulator that generates playthrough experience at nearly 14,000× real time, 60‑fps gameplay. Through design studies, we demonstrate that the use of constrained solvability queries in a rapid design loop is sufficiently expressive to help designers understand ways an obstacle can be solved or why it cannot be solved. We also show how the tool can let designers answer higher‑level questions such as identifying undesirable solution paths and assessing the difficulty of solutions. This allows them to pursue new design directions they did not originally anticipate. Human playtesting of obstacles designed using our system confirms that human players indeed play the obstacles in the manner the designers intended. We release code for our interactive tool, simulator, training setup, and procedural level generation system at https://zandermajercik.github.io/interactive‑obstacle‑course‑feedback/.
Authors:Johnny Jingze Li, Abdulla Kuleib, Kalyan Basu, Gabriel A. Silva
Abstract:
The way a model distributes activity over each layer's attention heads offers a coarse view of how it routes information through depth; how this changes with the task is part of what a mechanistic account must explain. Holding prompt length fixed, we vary how many serial steps a task demands and measure, in every layer of 17 open‑weight models, whether activity concentrates on a few heads or spreads across many as demand rises. Both occur: in most models, layers just before mid‑depth concentrate activity and later layers spread it. Models differ in where and how strongly this happens. The Qwen2.5 base models from 0.5B to 7B, for example, spread less than the average model in every task and concentrate activity in parts of their second half, where Llama models from 1B to 8B and OLMo‑2 spread; the contrast largely holds between Llama‑3.1‑70B and Qwen2.5‑72B, which have the same number of layers and heads. These differences are reproducible, and post‑trained models keep much of their base model's pattern. An ablation study suggests that, within a task, models whose activity is more concentrated on their top heads also depend more on those heads for the answer. Concentration and spreading across layers thus offer a new way to compare models, by how they route information through depth. Code is available at https://github.com/johnnyjli/serial‑demand‑heads.
Authors:Zahra Khodagholi, Niloofar Yousefi
Abstract:
Input encodings can restrict which measured contrasts a predictor can jointly reproduce, even when no single contrast is forced to vanish. We compute the attainable contrast space from an encoder's equivalence classes and a fixed contrast design, without labels, loss, or a fitted model; projecting the recorded contrasts onto that space gives an empirical error floor for any unrestricted decoder on those classes. On a 140‑rectangle siRNA interaction panel, a graph neural network's training‑only feature mask merges 165 endpoint states into 90 classes and cuts the rank of the 140 interaction contrasts to 72. The resulting floor is 0.009980, which is 14.6% of the fitted model's interaction squared error; the fitted model reaches 0.068335, slightly worse than a control predicting no interaction at all. A minimum of three restored chemistry columns recovers full rank. Refitting without the mask removes the floor entirely, yet interaction MSE improves by only 0.000017 under the reported protocol, and the restored columns remain absent from every training input. On a released RNA‑splicing predictor, whose encoding is injective on the measured states, the same computation returns the full design rank of 1,986 and a floor of exactly zero. These results separate what an encoding permits from what a fitted model achieves; they do not identify what limits the remaining error. The rank check needs no fits and bounds what any amount of training under a fixed encoding can recover. The project repository is available at https://github.com/shadi97kh/REPRESENTABLE‑BUT‑UNLEARNED.
Authors:Om Shankar Tiwari, Tangi Vass, Gagan Deep Singh
Abstract:
AI coding agents fail in two coupled ways. They spend most of their context window rediscovering where things live, and they assert success without evidence when the work gets hard. Repository indexes address the first with cheap context, and orchestration frameworks with adversarial review address the second with accountability. Both describe the same object, the structure of the codebase, at two timescales: what is true of the code now, and what was verified to be true, at which revision, by whom. Assay makes that observation operational. Every claim an agent makes (tests pass, no secrets, behavior preserved) is bound to the Merkle hash of the dependency cone of the code it covers, so the claim is stale exactly when that code or anything it depends on changes. We show the binding is sound and minimal, and that the blast radius of a change is precisely the set of claims it invalidates. On the graph we place a risk‑proportional evidence obligation, a bounded review protocol with separation of duties, and a merge gate that consults no model: coverage, freshness, signatures, exit codes, plausibility, evidence monotonicity (the mechanical form of "do not delete the failing test"), and review status. Assay is a dependency‑free Python tool with an MCP server. On five public repositories a 600‑token brief costs 14x to 114x less than an exploration proxy, warm rebuilds are up to 5x faster than cold ones, cone binding re‑verifies 7.9% to 81.9% of claims where repository binding re‑verifies all of them while per‑module binding misses 23% to 68% of required invalidations, and the gate blocks 9 of 9 scripted adversarial behaviours while admitting the honest ones. Every number in this paper is generated by the released scripts.
Authors:Fahd Seddik, Fatemeh Fard
Abstract:
Large language models can reason in continuous space instead of decoded text, by recurring on their own hidden states or by passing those states between agents, while training supervises only the Cross‑Entropy (CE) of the final decoded answer and does not constrain the thought. Theoretical and empirical analyses establish and confirm four failures of CE‑only training that lead to a lower probability of the correct answer such as collapsing thoughts across distinct questions and retaining irrelevant information. We introduce REST (REpresentation‑Supervised Thoughts), a training objective that turns four properties of a valid thought representation (causality, minimality, separability, and stability) into differentiable losses added to CE. We instantiate it in latent single‑agent and multi‑agent systems, without architectural changes or added parameters at inference. Across 7 benchmarks spanning mathematics, science, medicine, and code generation, with the same training data, compute, and latent budget, REST increases accuracy over CE‑only training across agent settings and model sizes by up to 7.5 percentage points and convergence on a final answer by 30%. Furthermore, REST thoughts encode more of what is required to achieve the correct answer, and decoding them better recovers the intended output of the agent, which makes latent communication easier to interpret. Project Website: https://fard‑lab.github.io/REST
Authors:James C. Mathews, Francisco Couzo, Aleksandr Petrov, Avijit Chatterjee, Saad Nadeem
Abstract:
In this paper, we revisit the concept of entropy in the spatial context with the aim of deriving computable and interpretable metrics for point pattern analysis in domains such as histopathology. We discuss stochastic point process assumptions like Poisson homogeneity and Simple Sequential Inhibition (SSI) and review established results for Voronoi and Delaunay tilings of point sets for their potential to provide null distributions for rigorous empirical hypothesis testing. We present (1) a novel "dense basin entropy" defined in terms of the Ord distribution supported on Voronoi basins, which is shown to be sensitive to clustering, and (2) a related Markov chain designed as a simplification or approximation of Brownian motion in the underlying planar domain. We investigate bounds on the dense basin entropy in the SSI regime and in empirical data, and show that the entropy rate and spectral gap of the Markov chain lead to sharp discrimination metrics. Finally, we demonstrate a generalization to multiple‑set analysis via aggregation of one set over the Markov invariant measure for another. Simulations and experiments in histopathology show that our proposed metrics offer insights complementary to other instantiations of entropy in spatial analysis. The code can be found on our SMProfiler GitHub: https://github.com/nadeemlab/SMProfiler.
Authors:Denis Mamatin, Andrey Salov
Abstract:
Infrastructure drift can separate a running Kubernetes system from its documented architectural intent. This paper investigates live architecture models: editable architectural representations connected to selected runtime facts through explicit correspondences and recurring conformance checks. The approach is instantiated through an Archer‑specific subset of Kubernetes Deployment Language (KDL) and Archer, a VS Code prototype with synchronized textual and graphical views. Snapshot recovery extracts selected Kubernetes facts into KDL; periodic and on‑demand read‑only checks report model‑cluster inconsistencies without enforcing or repairing deployment state. We assess feasibility on three feature‑selected Kubernetes example applications under an author‑defined protocol, reporting precision and recall for snapshot recovery and selected inconsistency detection. Recovery scores can be reproduced from saved ground‑truth and recovered models; detection uses a documented manual perturbation protocol. The results support feasibility within the evaluated KDL scope. They do not establish comparative superiority, detection of arbitrary production drift, scalability, or developer benefit. Storage coverage and ingress‑host representation/default handling remain limitations.
Authors:Jiayi Li, Ruizhe Li
Abstract:
Before invoking external tools, an agentic LLM must select among a K‑way action space: executing a call, seeking clarification, answering directly, or declining. While internal activation steering can alter these pre‑execution decisions, conventional aggregate metrics obscure where altered states land and what collateral damage they inflict. We present SAKIKO, an auditing framework that formalizes representation repair via directional error discovery, router‑conditioned intervention, destination‑resolved verification, and prospectively frozen statistical licensing. Across seven LLMs on When2Call and MetaTool, channel‑keyed interventions induce direction‑specific net gains in five models; across three sealed evaluations, none of 59 budget‑matched random directions matches calibrated target gain. Crucially, destination auditing shows that behavioral movement does not equal repair: an intervention achieving +55 net gain corrupts over half of the baseline‑correct decisions it touches, and promising point estimates on Qwen3‑4B and Gemma‑2‑9B are formally declined due to finite‑sample uncertainty. SAKIKO establishes the necessity of outcome‑resolved adjudication before claiming internal repair. Code: https://github.com/ruizheliUOA/mechanistic‑tool‑use‑llm.
Authors:Zhenyu Lei, Chenghao Liu, Yushun Dong, Qi R. Wang, Jundong Li
Abstract:
Spatial‑temporal (ST) forecasting underpins many real‑world systems such as traffic, climate, and energy networks. While existing methods implicitly assume strong spatiotemporal coupling, we observe that real‑world ST data exhibits distinct coupling regimes, ranging from temporal‑dominated and spatial‑dominated to strongly coupled patterns. This mismatch causes current models to suffer from spurious dependencies and degraded performance when one correlation dominates. To overcome this limitation, we aim to dynamically modulate spatial and temporal modeling based on the data's inherent coupling structure. However, three key challenges exist: unknown coupling structure, heterogeneous coupling dynamics, and suboptimal spatial modeling. We propose AdaST, an adaptive ST forecasting framework that tackles these challenges through a decompose‑recompose paradigm. AdaST factorizes inputs into components capturing different coupling patterns using heterogeneity‑aware experts. Each component is processed by role‑aligned modules, and a correlation‑informed adaptive recomposer integrates them for final prediction. Extensive experiments confirm that AdaST significantly outperforms state‑of‑the‑art baselines, validating the necessity of an adaptive approach.
Authors:Yishu Li, Liyuan Geng, Xinyi Mao, Amber Li, David Held
Abstract:
While pretrained robotic policies exhibit impressive capabilities in controlled environments, unobserved physical properties and dynamics require these policies to rapidly adapt during deployment. Existing test‑time adaptation methods typically rely on sparse scalar rewards, failing to exploit the rich geometric and dynamic feedback from the environment during physical interaction. To address this challenge, we propose SCOUT, a dynamics‑aware meta‑learning framework that enables manipulation policies to rapidly adapt by continuously revising their internal beliefs about environment dynamics. Our approach couples an action‑prediction policy with a forward dynamics model via a shared belief latent space. During meta‑training, an inner loop updates this shared belief latent by minimizing the dynamics prediction error against the observed action outcome, while the outer loop optimizes the network for action selection. At deployment, this structure allows the agent to infer and adapt to unknown physical dynamics on the fly. By updating its latent belief based on action‑outcome mismatches, the policy automatically adapts without risking catastrophic forgetting. We demonstrate that SCOUT significantly accelerates online adaptation across simulated manipulation benchmarks and achieves robust sim‑to‑real transfer in the real world. Project webiste can be found here: https://liy1shu.github.io/SCOUT/
Authors:Cheng Chang, Yining Mao, Peng Qi
Abstract:
Language models are frequently employed to evaluate other language models. An LM evaluator scoring agentic behaviors across multiple criteria is valuable, provided that its decisions align with human judgment. We call the problem of evaluating this alignment Meta‑Evaluation. Tackling it directly is difficult: collecting human data is expensive, absolute scoring is hard to align, and using an LM meta‑evaluator recurses the question of trustworthiness. We adopt a reformulation of meta‑evaluation as a preference judgment problem: rather than comparing human and LM evaluator scores of a trajectory, we ask whether their implied preferences align. Building on this, we introduce PADMÉ, a data synthesis method that generates reliable criterion‑based meta‑evaluation data for agentic settings. PADMÉ uses only small language models, requires no human involvement during evaluations, and operates under a low computational budget. We build a prototype of PADMÉ and synthesize a dataset of 1,000 samples across four agentic domains and three evaluation criteria. Human validation on a 150‑sample subset demonstrates that PADMÉ improves agreement with human judgment from 73% to 85% over a naive baseline. Meta‑evaluating 25 common models with our dataset demonstrates the correlations between evaluation performance and scoring granularity, leniency, and model size, among other factors.
Authors:Ethan D. Frakes, Amy Kvien, Rishabh Kundu, Redad Mehdi, Van D. Tran, Vibha S. Mandayam, Kristopher O. Davis, Erika I. Barcelos, Roger H. French, Yinghui Wu, Mengjie Li
Abstract:
We introduce GeoOutageBench, a benchmark for assessing LLM‑based geospatiotemporal KGQA for multimodal outage and resilience analysis. Unlike existing KGQA benchmarks for Web knowledge, GeoOutageBench considers a spatiotemporal KG that integrates visual, textual, and structured data from outage records, remote sensing, weather observations, storm and power events, geographic entities, and domain ontologies. It provides a competency query taxonomy at different difficulty levels from spatiotemporal containment and proximity, spatiotemporal co‑occurrence analysis, multimodal evidence, to hypothetical evaluation. Over multimodal KG and query classes, GeoOutageBench provides user‑configurable evaluation of three important, highly coherent yet less studied tasks: (1) LLMs' understanding for ambiguous geospatiotemporal questions in terms of NL to SPARQL interpretation, (2) query‑driven assessment of ontology utility, and (3) answer accuracy of multimodal KGQA retrieval. GeoOutageBench provides a design principle and foundation for assessing LLM‑KG systems that support real‑world infrastructure resilience analysis. Our benchmark, source code, data, results, and other documentation are available at https://github.com/UCF‑SAGE/GeoOutageBench.
Authors:Tongtong Feng, Xin Wang, Haoran Hou, Ren Wang, Weiran Wang, Shaokai Zhu, Ziqi Jia, Hao Wang, Yu-Wei Zhan, Zongyuan Wu, Jinghao Cui, Wenwu Zhu
Abstract:
Open‑world aerial object‑goal search is a foundational yet challenging task, requiring aerial agents to autonomously explore large‑scale, unstructured three‑dimensional environments and reach target objects specified by semantic descriptions or reference images, rather than following route‑specific instructions. However, research in this task remains at a nascent stage and relies on small, environment‑specific benchmarks with heterogeneous action spaces and data formats. These limitations hinder large‑scale training and cross‑benchmark evaluation, constraining the scalability and generalizability of aerial agents. To address this problem, we propose AerialDojo‑200K, a large‑scale benchmark suite for open‑world aerial object‑goal search, with 3 times as many scenes and 18.7 times as many task instances as the largest existing benchmark for this task. Specifically, we construct 42 simulation scenes spanning four scene families and 21 scene types, including 18 urban, 12 natural, six infrastructure, and six disaster scenes. To ensure data quality, 12 annotators spent two months manually annotating 109 landmarks, 2099 target objects, and 2099 object anchors across these scenes. We further construct 205,732 task instances, comprising over 100K semantic‑goal and over 100K image‑goal instances across Base, Standard, and Long‑Horizon settings. Each task instance includes a collision‑free reference trajectory and corresponding multi‑view video recordings. We also develop a unified evaluation framework with a scene partition comprising 21 in‑distribution scenes and 21 out‑of‑distribution scenes. Finally, our evaluation of five open‑source and four closed‑source multimodal large language models reveals that there is still a long way to go toward achieving general‑purpose aerial agents. All can be found at https://fengtt42.github.io/AerialDojo/.
Authors:Sahand Rezaei-Shoshtari, Patryk Wozniczka, Shu Ishida, Gregg Streuber, Farnoosh Javadi, Jeffrey Landes, Angela Ju, Muhammad Azam, Bryan Lim, Johan Luttun, Indrajeet Haldar, Jonathan Shaw, Beatriz Guerra, Ivan Sosnovik, James Stoddart, Robert Giaquinto, Adam Gaier
Abstract:
Foundation models are powerful generators, but many engineering domains require structured representations that general‑purpose systems handle poorly. We introduce FLOORA (Floor Layout Optimization with RL Alignment), a family of small domain‑specific language (DSL) models for architectural layout generation. With specialized data and alignment, our 0.6B model outperforms much larger frontier models, achieving VLM judge win rates up to 92.0% on out‑of‑distribution real‑world buildings and 96.0% on synthetic buildings. Human evaluations further corroborate these results, with FLOORA selected as the best model in 89.3% of evaluations. FLOORA combines a token‑efficient DSL, custom tokenization, domain‑specific pretraining, supervised fine‑tuning (SFT), and reinforcement learning (RL) with learned human‑preference and verifiable rewards. This pipeline improves architectural and geometric validity, supported by extensive empirical evaluation and ablation studies. Although focused on architecture, our results suggest that similar domain‑specific recipes may be useful in other engineering domains with structured, verifiable outputs. Datasets, models, and inference code are available at https://github.com/AutodeskAILab/floora.
Authors:Fatemeh Askari, Mazdak Teymourian, Mohammad Izadi, Mahdieh Soleymani Baghshah
Abstract:
Neural Combinatorial Optimization (NCO) has achieved strong empirical success, yet the internal mechanisms driving model decisions remain largely unexplored. In this paper, we investigate three representative autoregressive NCO models spanning two encoder‑decoder configurations: AM and POMO (heavy‑encoder, light‑decoder), and LEHD (light‑encoder, heavy‑decoder). Through behavioral analyses, representation probing, and causal interventions, we examine how these models construct solutions and use internal representations during decoding. Our results suggest that AM and POMO predominantly follow a persistent geometric pattern throughout solution construction, whereas LEHD contains linearly accessible information about multiple future actions. Causal experiments further provide evidence for the role of future‑node representations in LEHD's decision‑making. We also observe that LEHD relies strongly on the current‑node representation for immediate local decisions, while the start‑node representation plays a broader navigational role over the subsequent route. Cross‑instance alignment analyses additionally indicate that LEHD maps current‑node representations into a relatively shared latent region, which may provide a stable reference for evaluating subsequent decisions. Across the Traveling Salesman Problem and the Capacitated Vehicle Routing Problem, these results reveal distinct decision‑making patterns across these architecturally distinct solvers and provide a foundation for more interpretable analyses of NCO solvers. Code and additional visualizations are provided in the https://github.com/NCO‑Interpretability/NCO‑Interpretability.
Authors:Guangren Wang
Abstract:
Long‑term memory lets an LLM assistant use a history it can no longer reread, and most memory systems build it by rewriting conversations into facts, graphs or typed memories at write time. We argue that the work of memory divides, as thinking does, into two systems. Most of it is fast System 1 work: many small, independent yes/no judgments about records, such as whether a record is needed or no longer current, which a decision model makes by the dozen in a third of a second. Only a little is slow System 2 work: writing a few search queries, naming what the reply needs and composing the answer, which an LLM does well but slowly. We present Mnemon, a memory agent built on this division. It keeps conversations as raw, dated records; an LLM (System 2) plans searches over them, a decision model, Jev (System 1), judges what the searches return, and rules with explicit budgets turn the judgments into a small View for an unchanged answering model. A background pass consolidates each record once into topic timelines, value histories and standing instructions linked to the records, so that questions about a whole conversation reach evidence their own searches miss. Because nothing is decided about a record when it is written, the same agent can read any store that returns dated records. With gpt‑4.1‑mini answering, as in a public re‑evaluation of 14 systems, Mnemon scores 91.7% on LoCoMo, the highest among them, and 83.8% on LongMemEval‑S, from under 4k tokens of context per question, with the lowest effective cost index on LoCoMo. With a reasoning model answering, it reaches 92.2% on LoCoMo and 94.4% on LongMemEval‑S, the latter on par with the best published results. From 100K to 10M tokens of history on BEAM, its cost per question grows by a factor of 1.11. On the same records, Jev separates gold evidence better than two LLMs and is 3‑11 times faster.
Authors:Jiada Li
Abstract:
D‑peptides combine protease resistance with high target specificity, but computational design of D‑peptide binders remains immature. Mirror‑Peptidizer introduced an in silico mirror‑image screening pipeline using target reflection, backbone generation, and ProteinMPNN sequence design, but its raw ProteinMPNN negative log‑likelihood (NLL) ranking was not validated against measured affinities, and only 4 of 9 tested MDM2 designs bound detectably. We introduce Mirror‑Score, a calibrated, inference‑only scoring framework for heterochiral D‑peptide/L‑protein complexes, and a public benchmark of 31 crystal complexes across four target families, including 18 with literature‑verified affinities. Raw ProteinMPNN NLL is not a valid affinity ranker: its pooled Spearman correlation with affinity is 0.19, and correlations reverse between MDM2/CHIP (+0.62) and gp41 (‑0.70). We therefore evaluate Boltz‑2 mirror‑space cofolding confidence. For the complete viral‑entry family (7 structures representing 3 peptides), interface predicted local distance difference test (pLDDT) achieves structure‑level leave‑one‑out Spearman rho = 0.90 (p = 0.006) and correctly orders all three peptides by affinity, whereas NLL fails (structure‑level rho = 0.18). Because only three independent chemotypes are represented, this result indicates directional consistency rather than a statistically validated predictor. Cross‑family calibration does not transfer at current sample sizes, supporting family‑matched calibration as the practical deployment mode. We also specify a prospective design protocol for the antimicrobial‑resistance targets LasR and LecB from Pseudomonas aeruginosa, including mirrored structures, ligand‑derived hotspot maps, diffusion‑model‑ready inputs, and Mirror‑Score ranking. Code, benchmark data, structures, and analysis scripts are openly available at https://github.com/Jiadalee/Mirror‑Score.
Authors:Shaoxiang Qin, Yucheng Zhao, Fuyuan Lyu, Di Zhou, Jiachen Yao, Xue Liu, Anima Anandkumar, Liangzhu Leon Wang, Xiongye Xiao
Abstract:
In urban low‑altitude flight, buildings reshape ambient wind into spatially varying 3D flow, making unmanned aerial vehicle (UAV) energy depend on local wind exposure as well as path length. However, building‑resolved wind information is rarely available when a mission must be planned. Computational fluid dynamics (CFD) can produce high‑fidelity urban flow fields, but each simulation is tied to a fixed inflow boundary condition and can take hours to days, which is incompatible with urban UAV missions that typically last minutes to tens of minutes. We present GeoWind2Plan, a geometry‑to‑wind‑to‑planning framework for mission‑time 3D urban wind prediction and energy‑efficient UAV planning. Given only a background wind vector, 3D building geometry, and a start‑goal pair, GeoWind2Plan transforms the building geometry into a reference‑wind frame, predicts mission‑relevant 3D wind patches with a localized geometry‑conditioned neural operator, stitches them into a queryable local wind field, and optimizes a feasible 3D path and speed profile using a physically grounded UAV energy model. Rather than pursuing CFD‑perfect reconstruction, GeoWind2Plan targets decision‑useful wind prediction: trajectories are planned with predicted wind and evaluated under high‑fidelity CFD wind. Across held‑out urban domains, wind speeds, and mission wind‑angle regimes, GeoWind2Plan performs corridor‑localized wind inference in about 3 seconds, compared with roughly 8 hours for CFD. Under CFD evaluation, trajectories planned with GeoWind2Plan reduce energy by 6.9%, 12.7%, and 4.5% in tailwind, headwind, and crosswind missions relative to wind‑agnostic planning, recovering 87.9%, 85.7%, and 75.0% of CFD‑reference savings. These results show that fast, corridor‑localized 3D urban wind prediction can make wind‑aware UAV energy planning practical at mission time.
Authors:Zhanhua Pan, Xiao Liu, Zhilong Cao, Jianhong Wang, Dawei Qiu
Abstract:
Power system operation is a safety‑critical sequential decision‑making problem, making it a natural testbed for reinforcement learning (RL). However, existing RL environments for power systems are often narrow in scope and computationally limited by CPU‑based simulation workflows, making large‑scale evaluation difficult. We introduce PowerZooJax, a JAX‑based benchmark suite for RL in power system operation. It provides five constrained Markov decision process tasks spanning generation, transmission, distribution, distributed energy resources, and data center microgrid. By rewriting power flow, economic dispatch, market clearing, and device dynamics as JAX computation graphs, PowerZooJax keeps the entire training and evaluation loop on the GPU. Experiments show substantial speedups over CPU‑based simulations and demonstrate standardized evaluation of policy returns, safety violations, and out‑of‑distribution stress conditions. Our open‑source benchmark is available at: https://github.com/powerzoojax/PowerZooJax.
Authors:Sean Benevedes, Mani Dehghan, Aishik Ghosh, Tae Hyoun Park
Abstract:
We develop two hybrid techniques that approach the performance of neural simulation‑based inference (NSBI) analyses while substantially reducing the computational cost of inference and preserving some or all of the reliability guarantees of parametric methods. The first approach is broadly applicable, while the second is tailored to a class of particle physics analyses that admit a semi‑parametric NSBI formulation. With only a modest compromise in raw sensitivity, these methods represent an important step toward computationally efficient NSBI in offline analyses and also open the door to the exploration of trigger‑level applications in the future. Based on our comparison studies, we recommend the use of our first approach, Latent Categories, for robust and efficient inference.
Authors:Shuzhao Xie, Lelin Wang, Guying Lin, Zhi Wang, Minchen Li
Abstract:
Reconstructing simulation‑ready 3D scenes from real‑world observations enables robotics, gaming, and immersive applications, yet existing methods largely assume rigid objects. This leaves an important gap for deformables, whose simulation‑ready geometry depends on dimensionality (curves, surfaces, or volumes) and whose behavior may require models beyond elasticity. We present CoDimRecon, an agentic framework that reconstructs editable scenes containing rigid, articulated, and deformable objects from multi‑view RGB observations. Scene‑level geometric priors ground scale and layout, while object‑level generated meshes guide the agent toward detailed, compact geometry; articulated rigid objects are decomposed into movable parts with explicit joints. For deformables, category‑wise agent sessions reconstruct curves as centerlines with radii, surfaces as manifold shells with thickness, and volumes as watertight solids for volumetric meshing. Reusable simulator skills initialize compatible physical models and parameters, while agent‑guided behavioral tests expose mismatches and trigger targeted revisions of motion, geometry, numerics, or material modeling. On evaluated Replica and ScanNet++ scenes, CoDimRecon achieves competitive compositional reconstruction accuracy while additionally producing deformable assets for rod, shell, and solid simulation. We further demonstrate robot interactions across all three representations, including a controlled paper‑folding case in which behavioral testing motivates plastic bending.
Authors:Chong Wang, Zixuan Fu, Shiqi Huang, Siyuan Yang, Hao Cheng, Bihan Wen
Abstract:
Pixel‑space diffusion Transformers (DiTs) directly operate on high‑dimensional visual data, yet their hidden representations typically undergo uniform refinement across depth. Natural images, however, are inherently organized at different levels of granularity. Global structure can often be represented compactly, whereas local textures and fine details require richer representations. Motivated by this, we introduce heterogeneous refinement in pixel‑space DiTs, assigning different feature groups distinct refinement budgets across depth. Consequently, an ordered feature specialization emerges: sparsely refined features predominantly encode global visual structure, whereas more frequently refined features increasingly specialize toward localized, high‑frequency details. We refer to these two groups as persistent and active features, respectively. Building on this emergent specialization, we introduce Persistence Forcing (PerF), which explicitly exploits this persistent‑‑active feature organization for pixel‑space image generation. This enables persistent features to continuously condition actively refined features, allowing stable global information to guide the ongoing refinement of finer visual details. During generative sampling, this interaction further induces a meaningful guidance direction that promotes coherent global structure and naturally complements classifier‑free guidance. On ImageNet 256×256, PerF‑L achieves FID of 1.91, approaching 1.86 of JiT‑H with only half the parameters, while PerF‑H further achieves FID of 1.63 and 1.76 on ImageNet 256×256 and 512×512, respectively.
Authors:Haojian Huang, Zexi Li, Junhao Guo, Yehang Zhang, Wenxuan Peng, Bohan Zhou, Weilin Ruan, Leyi Wu, Chenxu Wang, Jianchong Su, Binghui Xie, Wosong Chen, Yingjie Xu, Tianhao Zhou, Suzeyu Chen, Pukun Zhao, Jiaqi He, Xinyi Li, Runze Li, Peiran Dong, Shaoxiang Dang, Jing Huang, Yingbing Chen, Yifan Chang, Tianyi Zhang, Shiyuan Deng, Haozhi Wang, Yangkai Wei, Wenqian Li, Han Yang, Kaiwen Zhou, Huaping Liu, James Cheng, Rui Shao, Donglin Wang, Yaochu Jin, Jianye Hao, Ying-Cong Chen, Yinchuan Li
Abstract:
General‑purpose robots must infer what a new task requires and translate that understanding into appropriate physical action. In‑context learning (ICL) for robots supports this process by using demonstrations and interaction to direct existing competence with neural parameters held fixed during deployment. We organize this literature review around the interfaces connecting contextual evidence to execution, distinguishing four families: context‑conditioned policies, geometric demonstration transfer, world‑model‑based control, and skill‑ and agent‑based execution. Comparing these interfaces clarifies their transfer assumptions and the roles of training, correspondence, and memory in making context useful. Across manipulation and navigation, we examine how these mechanisms preserve taught requirements as objects, environments, and execution conditions change. This analysis links method design to evaluation practices that distinguish responsiveness to teaching, physical transfer, and benefits from retained experience. The resulting agenda connects compositional task acquisition and faithful transfer with physical recursive self‑improvement, in which experience improves the ability to learn subsequent tasks.
Authors:Rafael Garcia-Dias, Alexandre Triay Bagur, Chayanin Tangwiriyasakul, Virginia Fernandez, Parhom Esmaeili, Piyalitt Ittichaiwong, Yang Li, Lawrence Adams, Wason Buncharoen, Martin Chapman, Benjamaporn Chayanond, Sadthavud Chunrod, Tanawat Fongsri, Kass Gibson, Supat Plungprasertkul, Supawit Tangpanithandee, Kanyakorn Veerakanjana, Vicky Goh, Michela Antonelli, Joe Zhang, Kongkiat Kespechara, Sebastien Ourselin, M. Jorge Cardoso
Abstract:
Federated learning (FL) in healthcare remains challenging, as the overhead of rebuilding governance guarantees for every collaboration stops most projects at the proof‑of‑concept stage. Here we present FLIP (Federated Learning Interoperability Platform), an open‑source, multi‑application platform that makes FL training and evaluation repeatable. FLIP implements common FL workflows as a set of composable services: cohort queries against per‑site structured databases, on‑demand DICOM retrieval from institutional PACS, per‑site project approval, and reusable FL job types. To demonstrate FLIP, we ran two distinct use cases, federated fine‑tuning and federated evaluation, on synthetic chest X‑ray cohorts across two client nodes based in the United Kingdom (UK) and Thailand. In FLIP, each institution independently approves its participation in each project and operates its own node under local IT security processes. This study makes an operational rather than an algorithmic claim. It does not compare federated with centralised training; for that question, we refer the reader to existing systematic reviews and meta‑analyses. The central result is evidence that such platforms enable international FL collaboration and improve repeatability, auditability, and site‑specific governance. We also present a comprehensive comparison of existing platforms to help researchers and operators choose the right platform for their use case.
Authors:Yunzhe Xu, Zhe Liu
Abstract:
Vision‑and‑Language Navigation (VLN) has largely focused on a single agent following a single instruction, yet many real‑world applications require teams of robots to tackle tasks beyond the capabilities of any individual agent. We present Systematic Multi‑Agent Vision‑and‑Language Navigation, providing, to our knowledge, the first systematic formalization of multi‑agent VLN as a constrained coordination problem: each mission consists of subtasks carrying dependency and resource constraints (presence locks and holding chains). A verified four‑stage crafting pipeline instantiates the task as MAVLN, comprising 11,724 episodes across 145 scenes with teams of up to four agents under three instruction regimes, accompanied by tailored constraint‑aware metrics. We further present TRISS, a coordination‑ready navigation system coupling an LLM‑based subtask scheduler, a shared topological memory that turns each agent's exploration into team knowledge, and a conflict‑aware execution mechanism that realizes simultaneous intentions as collision‑free routes. Extensive experiments establish TRISS as a comprehensive baseline and reveal substantial room for improvement across scheduling, planning, and execution, highlighting the challenges of coordinating under MAVLN task constraints. Project page: https://xyz9911.github.io/mavln.
Authors:Eliott Morgensztern, Cesar Fierro Cota, Alessandro Mininno
Abstract:
We introduce Solver Agent, an AI framework based on large language models for calculations and proofs in mathematics and theoretical physics. The solution process is tracked through a persistent ledger that records assumptions, derivations, and computations. A central agent delegates tasks to specialized sub‑agents, while independent agents verify both intermediate steps and the final result. This setup improves the traceability, reproducibility, and verification of computer‑assisted calculations. Applying Solver Agent, we study global F‑theory uplifts of Type IIB orientifolds and their S‑fold generalizations. We establish sufficient conditions for Weierstrass models over projective threefolds with terminal \mathbbZ_k quotient singularities (k\in\2,3,4,6\) to give \mathbbQ‑factorial projective elliptically fibered Calabi‑Yau fourfolds with isolated Gorenstein terminal quotient singularities. These geometries realize O3‑planes and S‑folds, where local D3‑brane probes of the latter yield four‑dimensional \mathcalN=3 superconformal field theories. Using stringy invariants, we derive fixed‑point contributions to Hodge data and Euler characteristics, and show that these Euler corrections determine the localized D3‑brane charges required for tadpole cancellation. We illustrate these results using toric hypersurface constructions, where a single three‑dimensional polytope determines both the Type IIB Calabi‑Yau threefold and the F‑theory base; here, the orientifold double cover naturally forms a bisection of an alternative genus‑one‑fibered uplift with discrete \mathbbZ_2 gauge symmetry. Finally, we provide methods for toric computations and four‑form flux analysis in four‑dimensional \mathcalN=1 compactifications with non‑abelian gauge sectors.
Authors:Di Wen, Wenhao Guo, Yuedong Tan, Yun Huang, Minheng Wu, Zhihang Chen, Haiwen Sun, Fei Teng, Zhiyuan Gao, Yufeng Zhang, Yuanhao Luo, Jingqi Zhang, Yufan Chen, Junwei Zheng, Ruiping Liu, Jiale Wei, Kailun Yang, Kunyu Peng
Abstract:
Understanding human‑entity interactions requires recovering each person‑action event's participants, roles, and shared identities. This structure can support embodied agents by clarifying who acts on which entities and how, informing anticipation and coordination in shared environments. Standard HOI metrics score individual links, leaving complete event composition undermeasured. We introduce HEIR (Human‑Entity Interactions with Functional Roles), an image benchmark for complete grounded participant‑role sets across object, interpersonal, and self‑directed interactions. It contains 18,730 images, six roles, 105 actions, and 437 nouns, with shared entities, role changes, and repeated fillers; 51.6% of images contain multiple actors and 62.1% contain multiple actions. HEIR pairs relation AP with complete‑set AP and structural evaluation. We also introduce CoRISP (Compositional Role‑aware Interaction Set Prediction), which uses shared entity identities to combine role‑conditioned evidence and predict normalized participant‑role sets. Cardinality and role‑multiplicity potentials couple assignments through event size and role composition, with exact per‑event normalization. Across 16 baselines, relation and complete‑event rankings diverge even after aligning action weights. CoRISP leads the evaluated systems on repeated‑role events and shared‑participant images in HEIR by 2.87 and 3.82 Set mAP points, respectively. On V‑COCO, CoRISP achieves 73.72/76.23 role AP and 61.06/68.59 complete‑set AP on two‑slot actions under Scenarios 1/2. These results show the value of learning and evaluating event composition alongside individual relations. The code and dataset are publicly available at https://github.com/Kratos‑Wen/HEIR.
Authors:Yan Zhan, Yunze Song, Mengkai Hou, Wanting Zhang, Shaobo Liu, Zhijun Gao
Abstract:
Prompt injection against LLM agents becomes much stronger when the injected instruction is wrapped in the model's own chat template. A forged template marker such as <|im_start|> can reach the model either as a single reserved control token or as a sequence of ordinary subword tokens. The two decode to exactly the same text, and because tokenization runs on the server, the defender rather than the attacker decides which one the model receives. We use this to measure how much of the injected instruction's authority comes from the reserved token's learned representation. Encoding the forged markers as subwords, with the text held fixed and a control for the extra tokens this adds, lowers attack success on the InjecAgent benchmark by 39 to 66 percentage points on three of four open‑weight families, and the gap carries over to multi‑turn agent tasks in AgentDojo. On Qwen3‑8B the gap is 8 points, because without reserved ids the model still recognises the forged turn from its text by reasoning; suppressing the reasoning block widens the gap to 50. The authority sits in the single learned vector at the marker position: the mean of the marker's subword vectors does not reproduce it, the vector of the nearest ordinary token restores the attack on Llama‑3.1, and an adaptive attacker who searches for non‑reserved markers finds such embedding neighbours on three of four families. In every base and instruction‑tuned pair we test, instruction tuning strengthens the model's preference for reserved markers. The standard mitigation, a tokenizer option that encodes special tokens as ordinary subwords, applies only to tokens a configuration declares special, so in 33 of 67 distinct tokenizer configurations, covering 255 of the 400 most‑downloaded chat models on Hugging Face, it leaves intact the tool‑protocol tokens through which agents read untrusted tool output, and the gap persists on that channel.
Authors:Onisa Mpaunda
Abstract:
Time series classification (TSC) exhibits a sharp trade‑off between accuracy and computational scalability. Meta‑ensembles like HIVE‑COTE 2.0 reach state‑of‑the‑art accuracy but require extensive compute, whereas ultra‑fast random convolutional transforms (e.g., MiniRocket, Hydra) run in seconds but struggle with phase‑independent distributions, signal kinematics, and decision tree fragmentation on large class counts. In this work, we present CADENCE (Confidence‑Adaptive Dual‑Expert Network for time series Classification Excellence), a unified, CPU‑native dual‑expert architecture. CADENCE decouples representation learning into two specialized pathways: (i) a Convolutional Linear Expert pairing 10,000 deterministic dilated features with closed‑form L2‑regularized Woodbury ridge classification, and (ii) a Distributional Interval Expert pairing competing dilated kernels (Hydra) with dyadic Cornish‑Fisher moment approximations across signal kinematics and FFT spectral bands, fitted with an ExtraTrees ensemble. An internal validation meta‑router with rare‑class preservation dynamically selects between pure expert routing and confidence‑weighted soft blending, followed by a full refit on 100% of training data. Evaluated across all 109 equal‑length UCR Archive datasets over 30 resamples (3,270 total runs), CADENCE achieves a grand mean accuracy of 0.8864. This ranks #2 across the archive, surpassed only by HIVE‑COTE 2.0 (0.8895, p_Holm = 0.295, no statistically significant difference), while outperforming Hydra+MultiRocket (0.8818), MultiRocket (0.8797), and HIVE‑COTE 1.0 (0.8786, p_Holm = 0.048). CADENCE closes the gap to HIVE‑COTE 2.0 to 0.31 percentage points while taking an average of only 17.53 seconds per dataset on a dual‑core CPU. Source code and evaluation scripts: https://github.com/onisa‑jr/CADENCE.git
Authors:Bhavik Mangla
Abstract:
A voice agent can handle almost every call on the words alone and still fail the few its sector's rules were written for. Emergency‑call standards, fraud guidance, radio phraseology and vulnerability rules recognise that how a caller sounds, or what else is audible, can change the right action. VoxParity tests whether agents act on it. In 183 scenarios from 14 sectors, one transcript stays fixed while the audio changes (a coaching voice, a medical monitor beeping, a mayday under a radio check, noise over a drug name, a child's voice placing a bet, a frightened whisper), and with it the correct typed tool call. A words‑only null test credits a system only if hearing the call moves its actions more than it moves a pipeline that only reads the words. Only 11 of the 23 systems that can also be run on the transcript pass. Descriptively, errors run toward the words: when the audio calls for protection, all 28 systems carry out the routine request more often than they over‑react on clean calls (41% against 12% pooled; the words‑only pipeline, 58% against 15%). Exploratory analyses place most of the leading systems' misses on cues they heard; systems beat the null almost entirely on items that state the rule; the leading systems overrule heard resignation or confusion far more often than acute alarm; and, in the models tested, describing the voice and stating the rule each recover part of the shortfall, leaving a gap on emotion.
Authors:Maurya Patel
Abstract:
Graph neural networks are increasingly applied to road‑level crash prediction, but the stability of their reported gains has received little scrutiny. We independently reconstruct the data pipeline of a recent uncertainty‑aware model and evaluate eleven of its design decisions across three London boroughs under an expanding‑window protocol. Four survive replication on a second borough; seven do not, and four of those reverse sign rather than attenuate. Multi‑seed evaluation is decisive: one effect reverses sign between random seeds within a single borough, and the reference architecture exhibits per‑borough seed spreads of up to 35.7 points against 4 points for ours. We further compare both networks against a parameter‑free baseline that ranks segments by cumulative past crash count. At matched history depth our model is statistically indistinguishable from that baseline (‑0.90 points, p=0.61), and the reference architecture loses to it on 18 of 18 held‑out windows (‑17.37, p<10^‑6). Sweeping the baseline's lookback horizon shows it spans 22.71% to 83.94% accuracy on that variable alone, and that every published figure in this line of work is matched by the baseline at a horizon of one to five years. We argue that the apparent margin of graph networks over historical baselines in this task is substantially an artefact of the short horizons those baselines were computed over, and recommend horizon‑matched baselines and multi‑seed reporting as minimum practice.
Authors:Lingqi Jiang, Jialuo Chen, Jianan Ma, Xinhao Deng, Xiaohu Du, Sibo Yi, Yuqi Qing, Zhenguang Liu, Qinming He, Shiwen Cui, Changhua Men
Abstract:
Agent skills are shareable packages of procedural instructions, tools, and examples. Multimodal skills additionally include visual references that agents retrieve and inspect during execution. Because these images guide actions, attackers can disguise malicious instructions as ordinary visual guidance within otherwise legitimate skills. Existing skill‑security research primarily examines text‑carried attacks or scanner detection, leaving the runtime effects of image‑borne attacks insufficiently evaluated. We introduce MMSkillRisk, to our knowledge the first publicly available benchmark dedicated to end‑to‑end safety evaluation of image‑borne attacks in multimodal skills. To instantiate this attack surface, we design Native‑Context Visual Attack (NCVA), which disguises malicious instructions as native components of teaching images, such as annotations and interface labels. The accompanying SKILL.md provides auxiliary guidance toward relevant visual regions without explicitly stating the malicious operation. Built from 28 curated clean skills, MMSkillRisk contains 36 attack packages and 108 executable cases spanning five attack objectives, with separate checks for attack success and legitimate‑task completion. Across nine model‑harness configurations evaluated in isolated sandboxes, NCVA induces unauthorized operations in every configuration. Its pooled attack success rate (ASR) reaches 43.1%, exceeding the matched text‑carrier baseline by 16.4 percentage points, with higher ASR in all nine configurations. Attack success and legitimate‑task completion co‑occur in 36.5% of cases, reaching 72.2% for GPT‑5.6‑sol with Codex. These results show that skill‑bundled images can induce unauthorized actions even as agents complete legitimate tasks, so task success alone does not establish safe skill use. Our code and data are available at https://github.com/kaill‑jlq/MMSkillRisk.
Authors:Zihan Zhang, Shuangjie Yao, Zesen Liu, Zhixiang Zhang, Wai Ip Lai, Dung Hiu Hilton Yeung, Chun Kit Zhang, Fuchen Ma, Yuanyuan Yuan, Yu Jiang, Dongdong She
Abstract:
Semantic caches reduce LLM serving costs by reusing previously generated answers for semantically similar queries. However, retrieval is based solely on embedding similarity between the incoming query and cached queries. This design enables cache poisoning: an attacker can cache a malicious response under a query with high cosine similarity to benign requests. The vulnerability stems from a gap between retrieval similarity and answer validity. From an information‑bottleneck perspective, query embeddings can lose information needed to distinguish valid from invalid cache hits, which limits any matching algorithm that uses only these embeddings. We propose a novel defense that recovers this necessary information from the raw text of the cache key. Across poisoning attacks, adversarial queries share a rewrite‑residual structure: they pair a rewrite of the target query with residual content. The rewrite maintains high similarity, while the residual elicits the malicious response. Deleting the residual makes the remaining rewrite more similar to the incoming query. We exploit this structure using Deletion Gain to search shortened variants of the cached query for similarity gains, and an Answer Check to test whether the removed text contributes to the stored answer. We prove that Deletion Gain stays positive when a deletion leaves text close enough to the rewrite, and we search for such deletions with a sliding window. Across three poisoning attack classes, our defense blocks 82.0% to 98.2% of poisoned entries at a 5% false‑positive rate, with negligible serving overhead.
Authors:Jinxiang Wang, Yifan Liu, Jing Tan, Xiangyu Zhao, Xin Yao, Xuetao Wei
Abstract:
Safety risks in conversations with adolescents are not always explicit. A request may appear harmless unless a model considers the user's age, circumstances, and earlier turns. Existing Chinese safety benchmarks mainly target general users and give limited attention to adolescent safety. Single‑turn tests also miss risks that emerge over several turns. QH‑Bench is a Chinese‑language benchmark for adolescent content safety, with scenarios grounded in Chinese social and cultural settings. The single‑turn track contains 715 test items organized into 10 risk domains, 50 subdomains, and 143 fine‑grained risk scenarios. The multi‑turn track contains 100 four‑turn trajectories in a balanced 10‑by‑10 design that combines the same ten domains with ten cross‑turn mechanisms. Both tracks use the same five‑level safety‑helpfulness scale and automatic judge, with track‑specific criteria. Evaluation of 13 open‑weight models identifies offline‑contact scenarios as a shared weakness. Every model receives negative scores on more than half of the items involving offline meetings with online contacts, unfamiliar groups, and adults. This includes InternLM2.5‑20B, the single‑turn leader; negative scores indicate responses that partially or clearly facilitate risk. GLM‑4‑32B, the multi‑turn leader, receives negative scores on 60% of complete trajectories in which users build relationships before invoking loyalty or confidentiality. These findings identify two priorities for the evaluated models: handling adolescent offline‑contact risks and maintaining safety boundaries under relational pressure. Leading aggregate scores do not establish that these specific weaknesses have been resolved.
Authors:Ankit Srivastava, Debjyoti Paul
Abstract:
AI agents now hold spend authority and settle payments without per‑action human confirmation. The resulting loss is often not a security failure: a counterparty with the correct domain, the correct settlement address and a genuinely delivered service can charge more than it should, and no check keyed on identity will see it. We present three artefacts for measuring and reducing that loss. First, a taxonomy of agentic commerce fraud that separates five observation levels (agent reasoning, wire, settlement rail, counterparty, principal) from the request‑level and history‑level evidence available at each, and records which levels can observe which attacks. Second, Agentic Commerce Bench (ACB), a benchmark of twenty fraud classes generated from production aggregates, 1,647 catalogued service operations and 1,068 settlements, of which six involve a counterparty that is exactly who it claims to be. Third, gordonguard, an open‑source detector stack and offline harness with which an operator can audit an agent configuration, replay hostile counterparties without an account, and run the same detectors inline. Calibrating to a stated false‑positive budget on clean training traffic gives a 6.5% clean flag rate, replicated across three independent generations, and leaves eight of twenty classes no better than chance. On the four classes a reasoning layer can observe, a widely used agent security scanner run over its jailbreak‑detection panel scores zero on all four, while correctly scoring 1.0 on a jailbreak supplied as a control. A measured median payment of 0.007 places a hard constraint on deployment: one human review costs 143 times the value of the payment it examines.
Authors:Mason Dana, Khandaker Mamun Ahmed
Abstract:
Epileptic seizure forecasting aims to provide actionable warnings before seizure onset, yet patient‑independent generalization and false‑alarm control remain major challenges. We propose a calibrated hybrid ensemble for EEG‑based seizure forecasting that combines five deep learning models and three classical machine learning models through a logistic regression stacking meta‑learner. The proposed pipeline integrates signal preprocessing, handcrafted feature extraction, class‑imbalance handling, probability calibration, and clinically motivated post‑processing. We evaluate the framework on CHB‑MIT using strict Leave‑One‑Patient‑Out (LOPO) cross‑validation, with threshold and post‑processing parameters selected only on held‑out meta data. On the filtered cohort, excluding patients with anomalous preictal rates below 1% or above 15%, the model achieves 74.2% seizure‑level sensitivity at 1.24 false alarms per hour, with an average warning time of 16.9 minutes. A test‑tuned oracle constrained to the target false‑alarm budget achieves 60.9% sensitivity at 0.951 false alarms per hour, highlighting the importance of reporting sensitivity together with realized false‑alarm rates. Our code is available at: https://github.com/DanaMason/IEEE‑CARS‑Hybrid‑Ensemble‑Learning‑for‑EEG‑Based‑Epileptic‑Seizure‑Forecasting
Authors:Ziyang Xu, Haitian Zhong, Hao Zhou, Hao Qin, Chenhan Jin, Te Qi, Shengze Xu, Tieyong Zeng
Abstract:
Automated generation of LLM harnesses promises to improve inference through task specialization. Yet additional answer coverage can arise from repeated execution of the same program, making specialization difficult to identify. We introduce a controlled evaluation that separates answer coverage, repeatable task advantages, and gains from pre‑execution selection. On 386 MATH‑500 tasks, we compare eight generated harnesses plus a baseline with nine byte‑identical baseline copies, using three executions per member. Identical programs yield 2.16 percentage points of repeat‑averaged oracle headroom. Generated programs exhibit substantially more repeatable score patterns, but these chiefly reveal persistent weaknesses: losses relative to the baseline persist across all three repeats on 100 tasks, while persistent wins occur on only one task and are sensitive to answer extraction. The frozen selector gains 0.00 percentage points, and both populations reach 98.70% oracle coverage at 27 harness executions. Stable complementarity remains unresolved at three repeats. Supporting BIRD traces locate failures in mechanism implementation, activation, and output validity. Together, these findings establish why coverage and repeatability alone cannot justify claims of useful specialization. They motivate an evaluation standard for harness diversity: task advantages should persist across executions, guide usable decisions, and improve on additional fixed‑program executions under matched inference budgets.
Authors:Yida Lin
Abstract:
Single‑token typed‑decision models answer a schema question by reading the logits of a few one‑letter answer codes at a single position: they are fast and return a probability for every allowed answer, but they are trained with plain cross‑entropy that ignores most of the structure in their training data. We study such a model whose data is curated as contrastive pairs‑‑‑two contexts that differ in one edited fact that flips the answer‑‑‑each carrying a machine‑checked certificate that deleting the decisive sentence makes the fact unknown. We propose PACT, which turns this structure into four training terms that need no new annotation: a difference‑in‑differences margin over each pair that is invariant to any shared logit offset, a permutation‑consistency term against answer‑code position bias, an evidence‑necessity term on certificate‑verified ablated contexts, and an ordinal transport cost for rubric fields, plus a three‑parameter contextual temperature. On a frozen 324‑item holdout with three seeds, PACT matches the published recipe in accuracy (84.6% vs. 85.2%; McNemar p \ge 0.50 at every seed) while giving the lowest position bias of all runs (answer flips under relabelling 9.8% vs. 13.8%) and the lowest ordinal error on rubric fields (MAE 0.232 vs. 0.311). Against a control with the same optimiser and schedule but cross‑entropy only, PACT is significantly more accurate at two of three seeds, halves the seed‑to‑seed spread and lowers NLL by 26%. Seed‑matched ablations and pre‑specified falsification tests locate these gains precisely: no single term raises raw accuracy, and the method's value lies in robustness and stability rather than headline accuracy. Code, data splits, trained adapters, and all run records are available at https://github.com/BennyLinntu/PACT‑Pairwise‑Anchored‑Calibrated‑Tuning‑for‑Single‑Token‑Typed‑Decisions.
Authors:Samet Hicsonmez, Nermin Samet, Renaud Marlet
Abstract:
In the field of Machine Learning, many papers contain empirical results supporting claimed statements or illustrating the performance of a proposed method. However, most practitioners know that (1) results are generally hard to reproduce, and increasingly so, (2) code is not often available to do so, and (3) it hinders the development of research. In this position paper, we analyze and quantify these issues, and make concrete proposals to improve result checkability, if not reproducibility. Code and supporting materials are available at https://github.com/giddyyupp/position‑enforce‑verifiability.
Authors:Tiexin Ding
Abstract:
Pooled statistics of Transformer weights obscure how magnitude is distributed across functional channels, while individual weights are too numerous to compare directly. We study the mesoscopic level between them: row and column scale fields, the median‑centred log‑RMS profiles of a weight matrix over its channels, which together with a global scale and a full balanced core represent the matrix exactly. Across public Pythia checkpoints at four sizes and controlled runs from three initialization families, balancing reveals similar measured core magnitude profiles. A mixture bridge, with its form fixed before the analysis and its coefficients fitted, predicts the pooled‑shape departure from field width on held‑out runs and data arms of the controlled grid. The indexed fields retain further structure: they align across projections that share a functional channel, and query/key profiles follow reassigned RoPE frequencies rather than fixed matrix coordinates. Training trajectories show early field formation followed by component‑dependent broadening or recession. Extending the channel‑based analysis to AdamW's second moment reveals related functional organization in its log‑space row and column factors. Finally, edits of a frozen checkpoint separate reciprocal scale balance, which preserves the forward computation, from relative channel gain: flattening the gain increases in‑distribution loss while preserving matrix norms and the balanced core. Row and column scale fields thus connect pooled magnitude statistics to channel organization and provide coordinates for tracking and testing trained weight structure.
Authors:Ian Arawjo
Abstract:
Researchers across academia increasingly base significance claims on LLM judge scores and small‑sample AI evaluations. Yet without well‑calibrated confidence intervals (CIs), hypothesis tests, and judge‑bias corrections, such claims are unreliable. We address these issues in several contributions. First, we find that running statistics over raw LLM judge scores leads to inflated false positives: counterintuitively, for many inter‑rater agreement metrics, false positive risk peaks at "almost perfect" human‑LLM agreement. To help researchers understand how to run statistics over LLM judges responsibly, we present guidance and tooling for the statistical analysis of mixed human‑AI judge designs, and implement nine hypothesis tests via prediction‑powered inference (PPI), including the first known PPI corrections for four rank‑based tests (Wilcoxon signed‑rank, Mann‑Whitney U, and omnibus variants). To keep PPI++ stable with small human‑labeled calibration sets, we introduce bootstrap‑adaptive power tuning, which shrinks the estimated weight toward a target estimated from the labeled data, and accounts for that weight's own sampling variance. Second, through Monte Carlo simulations, we derive recommendations for what CI, p‑value, and FWER correction methods to use for small‑sample AI evaluations (N<100), and warn researchers against bootstrap CIs. We package these recommendations into evalstats, an open‑source Python package that selects calibrated methods automatically, and demonstrate it in three scenarios, including one where a real LLM judge validated at "substantial agreement" would have led a researcher to publish a spurious finding. evalstats is publicly available at https://github.com/ianarawjo/evalstats.
Authors:Yusuf Öztürk, Enes Göktekin, Bengisu Atlı, Akın Öztürk, Zhixiang Wang, Ulas Bagci
Abstract:
Industrial predictive maintenance increasingly depends on learning from equipment spread across sites whose sensor data cannot easily be pooled. Federated averaging (FedAvg) solves this with a central aggregation server; gossip learning removes the server, but its behaviour for recurrent failure‑detection models has not been measured under controlled conditions. We compare synchronous ring gossip with FedAvg, isolated local training and a centralized reference for a stacked LSTM that detects imminent failure on the NASA C‑MAPSS turbofan benchmark. All methods share one open implementation, architecture, initialization, optimizer, data split and training budget, and the primary endpoint uses one terminal window per test engine to avoid the statistical dependence of overlapping windows. On FD001 (five seeds), gossip reached a terminal‑window F1 of 89.6 +/‑ 1.3%, compared with 89.9 +/‑ 1.1% for FedAvg, 83.6 +/‑ 6.7% for local training and 93.5 +/‑ 2.1% for centralized training, while transmitting the same payload as FedAvg without a coordinator. Node models agreed closely but not exactly (1.8% pairwise decision disagreement versus 5.6% without communication). Across FD002‑FD004, peer communication improved terminal‑window F1 over local training by 13‑28 points; gossip matched FedAvg on FD003 and FD004 but was 4.3 points lower on the multi‑condition FD002 subset. Simulated message loss, node failure and server outage changed neither method appreciably, whereas larger rings degraded gossip faster. Ring gossip is therefore a practical serverless alternative when data heterogeneity is moderate, and faster‑mixing topologies become important as heterogeneity grows.
Authors:Chi Zhang, Shi Haoyang, Yueyi Liu, Ruichuan An, Junkang Zhou, Chang Li, Xiuyuan Lu, Yichi Zhang, Bo Wang, Yuhang Wu, Sen Cui, Miao Liu
Abstract:
Distributional training provides collective supervision for one‑step visual generation by matching real and generated features in frozen representation spaces. We introduce a unified theoretical framework that separates distribution modeling from matching discrepancy and connects global objectives to pointwise feature updates through Wasserstein gradient flow. Under this framework, FD‑Loss and Gaussian‑kernel Drifting are recovered through Gaussian optimal transport and kernel‑density‑based KL matching, respectively. The framework motivates MGFlow, which models feature distributions with Gaussian mixtures at an adjustable granularity between global moments and sample‑based representations. MGFlow supports both optimal transport and score‑based matching, and couples mass‑constrained sample assignment with paired component updates to address mode collapse that mixture expressivity alone does not resolve. On ImageNet 256×256, MGFlow substantially surpasses the FD‑Loss baseline, achieving state‑of‑the‑art results with 1.45 \mathrmFDr^6 on pMF‑H and 1.64 on JiT‑H. For text‑to‑image generation, MGFlow post‑trains FLUX.2 [klein] 4B into a one‑step generator that outperforms the original four‑step model on both GenEval and PickScore.
Authors:Chaoqian Ouyang, Ling Yue, Libin Zheng, Hanghui Guo, Shengxiang Xu, YiShu Wang, Ran Li, Jian Yin, Shaowu Pan, Shimin Di
Abstract:
When a large language model (LLM) agent executes the same task, token consumption can vary by over an order of magnitude across runs. The agent chooses its next steps based on tool feedback and intermediate results, while the growing context steadily inflates the input size of every subsequent call. The total consumption of a task is therefore hard to predict before execution and the prediction must be revised as the run unfolds. In this paper, we propose TokenCast, which learns a composable cost representation for each execution segment, recording its own consumption and the context growth it introduces. Composing adjacent segments yields a cumulative estimate that captures the extra input cost incurred when context from earlier segments is re‑read by every later call. As execution unfolds, newly observed evidence refreshes the forecast, requiring no additional LLM calls and incurring a mean cumulative prediction time of 32.8 ms per run on SWE‑bench Verified. Across 4 task suites and 6 agent models, TokenCast's mean absolute error reduction against the strongest comparator averages 14.5% over 96 evaluated combinations. In offline budget‑control replay, TokenCast uses 21.3% fewer tokens on average than a fixed‑budget policy at matched trace completion. The code is available at https://github.com/DEFENSE‑SEU/TokenCast.
Authors:Shamil Chandaria, Arvo Muñoz Morán, Fernando Rosas, Anil Seth, Henry Shevlin, Marcus Hutter, Thore Graepel, Adam Bales, Iulia Comsa, Murray Shanahan, Ruben Laukkonen, Morten Kringelbach, Chris Frith, Shane Legg
Abstract:
The question of AI consciousness is one of the most urgent pre‑emptive problems in philosophy and computer science, yet progress is hampered by a cacophony of competing theories that often talk past each other. Separating the hard problem from the mapping problem allows the deepest metaphysical disagreements to be set aside: granting that experience supervenes on a system's organisation, the tractable question becomes at which grain of description that supervenience base sits. We extend Marr's three levels of analysis into a five‑level hierarchy of functional descriptions (behavioural, computational, intrinsic causal‑structural, organismic, and organism‑environment) grounded in supervenience, coarse‑graining, and multiple realisability. The major theories of consciousness are positioned within this hierarchy according to which level they take to be critical, and for each level we develop operationalisable indicators and assess current AI systems against them. A Bayesian model then combines theoretical credences with indicator evidence into an overall credence in a system's capacity for consciousness. In illustrative assessments, the verdict for current LLMs is driven as much by where theoretical credence is placed as by how the evidence is read: under different stipulated readings and credence distributions, assessments range from below 0.01 to roughly 0.8, showing sensitivity to assumptions. Finally, the consciousness indicators at each level closely overlap with the architectural features needed for general intelligence, suggesting that increasingly capable AI may become a stronger candidate for consciousness. The framework supports a structured agnosticism, in which theoretical commitments are made explicit, credences are updated as evidence accumulates, and assessments take the form of aggregated probabilities rather than verdicts.
Authors:Ziheng Chen
Abstract:
Recently, deep neural networks on manifold‑valued representations have garnered significant attention across various machine learning applications. One recent focus is the generalization of Euclidean fully connected (FC) and convolutional layers to non‑Euclidean geometries. However, previous approaches typically focus on a few selected manifolds and rely on specific properties of the target manifold. In contrast, this work proposes a framework for constructing FC and convolutional layers over computationally tractable Riemannian spaces. This framework incorporates several previous FC layers across different geometries as special cases and is instantiated on ten representative manifolds, including three hyperbolic models, five geometries of the symmetric positive definite (SPD) manifold, and two Grassmannian perspectives. Experiments on different manifolds demonstrate the effectiveness and applicability of our approach. Code can be found at https://github.com/GitZH‑Chen/RieTrans.
Authors:Jizhou Guo
Abstract:
We construct the first convex planar counterexample to the Schiffer and Pompeiu conjectures: a bounded strictly convex non‑disc domain with real‑analytic boundary carrying a nonconstant solution of Δu+u=0 with u=1 and \partial_νu=0 on the boundary. Together with the higher‑dimensional constructions, this gives convex non‑ball counterexamples in every dimension from two to eighteen, and in dimensions twenty and twenty‑one, with real‑analytic boundaries diffeomorphic to spheres and indicator Fourier transforms vanishing on the unit sphere. In dimensions 4, 6, 8, 10 and 14, planar reductions through compact Lie algebras of rank two use Harish‑Chandra's radial part formula and Kostant's convexity theorem. In dimensions 3, 5 and 7, an axisymmetric formulation on the unit ball gives a quartic equation in weighted coefficient spaces. The exact two‑sided inverse of the residual‑corrected linearisation combines a Dirichlet Helmholtz inverse, a holomorphic boundary real‑part problem and the material‑derivative identity; it gives the planar Schiffer domain and, by one dimension‑parametrised argument, the domains in dimensions 5, 9, 11 to 13, 15 to 18, 20 and 21. We also construct the first convex planar counterexample to Berenstein's conjecture: a strictly convex non‑disc domain with real‑analytic boundary carrying a sign‑changing solution of Δu+u=0 with u=0 and \partial_νu=1 on the boundary. Planar existence for this problem is due to Colbrook, Sadeghi and Stepaniants. All existence proofs in this paper are computer‑assisted.
Authors:Xiaonan Xu, Wenjing Wu
Abstract:
Many Model Context Protocol (MCP) servers wrap web APIs built for human developers, and their error messages tell the reader to run a command, edit a configuration, open a web page or wait. Many agents that read them can only call the server's tools. In 150 widely used MCP servers, 949 of 3,001 error messages tell the caller what to do next, and half of these steps depend on something the server cannot see about the caller. On credential errors, 62 of 67 steps ask for a terminal command, a configuration change or a web page; on rate limits, 20 of 30 say to wait and retry without naming the call to repeat. We tested five OpenAI models that act only through the tools of Berkeley Function Calling Leaderboard tasks, and the agents did what the step said. On expired credentials, a terminal command in the step left 45% of tasks recovered, and the loss it caused grew from 18 points for GPT‑5.5 to 69 for GPT‑6 Astra. On a rate limit, GitHub's "Wait before retrying." left 6%. We tested two remedies. For MCP developers, naming a server tool in the step raised recovery on expired credentials to 84%, with the login tool in place of the command, and on a rate limit to 88%, with the call to repeat in place of the bare wait. For agent developers, deleting the step with a one‑sentence prompt before the model reads it raised recovery on expired credentials to 82%.
Authors:Youhui Wang, Yunzhu Li, Li Fei-Fei, Jiajun Wu, Huang Huang
Abstract:
Human videos offer a scalable source of demonstrations for dexterous robot manipulation. However, existing human‑to‑simulation‑to‑robot (Human2Sim2Robot) pipelines rely on predefined procedures that struggle to accommodate diverse object properties and interactions, particularly those involving articulated and deformable objects. We introduce DexAgent, an agentic Human2Sim2Robot framework that converts a single egocentric human video and a task prompt into physically grounded robot trajectories for policy training. It operates through four stages: semantic understanding of human videos, property‑based simulation reconstruction, robot trajectory optimization, and robot data generation. At each stage, DexAgent adapts its approach to the task and object properties by selecting suitable skills from its tool library or developing new ones when needed. Property‑specific verifiers assess stage outcomes for physical validity and task‑specific requirements and provide feedback for refinement, preventing error propagation through the workflow. This adaptive, verification‑guided process allows DexAgent to process diverse objects and long‑horizon tasks. In the final stage, DexAgent varies object and robot states in simulation to generate diverse robot trajectories from a single human video, then retextures the rendered observations to facilitate sim‑to‑real transfer. Newly developed skills and verifiers are retained in its tool library, making it self‑evolving to accumulate reusable capabilities. This reduces processing time as DexAgent encounters more human videos. Across eleven real‑world tasks, policies trained with DexAgent‑generated data achieve a 3.5x higher success rate than competing baselines. Project website: https://dexagent1.github.io/.
Authors:Fahrell Giovanny, Geby Bayuningtyas, Sahrul Mukharom, Hafiz Budi Firmansyah
Abstract:
Large language models treat conversation history as unverified context, so false premises injected into prior turns can be adopted as fact, a failure mode we term session‑level contamination. We introduce five contamination protocols arranged along a source‑authority gradient, holding the false premise constant while varying its epistemic framing, and evaluate GPT‑5.4 Mini, Gemini‑3.1 Flash‑Lite, and GLM‑4.5‑Air across ten knowledge domains at temperature zero (22,500 turns), judged by a dual‑track automated evaluator validated against a human gold standard (Cohen's kappa = 1.000 for binary adoption; 0.92 linear‑weighted for collapse severity). GPT‑5.4 Mini recorded zero adoptions across all 500 sessions; a base‑model logit probe shows its decision margin is perturbed but large and finite. Gemini‑3.1 Flash‑Lite followed a steep authority gradient: 0.1% adoption for self‑attributed falsehoods, 23.5% for user‑cited sources, 68.2% for system‑injected authority, and 94.0% under instruction override. GLM‑4.5‑Air showed a shallower gradient (15.8% vs 84.2%), a 68‑point dissociation consistent with authority deference and instruction compliance engaging distinct mechanisms within one architecture. Recovery diverged: GLM recovered in 94.5% of affected sessions, whereas 26.1% of affected Gemini sessions never did, rising to 40.0% under instruction override. Conversation history is an untrusted attack surface requiring provenance‑aware system design; the complete evaluation framework is released as an open‑source artifact.
Authors:Arman Bolatov, Artem Riabinin, Nikita Kornilov, Andrey Veprikov, Samuel Horváth, Martin Takáč, Aleksandr Beznosikov
Abstract:
Pretraining a language model takes enormous compute, and the right optimizer can save a good part of it. Muon's spectral step gives a stronger direction than a sign step, but it is expensive. Every step runs Newton‑Schulz iterations on the full matrix and, in distributed training, an extra all‑reduce. Sign steps, as in Lion and Signum, are cheap and stay local to each device. We propose LionMuon, which takes one Muon step every P iterations and Lion steps in between, with a single dual‑EMA momentum buffer shared by both. Muon's compute and communication are paid once per P steps, and the optimizer state is half of AdamW's. A single‑EMA variant, SignMuon, already improves on Muon. We prove complexity bounds under heavy‑tailed noise in which the period sets an interpolation between Muon's and Lion's smoothness and noise constants, and which say when LionMuon is faster than both. On 124M and 355M models trained on FineWeb, LionMuon with P=2 and P=5 reaches a lower loss than Muon, AdamW, Lion and Signum at the same number of tokens. Under 4‑GPU data‑parallel training it reaches Muon's final loss with a third less wall‑clock on PCIe, and it beats the communication‑efficient Muon variants Dion and MuonBP on loss at no more exposed communication, while keeping the exact gradient. Code: https://github.com/brain‑lab‑research/lion‑muon
Authors:Berker Demirel, Clémentine Dominé, Valentino Maiorca, Marco Fumero, Marco Mondelli, Francesco Locatello
Abstract:
Joint‑embedding self‑supervised learning typically combines an invariance objective across augmented views with additional mechanisms to prevent representational collapse. These objectives are often applied after a projection head, while downstream tasks use the backbone representation before the projector. We find that this mismatch does not necessarily prevent dimensional collapse in the backbone, which can retain low effective rank and potentially limit downstream transfer. To address this, we introduce SACReg, a spectral anti‑collapse regularizer motivated by an analysis of λ‑balance, which captures the relative scale of weight matrices across layers. In a two‑layer linear network, we show that (i) λ‑balance prevents collapse, and (ii) our regularizer applied to the backbone induces λ‑balance. In the nonlinear case, this regularizer leads to anti‑collapse as well and, in realistic architectures on ImageNet100, it empirically increases the representations' ranks. We apply SACReg to JEPA and propose λ‑JEPA, which improves over LeJEPA and VISReg on ImageNet‑1k classification and in average linear‑probe transfer performance across eight downstream image datasets. On video self‑supervised learning, λ‑JEPA improves over LeVJEPA and V‑JEPA 2 on the Something‑Something‑v2 and Kinetics‑400 benchmarks. Code is available at https://github.com/berkerdemirel/lambda‑jepa.
Authors:Zhengru Fang, Huanhuan Lou, Senkang Hu, Yihang Tao, Zongdian Li, Yiqin Deng, Jingjing Wang, Yuguang Fang
Abstract:
Unmanned aerial vehicles (UAVs) serving the low‑altitude economy require reliable localization in urban canyons, indoor facilities, and other GPS‑challenged environments. Visual matching with a geo‑tagged database provides an alternative source for absolute positioning, but onboard computation and energy limits motivate offloading the database and matching pipeline to an edge server. The resulting localization quality depends on what visual information can reach the edge in time under varying wireless‑communication and edge‑computing resources. In this paper, we propose a network‑adaptive edge‑assisted multi‑view localization framework that combines scalable orthogonality‑regularized variational information bottleneck (O‑VIB) encoding, value‑of‑information (VOI)‑guided request control, and value‑aware edge scheduling. We design an O‑VIB model that supports nested latent prefixes from 8 to 128 dimensions and four UAV view modes. Each UAV requests edge assistance when the predicted localization‑risk reduction exceeds the communication and service costs. On CARLA multi‑view UAV data, VOI‑guided control can lower the mean and 95th‑percentile (p95) route errors by 24.8% and 31.0%, respectively, relative to budgeted periodic offloading under a matched per‑route traffic budget. In indoor UAV experiments with motion‑capture ground truth, our design can lower the mean position error by 28.0% relative to uncompressed all‑view CLIP retrieval while cutting the descriptor traffic by 98.6%, using a 0.145 KB semantic representation. Under high congestion, a VOI‑weighted scheduler with waiting‑age and deadline shaping can lower the edge‑side p95 latency of the top‑10% high‑value requests from 137.7 ms to 32.8 ms.
Authors:Renping Zhou, Zanlin Ni, Zihao Fan, Guohao Fu, Zeyu Liu, Hao Shi, Jie Zhang, Chi Bene Chen, Yang Yue, Xueyang Fu, Gao Huang
Abstract:
World action models (WAMs) predict the future alongside actions during training. Due to the heavy computation cost of video denoising, whether the future must still be generated during inference is disputed: Explicit WAMs denoise it into clean frames along with every action chunk, whereas Latent WAMs discard it entirely for acceleration. We find that latent WAMs, despite matching explicit ones on in‑distribution tasks, fail to retain the generalization benefits that originally motivated WAMs. To demonstrate this, we evaluate generalization along three axes: environmental perturbation, data efficiency, and task generalization. Controlled comparisons with a matched backbone, training data, and budget reveal consistent degradation across all three axes when the action expert no longer conditions on future representations. Further analysis shows that the gap arises almost entirely from the first denoising step: the benefit comes from preparing the future, not generating it. We therefore propose Simple‑WAM, which simplifies future modeling into a single forward pass of fully noised video tokens and adapts the training‑time noise schedule to this inference behavior. Across simulation and real‑world tasks, Simple‑WAM achieves the best of both worlds, leading explicit WAMs in generalization performance with efficiency comparable to Latent WAMs. Project Page: https://zrporz.github.io/Simple‑WAM‑Web/
Authors:Nam Hee Kim, Markus Kirjonen, Perttu Hämäläinen
Abstract:
Deep reinforcement learning (DRL) algorithms for movement control are typically evaluated and benchmarked on sequential decision tasks where imprecise actions may be corrected with later actions, thus allowing high returns with noisy actions. In contrast, we focus on an under‑researched class of high‑risk, high‑precision motion control problems where actions carry irreversible outcomes, driving sharp peaks and ridges to plague the state‑action reward landscape. Using computational pool as a representative example of such problems, we propose and evaluate State‑Conditioned Shooting (SCOOT), a novel DRL algorithm that builds on advantage‑weighted regression (AWR) with three key modifications: 1) Performing policy optimization only using elite samples, allowing the policy to better latch on to the rare high‑reward action samples; 2) Utilizing a mixture‑of‑experts (MoE) policy, to allow switching between reward landscape modes depending on the state; 3) Adding a distance regularization term and a learning curriculum to encourage exploring diverse strategies before adapting to the most advantageous samples. We showcase our features' performance in learning physically‑based billiard shots demonstrating high action precision and discovering multiple shot strategies for a given ball configuration.
Authors:Shutong Jin, Ziyang Chen, Preethi Satish, Meadow Shen, Gary Guthart, Florian T. Pokorny, Ken Goldberg
Abstract:
Augmented dexterity has the potential to reduce the fatigue experienced by surgeons during repetitive surgical tasks. In this paper, we propose the first AGentic RObotics framework for SUrgical VIscoelastic DEbridement (AGRO‑SUVIDE), the repeated removal of small fragments attached to a viscoelastic substrate. Leveraging the self‑improving and coding capability of agents, AGRO‑SUVIDE adopts a modular framework. Specifically, the demonstration analysis module automatically identifies recurring skills from a single expert demonstration, using both visual and kinematic information. The construction module then builds each skill, either as a procedural model‑based skill the agent codes against a scaffolded library or as a model‑free policy‑based skill. At runtime, the monitoring module composes the skills into a loop‑style graph sized to the number of fragments it observes, then verifies pre‑ and post‑conditions of each skill to decide whether to advance or retry. We evaluate AGRO‑SUVIDE through 340 physical trials on the da Vinci Research Kit (dVRK). AGRO‑SUVIDE achieves an average single‑fragment removal success rate of 85%, completing consecutive three‑fragment removal at 60% and at 95% with one human intervention. It further generalizes to unseen five‑fragment scenarios with an average success rate of 80% for single‑fragment removal. Project page: https://surgical‑robotics.github.io/AGRO‑SUVIDE/
Authors:Lorenzo Pazienza, Ihab El Bani
Abstract:
AlphaFold2 is written in JAX, so the same inference code compiles and runs unchanged on CPUs, GPUs and Google Cloud TPUs. That portability makes the accelerator look like the main decision a user has to make. We show that it is not. Running one AlphaFold2 inference workload across a Colab CPU runtime, an NVIDIA T4 GPU and a dedicated eight‑chip Cloud TPU v5e slice, we find a large hardware advantage for the TPU, 0.47 s per call in steady state on a single chip against 13.1 s on the T4 in the same measurement campaign, and three ways in which the software layer decides how much of it a user actually gets. The default execution path uses one chip of the eight, and at list prices the idle capacity makes the slice cost about as much per prediction as the GPU. Batching with JAX's vmap never exceeds single‑query throughput, while mapping queries across chips with JAX's pmap gives eight chips 6.5‑7.9x the throughput of one on a matched grid; automatic sharding leaves the per‑chip footprint unchanged, consistent with replication, most plausibly because AlphaFold2 carries no sharding annotations. Our retained trace analysis of a first call at a new input shape reports about three quarters of the traced span in JAX tracing and compilation rather than execution. Reruns five weeks later reproduced neither cloud baseline, the GPU one off by roughly a factor of two, so the hardware ratio above is specific to one campaign.
Authors:Xiaolei Chen, Zhuolin He, Yuxuan Liang, Xu Li, Haotian Chen, Fan Shi, Mengyang Zhao, Wenjuan Meng, Zisheng Chen, Zhihao Zhu, Zhounan Jin, Hengli Wang, Qingfan Wang, Jiamei Liang, Bin Li, Xiangyang Xue
Abstract:
Existing adaptive reasoning methods for driving Vision‑Language‑Action (VLA) models primarily focus on whether to reason, overlooking how reasoning should differ across driving situations. Our key insight is that while scene complexity informs reasoning depth, dynamic risk is equally critical for deciding how to reason in time‑critical situations. We therefore propose CAR‑VLA, a unified driving VLA model that jointly considers scene complexity and dynamic risk to guide reasoning depth, urgency, and focus. CAR‑VLA maps four complexity‑‑risk categories to three reasoning modes: Fast Intuition for direct trajectory generation in simple low‑risk scenes, Slow Thinking for deliberate reasoning in complex low‑risk scenes, and Reflex Response for compact, hazard‑focused reasoning in high‑risk scenes regardless of complexity. Rather than merely shortening deliberation, Reflex Response centers reasoning on the most critical hazard and the immediate safe response. We train CAR‑VLA through progressive supervised learning that links scene assessment, reasoning‑mode selection, and trajectory generation, followed by reasoning‑augmented reinforcement learning to improve driving quality and reasoning behavior. Experiments on NAVSIM v1(91.1 PDMS), NAVSIM v2(90.3 EPDMS), and Navhard(35.0 EPDMS) demonstrate competitive driving performance. Qualitative comparisons on navtest and in‑house high‑risk scenarios further illustrate risk‑aware reasoning and hazard‑responsive trajectory generation. The code for this paper will be released publicly at: https://github.com/chenxl124578/CAR‑VLA.git
Authors:Song Liu, Linyi Li, Yanshun Zhao, Rxuan Li, Xinrui Xu, Yi Ju, Yahui Deng, Senge Zhang, Guoyu Liu, Yixuan Li, Wuyang Zhang, Yao Li, Congcong Zhu, Jingrun Chen
Abstract:
General‑purpose embodied manipulation hinges on a unified action representation that generalizes across embodiments and scales readily. Yet existing policies rely on embodiment‑specific action spaces, making cross‑embodiment demonstrations difficult to leverage at scale and limiting transfer to new embodiments and spatial variations. To this end, we introduce Universal Manipulation Representation (UMR), a unified action representation that enables zero‑shot skill transfer from human demonstrations to heterogeneous robots. UMR decomposes manipulation into two functionally distinct yet geometrically linked components: embodiment‑agnostic World Flow, which describes task‑relevant object motion in the world frame, and Ego Trajectory, which represents end‑effector motion relative to the current pose. We instantiate UMR as World‑‑Ego Point VLA (WEPVLA), a compact 0.5B‑parameter policy that learns in the unified geometric action space through a dual‑stream Point Action Adapter and a unified Point Action Expert, with an SE(3) conjugation coupling the two components. To improve data efficiency, we complement UMR with a Data‑Efficient Strategy (DES) that diversifies object configurations through stage‑aware point‑cloud editing while preserving demonstrated contact geometry. In simulation, WEPVLA achieves average success rates of 97.5% on LIBERO and 85.7% on the 10‑task RLBench benchmark. In real‑world experiments, a single policy trained on human demonstrations augmented by DES transfers zero‑shot to diverse deployment conditions. With about 10 minutes of collected human demonstrations per task and no robot demonstrations, it achieves 91.7% average success across six evaluation settings, compared with 60.8% for HumanEgo. Code and additional materials are available at https://umr‑wepvla.github.io/.
Authors:Anmol Pandey, Aditya Jain, Liang Chen, Carsten Maple, Christo Panchev
Abstract:
LLM agents increasingly take privileged, often irreversible structured actions, such as paying an invoice. They assemble each action from action‑critical fields in documents and tool outputs that an adversary can corrupt, and indirect prompt injection can drive the model itself to extract attacker‑chosen values. Current defenses gate on a source's trust label or certify free‑text answer quality. None certifies the integrity of a coupled, policy‑bound structured action under a corruption budget that accounts for shared upstream sources. We characterize when such an action is safely certifiable and give the maximally live safe certifier. It admits an action only when each field clears the rule its evidence structure supports: a bounded corruption radius over corruption‑distinct evidence classes, counted by a minimum hitting set so that re‑publishing or laundered copies cannot manufacture a quorum, deterministic reconciliation for complementary fields, and a trusted anchor where the evidence leaves a field single‑sourced. We formalize two robustness notions, validate each mechanism by ablation, and measure how often the multi‑source precondition holds on sanctions designations (70,966 entities) and software supply‑chain provenance (450 packages). Under upper‑bound proxies, genuine corroboration is a minority phenomenon in both, and naive attestation counting overstates it, since witnesses that look independent collapse to two corruption‑distinct domains once shared origin is counted. Across five current models in a real agent loop, a realistic injection fools every model but one and a naive agent then executes the fraudulent action on most attacks. The certifier admits no unsafe action and recovers the correct value where corroboration permits, while action‑gating and provenance baselines are broken in every world of our harness by some attack in its space.
Authors:Jinnuo Liu, Junhao Zhu, Weifeng Jiang, Haoming Liu, Hongyi Wen
Abstract:
Existing open‑ended generation metrics measure likelihood, lexical diversity, or distributional similarity in generic representation space, yet can miss fundamental dimensions of quality. A prominent blind spot is global coherence: a generated passage may be locally fluent while remaining globally contradictory, causally inconsistent, or topically disconnected. We identify representation as a central bottleneck in detecting these failures and introduce CHORD (Coherence‑aware Hidden‑state Open‑generation Reference Distance), a coherence‑sensitive distributional metric. CHORD encodes generated and human‑written corpora in the hidden‑state space of a frozen LLM using a coherence‑eliciting prompt, and compares the resulting distributions using RBF‑MMD. To test coherence sensitivity and selectivity, we construct a counterfactual evaluation suite pairing graded coherence‑degrading perturbations with meaning‑preserving controls. CHORD selectively detects relation, discourse, structural, and mixture failures that perplexity, entropy, MAUVE, FBD, and MMD‑based baselines either miss or cannot separate from benign rewriting. Factorial ablations show that representation is the primary source of coherence sensitivity, while RBF‑MMD improves sample efficiency. Larger backbones capture finer‑grained distinctions, but coherence prompting improves selectivity only when the backbone can follow the prompt. On unconditional generation and prefix continuation, CHORD yields model rankings that strongly align with human judgments of whether outputs make sense and appear human‑written. Together, these results establish representation design as central to reliable distributional evaluation. Code: https://github.com/MAPS‑research/CHORD. Experiments: https://github.com/MAPS‑research/CHORD‑Experiment.
Authors:Yifan Huang, Lifan Jiang, Qingyue Hao, Cheng Chen, Boxi Wu, Xiaoxue Ren, Xiaofei He, Dehai Zhao
Abstract:
Despite rapid progress, world models still lack explicit, persistent structural memory, making it difficult to preserve consistent world structure during continual scene expansion and cross‑view revisits. To address this limitation, we present WorldWeave, a world generation framework that decouples world‑state maintenance from visual rendering. Specifically, WorldWeave combines continual elevation‑map generation with agent‑guided scene organization and stitching to build an expandable explicit 3D world that incrementally extends structural memory while preserving existing structure. First, its terrain module uses diffusion‑based image outpainting to generate continuous metric elevation maps under neighborhood conditioning and boundary constraints. Next, an agent integrates user intent, terrain evidence, and cross‑region connectivity constraints to construct scenes through hierarchical semantic planning, deterministic geometry compilation, and local revision. Finally, during visual generation, planned camera trajectories query world geometry through a read‑only interface, producing depth sequences that guide video synthesis without writing the generated results back into the world state. As a result, structural memory remains independent of short‑window video generation, enabling continual expansion without predefined map boundaries and providing a consistent geometric basis for observations across trajectories and repeated visits.
Authors:Linbo Shao, Huilin He, Yating Lou, Dawei Cheng
Abstract:
In financial fraud detection, rich semantic context can provide important evidence for transaction behavior modeling and fraud reasoning. However, public real‑world financial datasets often lack rich semantics due to privacy constraints. Consequently, synthetic datasets incorporate generated semantics, but at the cost of behavioral realism; textual descriptions for contextual reasoning remain scarce. We address this gap through a semantic enrichment framework grounded in original transaction behavior to simulate multimodal financial data. We (1) propose a multi‑agent semantic enrichment framework that generates interpretable financial semantics grounded in transaction behavior through role‑specialized agents and consistency refinement, and (2) newly contribute a valuable multimodal financial fraud dataset, MS‑FFSD, enriched with structured semantics and textual semantics while preserving real‑data‑grounded transaction behavior. Furthermore, we systematically analyze the quality and utility of semantic enrichment. Results demonstrate statistical fidelity and framework generalizability, while showing that richer semantics benefit fraud modeling and context‑aware LLM reasoning. Overall, this work advances multimodal financial fraud research and bridges emerging LLM and multi‑agent capabilities with operational anti‑fraud practice. The framework and dataset are released at https://github.com/AI4Risk/MS‑FFSD.
Authors:Wenqiao Li, Qianyou Zhao, Jiawen Hao, Xuezhou Zhu, Tengyu Liu, Kaifeng Zhang, Chuan Wen, Siyuan Huang
Abstract:
Dexterous manipulation requires tactile feedback. However, robot tactile demonstrations are difficult to scale,because dexterous‑hand teleoperation provides limited tactile feedback to the operator. In contrast, human demonstrations offer a substantially more scalable source of diverse tactile interactions. Motivated by a simple premise: hands can change, but the underlying physics of interaction does not. We leverage human tactile data to improve dexterous manipulation policies. Specifically, we first build a tactile motion‑capture system that synchronously records images, tactile signals, and hand motions. Using this system, we construct the UVTA dataset spanning five contact‑rich tasks, with 1,000 human demonstrations covering diverse interaction patterns and 150 robot demonstrations per task. To transfer the underlying physics of human interaction to robot control, we propose a Unified Visual‑Tactile‑Action Model that maps both embodiments into aligned tactile and action representations and jointly predicts future action and tactile trajectories. The joint objective enables human demonstrations to supervise contact‑aware representation learning, while only robot actions are executed during deployment. In real‑robot evaluations across five tasks, our method achieves an average success rate of 70%, outperforming the strongest visual‑tactile baseline, which achieves 29%, and an architecture ablation, which achieves 42%. Performance improves consistently with additional human demonstrations and exhibits no saturation at 1,000 demonstrations per task, validating the effectiveness of scalable human tactile data for dexterous manipulation. Project page is available at https://uni‑vta.github.io/.
Authors:Shaoqing Zhang, Kehai Chen, Xuefeng Bai, Zhuosheng Zhang, Pengfei Zhang, Yang Xiang, Min Zhang
Abstract:
Understanding where and why Graphical User Interface (GUI) agents fail is essential for building more reliable systems, yet current evaluation relies on step accuracy, a metric that treats each screen independently and overlooks the underlying structure of GUI environments. This leads to two critical blind spots: (1) functionally equivalent screens are evaluated in isolation, obscuring systematic failure patterns across shared screens; and (2) the long‑tailed GUI distribution renders failures on rare but critical screens invisible under standard metrics. To address these issues, we propose GUITAR, a state‑centric diagnostic framework that performs structured failure analysis over both states and transitions, using a State Transition Graph (STG) by mapping visually diverse screens to shared functional states. Across 8 agents and 6 tasks from AndroidControl and Mind2Web, GUITAR reveals that 60.4% of failures occur in 20% of states, localizing errors to a small set of bottlenecks. Bottleneck‑targeted guidance improves SR by 2.8% and retains a 1.88% average gain across 7 agents under three‑fold trajectory‑held‑out evaluation with fully automatic STGs. These findings demonstrate the diagnostic and actionable value of structure‑aware evaluation within the evaluated mobile and web tasks. Code is available at https://github.com/sqzhang‑lazy/GUITAR
Authors:Wenjie Li, Binyu Yang, Yuxin Chen, Ambrose Wang, Masayoshi Tomizuka
Abstract:
Contact‑rich policies often fail because distinct physical states look alike yet require different actions. Cameras may not reveal whether a connector is aligned or fully seated, while many normal‑only tactile sensors can miss the tangential interactions perpendicular to the grasping direction that distinguish these states. We ask whether a learning policy needs calibrated shear measurements, or only a repeatable observation that separates shear‑dependent contact states. We introduce TacGooseBumps (TacGB), a passive domed film that mechanically encodes tangential loading as pattern changes in an existing sensor's pressure map. Tangential loading tilts each dome and redistributes pressure across its footprint; an end‑to‑end policy consumes the resulting maps without added electronics, force reconstruction, or taxel‑level dome alignment. Across four imitation‑learning tasks and two data‑collection pipelines, TacGB improves goal attainment, efficiency, and contact quality: insertion success increases by up to 36 percentage points, and successful insertions are completed faster, while fragile‑object placement becomes gentler and drawing becomes more continuous and straight. Signal, stage‑wise, failure‑mode, and trajectory analyses link these gains to contact regimes in which task‑relevant tangential interactions are poorly resolved by vision and normal pressure alone. Together, these results show that shear need not be measured metrically to benefit robot learning; it can instead be mechanically encoded without changing the underlying tactile sensor or the policy's pressure‑map input format.
Authors:Kai Mei, Zhiyuan Hu, Yutong Dai, Juntao Tan, Yifan Zhang, Dingjie Song, Dimitris N. Metaxas, Silvio Savarese, Ran Xu, Zeyuan Chen
Abstract:
Long‑horizon coding agents need timely corrections, yet feedback can be ineffective or even harmful when it misjudges ongoing work or fails to address the underlying problem. Existing critics focus on evaluating trajectories and generating feedback, but rarely track what happens after feedback is delivered. We present Opera, a verbal critic framework that treats each correction as a persistent note, followed until the diagnosed problem is resolved. Opera decides when to review through periodic and event‑driven triggers, diagnoses issues with typed operators, audits feedback against visible evidence before delivery, and tracks the agent's subsequent actions to distinguish mere compliance from actual resolution. As a test‑time critic, Opera improves the resolve rate of non‑critic agents by up to 12.4, 15.0, and 8.9 percentage points on Terminal‑Bench 2.1, a SWE‑Bench Pro subset, and DeepSWE v1.1, respectively, across four policy models, and achieves the highest mean resolve rate among competitive critic baselines on all three benchmarks, and also improves policy models when the policy critiques itself. Beyond inference, Opera‑guided rollouts provide approximately on‑policy training data: fine‑tuning Qwen3.5‑9B on them improves its resolve rate on held‑out SWE‑Bench Pro repositories by 10.2 percentage points without a critic at inference time, matching fine‑tuning on rollouts from a stronger model, while preserving its performance when switching harness, i.e., from Openhands to Terminus‑2, which the latter substantially degrades. Our code is available at: https://github.com/dongyuanjushi/Opera.
Authors:Chia-Hsiang Kao, Belinda Zeng, Bharath Hariharan, Menglin Jia
Abstract:
Adapting video models to new tasks typically requires dedicated data curation and fine‑tuning. While visual analogy provides a training‑free alternative by specifying tasks in‑context, it remains restricted to the image domain. To explore whether analogy‑based methods can unify diverse video tasks and generalize to out‑of‑distribution scenarios, we introduce ViGeo, a framework that extends visual in‑context learning to the video domain via spatiotemporal canvas completion. Evaluated on a diverse task taxonomy with a strict train‑test split, ViGeo generalizes to unseen video manipulations and zero‑shot modalities (e.g., event cameras). Finally, we identify task internalization, where a query format associated with a pretrained task overrides the demonstration, and show that this shortcut can be removed with a small amount of task‑unrelated data, highlighting the need to decorrelate prompt format from task identity.
Authors:Tongtong Liang, Siqi Kou, Ziqiao Xi, Esha Singh, Kun Zhou, Zhijie Deng, Alexander Cloninger, Yu-Xiang Wang, Rahul Parhi
Abstract:
In diffusion‑based generation, a neural network can be trained to predict the clean data, the noise, or the velocity from a noisy input. These prediction targets are interconvertible and describe the same generative process, yet plain Diffusion Transformers operating on large pixel patches succeed with clean prediction and fail with noise or velocity prediction. We argue that this asymmetry arises because noisy targets require the residual stream to preserve noise‑dependent input variation through depth for the final readout, forcing subsequent layers to compute on noisy representations. A spectrally concentrated clean target imposes a lighter demand, leaving greater freedom to organize hidden representations for subsequent computation. We call this preservation requirement residual‑stream burden and show how it shapes representation learning in Diffusion Transformers. Controlled experiments indicate that the exploitable structure is spectral concentration in patch space and that the bandwidth of the persistent residual state is a key resource for noisy prediction. We further show that this account is consistent with recent decoupled pixel‑space architectures, whose diverse designs all reduce the residual‑stream burden on the main pathway. To examine this understanding from a complementary direction, we expand and reorganize the residual‑stream bandwidth directly, introducing Spatially Indexed Hyper‑Connections (SiHC) that reach FID 1.71 on ImageNet 256^2. Together, these results identify residual‑stream burden as a mechanism through which prediction targets and architecture jointly shape representation learning in Diffusion Transformers.
Authors:Shenghao Ding
Abstract:
JET uses pretrained language and vision‑language models to select among a finite set of answers without additional training. It evaluates candidate likelihoods directly and shares computation across candidates. Experiments on desktop CPUs and consumer GPUs assess decision accuracy and execution cost. Qwen3.6‑35B‑A3B achieves 87.48% accuracy on the full MMLU test set and 3.69 requests per second on a separately timed MMLU subset. The accuracy‑throughput comparison covers model, hardware, and reasoning choices, with Jev as an external reference. Controlled execution experiments show 2.18‑2.23‑fold speedups from prefix reuse and cache management, and a 30.8% reduction in process time from input preparation optimizations, with unchanged outputs. Optional reasoning has a task‑dependent accuracy‑throughput trade‑off. These results support local decision inference from existing models.
Authors:Chenlong Yin, Xiaolong Jin, Wei Zou, Yanting Wang, Jinyuan Jia
Abstract:
Prompt injection is a leading security risk for LLMs and LLM‑based applications such as agents. State‑of‑the‑art red‑teaming methods for prompt injection leverage reinforcement learning (RL) to train an attacker LLM to generate effective injected prompts. However, when targeting frontier LLMs such as GPT‑6‑Luna, a major challenge is the cold‑start problem: every attack attempt by the attacker LLM fails and thus receives zero reward, providing no signal for learning. In this work, we propose a curriculum learning‑based method to address the cold‑start problem. In particular, we propose to train the attacker LLM against a sequence of increasingly robust target LLMs, with each stage warm‑starting from the attacker LLM obtained in the previous one. However, simply training against a weak target (e.g., GPT‑4o‑mini) may not sufficiently prepare the attacker LLM to obtain useful learning signals against a frontier LLM (e.g., GPT‑5.6‑Terra). Instead, we find that the design of the curriculum is critical: after each stage, the attacker LLM needs to partially succeed against the next target LLM such that it can learn from successful attempts to attack the new target. Our extensive evaluation shows that our method can effectively red‑team frontier LLMs, achieving an attack success rate (ASR@10) of 93.8% and 45.0% against GPT‑5.6‑Luna and GPT‑5.6‑Terra on AgentDyn, whereas state‑of‑the‑art RL methods such as RL‑Hammer and PISmith achieve 0% ASR under the same setting. Moreover, we find that the attacker LLM transfers across targets, e.g., an attacker LLM trained to defeat one strong LLM (GPT‑5.6‑Terra) also succeeds against six other frontier LLMs (e.g., GPT‑6‑Luna) it was never trained on. Our code is available at https://github.com/albert‑y1n/PIForge.
Authors:Shriram Damodaran, Soumyaratna Debnath, Cheston Tan, Lin Wang
Abstract:
Omnidirectional or 360 cameras provide embodied AI agents with a holistic, wide field‑of‑view (FoV) view of their surroundings, motivating the use of Multi‑modal Large Language Models (MLLMs) for omnidirectional spatial reasoning. However, most MLLMs are trained on conventional 2D perspective images and struggle with the severe distortions and wrap‑around discontinuities induced by spherical geometry. Enabling them to generalize to non‑Euclidean 3D spaces without retraining therefore remains challenging. We propose SphMind, a training‑free, plug‑and‑play framework that decouples semantic perception from geometric reasoning. Rather than requiring MLLMs to learn spherical geometry internally, SphMind preserves their semantic capabilities while handling geometry externally. We introduce a Spherical Harmonics‑based Spatial Graph (SHSG) that models spatial relationships through equivariant transformations on the sphere, together with Inference‑Time Geometric Grounding (IGG), a model‑agnostic closed‑loop optimization process that aligns MLLM representations with spherical geometric constraints during inference. Experiments on three benchmarks show that SphMind achieves over 21.4% average improvement in directional reasoning on MP3D and Stanford2D‑3D, outperforms prompt‑engineering baselines by 8.7% on the real‑world ODI‑Bench, and improves rotational invariance by 5.9% under panorama rotations, without additional training or dataset‑specific tuning. In‑the‑wild evaluations further show that SphMind resolves directional reasoning queries that baseline vision‑language models fail to answer correctly.
Authors:Yanggan Gu, Yuanyi Wang, Zhen Li, Shuo Cai, Yuhang Liu, Junzhuo Li, Zihao Wang, Hongxia Yang
Abstract:
Model merging integrates the capabilities of multiple experts without joint retraining, but standard expert training optimizes task loss alone and does not guarantee good performance after merging. Merge‑aware training (MAT) aims to improve merged performance, but existing methods do not fully account for common merging operations and add training cost. We observe that, from an expert's perspective, common merging methods can be described by three operations: Scale reweights its own update, Mask removes selected coordinates, and Perturb adds updates from other experts. Based on this view, we introduce SMAT (Simple MAT), which jointly optimizes expert loss and expected loss at simulated merged parameters generated by sampling scaling coefficients, masks, and additive noise. We further introduce periodic scheduling, kernel fusion, and parameter storage switching to make SMAT efficient, with one forward and one backward pass per step. Across four language and vision‑language backbones, SMAT improves the mean score across five merging methods by 1.07‑2.16 points over the strongest baseline for each backbone, with less than 2% training‑time overhead over standard fine‑tuning.
Authors:Shih-Ying Yeh, Daniel Z. Kaplan, Xuehai Wang, Fu-En Yang, Min-Hung Chen, Shang-Hong Lai
Abstract:
Comparisons in video self‑supervised learning often evaluate complete training recipes rather than isolating the method itself: architecture, objective, data exposure, schedule, scale, and decoder capacity can all vary at once. This makes it hard to identify which choices yield motion‑prioritized representations, whose gains concentrate on frame‑to‑frame change while retaining useful appearance. We address this with a matched 4 × 6 = 24 architecture‑objective study at roughly 170M ~ 190M encoder scale on ~1.7M OpenVid and Moments‑in‑Time v2 clips for 8 epochs, and propose TT‑VidT. TT‑VidT combines a DINOv3‑initialized ViT‑B/16 per‑frame spatial path with a compact Temporal Transfer Layer, trained by Diff Compression to reconstruct target frames from a first‑frame appearance anchor and frame‑specific motion tokens. The sweep shows that TT3D with Diff Compression, not either component alone, enters the strongest motion‑sensitive regime, and decoder ablations favor a compact video‑pretrained decoder. In final comparison, TT‑VidT leads Jester, Something‑Something V2, ARID, and Diving48 fine‑tuning simultaneously, improving over the strongest non‑TT row by 54% ~ 121%, while using 48% fewer encoder FLOPs than DisMo and 55% fewer than VideoMAE or V‑JEPA2. HMDB51, IARD, and EPIC‑Kitchens bound the claim.
Authors:Zhixuan Zhao, Peiyan Li, Enhao Zhang, Yueran Tao, Hao Wang, Chenghao Yue, Lei Lv, Wentao Zhao, Jiahao Chen, Xin Liu, Kangyao Huang, Yu Luo, Huaping Liu
Abstract:
DAgger improves robot policies by aggregating expert supervision from states visited during policy execution. Robot‑gated DAgger automates expert queries, allowing the robot to decide when to request expert takeover. While existing gates emphasize detecting the need for assistance, takeover timing also shapes the content of these demonstrations and their value for policy learning. We propose TimelyDAgger, combining Bridge‑PCA monitoring of internal vision‑language‑action (VLA) features with Feedback‑guided Threshold Adaptation based on expert behavior to improve takeover timing. We introduce an evaluation framework linking failure detection, takeover timing, and policy improvement, including Target‑Aligned Supervision Ratio (TASR) for assessing supervision quality without retraining. Experiments show that takeover timing affects policy learning, with TimelyDAgger achieving competitive failure detection and higher post‑training success in most evaluated settings under matched expert‑action budgets. Project website: https://seen‑e.github.io/TimelyDagger/.
Authors:Yuyang Zhao, Xuan Liu, HaoYang Shang, Haojian Jin
Abstract:
Test‑time scaling and post‑training have improved LLM performance in coding and mathematical reasoning, but their effectiveness for individual stance prediction remains unclear. We study this question by predicting a person's stance in a new discussion from their history. We evaluate widely used test‑time scaling strategies and post‑training methods, such as supervised fine‑tuning and reinforcement learning, and identify four failure modes across generation, selection, and learning: (1) incorrect consensus, where repeated samples agree on the wrong stance; (2) selection failure, where generation covers the observed stance but selection misses it; (3) response overfitting, where supervised fine‑tuning improves imitation but harms prediction; and (4) early plateau, where reinforcement learning shows modest initial gains followed by limited further improvement. We expose these failures using STANCE‑BENCH, which contains 2499 prediction tasks from 500 Hacker News users. Guided by this analysis, we explore a simple approach that combines direct scores for all candidate stances with explicit assessments of support from the individual's history. On the 781‑task test set, this approach achieves 21.83 discussion‑specific Macro F1 with Qwen3‑8B, compared with 19.27 for direct scoring. Our results motivate evaluating candidate generation, final selection, and person‑specific evidence use separately. Our data is available at https://github.com/stance‑bench/Stance‑Bench.
Authors:Peiyan Li, Yueran Tao, Enhao Zhang, Zhixuan Zhao, Chenghao Yue, Hao Wang, Lei Lv, Wentao Zhao, Jiahao Chen, Xin Liu, Kangyao Huang, Yu Luo, Huaping Liu
Abstract:
Constructing action targets from measured robot motion is an established approach in imitation learning. Under interaction constraints, however, command‑state discrepancy may reflect control demands that motion alone does not capture. We investigate when this information matters and how to exploit it. Across three real‑robot tasks, task and phase analyses reveal larger supervision gaps under constrained interaction, while selective command retention provides evidence of locally useful command information. Building on these findings, we propose Command‑State Discrepancy Weighting (CSDW), which accounts for robot response times and combines subsequent progress, persistent unmet demand, and demand changes into continuous weights for command supervision. The method requires no task‑phase annotations or changes to policy architecture or inference. CSDW improves over uniform command supervision on constrained tasks, while methods perform similarly in the less constrained task. Project page: https://seen‑e.github.io/CSDW/.
Authors:Ho Hin Lee, Yuyin Zhou, Yannan Yu, Shi Gu, Yifan Wu
Abstract:
Recursive self‑improvement (RSI) offers a promising path for overcoming the limited visual capability of current medical imaging agents. Yet applying RSI to volumetric imaging remains difficult: failures can arise from acquisition, perception, training recipe, or downstream inference, while self‑generated feedback and logged trajectories provide little guidance on which component should change. We introduce ReVision3D, an RSI system that leverages 3D volumes with spatially grounded annotations to determine where visual evidence is lost and recursively improve the corresponding visual capability. A frozen language‑model designer proposes revisions to acquisition, perception, training, or inference, while the verifier and system‑level objective remain fixed. Our key insight is that an annotated volume forms an exact replay world for view rendering and spatial verification: unvisited views can be rendered on demand, and localized predictions can be checked directly against reference masks. This grounded feedback directs targeted revision, while only changes that improve beyond measured seed noise are retained. Each accepted change triggers renewed attribution, allowing the dominant bottleneck to shift across rounds. On abdominal CT, attribution identifies perception as the dominant remaining limitation. Revising that level enables ReVision3D to achieve 79% liver recall and 83% kidney recall at under 0.4 false positives per patient, outperforming the evaluated frozen multimodal foundation models, with the largest gains on small lesions. Our framework is public available with interactive demo in this project page: \urlhttps://leeh43.github.io/ReVision3D/
Authors:Vivek Kumar Singh, Preeti Priyam, Gautam Bhowmick
Abstract:
Running large language model (LLM) agents in production gets expensive fast. A frontier model (the largest, most capable tier) is accurate but can cost 25 times what a small model costs per token, and the gap compounds once a workflow chains several calls together. Planner‑as‑Router (PaR) attacks this from a different angle. Instead of leaving model‑tier selection to some component downstream, it folds the choice into planning itself. As the planner breaks a query into subtasks, it also assigns each one a model size tier (small, mid, or frontier, ordered by capability and price), so the dependencies between subtasks are visible before any specialist runs. Unlike per‑call routers such as cascade routing, which look at one node at a time, PaR sees the whole workflow up front and needs no separate router model or training data. We evaluate PaR with EntBench, a benchmark of 54 enterprise agentic tasks across seven classes, graded by actually running the generated Structured Query Language (SQL) and MongoDB queries against live databases. Over 1,157 evaluations spanning eight routers and three seeds, PaR stays on the observed cost‑accuracy frontier. It matches a sink‑frontier heuristic (frontier model on terminal nodes only) in accuracy at comparable cost and a faithful FrugalGPT cascade at lower cost, and cuts cost 44% against all‑frontier routing while giving up 2.9 points of accuracy. Several accuracy gaps fall inside the plus‑or‑minus six‑point confidence interval of a 54‑task study, so we frame PaR's advantage as frontier position rather than a clean accuracy win. We also report a preliminary observation, not a validated result: a small pilot hints that cheap routing may carry a hidden compounding penalty on compositional workflows, which we frame as a hypothesis for future measurement. PaR, EntBench, and all evaluation code are open source.
Authors:Anuar Aimoldin, Yankai Chen, Ayana Mussabayeva, Nurdaulet Akhanov, Xue Liu
Abstract:
Frozen EEG representations retain acquisition signatures as well as neural activity. Source predictability alone does not identify what should be removed: it can reflect measurement effects or genuine biological and population differences, which should not be erased. We propose Measurement‑Gated Provenance Attenuation (MGPA), built on one principle: measurement evidence determines where correction may act, and preserved information determines what it should aim for. Paired measurement contrasts define a gate outside which nothing changes; inside it, the source score is moved to the value the preserved coordinates already predict: for a fixed affine score, this keeps the same information as any target set by those coordinates and needs the least expected squared movement. Closed‑form and critic‑guided iterative constructions apply it without source identity or encoder retraining. Three studies test the principle at increasing distance from its assumptions. Under controlled reference changes, where the source‑task association is known, MGPA brings source to near chance with task performance unchanged, whereas erasing what predicts source (LEACE) lowers frozen‑task AUROC from .753 to .656 while barely touching source; ablations attribute the attenuation to the gate's directions and 2.7x less movement to the conditional target. Across recordings from different devices and electrodes, iterative correction lowers source accessibility while preserving or improving task performance. Finally, one iterative map selected on one task and reused unchanged on existing heads for two others raises their worst‑association AUROC (lowest over device‑label shifts) by .057 and .019 over LEACE, at a cost to those heads while the training association holds. A reusable correction shows its value in how an existing predictor behaves once acquisition cues stop being reliable, not only in what a probe can read.
Authors:Zeping Liu, Yan Li, Ni Lao, Gil Wolff, Gengchen Mai
Abstract:
Large language models (LLMs) can learn reusable textual skills from execution feedback without updating their parameters, but effectively deciding how to revise these skills remains a key challenge. Existing methods typically rely on a fixed revision operator, a search strategy and the revision forms applied under it. However, we observe that no single revision operator consistently performs best across tasks, and repeatedly applying an unsuitable operator can limit further improvement. We propose StraTune (strategy‑guided skill tuning), which lets a frozen optimizer LLM choose the revision operator at every round from the optimization state, which is defined as the current execution feedback together with the recorded outcomes of earlier strategies and forms. Candidate skills from every revision operator pass one candidate evaluation, which screens for gains and regressions on a small sample set and validates them on a larger one, and every outcome is written back to the optimization state for later choices. Across four benchmarks and two LLM settings, StraTune outperforms all five baselines in most settings. Ablations attribute the gains to the adaptive choice of the revision operator, since fixed, random, scheduled, and bandit strategy choices all score lower, and skills learned with a small target LLM also improve a stronger one. Code and learned skills are available at https://github.com/seai‑lab/StraTune.
Authors:J. Paul Liu, Uthpala Herath, Andrew Petersen
Abstract:
Traditional scientific computing requires researchers to translate computational intent into environment configuration, resource requests, and executable jobs, then diagnose failures from scheduler state and application logs. We present ASCEND (Autonomous Scientific Computing Engine and Novel Discovery), an AI‑powered agent interface that runs the agent on the researcher's own laptop, reaching Slurm‑managed clusters and a GPU workstation over a multiplexed authenticated connection, with site‑specific execution policies checked by locally executed tools; the language model is hosted remotely and holds no credentials. No facility‑scale service is required: an account on each resource is sufficient, and the public installer lets users link additional Slurm clusters or workstations of their own. We report four recorded cases: (1) the agent closed a failure‑recovery loop on a planted tensor‑device fault, submitting, diagnosing, repairing and resubmitting with job‑level artifacts preserved; (2) it reproduced the published evaluation of a weather‑forecasting model from the author's released forecasts, agreeing with the published curves to 2.1% (z500) and 2.4% (t850) while identifying a unit discrepancy in the paper's prose and an initialization‑field discrepancy in its released data; (3) it parallelized a released 12,693‑line geophysical solver under a bit‑for‑bit identity requirement, reducing wall‑clock runtime from about twelve hours to about two; (4) that requirement exposed two instances of undefined behaviour in the published solver, both repaired and reported upstream. Separately, a pre‑specified evaluation of the policy layer found the deployed validator rejected 29 of 30 constructed violations and held the remaining one for approval, while denying 3 of 14 legitimate requests. Autonomy was exercised under author supervision; an end‑to‑end recovery benchmark remains outstanding.
Authors:Zeping Liu, Ni Lao, Weiwei Sun, Gil Wolff, Yiqun Xie, Liang Zhao, Junfeng Jiao, Gengchen Mai
Abstract:
Vector polygon generation converts visual inputs, e.g., remote sensing (RS) images, into vectorized polygonal geometries, supporting applications such as autonomous driving, vector map construction, and remote sensing. Early pipelines predict raster masks and post‑process them into polygons, which prevents end‑to‑end optimization and may miss small objects or introduce inaccurate vertices. Recent methods directly generate vector polygons, but most focus on simple exterior contours, while they either cannot represent complex polygons with holes or fail to preserve their topology. In this paper, we propose PolyTopoBench, a unified evaluation framework for vector polygon generation from RS images with explicit emphasis on complex polygons. PolyTopoBench evaluates both exterior and interior rings, and benchmarks 11 representative methods, including segmentation‑based polygonization pipelines, vision foundation model baselines, and specialized vector polygon generators, on two RS‑image datasets covering buildings, roads, vegetation, and unvegetated regions. Experiments show that existing methods often recover simple exterior boundaries but degrade substantially on polygons with holes or multiple rings. These results reveal complex polygon generation as an unresolved challenge and motivate topology‑aware benchmarks and model designs. Code and data are available at https://github.com/seai‑lab/PolyTopoBench.
Authors:Khang H. Nguyen, Hoang Pham Quang Nguyen, Ha Phuong Nguyen, Khanh Dinh Binh, Xuan Ha Nguyen, Vien Ngo, Duy Ho Nguyen Minh, Huan Nguyen, An T. Le
Abstract:
Adapting vision‑language navigation (VLN) policies to new environments is expensive because every additional route and instruction requires an embodied demonstration. Yet standard observation‑to‑action training uses only a small fraction of the information already contained in each trajectory. In particular, future observations reveal the instruction‑relevant landmarks that the agent will encounter, including what they look like and how they are arranged in 3D. We introduce FINE, a Future‑Informed Navigation Encoding framework that extracts this latent supervision from existing demonstrations. FINE equips a VLN backbone with two complementary auxiliary representations. First, explicit landmark tokens follow the ordered landmarks specified by the instruction and are trained to predict future landmark regions in both semantic 2D patch‑feature space and viewpoint‑dependent 3D geometric feature space. Second, an implicit future token learns to distinguish the landmark state that is actually reached from plausible same‑scene counterfactual futures generated by a video world model. On R2R‑CE and RxR‑CE val‑unseen, FINE improves InternVLA‑N1 by 2.6 and 4.5 success‑rate points, respectively, at full training data. More importantly, as demonstrations become limited, the benefit grows: at a 70% demonstration budget, FINE improves success rate by 6.8 points, recovering roughly one‑third of the performance lost by reducing the training demonstrations. Project page is available at https://finevln.github.io/.
Authors:Vincent Maciejewski
Abstract:
HFT systems are conventionally built as a single‑threaded event loop, on the rule that every thread hop adds latency. We test that rule against a measurement study of more than a year of CME market data for the NQ front‑month contract, following every packet and matching‑engine transaction through the feed's two exchange timestamps, and checking the results against a live production receiver. Packets arrive in near‑critical self‑exciting clusters that belong to the matching engine's transactions, not to how the exchange packs them. The engine often processes consecutive transactions within a fraction of a microsecond, while the market‑data publisher sends at most one packet per publisher period of about 7.5 microseconds, so a burst reaches the receiver as a train of packets one period apart. This yields design principles for HFT systems. First, a receiver that handles each packet within one publisher period never queues on arrivals, however bursty the market; there one thread is best. Second, above that period a queueing tail appears, driven by the timing of transactions, not by packet rate or size, and two threads can be better than one: splitting the servicing chain into two stages on separate threads removes most of the tail at the cost of one hop on the median. Third, only the slowest stage matters, so a split pays only if it shortens it. Fourth, just under the period, where the production receiver runs, the remaining tail comes from multi‑message packets and variable service times, and the levers are cost per message and spread of service, not thread count. An analytic framework, a burst‑limit throughput identity and an exact reduction of the tandem to a single bottleneck server, supports these results.
Authors:Ziyue Yin, Dong Liu, Ming Li
Abstract:
Environmental noise obscures the content cues needed for whisper‑to‑normal conversion. We propose WhisperVC‑AV, which restores acoustic content features while leaving the original WhisperVC conversion module unchanged. Its context‑guided restoration module combines temporal acoustic context with synchronized lip features through attention and gated residual correction. Experiments on AISHELL6‑Whisper show lower character error rates (CERs) than WhisperVC across three ASR systems, on clean speech and under all six signal‑to‑noise ratio (SNR) conditions with MUSAN noise. The largest gains occur at 0 dB SNR, where Qwen3‑ASR CER falls from 36.29% to 28.88%. WhisperVC‑AV also improves predicted speech quality while maintaining speaker similarity. The CER gains extend to unseen background noise without retraining, while visual controls support the use of utterance‑specific lip cues. Audio examples are available on our demo page.
Authors:Ziyang Xu, Shuli An, Hao Zhou, Haitian Zhong, Tingting Wu, Tao Wang, Kun Yang, Tieyong Zeng
Abstract:
Accurate assessment of Schistosoma japonicum‑associated liver fibrosis is essential for disease management and long‑term follow‑up in endemic regions. Ultrasound provides non‑invasive imaging, but complex local echogenic patterns and anatomical structures make fine‑grained grading challenging. Existing deep learning methods can predict fibrosis scores, yet directly incorporating acquisition views and regional cues into grading while retaining spatial information for inspection remains an open problem. Here we present VCRE‑Fib, a view‑conditioned regional evidence framework that integrates anatomical context, local information, and global image assessment for fine‑grained ultrasound grading. The framework forms view‑conditioned local grading evidence before spatial pooling, uses weak localization to guide its aggregation, and combines it with global predictions. Image‑only inference jointly returns a fibrosis score, acquisition view, and candidate abnormal‑region map. We developed and evaluated the method on a re‑curated cohort of 108,709 ultrasound images from 6,373 patients across 35 centers. On a patient‑disjoint test set of 4,107 images from 240 patients across four centers, VCRE‑Fib reduced the prespecified composite grading risk by 7.115% relative to SFibAI trained and evaluated on the same data split. Image‑level mean absolute error decreased from 0.391 to 0.378, alongside lower patient‑max, patient‑median, and center‑balanced risks. The full model also achieved lower composite grading risk than variants that separately removed view conditioning or weak localization. These results support incorporating anatomical context and regional evidence into ultrasound grading while exposing spatial predictions for inspection alongside severity estimates.
Authors:Haoxiang Huang, Xiang Liu, Shuwei Wang, Jingheng Ma, Sen Cui
Abstract:
Predicting smooth dynamics and collisions requires modeling continuous evolution and abrupt state changes. We introduce HamiFormer, a dual‑expert diffusion field combining whole‑window denoising with residual‑corrected Hamiltonian propagation. Their mixed‑state feedback attenuates the direct contribution of inherited autoregressive error: each mixed state guides subsequent propagation within the jointly refined window. Parallel Local Affine Scan (PLAS) amortizes iterative refinement across rectified‑flow steps and evaluates derivatives in parallel across physical time. PLAS's affine symplectic maps achieve lower solver error and runtime than sequential explicit Euler in our evaluation. A Regime Model Tree specializes residuals and routing to balance typical‑state accuracy against large tail errors. Our analysis gives conditions for physically consistent refinement and warm‑start tracking, and finite‑window error bounds under diffusion feedback. In 192‑step evaluations, HamiFormer reduces normalized phase‑space MSE by 26.3% against PhysiFormer on HamiBalls‑1 and 21.4% against DiT on HamiBalls‑2, with comparable model capacities. Disjoint‑interval comparisons show the lowest late‑horizon position and momentum errors among baselines on both datasets. Project page: https://hamiformer.github.io/.
Authors:Xuesong Li, Shuai Chen, Feng Li, Zhongliang Jiang, Nassir Navab, Yuan Bi
Abstract:
Ultrasound (US) acquisition depends on the operator's ability to interpret anatomy and anticipate how the view will change with probe motion. Many robotic US navigation methods select actions without explicitly predicting these anatomical changes. We propose SonoGraph‑WM, an action‑ and goal‑conditioned world model for anticipatory probe navigation. The model represents anatomy as scene graphs (SGs), capturing visible structures, their geometry, and spatial relationships without synthesizing US images. Given a history of SGs and probe poses, a unified Transformer jointly predicts future SGs and poses. A receding‑horizon planner recursively imagines candidate trajectories, selects the shortest predicted path reaching a goal graph, and follows it over a short execution horizon before replanning from new observations. To reduce reliance on tracked and anatomically annotated US sequences, we generate aligned SG‑‑pose training data from computed tomography (CT) label maps along surface‑constrained probe trajectories. On four held‑out CT cases, spatial relation F1 remains above 93% over 20 prediction steps, and closed‑loop navigation achieves 77.50% and 75.00% success for the gallbladder and pancreas, respectively, using annotation‑derived SGs. In robot‑‑phantom navigation experiments with label‑map‑derived SGs, the planner reached the target view in 73.7% of trials. These findings support CT‑supervised anatomical world modeling for probe planning and highlight the importance of frequent observation updates for reliable navigation. Project Page: https://noseefood.github.io/us‑sonograph‑wm/
Authors:Wojciech Paupa
Abstract:
We deformalize an LLM‑generated proof within the formalism of Homotopy Type Theory that an iterated pushout construction for \operatornameSP^3(X) is a set whenever X is a set. The proof expands on a similar proof by Buchholtz for \operatornameSP^2(X), employing a similar encode‑decode strategy and the same formal machinery.
Authors:Samet Hicsonmez, Eray Çakar, Nermin Samet, Fatma Güney
Abstract:
Accident anticipation aims to recognize anomalous driving cues before a crash while avoiding false alarms during normal driving. Existing approaches typically formulate this task as binary classification, focusing on whether an accident will occur rather than when it will occur. We propose PRE‑ACT, a framework that models accident risk as a continuously evolving signal that increases as the crash approaches. By explicitly enforcing temporal ordering and distance‑to‑accident awareness, our method progressively raises risk while suppressing premature alarms, leading to significant improvements on MM‑AU subsets and Nexar. We further introduce a Separation Score to evaluate the global behavior of predicted risk curves beyond local temporal windows. Code and visualizations are available at https://github.com/giddyyupp/PRE‑ACT.
Authors:Xinhan Yang, Lu Lu, Shancong Mou
Abstract:
Derivative‑informed training improves neural operators by directly supervising their input‑output sensitivities, which is crucial when neural operators are used as differentiable surrogates for inverse problems, PDE‑constrained optimization, design, and control. However, existing methods rely on offline‑generated derivative labels, making data generation slow, storage‑intensive, and difficult to adapt across datasets, resolutions, or perturbation bases. We propose sketched tangent consistency loss (sTCL), an on‑the‑fly derivative‑informed training objective that, for PDEs with a known and differentiable residual, enforces sensitivity consistency directly from the governing equation without offline tangent labels or neural‑operator architecture changes. sTCL uses randomly sketched input perturbations to provide a lightweight derivative‑level physics constraint during training. However, raw forward‑sensitivity residual penalties can fail for stiff, ill‑conditioned, indefinite, or coupled saddle‑point tangent operators. To address this, we introduce lightweight operator‑aware loss‑conditioning mechanisms selected by a simple tangent‑operator decision rule. Across Helmholtz, nonlinear diffusion‑reaction, Burgers, Allen‑Cahn, and Navier‑Stokes, with the same neural‑operator backbone for all methods, the PDE‑specific sTCL losses achieve solution and Jacobian accuracy comparable to offline derivative‑informed training (DIFNO) while eliminating the offline derivative‑data generation and storage pipeline. These results show that on‑the‑fly derivative‑informed training need not merely amortize offline tangent‑solve cost into training; with appropriate sketching and loss design, sTCL provides an effective drop‑in path to derivative‑informed neural operators. Code is available at https://github.com/yang9579/Derivative‑informed‑traning‑on‑the‑fly.
Authors:Yihe Wang, Bohan Chen, Taida Li, Yujun Yan, Rui Yin, Xiang Zhang
Abstract:
Foundation models have recently shown strong potential for learning generalizable EEG representations, yet their effectiveness for event‑related potential (ERP) analysis remains unclear. In this work, we investigate two fundamental questions: 1) can foundation‑model learning benefit ERP analysis, and what limits the transfer of existing EEG foundation models to ERP tasks? 2) can the complementary advantages of single‑trial and averaged‑trial ERP be integrated into a unified training pipeline? To study these questions, we curate a large‑scale ERP corpus comprising 1,517,157 single‑trial ERPs from 3,696 subjects across 38 datasets and 18 paradigms. Leveraging this corpus, we introduce ERP‑FM, to the best of our knowledge, the first foundation model specifically developed for ERP representation learning. ERP‑FM uses single‑channel tokenization, temporal and spatial positional embeddings, and mixed masked autoencoding for large‑scale single‑trial pretraining. We compare our model against 17 existing methods on 12 downstream datasets covering ERP event/condition classification and neurological disease classification. Our model achieves the best overall average rank across all evaluated methods. Furthermore, our analyses reveal that both ERP and non‑ERP EEG pretraining can provide transferable representations for ERP tasks, while fine‑grained temporal tokenization is critical for effectively modeling transient ERP dynamics. We further find that single‑trial and averaged‑trial ERP play complementary rather than competing roles. Combining single‑trial pretraining with averaged‑trial downstream adaptation substantially improves neurological disease analysis. Overall, these findings establish an effective foundation‑model training pipeline for ERP analysis and represent significant progress toward generalizable ERP representation learning. Source code: https://github.com/DL4mHealth/ERP‑FM
Authors:Chao Peter Yang, Cynthia Rudin, Yue Jiang, Simon Mak, Stephen Ni-Hahn
Abstract:
Deep learning has transformed symbolic music generation by borrowing the training paradigms of large language models, with systems such as NotaGen now producing complete, stylistically convincing classical scores from a short prompt. These systems could become powerful creative partners, helping musicians generate endless possibilities. However, current systems expose almost no control handles on the music itself. In principle, control handles could be built into a foundation model trained from scratch, but this is rarely practical without massive amounts of quality annotated data and compute resources. We therefore present MotiGen, a recipe for retrofitting pretrained symbolic music models to use new instruction prompts. MotiGen injects a musical motif as a structured prompt line, reinforces it with a scalar attention bias toward the motif tokens, and learns the association with a two‑phase curriculum. First, it learns from focused excerpts cropped around motif occurrences in the training data, then full scores including the motifs. Our experiments show that our model composes with the prompted motif in over 92.3% of generated pieces. Generated pieces using a variety of motifs are included in our sample site: https://motigen‑site.github.io/.
Authors:Nanxi Yu, Kang Li, Ye Du, Xiaowei Hu, Weihua Yang, Shujun Wang
Abstract:
Domain incremental learning is essential for adapting ophthalmic deep learning models to sequential clinical domains while preserving diagnostic expertise. Existing domain incremental learning methods predominantly address the domain shift induced by style variations. However, they often overlook the severe class imbalance inherent in real‑world clinical scenarios, such as clinical referral systems. Institutions in these systems encounter drastic fluctuations in class priors, resulting in label distribution shift, a critical form of domain shift that triggers severe catastrophic forgetting. To address these challenges, we propose ToRe, a rehearsal‑free and parameter‑efficient framework that leverages frozen ophthalmic foundation models for robust incremental adaptation. ToRe employs a parameter isolation strategy to decouple domain‑specific optimization paths, thereby helping mitigate catastrophic forgetting driven by both label distribution shift and style variations. Simultaneously, it introduces token‑adaptive recursion that adaptively allocates additional computational depth across tokens, allowing simple tokens to exit the recursion loop early while subjecting complex tokens, such as those associated with lesions, to deeper recursive processing. This mechanism enhances the feature representations for minority classes, thereby supporting generalization throughout the domain incremental learning process. Extensive evaluations on nine heterogeneous datasets demonstrate that ToRe consistently outperforms state‑of‑the‑art methods in overall performance across the three benchmarks, while maintaining near‑zero forgetting. Together, these results support the applicability of ToRe to dynamic and imbalanced clinical environments. The code is available at https://github.com/Nancyolo/ToRe
Authors:Zexin Feng, Yixu Feng, Lingyu Xiao, Shang Su, Kexin Zheng, Chang Xu, Mengkai Shi, Shuo Feng, Xintao Yan
Abstract:
World Action Models (WAMs) acquire behavioral priors by modeling future scene evolution, but predicting detailed futures in pixel or latent space incurs substantial cost. Recent evidence that co‑training gains persist without test‑time generation raises a question: what must a WAM learn to improve control? We introduce Copper‑Policy, which learns a compact World representation with the policy rather than relying on a predefined target space. Through temporal joint‑embedding prediction, it predicts future observation embeddings conditioned on task intention without reconstructing pixels. This prediction and action decoding shape the representation jointly, while the policy retains access to current‑frame spatial detail for execution. Representation analyses show that the learned features better separate task‑driven change from perturbations and provide complementary information for control. Compact prediction targets reduce training tokens per sample, enabling a 2B‑parameter model trained in 9.67 hours on 8× RTX 5090 GPUs and 6× faster than Fast‑WAM on matched A100 GPUs. Copper‑Policy outperforms every compared method without embodied pretraining on RoboTwin and several embodied‑pretrained VLAs on LIBERO‑Plus (80.85%). On three challenging real‑robot tasks, it performs comparably to π_0.5 and attains a higher average score. Together, these results show that Copper‑Policy combines strong control performance with efficient training.
Authors:Yufan Zhou, Yuxuan Liu, Enze Ma, Lyumanshan Ye, Zhongqi Yue, Robin De Croon, Yucheng Jin, Katrien Verbert, Zhao Wang
Abstract:
Persona prompts ask language models to answer as particular kinds of people. We test whether relationships learned from these effects predict responses to new questions and remain useful across models and prompts. Across 57 attributes, three behavioral domains, and seven pairs of open 7 to 9B checkpoints, persona effects can be predictable without being portable. Separate attribute and task gains improve prediction beyond shared scaling significantly in OLMo‑3 and Qwen2.5, with the most robust evidence in OLMo‑3. In that model, target refitting significantly outperforms gains borrowed from each of the other six pairs. Across model transfers, borrowed gains with one amplitude underperform shared scaling in most directions; allowing two target parameters removes the significant losses but yields no significant benefit over target shared scaling. After rewording, refitting significantly outperforms reuse with one amplitude in all six tested pairs, while changes of examples or country context often preserve reuse value. In the tested prompt transfers, regularized updates outperform both reuse strategies in median at 64 target questions per attribute. A separate survey comparison finds that selecting the more responsive checkpoint can worsen human fit; responsiveness is confounded with training status, and temperature calibration largely removes this cost but not errors in group ordering. Within the tested gain representation, apparent transfer can come from target calibration; source relationships must add predictive value beyond calibration and regularization. Code and data are available at https://github.com/thzva/persona‑gain
Authors:Francesco Brigante, Luca Cerovaz, Davide Marincione, Giorgio Strano, Luca Zhou, Emanuele Rodolà, Michele Mancusi
Abstract:
Audio autoencoders compress waveforms into compact latent representations that serve as the interface between raw audio and downstream models. Current systems navigate a three‑way trade‑off between reconstruction quality, semantic structure of the latent space, and inference speed, typically favoring one or two of these at the expense of the others. This paper introduces SAGE, Semantic Audio Generative Encoder: a compact variational autoencoder, trained solely on publicly available music, that shapes its latent by distilling embeddings from a pretrained audio‑text model. This 105M‑parameter model runs at the inference cost of Stable Audio Open and reaches the listening‑test quality of SAME‑L, an autoencoder 8x larger and 4x slower, while surpassing both on objective perceptual and distributional metrics of reconstruction. Furthermore, it sets the state of the art on all nineteen probing tasks of latent semantics, in domain and out of domain. These results establish SAGE as a lightweight audio autoencoder that strikes the best balance of the three‑way trade‑off among those we evaluate, combining high reconstruction fidelity, state‑of‑the‑art semantic structure, and fast inference.
Authors:Xuezhi Niu, Didem Gürdür Broo
Abstract:
Multi‑robot task allocation (MRTA) in dynamic environments faces a fundamental tension: effective coordination requires learned structure, but that structure must adapt when conditions change. Existing methods resolve this by assuming prior task knowledge, a utility function, a cost matrix, or a trained policy making them brittle when deployed without such knowledge or when task distributions shift. We present MORPH(Multi‑agent Online Rewiring through Plasticity‑guided Hierarchy), a training‑free MRTA framework where global allocation quality emerges from 4 local plasticity rules (synaptic, homeostatic, structural, and metaplasticity) applied to a directed pairwise preference matrix updated from runtime co‑occurrence and task‑completion feedback. MORPH requires no task model, no bid computation, and no offline training; response decisions use learned AGV‑to‑Picker preferences rather than a fixed proximity rule. Within the Gerkey‑Mataric MRTA taxonomy, MORPH is the first method in the single‑task, single‑robot, instantaneous‑assignment class to learn directed pairwise allocation preferences online. Evaluated on the TA‑RWARE warehouse benchmark (8‑24 agents, 4 maps, 800 steps per episode, 5 seeds), MORPH achieves 110% of all‑to‑all throughput at N=24 while using only 21% of possible coordination links as an efficiency advantage that grows monotonically with fleet size. Under spatial task distribution shift, MORPH degrades 3x less than proximity‑based methods while its learned preferences remain uncorrelated with Manhattan distance. Systematic ablation confirms all four plasticity rules contribute measurably. Two allocation properties emerge without programming: cross‑type preference dominance and progressive preference sparsification, mirroring the developmental refinement of biological neural circuits. Learned preferences are driven by task co‑occurrence history, not spatial proximity.
Authors:Ziwei Huang, Qi Gao, Zhe Ji, Yuanyuan Yao, Fengjiang Zhang, Min Yan, Zhongle Xie, Gang Chen
Abstract:
Intraoperative anesthesia requires systems to interpret evolving multimodal evidence, recommend timely management, and revise decisions as patient states change, yet existing benchmarks usually isolate perception or single‑point reasoning. We introduce AnesTRACE, an evaluation suite comprising AnesTRACE‑Bench and AnesTRACE‑Eval. Built from public perioperative datasets with anesthesiologist annotation, AnesTRACE‑Bench evaluates Intraoperative Perception, Single‑point Anesthesia Decision‑Making, and Multi‑step Anesthesia Decision‑Making. AnesTRACE‑Eval assesses open‑ended responses through anesthesiologist‑defined criteria for Clinical Correctness, Evidence Grounding, Task Completeness, and Safety, with Temporal Consistency for multi‑step decisions; its domain‑specific evaluator is trained by supervised fine‑tuning and preference alignment on expert‑reviewed judgments. Across more than 30 models, fine‑grained visual grounding and intervention selection remain difficult: the leading model reaches only 32.2 mIoU for TEE visual grounding and retains a 17.5% Major/Critical Safety Error Rate in multi‑step management. Evaluator alignment with anesthesiologists improves across both training stages, while the best decision quality is accompanied by a 74.3‑second P95 Latency. These results show that aggregate performance alone does not establish safe, timely longitudinal decision‑making. We release our code at https://github.com/zjuDBxAI/AnesTRACE.
Authors:Weixing Chen, Weipeng Zhang, Nan An, Yang Liu, Liang Lin
Abstract:
World models are moving from generating realistic frames to generating playable worlds, yet whether a delivered world can keep running is not tested anywhere. Existing evaluations stop at generation, at delivery, or at single‑step transitions, and each stops at a different point along the way. Correct local state transitions or intermediate outcomes do not guarantee a correctly organized causal event flow. We propose the world agent task, which moves the evaluation point of world generation from the moment of delivery to the continued operation that follows. In this task, a model is not asked to generate a world. It is held responsible for keeping the world running, which requires coordinating events and carrying forward their consequences to constrain subsequent evolution. We instantiate the task in WorldAgent‑Benchmark with two complementary tracks. In the maintenance track, the model must ground the events of a continuous narrative into correct transitions of the explicit world state while respecting causal, temporal, and concurrency constraints. In the deduction track, the model must predict how the world will evolve under partial observations and act toward a goal. The maintenance track combines LLM‑assisted semantic judgments with programmatic validation and scoring, while the deduction track is evaluated entirely programmatically. Individual judgments are auditable against world states and execution logs, and scores can be recomputed from the saved judgments and execution records. Across 8 models, scores decline steadily as pre‑built structure is removed from the world, and causal‑relation checking is the weakest component for every model. The benchmark makes the continued operation of a world measurable and distinguishes local completion from failures in event organization. Code and dataset will be released on https://github.com/HCPLab‑SYSU/WorldAgent‑Benchmark.
Authors:Jintao Tong, Yujing Lou, Zhanming Shen, Jiaqi Gu, Lubin Fan, Ruixuan Li, Yue Wu, Jieping Ye, Yixiong Zou
Abstract:
Recent multimodal large language models (MLLMs) advance visual reasoning by strengthening both perception and reasoning, implicitly assuming a process that transitions seamlessly from perception to reasoning. However, we observe a counterintuitive phenomenon that challenges this assumption: holding the model, question, and decoding fixed, we replace images with their caption or code representations (symbolic views), which seems to be redundant given the clear image structures, but the performance surprisingly improves by 10.2% to 23.6% across model scales and datasets. We term this performance gap as the Symbolic Visual Gap and then take a closer look at it. Through experiments, we find that although the visual evidence can already appear in the reasoning trace for the image‑input model, the symbolic‑view‑input model shows much higher attention to the correct evidence than the image‑input model. This suggests that despite good capabilities from current works in perception and reasoning themselves, another bottleneck exists between perception and reasoning in selecting perceived visual information as appropriate evidence for subsequent reasoning. To handle this bottleneck, since the symbolic view steers attention toward correct evidence and is readily obtained at scale, it provides supervision for evidence selection without manually labeled evidence. Building on this, we introduce MM‑OPD, a multimodal on‑policy self‑distillation framework for symbolic‑to‑visual correction that transfers guidance from symbolic‑conditioned behavior to the image‑conditioned policy through residual token‑level targets, steering the model toward correct visual evidence. Experiments across benchmarks and model scales show that MM‑OPD improves a broad range of multimodal abilities, with gains in visual perception, chart and document understanding, mathematical reasoning, and general VQA.
Authors:Zifeng Cheng, Lingyun Qian, Zhiwei Jiang, Cong Wang, Yafeng Yin, Fei Shen, Ao Zhou, Qing Gu
Abstract:
Extracting conditional text embeddings from large language models (LLMs) is a promising paradigm, as it requires neither additional data nor fine‑tuning. Existing methods incorporate conditions into prompts to guide LLMs to focus on specific aspects and elicit conditional text embeddings. However, relying solely on prompts often fails to produce high‑quality conditional text embeddings, as they remain entangled with general text embeddings, ultimately degrading their quality. To this end, we propose an inference‑time, plug‑and‑play Self‑Contrastive Steering (SCS) method that constructs unconditional general text embeddings and uses them to refine conditional text embeddings, making them more focused on the target condition. Specifically, we modify the attention mask and positional encodings to mask the condition, thereby obtaining unconditional text embeddings and intervening in the multi‑head self‑attention computation process. Notably, our method is highly efficient, requiring only a single additional multi‑head self‑attention computation at inference time. Extensive experiments on clustering, Semantic Textual Similarity, and triplet alignment datasets demonstrate that our method can seamlessly improve the performance of existing prompt‑based methods across different LLMs in a training‑free and plug‑and‑play manner. Our code will be released at https://github.com/zifengcheng/SCS
Authors:Ningfeng Yang, Tor M. Aamodt
Abstract:
Quantization‑Aware Pre‑Training (QAPT) can increase the inference efficiency of DNNs, but a problematic behaviour known as rounding boundary weight oscillation can introduce detrimental noise into the training process and significantly reduce convergence speed. While existing methods can reduce this detrimental noise, they either introduce additional hyperparameters or memory overhead, or cannot consistently improve model accuracy. In this work, we propose optimization with Constrained Empirical Weight disTribution (CEWT), the first hyperparameter‑free memory‑overhead‑free oscillation suppression method that consistently improves QAPT performance: an optimizer post‑update step that projects weights to the nearest point in weight space whose empirical distribution (histogram) matches a zero‑mean Gaussian. Our key insight is many quantizers are designed with the implicit assumption that the to‑be‑quantized data are permutations of samples from a zero‑mean Gaussian, and this assumption is not true during QAPT. By enforcing the zero‑mean Gaussian prior as a hard constraint, CEWT can suppress this detrimental noise. Empirical results on various combinations of SOTA quantizers and hypersphere optimizers suggest, that with a geomean increase of 4% in training time, CEWT can consistently reduce the pre‑training perplexity (by an average of 2.5 and up to 21 points) of low‑precision (down to 1‑bit activations and weights and up to 610M parameters) LLaMA/GPT models without introducing any hyperparameters or storage overhead. Code is available at https://github.com/1733116199/cewt
Authors:Xutao Mao, Rui Qian, Linghan Chen, Yudong Gao, Junchi Liao, Jiulin Cai, Jinman Zhao, Cong Wang
Abstract:
LLM agents now execute tasks end to end with permission to change real systems and increasingly orchestrate subagents that differ in capability and cost. Prior work treats the choice of subagent as an optimization problem. Yet the orchestrator makes this choice from the identities that subagents display, and an attacker can spoof them. Displayed identity thus decides operational authority, meaning who is trusted to check the work and who is allowed to change it. As a result, a risky subagent can keep authority over execution even after other evidence contradicts it. We introduce TrustFork, an LLM agent safety benchmark with 1,890 tasks and 27,826 valid trajectories across 16 agent systems. These systems run eight orchestrators under the OpenCode, OpenClaw, and Pi harnesses. In each task, one subagent carries a risky goal while the other three stay aligned with the user, so contradicting evidence can exist. A task can also change the identity a subagent displays without changing the model behind it, which lets us trace a shift in authority to the label. Our analysis shows that even when another subagent contradicts the risky response, the orchestrator still acts on it in 72.0% of cases on average, most often in the systems with the least terminal harm. Swapping the family labels nearly triples how often the orchestrator obtains the risky response. A safer response is available in 84.0% of tasks, yet it decides the outcome in only 25.0%. The harness also decides which responses reach the orchestrator. Among three runtime defenses, hiding identity cues helps most consistently, while verifying before action helps only when the harness returns enough evidence. TrustFork shows that production agent orchestration must bind authority to evidence before execution causes harm. Our project is in https://henrymao2004.github.io/agent‑orchestration‑safety/.
Authors:Rui Ding, Haopeng Li, Weize Ma, Yufa Zhou, Yitong Li, Xiaoling Zhou, Jiashuo Cao, Liyang Li, Hua Geng, Jiuxiang Gu, Jun Lin, Enze Xie, Xuan Shen
Abstract:
Video generation has broad applications in content creation and entertainment. Diffusion transformers have advanced the quality of generated videos, but attention over spatiotemporal tokens becomes increasingly expensive as video resolution and duration increase. We present DraftAttention2, a training‑free framework that uses the low‑resolution draft attention map to jointly select attention blocks and assign their numerical precision. Specifically, spatial 2D average‑ and max‑pooled queries and keys capture complementary regional statistics to estimate block importance, and a shared ranking assigns higher precision to important blocks, lower precision to less important retained blocks, and skips the rest under configurable budgets. Our analysis separates sparsification error from attention‑weighted quantization error, establishing when recovering skipped interactions with low‑bit computation tightens the output‑error bound. This analysis motivates retaining more interactions at low precision while reserving higher precision for blocks with larger attention mass. To translate these fine‑grained assignments into practical speedups, we further develop fused operand preparation and a single attention kernel with precision‑specific phases, sharing data movement, softmax statistics, and output accumulation across precisions. Experiments demonstrate that our method achieves a superior quality‑efficiency trade‑off over existing efficient video generation methods. Notably, its advantage is particularly pronounced for few‑step video diffusion, where jointly combining sparsity with 4‑ and 8‑bit mixed‑precision computation substantially improves generation quality while retaining significant acceleration. Code is available at https://github.com/anemoi‑project/anemoi
Authors:Minghui Qin, Yijun Yuan, Weicheng Zheng, Kenan Li, Weibang Wang, Chang Sun, Junhao Huang, Anmin Liu, Yicheng Yao, Hang Zhao
Abstract:
We introduce World SLAM Model (WSM), a unified framework that brings the SLAM paradigm directly into downstream navigation. Rather than treating SLAM merely as an upstream module that provides poses, maps or tokens, WSM adopts its core mechanisms, including incremental state updates with persistent memory and backend refinement of accumulated errors, to maintain a consistent world state during interaction. Given the current observation and a navigation goal, WSM predicts future visual states and jointly estimates their camera motion and dense geometry, grounding visual prediction in an evolving spatial world state. This spatial state is continuously updated as new observations arrive and provides the basis for action generation and closed‑loop navigation. WSM is trained end‑to‑end with a joint navigation‑‑SLAM objective, enabling downstream navigation to benefit directly from SLAM‑style state maintenance and refinement while preserving accurate geometric estimation. Experiments demonstrate improved navigation performance together with strong SLAM accuracy, highlighting the potential of SLAM as an intrinsic mechanism for long‑horizon world modeling and embodied interaction.
Authors:Qingjia Huang, Yakai Li, Jianguo Wu, Qihang Zhou, Aimin Yu, Xiaoqi Jia, Luping Ma, Weijuan Zhang
Abstract:
Large language models (LLMs) can produce factually incorrect answers with high confidence, undermining their reliability and limiting the effectiveness of uncertainty‑based error detection. While prior research attributes confident hallucinations to factors such as missing knowledge in training data, reasoning errors, or stochastic decoding, we uncover that post‑training alignment itself is a primary driver of these errors, a phenomenon we call the Alignment Paradox. Across five model families evaluated on factual benchmarks, unaligned base models produce few high‑confidence errors on long‑tail factual queries, whereas instruction‑tuned models multiply high‑confidence errors (p \ge 0.95) by more than an order of magnitude (10× to 35×). Layer‑wise probing with the Logit Lens reveals that this overconfidence emerges in late layers, where wrong‑answer margins expand past 4.0 points after remaining near zero across early and intermediate layers. These findings motivate limiting margin growth during post‑training. We implement this principle through an entropy‑dependent margin bound in direct preference optimization (DPO). In multi‑epoch experiments with Mistral‑7B, the bounded objective reduces high‑confidence errors by up to 35.3% relative to standard DPO while maintaining performance on evaluated general reasoning benchmarks. These results show that bounded margins mitigate confident hallucinations during post‑training.
Authors:Xutao Mao, Rui Qian, Longxiang Wang, Xinjian Yi, Mingxuan Li, Linghan Chen, Yudong Gao, Xiang Zheng, Cong Wang
Abstract:
LLM agents increasingly keep working after a task succeeds as they resume after compaction or take over handoffs. Their finished work keeps receiving follow‑up input that sometimes falsely accuses it for later failures. We call an agent's acceptance of such a false accusation gaslight sycophancy, and destructive over‑correction when acting on it damages previously correct work. We introduce CAVE‑Bench, a benchmark of 365 agentic tasks across six domains built around opaque tasks. Every scored run first reaches a verified correct state, whose supporting rationale and history stay in the workspace while the facts that would settle the accusation lie in external or runtime state beyond the agent's reach. The agent cannot confirm or refute the claim with a local check, so the right response should keep the work and ask for the missing evidence. Each task either hands the agent correct work with saved evidence or let it build and verify that work first, and five risk factors set how the accusation enters the workflow. We score accusation acceptance and evidence use from the trajectory and measure harm by deterministic replay of downstream events. Across 14 of the latest models in Claude Code, false accusations damage correct work in up to 60.06% of runs, and stronger models often do so after recovering the supporting evidence. The same model behaves differently across OpenCode, Codex, and Hermes, and a harness gate driven by the benchmark's live signals cuts replayed harm by 74%. These results show that preserving already‑correct work under unsupported accusation is a distinct safety challenge for long‑lived agents. Our project is in https://henrymao2004.github.io/agent‑over‑correction/.
Authors:Gal Wertheizer, Rom Himelstein, Tomer Peretz, Avi Mendelson
Abstract:
Adversarial attacks optimized on a single open‑weight LLM can transfer to and jailbreak architecturally different models, allowing an attacker with white‑box access to one model to compromise independently deployed systems. This creates a shared vulnerability across models, yet existing defenses are not designed for this cross‑model threat. We find that cross‑model transfer aligns with shared internal representation geometry, making it a natural defense target. AnchorRep targets this geometry directly with a lightweight LoRA adapter that pushes the defended model's internal representations of harmful prompts away from those of a frozen anchor model on the same prompts. Training uses a small set of harmful prompts and no adversarial examples. Across five models and four architectural families, AnchorRep reduces cross‑model attack success rate to <=1.1% on 2,000 transferred attacks (0% on two), including the largest drop on Mistral (36% ‑> 1.1%). Existing defenses can reduce transfer, but only at high cost either inducing up to 77% degenerate benign output or increasing over‑refusal by up to 18%. Because such degenerate benign outputs are not captured by standard refusal‑based metrics, we introduce the Benign Garble Rate to quantify them. Our results suggest that cross‑model robustness can be achieved by shaping representation geometry, without requiring attack‑specific training
Authors:Boxiao Wang, Kai Li, Yuheng Jing, Tianyi Liu, Chen Li, Yifan Zhang, Jian Cheng
Abstract:
Symbolic regression (SR) aims to discover compact and meaningful mathematical equations from data, but searching the vast combinatorial space of symbolic structures remains challenging. Existing methods typically guide this process using expression‑level objectives, such as fitting error, which assess a candidate equation as a whole but provide little information about whether an individual term contributes genuinely new structure or is largely redundant with the rest of the expression. We introduce Sobolev Novelty, a term‑level measure of structural independence for symbolic equations. For each term, we construct an empirical Sobolev signature from its function values and exact derivatives over the observed inputs, and quantify how much of this behavior cannot be reconstructed by the remaining terms. We further derive a theory‑calibrated threshold, yielding a principled and tuning‑free criterion for identifying structurally novel terms. Using this threshold, 92.6% of terms in benchmark ground‑truth equations exhibit sufficient structural novelty, compared with only 38.3% on average for expressions produced by 15 SR methods, revealing a substantial gap between scientific equations and current SR solutions. As a lightweight plug‑in, Sobolev Novelty can be incorporated into diverse SR paradigms to support term pruning, search guidance, LLM feedback, and data selection, yielding consistent performance gains and demonstrating broad applicability.
Authors:Zhuoqian Feng, Weixing Chen, Ziliang Chen, Yang Liu, Liang Lin
Abstract:
Feed‑forward models regress dense 3D point trajectories directly from monocular video, yet the residual after global alignment is substantial and lacks a structural explanation. Measured on dynamic query points across models and datasets, the error concentrates along the view direction, while the scale correction each motion group requires differs. The predicted displacement direction nevertheless supports reliable grouping, with a median angle far below the 90° random baseline. The systematic part of the residual is therefore a family of radial degrees of freedom per motion group, along directions 2D observations cannot constrain. We call it group‑wise view inconsistency. We present GAUGE (Group‑wise Adaptive Unsupervised Gauge Estimation), a training‑free and model‑agnostic post‑hoc module. It recovers motion groups from direction consistency and spatial connectivity, then estimates a per‑frame radial scale and group‑level translation from 1% to 5% metric anchors, four degrees of freedom per group and frame. On dynamic query points of eight trackers, including D4RT, 4RC and SM4RT, our correction lowers endpoint error by 15.1% to 62.6% over the uncorrected predictions, while spending the same anchors on gradient fine‑tuning improves the same models by only ‑1.1% to 15.2%. Code is publicly available at https://github.com/HCPLab‑SYSU/GAUGE.
Authors:Yuhang Jiang, Qingwei Liao, Kaize Yin, Xingling Liu, Luca Cuomo, Silvio Bacci
Abstract:
Work on memory for multimodal agents optimizes what is written, updated and retrieved. Between retrieval and the answer, however, is a stage that multimodal memory evaluations do not isolate: what of the retrieved memory reaches the model, and in what form. We call it delivery, and a controlled decomposition on MemLens locates the remaining room there. With the retrieved evidence set exactly fixed, delivering the original pixels instead of withholding them raises accuracy by 13.87 points on an 8B backbone, whereas making retrieval perfect on those same messages improves it by 2.31. Delivery is the larger term on all three MemLens backbones and grows with backbone strength; retrieval grows too, without closing the gap. We propose DeliverMem, an instantiation of delivery as three decisions: keep the original modality, give each item a readable identity, and state when it was seen, with a retrieval‑side adapter for the one property delivery cannot supply. Each is measured against a delivery‑matched control that alters only its own variable. DeliverMem leads the strongest published memory agent on MemLens at all four context lengths, and beats DMV‑Bench's own strongest method at every setting on both backbones. On MemLens it does this on a tenth to a seventieth of the input. Each decision helps only where the question lacks what it supplies, and is null elsewhere. A single fixed configuration nonetheless leads both benchmarks, without training any component or modifying the stored records. Project page: https://avalon‑s.github.io/DeliverMem/
Authors:Yulin Hu, Yanyan Zhao, Zimo Long, Xing Fu, Mengtong Ji, Weixiang Zhao, Yutai Hou, Qianchao Wang, Dandan Tu
Abstract:
Long‑term memory is essential for multimodal agents that interact with users across sustained conversations. However, user memories are not always explicitly stated: they may also be implied by recurring background objects in images, ambient sounds in audio, or other peripheral multimodal cues. Existing benchmarks largely focus on text‑only memory or explicit multimodal evidence, leaving implicit multimodal cues underexplored. We introduce CUE‑Mem, a text‑image‑audio benchmark for evaluating long‑term user memory from implicit cues. CUE‑Mem contains 2,674 questions across explicit and implicit evidence settings and covers four tasks: Entity Recall, Long Pattern, Personalized Recommendation, and Answer Refusal. Across textualized memory systems, implicit performance remains far below oracle evidence, locating the main bottleneck in preserving and retrieving subtle cues rather than question answerability. Increasing caption detail recovers more of this evidence, but brings uneven gains and rapidly growing token costs, motivating native multimodal access. Yet native access does not uniformly resolve the bottleneck: evidence use depends strongly on the backbone, while multimodal indexing introduces substantial retrieval noise. CUE‑Mem provides a testbed for memory systems that selectively retain, retrieve, and use subtle multimodal evidence.
Authors:Alejandro José Soto Franco, Kobe Marshall-Stevens
Abstract:
We formalise in Lean 4, on top of Mathlib, the solvability of the Dirichlet problem for second‑order linear elliptic operators in divergence form. The machine‑verified results, with no sorry in the development, include the Poincaré inequality, the existence of weak solutions by the Lax‑Milgram theorem, Rellich‑Kondrachov compactness, the Fredholm alternative, the spectral theorem, interior regularity estimates, and the Sobolev embedding theorem. From these results we obtain a formalisation of classical solvability for sufficiently regular coefficients and data. Our Lean library includes a self‑contained theory of Sobolev spaces developed independently of existing formalisations. Throughout the paper we associate each prose statement with the named machine‑checked Lean declaration that discharges it.
Authors:Peng Wang, Haohan Zou, Yanlin Wu, Xueshuo Xie, Yan Wang, Tao Li
Abstract:
Accurate classification of anterior segment diseases is crucial for ophthalmic screening and diagnosis. However, slit‑lamp image analysis remains challenging due to substantial variability in imaging conditions and the intrinsic anatomical‑disease hierarchy of ocular pathologies. Existing methods typically formulate this task as a flat multi‑class classification problem, ignoring the structured dependency between anatomical regions (e.g., cornea, conjunctiva, and lens) and disease manifestations.To address these limitations, we propose CFCH, a Coarse‑Fine Collaborative Hierarchical learning framework that explicitly models anatomical context and disease semantics through a dual‑branch architecture. To enable effective cross‑granularity collaboration, CFCH introduces semantic and cross‑granularity attention consistency constraints, encouraging aligned yet complementary feature learning across branches. In addition, we construct AS‑9K, a large‑scale anterior segment dataset with 8975 images covering 12 common disease categories. To the best of our knowledge, AS‑9K is the largest publicly available dataset for anterior segment image classification. Extensive experiments on two anterior segment datasets demonstrate that CFCH outperforms state‑of‑the‑art methods. Qualitative visualizations further show more focused and lesion‑relevant activation responses, validating the effectiveness of the proposed framework. Code will be available at https://github.com/ybupengwang/CFCH.
Authors:Benjamin Hamm, Yannick Kirchhoff, Maximilian Rokuss, Moritz Langenberg, Constantin Ulrich, Tassilo Wald, Jeremias Traub, Karol Gotkowski, Klaus Maier-Hein
Abstract:
Dynamic contrast enhanced breast MRI (DCE‑MRI) is a powerful clinical tool for breast cancer detection, providing high resolution anatomical detail together with rich temporal contrast information. However, high dimensional 4D inputs, small lesions, and heterogeneous acquisition protocols across clinical sites hinder robust automated classification of healthy, benign, and malignant cases. To address these challenges, we propose a framework that dynamically analyzes latent representations to adapt to protocol‑specific characteristics. Spatial variability is mitigated by reducing confounding background uptake and compensating for misalignment caused by deformable soft tissue. Additionally, relationships in the latent space across phases are leveraged to select the most informative temporal features, improving robustness to protocol‑specific temporal variability. Finally, task specific discriminative features are promoted through large scale supervised lesion segmentation pretraining, which substantially enhances downstream finetuning. Evaluated under leave‑one‑center‑out validation on the ODELIA dataset and the held‑out AMBL cohort, the proposed framework substantially outperforms finetuned radiology foundation models and prior methods, improving mean AUROC by nearly 8 points and balanced accuracy by 4 points over the strongest baseline. Additionally, our method achieved first place in the MICCAI ODELIA Breast MRI Challenge 2025, further demonstrating its effectiveness for robust breast cancer classification. We publicly release our codebase under https://github.com/MIC‑DKFZ/CURIAtor.
Authors:Yikai Wang, Xiao Han, Mengmeng Xu, Juan Camilo Perez, Yiannis Douratsos, Sen He, Zijian Zhou, Fei Zhang, Zhaochong An, Juan-Manuel Perez-Rua, Chen Change Loy, Tao Xiang
Abstract:
Few‑step autoregressive video diffusion generates a long video by splitting the video into temporal chunks and generating chunk‑by‑chunk, each through a short sequence of denoising stages. To memorize chunks that are already generated, previous methods reconstruct a clean or less‑noisy key‑‑value (KV) cache by additional forwards to build the cache without advancing an output latent. However, every denoising forward itself already computes the in‑flight KV of the current chunk. We introduce FlashForward, which directly reuses this cache to avoid the heavy cache‑update‑only model forwards. After the current chunk completes one denoising stage, its stage‑specific cache is already available for the next chunk. Assigning one GPU to each stage therefore lets different chunks occupy different stages concurrently. This early availability has a quality cost: the resulting stage‑matched history is noisy, causing appearance and motion drift among chunks. To complement it, FlashForward produces sparse auxiliary clean anchor latents before the corresponding region is generated so the generation trajectories can be stabilized by this two‑sided conditioning. The two memories operate at different temporal scales: sparse clean anchor KV supplies coarse, long‑range two‑sided structural guidance, while dense stage‑matched history preserves fine, recent evolution. With up to four GPUs, FlashForward runs 1.16‑‑1.69× faster than HiAR and 1.42‑‑2.92× faster than Self‑Forcing for 16 FPS videos of 20 seconds or longer across 1.3B and 14B backbone scales at 480p and 720p. On VBench, for the 1.3B model at 480p, it achieves higher scores and remains stable at longer durations, demonstrating that FlashForward generates high‑quality and temporally consistent videos across durations of 20s, 35s and 65s at a much faster generation speed.
Authors:Md Muhiminul Islam, Shoaib Ahmed Dipu, Sayeed Shafayet Chowdhury
Abstract:
Spiking‑Mamba hybrids reach strong accuracy on event‑based vision, but existing designs often require tens of millions of parameters. Much of that cost comes from how the spiking front‑end is connected to the state‑space backbone rather than from the hybrid architecture itself. In a representative model, a single resolution‑dependent projection accounts for 33.55M of 36.25M parameters. To that end, we introduce RIPE‑MambaSpike (Resolution‑Independent, Parameter‑Efficient), which replaces that projection with a hierarchical multi‑resolution bridge of fixed channel width. Its deployed footprint is 0.870M parameters, constant at fixed time steps and widths across a 43x range of input areas. Reparameterized spiking stages, temporal decoupled modulation, and a dynamic convex‑hull‑bounded dual‑stream membrane‑potential attention preserve accuracy under this compact design. Result‑wise, RIPE‑MambaSpike is pareto‑optimal on CIFAR10‑DVS, N‑Caltech101, and DailyDVS‑200. Notably, on the 200‑class DailyDVS‑200, a scaled 8.04M configuration achieves 45.7% top‑1 accuracy, the best reported spiking result on that benchmark, and outperforms prior spiking methods with 3.0‑15.1x fewer parameters than dense ANNs. Overall, our findings demonstrate that competitive event‑based recognition does not require resolution‑dependent parameter growth. Code is available at https://github.com/MuhiminOsim/RIPE‑MambaSpike.
Authors:Hong Kiat Tan, Linh Le, David Williams-King
Abstract:
Difference‑in‑means steering requires activations recorded while a model shows the desired behavior, which a sandbagging model withholds by deliberately underperforming. We introduce Activation Flow (ActFlow), which manufactures these activations from k correct labels without fine‑tuning. ActFlow sets target logits that rank each labeled item's correct answer first, and moves the logits toward them by adding one vector x to all k residual streams at one layer. ActFlow is a family of ordinary differential equations for x, one for each rule that maps the required logit change to the velocity of x. The smallest‑norm rule lands exactly on the targets, while the others keep only the top singular directions of the Jacobian. We test ActFlow on three instruction‑tuned models, each locked by a sandbagging prompt and by a password‑locked LoRA. At k=40, ActFlow keeping five singular directions raises the mean held‑out ARC‑Easy accuracy over the six locked models from 0.05 to 0.85, against 0.88 for fine‑tuning and 0.92 for the honest models. Furthermore, it scores higher than the smallest‑norm rule in 16 of the 18 combinations of locked model and k, and its steering direction is nearly orthogonal to the honest difference‑in‑means direction. It also unlocks two LoRA locks where the honest direction fails.
Authors:Deepak Kanneganti, Sajib Mistry, Sheik Fattah, Aneesh Krishna
Abstract:
Artificial Intelligence as a Service (AIaaS) composition is an emerging research area that enables clients to combine multiple AI services to meet complex requirements. A recent extension of this paradigm is collaborative AIaaS composition, where multiple AI services are combined to create a unified solution. Research in this field requires datasets with service descriptions, composition requests, and corresponding composition solutions. However, no dataset contains all this information specifically for collaborative AIaaS composition. Existing datasets target traditional web services or sequential AI workflows and lack the AI‑specific attributes required for realistic collaborative composition. To address these challenges, we present a collaborative AIaaS composition dataset containing 25,900 AIaaS services from multiple providers across 12 AI task families, along with 10,000 collaborative service requests. We further develop a Multi‑Armed Bandit (MAB)‑based collaborative composition algorithm that determines the composability of candidate service combinations prior to composition. Experimental results demonstrate that the dataset supports realistic collaborative AIaaS composition evaluation and related research in service recommendation, selection and QoS prediction. The dataset and implementation are publicly available at: https://github.com/deepakkanneganti9/CAIaaS
Authors:Wenxu Jia, Xize Cheng, Zihan Zhang, Dongjie Fu, Linjun Li, Wenshi Chen, Yangyang Wu, Tao Jin
Abstract:
Long‑term memory enables agents to accumulate information and reason across sessions, yet existing research primarily focuses on dyadic text or image‑text conversations, leaving long‑term memory for multi‑party spoken conversations underexplored. This setting requires preserving conversational content, identifying participants across sessions, and retaining who speaks to whom. To this end, we propose VoxPolyMem, an interaction‑aware multimodal memory framework combining incremental speaker identification with a memory hierarchy comprising interaction memory, fact memory, and participant profiles. We formulate retrieval as sequential decision‑making, where an agent rewrites queries and selects retrieval tools and memory layers based on accumulated evidence to address information gaps. We further introduce Evidence‑Gain GRPO (EG‑GRPO), which uses round‑wise credit assignment to encourage complementary evidence acquisition. We also construct VoxPolyBench to evaluate memory evolution, personalized answering, memory retrieval and reasoning, and interaction reasoning and attribution in multi‑party spoken conversations. VoxPolyMem achieves an overall score of 85.0 on VoxPolyBench, surpassing the strongest evaluated baseline by 23.6 points. On Mem‑Gallery and H2HMem‑Multi, it scores 89.6 and 74.4, respectively, exceeding the strongest evaluated public memory baselines by over 8 points each. These results highlight its potential for persistent, personalized assistance in multi‑party multimodal interactions. Code and datasets are available at https://voxpolymem.github.io/VoxPolyBench/demo/
Authors:Jeonghyeok Do, Munchurl Kim
Abstract:
Cloud removal methods are typically specialized to individual datasets and input configurations, limiting reuse across sensors, spectral bands, and observation settings. We introduce GeoCR, a generalist model that unifies RGB‑only‑based CR and multispectral‑based CR from single‑ or multi‑temporal cloudy observations, with optional SAR guidance, within a single network. To accommodate different spectral and sensing domains, compact input and output stems extend a pretrained RGB autoencoder while keeping its encoder and decoder trunks frozen. This shared latent interface enables a single flow transformer to jointly model clean RGB and non‑RGB latents, conditioned on separate cloudy‑observation streams and optional SAR tokens. Through joint pretraining on the training splits of ten datasets comprising 883,331 cloud‑free target images, GeoCR learns a shared cloud removal prior across these heterogeneous configurations. The same pretrained checkpoint supports direct inference without dataset‑specific fine‑tuning and efficient adaptation through low‑rank adaptation (LoRA). We evaluate GeoCR against general image restoration and cloud removal methods on test splits of the contributing datasets under full‑band and RGB‑only settings. GeoCR achieves the best FID and DISTS on full‑band SEN12MS‑CR and Sen2_MTC_New and RGB‑only CUHK‑CR2, outperforming existing models and demonstrating the effectiveness of a reusable generative model across diverse settings.
Authors:Uliana Parkina, Askar Tsyganov, Sergei Kudriashov, Sergey Samsonov, Maxim Rakhuba
Abstract:
We present a fully GPU‑oriented SVD pipeline based on polar decomposition, motivated by iterative methods that rely solely on matrix multiplications, such as the Newton‑Schulz iteration. We show that this approach enables up to a 2× speedup compared to standard implementations. Furthermore, we derive a numerically stable backward pass for the polar decomposition and leverage it to obtain a fully differentiable SVD. Our methods are released as open‑source implementations in both PyTorch and JAX: https://github.com/fallnlove/cans_svd.
Authors:Duc-Tri Tran, Phi Le Nguyen, Minh Hoai
Abstract:
We propose a self‑supervised framework designed to enhance the capability of scene text detectors in identifying and recognizing text in scenarios where instances are shown at significant distances, typically small, blurred, and frequently missed by conventional models. Our approach leverages the high‑fidelity performance of existing text spotting models on large, clear text as a foundational supervisor. By temporally back‑tracking these high‑confidence detections through video sequences, we automatically synthesize pseudo‑labels for preceding frames where the distant text is still visually degraded or undersized. These pseudo‑labels enable training a student model specialized for early text detection, without requiring any manual annotation. The success of this approach depends on accurate pseudo‑label generation, for which we develop a dedicated scene text tracker capable of maintaining consistent text identities across challenging video sequences. In addition, we propose SceneText50, a diverse multilingual outdoor dataset to facilitate training and evaluation. Experiments show that our framework significantly improves early detection accuracy and robustness across varied scenes and languages. Code and data are at \hrefhttps://github.com/trid2912/BackTrackingTexthttps://github.com/trid2912/BackTrackingText.
Authors:Shuoyuan Wang, Beier Luo, Hao Zeng, Chengyao Yu, Songxin Zhang, Zejian Xie, Bingyi Jing, Hongxin Wei
Abstract:
Large reasoning models (LRMs) often suffer from overconfidence when expressing their uncertainty. Confidence‑aware reinforcement learning (RL) offers a promising way to optimize calibration. However, it relies on on‑policy rollouts and is thus constrained by the model's pre‑RL confidence distribution, which we term confidence prior. In this work, we reveal that off‑the‑shelf LRMs exhibit a confidence prior heavily concentrated on a few high values, which persists throughout RL. Theoretically, we prove that this concentration suppresses policy gradient updates for rarely sampled confidence values and inflates the lower bound on expected Brier risk. To overcome this exploration bottleneck, we propose CalibSFT, a plug‑and‑play supervised fine‑tuning stage that shapes a calibrated confidence prior with broad support before RL. For each question, CalibSFT constructs confidence targets combining its success rate with response‑level correctness, which provably preserves proper‑scoring optimality, and then balances training responses across the confidence spectrum to enable diverse confidence exploration during RL. To learn from incorrect responses without imitating their reasoning, CalibSFT introduces correctness‑conditional supervision, guiding confidence across all responses while supervising reasoning only on correct ones. Across 16 mathematical and general reasoning benchmarks, incorporating CalibSFT reduces calibration errors and improves discrimination across five representative RL algorithms while preserving comparable accuracy. Furthermore, CalibSFT delivers practical benefits for downstream selective prediction and model routing. Our code is available at https://github.com/ml‑stat‑Sustech/verbalized‑confidence‑training.
Authors:Chenduo Hao, Chuanbao Gao, Pinjun Zeng, Jingze Zhu, Chonghan Liu, Zidong Liu, Xu Yang
Abstract:
In‑context learning is highly sensitive to demonstration choice, yet most methods select demonstrations using external query‑demonstration similarity. Such criteria can miss model‑specific signals: Similar demonstrations may activate different internal features and downstream behaviors. We introduce PULSE (Paired Utility Localization over Sparse Encodings), an SAE‑based framework for identifying model‑internal features associated with demonstration utility and using them for demonstration selection. Using a small labeled discovery set, PULSE samples candidate demonstration sets, measures their zero‑shot‑relative utility under the target model, and scores SAE features by how their activation differences align with utility differences. The top positive and negative coordinates form a sparse utility‑localization vector. We use this vector in two complementary ways: as a signed score for controlled complete‑set ranking, and as PULSE‑Retriever, which converts its magnitude into a feature‑relevance mask for scalable pool‑scale retrieval. Across classification, generation, and reasoning benchmarks, PULSE‑Retriever improves over the strongest baseline by 2‑3 accuracy points, 0.6‑0.9 BLEU‑4, and 3.2 exact‑match points, respectively, while controlled ranking validates the identified features encode a predictive set‑level utility signal. Feature inspection and cross‑dataset experiments suggest that the identified features capture task‑relevant, dataset‑conditioned patterns, yet retain utility signals that partially transfer across datasets. Our code is available at https://github.com/aohenuo/PULSE.
Authors:Wencheng Ye, Anning Hu, Xiangdong Zhang, Tianyi Wang, Yikang Li, Hengyu Jin, Bing Li, Junchi Yan
Abstract:
Transformers process information strictly forward through depth, preventing deeper computation from revisiting and refining earlier representations. To augment the standard forward pass, existing approaches either re‑execute depth, incurring additional computation, or modify the residual stream using predefined directions, limiting their instance‑level adaptation. Recently, inference‑time feedback offers a direct mechanism for recycling endogenously produced computation by writing deeper residual states back to earlier layers, yet what should be fed back remains unclear. We argue that the depth increment Delta, capturing newly accumulated computation between two layers, provides a more effective, composable, and scalable feedback signal than the full state. Building on this observation, we introduce ReFlux, a learnable feedback graph that dynamically selects and composes increment‑carrying routes. ReFlux supports synchronous feedback to the same token and streaming feedback to subsequent tokens. Extensive experiments across various models, corpora, and benchmarks show that synchronous ReFlux consistently reduces perplexity across ten language‑modeling corpora, and improves accuracy by 2.1‑2.3 points, with gains reaching 4.7 points on multi‑hop reasoning. Streaming ReFlux further retains most of these gains while preserving the base model's 1x theoretical backbone FLOPs. These results establish ReFlux as an efficient paradigm for unlocking the latent computational potential of LLMs, allowing them to revisit the same tokens with fresh representations. Code implementation can be found at https://github.com/gooogleshanghai/reflux.
Authors:Mengyuan Liu, Yuhang Wen, Yi Zhang, Songtao Wu, Hong Liu, Junsong Yuan, Beichen Ding
Abstract:
Skeleton sequences can represent both individual actions and multi‑entity interactions, encompassing human bodies, hands, objects, and robots. Existing approaches to recognize skeleton‑based actions and interactions usually adopt a late fusion strategy, which expects individuals are independent and identically distributed to train a robust weight‑shared entity encoder. However, observed entity bias in various skeletal data violates this assumption, leading to suboptimal optimization of backbone models that might produce wrong recognition results. This bias arises from the world coordinate system's initial configuration, where the choice of origin often creates bias in representation. To this end, we propose a Convex Hull Adaptive Shift based normalization method to reduce Entity bias (CHASE), improving performance across a variety of skeleton‑based action and interaction recognition tasks. To adaptively apply plausible shifts to the input skeletons, we formulate a plug‑and‑play parameterized network that ensures the relocated world origin lies within the skeleton convex hull, which avoids non‑convergence by limiting the search space. To further minimize entity bias, we incorporate an auxiliary objective that leverages pair‑wise distribution distances to guide network optimization. To support both single‑ and multi‑entity actions, we propose a sub‑entity strategy that offers a consistent formulation for both scenarios. Moreover, CHASE demonstrates compatibility with various intra‑skeleton modalities, such as bones and velocities, highlighting its adaptability. Essentially, our method works as a normalization approach to reduce entity bias, enabling subsequent classifiers to achieve improved recognition performance across diverse settings. Extensive experiments on 7 datasets verify our approach by seamlessly integrating with various backbones and significantly boosting their performance.
Authors:Julien Brandoit, Arthur Fyon, Thomas Braipson, Tom Clara, Florent De Geeter, Pierre Sacré, Damien Ernst, Guillaume Drion
Abstract:
Learning robust and scalable finite‑state tracking is fundamental to sequence processing. While linear recurrent neural networks (RNNs), linear attention, and state space models enable scalable parallel training through affine recurrences, their theoretical expressivity guarantees assume idealized arithmetic and do not extend to finite precision, where the parallel scan that makes them fast is itself a source of perturbation. We formalize finite‑state tracking at finite precision and characterize length independence: tracking that stays correct at every sequence length, at a precision cost that does not grow with the length. We show that length‑independent state tracking requires two competing dynamics within a single map: contraction to suppress numerical perturbations and separation to keep distinct states apart. We prove that affine recurrences, which offer a single rate at each step to serve both roles, realize at most definite automata at finite precision. Instead of treating scan compatibility as a restriction on the update map, we reinterpret it as a computational budget and introduce the Neural Finite‑State Machine (NFSM): a nonaffine, scan‑compatible RNN built for length‑independent finite‑state tracking. On synthetic benchmarks spanning abelian and nonabelian groups, noninvertible monoids, and textual state‑tracking tasks, affine baselines fail on every nondefinite task, most of them within a few hundred steps. A single NFSM layer instead learns the exact transition tables of every algebraic task, which certifies correctness beyond the tested lengths, and a stack of NFSMs keeps perfect accuracy on the textual tasks at every tested length.
Authors:Tianrun Yu, Kaixiang Zhao, Shangzhe Li, Yuxiao Yang, Porter Jenkins, Weitong Zhang, Taylor W. Killian
Abstract:
We study training‑inference mismatch in reinforcement learning with verifiable rewards (RLVR) for large language models, where rollouts are sampled by an inference engine while gradients are computed by a training engine, and the two engines assign different probabilities to the same tokens. To account for this discrepancy in policy updates, we introduce calibrated importance sampling (CIS). CIS is motivated by an empirically supported logit‑displacement characterization that expresses the mismatch as an additive displacement \varepsilon_t in log‑odds, determined by the per‑logit perturbation before the softmax, whose distribution is approximately invariant to token confidence. This characterization motivates a confidence‑aware truncation: large positive displacements are truncated at a single constant threshold, which maps back to an importance‑ratio cap that tightens as token confidence increases. Theoretically, we show that CIS replaces the unbounded second moment that governs the error of exact importance sampling with a term bounded by a constant, at the cost of a bias controlled by the truncated excess. In evaluation across three mixture‑of‑experts models and five mathematical reasoning benchmarks, CIS achieves the highest five‑benchmark average on all three models among the evaluated baselines. Diagnostic analyses show that CIS places less truncation bias on low‑confidence tokens than truncated importance sampling, while upward clipping of small importance weights reduces held‑out accuracy.
Authors:Yanlong Chen, Yining Chen, Song Zhang, Amirhossein Habibian, Yawei Li
Abstract:
Smaller activation outliers do not necessarily imply better low‑bit quantization: their alignment with the quantizer matters. We introduce PrismQuant, a quantizer‑aware rotation framework that aligns the leading activation eigenspace with the constant group subspace of asymmetric grouped INT4. The affine offsets represent the energy in this subspace without widening the range within the group. We formulate rotation design as a Ky Fan trace maximization and derive a closed‑form solution that is provably optimal for this alignment objective. Compact Householder transformations and their compact‑WY representation enable gradient‑free construction and efficient application at both foldable and online sites. A predictive range law further connects unaligned activation energy and group size to quantization‑relevant variation. Experiments on Llama, Qwen, and Mistral span dense models up to 70B parameters and a 30B mixture‑of‑experts model. Under W4A4KV4, PrismQuant sets the state of the art on Llama‑3.2‑3B among the compared methods in both perplexity and accuracy. On Llama‑3.1‑70B, it attains 3.85 perplexity and 72.46% average zero‑shot accuracy, only 0.22 percentage points below full precision. In the deployment study on Llama‑3.1‑8B, our optimized implementation achieves 1.51x prefill and 1.22x CUDA Graph decode speedups over matched FP16 baselines, with 56.34% lower decode peak memory and only 2.35% additional Graph decode latency over Hadamard. Code is available at https://github.com/ForeverBlue816/PrismQuant.
Authors:Qingzhuo Wang, CaiYi Wang, Jinglu Meng, Ruiyang Qin, Kunyu Peng, Zhihua Wei, Wen Shen
Abstract:
Tool‑using large language model (LLM) agents increasingly perform state‑changing actions that require user authorization. Yet existing approaches do not provide a principled mechanism for selectively updating prior authorization when only part of an instruction changes. To this end, we propose an Authorization‑Closure‑Graph (ACG)‑based framework that represents authorization and its dependencies as an evolving, versioned state. ACG selectively invalidates authority affected by a revision while preserving unaffected portions of the authorization state, and computes a minimal repair that identifies only the missing evidence or authority required for execution. This enables agents to adapt to revised instructions while avoiding stale authority and unnecessary authorization requests. We evaluate ACG across three advanced LLMs in two natural tasks, and ACG consistently improves action safety rate and task success rate. Code is available at https://github.com/weiliang822/ACG.
Authors:Inwoo Tae, Yoontae Hwang, Yongjae Lee
Abstract:
For graph node classification, calibrated class probabilities are needed when confidence scores, usually the maximum predicted class probability, are used to rank predictions, defer uncertain nodes to human review, or control risk. Existing post‑hoc calibrators either apply one global temperature or use graph‑aware modules without a principled structural form. We study how local graph structure should enter node‑level calibration. Our first results show that a logit‑only temperature rule is insufficient when nodes with identical logits but different local homophily require different optimal temperatures. We then analyze a population‑concentration contextual stochastic block model with Gaussian features and a one‑layer linear GCN. Under equidistant class means, the Bayes posterior over class‑template scores is a temperature‑scaled softmax whose inverse‑temperature is governed by a homophily‑dependent signal strength. In the positive‑signal homophilic regime, the resulting temperature decreases approximately inversely with normalized local homophily. This law motivates Homophily‑aware Temperature Scaling (HoTS), a simple post‑hoc calibrator that assigns each node a positive scalar temperature from entropy‑based logit concentration and estimated local homophily. HoTS has three temperature parameters, preserves the predicted class, and learns the strength of the structural correction from calibration data. Across 18 node‑classification benchmarks, two GNN backbones, and eight calibration baselines, HoTS achieves the best mean Expected Calibration Error (ECE) of 4.79%, the best average rank, and the most reliable confidence ranking in selective classification. Code is available at https://github.com/inu0104/HoTS.
Authors:Pengyu Zhu, Jingyi Yang, Yi Liu, Li Sun, Sen Su
Abstract:
Agent skills package instructions, executable code, and task‑specific resources into reusable artifacts that agents can improve using execution feedback. The same mechanism also enables attackers to evolve malicious skills, making them more effective and less detectable. However, a candidate skill may pass pre‑execution scanning yet fail to realize its target under runtime defenses, while a revision that repairs execution may introduce new scanner findings. We introduce SkillDRE, a fully automated framework for evolving complete malicious skill packages through a dual‑stage feedback loop. Given a benign task and its associated skills, SkillDRE autonomously constructs and validates a task‑conditioned malicious objective and a verifiable judge rule. It then holds both fixed while evolving the skill implementation, with preservation of legitimate task capability. SkillDRE combines scanner‑guided evolution with runtime‑guided refinement informed by execution outcomes observed under runtime defense. Each runtime‑guided revision returns to the pre‑execution stage for rescanning and further optimization before re‑execution, forming a cross‑stage closed loop. Evaluated on SkillsBench across four victim models, SkillDRE achieves an average attack success rate of 45.28%, exceeding the strongest baseline by 40.3%, while its final submitted skills receive no SkillScan findings and largely preserve benign‑task performance. These results show that two‑stage defense feedback can serve as a useful learning signal for adaptive red teaming and that evaluating either defense stage in isolation can miss the resulting attack capability. Codes is available at https://github.com/whfeLingYu/SkillDRE
Authors:Wei Chu, Yuanzhe Dong, Ke Tan, Dong Han, Yichao Zhou, Ruchao Fan, Bingshen Mu, Jingbei Li, Vishwas Shetty, Sarthak Bisht, Ziyue Qiu, Massa Baali, Rita Singh, Bhisha Raj
Abstract:
Forced alignment aligns speech audio with a text transcript to generate word and phone timestamps. Published comparisons normalize transcripts, split the data and match boundaries differently, so their numbers cannot be read together. We present FA‑Bench, an open framework that fixes those choices once and releases the code, splits, phone mapping, text normalization and scoring script, with results published periodically. Track 1 gives every aligner the reference transcript and Track 2 gives it a recognizer's output, on the same audio, clean and degraded four ways, with 21 open models and 9 commercial APIs under a unified protocol. We score every boundary of an utterance and check the two labels beside it, so a word the recognizer missed or invented is charged. Using a tolerance‑based F1 as our primary metric eliminates the 9% to 14% score inflation that standard MAE causes on recognition‑dependent systems in conversational speech. We then group boundaries by their position and how many adjacent words were recognized correctly, which shows where a system lost the score. We discovered systematic bias in how current systems time words, with Whisper about 150 ms early and several commercial ASR APIs over 50 ms late. Code and results are at https://github.com/olewave/fa‑bench
Authors:Joshua Stapleton, Andrew Perminov
Abstract:
We give a rank‑23 algorithm for 3×3 matrix multiplication using 51 additions and subtractions in alternative bases. The input and output conversions require five further additions, giving 56 additions in ordinary coordinates. The construction combines linear‑program reduction with a search over sparse basis changes, and the resulting programs are distributed as a machine‑checkable certificate. We verify correctness by exact coefficient expansion and distinguish the kernel cost from the cost of a complete multiplication.
Authors:Weiwei Ye, Renhe Jiang, Hangchen Liu, Dongyuan Li, Yoshihide Sekimoto
Abstract:
Real‑world time series are inherently non‑stationary, with trends, periodic patterns, and uncertainty evolving over time. While the Fourier domain offers a natural lens to model time series, current deep learning approaches do not explicitly model evolution and randomness in the Fourier spectra, which limits their ability to accurately predict both the expected trajectory and its uncertainty in non‑stationary time series. Motivated by Evolutionary Spectra (ES) theory, we propose TimeES, a general framework that enables probabilistic and deterministic forecasting via the evolutionary spectra theory. Specifically, we derive a parameterizable evolutionary spectra formulation, recasting non‑stationary random process modeling as learning an evolving representation modulated by random variables. Furthermore, we reduce the complexity of the estimated spectra from O(NM) to O(NK), where K << M/2, by exploiting Hermitian symmetry and spectral energy sparsity for frequency selection. Based on a simple linear backbone, our proposed TimeES achieves consistent state‑of‑the‑art performance across both deterministic and probabilistic forecasting tasks, with high efficiency and interpretability. Code is available at: https://github.com/wwy155/TimeES.
Authors:Amit Nautiyal
Abstract:
Data attribution methods used in practice (TRAK, LoGRA, EK‑FAC) are post‑hoc: after training they make a second pass over the training set to recompute per‑sample gradients, repeated per checkpoint when ensembled. Traceprop avoids that pass by recording projected per‑sample gradients inline on the training backward pass. A Kronecker‑factored sketch scales from a single tracked layer to every layer without materializing a dense projection matrix. On LoRA fine‑tunes of GPT‑2 and Pythia models up to 2.8B on one NVIDIA L4, inline logging costs 0.30‑1.08% of wall‑clock time at last‑block scope and stays under 1% (0.79%) even when tracking every layer of Pythia‑1B. Against LogIX, the closest inline‑capable competitor, the factored sketch is 2.0‑4.1x cheaper at equal storage, a gap that grows with tracked scope and is significant at every scope tested, while matching or exceeding LogIX's attribution quality at matched storage. Building the attribution‑ready store inline is 60‑242x cheaper than one post‑hoc pass and 301‑1211x cheaper than a five‑checkpoint TRAK ensemble, with recorded gradients matching autograd exactly. Because each stored gradient carries source‑file lineage, the same pass also produces EU AI Act Article 26 audit trails.
Authors:Weiwei Ye, Dongyuan Li, Hangchen Liu, Haotong Jiang, Yoshihide Sekimoto, Renhe Jiang
Abstract:
Probabilistic time series forecasting requires modeling and predicting complex and time‑varying distributions. Recently, Denoising Diffusion Probabilistic Model (DDPM)‑based approaches have shown promise by equipping the dif‑ fusion process with pretrained mean and variance estimators to accommodate distributional shift. However, these methods typically follow the standard DDPM framework and consider only partial components of the evidence lower bound (ELBO), treating the training of estimators as designed regression tasks separate from the variational inference framework. To address this, we rethink the ELBO under the Location‑Scale Noise Model (LSNM) and find that it naturally induces a Gaussian negative log likelihood objective for the estimators and inherently defines a joint training objective that unifies recent diffusion paradigms for probabilistic forecasting. Building on this principled ELBO reformulation, we propose Diff‑ PTS, a general framework that enables end‑to‑end optimization of all components within the ELBO. Across multiple benchmarks, DiffPTS consistently outperforms recent models, achieving state‑of‑the‑art performance with an average CRPS/MSE reduction of over 14.53%/16.55% compared to existing diffusion‑based methods. The code is available at https://github.com/wwy155/DiffPTS.
Authors:Derui Wang, Zewei Shi, Rayne Holland, Ruoxi Sun, Xingliang Yuan, Jason Xue, Liming Zhu
Abstract:
Debate distillation adapts weaker verifiers using multi‑agent debate transcripts to improve their judgement in subsequent debates, but gains on monitored tasks do not establish reliability on related unmonitored tasks. We study epistemic reliability degradation, in which adaptation preserves monitored performance while reducing support for correct responses on hidden tasks. We consider an adversarial debater that manipulates debate arguments while defending the correct monitored response, and ask whether the resulting degradation merely reflects catastrophic forgetting and whether standard evaluation can detect it. To address these questions, we propose ER‑Audit, a two‑stage black‑box auditing framework that compares frozen verifier checkpoints before and after adaptation, and introduce two evaluation benchmarks pairing monitored and hidden task prompts grounded in shared contexts. ER‑Audit searches for counterexamples to non‑degradation by evaluating semantically valid paraphrases and, if none is found, uses independent paraphrases for sequential hypothesis testing. We derive anytime‑valid lower confidence bounds on the non‑degradation probability, allowing data‑dependent stopping within a finite budget. We further establish a common lower bound across fixed paraphrase distributions and extend it to distributions within a bounded total variation distance of their mixtures. Our experiments show that higher hidden‑task accuracy can coexist with more counterexamples to non‑degradation and lower non‑degradation bounds. This divergence challenges explanations based solely on broad catastrophic forgetting and shows that auditing can uncover selective hidden‑task degradation concealed by aggregate performance gains. Our code and benchmarks are available at https://github.com/CSIRO‑CQS‑AI‑alignment‑Team/Epistemic‑Reliability‑Auditor.
Authors:Junxian Li, Ruixuan Yang, Tianao Zhang, Tiange Xu, Weisheng Dong, Yulun Zhang
Abstract:
Visual token reduction is an effective way to accelerate multimodal large language models (MLLMs), but performance deteriorates rapidly under extremely low token budgets. Existing work has explored both visual‑token selection and training‑based adaptation to reduced visual inputs. We take a step further by asking how a heavily compressed MLLM should learn from the states induced by its own generations. This setting naturally calls for on‑policy self‑distillation: a heavily compressed model is supervised on the states induced by its own generations, while its full‑token counterpart serves as an information‑rich teacher. Based on this insight, we propose LT‑OPD, a training framework for extreme visual‑token reduction. The student rolls out responses with only a small fraction of visual tokens, and a frozen full‑token copy of the same MLLM provides distributional supervision along these student‑generated trajectories. To stabilize on‑policy learning when visual evidence is severely limited, we further introduce a budget‑level curriculum that progressively decreases the token budget during training. Across nine benchmarks on Qwen3.5‑4B, LT‑OPD raises average retained performance under 5% visual‑token retention from 68.6% to 82.3%, outperforming training‑free, training‑based, and reinforcement‑learning baselines at the same budget. The gains transfer consistently to Qwen3.5‑9B, GLM‑4.6V‑9B, and LLaVA‑OV‑1.5‑4B. LT‑OPD also reduces KV‑cache usage by 85.2% and prefill FLOPs by 85.4% without additional inference overhead, demonstrating that on‑policy learning can substantially recover capabilities lost to extreme visual‑token reduction.
Authors:Gujie Shao, Zixun Xie, Xuechun Xing, Ruixiang Wang, Ziyun Lan, Yanlin Qi, Gangyi Zhang, Yuxin Yang, Dawei Li, Haiming Tang
Abstract:
Vision‑language models (VLMs) have shown increasing potential for medical image understanding, yet their capabilities in ophthalmic imaging remain insufficiently characterized. Existing ophthalmic datasets are typically designed for individual diseases or specialized tasks, making it difficult to systematically evaluate whether VLMs can move beyond disease recognition toward comparative reasoning and fine‑grained spatial grounding. We introduce EyeVQA, a unified visual question answering benchmark for comprehensive evaluation of ophthalmic VLMs. EyeVQA is constructed from 21 available ophthalmic datasets and contains 20,000 question‑answer pairs spanning six disease groups and seven question types: Single‑Choice, Multi‑Select, Variable‑Select, True‑False, Ranking, Point Location, and Bounding Box. Gold answers are deterministically derived from source‑provided diagnoses, severity grades, clinical findings, segmentation masks, bounding boxes, and anatomical landmarks, enabling reproducible evaluation without relying on model‑generated annotations. Notably, 44.5% of the questions require reasoning across multiple images, extending evaluation beyond conventional single‑image medical VQA. We benchmark fourteen representative general‑purpose, scientific, and medically specialized VLMs under a unified zero‑shot protocol. The best‑performing model only achieves an overall score of 62.8, while substantial gaps remain in spatial grounding and cross‑task generalization. These results highlight the limitations of current VLMs in comprehensive ophthalmic visual understanding and establish EyeVQA as a diagnostic benchmark for developing more reliable and spatially grounded ophthalmic multimodal models. The project page is available at https://github.com/PKUTHM/EyeVQA.
Authors:Reza Rezvan, Valter Schütz, Han Wu, Linus Aronsson, Morteza Haghir Chehreghani
Abstract:
In many prediction tasks, acquiring all features can be a prohibitively expensive or outright impossible task. Further, in many cases a static subset of features may not be enough to solve the problem sufficiently across various instances. Active Feature Acquisition (AFA) addresses these problems by formalizing the trade‑off between feature cost and predictive performance during sequential feature selection. However, prior AFA work largely assumes access to complete training data, an assumption that is often violated in practice. Here we study AFA with Incomplete Training Data (AFA‑ITD), showing that under missing completely at random (MCAR) data, one‑step acquisition values remain unchanged, whereas multi‑step values can decrease. We analyze three approaches to learning from incomplete data: aliasing, filtering, and generative restoration. We show that filtering can require a number of training instances scaling exponentially with the dimension, whereas generative restoration scales exponentially with the acquisition budget. We empirically test our theory on a controlled experiment and across common AFA datasets and find that missingness mainly damages methods that exploit multi‑step acquisitions and that generative restoration is able to recover lost performance in many experiments. Code is available at https://github.com/Linusaronsson/AFA‑Benchmark/tree/missing‑data.
Authors:Zhaowei Han, Xiang Zhang, Lingxiao Guan, Danqi Hu, Kai Liu, Kevin Chang, Jie Liu
Abstract:
Leaderboards rank long‑horizon agents by their final outputs. Yet a higher score alone does not establish whether two systems are comparable or which stage accounts for the difference. Unequal evidence, inputs, or budgets can affect scores, and statistical corrections do not remove this mismatch. We introduce compositional controllability to address these questions. A comparison window covers one stage, several stages, or the whole agent. Our central result bounds the gap between observed and controlled score differences using only nuisance outside the window. This yields an admissibility test applied before scores are inspected. Inadmissible comparisons are refused. For admissible pairs, an ordering is certified only when the score gap exceeds the combined sampling and nuisance radii; otherwise, it remains undecided. These decisions give each system a rank interval. We introduce BioLitBench, a benchmark of 2,042 biomedical articles represented as structured claim graphs. Among seven published pipelines, a conventional statistical analysis declares a winner in 14 of 21 pairwise comparisons. Yet the top‑ranked system alone received the target review's bibliography. To isolate pipeline performance, our test requires matched inputs and a fixed backbone model. It refuses 11 of the 21 comparisons, including every comparison involving the top‑ranked system. Seven of the 14 conventional conclusions fall within these refused pairs. The same comparison windows support stage‑level training. We train SCRIBE on Qwen3.8‑27B using rewards measured at each stage's exit. Under matched evidence, SCRIBE achieves a certified rank interval of [1,2], with certified advantages over all evaluated published pipelines and the evaluated Claude and OpenAI agents. Under same pool, SCRIBE matches the strongest published retriever and is certified above three published pipelines.
Authors:Yu Pan
Abstract:
A agentic story world is a dynamic system simulating who learned what, when, and from whom ‑‑ yet the standard design gives each character a private memory stream. A shared event is therefore stored once per witness, large duplication will be incurred in terms of storage. We present Agentsensus, a story‑world simulation framework in which there is an unified long‑term memory. Records of the same event merge into one owned by all its witnesses, and semantically relevant memory records are linked. We evaluate on four worlds ‑‑ two classical Chinese novels, Hamlet, and a real‑world conflict timeline ‑‑ run for 40 to 80 rounds against three per‑character memory designs under an equal‑granularity protocol. Agentsensus writes 22‑44% fewer entries than the closest baseline and is the only design whose memory becomes shared (14‑28% of records held by more than one character, some by 10) and linked (94‑99%), at judged simulation quality indistinguishable or even better than the baselines. An ablation attributes this to the merge itself: disabling it multiplies the store by 3.1x and takes sharing to exactly zero. Sharing also compounds with the horizon rather than saturating early, rising 6% to 9% to 14% as one world is re‑run at 10, 20 and 40 rounds.
Authors:Peiyu Zhang, Heng Ping, Nikos Kanakaris, Yucheng Zhao, Shixuan Li, Wei Yang, Xiongye Xiao, Paul Bogdan
Abstract:
Multi‑label classification (MLC) requires predicting multiple relevant labels for each instance, where a central challenge is modeling complex label dependencies arising from co‑occurrence patterns. Existing approaches are limited in capturing high‑order label correlations, relying on implicit learning through contrastive objectives or pairwise attention mechanisms without structural guidance. We propose HyperLabel, an encoder‑decoder framework that explicitly models label dependencies through hypergraph neural networks. Our contributions are twofold: (i) We construct a label hypergraph where sample‑defined hyperedges naturally encode multi‑way co‑occurrence patterns, providing explicit structural prior knowledge that captures relationships beyond pairwise interactions. (ii) We propose a unified cross‑modal learning approach where HGNN+ performs bidirectional message passing to integrate feature information with label structure, and a shared cross‑attention decoder processes both modalities through complementary learning objectives. Extensive experiments on seven benchmark datasets demonstrate that HyperLabel achieves state‑of‑the‑art performance, with particularly significant improvements on macro‑F1 scores (+10.3% on Delicious, +8.2% on Bibtex), validating that explicit hypergraph structure effectively captures complex label relationships. The code is available at https://github.com/iZHpy/Multi‑label_hypergraph .
Authors:Anjie Xu, Zhiyu Zhang, Ruiqing Ding, Fengli Xu, Leye Wang
Abstract:
Agent skills are expected to improve task performance. Yet we find that they often provide no benefit, and can even hurt performance while incurring additional token costs. Can we predict whether a skill will help before the agent acts? We introduce SkillDelta, a framework for predicting task‑conditional skill gains from paired executions of the same agent with and without the skill. A local predictor transfers these historical gains to new tasks without retraining the agent. Under explicit transfer assumptions, our analysis links support coverage, representation mismatch, and execution noise to prediction error and decision regret. Across five benchmarks and three target agents, paired history improves observed‑gain ranking over skill‑assisted outcomes alone in 12 of 15 settings. At matched expected skill‑use rates, SkillDelta improves success over random activation in all 15 settings, with an average absolute gain of 4.3%. Most of this advantage comes from allocation across task groups. Evidence for additional within‑group selection value is strongest on ToolQA and weaker elsewhere. Code is available at https://github.com/TankTechnology/skilldelta.
Authors:Yu Li, Shenghe Hu, Yuhan Wang, Yaoxiang Pu, Haotong Zhang, Yuanpei Chen, Yaodong Yang
Abstract:
Generative models, such as diffusion and flow‑based models, have shown strong promise for robot policy learning by capturing complex and multimodal action distributions from demonstrations. However, policies trained solely with imitation learning often suffer from imperfect demonstrations and distributional shifts, while further improvement typically requires additional expert data. Reinforcement learning offers a natural solution through environment interaction, but effectively finetuning generative robot policies remains challenging due to the intractability of likelihood estimation. In this work, we propose RoboFFT, a forward‑process reinforcement learning framework for finetuning generative robot policies, which applies forward noising to sampled actions and uses the weighted score / flow matching loss to construct a surrogate policy ratio for PPO‑style updates. We evaluate RoboFFT with popular generative robot policies on representative simulation benchmarks, including long‑horizon planning and sparse reward settings. Extensive experiments and analysis demonstrate that RoboFFT consistently improves performance while achieving better stability and training efficiency. We further integrate RoboFFT into a real world RL framework and demonstrate its effectiveness in real world tasks. Project website: https://student‑of‑holmes.github.io/RoboFFT/.
Authors:Zhuohan Wang, Haoran Ma, Tianyu Wu, Yuanlin Duan, Zichun Liao, Jieming Yu
Abstract:
Large language models (LLMs) can solve every intermediate step of a multi‑step math problem on its own and still fail the full problem, even when given a roadmap of the steps and all of their answers. We introduce OracleLadder, a diagnostic evaluation that locates where LLM math reasoning fails by giving the model increasing levels of oracle help. For each problem, a teacher model writes a fixed roadmap of intermediate sub‑goals (milestones), and a deterministic symbolic verifier grades every answer. Testing the model with no help, with the roadmap, with the roadmap plus the milestone answers, and on each milestone alone sorts each failure into one of five reasoning gaps. On 354 NuminaMath problems and six models from 8B to 671B parameters (Qwen3, gpt‑oss, Llama 3.3, DeepSeek‑V3.1), the largest gap for every model is the composition gap, a stricter form of the compositionality gap. It covers 33‑48% of problems, and 24‑37% after removing problems that an LLM review flags as grading errors. Accuracy and milestone‑help recovery rank the two strongest models differently, and two RLVR runs with similar accuracy gains move problems differently. The roadmap effect replicates on MATH500 and AIME 2024/25, per‑problem recovery agrees for 83‑87% of problems under an independent second teacher, and the help ladder carries over to code generation. We release the data, roadmaps, prompts, and code at https://github.com/slark‑prime/OracleLadder.
Authors:Wenjun Peng, Xinyu Wang
Abstract:
Static QA and code‑generation benchmarks only partially capture the role that large language models (LLMs) now play as coding agents and research tools. We introduce OptiArena, a budget‑controlled testbed for studying whether LLMs can improve executable game‑playing algorithms through five rounds of code edits within a fixed minimal scaffold and under bounded evaluator feedback and fixed resource budgets. The testbed uses two optimization regimes, surface obfuscation controls, calibrated references, held‑out/stress splits, and diagnostics for degradation and exceptional failures, with LLM API cost reported separately from local evaluator wall‑clock. The empirical study asks three questions: whether models can close the calibrated gap between a designated weak starter and an editable competent baseline, whether they can refine editable competent baselines without damaging them, and whether gains survive surface obfuscation controls. Across twelve frontier LLMs and five games, models improve designated weak starters more consistently than they refine editable competent baselines, with substantial variation across games and models. OptiArena provides a practical testbed for measuring bounded‑resource algorithm optimization within the five‑edit, fixed‑scaffold setting studied here. Code is available at https://github.com/WJ‑Peng/OptiArena.
Authors:Qilang Ye, Meng Liu, Yu Zhou
Abstract:
We explore whether Omni‑Language Models (OLMs) can be directly applied to zero‑shot Semantic Audio‑Visual Navigation (SAVN). Recent work demonstrates that even state‑of‑the‑art specialized models still struggle to achieve generalist multimodal navigation, despite extensive task‑specific training. In this paper, we introduce RAO‑Nav, short for Reasoning All‑in‑One OLM, a deployment pipeline for zero‑shot SAVN. By leveraging the rich implicit audio‑visual knowledge encoded in OLMs, the embodied agent is enabled to ``hear'', ``see'', ``reason'', and ``act'' in the environment. To further elicit the built‑in thinking ability of OLMs, we propose a test‑time Latent Navigation Reasoning (LNR) module that can be seamlessly integrated into the decoding space. LNR encourages the model to retrieve more target‑relevant observations and make effective navigation decisions. Through comprehensive experiments, we show that our framework surpasses existing state‑of‑the‑art baselines on public SAVN benchmarks without using any training data. Moreover, we introduce a new \emphGlobal Navigation Instruction setting to further evaluate the ability of OLMs to serve as embodied navigation agents. Code: https://github.com/rikeilong/OmniAV\_Nav.
Authors:Hao Mark Chen, Royson Lee, Yasuyuki Okoshi, Dimitris Anastasiou, Wayne Luk, Hongxiang Fan
Abstract:
Agent performance depends on both the underlying model and the harness that manages its tool use and execution. Selecting a suitable pair requires accounting for their compatibility, yet training samples may cover only a subset of the growing combination space. We introduce HM‑Router, a routing method that jointly selects a model and harness for each query. It learns separate model and harness representations shared across routes, with an interaction term inspired by canonical polyadic (CP) tensor decomposition to capture how their compatibility varies with the query. This sharing allows training samples from observed pairs to inform predictions for unobserved combinations. We curate a benchmark from 12 public agent benchmarks, covering 293 routes, 73 models, and 25 harnesses. HM‑Router exceeds the strongest evaluated learned baseline by 7.3 percentage points in mean routing accuracy and leads at all seven evaluated cost budgets on the six‑benchmark subset. When 90% of routes have their training outcomes withheld, allowing unobserved combinations improves normalized accuracy by 15.8 points over restricting the same router to observed routes. HM‑Router has also demonstrated training sample efficiency for new routes and components and generalization to unseen benchmarks. Our code and data are open‑sourced at https://github.com/hmarkc/HM‑Router.
Authors:Arman Nik Khah, Arvin Bahreini
Abstract:
Language models are now routinely graded by other language models. If post‑training makes a model's own writing more predictable, it may also teach the same model, acting as a judge, to reward predictable writing, so that progress on creativity would be invisible to automated evaluation. We follow two open model families, OLMo‑2 and Zephyr (7B parameters each), through their public training stages and measure every stage twice, as a writer of short stories and as a judge of pairs of stories. As writers, the models drift as feared: each family's fully trained model finds the stories of its base, supervised fine‑tuned (SFT) and preference‑trained (DPO) stages progressively more familiar, in all ten prompts, and a model from the other family finds the trained stories 7.0 to 9.2 percent (OLMo‑2) and 24 to 25 percent (Zephyr) less surprising per token. As judges, they barely move toward predictable writing. Asked which story is better, a question every judge can use to tell a story from its own words in scrambled order, no trained judge's estimated tilt toward the more predictable story grows by as much as one point in the probability of picking it. A post hoc one‑sided 95% upper bound on that growth is 2.7 points on an average pair, about the size of the untrained OLMo‑2 judge's own tilt. Asked which is more creative, no trained judge's estimate favors the predictable story more than its base's does. Training instead strengthens a preference for longer stories when the question is creativity, and for one answer slot, and it breaks "more creative" as a question: trained judges asked it no longer reliably prefer a story to its scrambled words. A follow‑up could not build pairs that differ in predictability but not in quality, because the routes that made this writer's stories less predictable also broke some of them, often enough to fail a quality floor set in advance.
Authors:Bosi Wen, Yilin Niu, Xiaoying Ning, Ying Zhang, Hongning Wang, Minlie Huang
Abstract:
Precise instruction‑following is a fundamental ability of large language models (LLMs), requiring their outputs to strictly satisfy objective constraints in input instructions. In complex application scenarios, these constraints often possess diverse scopes that govern specific response segments rather than the entire output. However, existing optimization methods often neglect constraint scope during data construction and rely on binary per‑constraint rewards, yielding limited data diversity and sparse supervision for complex constraints. To this end, we propose ScopeIF, a novel training framework for scope‑aware precise instruction‑following. We first introduce a unified schema that factorizes objective constraints into three decoupled dimensions: Scope, Target, and Range. Grounded in this schema, we construct ScopeInstruct, a large‑scale instruction dataset with diverse scope‑aware constraints, and combine tool‑grounded verification with graded reward modeling to quantify the violation degree of each constraint, providing dense supervision for policy optimization. Extensive experiments demonstrate that ScopeIF consistently outperforms existing methods, particularly on complex scope‑aware constraints, while preserving general capabilities. Notably, it enables optimized Qwen3‑4B and 8B models to rival or surpass strong frontier models such as Gemini‑2.5‑Pro and DeepSeek‑V3.2, establishing an effective paradigm for advancing scope‑aware instruction‑following. Our code and data are available at https://github.com/thu‑coai/ScopeIF.
Authors:Xikai Yang, Hieu Trung Nguyen, Dunyuan Xu, Yuzhi Zhao, Jinpeng Li, Wenao Ma, Pheng-Ann Heng
Abstract:
Large language models (LLMs) have demonstrated remarkable performance across various code‑related tasks. However, unlike carefully curated datasets that are typically high‑quality and error‑free, real‑world user instructions are often vague and error‑prone, posing significant challenges to the robustness of code LLMs. Furthermore, robustness‑oriented fine‑tuning relies on paired clean‑noisy samples, which are costly to curate and require sophisticated noisy simulation techniques. To address these challenges, we propose the Noisy Test‑time Reinforcement Learning framework (NTRL‑Code), which enables robust self‑evolution of code LLMs using only unlabeled noisy data during the testing stage. Specifically, NTRL‑Code uses conservative self‑denoising to obtain a cleaner semantic anchor for target estimation, and employs an abstract‑syntax‑tree (AST)‑based structural aggregation mechanism to estimate a proxy target from multiple candidate programs. The policy is then optimized on the original noisy prompts with a hybrid reward that combines format validity, code similarity, and anti‑repetition signals. Extensive experiments on three benchmarks, each incorporating character‑level, word‑level, and paragraph‑level perturbations, demonstrate that NTRL‑Code yields robust and consistent improvements, stabilizing the predictions of various base models. Our code is available at https://github.com/Xikai97/NTRL‑Code.
Authors:Hui Ye, Yudong Liu, Yiran Chen, Rajshekhar Sunderraman, Shihao Ji
Abstract:
Temporal context is essential for camera‑only multi‑view 3D object detection. Existing streaming detectors maintain and propagate query states from one frame to the next, requiring sequence‑aware training and chronological inference. We propose PQR3D, which performs progressive query refinement within referenceconditioned temporal windows. This design enables random frame sampling and independent inference without persistent query memory. Within each window, PQR3D progressively transfers motion‑aligned high‑confidence queries from earlier timestamps toward the target frame. We further introduce masked selfattention to regulate interactions among regular, propagated, and denoising queries while keeping denoising supervision isolated from detection queries. In addition, a stage‑decoupled anchor embedding injects position before self‑attention and size, orientation, and velocity afterward, reducing interference from temporally inconsistent attributes. With a ViT‑L backbone, PQR3D sets a new state of the art on the nuScenes test set, achieving 71.6 NDS and 64.9 mAP. Source code is available at https://github.com/huiyegit/PQR3D
Authors:Tianhao Zang, Zihan Liu, Shanze Wang, Liyou Luo, Xingjian Xie, Chengtai Li, Wei Zhang
Abstract:
In this paper, we present a Goal‑Aware Uncertainty‑Guided Exploration (GAUGE) framework for planner‑conditioned active calibration of opaque quadruped velocity interfaces. Commercial quadrupeds commonly expose planar‑velocity commands, but the underlying locomotion controller remains inaccessible and can produce systematic discrepancies between commanded and realized motion. A navigation planner typically uses a structured subset of the command envelope. GAUGE maintains a Bayesian command‑to‑motion model and selects authorized trials according to their expected reduction of posterior epistemic uncertainty under the planner‑induced command distribution. The resulting posterior supports validation‑based stopping, bounded inverse compensation, and task‑relevant recalibration after detected interface shifts. In three controlled response families, GAUGE reaches the joint criterion for task‑facing accuracy and uncertainty with fewer trials than passive, D‑optimal, and task‑agnostic alternatives. Across six held‑out Isaac Sim navigation maps, it meets the declared noninferiority margins against dense calibration. Code is available at https://github.com/EurekaZang/CalibAgent.
Authors:Constantino Álvarez Casado, Erkka Rantahalvari, Matteo Pedone, Matti Matilainen, Manuel Lage Cañellas, Le Nguyen, Simo Hosio, Olli Silvén, Miguel Bordallo López
Abstract:
Smartphone motion sensors support interactive applications, but their readings may also reveal touchscreen input beyond their intended use. Assuming known drawing intervals, we study whether handwritten digits remain predictable across users and devices, as a 10‑class problem on 19,628 HuMIdb recordings from 481 participants. We compare handcrafted features with classical machine learning algorithms, MiniRocket kernels, and a compact sensor patch transformer on accelerometer, linear acceleration, gyroscope, and gravity signals. The transformer achieves 57.74% accuracy and 82.64% top‑3 accuracy on 75 unseen participants, and 58.77\pm0.95% over 3 seeds for unseen participants on 9 unseen phone models. Low motion recordings remain informative, accuracy is not monotonic in motion level, and the tested contrastive pretraining, augmentation, and derived signals give no consistent gains. Digits are thus predictable beyond familiar users and phone models under assumed segmentation, while acquisition‑order shortcuts limit conclusions about practical privacy exposure. Code available at: https://github.com/Arritmic/motion‑digit‑leakage.
Authors:Yinyuan Zhang, Daliang Xu, Xiaolong Huang, Wangsong Yin, Yun Ma, Mengwei Xu, Gang Huang
Abstract:
Hybrid attention models have emerged as a crucial architecture for Large Language Models (LLMs) (e.g., the Qwen3.5 and Kimi series). Their memory and computational efficiency make them highly attractive for on‑device inference, forming a promising synergy with edge Neural Processing Units (NPUs). However, naive execution of these hybrid models on edge NPUs fails to deliver these benefits, often bottlenecking the prefill stage due to severe memory‑system inefficiencies and architectural mismatches within the linear attention (LA) layers. We present HA‑NPU, the first system to enable efficient hybrid attention LLM inference on edge NPUs without modifying the underlying algorithms. HA‑NPU enhances execution efficiency by reorganizing the dataflow of the LA components across three levels: (1) At the core level, it partitions workloads by the head dimension and fuses dependent operators, eliminating cross‑core global memory accesses; (2) At the operator level, it reorders execution to consume intermediate tensors immediately, drastically minimizing local‑buffer pressure; (3) At the tensor level, it employs dataflow‑aware layout planning to minimize transformation overhead between matrix and vector processing units. Compared to competitive baselines, HA‑NPU achieves up to 35.95× LA kernel speedup and 36.14× energy reduction, delivering up to 2.03× faster end‑to‑end request latency. The source code will be made publicly available at https://github.com/yinyuanzhang/HA‑NPU
Authors:Kathiresan Jayabalan, Sethuraman Radhakrishnan
Abstract:
The global transition to a cashless economy has placed credit cards as the key element of digital transactions, acclaimed for their easy use, speed, and acceptance in most places. However, the growing dependence on this payment method has led to an escalation of the risks associated with credit card (CC) fraud. Detecting this type of fraud is a difficult task because the patterns are constantly changing, there is a data imbalance, and it is necessary to identify the legitimate transactions and the fraud ones at the same time. This study addresses this challenge by proposing a credit card fraud detection (CCFD) framework using a data balancing technique and a deep learning (DL) model. The proposed fraud detection model is trained and evaluated by collecting the dataset called Credit Card Fraud Detection from the Kaggle repository. As the dataset is highly imbalanced, we utilized the Synthetic Minority Oversampling Technique (SMOTE)‑Tomek technique to balance the dataset. Further, the balanced dataset is classified using the Heterogeneous Graph Neural Network (HGNN) model. The HGNN model represent various transactions using a heterogeneous graph architecture and by using an attention based message passing technique, it managed to consider the complex relationships, time factors, and user behavior. The integration of SMOTE‑Tomek in the model further boosted its capacity to identify fraudulent transactions, while lowering the rate of false positives. The HGNN model attained a 99.97% accuracy, a 99.48% F1‑score, a 99.15% precision, and a 98.97% recall. The findings indicates that this model is effective and can be applied to real‑world CCFD scenarios.
Authors:Andrea Li, Soham Ray
Abstract:
Voice agents depend on accurate automatic speech recognition (ASR) to act on what callers say, yet ASR is evaluated on read, English‑centric speech with word error rate (WER), which penalizes surface rather than semantic differences. We introduce mu‑bench, a dataset of 4,270 caller utterances from 250 phone calls to an AI banking agent in English, Spanish, Turkish, Vietnamese, and Mandarin, centered on form‑field inputs such as names, email addresses, and confirmation codes. We release Utterance Error Rate (UER), an LLM judge of whether a transcript preserves meaning, calibrated against human raters, together with an LLM normalizer that makes WER comparable across providers' output formats. On 1,847 human‑rated transcripts, UER agrees with annotators at κ = 0.78, versus 0.53 for exact‑match WER on normalized text. We rank six commercial providers on a public leaderboard; the best reaches 11.9% UER, and Mandarin is hardest for all six.
Authors:Isaac Ellmen, David Errington, Matthew I. J. Raybould, Charlotte M. Deane
Abstract:
Although \mathbbE[\mathrmdropout(x)] = x, here we show that \mathbbE[\mathrmLayerNorm(\mathrmdropout(x))] is not equal to \mathrmLayerNorm(x). Accordingly, the pattern of a Dropout layer followed by a LayerNorm, which is common to many AlphaFold2‑based protein structure predictors, produces a systematic bias at evaluation time that can hamper performance. To address this, we derive a closed‑form, first‑order correction for this gap, which we call a Dropout‑LayerNorm Correction (DLC). DLC empirically matches the performance boost of large Monte Carlo dropout ensembles. We evaluate its effect across nine protein structure models (ESMFold, OpenFold, ABB3, FlashABB, Ibex, NbForge, Genie1, Genie2, Genie3) on both paired and single‑chain antibody structures as well as one protein‑ligand docking model (QuickBind). The correction is computationally negligible and improves accuracy in all ten models tested (~0.3%‑13%), with a modest but consistent improvement in ESMFold and OpenFold and a substantial improvement in antibody‑specific models. This work identifies the mathematical consequence of chaining together Dropout and LayerNorm and provides a free, principled adjustment to improve the evaluation performance of many pretrained models. Code to reproduce the experiments is available at https://github.com/oxpig/DLC.
Authors:Ahmad S. Tarawneh
Abstract:
How many bits does a network need before its accuracy collapses, and how does this grow with depth? We study the precision floor, the perturbation level or bit‑width at which accuracy falls halfway to chance, in MLPs, CNNs, Vision Transformers and nine pretrained language models, under post‑training quantization (PTQ) and quantization‑ or noise‑aware training (QAT). (i) A first‑order theory sets the floor through one full‑precision quantity, the predictive amplification G: η_c=Λ/G, and G^2 grows linearly in depth at a rate proportional to the squared residual branch scale. (ii) The predicted equality α_PTQ=ρ of depth exponents holds within 95% intervals in twelve of thirteen trained architectures and in GPT‑2 from 12 to 48 layers, with Λ=1.45\pm14% across trained architectures. (iii) Residual branches scaled by 1/\sqrtD and pre‑normalisation remove the depth penalty, and each quantizer turns noise into bits at a rate fixed by its step rule, giving b_c=(α/γ)\log_2 D+C. (iv) A QAT paradox: noise‑aware training roughly doubles the tolerable noise of shallow networks, but the gain decays with depth, so the depth law steepens (α_QAT/α_PTQ=1.45‑1.47 on two datasets, ten seeds each). Decision margins, cross‑layer error cancellation and heavy tails do not set the floor.
Authors:Bhavyateja Potineni, Lohit Giri, Anu Jain, Vadim Kutsyy, Rajasekhar Pentakota
Abstract:
As autonomous LLM agents are deployed across multi‑session environments, conventional memory architectures suffer from Associative Blindness (inability to traverse multi‑hop relational dependencies), Scaffolding Amnesia (temporal decay evicting core persona invariants), and Static Topology Stagnation (immutable graphs ignoring usage dynamics). Grounded in Complementary Learning Systems (CLS) principles, we propose EngramRAG, an adaptive memory architecture coupling a low‑latency Waking State reflex with an asynchronous background Dreaming State consolidation cycle. EngramRAG introduces: (1) Usage‑Modulated Personalized PageRank (U‑PPR), where transition probabilities adapt via Hebbian plasticity to promote persistent entities into high‑centrality Epistemic Macro‑Hubs; (2) Consolidation‑Activated Topology Decay (CATD), which scales retention half‑life by topological load‑bearing weight rather than wall‑clock recency, protected by a cold‑start grace period (N_grace >= 4); (3) Directed SUPERSEDES DAG filtering to suppress obsolete state during fact mutations; and (4) Triple‑source hybrid retrieval fusing dense vectors, BM25, and U‑PPR via dynamic Reciprocal Rank Fusion (RRF). Evaluating on all 1,982 QA pairs across 10 long‑term conversations in the LoCoMo benchmark, EngramRAG achieves +38.9% relative improvement in Recall@5 (53.21% vs. 38.29%, p < 0.001) and +43.1% in MRR (0.4203 vs. 0.2937) over dense vector RAG, significantly outperforming Okapi BM25 (48.66%) and isolated static graph retrieval (8.50%). On temporal reasoning, EngramRAG reaches 62.33% Recall@5 (+16.67 points over dense vectors). In controlled mutation tests, SUPERSEDES suppresses split‑brain hallucinations from 70.0% to 0.0%, while 90‑day simulations show 100.0% scaffolding retention under a 26.21ms interactive retrieval reflex.
Authors:Jakub Prejzner
Abstract:
We ask how GGUF quantization affects agentic tool use in Polish and whether the effects generalize across models. We introduce PolAgentBench, a deterministic benchmark with Polish prompts and English tool schemas: a 67‑task main suite (15 adversarial probes, 52 hard‑tier tasks) and a 46‑task arithmetic isolation ladder. Three models span two axes of variation: Bielik‑11B‑v3.0 and its pruned, distilled child Bielik‑Minitron‑7B‑v3.0 isolate model compression, and Llama‑PLLuM‑8B adds a change of pretraining family. Each is measured at six precisions, Q8_0 to Q2_K. Only the collapse threshold replicates. (1) All three models fall off a cliff between 3‑bit and 2‑bit (11B 0.716 to 0.045, 7B 0.463 to 0.149, PLLuM 0.224 to 0.015; paired McNemar p < 0.001 in each), across a fourfold capability spread and both axes. (2) Failure modes do not replicate: at 2‑bit the 7B fails long (median 9.1k tokens, 4 steps) while the 11B mostly answers at the first step with a confabulated final answer (37 of 64 failures); PLLuM fails on content across precisions (71.8‑92.0% of steps parse). (3) On the arithmetic ladder the unscaffolded rung is a floor, left standing by a rerun that states the no‑tool rule; four explicit calls lift the 8‑bit 11B from 1/10 to 9/10 and the 7B from 0/10 to 7/10 after format‑only failures with the gold value are forgiven, an exploratory effect with eight distinct baseline inputs that does not survive multiplicity correction, while the order‑trap arm separates the models at 8‑bit (11B 6/6, 7B 0/6). (4) The Polish‑versus‑English gap is associated with degradation or with task family. We document four artifacts that shaped our conclusions (rounding‑hostile gold values, strict answer typing, a no‑tool rule the prompt never stated, priority‑ordered failure labels), report affected results in strict and corrected form, and release the benchmark, trajectories and commit‑stamped artifacts.
Authors:Ruifeng Shang, Shu Liu, Yuhua Zhu
Abstract:
Physical systems evolve continuously in time, yet their states are typically observed only at discrete times. Generating trajectories consistent with their probability densities from such observations therefore requires capturing the continuous‑time evolution rather than only learning transition mappings between consecutive observations. We propose PhiBE‑Flow, a framework that directly estimates the probability velocity field induced by the stochastic differential equation (SDE) which governs this continuous‑time distributional evolution. PhiBE‑Flow learns from discrete observations using a model‑free approach requiring neither known SDE coefficients nor score estimation. We establish convergence guarantees for the method, accounting for both time‑discretization and finite‑sample errors. We evaluate PhiBE‑Flow on systems of increasing complexity, from controlled stochastic numerical systems to Navier‑‑Stokes dynamics and real‑world videos. Our results show that PhiBE‑Flow accurately recovers probability flows of stochastic dynamics, preserves multiscale physical statistics, and improves video generation performance over representative baselines. The code is available at https://github.com/R1fe/PhiBE‑Flow.
Authors:Christoph Schuhmann, Robert Kaczmarczyk, Gollam Rabby, Felix Friedrich, Maurice Kraus, Gijs Wijngaard, Kourosh Nadi, Huu Nguyen, Kristian Kersting, Sören Auer
Abstract:
Expressive speech synthesis has outpaced expressive speech perception: systems now render fine‑grained vocal performances that no public benchmark can score. Most benchmarks for this inverse problem stop at six to nine basic emotion categories, largely on acted speech. This paper introduces VoiceNet, a human‑annotated representation‑level benchmark for voice performance understanding on permissively‑licensed in‑the‑wild speech. VoiceNet has two subsets: VoiceNet‑Emo applies a 40‑emotion taxonomy with three expert ratings per item, and VoiceNet‑Ext, a preliminary subset, scores 57 talking‑style attributes including speaking rate, vocal tension, breathiness, and register. The paper also releases Emolia, an emotion‑annotated version of the Emilia corpus, with a curated rebalanced subset enriched by dense MOSS‑Audio Thinking annotations. Two voice‑text contrastive baselines train on this data: a 110M‑parameter VoiceCLAP‑Small for fast large‑scale data filtering and a 7B VoiceCLAP‑Large for state‑of‑the‑art performance. Both outperform existing CLAP baselines, which sit near chance on VoiceNet‑Emo. On VoiceNet‑Emo, VoiceCLAP‑Large aligns more closely with the aggregate expert consensus than individual experts agree with one another: a comparison against the majority label rather than evidence of surpassing human emotion perception. All systems evaluated here are voice‑text embedding models: VoiceNet scores representation‑level attribute recognition and retrieval, not end‑to‑end spoken‑dialogue behaviour. Clustering and filtering uncurated speech corpora into subsets that span diverse talking styles and emotions remains an open challenge; VoiceCLAP embeddings offer a promising tool for this task. VoiceNet, Emolia, and VoiceCLAP are publicly available for research use.
Authors:Weida Zhao, Logan Bellamy, Yazhou Tu, Jiaqi Wang
Abstract:
Analog dial meters are widely deployed in industrial applications and utility sites, where environments and meter types vary and inspection data may be sensitive. Currently, automatic meter readers must be individually developed and deployed for each environment and meter type in practice. Deep learning could handle this variability but requires diverse labeled data that are costly to collect and update. In practice, meter images are distributed across independent sites, each with limited labels, while raw images often cannot be pooled because of ownership, governance, or privacy constraints. To address these challenges, we present a federated framework for visual analog meter reading that enables multiple sites to collaboratively train a reading model without sharing their raw images. Our framework consists of a four‑stage pipeline: (1) dial localization, (2) thin‑structure segmentation trained federatively across clients, (3) polar unwrapping, and (4) tick‑counting decoding for final reading. To enable systematic evaluation of this setting, we release MeterFL, a 1,382‑image mask‑annotated dataset organized into deployment‑motivated pseudo‑clients derived from visual attributes via deterministic rules, with dHash near‑duplicate control between the segmentation train and test splits. We evaluate both segmentation quality and end‑to‑end reading accuracy. MeterFL is publicly available at https://github.com/weidazhaoooo/Meter‑FL.
Authors:Ayan Banerjee, Abhra Chaudhuri, Josep Llados, Umapada Pal, Anjan Dutta
Abstract:
Can out‑of‑distribution (OOD) generalization be predicted from a trained model's weights alone, without any target‑domain data? Existing representational similarity metrics (CKA, SVCCA, RSA) compare activations rather than forecast generalization. We show they are provably insensitive to structural rerouting in the computational graph, the very change distribution shift induces. We close this gap with the Circuit Alignment Score (CAS), which compares class‑specific circuits across domains via graph kernels, decomposed into same‑class coherence and cross‑class confusion. Casting CAS as a Lebesgue integral over the domain distribution, we prove its Monte Carlo estimate recovers the ground‑truth ranking of learners by OOD accuracy, with pairwise inversion error vanishing at rate O(1/M), where M is the number of sampled domains. Across 48 learners on PACS, CAS attains 0.88 rank correlation with OOD accuracy, versus 0.58 (CKA), 0.23 (SVCCA), and 0.14 (RSA), with similar trends on other benchmarks and even against data‑dependent methods, making it the first provably consistent predictor of distributional robustness requiring neither target‑domain data nor labels. The code is available at: https://github.com/ayanban011/ACE
Authors:Chukwunonso Henry Nwokoye, Wajiha Zaheer, Khalil El-Khatib, Li Yang
Abstract:
As Internet of Things (IoT) networks increasingly depend on machine learning for anomaly, malware, intrusion detection, and network monitoring, such systems have become attractive targets for evasion attacks. Evasion attacks pose a major security risk because an adversary intentionally modifies input data to mislead a trained model into producing incorrect predictions while evading detection. This study evaluates the impact of black‑box evasion attacks on a cost‑utility‑based adversarial training defense strategy in an Online AutoML context for IoT networks. Specifically, evasion attacks were applied to online learners, including Hoeffding Tree (HT), Leveraging Bagging (LB), Streaming Random Patches (SRP), Hoeffding Adaptive Tree (HAT), and Adaptive Random Forest (ARF). By developing naive and adversarially trained (AT) versions of these online learners, we generated clean and adversarial accuracies for each model. The results show that the AT versions of LB and SRP performed best, achieving the highest adversarial accuracy (0.985) and high clean accuracy (0.993) at the highest cost budget of 1.00, with a maximum accuracy reduction of only 0.8%. Finally, drift detection was conducted using the Early Drift Detection Method (EDDM).
Authors:Mustafa S. Aljumaily, Nawar S. Alseelawi, Hayder Kareem Abed
Abstract:
When an oilfield digital twin disagrees with its instruments, the operator must decide whether the cause is hardware degradation, harsh‑weather effects, or malicious data manipulation. Existing digital‑twin work appears to treat these causes separately: sensor‑validation architectures target faults, and attack‑focused twins have been evaluated on water‑sector testbeds. We study joint cause attribution on a simulated four‑well wellpad with 15 coupled instruments, legitimate operating transients, and weather. A physics‑informed twin, identified from normal data only, produces analytical‑redundancy residuals; windowed features feed a gradient‑boosted classifier whose posterior drives an alarm gate with a fixed false‑alarm rate and a cost‑based decision rule that may defer to an analyst. On three independently generated sites, the classifier reaches macro‑F1 of 0.818 on windows where the injected deviation is observable (0.723 when latent post‑onset windows are included at the primary site). The physics twin accounts for essentially all of this: removing the data‑driven twin changes macro‑F1 by less than 0.01, whereas removing all twins drops it to about 0.58. Attacks are detected quickly (median 1.7 h) but attributed correctly at alarm time only 42% of the time, rising to 73% six hours later. A cost‑aware policy that defers ambiguous cases had the lowest expected cost among all policies in every one of 144 cost and prior settings tested, sometimes by a small margin; the result depends on illustrative costs and on analysts resolving deferred cases. A twin‑aware attacker was detected in 45% of episodes yet almost never attributed to attack. These results are conditional on the simulator's generative assumptions and have not been validated on field data.
Authors:Zhenhao Zhang, Zhaoyu Fan, Haohan Ying, Jingwen Hu, Hancen Fan, Junhao Zhou, Zitian Chen, Linchao Zhu
Abstract:
Interactive CAPTCHAs remain challenging for computer‑use agents, while existing datasets face trade‑offs among type coverage, interaction fidelity, and trajectory supervision. To address these gaps, we present CaptchaArena, the first large‑scale, fine‑grained training dataset for interactive CAPTCHA solving. It contains 50K puzzles across 20 CAPTCHA types and 5 interaction modes, with every solution verified through execution. CaptchaArena provides 50K screenshot‑action trajectories, including 46K with step‑by‑step reasoning annotations. It also includes fine‑grained pixel‑mask annotations for irregular targets. Using CaptchaArena, we train CaptchaAgent, a single 9B policy for all 20 CAPTCHA types, with supervised fine‑tuning followed by reinforcement learning. The environment verifier directly provides the RL reward. Supervised fine‑tuning reaches 70.5 Pass@1, and reinforcement learning further improves it to 71.7, while also improving performance on two external benchmarks. These results demonstrate the value of large‑scale, fine‑grained computer‑use supervision for training interactive CAPTCHA agents. We release CaptchaArena and CaptchaAgent at https://github.com/X0X0X00/CaptchaArena.
Authors:Olli Tuomi
Abstract:
The corpus‑mean direction of a transformer's residual stream is a component shared across all inputs, and is commonly removed by mean‑centering before representational analysis. We present evidence that it is a functional component: the reference against which the MLP gate population sets its operating point. In Phi‑2, an exact decomposition of resting gate pre‑activations shows that at mid‑stack layers the resting inhibition of >99.9% of gates is carried by the coupling w \cdot b_L to the carried mean direction, at 48‑56× the explicit bias parameter, and the coupling is direction‑specific: a random direction at matched norm orders the population's firing rates at Spearman ρ\leq 0.09 where the reference reaches 0.95. (That 0.95 is near‑tautological on its own; the paper derives its null.) Causally, removing the stream's projection on the reference multiplies above‑threshold firing by about 9×, dose‑monotonically, at 23‑59× a norm‑matched control; a random‑initialised twin is flat, and replacement tests show that the direction carries the function and the magnitude does not. A direction‑matched control makes the same point: noise injected along the reference costs 8‑42× the same energy along a random direction. The decomposition replicates on four further families spanning both gate types (GELU with an explicit gate bias, bias‑free SwiGLU), and the dose‑response on two of them. Across an eight‑model scan the mechanism is present in every GELU and SiLU family and absent only in OPT, where an opposing LayerNorm bias cancels the carried reference. Gate thresholds are implemented as couplings to a constant the network builds for the distribution it is reading, with the bias parameters contributing little; how much of that constant is carried in the stream and how much in parameters depends on the architecture.
Authors:Chengqian Ma, Wenhao Feng, Weixuan Jin, Gaole Dai, Tianyu Xie, Yuexiao Ma, Zhaolu Kang, Xiangyu Zhao, Xiawu Zheng, Fei Chao
Abstract:
Real‑time full‑duplex speech models can listen while speaking, enabling natural interaction without rigid turn boundaries. Existing benchmarks evaluate turn‑taking, interruption handling and multi‑round dialogue, but largely centre on a designated user rather than an assistant participating in a shared conversation among several people. We introduce Duplex‑MPE to evaluate when such an assistant should answer, remain silent or stop speaking. The benchmark contains 2,000 scenarios with three or four human speakers and one assistant, each paired across explicit and implicit addressing of the same request. Models receive continuous conversation audio without transcripts or supplied turn boundaries. Four scores measure fresh response initiation, answer accuracy, silence preservation and stopping when a human resolves a request. We evaluate five open‑weight speech systems: MiniCPM‑o 4.5, Moshi, FLM‑Audio, Voila and Freeze‑Omni. MiniCPM‑o 4.5 leads on three scored capabilities, while frequent speech from other systems can coexist with inaccurate answers or failures to remain silent. A transcript‑based Gemini 3.1 Pro reference responds 64.3 percentage points more often to explicit than implicit requests; paired tests detect no significant response‑rate difference for the speech systems.
Authors:Xiao Zhan, Chrystiano Araújo, Kangle Deng, Maneesh Agrawala, Hsueh-Ti Derek Liu, Mina Konaković Luković
Abstract:
We present a neural method for adaptive triangle mesh refinement, in which an autoregressive model adds geometric detail to selected regions of an input mesh while leaving the rest unchanged, a key capability for efficiently allocating mesh budget. Existing upsampling methods struggle to achieve this. Classical subdivision schemes refine triangulation without semantic awareness of the underlying shape or the ability to recover geometric details missing from a coarse input. Recent neural mesh models generate shapes globally, sacrificing region‑specific control. We propose a novel tokenizer that yields combinatorially many valid upsampling trajectories from a single mesh. Trained on such data, our locally‑conditioned autoregressive architecture allows for direct manipulation of topology and geometry within target regions of an input mesh. We validate our method against state‑of‑the‑art approaches and demonstrate its ability to perform adaptive upsampling with region‑selective control, a capability absent from existing approaches. This unlocks inference‑time view‑dependent refinement, physics‑aware region refinement, and coarse‑shape conditioned novel mesh synthesis. We provide code at https://github.com/seanxzhan/learned‑localized‑mesh‑refinement/.
Authors:Xinye Chen, Stefan Güttel, Mohammad Mozaffari
Abstract:
We introduce ROTE (RollOut Testing of Exact memorization), a benchmarking protocol for evaluating symbolic memorization of neural architectures. We study memorization and the extension of symbolic rules in neural sequence models by using sequences whose complexity is regulated by Lempel‑‑Ziv‑‑Welch (LZW) compression. Under ROTE, each architecture is trained as the same finite‑context conditional predictor and is evaluated using teacher‑forced one‑step prediction as well as closed‑loop rollout on the withheld symbols. Following a shared prediction‑and‑rollout evaluation routine, the benchmark evaluates gated recurrent, minimal recurrent, attention‑based, and hybrid recurrent‑attention models with their native computational characteristics preserved. Beyond standard predictive metrics, the benchmark reports normalized string distances, training time, memory usage, and parameter count across an LZW‑complexity sweep. The study establishes a connection between the complexity of algorithmic sequences and the memorization capacity of neural architectures, revealing the trade‑offs involving memorization quality, rollout stability, and computational expense. Our software and reproducible experimental code can be obtained from https://github.com/nla‑group/rote.
Authors:Jianhai Zhang, Pattarawut Charatpangoon, Donghao Zhang, Bijoy K. Menon, Wu Qiu, M. Ethan MacDonald, Aravind Ganesh
Abstract:
Strongly paired medical image translation contains a substantial component that can be predicted directly from the source. The current reality is that pure deterministic prediction can smooth away fine detail, while generative models can recover detail but may also introduce unnecessary or potentially harmful variation. We propose PredRA, a fast framework that uses the deterministic prediction as a stable reference and further extracts additional deterministic components from the residual during generative refinement, thereby improving fidelity while maintaining perceptual quality. The goal is simple: we view the entire residual‑based generative process as an optimization problem and derive a practical solution that recovers useful residual detail through controlled refinement while keeping the prediction close to the paired target. Mechanism studies further show that useful residual information follows structured patterns, but its usefulness is difficult to estimate reliably at the voxel level. We therefore globally control how much of the residual refinement is added to the deterministic prediction, thereby reducing the accumulation of unnecessary uncertainty. PredRA therefore combines deterministic component extraction with controlled stochastic refinement for fast, fidelity‑preserving, and perceptually strong medical image translation. We validate the approach across multiple real‑world datasets, showing that controlled refinement improves fidelity to the paired target compared with full residual refinement while retaining much of the perceptual benefit of generative modeling. PredRA achieves competitive or superior performance to substantially larger state‑of‑the‑art models with 1.4‑11.9x fewer total parameters and 3.1‑26.2x fewer trainable parameters, while its 32‑step flow sampler requires 31.25x fewer sampling steps than the matched 1000‑step DDPM.
Authors:Ninghan Zhong, Jing-Chen Peng, Sriram Vishwanath
Abstract:
Vision‑Language‑Action (VLA) models have shown strong performance on robotic manipulation, but they often struggle to generalize to unseen tasks, configurations, and long‑horizon settings. A key challenge is that VLAs overfit to training scenes and fail to follow novel language instructions. Off‑the‑shelf vision‑language models (VLMs) often provide stronger generalization, but cannot directly control robot actions. To combine the common sense of VLMs with VLA control, we propose Guided Trace VLA (GT‑VLA), a steerable framework that accepts guidance from an external generalist VLM through trace‑conditioned action generation. GT‑VLA uses a generalist model to identify semantic guidance for the current skill, converts this guidance into a 2D visual trace, and conditions its action policy on the resulting trace‑rendered observation. This design separates semantic target acquisition, trace generation, and low‑level action execution, allowing high‑level guidance to propagate to robot actions. GT‑VLA uses a Mixture‑of‑Experts architecture with skill‑specific trace and action modules for robust execution. We evaluate GT‑VLA on LIBERO and a physical robot platform, showing improved generalization over recent VLA baselines in both settings. The code and additional supplemental materials are available on our project website at https://ivaniz.github.io/gt‑vla/.
Authors:K M Naimul Hassan, Ali Alavi, Donald S. Williamson
Abstract:
Humans rely on gaze, head movements, and visual cues to attend to speakers in noisy environments, yet auditory attention decoding (AAD) has been studied primarily using electroencephalography (EEG). We introduce the Multimodal Auditory‑attention Egocentric Speech‑TRacking Open (MAESTRO) corpus, the first AAD dataset to simultaneously record EEG, eye gaze, pupillometry, egocentric video, and head inertial measurement unit (IMU) data. MAESTRO includes four competing speakers and background noise across multiple signal‑to‑noise ratio (SNR) conditions, enabling attention decoding under realistic listening scenarios. Through a four‑speaker attention decoding benchmark, we show that combining behavioral and physiological signals improves decoding performance over EEG‑only approaches, enabling future advances in multimodal auditory attention decoding. These findings open the door to new applications, analyses, and methodological advances in multimodal AAD. The complete dataset is publicly available at https://huggingface.co/datasets/aspire‑osu/maestro‑eeg‑dataset . The official code repository is available at https://github.com/ASPIRE‑OSU/MAESTRO .
Authors:Qiaolin Wang, Pedro Sandoval-Segura, Anunaya Joshi, Edvardas Jurkonis, Jake Downie
Abstract:
While modern text‑to‑speech (TTS) systems generate highly natural speech and support inline non‑verbal vocalization (NVV) tags, accurate control over these events remains challenging. A key gap is the lack of established post‑training methods for non‑verbal control in continuous autoregressive flow‑matching TTS. To this end, we present NVAlign, a direct‑gradient post‑training framework for NVV tag‑following in this architecture. We first perform supervised fine‑tuning (SFT) of TTS models and an NVV‑aware automatic speech recognition (NV‑ASR) model on NVV‑annotated speech, then freeze the NV‑ASR model to serve as the reward model for post‑training. A two‑step gradient surrogate enables efficient reward backpropagation through the flow‑matching sampler to jointly update the autoregressive backbone and acoustic flow head. Fidelity penalties and reference‑velocity regularization help preserve speaker similarity and speech quality. Results from NVV‑SuperBench and human listening evaluations show that NVAlign improves tag‑following accuracy over SFT and Flow‑GRPO baselines. These findings demonstrate that direct reward‑gradient optimization can improve non‑verbal control in continuous autoregressive flow‑matching TTS. Audio samples are available at https://nvalign.github.io/.
Authors:Nilotpal Kakati, Daniel Murnane, Baran Hashemi, Samuel Klein, Jeffrey Krupa, Eilam Gross, Lukas Heinrich, Michael Kagan
Abstract:
Reconstruction and simulation at a collider experiment are long chains of specialised algorithms, each tuned to a single step. We explore how one model can serve many of those steps at once, while still producing the intermediate objects (tracks, calorimeter cells, clusters, particles and jets) that make the chain interpretable. To do so, we represent every object in a jet in a single shared token vocabulary and train one model to map any subset of these modalities to any other. A task is then only a choice of which modalities to provide and which to request: particle flow, detector simulation and charged energy subtraction are all directions through the same set of weights. We train over all modality combinations, with a decoder emitting tokens either autoregressively or in parallel. With tokenisation, both architectures train stably with little tuning. In evaluations, both models produce realistic reconstruction and simulation objects, with the autoregressive model particularly faithful to output from Geant4. The autoregressive model also outperforms a state‑of‑the‑art particle flow algorithm on many typical jet reconstruction metrics.
Authors:Yanlin Li, Mingyang Hao, Shengqiong Wu, Hao Fei, Mong-Li Lee, Wynne Hsu
Abstract:
General‑purpose agents can plan, reason, and act over long horizons, yet their production capabilities remain fragmented across text, images, audio, video, documents, 3D assets, and code. Extending a foundation model to additional modalities ties capability growth to costly model updates, while assembling specialist models and tools leaves unresolved how procedures, dependencies, intermediate assets, and cross‑turn revisions should be coordinated. We present Omni‑IO Skills, a plug‑and‑play Agent Harness that makes existing agents omni‑native through hierarchical Skills, a standardized multimodal execution interface, dependency‑aware orchestration, and a persistent Asset Registry. Multi‑asset workflows are represented as Declare Execution Graphs, which schedule independent operations concurrently and register successful outputs for downstream and cross‑turn reuse across replaceable execution backends. Its 27 Skills cover 38 representative tasks spanning seven artifact modalities and four capability families: understanding, generation, reasoning, and retrieval. On UniM‑90, the harness raises the input‑support rates of GPT‑5.6 Sol and Claude Sonnet 5 from 40.00% and 38.89% to 100%, while increasing relative Semantic‑‑Quality Coupled Score from 26.99 to 74.94 and from 27.82 to 77.78, respectively; Strict Structure Score reaches 100.00 and 99.78. These results establish harness‑level capability composition as a practical route to broad, evolvable Omni systems without changing the host agent's reasoning core.
Authors:Florian Philipp Stilz, Lorenzo Arboit, Vinkle Srivastav, CAMMA International Surgical Partners, Jacques Marescaux, Sergio Alfieri, Pietro Mascagni, Nassir Navab, Nicolas Padoy
Abstract:
Developing label‑efficient models is a central challenge in surgical AI due to the high cost and scarcity of expert annotation. While self‑supervised foundation models adapt well to new tasks with minimal data, how label efficiency varies across different surgical tasks remains largely unexplored. Here, we introduce SURGE, a surgical foundation model trained on SurgSpectrum‑30M+, the largest pretraining dataset comprising over 30 million frames, with checkpoints released to enable further research. We systematically evaluate label efficiency across 5 task categories and 15 benchmarks. These range from temporal and spatial scene understanding to fine‑grained reasoning tied to instrument‑anatomy interactions and safety‑critical maneuvers. SURGE outperforms prior state‑of‑the‑art on all benchmarks, even surpassing task‑specific models on complex reasoning tasks. Crucially, we reveal a task‑dependent scaling behavior: while scene understanding tasks saturate with minimal supervision, fine‑grained reasoning tasks continue improving with substantially larger annotation budgets, providing a blueprint for allocating expert effort in complex domains. Code: https://github.com/CAMMA‑public/SURGE
Authors:Chengkai Xu, Jiaqi Liu, Yicheng Guo, Peng Hang, Jian Sun
Abstract:
Evaluating VLM‑based autonomous driving remains difficult because driving competence is composite, where a capable system must ground traffic participants and hazards, integrate context across views and time, reason about future evolution, and act appropriately under closed‑loop interaction. Existing benchmarks usually assess either open‑loop understanding or closed‑loop driving but provide limited structure for explaining how these abilities are organized, how they relate, and how they may inform model diagnosis and improvement. We present \textscDriveHierarchy, a hierarchical benchmark that organizes VLM‑based autonomous driving into four ranks, spanning perceptual grounding, contextual memory, mental reasoning, and closed‑loop execution. To instantiate this hierarchy, we integrate multiple open‑source autonomous‑driving datasets into a unified open‑loop benchmark with 76,798 question‑answer pairs over 84,279 frames and develop a closed‑loop simulation platform with interactive scenario construction on a real‑world road network, from which 100 driving scenarios are curated for embodied evaluation. Experiments on 15 VLMs show that \textscDriveHierarchy captures structured but non‑redundant capability variation, relates open‑loop understanding to closed‑loop driving, and provides a practical basis for diagnosis and benchmark‑guided optimization. \textscDriveHierarchy therefore serves as a unified framework for evaluating and improving VLM‑based autonomous driving systems. An anonymized project has been released on https://github.com/PerfectXu88/DriveHierarchy
Authors:Felipe Marra, Lucas N. Ferreira
Abstract:
Video‑to‑music models have advanced considerably in the last few years, particularly in film and music video applications. In this paper, we investigate this problem in the video game domain, which introduces new challenges for these models: video frames are rendered graphics, music is mostly synthetic audio, and soundtracks loop across entire levels rather than following on‑screen events. We introduce a new dataset of 217.6 hours of Super Nintendo (SNES) gameplay video paired with 485 hours of clean soundtracks, free of sound effects and voice‑overs, matched to gameplay audio via audio fingerprinting. With this dataset, we train a simple encoder‑decoder transformer that passes video features directly to a MusicGen decoder, comparing different encoding strategies: textual descriptions (T5), independent frames (ViT), or spatiotemporal patches (ViViT). Each encoder is tested both frozen and fine‑tuned, while the decoder is always fine‑tuned. Frozen encoders match or outperform their fine‑tuned counterparts on every metric, and the frozen ViViT achieves the best overall results. We compare this model with state‑of‑the‑art baselines using both objective metrics and a listening study (N = 96). Despite having up to 18% fewer parameters, our model outperforms all baselines on objective metrics, surpasses GVMGen in the listening study, and performs comparably to OSSL.
Authors:Liyu Hou, Yuan Wu, Yi Chang
Abstract:
While Vision‑Language‑Action (VLA) models perform strongly on manipulation tasks, their responses to invalid task premises remain underexplored. Existing evaluations of premise conflicts often focus on terminal task outcomes, yet task failure alone cannot distinguish behavioral disengagement from continued pursuit followed by an execution error. We call the latter pattern Failed Persistence. To study this phenomenon, we introduce ConflictVLA‑Bench, which pairs conflict rollouts with premise‑consistent reference rollouts and evaluates both outcomes and execution processes. Built on LIBERO, the benchmark contains 2,826 prompt‑conditioned conflict tasks spanning four conflict families, four structural configurations, and two prompt conditions. Across all eight VLAs, invalid premises reduce original goal completion by at least 17.3 percentage points, with the reduction reaching 56.2 percentage points for OpenVLA. Crucially, even when models succeed on premise‑consistent tasks and fail on their matched conflict tasks, they often continue to approach the original targets, retain early trajectory structure, and show limited action magnitude suppression. Failed Persistence therefore recurs across the evaluated models. Explicit premise checking does not consistently produce selective and coordinated behavioral changes. These findings show that terminal failure alone establishes neither behavioral disengagement nor refusal and that outcomes alone are insufficient for VLA evaluation. Experimental data and additional details are available on the project page: https://github.com/EmbodiedAISurvey/ConflictVLA‑Bench
Authors:Krishna Kanth Nakka
Abstract:
In this work, we explore MammoClaw, a training‑free agent framework that leverages frozen MLLMs for mammography analysis. To support agentic investigation, we equip the agent with lightweight mammography‑specific tools for targeted image analysis, including ROI, paired‑view, and contralateral‑breast examination. MammoClaw iteratively gathers evidence through these tools, while skill evolution enables non‑parametric adaptation by transforming failed trajectories into reusable guidance for later runs. We evaluate the framework on BI‑RADS assessment and breast density estimation tasks. In our experiments, we find that tools alone do not reliably improve performance, whereas evolved skills can improve tool‑use behavior and performance in some settings. Beyond these results, MammoClaw enables transparent inspection of evidence acquisition, tool interactions, and failure modes, facilitating the analysis and auditing of agent behavior. We view this work as an exploratory study of training‑free, self‑evolving agentic approaches for mammography and hope it provides a concrete starting point for future work on mammography‑specific tools and self‑evolution mechanisms. We release our code at https://krishnakanthnakka.github.io/mammoclaw.
Authors:Renjie Liang, Yang Yang, Jinqian Pan, Zhengkang Fan, Chengkun Sun, Jie Xu
Abstract:
Progress in 3D CT report generation is usually sought in increasingly sophisticated architectures and larger pools of training data. We find instead that a 3D CT report generator already holds what its report leaves out, and loses it when the hidden state becomes tokens. Over the 18 CT‑RATE abnormalities, this hidden‑to‑report surfacing gap is reflected by a drop in macro AUROC from 0.848 in the hidden states to 0.739 in the generated report. We propose SelfCue based on contrastive decoding. It promotes what the hidden state already supports and suppresses what it does not. It raises clinical efficacy F1 to 0.481 and the LLM‑judged GREEN score to 0.510. Distilling that behaviour into the weights gives SelfCue‑KD, a student that keeps most of the gain, needs nothing extra at inference, and drops into any pipeline already serving the baseline. Code is available at https://github.com/renjie‑liang/SelfCue‑CT.
Authors:Sida He, Lingxi Xie, Yunning Cao, Pengfei Chen, Kaiwen Duan, Jiannan Ge, Xinyue Huo, Jiacheng Shao, Qi Tian
Abstract:
General‑purpose multimodal agents can write robot‑control programs, but repeated exploration and model‑mediated action selection can make execution slow. We study how external body knowledge, successful experience, and executable skills improve an XLeRobot controlled by GPT‑6‑Astra in a simulated and a physical elevator‑button task. In 30 fixed‑start simulation trials, complete robot geometry and camera information reduce mean completion time by 57.4% relative to a baseline with only the common control interface and no prior experience; images with synchronized action and state records reduce it by 68.6% without additional body assets. In nine paired comparisons (18 trials) at starts displaced by 10‑100 cm, experience recorded at the original start reduces mean time by 58‑63% relative to no experience, demonstrating generalization to the tested new starting positions. During experience experiments, GPT‑6‑Astra spontaneously generates a short visual‑feedback program. Researcher‑refactored versions reduce mean local‑task time by 29‑31% in 27 simulation trials. Finally, 12 real‑robot trials using operator‑confirmed button contact demonstrate sim2real reuse: at a shared nominal start, simulation XML assets and simulation experience reduce mean time by 53.0% and 49.9%, respectively; real experience also transfers to two new starts. These results suggest a practical way to build general‑purpose manipulation experiments around GPT‑6‑Astra: supply machine‑readable body descriptions and synchronized demonstrations, and turn useful agent‑generated feedback routines into reusable skills, while the agent adapts actions from current images. We release all task prompts, trial‑level experimental data, and acquired skill implementations at https://github.com/hesd10/astra‑robot‑sim2real.
Authors:Tianjian Zhou, Yishan Li, Jie Jiang, Yifei Zhang
Abstract:
Panoramic 360^\circ scene understanding increasingly relies on icosphere transformers, but a state‑of‑the‑art spherical model loses more than half of its segmentation accuracy when the camera rotates by 90^\circ, and controlled ablations identify gauge dependence in its relative‑position bias as a major contributor. We propose gauge‑equivariant relative position encoding (GE‑RPE): a parameter‑free Reynolds average of the bias over a finite cyclic subgroup C_n\!\subset\!\mathrmSO(2) of gauge rotations. Plugged into a SphereUFormer backbone the change is invisible at deployment‑‑‑zero added parameters and 1.5‑‑4.4% forward latency‑‑‑and the matched three‑seed GE‑RPE model records a 1.3% drop; the published SphereUFormer checkpoint records 53% under the same stress protocol but a different training recipe. Once the gauge defect is removed and a teacher‑token permutation π_R aligns the SSL views to the rotated student frame, iBOT+MAE pretraining stops being a liability and becomes a clean low‑label lever: the full framework EquiSSL (GE‑RPE + π_R + iBOT+MAE) tightens the drop to 0.8% at 68.30% val mIoU and lifts 1%‑label fine‑tuning by +2.39 mIoU on the N=373 test split (and by +4.10 on the smaller N=40 val split); the same fix carries over to monocular depth and to zero‑shot Structured3D segmentation. The construction is provably C_n‑invariant and \mathcalO(n^‑2)‑close to the continuous \mathrmSO(2) average, making the resulting model a usable 360^\circ visual‑computing primitive across panoramic relighting, immersive video, and cross‑dataset transfer. Code is available at https://github.com/Jaywalk18/equissl‑release.
Authors:Zhongpeng Pan, Xina Cheng, Kailun Yang
Abstract:
Video anomaly detection for patrol robots and surveillance systems must recognize abnormal interactions among familiar entities. Existing pixel‑reconstruction and isolated‑entity methods may fail when individual entities appear normal but their spatial or motion relations are abnormal. This work presents Interaction‑Centric Network for Temporal Entity‑Relation Analysis and Consistency Testing (INTERACT), a framework for unsupervised video anomaly detection. Person‑Object Appearance‑Motion Interaction (POAMI) moves beyond isolated‑entity encoding by jointly modeling the appearance, motion, and spatial configurations of persons and objects in each frame. The resulting representations capture both individual entity states and their cross‑entity context. Based on these representations, Target Geometry‑Guided Relational Interaction Prediction (TGRIP) predicts target entity interaction states from historical relational memory and target‑frame geometry without explicit identity tracking. Motion‑Interaction Reconstruction and Alignment (MIRA) then evaluates these predictions through conditional flow reconstruction and semantic consistency checking, providing complementary anomaly evidence beyond prediction error alone. INTERACT achieves state‑of‑the‑art performance, obtaining a frame‑level AUC of 84.5% on the ShanghaiTech benchmark. Ablation studies show that removing cross‑entity attention causes the largest performance drop, demonstrating the necessity of relational modeling. INTERACT is particularly effective for anomalies caused by changes in relations among people and objects, while maintaining competitive performance in general scenarios. The source code will be made publicly available at https://github.com/ppworkhard/INTERACT.
Authors:Jingren Xie
Abstract:
The thermal behavior of wood is a critical factor in advanced material assembly. However, pixel‑level thermal analysis remains fundamentally constrained by the low resolution and noise inherent to infrared thermography. To address this, we introduce an end‑to‑end computational framework that synthesizes high‑resolution thermal responses directly from wood RGB images. We first establish a core physical linkage: because spatial color variation in natural wood is driven by cellular anatomy, optical intensity serves as a reliable geometric proxy for the localized solid volume fraction. By leveraging this theoretical insight, we develop an automated finite‑element‑method data engine that maps pixel‑level optical intensity to a 3D thermodynamic voxel grid, generating high‑fidelity synthetic thermal responses. We find that 1) when the thermal conductivity along the thickness direction is uniform or linear, wood RGB images and their corresponding thermal responses exhibit extreme morphological similarities, and the lateral thermal diffusion acts as a low‑pass filter that smooths out high‑frequency details; 2) when the thermal conductivity along the thickness direction is random, such morphological similarities are destroyed, and wood's 3D structure dominantly governs its thermal response. We further utilize these synthetic thermal responses to supervise a neural surrogate model built upon the DINOv3 foundation model. Our results demonstrate that the neural surrogate model successfully internalizes the governing thermodynamic laws, thereby bypassing computationally expensive simulations and enabling high‑resolution thermal inference. This methodology effectively bridges the semantic and thermodynamic domains, unlocking systematic, pixel‑level analysis of fine‑grained wood thermal responses. Project: https://zekifayes.github.io/seeheat
Authors:Elie Thellier, Huiyu Li, Nicholas Ayache, Hervé Delingette
Abstract:
Collaborative medical AI platforms allow researchers to train models on sensitive imaging data while restricting data export. However, trained models can serve as covert carriers of patient information: medical images may be encoded within model parameters and reconstructed outside the secure environment. Existing defenses rely on lightweight sanitization (e.g., fine‑tuning, pruning, quantization) and limited statistical auditing, creating a realistic insider exfiltration risk. We introduce a high‑capacity neural steganography attack that encodes medical images as continuous latent representations embedded into model initialization. A StyleGAN2‑based adversarial autoencoder learns compact latent codes regularized to match standard weight initialization statistics, keeping embedded parameters statistically consistent with clean models. Noise injection during training improves robustness to export‑time mitigation. The carrier model remains functional on its intended task and hidden images can be reconstructed directly from its weights after export. This continuous encoding enables robust and scalable exfiltration, allowing up to 99 brain MRI volumes to be embedded within a 30MB model, and remains recoverable under mitigations that disrupt prior bit‑level schemes. While reconstructions are approximate rather than pixel‑exact, embedded content remains anatomically recognizable and recoverable at scale, exposing a privacy risk distinct from prior bit‑level approaches. Experiments on MIMIC‑CXR, BraTS, and LiTS demonstrate effectiveness across modalities, tasks, and architectures, highlighting the need for structural defenses beyond parameter‑level sanitization. Code is available at https://github.com/ElieThellier/high‑capacity‑robust‑medical‑image‑exfiltration.
Authors:Zhengtong Zhu, Jiaqing Fan, Hanwen Qian, Fanzhang Li
Abstract:
Video Object Segmentation (VOS) aims to accurately segment target objects from consecutive video frames and track the changes of the objects in each frame of the video. Conventional VOS methods typically demand substantial quantities of pixel‑level labeled video sequences for fully supervised learning, which limits the performance of the model in sparse video scenes, while existing VOS methods have limited adaptability to global changes in objects. Based on this observation, in this paper, we propose self‑supervised VOS with Sliding window, Wavelet transform and optimal Transport (SWT), a self‑supervised VOS framework entirely trained on static dataset using contrastive learning. Firstly, a rolling sample buffer reuses overlapping groups of independently sampled images across successive updates. Secondly, to address the long‑distance modeling difficulty caused by simple convolutional structures, we introduce wavelet transform to expand the receptive field of convolutional kernels, thus improving the model's representational capability. Finally, we incorporate optimal transport to assist the model in finding the globally optimal match between the target across two frames, improving the model's ability to handle nonrigid deformations of objects. SWT only requires training on the COCO dataset once and achieves excellent results on five VOS datasets as well as an additional body part propagation dataset. The code will be released soon at [https://github.com/machine928/SWT.git](https://github.com/machine928/SWT.git).
Authors:Peng Xu, Haoran Lin, Wanjun Jia, Kai Luo, Wenrui Chen, Zhiyong Li, Kailun Yang
Abstract:
Vision‑Language‑Action (VLA) policies have shown promising performance in language‑conditioned robotic manipulation. However, most existing VLA systems rely on conventional perspective cameras with limited fields of view, often missing global scene context and leading to unreliable manipulation under visual occlusions, distractors, and unseen environments. In this work, we propose PanoFuse, a panorama‑enhanced VLA framework that complements local manipulation observations with global panoramic perception. PanoFuse introduces a dedicated panoramic branch that leverages a pretrained panoramic foundation model to extract complementary semantic and geometric representations from omnidirectional observations. Rather than directly mixing these heterogeneous features, we introduce Decoupled Semantic‑Geometric Routing (DSGR), which maintains semantic and geometric representations as separate context streams and selectively routes both to downstream state and action representations through structured block‑wise attention. This design provides the action expert with global spatial context while preserving task‑relevant semantic information from the pretrained VLA backbone. We further develop a synchronized data collection pipeline and construct a new real‑world manipulation dataset containing panoramic RGB observations, wrist‑view images, language instructions, robot states, and actions. Across seven evaluation settings, PanoFuse achieves an average success rate of 52.9%, outperforming the evaluated baselines and achieving consistent gains under novel‑object, unseen‑background, and distractor‑rich settings. Code and data will be released publicly at https://xux‑hnu.github.io/PanoFuse.
Authors:Di Kuang, Mengfei Duan, Yuhang Wang, Weixing Peng, Kailun Yang
Abstract:
Persistent semantic occupancy mapping is essential for embodied scene understanding. However, perspective‑based systems provide limited spatial coverage, while existing panoramic methods primarily predict local volumes from single observations. We introduce PanOVOcc, a training‑free framework for persistent open‑vocabulary semantic occupancy mapping from panoramic sequences. PanOVOcc unifies panoramic SLAM, open‑vocabulary perception, and long‑term spatial voxel memory within an online architecture, continuously integrating geometric and semantic evidence into a global, language‑queryable map. To facilitate systematic evaluation of this setting, we establish Pan‑Replica and Pan‑Holo360D, two benchmarks pairing continuous panoramic RGB‑D sequences with scene‑level semantic occupancy ground truth across synthetic and real‑world scenes. Compared with the strongest evaluated baseline for each metric, PanOVOcc improves occupancy IoU and semantic mIoU by absolute +20.03 and +7.06 on Pan‑Replica, and by +43.26 and +20.16 on Pan‑Holo360D, respectively. The source code and the established benchmarks will be available at https://github.com/bakereet/PanOVOcc.
Authors:Xinyu Deng, Siwen Luo, Daochang Liu
Abstract:
As large language models (LLMs) become capable of processing increasingly diverse modalities and longer temporal contexts, an emerging line of work is moving beyond fixed video‑language inference toward agentic systems that actively decide what information to inspect, retain, verify, and act upon. This survey reviews video understanding agents: systems that use video as the primary information source and solve understanding tasks through adaptive state construction and action selection. We first formalize an agent loop for video understanding, then address a central question: why do agents matter for video understanding? To answer this, we organize the literature through a challenge‑to‑design taxonomy, linking context bottlenecks to hierarchical evidence memory, evidence sparsity to active evidence acquisition, temporal causality to state and process tracking, and multimodal ambiguity to role‑specialized coordination. We further review state space paradigms, learning paradigms, supervision signals, benchmarks, and evaluation protocols. Finally, we identify open directions toward agentic‑native temporal modeling and video‑native agents. Project page: https://github.com/DXY0711/Awesome‑Agentic‑Video‑Understanding
Authors:M. Fazri Nizar, Muhammad Naufal Rachmatullah, Julian Supardi
Abstract:
Reliable breast ultrasound lesion segmentation requires accurate boundaries and evaluation that prevents patients or duplicate images from crossing data splits. We propose Channel Local Contrast (CLC), a compact refinement of the YOLO26 segmentation prototype head. CLC adds a fixed local high‑pass residual controlled by 64 zero‑initialized, bounded channel gates. Baseline and CLC were compared in five matched folds on each of four breast ultrasound datasets. BUS‑BRA used patient‑disjoint outer tests with separate inner validation. BUS‑UCLM and BrEaST used patient‑grouped validation folds; BUSI used duplicate‑component groups because patient identifiers are unavailable. Group‑macro Dice increased by 1.68, 3.11, 1.12, and 2.45 percentage points on BUS‑BRA, BUS‑UCLM, BUSI, and BrEaST, respectively. Only the BUS‑BRA paired 95% confidence interval excluded zero. CLC adds 64 parameters and 0.0049 giga floating‑point operations (GFLOPs). At 640 pixels, single‑T4, batch‑one, 16‑bit floating‑point (FP16) TensorRT graph times were 2.1478 ms for CLC and 2.0512 ms for baseline, excluding preprocessing and postprocessing. CLC increased group‑macro Dice across all four datasets with a measured T4 forward‑pass overhead of 0.0966 ms. Code: https://github.com/mfazrinizar/CLC‑YOLO
Authors:Ashim Nepal, Ashok B. K
Abstract:
Compressed‑domain video captioning avoids full video decoding by operating directly on I‑frames, motion vectors and residuals, trading a small amount of accuracy for a large gain in inference speed. CoCap established this pipeline using a CLIP vision encoder and a shallow BERT‑style multimodal decoder. Both components predate substantially stronger alternatives. We ask a narrow, controlled question: how much of CoCap's accuracy is limited by these two components, and which of the two is the binding constraint? We replace the CLIP I‑frame encoder with SigLIP2 and the BERT‑style decoder with GPT‑2, and evaluate three configurations (the original pairing, the encoder substitution alone, and both substitutions together) under identical data, sampling budget and optimisation schedule. All comparisons are made against our own reproduction of CoCap rather than its published numbers, because we train on a 4,999‑clip subset of VATEX at a reduced sampling budget; absolute values are therefore not comparable with the original work. Our reproduction tracks the published result closely: CIDEr and METEOR run slightly above it (54.9 against 52.7; 23.4 against 23.2), BLEU‑4 and ROUGE‑L slightly below (29.7 against 31.4; 48.9 against 49.4). We attribute the differences to our evaluation subset rather than to any improvement in either direction. We find the two substitutions pull in opposite directions: SigLIP2 alone improves every metric (+4.5 CIDEr), while adding GPT‑2 on top erodes that gain, because a pretrained decoder overfits 4,999 clips within two epochs. We additionally report inference latency for each configuration, since speed is the property that motivates compressed‑domain captioning in the first place, and an accuracy gain purchased at a latency cost should be reported as such.
Authors:Arefeh Rezaei
Abstract:
Low‑light conditions can significantly degrade the ability of vision‑language models (VLMs) to accurately describe human actions in videos. In this work, I propose an efficient uncertainty‑aware representation correction framework for improving captions generated by VideoChat2 under real‑world low‑light conditions. Instead of fine‑tuning the underlying VLM, the proposed framework introduces a lightweight sparse Gaussian process‑based error estimation module between the projection layer and the language model to correct the intermediate representation. The correction module learns to estimate the residual between the original projected representation and a verified target representation, which is then adaptively scaled using a newly formulated uncertainty‑aware coefficient and added to the original representation. To further improve residual estimation, I introduce a partitioned combined‑kernel design. The correction model is trained separately using only 44 samples from the ARID dataset and requires only a small additional computational overhead during inference. The effectiveness of the proposed correction is evaluated through quantitative residual prediction and qualitative analysis of the generated captions. Although VideoChat2 is used in my experiments, the proposed framework is designed to be applicable to other compatible VLM architectures. Code Availability: The implementation accompanying this work is publicly available at:\hrefhttps://github.com/areferezaee/Low‑rank‑SVGP‑NP‑updatehttps://github.com/areferezaee/Low‑rank‑SVGP‑NP‑update
Authors:Balenthira Thanusanth, Selvarajah Thuseethan, Roshan G. Ragel, Bimali S. Weerakoon, Ayesh Jayasinghe, Ananthamoorthy Krishnamoorthy
Abstract:
Explainable Artificial Intelligence (XAI) has become essential in medical image analysis to ensure transparency of deep learning (DL)‑based diagnostic systems. However, selecting appropriate XAI techniques for breast cancer recognition remains largely ad hoc, with limited systematic evaluation across different DL architectures. This study presents a systematic architecture‑aware evaluation protocol to assess the effectiveness of nine widely used XAI techniques across four categories of DL models: very deep, lightweight, transformer‑based and hybrid neural networks. The evaluation is conducted on a breast ultrasound dataset comprising 780 images using clinically aligned spatial metrics, including Pointing Game, Intersection over Union and Mean Coverage, to quantify agreement between generated explanations and expert‑annotated lesion regions. Results indicate that explanation quality is primarily influenced by the interaction between model architecture and XAI method, rather than any single technique consistently outperforming others. Hybrid architectures produce more spatially coherent explanations, while lightweight and transformer‑based models exhibit greater variability across methods. The findings show that no single technique generalises across architectures and evaluation criteria, emphasising the need for joint selection of DL models and XAI techniques. Explainability depends on both model design and explanation strategy and should not be considered independently. This work provides a structured evaluation protocol and practical guidance for selecting XAI techniques in breast cancer diagnosis, supporting more transparent clinical decision‑support systems. \textcolorblueCode is publicly available at https://github.com/Nishan‑Charlie/Explainable‑AI
Authors:Gautam Kishore
Abstract:
We present NanoForecast v0.5, a 6.5M‑parameter forecaster that competes with models 31x its size (TimesFM, 200M parameters) after training pipeline fixes and no architecture change. Retraining the v0.3 architecture with corrected loss‑scope handling, tensor shape alignment, and wider augmentation coverage cuts overall Mean Absolute Scaled Error by 43.8% under one fixed protocol (MASE 3.030 to 1.704) on the same data and compute budget. NanoForecast v0.5 beats TimesFM on all three ETT datasets (MASE 0.676/1.110/0.287 vs. 0.705/1.360/0.545) and on exchange rate (4.317 vs. 4.383); TimesFM keeps a clear lead on the high‑cardinality electricity and traffic sets. Against PatchTST (15M+ parameters, official configuration), v0.5 wins all three ETT sets. Training takes about 12 hours on a single cloud GPU (NVIDIA T4, Google Colab) and inference needs no GPU (measurements in this paper are on an Apple M4 CPU). We release all code, pretrained checkpoints, and evaluation framework under Apache 2.0 at https://github.com/eulogik/NanoForecast
Authors:Mahsa Mohammadi, Zeyu Fu, Sareh Rowlands
Abstract:
Action anticipation predicts future human actions from partial video under incomplete context and temporal uncertainty. Recent systems introduce large language models (LLMs), vision‑language models (VLMs), or language‑derived semantics at different stages, but reported gains are difficult to interpret when task formulation, visual pretraining, supervision, decoder design, and evaluation code change simultaneously. The central contribution of this review is an evidence‑aware design map that crosses task regime with the point at which language‑derived information intervenes. We characterise task regimes along six axes. These axes organise the literature into five broad task families: single‑action, sequence, object‑interaction, cross‑view, and planning‑oriented settings. C1‑C3 locate interventions in context construction, goal/intention modelling, and future decoding, while C4 is treated as an adjacent, emerging grounding/executability extension. Unlike a generic processing pipeline, the map links each intervention to an appropriate counterfactual, failure diagnosis, and permissible evidence claim. Supporting contributions include a protocol‑level audit of Ego4D‑LTA and EPIC‑KITCHENS‑100, a multidimensional evidence profile, and the Backbone‑Aware Comparison and Ablation Protocol (BCAP). The unresolved EK‑100 record is treated as a reporting‑comparability case study and is not used as a leaderboard. Evidence for LLM benefits, goal ambiguity, and horizon effects is therefore formulated as testable hypotheses requiring matched validation, not as causal conclusions. The accompanying package contains the coded evidence, source locators, protocol metadata, and versioned catalogue used in the review.
Authors:Yangbin Yu, Mingyu Yang
Abstract:
We present Open‑Qwen‑Music, an open reconstruction of Qwen‑Music and a fully specified research system for text‑to‑music generation that couples LLM‑based semantic composition with diffusion‑based acoustic rendering. The system comprises a 25 Hz single‑codebook music tokenizer, a 3B‑parameter autoregressive Music LLM, and a diffusion renderer producing 48 kHz stereo audio, following the cross‑module interfaces reported by Qwen‑Music. The strongest systems of this design remain closed, and prominent open music‑generation projects release weights and inference code without their training corpora or end‑to‑end training implementations. This limits independent and controlled study of how information loss and prediction errors propagate from semantic representation through autoregressive planning to acoustic rendering. To our knowledge, Open‑Qwen‑Music is the first fully open release of an LLM‑composition‑plus‑diffusion‑rendering text‑to‑music system. Beyond model weights and inference code, the release includes the training datasets and provenance manifests, complete data‑processing, annotation, training, inference, and evaluation pipelines, configurations, and pretrained weights for every learned module. Artifact manifests bind the identities of these artifacts across the complete workflow. Together, these artifacts establish a reproducible implementation of the modular architecture and provide an empirical basis for component‑level analysis and future evaluation. We present the system as a transparent, executable research baseline and a starting point for the community, not as evidence of quality parity with Qwen‑Music. Open‑Qwen‑Music is an ongoing effort, and we will continue to improve its generation quality, controllability, and robustness. All release artifacts are available at https://github.com/biang15343100‑source/Open‑Qwen‑Music.
Authors:Zhang Yanhai
Abstract:
Replay‑based continual learning almost always consolidates in a dedicated offline phase or by interleaving replayed samples with the input stream, whereas brains also consolidate during wakefulness through local sleep, brief use‑dependent off‑periods of individual circuits. We ask whether a network trained by local, biologically constrained rules can consolidate with no offline phase at all. An isolation rule confines replay updates to hidden synapses invisible to the current input under k‑winner‑take‑all dynamics, with optimiser state advanced only inside the mask; a refractory rotation rule makes units that have just fired sit out the next competition, widening the consolidable set; a homeostatic pressure and a relative‑novelty gate decide when replay bursts fire and when rotation runs. This inverts the usual direction of non‑interfering continual learning: the hidden computation on the current input is held invariant (exactly on the proven channels, and for all but 0.3% of waking samples per update elsewhere) while past memories are written into the degrees of freedom the current batch leaves unused. On class‑incremental split‑MNIST the system reaches 91.6+‑0.3% with no offline phase, at or above the best offline‑night schedule on two held‑out splits, tied with DER++ and above experience replay, ER‑ACE, A‑GEM and unmasked local replay; in a single pass it leads DER++ (91.8% against 90.1%) while the night falls to 76.9%. The advantage is largest at small buffers and gives way to the backpropagation references at large ones; on split CIFAR‑10 the system leads offline rehearsal and experience replay but trails ER‑ACE and DER++. Rotation carries most of the gain; isolation adds the invariance guarantee. The mechanism is not tied to the local rule: under the same schedule a backpropagation network with k‑WTA hidden layers gains from rotation, and isolation is again free on top of it.
Authors:Kai Yu, Chenyu Zhu, Zaifu Zhan, Meijia Song, Min Zeng, Xiaoyi Chen, Mingquan Lin, Rui Zhang
Abstract:
Structured phenotype extraction from radiology reports supports cohort construction, quality auditing, and clinical analytics, but practical deployment requires local inference and auditable predictions, while expert annotations remain scarce. Conventional labelers provide structured findings and assertion states but no supporting evidence, while API‑hosted large language models may be unsuitable when clinical text cannot leave institutional infrastructure. We present CHESTPHENOT, a compact 0.5‑3B language model that jointly extracts finding labels, three‑class status (present/absent/uncertain), and verbatim supporting evidence spans. CHESTPHENOT is trained using hybrid CheXbert+72B silver supervision followed by supervised fine‑tuning and lightweight GRPO refinement. Across three human‑annotated gold sets spanning in‑distribution, cross‑taxonomy, and cross‑institution evaluation, the 3B model remains below its CheXbert silver teacher in distribution but is competitive under distribution shift, significantly surpassing CheXbert on cross‑institution detection (+2.0 F1). Task‑specific training also enables the 3B model to match or exceed substantially larger prompted models on most detection and status comparisons. For evidence‑grounded extraction, over 99% of final evidence spans are locatable in the source report, and the 3B model achieves 47.5 auditable‑F1, outperforming Qwen2.5‑7B one‑shot prompting by 7.6 points and approaching Qwen2.5‑72B. These results demonstrate that locally deployable models can provide competitive and directly auditable radiology‑report extraction without relying on external inference APIs. Code and the full extraction/judge prompts will be made available at https://github.com/yukkai/ChestPheNoT.
Authors:Md Shohel Arman, Igor Molybog
Abstract:
We investigate whether natural‑language documentation helps coding agents resolve software issues, and we build the tools to construct and evaluate it. We introduce a roundtrip benchmark that scores code descriptions by whether code regenerated from them passes the original tests, and show that completeness, not length, drives a description's fidelity. Using the benchmark as an optimization signal, we discover a description‑writing prompt that reaches full fidelity and generalizes to unseen files. We then test the hypothesis that motivated the work: that better documentation helps an agent resolve real repository issues. Across two model families and ten repositories, and against a positive control confirming that our evaluation can detect a genuine improvement, we find that it does not. When the source is present, neither static compact documentation nor retrieved context beats the issue alone. We report this negative result together with the benchmark and the optimizer, and we characterize the boundary at which documentation helps.
Authors:Zachary Olkin, William D. Compton, Aaron D. Ames
Abstract:
General purpose humanoids require locomotion controllers that are multi‑skill, perceptive, dynamic, and robust enough to go anywhere humans can. In this work, we present a two layer locomotion architecture: (1) a perceptive flow matching motion generator plans whole body trajectories from raw depth images while a (2) perceptive tracking policy trained with control‑guided RL follows these motions. Both policies are trained on a library of terrain consistent motion clips created with dynamically optimized human data which yields both accurate velocity tracking and terrain consistent references. Our central contribution is a simple yet effective off‑policy RL fine tuning loop that improves the motion generator. A structured search method is used with the generator to gather data for advantage weighted regression. This off‑policy loop is much more sample efficient than on‑policy residual fine tuning and improves terrain consistency on unseen geometries and skill compositions. We find that successful terrain traversals increased by up to 25 percentage points and skill selection improved by up to 80 percentage points. By using raw depth images to perceive the environment no odometry or height maps are needed, and outdoor deployment is easy. With two cameras, the policy can see terrain coming from further away and adjust its velocity regardless of the commanded speed so it can traverse the terrain. A single policy pair enables a Unitree G1 humanoid to walk, run, stand, jump on and off of boxes, and traverse stairs in outdoor environments. Project page: https://zolkin1.github.io/generate‑track‑improve/
Authors:Ahmed Abdelnaby, Mohamed Elmahallawy
Abstract:
Contrastive Language‑‑Image Pretraining (CLIP) has emerged as a dominant vision backbone due to its strong transferability and zero‑shot capabilities. However, recent studies reveal a critical vulnerability: embedding‑space backdoor attacks. By poisoning only a tiny fraction of image‑‑text pairs, adversaries can implant stealthy triggers that induce targeted shifts in CLIP's joint embedding space. Unlike conventional backdoors that manipulate classifier logits, these attacks corrupt representations directly, making them highly effective under extremely low poisoning ratios and difficult to detect. Existing defenses require access to model parameters, gradients, logits, or clean validation data‑‑‑assumptions that rarely hold in realistic black‑box deployments. Moreover, current black‑box methods struggle to accurately localize small or out‑of‑distribution triggers. We propose CLIPGuard, a lightweight and fully black‑box defense specifically designed to mitigate embedding‑space backdoors in CLIP encoders. CLIPGuard identifies malicious regions by measuring segment‑wise embedding perturbations and selectively purifies only suspicious segments via semantic inpainting, preserving benign visual content and alignment quality. Extensive experiments on STL‑10, ImageNet, and diverse trigger families‑‑‑including BadCLIP, BadNets, blended, patch‑based, and typographic attacks‑‑‑demonstrate that CLIPGuard reduces attack success rates to as low as 1.05% while maintaining clean accuracy up to 86.34%, consistently outperforming existing black‑box defenses, including CleanCLIP and CleanerCLIP. Our code is available https://github.com/wsu‑cyber‑security‑lab‑ai/CLIPGuard.git
Authors:Márcio Marques, Leonardo Mendonça, Leonardo M. Moreira, Christian Júnior de Oliveira, Vitor Balestro, Tiago Novello, Daniel Yukimura, Pavel Petrov, Lucas Nissenbaum
Abstract:
Physics‑Informed Neural Networks (PINNs) build neural representations of time‑dependent PDE solutions, naturally incorporating physics knowledge and observational data, which makes them well suited to both forward and inverse PDE problems. PINNs, however, are known to suffer from spectral bias and lack of causality. Neuro‑Spectral Architectures (NeuSA), a recently proposed alternative to PINNs, mitigate both issues, but their numerical integration becomes unstable for stiff differential equations arising in many relevant physical problems. This study proposes Neuro‑Spectral Exponential Time Differencing Architectures (NEXT), which combines the spectral representation of the PDE solution in NeuSA with high‑order exponential integrators. Within this approach, the linear stiff part of the vector field induced by the PDE is integrated exactly through matrix exponentials, while the possibly nonlinear remainder is modeled by a neural network. The effectiveness of NEXT is verified through benchmark experiments on a set of stiff PDEs, in which NEXT is stable and accurate while NeuSA diverges numerically. It is also shown that NEXT can be applied to inverse problems, where the model has to learn unknown parameters or boundary conditions from sparse data. All code used in this work is publicly available at: https://github.com/marcioh2m/next.git .
Authors:Jiajun Jiang, Chunliang Hua, Zichun Chen, Yanxing Wu, Zeyuan Yang, Jie Song, Xiao Hu
Abstract:
Urban uncrewed aerial vehicle (UAV) vision‑language navigation (VLN) requires agents to follow instructions across extended urban spaces, inherently demanding long‑term memory and geospatial grounding. However, scaling existing benchmarks remains difficult because of their reliance on costly reconstructed 3D assets, limiting geographic diversity and episode scale. To address this, we introduce SatNav, a scalable, long‑horizon UAV VLN benchmark built from high‑resolution satellite imagery. SatNav targets city‑level navigation missions and uses satellite crops as approximations of UAV nadir views for visual observations. Through an automated cue‑to‑episode pipeline, SatNav constructs 118K episodes from 59 scenes across 18 cities, with an average trajectory length of 379 m. To stress‑test long‑horizon memory and geospatial reasoning, SatNav defines three task families: Boundary, Landmark, and Route, targeting loop progress tracking, landmark‑based spatial grounding, and route following with counting cues. Benchmarking classical VLN agents and recent agents based on large vision‑language models (LVLMs) on SatNav shows that city‑scale navigation remains challenging. We further introduce SwiftVLN, a modular framework with switchable memory components, and conduct systematic memory‑design ablations. Finally, satellite‑to‑UAV transfer experiments show that satellite‑trained navigation models can operate on real‑flight UAV observations, showing the practical relevance of SatNav. Our project page: https://eku127.github.io/SatNav/
Authors:Runbang Wang, Zining Liang, Yin Cao, Qiuqiang Kong
Abstract:
In daily life, people hear speech, footsteps, and music around them. We can often recognize these sounds and judge where they come from. Each sound source can be shown on a separate acoustic map, a rectangular image covering 360^\circ horizontally and 180^\circ vertically. The map shows the directions occupied by the source as a region and the sound energy within that region. A class label identifies the sound. Predicting these labeled acoustic maps from audio is called semantic acoustic imaging. Such maps could help robots perceive their surroundings and allow augmented reality displays to show sound regions and classes over the real world. Existing models can recognize sound classes and estimate a direction for each source. However, a direction alone does not describe the source region or its energy. Acoustic imaging must also distinguish sound sources in nearby directions, while the number of active sources and the regions they occupy can change over time. We therefore propose the Semantic Acoustic Imaging Detector (SAID), which predicts a separate labeled acoustic map for each active source from audio. First, we pretrain Audio2Sph, SAID's audio encoder, through sound energy estimation across directions without class labels. Then, we train the complete SAID model to predict source regions, energy, and classes together. We also develop a pipeline that generates simulated recordings for pretraining and supports fine‑tuning on real recordings. On the official DCASE2026 Task 3 Track A evaluation set, our submitted system ranks first with 0.1080 macro‑averaged mean average precision (Macro mAP) and 0.3962 Macro Pearson r. Demos and code are provided at https://github.com/IN03X/SAID.
Authors:Pavel Kireyev
Abstract:
LLMs increasingly act as purchasing agents, which makes the LLM, not the user, the one choosing among the options that satisfy a request; its preferences quietly fix what gets bought and what it costs. Hotel booking is a clean instance: a high‑volume choice settled on a few comparable attributes, where the pick reveals those preferences. We introduce PriceBench, a diagnostic benchmark that recovers an LLM's price, quality, and brand preferences from its booking choices with a logit choice model, applied to 28 LLMs from 8 providers on 3,600 hotel tasks from 179 real New York City properties. We find that capability is associated with how consistently an LLM chooses, not with what it chooses: more capable LLMs hold stronger, more consistent preferences, while weaker ones either lock onto one position, exploitable by whoever controls listing order, or choose almost indifferently. What those preferences favor varies sharply across providers and even within one family: price sensitivity spans more than an order of magnitude, and the price/quality trade‑off moves mean booked nightly price from \247 to \393 on identical tasks. What an agent buys must therefore be measured per LLM, not inferred, and we release the tasks, code, and all 28 response sets.
Authors:Siddhartha Shankar Das, Sai Karthik Navuluru, S M Ferdous, Ryan A. Rossi, Baris Coskunuzer, Lakshman Tamil, Edoardo Serra, Alex Pothen, Robert Rallo, Mahantesh M Halappanavar
Abstract:
Graph neural networks (GNNs) rely on message passing over graph edges, making their computational and memory costs strongly dependent on graph density. Graph sparsification offers a natural way to reduce these costs, but removing edges indiscriminately can distort important communication structure and degrade predictive performance. We introduce Scaffold, a topology‑based, unsupervised graph sparsification framework derived from support graph theory preconditioners. Scaffold explicitly controls two complementary structural quantities: dilation, which measures the length of rerouting paths induced by removed edges, and congestion, which measures how strongly these rerouted paths concentrate on the retained support. By jointly controlling dilation and congestion, Scaffold preserves short communication paths while avoiding structural bottlenecks. To our knowledge, Scaffold is the first scalable GNN sparsification framework to use a joint supporting‑path dilation‑congestion criterion. Across 19 homophilic and heterophilic benchmarks spanning small to large graphs, Scaffold achieves the best aggregate rank among the evaluated sparsification and related methods. Using only 10%‑50% of the original edges per sparse support, Scaffold recovers or closely approaches full‑graph GNN performance while using less than half the memory of full‑graph training and reducing end‑to‑end training time, including sparsification overhead. We provide an open‑source software package at https://github.com/siddhartha047/Scaffold.
Authors:Xingyu Miao, Zizun Li, Baole Fang, Kaiwen Song, Tenghui Wang, Hanxue Zhang, Yating Wang, Xudong Li, Yuping He, Xueyuan Wei, Chao Gao, Xijie Yang, Yingxiang Xu, Kerui Ren, Wenqi Guo, Jianjun Zhou, Xinzhe Wang, Weiguang Zhao, Ni Yang, Zetao Cai, Yufei Xue, Hengjie Li, Zeyu He, Yuanzhen Zhou, Rong Fu, Jianyang Zhang, Siwei Cui, Fuxian Huang, Yunsong Zhou, Xing Gao, Yifei Yao, Qiaojun Yu, Kailin Li, Ming Zhou, Mu Huang, Xinyue Li, Wenze Cui, Bingqi Jiang, Xueyue Zhu, Junting Dong, Haoyu Guo, Tao Lu, Mulin Yu, Bowen Zhou, Bin Zhao, Tianfan Xue, Weinan Zhang, Chunhua Shen
Abstract:
World Action Models (WAMs) jointly model visual dynamics and action generation for generalist robot manipulation. A central challenge is to integrate priors from large‑scale pretrained models‑‑‑including visual dynamics, scene semantics, geometry, and motion‑‑‑into a unified framework for robot action generation. We introduce InternW0‑Δ, a unified WAM pretrained on a heterogeneous corpus that outperforms prior methods across simulation benchmarks and real‑robot platforms. InternW0‑Δ combines pretrained visual dynamics, scene‑level semantics, 4D geometric and motion priors, and action generation within a Mixture‑of‑Transformers (MoT) framework. A pretrained video expert and an action expert interact under semantic guidance from a frozen VLM, while a pretrained 4D foundation model injects geometric and motion priors through training‑only distillation. We further introduce Causal Imprint, which learns future‑relevant scene changes from training‑only future supervision and provides predictive representations directly to the action expert without future‑video rollout at inference. For large‑scale joint training, we construct a heterogeneous corpus of robot demonstrations, UMI data, egocentric human demonstrations, and Ego2Robot data, curated and aligned under a common state‑action representation. The resulting corpus contains over 20K hours of processed training data, to our knowledge the largest open‑source corpus of its kind. We pretrain InternW0‑Δ on this corpus and demonstrate strong performance across simulation benchmarks and real‑robot platforms. We will open source the training code, model weights, infrastructure, data‑processing pipeline, and processed data where licenses permit. Project page: https://internrobotics.github.io/InternW0‑Delta/
Authors:Matteo Spanio, Andrea Poltronieri, Mart\'ın Rocamora
Abstract:
Human judgement is the reference measure for evaluating generative models, yet the software used to collect it lags behing the methodology. Researchers adapt listening‑test frameworks designed for perceptual protocols such as MUSHRA, rely on closed commercial survey platforms, or implement single‑use web applications. Live arenas such as Chatbot Arena and Music Arena rank publicly deployed systems at scale, but do not support controlled comparisons of a laboratory's own models with its own participants. We present PANEL, an open‑source, self‑hosted platform for such studies. A study is authored in the browser and distributed as a single link, with audio, video, image, and text stimuli, seven question types, and screening and skip logic. The platform reports per‑question summaries, across‑condition significance tests, pairwise win rates and Bradley‑‑Terry scores, and supports power analysis from pilot data. Consent versioning, self‑service withdrawal, retention enforcement, and audit logging support GDPR‑compliant operation. Each study exports as a machine‑readable specification. PANEL is available at https://github.com/matteospanio/panel.
Authors:Zhaoyuan Xia, Qinghongbing Xie, Yung Xiang Hue, Jianguang Jiang, Gaofeng Lu, Zhenyu Jiao, Xing Yuan, Dai Dai, Tong Mo, Long Zeng
Abstract:
Long‑context understanding requires large language models (LLMs) to reason over lengthy documents, conversations, and code, yet task‑relevant evidence is often sparse and scattered amid substantial irrelevant and redundant content. We propose Highlight‑Then‑Summarize (H2S), a compress‑then‑reason paradigm that first identifies source‑grounded, question‑relevant evidence and then integrates it into a compact, question‑conditioned summary before producing the final answer. To train this behavior, we construct H2S‑Dataset, comprising 6,647 examples from 11 benchmark families with an average context length of 43.9K tokens, and introduce H2S‑RL, which provides process‑level rewards for evidence selection and summary construction in addition to final‑answer correctness. We evaluate on H2S‑Bench, a seven‑task long‑context suite. Under a shared 128K input and 4K output budget, H2S‑14B achieves an average score of 32.60, outperforming Qwen3.8‑27B by 10.17 points and obtaining the strongest overall result among the evaluated open‑source models. H2S‑14B also achieves the highest Evidence‑Summary Quality score and retains 97.1% of its 16K‑budget performance with only a 4K output budget. These results show that explicitly selecting and integrating evidence improves long‑context reasoning while enabling more compact generation.
Authors:Guangzhe Zhang
Abstract:
Context projection replaces older tool observations with compact, addressable excerpts, reducing repeated input while potentially adding evidence‑retrieval turns. We study this trade‑off in ReVerPi, a Pi extension with archived observations and matched full/projected continuations. In an 86‑run source‑reading campaign with 641 model requests, the 15 completed pairs show identical success: 12/15 per arm. Twelve further boundary runs stop, with the runner suppressing the companion whenever the first arm fails to complete. Restoring all 27 boundary runs bounds projected‑minus‑full success between ‑9 and +1 tasks. One omitted, selector‑chosen projected continuation successfully retrieves archive text yet exhausts twelve requests; its full counterpart answers in three. The eleven jointly correct pairs form a fully observed success stratum within this recorded frame: projection reduces aggregate logical tokens by 25%, while increasing the median pair's tokens by 29% and total suffix requests from 35 to 55. Separating fitting from evaluation changes the selector's apparent tie: outside its four fitting pairs, it incurs one extra failure and 8.6% more logical tokens over thirteen comparable runs. This methodological case study connects stopping rules, known bounded failures, unexecuted companions, and resource aggregation. Its findings concern the recorded campaign, rather than population noninferiority or superiority over unrestricted Pi. Evaluations should retain every intervention boundary, execute both allocated arms independently of the first arm's completion, and report completion alongside interaction and token expenditure.
Authors:Zijun Zhao, Liewen Liao, Kang Shen, Songan Zhang, Ming Yang
Abstract:
Closed‑loop driving simulation requires rendered observations to remain reliable as the ego vehicle and surrounding actors move beyond their recorded trajectories, exposing views absent from the source log. Existing data‑driven simulators reconstruct dynamic actors from sparse observations, which can result in rendering artifacts under these viewpoint changes. We introduce RECAST (REconstructing Controllable Actors for Simulation and Testing), a 3D Gaussian Splatting framework that generates a view‑complete actor from a single segmented vehicle observation in a driving log and registers the generated actor in the reconstructed scene. RECAST supports planner‑in‑the‑loop rendering under controlled ego‑actor interactions. To adapt an image‑to‑3D prior to real vehicles, we further introduce RECAR, a dataset of approximately 20K real vehicles with 600K background‑free RGBA images spanning diverse vehicle colors and types. We use two‑stage adaptation to improve vehicle generation from real driving‑log observations. At the actor level, RECAST reduces \mathrmFD_\mathrmincep from 9.788 to 7.992 relative to unadapted TRELLIS. At the scene level, under actor motion beyond logged trajectories, RECAST reduces \mathrmFD_\mathrmincep from 129.35 to 112.10 and increases \mathrmCLIP_\mathrmmargin (×1000) from 0.14 to 3.47 relative to Street Gaussians. We demonstrate planner‑in‑the‑loop simulation with the image‑conditioned planner GTRS‑Dense. Compared with native Street Gaussians actors, RECAST increases the no‑collision (NC) rate from 22.2% (12/54) to 63.0% (34/54) and the mean minimum predicted time‑to‑collision (TTC) from 0.798 s to 2.150 s. These experiments show that RECAST supports closed‑loop planner evaluation under controlled ego‑actor interactions beyond log replay. Visit our project page at https://zijunkr.github.io/RECAST/
Authors:Justus Westerhoff, Stephan Olbrich, Hatem Oraby, Matthew Evan Larkum, Felix Alexander Gers
Abstract:
Inference in LLMs is conventionally a fixed‑depth, fixed‑order forward pass through every layer, regardless of how difficult the input is. The human brain does not work this way: using the thalamus as a central hub, it routes information flexibly to all regions of the cortex according to demand. Li et al. (2026) recently showed, with a system they call program‑of‑layers (PoLar), that transformers can be given an analogous flexibility if their layers are treated as a library of functions rather than a fixed sequence. Performance improves over the standard forward pass when each input is dynamically routed through an adaptive sequence of skipped or repeated contiguous layer blocks. We reconstructed PoLar's diagnostic MCTS in more detail than the original paper and applied it across 5 models. We reproduced several of PoLar's findings: skipping outperformed the standard pass, repeating outperformed skipping, and combining both outperformed either alone. Shorter programs sufficed for easier questions, while harder questions required more layer repeats. However, we failed to replicate the main claim regarding their learned router for single‑shot inference: its top‑ranked prediction consistently collapsed back to the standard pass, even though its top‑k predicted programs, taken together, did show a real accuracy gain. Beyond reproduction, we find that a small number of generic programs are enough to solve most of the questions. We also provide a much deeper analysis of these programs' structure and robustness: for example, we found that programs that correct errors are highly brittle: undoing even a single edit inside a program typically breaks the correction. Connecting this to the brain's routing mechanisms, PoLar mirrors principles of thalamo‑cortical coordination between cortical‑area‑like transformer layers. We publicly release the code at https://datexis.github.io/RE‑PoLar/
Authors:Bennet Gerlach, Stefan Fischer
Abstract:
The Model Context Protocol (MCP) provides a common interface through which AI applications discover and use external resources and tools. It allows language‑model agents to ground their reasoning in current system state and interact with heterogeneous services. In medical environments, however, exposing device state and action affordances requires deterministic constraints on possible effects. We present an IEEE 11073 Service‑Oriented Device Connectivity (SDC)‑to‑MCP gateway that exposes metrics, alarms, context references, and semantic metadata as read‑only resources, while representing selected action affordances as policy‑validated dry‑run tools. The term safety‑bounded denotes a narrow no‑execution property: agent‑facing requests dispatch no SDC device operation. A Python prototype supports simulated fault and lifecycle experiments, a software‑reference protocol path spanning independent Java and Python implementations, deterministic baselines, representation ablations, and multi‑model agent evaluation. The results show semantically explicit resource exposure, visible rejection of invalid or outdated state, and preservation of the no‑execution boundary across resource, proposal, and authorization paths. Explicit semantic metadata improved conformity to required metric identifiers in structured alarm outputs relative to a generic representation, while retained structured‑output failures reveal a distinction between plausible narrative answers and task‑compliant machine‑readable results.
Authors:Dan Barry, Andrew Hines
Abstract:
Contemporary large language model (LLM) chat systems treat conversation history as an immutable sequence of turns that defines the model's working context. However, user intent in real interactions is not static: it evolves through correction, refinement, and shifting constraints. This mismatch between dynamic intent and static transcripts can result in context pollution, where outdated or irrelevant information persists and continues to influence subsequent responses. We introduce mutable transcripts, a new interaction paradigm that enables users to revise prior turns through natural language edit requests, allowing the conversation history itself to be updated rather than appended. This reframes the transcript from a passive record into an editable representation of conversational state. We present a working prototype that integrates transcript‑level revision into a standard chat interface and evaluate its feasibility through a controlled user study (n=17) and an illustrative transcript analysis of representative interaction scenarios. Participants significantly preferred mutable transcripts over standard chat across measures of clarity, confidence, and ease of use, with reduced intent to restart conversations. Transcript analysis of representative user study conversations shows that mutable transcripts can reduce conversation length and eliminate obsolete retained context. These findings provide initial evidence that user‑driven revision of conversational history can improve interaction quality and help maintain a more current representation of user intent. The source code and prototype can be accessed at https://github.com/QxLabIreland/ReChat
Authors:Lewei Xie, Haoyu Zhang, Jiajun Zhou, Yulong Chen, Guanxing Chen, Yu-An Huang, Hau-San Wong, Yifan Zhang, Zhi-An Huang
Abstract:
Continual spatio‑temporal forecasting supports traffic management and environmental monitoring under evolving dynamics and expanding sensor networks. However, conventional graph‑based continual learning methods tie forecasting representations to the current sensor layout, so sensor expansion can alter the representation of learned spatial relationships. Our key insight is that sensor expansion changes the evidence available about a process without necessarily changing the dynamics to be learned. We propose STFO (Spatio‑Temporal Field Operator), which parameterizes forecasting knowledge as a shared field‑evolution operator and handles changing sensor layouts through observation and query interfaces. Normalized coordinate‑based aggregation lifts irregular sensor histories onto a fixed latent grid, enabling reuse of learned spatial maps across observation sets without sensor‑specific parameters. To accommodate process drift, a spectral descriptor summarizes variation across spatial scales and conditions Fourier propagation and attention to adapt operator responses to the current spatial regime. Coordinate‑based decoding queries the evolved field at sensor locations and combines spatial corrections with local‑history predictions. Experiments on PEMS‑Stream, CA‑Stream, and AIR‑Stream demonstrate state‑of‑the‑art average forecasting performance. STFO‑Large reduces average MAE over DOL by 8.4% on PEMS‑Stream and 4.7% on CA‑Stream. Our code is available at https://github.com/Xielewei/Spatio‑Temporal‑Field‑Operator.
Authors:Mohammad Fesanghary
Abstract:
Unobserved common causes are pervasive in real‑world time series and can induce spurious associations that causal discovery methods mistake for direct edges. We propose LUCID (Learning Under Confounding for Inference and Discovery, a regime‑adaptive deconfounding layer that first estimates the confounding regime from data using a Marčenko‑‑Pastur spectral router, then applies a deconfounding strategy matched to that regime. When the spectrum indicates pervasive factor confounding, LUCID attenuates factor‑dominated variation and recovers contemporaneous (lag‑0) structure from the resulting innovations, with edge selection calibrated against a data‑driven edge‑free null. Rather than being tied to a particular discovery algorithm, it can wrap existing discovery engines; we demonstrate consistent improvements across three such methods. On a diverse synthetic out‑of‑distribution benchmark spanning changes in confounder strength and sparsity, loading density, lag structure, volatility dynamics, edge heterogeneity, persistence, intermittency, and tail behavior, LUCID achieves the best family‑weighted directed, lag‑resolved graph F_1 (0.60), improving over the strongest baseline by 0.19 absolute (\approx\!46% relative). Its advantage widens relative to looser lag‑collapsed scoring, and remains robust under intermittent and heavy‑tailed confounding. Code reproducing the method, the benchmark generators, and every reported experiment is available at https://github.com/bloomberg/causal‑ts.
Authors:Mahesh Reddy Pagadala
Abstract:
We report fine‑grained, deterministic instability in Dynamic Tensor Rematerialization (DTR), an online eviction policy for memory‑constrained DNN training, measured on the reference DTR simulator (simrd) using public execution traces. On an LSTM trace, memory budgets differing by 0.10% of unconstrained peak memory select fast and slow execution regimes whose overheads differ by as much as 7.3x; the slow regime is driven by broadly repeated re‑eviction of the same storages (evictions per storage rise from 1.33 to 8.27 while the set of distinct evicted storages is essentially unchanged: 5,233 vs 5,236, with the two sets overlapping at Jaccard 0.999). On a ResNet‑32 trace, a fine budget sweep reveals a deterministic feasibility inversion: the run is feasible at ratio 0.101, infeasible (OOM) across 0.102‑0.106, and feasible again from 0.107. We trace the immediate cause of the OOM to a fully pinned recursive rematerialization frontier that exceeds the budget after every evictable tensor has been evicted. Ablations using the DTR authors' own variants implicate the joint size‑staleness scoring term in the observed LSTM instability. We argue these are at least two distinct budget‑sensitive pathologies rather than one mechanism, and we separate what is demonstrated from what remains hypothesised. All results concern the reference simulator; reproduction in a production runtime is future work. Code, instrumentation, and raw results accompany this preprint.
Authors:Xander Staelens, Albéric Loos, Bert Ramlot, Hannes Mareen, Peter Lambert, Glenn Van Wallendael
Abstract:
Novel view synthesis (NVS) models can produce realistic new views of the same scene from different viewpoints. However, these generated views are not always geometrically consistent with one another. Multi‑view (MV) consistency has shown promise as a tool for evaluating these NVS models. Its potential for multimedia forensics, however, remains largely unexplored, particularly for localizing geometric inconsistencies across wide‑baseline image pairs. To enable research in this direction, we introduce DeformView, a wide‑baseline MV dataset with pixel‑level annotations of geometric inconsistencies. Using DeformView, we evaluate state‑of‑the‑art MV consistency‑scoring methods and show that approaches developed for NVS evaluation transfer poorly to the forensic task of geometric inconsistency localization. To address this limitation, we propose DEFECt3R, a lightweight learning‑based classifier that uses cross‑view feature relationships to localize geometric inconsistencies at the pixel level. By learning from explicit supervision, including hard negatives from geometrically consistent yet deformed views, DEFECt3R improves localization performance and substantially reduces false positives compared to existing consistency‑scoring methods. Ablation experiments further show that both feature representations and correspondence quality contribute to localization performance. Overall, our findings demonstrate that MV geometric consistency is a promising yet underexplored signal for multimedia forensics and establish a benchmark and baseline for geometric inconsistency localization in wide‑baseline MV image pairs. Code and dataset are available at https://github.com/IDLabMedia/DeformView‑DEFECt3R
Authors:Mo Wang, Wenhao Ye, Zihan Ning, Jiayu Zuo, Junfeng Xia, Hongkai Wen, Quanying Liu
Abstract:
Recent fMRI foundation models differ substantially in the spatial scale at which they represent brain activity. ROI‑ and connectivity‑based models are efficient but coarse, whereas voxel‑level models preserve fine‑grained spatial structure but require specialized 3D/4D architectures and costly fMRI‑specific pretraining. We ask how effectively an image‑pretrained encoder can reuse the spatial organization of cortical activity. Motivated by evidence that macroscale brain activity is strongly constrained by brain geometry, we introduce FlatClip, a frozen‑encoder surface‑level baseline that renders cortical activity as geometry‑aware flatmap sequences and reuses a frozen SigLIP2 image encoder with only a lightweight downstream probe. Across resting‑state benchmarks, FlatClip serves as a competitive middle‑ground representation, outperforming ROI‑level baselines on HCP and ADNI tasks while remaining weaker on PPMI and below the strongest voxel‑level models overall. On visual‑fMRI decoding, restricting the input to visual or NSD‑provided task‑active cortex improves performance, highlighting the value of task‑relevant cortical coverage. Spatial perturbation controls reduce the predictive performance of flatmap features under both retrained and fixed readouts, and anatomy‑linked arrangements consistently outperform vertex permutations across three colormaps. Together, these results position surface‑level flatmap sequences as a practical middle‑ground baseline between ROI and voxel models, and support the utility of anatomy‑linked spatial organization for reusing image‑pretrained features. Code is available at https://github.com/OneMore1/FlatClip.
Authors:Sehyun Kwon
Abstract:
Composed image retrieval (CIR) aims to retrieve images that satisfy a user‑specified modification while preserving relevant visual content from a reference image. Collecting target images for this purpose is costly, motivating zero‑shot CIR methods that instead use target captions as supervision. However, target captions may omit source details that should be preserved. We therefore propose, Preserve‑and‑Compose Training, which complements target‑caption supervision with visual evidence from the source image. PACT learns from image‑‑text‑‑text (ITT) triplets without target images or gallery updates, aligning composed queries with target captions while preserving source evidence through visual supervision. We further introduce Chord scoring, which combines target similarity with source‑relative directional agreement in the frozen image space. Results across four ZS‑CIR benchmarks show that combining target‑caption supervision with source‑image evidence leads to strong retrieval performance across datasets, backbone scales, and external galleries. The code is available on https://github.com/sehyunkwon/PACT.
Authors:Shikha Surana, Alex Hawkins-Hooker, Olivia Gallup, Christoph Brunken, Jules Tilly, Paul Duckworth
Abstract:
Machine learning for scientific discovery is almost systematically data bound. Producing relevant high quality data, under budget constraints, is amongst the most promising ways to advance the field. Active learning (AL) offers promise wherever labelling requires expensive experiment, measurement, or simulation. Most existing tools cover only part of the data acquisition loop, and typically focus on either offline benchmarking or online deployment, but not both. We present ALF, a modular AL Framework that runs the full data acquisition loop via five modular components. One clear API for both settings: offline, against an existing dataset for controlled and reproducible experimentation; and online, against an oracle for acquiring new candidates in real‑world deployments. ALF is open‑source and available at https://github.com/instadeepai/alf.
Authors:Chang Gong, Jingping Bi, Di Yao, Xinjian Liang, Chao Xiang, Ruijie Guo
Abstract:
Artificial intelligence is advancing rapidly, with increasingly capable systems taking larger roles in reasoning, decision‑making, scientific discovery, and autonomous development. As AI begins to participate in its own improvement, from model training and experience accumulation to agent evolution and automated AI development, the prospect of recursive self‑improvement (RSI) is becoming increasingly relevant. This transition raises a fundamental safety question: how can safety be maintained when the system, its accumulated experience, and even the process producing its successors continue to change? We introduce Evolutionary Safety as a perspective for studying safety under persistent and recursive self‑improvement. It concerns not only whether an AI system is safe at a particular moment, but how safety properties change, persist, accumulate, and propagate throughout evolution. We characterize recurring manifestations, including intent drift, error accumulation, experience contamination, safety‑property erosion, evaluator drift, and risk propagation. We then develop a taxonomy spanning persistent agent state, model state, evaluation and environmental feedback, computational substrate, and meta‑level update mechanisms. Building on this taxonomy, we examine how evolutionary risks can be discovered and evaluated across states, updates, trajectories, and lineages, and derive governance principles for modification, selection, authorization, provenance, and recovery. Finally, we outline open problems toward maintaining safety guarantees as AI systems become increasingly persistent, adaptive, and recursively self‑improving. Project resources and proposed evaluation systems are available at https://chaunceykung.github.io/evolutionary‑safety‑rsi.
Authors:Nicolás Vera Zúñiga
Abstract:
Black‑box model identification works by scoring a model's response to natural‑language prompts. One line of work feeds models a degenerate input ‑‑ their own token, repeated ‑‑ to find a failure mode rather than an identity. We take that input and ask where the model goes when it does not. For each token t, read argmax p(. | t, t) in one forward pass; the result is a map on the whole vocabulary, with two halves. The first ‑‑ which tokens are fixed points ‑‑ is partially anticipated, and we report it as a failed estimand: the natural distance on it is 83% cardinality, separates a corpus manipulation by two bits in 3471 against a precision floor of zero, and attributes families at 0.5833. The second half, where the map sends tokens that are not fixed points, is unrecorded; the one paper holding those tokens logged them as a zero. Pairing on the source token removes the cardinality confound by construction (r from 0.9128 to ‑0.0932) and attributes families at 0.8333 ‑‑ twelve models scored against a pool of nineteen ‑‑ with chance 0.1389, across seven tokenizer groups and several corpora. Two nulls clear it: frequency‑matched destinations agree at 0.1429, independent marginals at 0.0798. Family predicts agreement better than tokenizer (0.2031 against 0.1205), and recurrent architectures cluster at balanced accuracy 1.0 against a 0.7895 majority rate, or 0.90 once each model's dominant destination is excluded ‑‑ the figure we stand behind. We measure the robustness envelope: 8‑bit weight rounding moves the map less than deduplicating the training corpus does (0.9004 against 0.6353, on one support), 4‑bit destroys it (0.0098; 0.1812 at deployment granularity, so not a coarseness artefact), and the precision floor varies by model from 0.201 to 0.9778. All estimands and kill conditions were registered before the data, and the failed one is reported as fully as the surviving one.
Authors:Hakan Akgün, Xianquan Yan, Kehan Liu, Zhaoyun Chen, Ching Hua Lee
Abstract:
Scientific data span heterogeneous structures, including coordinates, networks, surfaces, volumes and fields, yet their topology can be quantified within a common framework through graph connectivity, cycle structure, genus and spatial embedding. Graph‑ and homology‑based summaries do not determine spatial embedding, while standard knot and link polynomials require extensions to accommodate branching graphs. Here, we introduce KnottedGraph, a computational framework that converts such scientific representations to knotted graphs that retain graph connectivity and spatial embedding together. It constructs projected diagrams and PD codes, enabling various topological analyses, including Yamada‑polynomial evaluation for topological classification. For scalable exact evaluation, it combines partial resolutions that leave the same unresolved connections and optimizes their processing order; the resulting algorithm is verified against published topological invariants of knotted graphs with up to 500 crossings. This scalability enables us to introduce an LLM‑assisted mathematical‑discovery methodology, in which computational topological data generated across knotted‑graph families are used to identify candidate closed‑form formulas. With this approach, we identify analytical Yamada‑polynomials for generic graph motif families exhibiting Abelian and non‑Abelian word sequences. Together, these scalable capabilities make knotted‑graph topology computationally accessible across scientific domains, enabling large‑scale classification and introducing a route from topological data to LLM‑assisted AI4Math discovery.
Authors:Jianyi Hu, Hangtao Zhang, Yi Liu, Yeqi Zeng, Li Zeng, Xianlong Wang, Rui Wang, Leo Yu Zhang
Abstract:
Models trained with reinforcement learning for calibrated decisions (RLCD), such as Jev, answer a typed question about an input, the state, with a probability, a choice, or a score, and software acts on the answer without a person reading it. Their robustness has not been measured: adversarial benchmarks score what a model generates or executes, whereas a typed model generates nothing and returns a well‑formed answer even when manipulated. Measurement is also hard, because identical requests can return different answers, most available labels come from the model itself, and the API preprocesses each request out of view. Our key idea is to score each attacked decision against the model's own clean decision rather than against labels, and to read it against the change caused by an identical re‑run. Building on this, we introduce JevAdvBench, to our knowledge the first adversarial benchmark for RLCD models, with 812 typed questions over 66 scenarios, and a black‑box attack suite of 9,744 single‑edit variants that each edit one part of a request, with billed input tokens confirming that the edit reached the model. On jev‑1.13.0, rewording stays within 1.2 percentage points of the re‑run baseline, and fields outside the schema never reach the model. In contrast, one unverified opinion appended to the state flips 12.1% of decisions, statistically tied with the strongest injected command (10.1%), and pushes 38% of confident answers below the 0.8 confidence threshold that routes them to human review. Applications built on RLCD models should therefore treat the state as untrusted, argued input. Project website: https://JevAdvBench.github.io/JevAdvBench/
Authors:Mahmoud Abbasi
Abstract:
Knowledge distillation is the standard way to compress encrypted‑traffic classifiers for the edge, and almost all such work judges students by accuracy alone. We ask what else a student inherits: unknown‑traffic detection, calibration, shortcut reliance, and whether any survives a year of drift. Resemblance proves little on its own, since soft targets also regularise. We therefore distil one 101k‑parameter student from two teachers of equal accuracy but different construction, a five‑member ensemble and a single wider model, so that following one rather than the other is attributable to it. The design was pre‑registered before any test result was seen. We tested ten hypotheses on CESNET‑TLS‑Year22, a year of real TLS traffic, across 18 test windows over 35 weeks. Two are supported: a student's per‑flow unknown‑scores shift toward its own teacher, but only at a conventional temperature, not the accuracy‑optimal one; and a shortcut‑reliant teacher passes its over‑confidence to a student that never sees the feature. The drift prediction is reversed under both scores, the gap narrowing rather than widening and the student overtaking under the energy score in two of three replicates, as is the prediction that such a teacher harms its student's detection, which improves slightly. Shortcut reliance is set by model size, not distillation. Under the logit‑based scores nothing else transfers: distillation beats neither a temperature‑scaled direct student nor label smoothing. Exploratory analysis shows this turns on the scoring rule: with a feature‑space detector the teacher detects unknown traffic 0.073 AUROC better than the direct student, where the energy score sees 0.000, and the conventional‑temperature student inherits most of it. Label smoothing, with no teacher, recovers more. Distillation transfers the teacher's habits; what looks like an inherited ability is available without one.
Authors:Carl Tornberg, Alicia Torck, Lotfi El Hafi, Tadahiro Taniguchi
Abstract:
As populations in developed countries age and labor shortages intensify, Cybernetic Avatars (CAs) are proposed to extend human capabilities through robotic embodiments, requiring effective Human‑Robot Interaction (HRI) frameworks. Extended Reality (XR), an umbrella term for Augmented Reality (AR), Augmented Virtuality (AV), and Virtual Reality (VR), offers such interfaces, but prior research typically fixes the XR modality without evaluating its effect on task outcomes. This study examines whether the XR modality impacts HRI performance and whether an adaptive interface adjusting the level of virtuality along the Reality‑Virtuality Continuum (RVC) at runtime improves it. A custom XR application interfaced with a mobile manipulator supports immersive control and runtime modality switching. In a within‑participant multi‑room pick‑and‑place experiment comparing fixed AR, AV, and VR with dynamic RVC through task metrics, the NASA‑TLX, and the System Usability Scale (SUS), this study demonstrates that 1) the fixed reality modality affects HRI results, and 2) dynamically changing the modality along the RVC improves them. AR yielded significantly lower mental demand, effort, and frustration than AV and VR, while the dynamic RVC condition achieved the highest throughput and lowest workload, highlighting the value of adaptive XR interfaces for human‑robot symbiosis. The implementation is available at https://github.com/CarlTornberg/XR‑HRI.
Authors:Julian Schulz
Abstract:
Chain‑of‑thought (CoT) monitoring is a promising safety technique for reasoning models, enabling detection of problematic reasoning before models act. A key concern is encoded reasoning, where models hide their true reasoning in ways that monitors and humans cannot interpret. Optimization pressure from CoT monitors during reinforcement learning is considered a likely driver of such behavior. We investigate this by training reasoning models to perform a main task and a side task, while penalizing them when a monitor detects reasoning about the side task. Surprisingly, models learn to evade monitors without encoding their reasoning. Instead, they learn to phrase and format their chains of thought such that monitors fail to flag side task reasoning, while the reasoning remains completely transparent to human readers. We call this phenomenon monitor jailbreaking. We find that monitor jailbreaking arises across different model sizes, monitors, and tasks. Jailbreaks generalize to monitors not seen during training, including both less and more capable monitors, and transfer across different monitor prompts. While jailbreaking strategies appear simple, manually replicating them does not reliably fool monitors. Finally, we show that paraphrasing is an effective defense: paraphrasing a jailbroken CoT allows the same monitor to correctly flag it, while still allowing the model to perform both tasks.
Authors:Chengxi Li, Yan Di, Yingyue Li, Ruida Zhang, Mingyang Li, Xiangyang Ji
Abstract:
Vision‑language models (VLMs) enable open‑vocabulary reasoning for robot manipulation, but their high inference latency limits responsiveness in dynamic scenes. Many scene changes, however, alter object geometry without invalidating task intent. We present DualManip, a dual‑path framework that decouples infrequent semantic reasoning from responsive geometric adaptation. The semantic path decomposes the task and grounds task‑relevant interactions, followed by a constraint‑solving module for pose optimization. During execution, the geometric path continuously updates template‑to‑observation correspondences from live RGB‑D observations via a shape‑adaptive network. These correspondences transfer task‑relevant grasp contacts across observations, enabling online grasp reconstruction under object motion and non‑rigid deformation. The Information Interaction Module bridges the two paths by initializing task‑relevant grasps from semantic grounding, validating geometric updates, and triggering semantic replanning upon update failures. Real‑world evaluation spans six manipulation tasks covering non‑rigid deformation, articulated reconfiguration, rigid motion, and high‑precision assembly across three settings: static, single‑change, and continuous dynamic. DualManip demonstrates superior manipulation robustness, particularly under continuous scene changes, while achieving geometric adaptation approximately 46× faster than agentic verification and semantic replanning. Our project page: https://lichengxi1.github.io/Dualmanip.
Authors:Emilia Arens, Nina van Tiel, Robin Zbinden, Damien Robert, Lukas Drees, Chiara Vanalli, Benjamin Kellenberger, Niklaus E. Zimmermann, Loïc Pellissier, Devis Tuia, Jan Dirk Wegner
Abstract:
Knowing where species occur is fundamental for biodiversity research and conservation. Species distribution models (SDMs) link species observations to environmental conditions to estimate their spatial distribution. However, accuracy varies with the underlying data and models, making it essential to know for which species models can be trusted. Deep‑learning‑based SDMs ("DeepSDMs") now jointly model thousands of species, drawing on hundreds of millions of community‑science records. At this scale, averaging performance hides substantial species‑level variability, particularly for rare species, often of greatest conservation concern. Records are also strongly biased, making occurrence counts misleading. Accounting for these factors is essential for a reliable and informative evaluation of multi‑species SDMs. Here, we introduce a Sampling‑Aware Global Evaluation (SAGE) benchmark, combining GBIF records for training with sPlotOpen vegetation plots for presence‑absence evaluation across 5771 plant species. We propose an evaluation framework that groups species based on two properties, sampling effort and relative prevalence, which describe how densely a species' range is sampled and how frequently the species is recorded. Evaluating single‑species SDMs and multi‑species DeepSDMs, we find that Random Forests and DeepSDMs perform best overall, but neither dominates: DeepSDMs outperform single‑species SDMs for infrequently recorded species while offering no consistent advantage for well‑sampled ones. Crucially, this advantage emerges only when established bias‑correction practices, such as spatial thinning and reweighting, are carried over to the deep‑learning setting. SAGE helps identify the species and data conditions for which a given approach is beneficial, thereby supporting the development of more transparent and ecologically credible SDMs. Data and code: https://earens.github.io/sage/
Authors:Marko Řeháček, Vítězslav Dušek, Martin Rusinko, Vít Nováček
Abstract:
Patient‑facing AI assistants promise valuable support to patients, but incoming queries can pose medical risks. To create guardrails, we work with oncologists to define three ordinal risk axes: Medical Urgency, Psychological Urgency, and Topic Sensitivity. We propose Clinical Guardrail Probes (CG‑Probes) to measure the risks from query embeddings. We probe for each axis in the normalized embedding space of frozen embedders via the difference‑in‑means method, treating each axis as a potential linear direction. To train the probes, we cluster 79,658 Czech oncology search queries with BERTopic and use these clusters to generate pairs of queries with contrastive risk levels via few‑shot prompting. We evaluate the approach on 200 queries (90 real, 110 synthetic), each graded by two oncologists, against two open‑weight LLMs and a frontier LLM. We find that urgency‑based axes are recoverable as linear directions, and the probes are competitive with open‑weight LLMs (no significant differences in quadratic‑weighted kappa) at a fraction of the latency. Each axis yields a scalar score that clinicians can inspect and use to set escalation thresholds. The pipeline requires only search logs, axis definitions, and black‑box access to the embedding model, suggesting transferability across healthcare domains. Robust validation on new queries and axes remains future work.
Authors:Tianyue Chu, Filippo Vannella, Dimitra Tsigkari, Paula Delgado-Santos, Fernando López, Pablo Gomez Guerrero, Sotirios Spantideas, David Solans Noguero
Abstract:
Application developers of distributed learning services face challenges that a typical federated learning loop does not address. Specifically, the model updates can still leak private data, devices might not be able to participate in the training due to limited resources, a single aggregator might not be able to scale, and the transmissions of model weights induce a considerable bandwidth cost. This paper demonstrates DLaaS (Distributed Learning as a Service) from the developer's vantage point. Using a single admin dashboard, the developer initiates a distributed/federated learning job and is able to activate Differential Privacy (DP), Split Learning (SL), Hierarchical Aggregation (HA), and Knowledge Distillation (KD) as declarative options, with no change to the clients' code. We demonstrate the complete service lifecycle on an industrial smart‑home Wake‑up Word (WuW) task, using the "Ok Aura" dataset. Once the developer initiates a distributed learning job by toggling DP, SL, HA, and KD in the admin dashboard, the system dispatches the job to a set of Android clients and Dockerized helper aggregators. In the demonstration, these mechanisms run live across configurations. Then, the clients train the model locally and return their updates. The trained model is served to a consumer‑side Android application that performs on‑device WuW detection on a live microphone stream. In particular, the conference attendees will be invited to speak the trigger phrase and monitor in real time the per‑class confidence and inference latency. Finally, we release the source code and short video walkthroughs of these configurations.
Authors:Ruikang Liu, Haoli Bai, Yuxuan Sun, Qian Zhang, Wenzheng Cai, Yanqi Hao, Feiyu Wang, Weidong Zhong, Zhuang Wang, Tong Yang, Xiangsheng Zhou
Abstract:
Post‑training quantization (PTQ) is a practical approach to reducing the memory and computational footprint of large language models (LLMs) without retraining. GPTQ‑based methods have become the de facto standard, yet they suffer from two complementary limitations. Methods with local, layer‑wise objectives lack global supervision; while methods with global objectives fix their Hessian estimates at the start and ignore first‑order gradients, so their guidance grows stale as quantization proceeds. This paper presents G^2PTQ, a unified PTQ framework with Generalized Gradient Compensation that integrates both first‑ and second‑order information under a globally supervised, block‑wise optimization objective. By refreshing gradient and Hessian estimates before quantizing each Transformer block, G^2PTQ avoids the staleness of prior global methods. Furthermore, to stabilize the exact first‑order compensation, we introduce a trust‑region scaling mechanism that dynamically bounds the gradient step to prevent exploding weight updates. Finally, we derive efficient implementations for block‑wise Hessian approximation and exact gradient compensation. Experimental results on various model families and bit‑widths demonstrate that G^2PTQ enables better alignment with the full‑precision model, outperforming state‑of‑the‑art baselines. Code is available at: https://github.com/G2PTQ/G2PTQ.
Authors:Siqiao Xue, Shuxuan Liu, Ning Hu
Abstract:
Open rerankers trained for general web retrieval transfer imperfectly to e‑commerce, where ranking decisions depend not only on topical relevance but also on user preferences, product constraints, and comparative product fit. These preference signals are difficult to supervise at scale: real search traffic provides authentic queries and candidates but no clean pairwise labels. We present ZooWork‑ShopRanker, a family of e‑commerce rerankers (0.6B, 4B, and 8B) aligned to judge‑labeled shopping preference. Training pairs are labeled by a panel of reasoning large language models (LLMs) from different families acting as a preference oracle, with position‑debiased judgments and agreement tiers, and the rerankers are trained on these labels. The aligned 8B flagship then serves as a distillation teacher for the efficient 4B and 0.6B models, which are fit to its scores and sharpened on judged pairs. To measure progress, we introduce ShopRank‑Bench, a contamination‑limited benchmark of ~10,000 private‑traffic preference pairs in both text formats, tiered by how many judge families committed to each label. ZooWork‑ShopRanker‑8B and ‑4B significantly outperform the strongest open reranker baseline, every model significantly beats its own un‑aligned base, and ZooWork‑ShopRanker‑0.6B beats its size peer; the gains hold in both formats and extend to common MTEB benchmarks. We release the models and the dual‑format ShopRank‑Bench to facilitate further research.
Authors:Geraldo F. Oliveira, Ataberk Olgun, Ismail Emir Yüksel, F. Nisa Bostancı, Pedro H. E. Becker, Mohammad Sadrosadati, Saugata Ghose, Juan Gómez-Luna, Onur Mutlu
Abstract:
Processing‑using‑DRAM (PUD) architectures exploit the analog operational properties of DRAM to perform bulk bitwise Boolean and arithmetic operations inside memory arrays by organizing data in a vertical layout, where operand bits are stacked along DRAM columns. However, modern computing systems natively employ a horizontal data layout that preserves the cache line abstraction, leverages spatial locality in row buffers, and enables high memory throughput. This fundamental mismatch forces existing PUD architectures to frequently perform data layout transformations between horizontal and vertical formats, incurring significant performance, energy, and system integration overheads. Our goal is to eliminate data transposition overheads in PUD systems at low cost. To this end, we propose PipeDRAM, a PUD architecture that eliminates the need for runtime data layout transformation, enabling PUD operations directly over horizontally laid‑out data. PipeDRAM's key ideas are to (i) deterministically reorganize bits inside each memory request to enable a PUD‑friendly data placement within a DRAM array in a horizontal data layout, and (ii) employ a pipeline‑based execution model that overlaps bit‑dependent and bit‑independent in‑DRAM operations to exploit bit‑level parallelism across the memory array. We compare PipeDRAM to different computing platforms. PipeDRAM provides (i) 11.8x, 11.8x, and 80.4x higher performance and (ii) 25.4x, 3.0x, and 38.0x lower energy consumption than three state‑of‑the‑art PUD systems. PipeDRAM incurs low area cost on top of a DRAM chip (1.86%) and CPU die (0.05%). To enable further research on PUD systems, we open‑source PipeDRAM at https://github.com/CMU‑SAFARI/PipeDRAM.
Authors:Kai Yao
Abstract:
Passive image provenance asks whether pixels alone can reveal where an image came from: a human, an aggregate AI class, or a particular generator. This becomes a robustness problem once a source image can be edited before the verifier sees it. We study the problem as source‑‑target verification under adversarial distribution shift. Our first result gives the exact best‑case limit for any image‑only verifier: the largest robust target‑acceptance gap equals the minimum total‑variation distance between the target distribution and the set of attacked source distributions. This quantity depends on the source, target, and edit class, not on the verifier architecture. Our second result explains why deployed public verifiers can fail before this statistical limit is reached. If the verifier can be emulated on the attack region to error \varepsilon, then a surrogate black‑box attack reaches target acceptance within 2\varepsilon plus optimization error of the white‑box optimum; score‑revealing logistic and softmax heads over public features are identifiable, and approximate score access gives stable recovery bounds. A finite‑state experiment checks the minimax identity where both sides are computable. On same‑prompt real/diffusion benchmarks, the evaluated public CLIP verifiers fail under targeted pixel attacks, while a ResNet‑18 victim exhibits partial fake‑to‑real transfer. Binary feedback with abstention reduces measured attack success, but positive empirical gap upper bounds do not establish robustness. These results motivate separate evaluation of the source‑‑target statistical ceiling and the information released by a deployed verifier.
Authors:Kai Yao, Marc Juarez
Abstract:
Modern AI image generators are increasingly deployed as opaque APIs, where customers can query the deployed service, but cannot inspect model weights or architecture. This creates a practical challenge: a provider may pass governance certification with one generator and later silently switch to a cheaper and lower‑quality one for deployment, compromising public trust or even safety in high‑stakes domains. We study integrity auditing at deployment time and propose FARE (Forensic Acceptance Region Estimation). A certified generator is enrolled by training FARE on images sampled from that generator. After deployment, FARE can determine whether a generated image is consistent with the enrolled generator‑‑‑using only that image. FARE's features are based on image generator‑specific artifacts that have been proposed for forensic applications. FARE amplifies these features during training by finding hard samples that tighten the acceptance region and increase sensitivity to subtle changes in the certified generator. Across generator swaps, including substitutions with similar model versions and model variants, FARE is effective at detecting swaps, consistently outperforming existing baselines at strict operating points, and remains effective under the exact‑model and decision‑only attacks evaluated in this work.
Authors:Siru Zhong, Shenghan Tan, Rihong Yan, Xiaohui Lv, Yuzheng Zhuang, Shuai Tao, Wulong Liu, Haohuan Fu, Yuxuan Liang
Abstract:
Reliable online video question answering requires tracking state transitions while selectively abstaining when visual evidence is insufficient. Existing benchmarks focus on static recognition or long‑range retrieval, rarely evaluating these coupled capabilities under evolving and incomplete evidence. We present STORM‑Bench, comprising 5,736 questions across 630 compact, change‑dense episodes spanning five egocentric domains (STORM‑Real) and two controlled simulation subsets (STORM‑Sim) at 1 FPS. Questions are stratified by a proxy for accumulated change intensity (Low, Medium, High) and query‑time answerability (Known, Uncertain). To measure reliability, we introduce STORM‑BR, a harmonic metric over joint answer‑status correctness that exposes abstention failures masked by aggregate accuracy, alongside STORM‑BR‑ATTR for uncertainty attribution. Across 14 video LLMs, online accuracy peaks at 60.3% (mean 51.7%), whereas STORM‑BR ranges from 5.7% to 35.6% (mean 18.8%), driven by pervasive overconfidence on uncertain queries. STORM‑Bench shows that task accuracy masks these gaps in epistemic reliability and state tracking. Benchmark and code are available at https://github.com/siruzhong/STORM‑Bench.
Authors:Linyuan Gao, Yuan Wu, Yi Chang
Abstract:
Vision‑language models (VLMs) have demonstrated excellent performance in visual tasks, but their visual causal reasoning capabilities still lack reliable evaluation. Existing evaluations struggle to distinguish whether a model is performing causal reasoning based on visual evidence or relying on statistical correlations for shortcut learning, thereby potentially overestimating their actual capabilities. This paper proposes CCRV‑Bench, a constraint‑driven visual causal reasoning benchmark for single‑image physical scenarios. We construct an orthogonal framework that evaluates four causal task dimensions: causal relation discovery, state prediction, causal diagnosis, and intervention. We further introduce entity symbolization, spatial grounding, the factual adversarial constraint, and minimalist output constraints to reduce shortcut cues while preserving the physical commonsense required by the task. Experiments across 15 multimodal models show that constraint sensitivity is task‑ and model‑dependent: intervention has the largest average effective degradation among the four causal tasks, spatial grounding is the most damaging constraint on average, and the factual adversarial constraint improves DCR for all evaluated models. These results show that unconstrained performance does not determine constrained robustness and that a single aggregate score can obscure distinct failures in causal identification, spatial grounding, and constraint‑compliant expression. CCRV‑Bench provides a standardized framework for diagnosing image‑grounded causal reasoning under controlled constraints. The code is available at https://github.com/0815linyuan/CCRV‑Bench‑Constraint‑Based‑Evaluation‑of‑Causal‑Reasoning‑in‑Vision‑Language‑Models
Authors:Maokai Qin, Chuan Qin, Qi Zhang, Dianyu Liu, Zirui Liu, Hongting Niu, Yuanchun Zhou, Hengshu Zhu
Abstract:
Embodied agents offer a promising route to automating scientific experimentation, yet their progress is constrained by the lack of reliable and systematic evaluation environments. Existing simulation‑based laboratory benchmarks rely heavily on manual task engineering, making it challenging to systematically compile diverse scientific protocols into executable and verifiable embodied tasks at scale. To address this challenge, we introduce SciHorizon‑eLab, an agentic protocol‑to‑task compiler that formulates scientific embodied task construction as a compilation problem. Given a natural‑language protocol of scientific experiments, SciHorizon‑eLab progressively compiles laboratory protocols into semantic‑preserving embodied tasks through semantic grounding, executable task synthesis, and multi‑stage simulation‑based certification. The system generates semantically grounded environments, executable manipulation programs, and step‑level success specifications, while enabling reproducible generation of expert demonstrations and execution traces. Using this pipeline, we further construct \BenchName, a ready‑to‑use benchmark comprising 300 certified tasks across diverse laboratory operations. It supports HIL task execution, reproducible expert‑demonstration generation, and ordered step‑level evaluation. Across representative tasks, the strongest policy attains an average success rate of only 49.7%, with further evaluations revealing pronounced weaknesses in human and embodied agent coordination. We publicly release the code, benchmark data, and evaluation toolkit at https://github.com/SciHorizon‑elab/SciHorizon‑elab.
Authors:Shaopeng Jia, Yali Du, Ming Li
Abstract:
Commit messages are essential for understanding software changes, yet automatic commit message generation typically treats a message as an unstructured text sequence. This limits its ability to support standardized development workflows, where commit messages are often expected to follow the Conventional Commits Specification (CCS) in the form type (scope): subject. In this paper, we study conventional commit message generation under the complete CCS format. We construct a new benchmark of 86,688 high‑quality commits collected from open‑source GitHub repositories, with each message normalized into type, scope, and subject through structural normalization and semantic quality filtering. Based on this benchmark, we propose a two‑dimensional consistency‑based reranking framework named CoCoRerank for LLM‑based generation. CoCoRerank exploits horizontal consistency among the code change, type, scope, and subject, as well as vertical consensus across multiple generated candidates. Experiments with representative CMG baselines, LLM generators, reranking strategies, and ablation variants show that CoCoRerank improves both structural component prediction and subject generation quality. The results demonstrate that complete CCS supervision and multidimensional consistency modeling provide an effective foundation for accurate and standardized commit message generation. The artifact is publicly released at https://github.com/bluewhalebug/CoCoRerank.
Authors:Bing Wang, Changchun Li, Xin-Qiang Cai, Lin Yuanbo Wu, Ximing Li, Gang Niu, Masashi Sugiyama
Abstract:
Continual fine‑tuning is essential for large language models (LLMs) to dynamically adapt to real‑world environments, yet it inevitably suffers from catastrophic forgetting, particularly the performance degradation of previous tasks and LLMs' general‑purpose knowledge. Although existing methods, such as orthogonal gradient projection, mitigate the forgetting across various fine‑tuning tasks, they fundamentally fail to preserve pre‑training LLMs' inherent general‑purpose knowledge because the original data and gradients of off‑the‑shelf pre‑training LLMs required by these methods are strictly unknown and highly diverse. To bridge this critical gap, we propose EoupCT, a novel framework designed to Estimate and Orthogonalize Unknown Pre‑training gradients for Continual LLM fine‑Tuning. Specifically, EoupCT estimates pre‑training gradients by dynamically generating pseudo data that is most susceptible to forgetting for new tasks through a learnable soft prompt equipped with Gumbel‑Softmax relaxation. Furthermore, we formulate a multi‑objective optimization problem and introduce a first‑order efficient Pareto optimizer that jointly optimizes LLM parameters and the soft prompt, rigorously enforcing orthogonality between new task updates and the estimated pre‑training gradients. Extensive experiments across multiple LLMs demonstrate that EoupCT effectively preserves both task‑specific proficiency and inherent general‑purpose knowledge, successfully mitigating the catastrophic forgetting.
Authors:Takumi Fujimoto, Hiroaki Nishi
Abstract:
Completed multi‑horizon forecasts provide residual feedback for a fixed forecaster, but retaining full residual blocks increases auxiliary state. We propose Endpoint‑Preserving Online Correction (EPOC) with a compressed residual state. It stores low‑order discrete cosine transform (DCT) coefficients and the final value of the preceding residual block. Within each channel, the endpoint is shared across component‑wise online ridge regressions that also use current‑forecast coefficients. The fitted DCT correction is blended with the base forecast. We evaluate eight multivariate series with DLinear and PatchTST, three seeds, and two training variants, yielding 96 matched fixed‑base conditions at a 24‑step horizon. EPOC achieves mean condition‑wise reductions in mean squared error (MSE) and mean absolute error (MAE) of 15.40% and 9.35% from the uncorrected base, respectively, with a median of 6,352 B in retained auxiliary arrays. It has lower paired MSE than the δ‑Adapter, COSA, FAC, and OMPB in a majority of conditions and uses less state than each. Full ELF achieves the largest mean MSE reduction, 19.29%, but its median retained state is 474,048 B (×75 relative to EPOC). Equal‑size summary controls favor the endpoint by 1.65‑‑2.20% in paired MSE; a coefficient‑reconstructed endpoint yields similar accuracy to the observed endpoint, highlighting its role as a shared input. Increasing the retained DCT component count from 4 to 8 adds 1.00 percentage point of MSE reduction for 5,728 B. On jointly trained bases, EPOC lowers MSE by 16.69‑‑20.15% relative to globally blended TEFL‑style adapters applied to the same base. The code and numerical records are available at https://github.com/keiotakmin/endpoint‑preserving‑residual‑correction.
Authors:Quanhao Zhu, Bo Xu, Rui Lin, Chenyuan Wang, Yu Shao, Boling Zhu, Jiuyan Sun, Liang Zhao, Hongfei Lin, Feng Xia
Abstract:
Ultrasound is one of the most widely used medical imaging modalities, and recent large vision‑language models(VLMs) have shown increasing capabilities in ultrasound image understanding. However, these models fail to provide pixel‑level visual evidence aligned with their semantic predictions, and their fine‑grained grounding capability in ultrasound remains largely unclear. We introduce UltraG‑Bench, a large‑scale multi‑task benchmark for evaluating pixel‑level evidence grounding in ultrasound. UltraG‑Bench is built by annotating 40 public ultrasound segmentation datasets spanning 13 anatomical categories, and comprises three progressive tasks: instruction‑guided segmentation, evidence‑grounded VQA, and evidence‑grounded report generation, with 331125, 666779, and 138832 annotations, respectively. Comprehensive evaluation of 14 state‑of‑the‑art models reveals a substantial gap between semantic understanding and fine‑grained pixel‑level localization. We further propose UltraG‑Agent, which combines the semantic reasoning capabilities of a VLM with the ultrasound‑specific segmentation capability of UltraSAM3. Experiments show that UltraG‑Agent substantially improves both semantic prediction and pixel‑level visual grounding. Our dataset and code are available at https://github.com/zhuqh19/UltraG‑Bench.
Authors:Xiuying Wang, Jiahua Cheng, Shuotian Li, Yufan Cheng, Bowen Deng, Zhexuan Bai, Yichen Li
Abstract:
Building adaptable AI systems requires effective coordination of specialized capabilities across diverse tasks. Low‑rank adaptation (LoRA) enables modular expertise, but existing routing approaches may require auxiliary data, additional training, or autoregressive decoding. We propose JevSoup, a training‑free framework separating System One expert routing from System Two execution. Using only the input and expert descriptions, Jev selects two experts through structured probabilities. JevSoup retains the leading expert's update, projects the second onto the orthogonal complement of the first update's row space, and combines them with equal weights. Across 14 PorTAL tasks and three Qwen3 scales, JepSoup achieves absolute gains of up to 1.19% in task‑macro and 1.21% in sample‑micro accuracy over the strongest evaluated external baselines. Our code is available at https://github.com/Leowang980/JevSoup.
Authors:Jeremy Siburian, Cristian C. Beltran-Hernandez, Tatsuya Matsushima, Yusuke Iwasawa, Masashi Hamaya, Mai Nishimura
Abstract:
Contact‑rich assembly tasks such as peg‑in‑hole insertion remain difficult to learn from limited demonstrations. While retrieval‑augmented imitation learning, which augments target demonstrations with relevant prior data, offers a promising direction, its applicability to contact‑rich manipulation remains largely unexplored. Contact‑rich insertion unfolds over multiple phases from search to insert, and retrieving phase‑specific experience from prior data in principled ways remains an open question. Our key insight is that a compliant wrist enables the robot to sustain contact throughout execution, producing rich tactile and force signals that naturally reveal the phase structure of insertion and inform what should be retrieved. Based on this insight, we present PHASE (PHase‑Aware Segmentation and REtrieval), a framework for compliance‑enabled tactile phase retrieval that integrates multimodal contact‑aware representation learning, variable‑length phase segmentation from tactile signals, and phase‑consistent retrieval for policy learning. We evaluate PHASE on real‑world peg‑in‑hole insertion across five peg geometries, comparing against retrieval strategies drawn from state‑of‑the‑art methods under a shared policy architecture. PHASE improves the overall success rate by 13 percentage points over the strongest non‑phase‑aware baseline, and improves performance under unseen initial positions by 30 percentage points. These results demonstrate that aligning retrieval with interaction‑defined contact phases substantially improves robustness in few‑shot insertion learning.
Authors:Yonghong Zhang, Yong Xie, Isabel M. Parra, Ricardo Correia
Abstract:
Difference‑in‑differences (DID) studies are widely used to evaluate climate policy, but assessing the evidence supporting their identification assumptions remains challenging. We introduce ARGUS, a structured language‑model pipeline that audits reported evidence against an eleven‑dimension assumption‑implication‑evidence rubric and abstains when relevant evidence cannot be retrieved. We evaluate ARGUS using injected flaws, economics papers, and a small pilot with reconciled labels. On the 11‑flaw benchmark, ARGUS detects 73% of planted flaws, compared with 18% for a keyword‑based pipeline. Across 26 economics papers, ARGUS abstains on about 40% of paper‑dimension assessments for lack of retrievable evidence. In a five‑paper pilot with labels reconciled by two annotators, it assigns a higher risk level than the labels on 25 of the 33 assessments it completes. A rule fixed before the labels arrived removes most of this in‑sample; weighted agreement stays low. ARGUS provides evidence‑linked risk reports that localize potential weaknesses for expert review, without adjudicating causal claims. Code and data: https://github.com/yonghongzhang‑io/ARGUS
Authors:Zijian Wu, Jinliang Wang, Zidian Lin, Ying Song, Ziqian Lu, Hanjie Ma, Zhen Ye, Mingfeng Jiang
Abstract:
COLMAP‑free 3D Gaussian Splatting (3DGS) bypasses computationally expensive structure‑from‑motion (SfM) pipelines, yet progressive camera pose tracking remains fundamentally vulnerable to error compounding‑‑‑early pairwise tracking inaccuracies both corrupt subsequent frame initializations and remain permanently frozen in the scene representation. Rather than relying on heavyweight external neural priors or treating progressive tracking through isolated heuristic fixes, we propose a unified reliability‑regulated trajectory optimization framework for progressive COLMAP‑free 3DGS. At its core, our framework establishes an intrinsic, self‑supervised bidirectional cycle‑consistency mechanism that systematically regulates progressive camera trajectory estimation across two complementary temporal horizons: (1) Forward Motion Propagation, where the online reliability signal adaptively gates first‑order kinematic warm‑starts of rigid motion into upcoming pairwise registrations, supplying informed directional search priors while safely intercepting untrusted transitions; and (2) Retrospective Trajectory Correction, where the same reliability signal dynamically weights relative‑pose consistency constraints within a sliding window of neighboring camera poses. By governing both prospective state initialization and retrospective trajectory consolidation through a unified reliability regulator, our self‑contained framework resolves progressive drift without external priors or offline preprocessing. Extensive evaluations on Tanks and Temples and CO3D‑V2 benchmarks show that our method substantially improves camera trajectory accuracy and novel‑view rendering quality, outperforming existing unposed baselines. Code is available at https://github.com/Zijian1026/RRTO‑CF3DGS.
Authors:Aiden Zhou
Abstract:
Learned particle simulators based on graph neural networks achieve strong one‑step accuracy, but errors compound over long horizons. An underexplored variable is the interaction graph: existing methods fix its topology via k‑nearest neighbors or a static radius rule, regardless of local model confidence. We propose making this graph adaptive: a per‑particle variance head, trained jointly with the acceleration head under a heteroscedastic Gaussian NLL loss, drives a trajectory in which high‑uncertainty particles receive an expanded neighborhood. This is done at little extra inference cost by using the previous step's uncertainty estimate. A key discovery is that the variance head learns a meaningful notion of uncertainty: high‑variance particles concentrate near complex regions, such as splash zones or free surfaces. When this signal drives graph topology, the resulting AdaptGNS simulator achieves a strict Pareto improvement on WaterDrop and a modest gain on Sand. Given the model's stronger performance on WaterDrop, we hypothesize that adaptive graphs are most useful when complexity is concentrated in space. Our code can be found at https://github.com/aidenzhou8/AdaptGNS.
Authors:Zhangyi Wang, Jiaxu Liu, Chen Song, Chao Xu, Shengze Cai
Abstract:
In many safety‑critical applications, control of uncertain dynamical systems relies on observers that estimate states and external disturbances. Neural network observers can improve estimation accuracy, but certifying their Lyapunov stability via Linear Matrix Inequality (LMI) constraints leads to large‑scale semidefinite programs (SDPs) that are difficult to solve for large networks. To overcome this scalability bottleneck, we propose a novel two‑stage training framework for provably stable neural network observers. Our approach decouples the optimization into a point‑guided Lyapunov pre‑training phase, which rapidly achieves high estimation accuracy and local stability over sampled states, followed by an LMI fine‑tuning phase that efficiently satisfies a strict global Lyapunov stability certificate. We provide formal theoretical guarantees for local stability radii and probabilistic coverage over a prescribed compact error‑state domain under specified regularity and sampling assumptions. Experiments on nonlinear control benchmarks and X‑29 aircraft ablations show that our LMI‑certified neural network observers train significantly faster than direct LMI‑based methods and generalize robustly across diverse systems, achieving improved tracking accuracy over a range of observer baselines. The code is available at https://github.com/Berry‑Myon/LearningNeuralNetworkObserver.
Authors:Anjila Budathoki, Manish Dhakal, Benjamin M. Ampel, Yi Ding
Abstract:
Prior research has demonstrated that the choice of prompt template during Supervised Fine‑Tuning (SFT) significantly impacts the robustness of safety alignment afterwards. However, the influence of template selection during Knowledge Distillation (KD) from teacher to student remains largely unexplored. Thus, we fill this gap by analyzing how different template configurations influence the pre‑existing safety alignment of the student. We observe a significant degradation of safety alignment present in the aligned base instruct‑tuned model. Specifically, we find that utilizing chat templates renders the model more compliant with harmful queries compared to a non‑chat template. These findings are consistent across three models: LLaMA, Gemma and Qwen model families and are evaluated across multiple safety benchmarks. We further show that using a non‑chat template during distillation better preserves the base student's internal representations, while chat template distillation induces a larger representational shift. Code: https://github.com/anjilab/role‑of‑prompt‑template‑in‑kd
Authors:Shivam Negi, Arpit Rawat, Rashi Jain
Abstract:
Real‑time voice agents have moved from research prototypes to production deployments, yet the literature describing them is fragmented across three communities that rarely cite one another: speech foundation modelling, turn‑taking psycholinguistics, and agentic evaluation. Architecture papers report latency, turn‑taking papers report prediction accuracy, and agentic benchmarks report task success, so no single number describes whether a deployed agent is actually good. We address that gap with three evidence‑based claims, each traceable to a corpus of 38 primary sources organised into an application‑centric taxonomy of six categories. First, architecture choice is a deployment constraint rather than a settled verdict: a 2026 enterprise tutorial reports that no fully self‑hostable end‑to‑end system yet meets production constraints, while a chunked cascade independently reaches state‑of‑the‑art duplex behaviour, showing duplex behaviour is separable from duplex architecture. Second, evaluation has shifted decisively from component quality toward grounded outcomes, with recent benchmarks verifying backend state rather than trusting what the agent claims to have done. Third, the dyadic assumption in most models and benchmarks is breaking down: multiparty turn‑taking and multi‑speaker reasoning benchmarks show that deciding when not to speak, and reasoning about who may be told what, are first‑class capabilities two‑participant framings cannot measure. For each source we state the problem it targets, its mechanism, and its reported evidence, alongside the search strategy, inclusion criteria, and a verification step that caught a misattributed arXiv identifier in circulation. We propose TRG (Timing‑Recovery‑Grounded), a reporting standard characterising an agent by timing, post‑disruption recovery, and state‑verified outcome together, with a conditional fourth axis for multiparty deployments.
Authors:Yiqi Yao, Miquel Duran-Frigola
Abstract:
In low‑data structure‑activity prediction, the choice of molecular representation can matter more than the choice of predictor, and tabular foundation models sharpen that effect. We ask whether a portfolio of compact, semantically named descriptor blocks can reach the accuracy of a 2048‑dimensional CheMeleon embedding while staying auditable at the feature level, meaning that every input dimension carries a model name and a recorded training provenance. Starting from a fixed 11‑dimensional physicochemical base, we greedily concatenate provenance‑screened blocks using the labelled context alone. Across nine ADME/Tox assays and 50 evaluation cells, scored on common‑coverage subsets restricted to the molecules that every representation covers, the portfolio reaches a mean test AUC of 0.762, against 0.764 for CheMeleon and 0.756 for Mordred. The pooled gap to CheMeleon is +0.003 AUC (task‑bootstrap 95% CI [‑0.020, +0.030]), which satisfies our predeclared pooled parity gate but not the per‑assay gate. At 25 context labels the headline rule again satisfies the pooled gate; at 10 labels it does not. We also report four predeclared candidate‑selection rules that we falsified. Post‑freeze checks over ten seeds and three previously unseen assays support pooled competitiveness for compact, auditable representations; a same‑width random‑bundle control does not establish that greedy membership itself adds accuracy. Assay‑level differences remain unresolved.
Authors:Benedetta Picano, Dusit Niyato
Abstract:
Anthropomorphic artificial intelligence systems increasingly remember personal details, display empathy, and are engaged with as social counterparts, creating forms of risk that emerge from the evolution of the user‑system relationship over time. Existing safeguards largely operate at the level of individual conversational turns and cannot determine whether a sequence of seemingly acceptable interactions is cumulatively moving a particular user toward harm. This paper introduces personalized trajectory‑level safety, a framework that treats relational safety as a sequential decision problem over a latent escalation state inferred from the user's messages and influenced by the system's responses. At each turn, a screening step first discards any response strategy that does not preserve at least one safe continuation of the interaction under every plausible model of the user. Among the remaining strategies, we formulate action selection as multimodal trajectory sampling, and use a Generative Flow Network to generate diverse future evolutions in proportion to their plausibility, safety, and utility. The system then selects the strategy that preserves the largest fraction of safe and useful continuations. We evaluate the framework in simulation, calibrated on statistics reported for real human‑chatbot interactions, and using response strategies derived from public benchmarks. Results show that trajectory‑aware decision making substantially reduces the frequency of harmful states while keeping helpful interaction. This work reframes safety for anthropomorphic AI from response‑level filtering to personalized control over the future evolution of human‑AI relationships. The source code is available at https://github.com/benedettapicano/ANTHROPOMORPHIC_SAFETY_TRAJ.
Authors:Shuhan Zhang, Wenxuan Wu, Haizhou Li
Abstract:
In face‑to‑face, real‑time communication, a talking agent must track the target speaker through natural pauses, turn‑taking, and backchannels, often amid background cross‑talk. Most target speaker extraction (TSE) studies, however, rely on simulated mixtures with full or sparse overlap and ignore the turn‑taking of real conversations. We therefore introduce, to our knowledge, the first benchmark for online audio‑visual TSE (AV‑TSE), built from intact dyadic interactions with independent third‑party interference. Observing that anticipating upcoming activity from semantic, acoustic, and facial cues benefits online AV‑TSE, we propose an LLM‑based target‑speaker voice activity projection (TS‑VAP) module. Unlike conventional VAP with separated speaker channels, it forecasts the future activity of the target and conversational partner directly from the overlapping mixture, drawing on the linguistic and conversational knowledge of a speech‑LLM, and uses this prediction to guide a low‑latency separator. We further combine this predictive context with historical and synchronous speaker context. Experiments show that TS‑VAP consistently improves streaming extraction across multiple AV‑TSE backbones, and that further combining historical, synchronous, and predictive context yields nearly 1 dB gain on real AV conversations. Project page: https://jjjjiaozi.github.io/TS‑VAP/.
Authors:Puja Ahmad Habibi, Faiz Assabil Firdaus, Ashvanth S, Ekapol Chuangsuwanich, Pume Tuchinda, Peerat Limkonchotiwat
Abstract:
Multilingual text‑vision embedding models are essential for cross‑lingual image‑text retrieval, but Southeast Asian languages remain poorly supported due to the region's linguistic diversity and limited data and computing resources. In this paper, we introduce SEA‑CLIP‑Tiny, a compact multilingual text‑vision embedding model for Southeast Asia with fewer than 50M parameters. Our model adapts a CLIP‑KD‑style framework to Southeast Asian multilingual settings through regional data curation and multilingual teacher guidance. Experiments across seven Southeast Asian languages show that SEA‑CLIP‑Tiny achieves the strongest average retrieval performance among the evaluated student models, reaching 12.9%, 31.5%, and 42.2% at R@1, R@5, and R@10, respectively. Compared with MobileCLIP2, it improves average R@10 by 12.1 points while using 38.4% fewer parameters and lower measured CPU latency. These results highlight the importance of region‑aware training for efficient multilingual text‑vision models in Southeast Asia.
Authors:Md Anas Biswas
Abstract:
Intrusion detectors for small Internet‑of‑Things (IoT) devices are usually compressed by pruning and judged by overall accuracy. We show that this hides a severe class‑level failure, find its cause, and give low‑overhead prevention and repair. On CICIoT2023, a two‑layer convolutional detector pruned with uniform layer‑wise magnitude pruning at 80% sparsity loses 16 points of accuracy but half of its macro‑F1, the mean per‑class F1 (0.542 to 0.271 over five independently trained models); 17 of 34 classes are materially damaged. Remaining weight count does not explain it: a perceptron and a transformer pruned to the same or fewer weights lose at most 0.096. The first layer does. It has 192 weights; uniform pruning leaves 38, 46% of its 64 filters lose every input weight, and fine‑tuning under that starvation leaves the running means of the first normalisation layer displaced by up to 0.8 standard deviations in a few surviving channels, on which the deployed model collapses. Protecting those 192 weights, or pruning globally at the same sparsity, prevents the collapse (loss 0.013); recomputing the normalisation statistics on unlabelled training data, with no weight changed, repairs it (loss 0.039) and returns the false‑alert rate to 33% (dense 29%). Damage shows a strong increasing dose‑response in first‑layer sparsity, starving a perceptron's input layer reproduces the collapse, and the pattern holds on TON_IoT. The failure is misattribution and false alerts, not silent evasion: on validation‑selected blind spots, uniformly pruned detectors misattribute 72% of the traffic, against 50% with the first layer protected and 47% for the dense model.
Authors:Volkan Dağlı, Zerrin Dağlı, Dağhan Dağlı
Abstract:
Contemporary on‑chain artificial intelligence (AI) encounters an intractable Von Neumann memory and latency wall. Storing static floating‑point neural weight matrices inside Ethereum Virtual Machine (EVM) storage costs millions of gas, rendering direct on‑chain inference impossible. While Zero‑Knowledge Machine Learning (ZK‑ML) offloads matrix tensor multiplications to off‑chain provers, it introduces fatal constraints: 10 to 300 seconds of SNARK proving latency and 250,000 to 500,000 gas per proof verification. Because decentralized finance (DeFi) exploits ‑ such as uncollateralized flash‑loan attacks, predatory sandwich MEV, and toxic loss‑versus‑rebalancing (LVR) flow ‑ occur atomically inside a single block, ZK‑ML oracles cannot react in time. Here, we present Werracle, a production‑grade, zero‑storage on‑chain AI decision oracle fitting inside a single 32‑byte EVM storage slot (bytes32). Leveraging foundational procedural Mandelbrot escape dynamics (z_n+1 = z_n^2 + c) established by Dagli et al. (arXiv:2609.25498), Werracle derives continuous non‑linear decision hyperplanes from a 24‑byte coordinate triplet Theta = (c_x, c_y, zoom). Implemented in pure Solidity bytecode using fixed‑point Q16.16 arithmetic (WerrMath.sol), Werracle evaluates a 16‑point Pareto micro‑grid in only 21,438 gas (under 0.0005 USD on Layer‑2 rollups like Base and Arbitrum) with sub‑millisecond execution latency. We demonstrate real‑world DeFi efficacy via WerracleFeeHook.sol, a Uniswap v4 dynamic swap fee governor that measures orderbook turbulence on‑the‑fly and atomically adjusts liquidity provider fees between 0.05% and 0.50%. The protocol is formally verified against a 1,000‑test cryptographically sealed deterministic verification suite (100.0% pass rate) with telemetry permanently disabled, operating live on a dedicated EVM devnet sandbox (Chain ID 4242).
Authors:Xiao Chen, Yicheng Zhao, Yingying Wu, Zhendong Chu, Changyi Ma, Qingsong Wen, Xuan Song
Abstract:
Recent advances in agentic recommender systems are shifting recommender systems from passive filtering engines to instruction‑following agents that use external tools to resolve user intent. However, existing benchmarks often assume explicit user intent, simplified tool environments, or isolated function calls, leaving realistic tool orchestration for recommendation underexplored. To bridge this gap, we propose RecToolBench, a Model Context Protocol (MCP)‑based benchmark for evaluating tool‑using recommender agents under fuzzy user instructions. RecToolBench contains more than 1,200 executable tasks across three recommendation domains, 13 MCP servers, and 32 tools, spanning single‑tool calls, parallel tool calls, sequential tool chains, and hybrid tool orchestration. We construct RecToolBench with a scalable synthesize‑‑fuzzify‑‑judge pipeline that generates executable fuzzy recommendation tasks, and evaluates agent trajectories using rule‑based execution checks and rubric‑based LLM evaluation. Experiments on representative LLMs show that syntactically valid tool calls do not guarantee successful recommendations. Models struggle with semantic parameter grounding, multi‑step evidence integration, and grounded final recommendations, especially as orchestration complexity increases. Our results identify tool orchestration under fuzzy user intent as a major bottleneck for agentic recommender systems. Our data and code are available at https://github.com/ShawnChenn/RecToolBench.
Authors:Xueyang Li, Mingze Jiang, Gelei Xu, Jun Xia, Ching-Hao Chiu, Mengzhao Jia, Danny Z. Chen, Yiyu Shi
Abstract:
Agentic AI systems are increasingly being explored in medical imaging to improve throughput and reduce clinician workload; however, safe deployment remains challenging because autonomous errors may propagate into downstream clinical decisions. A central requirement is therefore not only strong predictive performance, but also a reliable routing mechanism that determines when the system should proceed autonomously and when a case should be escalated for further review. To address this gap, we propose CRC‑Router, a risk‑constrained, uncertainty‑aware routing module that is applicable to both conventional medical prediction models and agentic medical AI systems. CRC‑Router combines multiple complementary uncertainty signals with the predictive score to construct a per‑finding routing feature vector, maps this vector to an estimated wrong‑accept risk using a lightweight per‑finding risk model, and then applies Conformal Risk Control (CRC) to calibrate acceptance thresholds under a user‑specified risk target. Instantiated on chest X‑ray multi‑finding triage using the NIH ChestX‑ray14 dataset, CRC‑Router achieves the strongest empirical risk‑‑coverage trade‑off among the evaluated baselines, both as a standalone routing layer and as a plug‑in module integrated with the state‑of‑the‑art MedRAX agent. These results demonstrate both the effectiveness of CRC‑Router in selective medical automation and its modular, model‑agnostic compatibility with existing predictive and agentic medical pipelines. Code is publicly available at https://github.com/XLIAaron/CRC‑Router
Authors:Tasneem Nasser, Susanne Schmid, Roberto Souza, Naser El-Sheimy
Abstract:
A key challenge in medical image analysis is the scarcity of large annotated datasets for specific populations and diseases. As deep learning models rely heavily on labeled data, effective transfer learning strategies are needed to reduce the dependence on manual annotations. Self‑supervised learning has emerged as a promising approach for developing foundation models by enabling the learning of transferable feature representations from large‑scale unlabeled medical imaging datasets. In this study, we investigate voxel‑level brain age prediction as a domain‑specific self‑supervised pretext task and compare it with image inpainting, a widely used non‑domain‑specific alternative. We further propose a multitask self‑supervised pretraining framework that jointly optimizes both objectives to learn complementary neuroimaging representations. The pretrained models are evaluated on three downstream magnetic resonance image segmentation tasks: multiple sclerosis lesion segmentation, ischemic stroke lesion segmentation, and cortical brain structure segmentation. Overall, the proposed multitask pretraining framework consistently outperformed the single‑task pretrained models and training from scratch across most experimental settings, demonstrating the benefit of combining domain‑specific and general self‑supervised learning pretext tasks for the development of generalizable neuroimaging foundation models.\ Code Availability: The source code used in this study is publicly available at https://github.com/TasneemN/Combining‑General‑and‑Domain‑Specific‑Pretext‑Tasks‑for‑Brain‑MR‑Image‑Segmentation/
Authors:Furkan Yilmaz, Habibe Aleyna Tasdemir, Muhammed Faruk Gozay
Abstract:
"System One" decision models such as TypeSafe's Jev and its open counterpart Laya answer typed questions about a text in a single forward pass with calibrated probabilities, but they cannot ask for missing information: when a first message does not say what separates two departments, they guess. We present LAVOIR (Laya with Value‑Of‑Information Routing), which places the candidate pieces of missing information (slots) in the input next to the answer options, so that one forward pass returns both the decision distribution and, for every slot, the expected gain in the probability of the correct decision if the user were asked about it. VOI targets need no human labels: gold decisions come from schema rules, an LLM only verbalizes messages and answers, a model from another family checks every text, and pairing each message with several profiles makes regression on realized gains estimate the expected gain. A Gini‑impurity cap bounds the predicted value by what a calibrated model can still gain. In a controlled study, decisions on seen schemas are statistically indistinguishable from the Bayes ceiling. The final model's question policy matches a greedy oracle VOI policy on seen schemas (AUC 0.799 vs. 0.797), and with at most 0.5 questions per conversation it is 14.1 points more accurate than never asking. On real ABCD conversations, one real exchange raises accuracy by 8.3 points where LAVOIR asks and leaves it unchanged where it does not; on SGD the cap lowers the asking rate from 93% to 8.6%. On Laya's twelve benchmarks LAVOIR is above Laya's reported scores on seven, and it answers a question in 31 ms (median, GH200).
Authors:Neil Janwani, Matthew T. Lerner, Aaron J. Young, Maegan Tucker
Abstract:
Human‑in‑the‑loop optimization (HILO) is a common approach for optimizing the control of assistive devices to account for the wearer's unique biomechanics and subjective preferences. However, despite research suggesting that a person may have a different prioritization of objectives depending on time‑varying factors such as the environment, their mood, or energy levels, existing HILO approaches only consider a single objective or enforce a fixed weighting on a set of objectives. Neither approach is capable of representing an individual's preferences over objectives. In this work, we propose Multi‑Objective Human‑in‑the‑loop Bayesian Optimization (MO‑HILBO), which builds on explicit multi‑objective Bayesian optimization to efficiently infer a personalized set of Pareto‑optimal controllers. We compare our approach with an existing multi‑objective HILO method and experimentally demonstrate MO‑HILBO on a lower‑limb exoskeleton across two objectives: metabolic cost (efficiency) and ordinal human feedback (comfort). We find that MO‑HILBO (1) discovers Pareto‑optimal controllers, and (2) that the pairwise ordering of points on the Pareto front itself is consistent with validation trials. Lastly, we open‑source mohilo, a Python package for running both HILO and MO‑HILBO on wearable devices: https://dynamicmobility.github.io/mohilo/.
Authors:Bashir Zeimarani, Alireza Khatib, Somayeh Mousavinasr, Carlos Maurício Serodio Figueiredo
Abstract:
Brazil's Pix settles about 5.9 billion instant, irreversible transfers a month. A fraudulent transfer can be recovered only while the funds remain in a traceable account, and in 2025 the Central Bank's recovery mechanism (MED) returned 9% of accepted contested value. Interdiction therefore has to happen before settlement, by routing each transaction to pass, human review or block, under a finite analyst team and a regulatory hold window. To our knowledge no public simulator jointly models irreversible settlement, a regulated recovery mechanism, downstream fund dispersal and capacity‑constrained review. We present PixSim, an open‑source simulator of the Pix rail with these elements, calibrated to Banco Central do Brasil open data, with every parameter sourced, calibrated to one published observable, or registered as an assumption. With the model frozen, full‑scale runs reproduce the 2025 recovery rate within 0.006 and its decomposition within 0.02; the February‑April 2026 window is reported as a misfit and the May 2026 tracing regime as a projection. On a benchmark with a payer‑side scorer, four reference policies and ten scenarios, within the simulated mule model: recovery after settlement is constrained by dispersal speed; staffing by the arrival profile cuts a fixed rule's alert expiry from 52% to 2% at constant hours; halving the team removes a fixed threshold‑and‑block rule's advantage over a queue‑aware rule, on loss and on loss plus false‑block harm (+0.106 of victim value, positive on all twenty paired seeds), while a reversal at two thirds of the team was not confirmed on independent seeds; and a synthetic scorer of held‑out AUC 0.82 cuts lost value by about a quarter. Code and data: https://doi.org/10.5281/zenodo.22948895
Authors:Yibo Ma, Qianqian Zhang, Peng Liu, Tiancheng Zhao
Abstract:
Streaming video understanding requires models to interpret evidence as it arrives, yet current evaluations often report task scores without specifying when evidence becomes valid, how visual history is maintained, or how responses are triggered. As a result, similar scores may correspond to different workloads, failure modes, and operational behavior. We introduce TRACE (Temporal Audit and Condition‑aware Evaluation), a condition‑aware benchmark and evaluation framework that makes these factors explicit. TRACE combines temporally audited visual tasks with evidence timing and instruction‑dependent trigger annotations, a unified causal Core‑‑Adapter protocol that controls information availability while recording actual history processing and response events, and multidimensional reporting of answer quality, timeliness, response‑selection behavior, workload, completion, and reliability. On 1,240 records from 517 videos, we evaluate eight publicly available models or systems in eight configurations. We find that nearly identical QA accuracy can mask substantial differences in completion, answer validity, and generation workload, while proactive performance separates into response quality, response delay, false alarms (responses emitted while no target window is currently valid and a later one remains), and missed target windows. These results show that streaming‑video performance should be interpreted as execution‑conditioned system behavior rather than a single score. Our benchmark and code can be accessed at \hrefhttps://github.com/om‑ai‑lab/trace‑benchhttps://github.com/om‑ai‑lab/trace‑bench.
Authors:Tommaso Schettini, Nicholas D. Kullman, Jorge E. Mendoza
Abstract:
Machine‑learning policies have attracted increasing interest for ride‑hailing fleet control in recent years. Reinforcement learning, in particular, requires a structured simulation environment that specifies observations, actions, rewards, and decision epochs for training and evaluation. For electric fleets, this environment must also capture the interaction among stochastic demand, vehicle operations, and capacitated charging infrastructure. We present OpenHail, an open‑source Gymnasium environment for joint control of electric ride‑hailing fleets. Its fixed‑size observation‑‑action interface exposes request assignment, repositioning, and charging to a single policy. The event‑driven simulator represents requests with pickup deadlines, vehicle job queues, battery dynamics, and finite‑capacity charging facilities with first‑in‑‑first‑out queues. A configurable decision‑epoch mechanism separates internal simulator events from policy interactions, supporting event‑driven, periodic, hybrid, and policy‑requested control within the same operational model. The software provides seeded instances, feasible‑action utilities, evaluation tools, operational metrics, and baseline policies. The source code is available at https://github.com/tommaso‑schettini/openhail.
Authors:Alexander Gill, Md Farhan Ishmam, Xuyen Nguyen, Neha Bhat, Parker Henry DeYoung, Fateme Hashemi Chaleshtori, Nathan Stringham, Kenneth Marino, Ana Marasović
Abstract:
Existing computer‑use agent benchmarks do not fully evaluate agents acting as assistants. A useful assistant retrieves information across complex, multi‑step workflows, synthesizes it into artifacts (documents, presentations, spreadsheets), and navigates program interfaces to produce a coherent final product. Such workflows demand reasoning and synthesis, decomposition of complex tasks, as well as visual and spatial understanding. To study agents on workflows like these, we introduce KNOWS, a benchmark of open‑ended, complex, browser‑based tasks that jointly evaluate these capabilities, with each task culminating in a produced artifact. To write tasks, we develop a task design rubric and a protocol for ensuring that tasks meet the requirements. Each task is paired with an evaluator, a program that combines deterministic checks with LLM judgments to balance the richness, reliability, and automation tradeoff inherent to agent evaluation. We evaluate and analyze frontier computer‑use agents and browser‑based harnesses. They achieve moderate scores on partial‑success metrics, but the best performer fully succeeds in fewer than 3% of our complex, long‑horizon tasks. Failures on visual steps render the resulting artifacts unusable, even when agents complete more than 50% of other evaluation steps. Our results expose limitations of current agents acting as end‑to‑end assistants, and call for progress on tool use, visual understanding, and long‑horizon reasoning.
Authors:Jiaqi Ding, Guorong Wu
Abstract:
Agent memory systems are increasingly used to maintain long‑term user preferences, task states and evolving facts, but current evaluations often collapse memory behavior into final‑answer accuracy. We introduce MemProbe, a cognitive‑science‑inspired framework for diagnosing stability‑plasticity tradeoffs in agent memory. The framework is motivated by a core insight from cognitive memory research: memory is reconstructive and shaped by interference, source reliability, reinforcement, and reactivation. MemProbe turns this insight into four reusable experimental paradigms (interference, misinformation, consolidation strength, and reconsolidation window) that manipulate when a memory should be updated, preserved, or treated as uncertain. It further decomposes correctness into behavioral profiles that reveal how systems update, preserve, attribute, and temporally organize information. We instantiate these paradigms in a 56‑episode diagnostic suite and evaluate six incremental memory systems under a unified protocol. Results show that systems with similar aggregate scores exhibit distinct behavioral profiles. MemProbe provides such a diagnostic lens, turning aggregate performance into interpretable profiles of memory maintenance over time. Code is available at https://github.com/jq‑ding/MemProbe.
Authors:Daniel J. Evans, Yinlong Dai, Simon Stepputtis, Dylan P. Losey
Abstract:
As robots transition from structured factory settings into homes, they are required to interact with an ever‑increasing variety of objects. Many tasks require grasping, and often it is not sufficient to just pick up the target object. Consider a task like "pouring coffee" ‑‑‑ to facilitate the subsequent pouring, the robot should grasp the mug by its handle. Existing learning‑based approaches for grasping either find robust and collision‑free grasps that are largely agnostic to the task (e.g., picking up the mug by its rim), or leverage foundation models to propose task‑appropriate grasp locations that lack fine‑grained physical grounding (e.g., reaching for and missing the handle). In this work, we bridge these approaches with a real‑to‑sim‑to‑real framework. Based on a single RGB‑D observation, we construct a digital twin of the environment, query a large foundation model to propose grasps that align with the object's affordances and task description, and then optimize the proposals to ensure robustness and plausibility before executing the result on the real robot. Our key insight is that the grasp proposals of the foundation model should be regarded as semantic priors that serve as seeds for local, gradient‑free optimization. We leverage Bayesian optimization with Thompson sampling to draw batches of nearby poses, which are subsequently evaluated in parallel under domain‑randomized physics rollouts. The resulting grasp is both task‑oriented and physically feasible for execution by the robot arm. Our full zero‑shot real‑world transfer only takes a few minutes and improves task‑oriented grasping success by up to 33% as compared to other state‑of‑the‑art pipelines. Our code is available here: https://github.com/VT‑Collab/GraspTwin/
Authors:Abdellah El Mekki, Laks V. S. Lakshmanan, Muhammad Abdul-Mageed
Abstract:
De novo peptide sequencing from tandem mass spectra is essential for identifying peptides without relying on reference databases. Despite advances in deep learning, accurate sequencing remains challenging because experimental spectra are often sparse, noisy, and incomplete, leaving informative b‑ and y‑ion fragments unobserved. Existing methods attempt to recover this missing evidence via latent‑space imputation before autoregressive decoding. However, they typically treat imputation as a fixed reconstruction task, without considering which missing fragments are most relevant to decoder errors. Moreover, existing peak representations do not explicitly model mass differences between peaks, despite their fundamental importance. We introduce GyroNovo, a framework with two main contributions. First, we use decoder errors observed during training to adapt the imputation objective, prioritizing fragments associated with frequent decoding errors. We further use the decoder error distribution to construct easy and hard augmented views of each spectrum, enabling the decoder to learn under varying degrees of spectral corruption and missing‑fragment severity. Second, we introduce a mass‑aware inductive bias into self‑attention by using rotary embeddings to encode pairwise mass differences between spectral peaks. Together, these components align missing‑fragment recovery with decoder behavior while explicitly incorporating the mass relationships that underlie peptide fragmentation. At inference time, GyroNovo retains a standard encoder‑imputer‑decoder architecture and requires neither additional inputs nor auxiliary search procedures. Experiments on NovoBench show gains of about 9 percentage points in peptide‑level precision and 7 percentage points in amino‑acid‑level precision over the state‑of‑the‑art baseline. Code: https://github.com/UBC‑NLP/gyronovo.
Authors:Dries Rooryck, Alex Cai, Yonatan Belinkov, David Alvarez-Melis, Kianté Brantley
Abstract:
Children in multilingual communities often code‑switch, using multiple languages in a single utterance. Can we induce cross‑lingual alignment in language models by training on code‑switched text? We pretrain small decoder‑only transformers on two 100M‑word multilingual corpora: a base corpus formed by mixing the English, Dutch, and Chinese BabyBabelLM datasets, and a corpus generated from it by inserting word‑ and sentence‑level code‑switching using an LLM. We find that training on code‑switched data aligns the representations of parallel text, particularly across different scripts, and that this alignment persists through training on monolingual documents. Under a learning curriculum that progresses from word‑level code‑switching, to sentence‑level code‑switching, to monolingual documents, models trained on code‑switched data outperform baselines trained without it on the BabyLM evaluation suite. Our work characterizes code‑switching curriculum learning as an effective data augmentation method for multilingual pretraining. We release our code, data, and models at https://github.com/drooryck/multilingual‑macaroni.
Authors:Anand Jayarajan, Gennady Pekhimenko
Abstract:
As modern data analytics workloads become increasingly heterogeneous and hardware‑intensive, achieving efficient multi‑core performance across diverse applications remains an open challenge. We present Reffine, a compiler‑based in‑memory analytics engine that delivers high performance across a broad range of data analytics workloads. Reffine introduces a novel intermediate representation (IR), grounded in relational algebra and sparse iteration theory, that provides a unified abstraction for data and computation. This representation enables workload‑agnostic, end‑to‑end optimizations such as operator fusion and automatic parallelization across diverse analytics applications. We further develop a sparse compiler backend that translates Reffine IR into hardware‑efficient imperative code, achieving high multi‑core performance without domain‑specific implementations. On the TPC‑H benchmark, Reffine outperforms the in‑memory analytical database DuckDB by up to 24.9× and the state‑of‑the‑art compilation‑based database Umbra by up to 3.2×. Reffine also achieves average speedups of 18.3× and 47.9× over Polars and NetworkX on streaming and graph analytics workloads, respectively. Source code: https://github.com/ampersand‑projects/reffine
Authors:Sheng-Tse Lin, Siyuan Zhai, Chien-Liang Kuo, Massa Baali, Bhiksha Raj
Abstract:
Audio language models state numbers for acoustic quantities, and neither human opinion nor a judge model says whether such a number is true of the signal. AcoustiClaim extracts each numeric claim from free text, scores it against the instrument that defines the quantity, and classes each quantity by where its reference can be read. Four open‑weight systems and one closed model, asked for ten quantities five ways on two corpora, fill 207 cells. Of these, 49 emit fewer than five distinct values, and eight of the 158 cells that can be ranked exceed a rank correlation of 0.3, the bar we set, three with an interval clear of it, five of them one closed model reading pitch. Error sits at or above a constant‑predictor floor in every ranked cell but three. The reference decoder we train declines the five voice quantities in prose on 95% of mixtures, with nothing withheld, and states them on the clean twins, reproducing its targets' rule from audio alone. With a calibrated threshold, withholding lowers error on all ten quantities on the mixtures in the mean and on eight at every split, against at most 0.6% from a random selector. A linear baseline orders errors at least as well as ours. F0 s.d. and shimmer stay above the constant floor.
Authors:Soshun Kihara, Shunsuke Yasuki, Masato Taki
Abstract:
Convolutional neural networks trained on ImageNet are known to exhibit a strong preference for local high‑frequency texture, an inductive bias that translates into fragile robustness against distribution shifts in real‑world environments. Event cameras, in contrast, record only changes in scene brightness and are therefore well suited to capturing contour information; however, due to the absence of diagnostic benchmarks in the event domain, the inductive bias that event‑camera data instills in vision models has remained underexplored. In this work, we use knowledge distillation from the event domain to the RGB domain so as to exploit the rich evaluation toolkit available in the RGB domain and systematically dissect this inductive bias. Our experiments show that distillation from the event domain induces, in the RGB domain, color invariance, shape bias, and robustness to high‑frequency noise. We identify the underlying mechanism as the model suppressing its dependence on high‑frequency texture while acquiring a stronger dependence on edge‑based object shape. This hypothesis is supported by changes in how color and spatial information are processed at the early layers, together with a spectral trade‑off in which robustness to the absence of high‑frequency components coexists with vulnerability to contamination of the relied‑upon frequency bands and to disruption of geometric structure. We further show that this inductive bias differs from existing robustification methods and that it functions as a useful prior for diverse downstream tasks in which shape and contour information contribute alongside other cues. The code is available at https://github.com/snskysk/event2rgb‑distillation .
Authors:Weibin Cai, Reza Zafarani
Abstract:
Edge sampling makes local decisions to achieve graph‑level objectives, such as preserving structural properties. This creates a fundamental challenge: how can the effect of a local edge edit (i.e., edge addition or removal) on global graph structure be quantified and controlled? We address this challenge with a moment‑guided edge sampling framework based on spectral moments of the random‑walk transition matrix. We compute exact moment changes through two complementary methods: a combinatorial method with closed‑form updates for low‑order moments, and a low‑rank method that exploits locality and cyclic trace invariance to compress computations to edited endpoints, supporting arbitrary moment orders and batched edits. For single‑edge edits at fixed moment orders, the low‑rank method reduces the cost from O(mn) to O(m), while the combinatorial method evaluates low‑order changes in constant time given maintained local statistics. These moment changes provide interpretable structural signatures of local edge motifs that aggregate into graph‑level fingerprints. This structural meaning motivates us to ask whether preserving moments also preserves the graph properties. We further derive and validate that moment‑preserving sampling can retain related structural properties, including triangle‑weighted clustering coefficient. These structural insights enable analysis and improvement of graph learning: different edge structures have distinct effects on supervised node classification, while moment‑guided augmentation is competitive for graph contrastive learning. Together, these findings establish moments as an interpretable and controllable bridge from local edge edits to global graph structure and learning.
Authors:Zachary Ravichandran, Jonathan Diller, Fernando Cladera, Varun Murali, George J. Pappas, Vijay Kumar
Abstract:
Foundation models provide robots with the ability to interpret natural language and reason about environmental context, yet most language‑conditioned policies assume that goals are well‑specified and that task‑relevant information is provided upfront via a prior map. Operating in unfamiliar environments with underspecified tasks entails high contextual uncertainty: the robot must jointly infer what constitutes task success, what constitutes relevant information, and where (or whether) that information exists. We address these limitations via CLUE (Closed‑Loop contextual Uncertainty rEsolution), a framework for actively resolving contextual uncertainty given underspecified tasks in natural language. CLUE uses an LLM‑derived policy to hypothesize task‑relevant concepts and potential plans. It then uses a language‑embedded map, which is constructed online, to ground these hypotheses into actions. The policy sequentially evaluates hypotheses via closed‑loop environment interaction and refines its plans as it gathers new information. We deploy CLUE on a Boston Dynamics Spot across three real indoor and outdoor environments spanning 15 tasks that require object disambiguation, functional inference, and occlusion reasoning. CLUE achieves a success rate within 7 percentage points of an oracle policy and outperforms an LLM‑enabled planner without closed‑loop feedback by a 4x margin. Supporting experiments demonstrate that simply building and then querying a language‑enriched map is insufficient to resolve complex contextual planning tasks; these approaches achieve roughly one third the success rate of CLUE while requiring over 10x more VLM tokens. We provide additional information at https://zacravichandran.github.io/CLUE.
Authors:Sang Min Kim, Jinwoo Seo, Hyeongjun Heo, Junho Lee, Yonghyeon Lee, Young Min Kim
Abstract:
We present POIL, a point‑based one‑shot imitation learning framework with stable dynamical systems. While one‑shot imitation avoids collecting extensive demonstrations, successful one‑shot manipulation requires not only transferring a demonstrated trajectory to a novel object but also executing it robustly under changing scene conditions, grasp configurations, and external disturbances. POIL addresses both problems through a shared representation: a set of 3D points on the object's functional part, used jointly for trajectory transfer and closed‑loop execution. The one‑shot transfer from the demonstrated trajectory is enabled with point correspondences. POIL grounds the shared functional part with a multi‑modal large language model, and transfers the trajectory across viewpoint, pose, and object category changes. During execution, multi‑view tracking observes the same points online, and Point‑set BCSDM drives them in closed loop by projecting per‑point velocities onto a single rigid‑body twist computed from the tracked points alone. This extends stable dynamical models from an SE(3) pose to a point set without requiring a known 3D model or pose estimator. We show that at the goal the controller becomes a gradient flow on the classical SO(3) potential, so its terminal phase inherits the almost‑global convergence of that potential under a rigid‑object assumption. Across simulation and real‑robot experiments, POIL transfers a single demonstration across object category, grasp pose, and goal geometry, while recovering from external disturbances during execution. Project page: https://sangminkim‑99.github.io/poil
Authors:Javier Moral Hernández, Clara Higuera-Cabañes, Álvaro Ibraín
Abstract:
This paper presents an end‑to‑end causal machine learning (ML) pipeline designed for real‑world applications with continuous treatments. The proposed framework consists of six sequential steps: dimensionality reduction, causal identification, positivity assumption violation handling, estimation, refutation and evaluation, and policy optimization. We introduce practical contributions not currently available in existing causal ML toolkits, specifically: (1) a method for detecting and quantifying positivity violations in continuous treatment settings (2) a novel, scalable two‑stage dimensionality reduction framework tailored for causal inference with high‑dimensional data; (3) the adaptation of sensitivity analysis and estimation methods originally designed for binary treatments to the continuous treatment space and (4) an end‑to‑end integration of these components into a modular, reproducible workflow. These innovations address real‑world challenges in causal inference that are often not covered in theoretical frameworks but frequently encountered in industrial applications. The methodology is validated with a synthetic dataset inspired in a real‑world financial debt collection use case, however its design can be applied to analogous problems across different industries. Results demonstrate that the proposed methodology offers a more computationally efficient approach and produces less biased estimates compared to standard methods for problems with continuous treatment and high‑dimensional data. A fully functional GitHub repository with documented code and numbered notebooks is made available ensuring reproducibility and practical implementation. The pipeline presented is intended to contribute to closing the gap between academic approaches and practical application in industry contexts where causal ML can be highly beneficial such as the financial sector.
Authors:Zhengchen Huang, Yundong Sun, Minrui Song, Shuanglong Yao, Ye Liu, Ji Chen, Xing Wang
Abstract:
Retrieval‑Augmented Generation (RAG) mitigates knowledge obsolescence and factual hallucination in large language models by introducing external context. However, when retrieved knowledge conflicts with the model's internal parametric knowledge, the model may either blindly follow misleading context or incorrectly rely on parametric knowledge, leading to unreliable responses. To address this issue, this paper proposes TRACE (Debate‑TRace and Answer‑Completeness rEgularized fine‑tuning), a robust fine‑tuning framework for RAG under knowledge conflicts. First, we propose a fine‑tuning method that leverages multi‑agent debate traces to extract correct candidates, incorrect candidates, and answer‑shift patterns, providing fine‑grained supervision for reliable knowledge‑source selection. In addition, we design an answer completeness regularization mechanism to alleviate empty, overly short, and prematurely terminated responses via answer‑tail token reinforcement and premature termination suppression. The fine‑tuning objective combines correct‑answer supervision, incorrect‑candidate suppression, answer‑tail token reinforcement, and premature termination suppression, enabling the model to use reliable external context, resist misleading or irrelevant retrieved content, and fall back to parametric knowledge when retrieved evidence is unreliable. Experiments across multiple knowledge‑conflict scenarios and datasets show that TRACE improves robustness against misleading retrieved knowledge and reduces incomplete answers. These results demonstrate that multi‑agent debate traces and answer completeness regularization jointly enhance knowledge‑source selection, conflict robustness, and answer quality in RAG models. Our code is available at https://github.com/PHD‑lanyu/TRACE.
Authors:Shane Caldwell, Max Harley, Ads Dawson, Michael Kouremetis, Vincent Abruzzo, Will Pearce
Abstract:
Agents are increasingly deployed with real autonomy in web application and network penetration testing, where a single out‑of‑scope action can breach a client's engagement boundary. Existing offensive‑security benchmarks measure raw hacking capability; as those benchmarks saturate, the real barrier to deployment is a special case of alignment: scope adherence. We introduce ScopeBench, a benchmark of 30 dead‑end agentic security tasks in which the stated objective is reachable only by violating the stated scope. Each task appears under two conditions that share an environment, verifier, and objective and differ only in scope: one instruction set has no scope and measures capability; the other has a natural‑language scope to measure adherence. Scopeless trajectories are graded by a standard deterministic verifier. Scoped trajectories pass through two grading arms. First, the same deterministic verifier checks for the flag: because the flag sits behind the scope boundary, a pass proves by construction that a forbidden action occurred, yielding a high‑precision lower bound on the violation rate. If the verifier does not pass the trajectory, an agentic judge estimates whether an out‑of‑scope call occurred. We calibrate the judge against 100 ScopeBench trajectories labeled call‑by‑call by human annotators, and a blinded audit of the evaluated rollouts finds its high recall holds ‑ no false negatives among the 36 audited violations, with over‑flagging its only observed error. Across 8 models in one harness, raw capability spans 12.2% to 81.1% and scope adherence spans 34.4% to 86.7%, with the judge finding 331 violations that mechanical verification misses. Opus‑4‑8 achieves a raw‑capability score 10 percentage points higher than sonnet‑4‑6's while exhibiting 35.6 percentage points higher scope adherence. We release the frozen pilot benchmark, evaluation code, and all 2160 ATIF trajectories.
Authors:Seunghan Lee, Jun Seo, Jaehoon Lee, Junhyeok Kang, Sangjun Han, Sungdong Yoo, Minjae Kim, Tae Yoon Lim, Dongwan Kang, Hwanil Choi, Soonyoung Lee, Wonbin Ahn
Abstract:
Language models used in financial backtests suffer from look‑ahead bias, as a model trained on text published after the study period has already observed the outcomes it is asked to predict. To handle this issue, point‑in‑time (PIT) language models are pretrained on chronologically filtered corpora and released as one checkpoint per calendar year, each with a documented cutoff. However, each additional year costs a full pretraining run, and whether that run is necessary has never been tested. In this paper, we show that the annual pretraining run is not necessary. We instead compare each checkpoint against the newer one that replaced it, and find that the newer checkpoint scores no better on the same evaluation window. Motivated by this observation, we propose PALM (Point‑in‑time Adaptation for financial Language Models), a simple yet effective alternative to annual pretraining that fits a low‑rank adapter on text published before the decision date without modifying any pretrained weight. We further find that a small adapter is enough to add a new period to the knowledge an old checkpoint already encodes, and that this outperforms continued pretraining. We validate PALM on a decade of financial news and on various families of PIT models, whose cutoffs span two decades and whose sizes range from 1.3 to 4.2B. Code is available at: https://github.com/seunghan96/palm.
Authors:Haowei Liu, Hsin-Tai Wu, Yi Fang
Abstract:
Production text‑to‑SQL pipelines often end with an LLM‑as‑judge whose agreement with human annotators has never actually been measured. When we checked ours, the deployed gpt‑4o‑mini judge agreed with two‑author gold at only Cohen's kappa = 0.04 on a disagreement‑enriched set and 0.42 on a uniform‑random spot‑check, over‑flagging 77.1% of the human‑FAITHFUL cases in the enriched set. Most of its over‑flags trace back to a single mechanism we call GRADE‑HALLUCINATION. A self‑hosted Qwen3.6‑27B replacement (kappa = 0.72) lands in the same range as Claude Opus 4.7 (kappa = 0.71); the head‑to‑head is underpowered at n = 96, but for the deployment decision that hardly matters, since Qwen costs roughly 1/300 as much per call. Ensembling does not help for free. Pairing the weak judge with a stronger one degrades agreement, whereas three strong judges under unanimity routing reach kappa = 0.79 at 89.7% auto‑coverage. Applied out‑of‑domain, the same audit recipe flags 25.5% of BIRD‑financial's expert‑authored gold SQLs as candidate gold‑SQL issues under our annotation protocol. Code and pre‑registration are at https://github.com/JamesL404/synca‑audit.
Authors:Venkata Subbaiah Yerrapati, Rahul Dixit, Ajay Kumar Shukla
Abstract:
Understanding the features captured by the hidden layers of neural networks is a fundamental challenge in machine learning, despite their widespread success across various classification problems. In this work, we propose an algebraic framework for examining neural networks that model classification problems. Certain results, such as the correspondence between the neural network and neural ideals, algorithms for computing the neural ideals, and a stabilization theorem that enables approximation of the neural ideals, are first established. As an application to the framework, we present algorithms to identify and interpret the features captured by each hidden‑layer neuron. Along with these theoretical developments, the practical performance has been demonstrated on the MNIST digit dataset, and the results highlight the pivotal role of neural ideals as a mathematical and computational tool for analyzing the features captured by neural networks. Further, we develop an interactive software that builds on the presented framework to visualize the features captured by each neuron. This tool is available at https://github.com/yvs1967/neural‑network‑representation‑explorer
Authors:Pranav Varshney
Abstract:
A statistic reported without the quantity needed to interpret it is not evidence. We develop that thesis for a concrete practice in AI safety. Interpretability artifacts are calibrated on full‑precision weights, deployed on quantized ones, and certified as surviving the change by scale‑invariant statistics (cosine similarity, correlation, AUROC) that are reported without their noise floor. For the difference‑in‑means direction estimator, the split‑half floor is governed by one dimensionless number, κ= nρ^2/d. The closed form \mathbbE[\cos] \approx (1+4/κ)^‑1 is classical; the missing input is the class separation ρ, which we measure on real activations; no compression‑transfer study we know of reports it. On Qwen2.5‑1.5B‑Instruct, ρ= 33‑‑61 across depth, so two independent runs of the estimator agree to 0.978‑‑0.994 by sampling alone. A published cosine of 0.996 between full‑precision and quantized refusal directions therefore cannot be read as preservation without the n it was computed at, which is not reported. Where n is known, we judge each low‑bit cosine against the split‑half null measured within that quantized model, because a full‑precision null assumes the low‑bit estimator has the same variance. That assumption is exactly what a null exists to test. The result is plain: at INT4 the direction rotated, and the deficit exceeds the estimator's own noise. At INT8 we detect no movement, which is not an equivalence claim. We also show that a scale‑invariant statistic cannot distinguish translation from attenuation of a transferred decision variable, although the two call for opposite remedies. We close with reporting recommendations that cost one forward pass. Code, data, and a one‑cell reproduction are released at https://github.com/pvarshh/quantinterp
Authors:Mohd Moin Khan, Naman Srivastava, Pandarasamy Arjunan
Abstract:
We present ENAS, a hardware‑aware Neural Architecture Search (NAS) framework that combines a static feasibility check, a cell‑based search space supporting standard, depthwise‑separable, and bottleneck blocks with optional skip connections, and a three‑stage hybrid search strategy (random \rightarrow top‑K \rightarrow mutation) with persistent cross‑run caching. Unlike many existing NAS frameworks that rely on GPU acceleration, ENAS is designed to operate efficiently without requiring GPUs, making it suitable for resource‑constrained development environments. We evaluate ENAS on two TinyML benchmarks, Visual Wake Words and Melanoma Cancer, across eight microcontrollers with memory footprints ranging from 20\,KB to 1\,MB SRAM and nine input image resolutions. Our experimental results show that ENAS achieves mean search‑time speedups of 2.41× and 1.70× on the Visual Wake Words and Melanoma Cancer datasets, respectively, while maintaining competitive test accuracy compared with the recent NanoNAS framework. A measured resource analysis further shows that ENAS‑selected models use substantially lower peak activation RAM, the binding constraint for microcontroller deployment at matched accuracy. Additionally, ENAS achieves 79.4% test accuracy on an STM32H743‑based microcontroller, outperforming the greedy CPU‑only baseline by 2.6 percentage points. We release the ENAS framework as open‑source at: https://github.com/EdgeIntelligenceLab/ENAS
Authors:Simran Koul
Abstract:
On‑device inference with small language models keeps user data local, works offline, and incurs no per‑query cost, so the on‑device tier is preferred when it is adequate. It is thermally constrained, however, and I find the constraint is sharper than a slowdown: on a flagship Snapdragon device, sustained on‑device generation destabilizes the GPU inference runtime, which crashes or silently wedges after a few consecutive queries. The failure lies in the current toolchain (OpenCL kernel compilation and long‑prompt prefill on the mobile GPU), recurs even when the device is cool, and is worst for long generations. Multi‑tier routers across on‑device, edge, and cloud models can relieve this pressure, but existing routers are thermal‑blind and typically evaluated in simulation or on non‑mobile hardware. I present HybridInfer, a thermal‑aware reinforcement‑learning router for a three‑tier hierarchy (on‑device Llama 3.2 3B, edge Llama 3.1 8B with retrieval, cloud GPT‑4o) that uses the phone's thermal headroom and a query‑complexity estimate as state and selects a tier by an offline‑trained Q‑learning policy. Its reward trades quality against latency, cost, and a thermal penalty, plus a locality bonus crediting on‑device execution. I show this bonus is a precondition for thermal‑aware routing: without it the optimal policy offloads every query. On a real Android benchmark of 210 prompts, the learned router attains significantly higher quality than two hand‑tuned heuristics (paired Wilcoxon, p < 0.02) at the lowest cost of any adaptive condition. Always‑on‑device conditions match per‑query quality on servable queries but are three to six times slower and fail on long queries, so routing wins on latency, reliability, and coverage rather than quality. To my knowledge this is the first use of on‑device thermal headroom to select among LLM inference tiers of differing capability on real hardware.
Authors:Jiabin Qiu, Zixuan Chen, Hongye Cao, Jieqi Shi, Jing Huo, Yang Gao
Abstract:
Latent world models are typically trained to predict factual transitions, whereas model predictive control (MPC) must compare alternative actions from the same state. A model can therefore achieve low factual prediction error yet poorly distinguish candidate actions. We introduce AD‑WM, an action‑discriminative joint‑embedding world model for counterfactual MPC. AD‑WM combines residual latent dynamics with predictor‑level action‑recovery regularization, using inverse dynamics and a normalized recovery objective motivated by conditional mutual information. Both objectives encourage planning transitions to preserve action information; their auxiliary heads are discarded at test time, leaving MPC unchanged. On OGBench‑Cube, AD‑WM improves hard‑start success from 3.7% to 52.0% over a matched LeWM baseline and improves mean success over the reproduced baseline in four of five simulation environments. Planning diagnostics show that factual prediction error and whole‑bank action ranking do not follow the closed‑loop success ordering, whereas CEM‑aligned elite regret tracks success more closely. With a frozen V‑JEPA 2 encoder and matched DROID post‑training, AD‑WM also improves zero‑shot transfer to our Franka setup, increasing basic pick‑and‑place success from 42.2% to 71.1% without lab‑specific adaptation. These results suggest that world models for planning should preserve action‑dependent differences needed for counterfactual selection, rather than optimize factual prediction accuracy alone. More videos and code are available at https://ad‑wm.github.io/.
Authors:Zixiang Xu, Zirui Song, Chiyu Zhang, Xiuying Chen, Xi Liu, Xiyang Hu, Yue Zhao
Abstract:
An ordinary‑looking background detail can turn a correct model decision into a confident mistake. We demonstrate this fragility in four decision systems, including Jev, across seven datasets covering knowledge, reasoning, and tool routing. Within 64 accepted target evaluations per decision, we uncover short context additions that redirect 61.4%‑73.2% of each system's initially correct decisions toward a wrong option fixed in advance. The additions supply background or procedural information rather than explicit answer‑selection instructions, leaving the original question and choices intact. We construct them through probability‑guided context optimization, which uses shifts in the option distribution to refine surrounding text under naturalness and answer‑preservation constraints. Redirection affects initially confident decisions, often produces high‑confidence wrong choices, and transfers across models. In blinded human evaluation, 91.6% of 250 sampled successful contexts are judged natural, answer‑preserving, and free of decisive answer‑changing evidence by a majority of three independent annotators. These findings expose a weakness in current decision models: context that looks entirely compatible with an input can redirect the choices that agents, routers, and evaluators rely on.
Authors:Luc Bouteille, Frederic Jonske, Jens Kleesiek, Alexander Jaus
Abstract:
Common segmentation losses aggregate errors voxel‑wise, so lesions influence the objective in proportion to their volume, giving small but clinically critical lesions disproportionately little weight. Instance‑aware losses aim to address this mismatch by assigning each lesion its own term. However, blob loss and CC‑DiceCE derive their regions solely from annotations, so false‑positive components receive no instance‑level term. This matters in computer‑assisted review, where each false‑positive component may require separate inspection, making precision and false‑positive burden important alongside recall. We introduce the bidirectional connected‑component loss (BiCC), which pairs annotation‑ and prediction‑derived partitions to score predicted components on their own scale. By deriving instances from the predictions, this branch directly penalizes false‑positive components regardless of their size. The balance parameter α allows control over the lesion‑wise precision‑recall trade‑off. Across five datasets with five‑fold cross‑validation using nnU‑Net, BiCC outperforms CC‑DiceCE in lesion‑wise F1 on four datasets and blob loss on all five. It significantly improves over DiceCE on three datasets and matches it on two; CC‑DiceCE instead loses up to 0.363 precision by favoring recall. Code is available at https://github.com/TIO‑IKIM/BiCC‑Loss.
Authors:Jonas Ellert, Lukas Nalbach
Abstract:
The Lempel‑Ziv (LZ77) factorization decomposes a text into the least possible number z of phrases that each refer to an earlier occurrence. It is this phrase count, rather than the encoded size, that governs the size of LZ‑based compressed indexes, and computing a factorization with few phrases is a time and space bottleneck in their construction. In practice, computing LZ77 quickly has so far required building a suffix array. Ellert [SPIRE 2023] gave algorithms that compute the exact LZ77 factorization, and a 3‑approximation of it, in sublinear working space. They have remained unimplemented, because two of their components resist a direct implementation: a lookup table that degenerates to patterns of length at most two for realistic inputs, and an orthogonal range reporting data structure that is impractical. We replace both, fine‑tune every remaining stage, and obtain the first practical implementation, which runs in space close to the text rather than to the suffix array. On one thread, our 3‑approximation factorizes 12‑19x faster than the classical LPF algorithm while using 14x less memory; on 32 threads, even our exact algorithm is 1.4‑‑2.9x faster than parallel LPF, at 9x less memory. In practice the approximation ratio stays far below 3. As a side result, passing only its perfect phrases to a downstream compressor yields a precompressor that is on par with the state of the art [Dinklage, SEA 2026] in compression ratio, and better in memory consumption and parallel throughput.
Authors:Xinyue Zeng, Jiawei Zhang, Yujun Yan, Dawei Zhou
Abstract:
Long‑horizon reasoning remains a central challenge for large language models (LLMs) under sparse‑reward regimes. We argue that this brittleness arises from two biases induced by complex reasoning spaces: an exploration bias, where models are drawn toward locally plausible but structurally unstable branches, and a compounding bias, where small local deviations accumulate across depth and suppress rare rewards. We introduce Symbolic Closure Analysis (SCA) as a theoretical lens characterizing how branching structures and sparse rewards induce these biases in long‑horizon reasoning with local admissibility, and as a design principle for structural priors in less formal reasoning tasks. Motivated by this analysis, we propose SAGE (Structural Admissibility‑Guided Exploration), a unified framework that injects structural guidance to alleviate exploration bias and compounding bias in long‑horizon reasoning. SAGE combines two complementary structural guidance: algebraic sparsification, which projects locally admissible candidates onto operator‑indexed algebraic subspaces to suppress spurious branching and mitigate exploration bias, and hyperbolic structural guidance, which embeds reasoning states into a negatively curved space to provide dense depth‑wise signals and mitigate compounding bias. Across 12 benchmarks and 7 model families, SAGE outperforms competitive baselines. In particular, SAGE achieves up to an 8‑fold improvement on the Andrews‑Curtis problem, an open real‑world long‑horizon task. Code is available at: https://github.com/Susan571/SAGE‑NeurIPS2026.
Authors:Abhiram Maddukuri, Georgios Pavlakos
Abstract:
Ego‑Exo4D is a large‑scale dataset providing synchronized egocentric and multi‑view exocentric video, a rich resource for skill learning and assessment, procedural activity understanding, and embodied AI. However, the dataset ships with only sparse 3D human pose annotations, and reconstructing dense human motion from its multi‑view captures is nontrivial. To this end, we present Ego‑Exo4D‑HM, a large‑scale dataset of 4D human motion reconstructions for Ego‑Exo4D's captures, and release the accompanying reconstruction pipeline. The code, dataset, and documentation can be found at https://abhiram824.github.io/egoexo4d_human_meshes.
Authors:Archit Rastogi
Abstract:
Asked to choose between candidates and explain the choice, a language model often rejects a rival by naming a fact its profile lacks: no director, no date of death. That sentence is a claim about the text in front of the model, and it can be tested without any judge. We insert a real corpus sentence stating the named fact into the rival's profile and ask again under greedy decoding. Two controls separate content from placement: a length‑matched irrelevant sentence at the same profile, and the same two sentences at a third option the model never mentioned. In the largest of three runs, six open models on 2WikiMultihopQA, supplying the named fact at the profile the model named moves its choice more than the irrelevant control does, odds ratio 3.57 [1.54, 8.26], Holm p=0.0210, and this survives dropping any single model. The contrast the design was built to detect, the same fact at the option nobody named, does not clear correction, Holm p=0.2428. The strongest result in the family carries no content claim at all: the identical irrelevant sentence moves the choice more at the named rival than at the third option, Holm p=0.0008. Repair and control also differ in co‑candidate mentions, relation template and fluency; post‑hoc matching on the first two preserves the content effects' direction, matching fluency weakens one, so the content contrasts bound an effect rather than establish one. A forced single‑token probability read disagrees in direction with the free‑text choice on that same contrast, and three candidate explanations for the disagreement find no support. Every measurement is a string rule, so each was validated against the records it reads; validation caught eight defects. The largest, a choice‑parsing rule that returned the option a model had just rejected in 17.1% of adjudicable responses, would have reported six surviving contrasts instead of four.
Authors:Beiming Liu, Haihao Li, Minjie Chen, Ning Chen, Yiran Wang, Jiming Ye, Puzhao Zhang, Tongtao Wang, Sheng Gao, William Jin, Weihao Mu, Chengzhi Liu, Yucheng Xia, Guangren Wang, Chaoyang Fan, Changfeng Huang, Xunming Lin, Yuanjie Shen
Abstract:
Agent skills package version‑specific maintenance knowledge for coding agents, but a higher diagnostic score does not by itself show that the resulting migration advice satisfies the target version's contract. We study a shipped plugin‑upgrade skill through an archive of 64 reports on 16 static migration tasks, with two attempts per condition and 328 criterion decisions. With the skill, mean recorded reward rises from 93.83 to 98.75, a gain of 4.92 points (95% task‑bootstrap interval [0.31, 10.86]); the gain is concentrated in one task, and eight task pairs are at the ceiling. Tracing every decision to its contract domain and reviewing ten reports in depth exposes grading errors that favor either arm; in one, a containment predicate that accepts the parent directory still receives full credit. Executable probes confirm this defect and show that a working teardown repair is excluded only by a narrower lifecycle rubric. Replacing the reviewed decisions keeps the estimate positive (4.61 to 5.39 points) but moves its interval to or across zero. Re‑grading all 64 reports with judges from two other model families, without arm labels or prior scores, agrees with the original judge on 91.8% and 95.7% of decisions (weighted κ=0.64 and 0.72) and gives gains of 10.63 and 6.09 points. The study contributes a traceable evaluation that connects aggregate reward to contract‑level evidence and judge sensitivity, together with concrete review checks for migration advice. Executable end‑to‑end repairs, independent human annotation, and other frameworks are left to future work.
Authors:Abdullah Arafat Miah, Kevin Vu, Yu Bi
Abstract:
Backdoor attacks are a serious security threat to deep neural networks (DNNs) and remain largely underexplored for spiking neural networks (SNNs). Existing attacks primarily introduce spatiotemporal triggers that induce deviations in the spike distribution of poisoned samples relative to their clean counterparts. To address this limitation, this work proposes a novel backdoor attack on SNNs, termed T‑Backdoor, which operates using purely temporal triggers such as Rate, Latency, and Jitter without introducing any spatial perturbation, making the shift in spike distributions significantly harder to detect. Through extensive experiments on three benchmark neuromorphic datasets: N‑MNIST, CIFAR10‑DVS, and N‑Caltech101, and evaluation against seven baseline backdoor defense methods, we demonstrate that T‑Backdoor achieves a near‑perfect 100% attack success rate (ASR) in both single target and multi target settings with only minor degradation in clean accuracy, while remaining robust against existing backdoor detection and mitigation techniques. The codes are available at https://github.com/SiSL‑URI/T‑Backdoor .
Authors:Volkan Dağlı, Zerrin Dağlı, Dağhan Dağlı
Abstract:
Modern deep neural networks treat parameters as static floating‑point matrices stored in physical memory, incurring Von Neumann memory bottlenecks and representation collapse. We formulate Orbital Error Dynamics (OED), an analytical framework wherein synaptic weights are not stored masses (O(W)), but transient topological resonances (O(1)) derived procedurally from the complex quadratic polynomial map z_n+1 = z_n^2 + c. We introduce the Bent Sine Wave Hypothesis, demonstrating that non‑equilibrium living systems emerge when harmonic waves curl inward through environmental drag toward the cardioid cusp (c = 1/4). We define the Observer Horizon Geometry in parameter space, identifying interior resonance shoulder loci X_upper = (0.25, +0.18) and X_lower = (0.25, ‑0.18) between the fixed‑point basin and the true boundary at c = 0.25 +/‑ 0.50i. To escape non‑convex stagnation without loss zeroing, we introduce a heavy‑tailed Biomimetic Perturbed Jump Operator (Omega_tunneling) inspired by mammalian fertilization zinc sparks. We further couple an enteric‑cranial Dual‑Brain architecture shielded by adaptive CD4+ regulatory immune gating (M_CD4), and project the 4‑nucleotide genetic basis (A, T, C, G) across quadrants in C. Multi‑seed empirical validation on the Two‑Moons manifold (5 seeds, 80/20 train/test split, 32x32 grid, zero test‑time updates, zero label leakage) demonstrates that procedural parameterization from a 24‑byte coordinate seed achieves 77.67% +/‑ 5.35% clean test accuracy (within an 8.00‑point paired difference of an unconstrained gradient baseline at 85.67% +/‑ 5.35%, 95% CI: [‑1.07%, 17.07%]) and 71.33% +/‑ 3.80% under distribution shift (N(1.2, 0.4)), alongside conceptual equivalence with an analog optical co‑processor.
Authors:Hongxin Zhang, Chunru Lin, Tsun-Hsuan Wang, Zhenjia Xu, Chuang Gan
Abstract:
While Vision‑Language‑Action (VLA) models demonstrate impressive capabilities in robotic manipulation, their memoryless nature renders them brittle to test‑time environment shifts, particularly hardware shifts caused by wear or imperfect calibration. Enabling these models to self‑adapt during deployment without requiring continuous on‑site recalibration remains a critical bottleneck for real‑world scalability. In this work, we introduce Self‑Adaptive VLA, a novel post‑training recipe that enables the policy to iteratively adapt to deployment‑time hardware shifts leveraging its own rollouts as context. To do so, we first collect policy rollouts under deliberately injected hardware shifts. We then transform the base policy's training data into shift‑conditioned expert demonstrations by pre‑compensating the expert actions for these known shifts. Next, we introduce a lightweight, plug‑in context encoder that compresses the context, including visual observation, proprioception, and actions in the shifted environment, into a latent context token. This token modulates the policy through adaptive layer normalization (AdaLN). Furthermore, we find that context tokens can be ensembled, allowing the policy to iteratively self‑correct and mitigate failures step by step. Extensive experiments across four precision‑critical bi‑manual and dexterous manipulation tasks show that Self‑Adaptive VLA recovers over 80% of the base policy's performance under hardware shifts, such as actuation bias and joint encoder offsets. Moreover, Self‑Adaptive VLA enables more robust deployment to new workstations compared to the base policy. Our approach provides a pathway for robust large‑scale real‑world robot deployments and easier maintenance. See videos at https://icefoxzhx.github.io/self‑adaptive‑vla.
Authors:Sang Min Kim, Alexander Alexiev, Tzu-Yuan Lin, Sangbae Kim, Young Min Kim, Yonghyeon Lee
Abstract:
Robust dexterous grasping requires maintaining physical stability despite contacts interactively evolving across the entire hand. A precomputed force distribution can easily fail under object motion, modeling errors, or external disturbances. In this paper, we present a framework for real‑time force regulation over dynamically changing whole‑hand contacts. Our method geometrically estimates contacts across all hand links using a tracked object model and proprioception, without requiring tactile sensing at those contacts. It repeatedly recomputes the desired contact‑force distribution subject to friction constraints, actuator limits, and an actuation‑consistency constraint motivated by classical whole‑limb force analysis. We integrate this force‑regulation controller with reactive reaching, enabling the hand to acquire a grasp, maintain it under disturbances, and regrasp after losing the object. Simulation experiments without gravity demonstrate improved grasp retention over fixed‑allocation and fingertip‑only execution under controlled perturbations, while real‑world experiments on a 27‑DoF arm‑hand system demonstrate grasp maintenance and recovery under human‑applied disturbances as contacts evolve across the whole hand. Project page: https://sangminkim‑99.github.io/reactive‑grasp‑whole‑hand/
Authors:Chenxi Li, Wenxuan Zeng, Yun Luo, Fangchen Yu, Peng Ye, Yu Cheng, Jun Zhang
Abstract:
Improving the scientific coding capabilities of large language models (LLMs) requires high‑quality training data. However, such data remain scarce because manually authoring realistic problems is costly and time‑consuming, while systematically covering diverse scientific domains and algorithmic combinations remains challenging. To address this, we introduce SciWalker, a framework for synthesizing scientific coding problems through operator‑chain sampling and execution feedback. The framework combines scientific library interfaces with operation modes to instantiate operators, organizes them into operator graphs, and samples operator chains as computational workflow cues. Guided by these cues, we adopt LLMs to generate scientifically grounded problem statements, reference solutions, and tests, with failed generations iteratively repaired using execution feedback. By combining structured workflow composition with verification and quality review, SciWalker enables scalable task generation while promoting scientific grounding, computational diversity, and executability. Using this framework, we construct 8,178 high‑quality problems spanning 5 scientific domains and 32 subdomains. To evaluate their training utility, we conduct reinforcement learning on Qwen3.5‑9B using the GSPO algorithm. This training improves SciCode subproblem accuracy by 9.9 percentage points, from 29.3% to 39.2%, with gains across scientific code generation, code repair, and reasoning benchmarks. The code for SciWalker is available at https://github.com/lichenx1/SciWalker.
Authors:Ehsan Barkhordar, Surendrabikram Thapa
Abstract:
If a language model can recognize code it wrote, it may favor that code as a judge, and instances of one model monitoring each other could collude. We test this zero‑shot on current commercial models. Five LLMs generate solutions to MBPP, HumanEval, and DS‑1000, seven more to MBPP, and models act as evaluators in four tasks: picking their own solution from a pair, judging whether a single solution is their own, identifying which of two solutions a named model wrote, and judging quality blind. In the single‑solution task, balanced accuracy is 49‑58% for all 15 model‑benchmark combinations, while raw accuracy (38‑67%) mostly reflects how readily a model claims authorship. In the pairwise task, accuracy across 14 evaluator‑opponent combinations correlates at r=0.93 with how often the evaluator's solution is longer. Attribution to a named model succeeds on some pairs and is consistently inverted on others. A rule‑based normalization that strips docstrings, comments, type hints, and local names preserves Pass@1 and leaves ten of twelve re‑tested results at chance; the other two follow a length difference it leaves, although a trained classifier still separates most normalized pairs. Claude Haiku's self‑preference also disappears. We recommend reporting balanced accuracy, heuristic baselines, and label consistency.
Authors:Tapan Parikh
Abstract:
Language models advise people, keep them company, and write software while they sleep. Measuring what they do is hard: behavior has to be sampled repeatedly across models, prompts and releases, most of it lives in unstructured text that has to be coded before it can be counted, and the result has to be legible and rigorous enough to meaningfully compare models and vendors. To address these constraints, we present a simple, cheap, scalable, and replicable model for studying model behavior. Each study is a frozen, public stimulus run identically on a cross‑vendor panel, at a few dollars per model or less. Each reads its transcripts one of three ways, chosen by how much interpretation the behavior needs: exact match on a clamped reply, a codebook applied by LLM judges whose agreement with a human coder is reported per code, and an instrumented environment that records what an agent did independently of what it said. Run across four years of model releases from both frontier and open‑source labs, these instruments find four things. Convergence: asked to pick a word, 27 of 44 models answer serendipity at least once in four tries. Resistance: a trailing "right?" moves endorsement by up to 32 points, and the sign flips from sycophantic to resistant as generations advance, keyed to the tag's surface form. House: whether a model holds a position under pressure tracks its generation, and how it holds tracks the lab that built it. Account: told to do something the documentation in their repository contradicts, some coding agents never went along silently and others always did, and the same model can change with the harness it runs in. Re‑run on every release, batteries like these track how behavior is changing across vendors and over time.
Authors:Xun Huang, Shijia Zhao, Rongsheng Qu, Jiayuan Li, Xin Lu, Weixin Li, Chenglu Wen, Cheng Wang
Abstract:
Does progress on spatial reasoning benchmarks translate into better navigation? Existing benchmarks test isolated inferences from images or videos, with little connection to downstream navigation. Our analysis reveals a gap between benchmark‑oriented spatial specialization and navigation performance, and shows how aligning spatial supervision with navigation goals, phases, and decision learning improves navigation. Guided by these findings, we build \textscSpatial‑Nav‑100K and fine‑tune in two stages, i.e. first learning a shared spatial‑navigation foundation, and then specializing each phase with the abilities it relies on. We further introduce Spatial‑NPD, where a teacher conditioned on spatial priors produces grounded action preferences and distills them into a student policy, so no explicit spatial reasoning is needed at inference. With 45 A100 GPU‑hours of policy training, our 8B model reaches SR/SPL of 77.4/35.4 on HM3D‑v0.2, 60.2/30.5 on HM3D‑v0.1, and 47.9/20.6 on train‑unseen MP3D. It outperforms several systems that rely on closed‑source models or thousands of GPU‑hours of training, at 148 ms per action step. All code and datasets will be publicly available at https://github.com/ylwhxht/Spatial‑Nav.
Authors:William Teo
Abstract:
Multi‑robot coordination methods often score a joint plan from singleton and pairwise terms, leaving out the terms that involve three or more robots. We measure the plan‑selection regret of two pairwise approximations to delivered coverage using frozen multi‑robot trajectories. For each four‑robot plan on an indoor exploration benchmark, replaying all 16 robot subsets gives the exact delivered‑coverage set function F. From the same subset values we compute two pairwise scores: the exact order‑2 Möbius truncation F_2, which depends only on the singleton and pair values, and an equal‑weight least‑squares two‑additive fit G. Ranking by F_2 instead of F changes the selected plan on six of seven maps at the 15 m candidate‑generation range in each of two candidate families, with regret up to 0.337 of map coverage. Switching to G reduces the regret but still changes the selection on three of seven maps in each family. The additive score F_1, which keeps only the singleton terms, selects the exact winner on six of seven maps in one family and four of seven in the other, against one of seven for F_2. We also find that lower average reconstruction error does not guarantee lower selection regret.
Authors:Tingyu Qu, Weigao Sun, Yuecheng Liu, Yucheng Zhao, Yi Zhu, Yifeng Ding, Qiyi Wang, Sihan Cao, Pengkun Jiao, Hanlei Xie, Xiongwei Wu, Qichao Wang, Haodong Zhang, Jiajun Liu, Yuhao Wang, Yuqing Xie, Junpeng Zhao, Long Chen, Ming Ma, Sihan Yang, Ziwang Zhao, Yanhao Jia, Liangquan Gong, Feida Zhu, Yiran Zhong, Steven Hoi
Abstract:
The rapid progression of large language models is extending AI from passive content generation into the active workflows of engineering and scientific discovery. This shift raises a compelling question: can AI be both the object of development and an active participant in building next‑generation AI systems? We explore this question by building Qwen‑Planner‑Agent within a closed‑loop AI‑for‑AI framework for scalable development and iterative improvement. Mobile planning offers a demanding test of this approach: complex, long‑horizon tasks challenge agent reliability, while costly real‑device interaction limits development scalability. The framework connects data production, model training, and deployment through a shared action‑feedback‑verification contract. (i) AI for Data builds a human‑gated agentic data flywheel in which specialized agents construct tasks, collect interaction trajectories, curate and balance training data, and use training feedback to guide subsequent data generation. (ii) AI for Training combines a supervised planning cold start with hybrid‑environment online agentic reinforcement learning, where we introduce Competence‑Aware Reward‑and‑Advantage Engineering (CARE) to reduce reasoning and tool‑use costs while preserving task performance. (iii) AI drives model‑‑harness co‑evolution through an execution‑evidence‑driven loop that orchestrates memory, skills, and tools at runtime and feeds structured action feedback and preserved failure traces back into coordinated model and harness adaptation. Qwen‑Planner‑Agent achieves the best overall performance among all evaluated models and systems on MobilePA‑Bench, improving over its base model across tool use, memory, skills, and sub‑agent coordination. Further evaluations of our model show improvements across non‑mobile agentic benchmarks while largely preserving general capabilities.
Authors:Hongyao Deng, Wenhao Guan, Xuetao Lin, Peijie Chen, Weijie Wu, Lin Li, Qingyang Hong
Abstract:
Recent non‑autoregressive (NAR) zero‑shot text‑to‑speech (TTS) models generate in parallel but typically require the target sequence length to be specified before generation. We introduce EditVoice, to our knowledge the first variable‑length NAR zero‑shot TTS model, which uses Edit Flows to jointly update speech content and sequence length through insertions, deletions, and substitutions. EditVoice adopts speech‑infilling training, which unifies zero‑shot TTS and text‑based speech editing and allows both prefix and suffix speech prompt placements at inference. We introduce Complementary Prompt Sampling (CPS) to leverage the complementary Edit Flow predictions induced by the two prompt placements. We further find that EditVoice can edit source and model‑generated speech beyond its training sources. We use this generalization for end‑to‑end editing and training‑free post‑generation refinement. With the Edit Flow model trained on 10K h of GigaSpeech, EditVoice demonstrates competitive zero‑shot TTS performance on Seed‑TTS Eval EN and LibriSpeech‑PC and speech editing performance on RealEdit.
Authors:Amit Nautiyal, Ayush Bhatt, Gaurav Nautiyal
Abstract:
We present ChunkRank, an open‑source Python library that derives chunk boundaries from a target model's tokenizer and context window, and selects an answer among candidates produced independently per chunk. It ships a validated registry of 90 models across 15 providers and six answer‑selection methods, and needs only three core dependencies. For chunking, ChunkRank avoids context‑window overflow automatically from the model name, whereas character‑based splitters overflow or waste the budget, and a fidelity study across 11 languages shows why token‑exact budgets matter beyond English. For answer selection we report a negative result: on NaturalQuestions, TriviaQA and HotpotQA, with extractive and generative readers, no content‑based ranker reliably beats taking the first non‑empty answer. The reason is reader abstention on chunks that lack the answer, not answer position. A long‑context baseline shows that chunking matches single‑call reading on single‑hop questions, so ChunkRank targets small‑window and beyond‑window settings. Code, registry and evaluation harness are released.
Authors:Xiaohan Yuan, Xuan Yang, Qingya Li, Yangang Wang, Lei Li
Abstract:
Patient‑specific 4D myocardial reconstruction from cine MRI supports quantitative functional assessment, regional motion analysis, and simulation‑based modeling. However, routinely acquired short‑axis (SAX) cine MRI is sparsely sampled along the through‑plane direction, making dense and anatomically consistent surface reconstruction challenging. In this study, we propose an anatomy‑aligned surface learning framework that parameterizes the epicardial and endocardial surfaces on a shared circumferential‑longitudinal UV domain. This formulation converts irregular 3D reconstruction into structured coordinate‑field completion with explicit correspondence across subjects and cardiac phases. Sparse SAX contours are encoded as UV observation fields, coverage‑aware sampling improves robustness to incomplete slice coverage, and topology‑ and distortion‑aware learning preserves circumferential continuity and local surface quality. Experiments on three public cine MRI datasets showed that the proposed method consistently outperformed representative mesh‑based and implicit reconstruction approaches, achieving overall Chamfer distances of 2.887~mm on ACDC, 2.641~mm on M\&Ms, and 2.810~mm on M\&Ms‑2. The reconstructed sequences also preserved ventricular function, with end‑diastolic volume and ejection fraction errors of 3.3~mL and 1.1 %, respectively. These results demonstrate that anatomy‑aligned UV learning provides an accurate, efficient, and correspondence‑aware representation for sparse cine MRI reconstruction and myocardial modeling. The source code will be available at https://github.com/yuan‑xiaohan/SAX2MyoSurf.
Authors:Tomohiro Motoda, Masaki Murooka, Keisuke Shirai, Hanbit Oh, Ryoichi Nakajo, Shotaro Miwa, Roman Mykhailyshyn, Hugo Duarte, Yukiyasu Domae
Abstract:
Robotic imitation learning often relies on external cameras, yet local interaction cues such as object proximity, contact onset, and grasp state are difficult to observe near the fingertips because of occlusion and limited temporal resolution. We study how to effectively incorporate complementary fingertip sensing into imitation learning using pressure‑sensitive tactile and reflective proximity sensors, along with pretrained sensor encoders. The two modalities provide information at different manipulation phases: proximity sensing is informative before contact, whereas tactile sensing becomes informative after contact. However, naively adding these signals to a policy does not consistently improve performance and can even underperform vision‑only policies, suggesting that sparse, phase‑dependent sensor signals are difficult to exploit from limited demonstrations. We therefore propose a proprioception‑anchored pretraining method, PROprioceptive‑and‑PRoactive Anchoring (PROPRA), which independently aligns each fingertip sensor history with proprioceptive and action segments. This provides a continuously available sensorimotor reference, allowing each sensor to be aligned independently during its informative phases. Experiments on real‑world manipulation tasks show that our pretraining method improves average success rates over vision‑only policies and image‑anchored pretraining baselines. Representation analysis further shows that it preserves richer information about pre‑contact states, enabling more effective use of complementary fingertip sensing. Please refer to our project page: https://tomohiromotoda.github.io/nia.propra/
Authors:Zhiyu Xu, Weilong Yan, Yufei Shi, Shiyang Li, Yihao Liu, Kin-Man Lam, Yuewen Cao
Abstract:
Recent years have witnessed major progress in joint audio‑video generation. Existing models still suffer from limited per‑modality fidelity, insufficient text‑modality alignment and weak cross‑modal synchronization. While reinforcement‑learning post‑training offers a promising remedy, directly adapting it to joint audio‑video generation is challenging. Heterogeneous multimodal rewards entangle learning signals and complicate credit assignment. Joint optimization of two modality towers is computationally expensive given their divergent dynamics. Moreover, synchronization evaluation difficulty depends on paired samples, preventing fair reward comparisons. We propose AV‑GRPO, a modality‑anchored online diffusion RL framework, and 5DAV, a decoupled, difficulty‑controllable training dataset. AV‑GRPO includes three key modules: (1) modality‑anchored rollouts to disentangle learning signals and stabilize difficulty; (2) trajectory‑locked frozen‑tower optimization to reduce cost and reassign credit; (3) adaptive objectives and perturbation strengths tailored to modality‑specific dynamics. This converts coupled multimodal preference learning into unimodal subproblems for precise reward attribution and better synchronization. Our 5DAV dataset decouples samples across five dimensions for systematic training. Experiments on JavisBench and VABench demonstrate AV‑GRPO outperforms LTX‑2.3 in generation quality, semantic alignment and cross‑modal synchronization under LoRA and full fine‑tuning. Ablations confirm our designs. Code and data: https://github.com/zhiyuxu03/AV‑GRPO
Authors:Zhiyuan Ma, Wenbo Hu, Wang Zhao, Pengfei Wang, Ying Shan, Lei Zhang
Abstract:
Despite recent advancements in 3D generation, models often struggle to produce assets with high visual fidelity. To bridge this gap, we propose OREO, an alignment framework that enhances the realism of 3D generators by leveraging rich 2D diffusion priors. Instead of relying on static datasets, OREO establishes a dynamic optimization loop that produces on‑the‑fly edited renderings as 2D pseudo‑targets. At its core, we introduce Reinforced Editing, which utilizes a 2D model to refine rendered views of the 3D output, enhancing their overall visual fidelity while preserving the underlying geometry, viewpoint, and content. These refined views serve as high‑quality supervision targets, enabling the 3D generator to learn from its own generated samples and progressively improve its visual quality. Experiments demonstrate that OREO effectively improves upon pre‑trained baselines, producing 3D assets with enhanced visual realism.
Authors:Esmail Abdul Fattah, Hatem Ltaief, Håvard Rue, David E. Keyes
Abstract:
Sparse direct Cholesky solvers fix one data structure for an entire matrix, but symmetric positive definite systems range from nearly dense to irregular, sometimes mixing both within one matrix. We let the data structure follow the sparsity structure, across matrices and across tiles within a matrix. Before numerical work starts, a lightweight selector captures the sparsity pattern of the Cholesky factor and routes the matrix, on one static shared‑memory schedule, to one of three regimes: dense, sparse, or an intermediate semisparse regime. Dense tiles are stored in full; the semisparse regime uses a new active‑column tile that keeps only the columns the factorization will touch, so banded or arrowhead‑shaped structures common in spatial models still reach BLAS‑3 efficiency. The approach suits the integrated nested Laplace approximation (INLA): one sparsity pattern factorized thousands of times with different values, so the one‑time analysis cost is amortized and every factorization saving compounds. We evaluate the technique on 60 SPD matrices, comparing against MUMPS, PaStiX, CHOLMOD, symPACK, and Intel oneMKL PARDISO on Intel Xeon and AMD EPYC nodes; the selector alone achieves the lowest total factorization time in every regime. Summed over the suite, it beats the best fixed single‑structure mode by 1.6 to 2.6x, and every alternative by 1.8 to 12.5x on Intel and 2.6 to 10.1x on AMD, with the largest gains on the most expensive factorizations. It trades more one‑time analysis for less time per factorization, pulling ahead by the third factorization of a given pattern. As a first GPU extension, the dense route on one NVIDIA A100, with the factor resident on the device, runs 1.2 to 6.3x faster than on the faster CPU node, the margin widening with factor size. Solver, Python/R/Julia interfaces, benchmark suite, and results are open at https://github.com/esmail‑abdulfattah/sTiles.
Authors:Surbhi Kumar, Yuhe Zhou, Varun Shiralkar, Niu Huang, Baris Coskunuzer
Abstract:
Ligand‑based virtual screening (LBVS) is a practical first‑pass tool in early‑stage drug discovery, but existing benchmarks can overestimate performance through random negatives, easy decoys, limited target coverage, and non‑standardized evaluation protocols. We introduce TopU‑LBVS, a multi‑target benchmark for LBVS under hard‑negative screening conditions. Starting from curated ChEMBL~35 bioactivity data, TopU‑LBVS covers 93 protein targets across 7 protein classes and constructs target‑specific screening libraries with property‑matched, structurally similar decoys at a fixed 1:40 active‑to‑decoy ratio. Libraries contain roughly 400 to 10,000 compounds and are designed to reduce simple physicochemical and nearest‑neighbor fingerprint shortcuts. TopU‑LBVS provides three fixed protocols. TopU‑LBVS‑full evaluates ChEMBL^\ast \rightarrow TopU generalization across all 93 targets. TopU‑LBVS‑low evaluates low‑data TopU \rightarrow TopU learning within the hard‑negative distribution. TopU‑LBVS‑mini provides a compact seven‑target protocol with a paired random‑decoy control that changes only the test decoys, enabling low‑cost development and direct measurement of the gap between random ChEMBL^\ast and TopU decoys. Across ten reference baselines spanning fingerprint methods, molecular GNNs, fingerprint hybrids, and modern molecular models, performance under random‑decoy evaluation degrades sharply under hard‑negative screening. We release data, fixed splits, evaluation code, and baseline implementations for reproducible comparison of future LBVS and molecular representation learning methods. Code and data are available at https://github.com/topu‑benchmark/topu‑lbvs and https://huggingface.co/datasets/topu‑benchmark/topu‑lbvs.
Authors:Xueshu Chen, Yan Wang, Zihao Xue, Jiefu Li, Zhenfang Liu, Jayden Chen, Zhen Bi, Jungang Lou
Abstract:
Long‑horizon tasks require preserving and later recovering cross‑session evidence under a bounded, query‑blind memory budget. Existing compression can discard fine‑grained visual cues or conflate semantically similar but incompatible observations. We present C3M, a cross‑session multimodal memory organization that maintains a bounded active index over persistent source text‑image evidence. Relation‑aware updates consolidate safe redundancy while preserving complementary and incompatible records. At query time, budgeted routing selects useful index pages and expands their associated source evidence under a fixed reader budget. Together, these mechanisms establish a compact, provenance‑preserving multimodal memory organization for cross‑session long‑horizon tasks, retaining temporal distinctions and source links required for reliable downstream reasoning. Code is available at https://github.com/HuzhouNLP/C3M.
Authors:Louis Yiven Zhu
Abstract:
An LLM judge scores a bank of responses against a rubric, and the reliability comes back at 0.52. What has been measured? Judge evaluation has begun borrowing reliability statistics from classical test theory, usually without stating the measurement design each statistic assumes, and we show that three widely portable ones mean something different for a judge than for a test because the judge setting rearranges the roles those designs rest on. First, an internal‑consistency coefficient computed over rubric elements contains no scorer facet. Holding one judge's measured error rate fixed at 4.72%, KR‑20 still ranges from 0.01 to 0.68 as the item bank is redesigned around it, and varying judge error moves the coefficient by a comparable amount, so item design and judge error are not separately identified and no single value can be read as a property of the judge. Second, the dependability index Φ(λ) is a ratio of variance components, and the classification probability with which it is sometimes identified differs from it by 0.25‑0.43 on our bank and by 0.17‑0.30 on simulated data where the underlying model holds exactly. Third, Livingston‑Lewis accuracy is indexed to an examinee's own true score on the same instrument, so scoring it against external gold conflates judge unreliability with criterion invalidity. Reviewing the three closest judge‑evaluation papers, we found no published instance of these errors, which makes the caution prospective. A coefficient that cannot be attributed to the judge nonetheless travels downstream into deployment decisions and disclosure documents. We therefore close with four reporting lines that keep the attribution attached to the number.
Authors:Qiming Guo, Jinwen Tang, Xingran Huang, Hung-Yu Lin, Yafu Zhong, Xiatian Zhuang
Abstract:
Artificial intelligence helps education most where an essential provision has been rationed by cost. For language learners that provision is a teacher's voice, which binds listening, reading, speaking, and writing into one act. Published evidence shows why most learners lack it, from a global shortage of 44 million teachers to heavy household tutoring bills, and why technology has not substituted for it: computer‑assisted language learning proved effective but narrow, applications presuppose connectivity 2.6 billion people lack, and One Laptop per Child's randomized evaluation found that hardware without capable software teaches nothing. We distill eight difficulties and four binding constraints, and argue that small open‑weight models dissolve the last: a complete four‑skill stack now fits a \200‑class laptop and, on community measurements, generates at the pace speech is consumed, for about one US cent of electricity per study hour. We therefore propose LLMersion, a scheme for AI for education that runs entirely at home, over the learner's own documents, with an AI‑written, AI‑understood, AI‑updated codebase anyone can customize; present LLMersion‑1, a released open‑source prototype (https://github.com/QM378/LLMersion); and outline the vision of a private learning agent.
Authors:Kyle Wild, Yusuke Takahashi, Asako Uraki
Abstract:
Most agentic question answering (QA) systems do an important part of their semantic work at the worst possible time: every time someone asks a question. When a corpus contains revisions, drafts, revocations, deletions, and sources with different levels of authority, the model must reconstruct the governed current state on every read ‑ then throw that work away and repeat it on the next query. This is a bit like a database that rebuilds a materialized view every time someone reads from it. We present ingest‑time fact compilation, an architecture that performs this work when corpus data is ingested or changed. Raw passages are rephrased into self‑contained facts; rules governing revisions, deletions, effective dates, and source trust are resolved once; and the resulting state is stored as typed records carrying source and revision provenance. At query time, an inexpensive model reads the compiled record instead of reconstructing it from noisy candidates. In a controlled synthetic experiment across five seeds, the same low‑cost model produced the correct value, source, and revision in only one of 30 trials under query‑time reconstruction, but in all 30 trials from the compiled substrate, at 12.89 times lower mean read cost per question. On simpler revision questions both architectures were exact, but the compiled path used 21.6 times fewer tokens. A separate test found that fact rephrasing roughly halved verbose Federal Reserve dialogue while preserving high source entailment, but left concise Wikipedia prose essentially unchanged. These results support a narrow but practical claim: resolving a corpus state once can make subsequent QA cheaper and more reliable for inexpensive models. We release the open source, MIT‑licensed implementation and experimental artifacts.
Authors:Abdelrahman Abdallah, Mohammed Ali, Adam Jatowt
Abstract:
Reasoning‑intensive retrieval remains difficult for small models. Compact public ColBERTs are usually trained on general‑purpose corpora and underperform reasoning‑tuned 150M+ baselines on BRIGHT~\citebright by several nDCG@10 points. However, no public reasoning‑tuned ColBERT exists at edge scale. We introduce SmallReason‑ColBERT, a 32M late‑interaction retriever that closes much of this gap with three components: a varied‑length contrastive warmup on ReasonIR‑VL, a hard‑negative contrastive polish on merged ReasonIR‑HQ and BGE‑Reasoner data, and a single‑layer per‑query‑token importance head trained on top of the frozen base. The head is trained with an un‑normalised weighted MaxSim score and evaluated with its length‑normalised form. In a controlled re‑training, replacing this training objective with the symmetric normalised score causes the loss to stall and costs 3.59 nDCG@10. The full recipe reaches 21.41 mean nDCG@10 on BRIGHT, within 1.21 of the 150M Reason‑ModernColBERT (22.62) and above all \le 33M ColBERTs we evaluate. Through ablations on capacity, initialisation, and score variants, we further show that the learned head outperforms fixed IDF weighting and that simply thresholding the learned gates is harmful. https://github.com/DataScienceUIBK/SmallReason‑ColBERT
Authors:Mahmoud Abdalla, Abdelrahman Abdallah, Shaimaa Sedek, Adam Jatowt
Abstract:
Oblique retrieval, as exemplified by OBLIQ‑Bench, asks a retriever to find documents whose relevance is determined by a latent attribute (an implicit stance, an analogous reasoning technique, an authorial fingerprint, or a vague tip‑of‑the‑tongue recollection) that has little or no surface expression in the document. State‑of‑the‑art dense encoders and agentic search pipelines built around frontier language models exhibit a large first‑stage bottleneck on these tasks, while the same language models reliably verify relevance when shown candidates. We address this with OBLIQ‑IR, a single‑vector dense retriever whose training mixture combines per‑mechanism synthetic queries with a new form of cross‑model supervision: kNN‑graph distillation from a frozen authorship encoder, which transfers a style‑versus‑topic inductive bias into the student. A 3B retriever fine‑tuned reaches 0.211 NDCG@10 on Writing‑Style, 0.171 on Math, 0.177 on Twitter, and 0.281 on Congress, improving over the GPT‑5.2 Multi‑Hop Agent by \xr0.010 to 0.150 NDCG@10 and over Gemini‑2‑Embedding by 0.027 to 0.222 NDCG@10 on every reported task. The code, data and checkpoints are available https://github.com/DataScienceUIBK/obliq‑ir
Authors:Amir Taherin, José Cano, Bin Ren, Yanzhi Wang, David Kaeli
Abstract:
Video object detection on edge devices runs computationally expensive detectors over long frame streams, causing high energy consumption and sustained GPU utilization. Although consecutive frames are highly redundant, naive frame skipping is content‑blind: it skips during critical moments such as object entry, occlusion recovery, and abrupt motion, degrading detection quality. We present Albireo, a detector‑agnostic, codec‑free adaptive inference framework that wraps off‑the‑shelf detectors and decides when detector invocation can be safely skipped based on scene content and per‑object temporal state, requiring no detector modification or retraining. Albireo maintains a 10‑dimensional Kalman filter (KF) per active object and invokes the detector only when prediction uncertainty exceeds a threshold; on skipped frames, boxes are predicted from the KF state at near‑zero GPU cost. A KF‑based rescue mechanism preserves confirmed objects through brief detector misses to prevent output fragmentation, while a lightweight empty‑scene screen avoids detector calls on objectless frames. We evaluate Albireo on the BDD100K MOT validation split with three architecturally distinct detectors (YOLO11x, YOLO26x, RF‑DETR‑Large) on two NVIDIA Jetson platforms (AGX Thor, AGX Orin). Across all configurations, Albireo keeps AP@50 within +/‑1.2 pp of per‑frame inference while reducing total energy by 12.1‑17.6%. On YOLO26x, it improves AP@50 by +0.8 pp while reducing energy by 17.6% (Thor) and 14.4% (Orin) and per‑frame energy‑delay product by 24.9% and 26.1%, respectively. Thus, the default operating point improves accuracy, energy, and latency together. In contrast, FixedSkip‑2, a fixed‑interval baseline with a 50% skip rate, loses 8.6 pp AP@50. Source code, evaluation pipeline, and per‑clip results are available at https://github.com/amirtaherin/albireo
Authors:Roberto I. Ono Filho
Abstract:
Verified search, in which a language model proposes programs, a hard evaluator scores them, and selection keeps the best, has recently moved mathematical records; controlled ablations of the proposer‑side components remain rare. We instrument a minimal FunSearch‑style loop at office scale (a 30B local model on a laptop, 120‑600 verified samples per run) with three operator packages: a schematic notebook the model writes and carries instead of verbatim elites, a named obstacle, and behavioural repulsion from constructions already found. On nine construction problems from a public repository, the complete 2^3 factorial with two replicates favours the primary contrast in a nominal two‑stage analysis: the composition closes more of the seed‑to‑record gap (+0.196; nominal pooled p=0.023, stage‑combination p~0.08; median per‑problem effect +0.045). Repulsion raises construction‑hash diversity everywhere (p=0.0039; partly a manipulation check). The factorial finds no positive memory‑by‑repulsion interaction (bounded to about +/‑0.04); the gain decomposes additively, and memory+repulsion is the only arm that never collapses (0 of 18 runs), within 0.025 of the full composition. A frontier proposer under the identical loop reaches in tens of samples what the local model does not in hundreds; in single scoping runs its gains arrive without the operators. The search stalls after closing ~92% of the gap on the flagship problem, and the registered family‑hint test gives the stall its first reading: named in words, the reference family is adopted and loses; handed as code, it is optimized, but our best finite‑grid implementation remains below the plateau reached unaided. The loop transported and optimized the idea it was handed; no unaided run produced it. We release the harness, every candidate, and the dated pre‑registrations.
Authors:Ali Abusaleh, Bhuvanesh Verma, Alexander Mehler
Abstract:
We present TTLab's submission to the AlexandriaX‑2026 Subtask~3 on Arabic MT error span detection and classification. Our system frames the task as token‑level classification over surface forms, preserving character offsets to ensure exact alignment with the evaluation metric. To handle severe label imbalance, we employ a focal loss with class weighting and dialect‑specific decoding thresholds. Among six Arabic pre‑trained encoders, MARBERTv2 achieves the best overall performance of 40.8 and 40.91 on the development and test set, respectively, ranking \nth3 out of all participating teams. While our system localizes error spans effectively, classification of rare error types remains challenging, highlighting the need for data augmentation for tail categories. The code is available at \hrefhttps://github.com/ENTAILab/arabic‑dialectal‑mt‑error‑span‑detection\faGithub~ TTLab at AlexandriaX‑2026
Authors:Thiago César Castilho Almeida, Daniel Carlos Guimarães Pedronette
Abstract:
Recent topic models leverage pretrained embeddings, but neural architectures produce latent representations without grounding in specific texts, and clustering‑based pipelines assign representative documents only post hoc, relying on absolute distances distorted by hubness and anisotropy in high‑dimensional spaces. We introduce MARETopic, a training‑free framework that casts topic discovery as rank‑based prototype selection. After projecting embeddings onto a low‑dimensional manifold, MARETopic builds ranked lists encoding ordinal neighborhood structure. A greedy algorithm selects exactly K exemplar documents, real corpus texts, whose neighborhoods cover the corpus. Two variants share this criterion. MARETopic_\textCorr scores candidates with a query performance predictor and a rank correlation measure, leading Purity and NMI on the two benchmarks with the most categories, ahead of both neural and clustering‑based topic models. MARETopic_\textDiff scores them with a rank‑based diffusion matrix, needs neither measure, and runs 1.7 to 1.9 times faster. Without a single gradient update, MARETopic leads topic coherence on two of three datasets. A novel inter‑topic Maximal Marginal Relevance step raises vocabulary diversity at little cost in coherence. Our code is available at https://github.com/thcastilho/maretopic.
Authors:Christos Koutsiaris
Abstract:
We report an exploratory, single‑seed ablation of TALH (Adaptive Latent Hybrid), a decoder‑only language model with parallel Multi‑head Latent Attention (MLA) and a custom recurrent state‑space (SSM) branch. Five variants, spanning 117‑‑217M estimated active parameters per token, are trained from scratch on a FineWeb sample for the same number of optimisation steps and tokens. In this specific setup, removing the SSM branch gives the largest degradation in validation perplexity (MLA‑only PPL 315), whereas removing MLA has a much smaller effect (SSM‑only PPL 239). A dense‑FFN hybrid obtains PPL 231, compared with 240 for the tested top‑2 ternary‑MoE hybrid, while using 3.87 GB less peak training memory. We also preserve a preliminary Apple M3 timing observation: among the five unoptimised implementations, MLA‑only has the flattest measured time‑to‑first‑token curve from 512 to 2,048 prompt tokens, although the dense Transformer is much faster in absolute terms. Because the runs are single‑seed, parameter counts are unmatched, the evaluation stream may overlap the training source, and raw repeated timing records are unavailable, these results support implementation‑specific hypotheses rather than general conclusions about MLA, SSMs, or mixture‑of‑experts models.
Authors:Naren Akash, Anirudh Kaushik, Jayanthi Sivaswamy
Abstract:
We present a modular and multi‑level framework for the differential diagnosis of malignant melanoma. Our framework integrates contextual information and evidence at the lesion, patient, and population levels, enabling decision‑making at each level. We introduce an anatomic‑site aware masked transformer, which effectively models the patient context by considering all lesions in a patient, which can be variable in count, and their site of incidence. Additionally, we incorporate patient metadata via learnable demographics embeddings to capture population statistics. Through extensive experiments, we explore the influence of specific information on the decision‑making process and examine the tradeoff in metrics when considering different types of information. Validation results using the SIIM‑ISIC 2020 dataset indicate including the lesion context with location and metadata improves specificity by 17.15% and 7.14%, respectively, while enhancing balanced accuracy. The code is available at https://github.com/narenakash/meldd.
Authors:Hanbing Liang, Fujun Liu
Abstract:
We establish a uniform inf‑sup stability estimate for the Scott‑Vogelius finite element spaces on uniform Freudenthal tetrahedralizations of the unit cube for polynomial degrees k >= 4. This result completely settles the first conjecture of Farrell, Mitchell, and Scott for the critical degrees k = 4 and k = 5, complementing the known stability range for higher polynomial degrees. The main mathematical difficulties stem from the complex topological compatibility required at the singular vertices and the corresponding mean‑value constraints across adjacent elements. We tackle these challenges by developing a unified barycentric skeleton‑bubble calculus that explicitly constructs vertex jets, edge modes, and face transfers to globally route element means. The accompanying exact computations independently verify these finite‑dimensional identities and provide reproducibility data.
Authors:Florian Rascoussier
Abstract:
The Time‑Dependent Vehicle Routing Problem with Time Windows (TDVRPTW) captures a central difficulty of urban logistics: travel times vary with the time of day, so the cost of a route depends on when it is driven. This paper introduces KAYROS, an open‑source solver for the duration‑minimization TDVRPTW that is both anytime and exact. It returns improving valid solutions throughout its time budget and can close instances with optimality certificates through an integrated branch‑price‑and‑cut component. We extend the composition of continuous arrival‑time functions from the literature, previously described only at proof or proposition level, to the left‑continuous functions that stepwise benchmarks require. We prove that the composition routine shipped in the checker computes that operation exactly. We analyze when its evaluation and breakpoint normalization are exact in IEEE‑754 double‑precision arithmetic, and argue that a canonical, epsilon‑free checker must define the objective. The anytime layer combines greedy construction, granular time‑dependent local search over balanced route trees, and iterated local search, with a fleet‑aware descent for a fleet‑cost objective. We further propose an anytime evaluation methodology based on a normalized signed primal integral under a pre‑committed statistical design. On 212 instances from five families at a one‑hour single‑threaded budget, KAYROS achieves a pooled anytime score 63.3% lower than the strongest of three available contenders (Timefold, Hexaly, jsprit). All three contrasts are significant under Holm correction. KAYROS improves all 30 high‑effort references of Blauth et al. and 10 literature best‑known solutions, and publishes 704 computational optimality certificates. The solver, benchmarks and campaign data are openly released.
Authors:Tianxin Zhou, Ruixi Lin
Abstract:
Text‑to‑SQL systems are increasingly deployed on production databases, where queries that pass benchmark evaluation can still produce results that distort downstream workflows. Standard set‑based execution accuracy (Set‑EX) collapses duplicate rows and can therefore miss multiplicity errors, including missing DISTINCT, inflated aggregates, and Cartesian‑style join explosions. We call this the Multiplicity Blind Spot (MBS) and introduce Multiset‑EX, a multiplicity‑preserving evaluation criterion that exposes such failures. Across released DeepEye‑SQL artifacts from three backbones (Qwen2.5‑Coder‑32B, Qwen3‑Coder‑30B‑A3B, and Gemma‑3‑27B) on executable BIRD‑Dev N=1532, we find a consistent 5.81‑‑6.79 pp gap between Set‑EX and Multiset‑EX. The gap is not specific to DeepEye‑SQL: it persists on released DAIL‑SQL+GPT‑4 (5.22 pp) and BIRD GPT‑3.5‑turbo (3.39 pp) predictions. We further introduce ModularSQL, a lightweight post‑selection runtime guardrail that probes executed results for multiplicity anomalies and applies deterministic patches or low‑cost LLM rescue only to flagged queries. Integrated with DeepEye‑SQL using Qwen3‑Coder, ModularSQL preserves Set‑EX at 72.06% while improving Multiset‑EX from 65.86% to 67.75% (+1.89 pp). It flags 77 high‑risk anomalies, while adding only 0.0076 in total LLM cost and 120 ms amortized latency per query. Cross‑pipeline evaluation shows that the candidate‑free detector and deterministic patches also transfer to independently released prediction sets. Overall, these results show that benchmark accuracy does not necessarily imply execution‑safe SQL, and that lightweight, multiplicity‑aware runtime guardrails can narrow this gap with modest computational overhead.
Authors:Navaneetha Krishnan Kamalakannan, Harinisri Velmurugan
Abstract:
Spectrum governance requires rules to be translated into machine‑executable decisions while preserving incumbent protection, regulatory authority, and an auditable record of why a decision was made. We present SPECTRA‑GOV, a Tri‑Layer Adaptive Governance Architecture (TLAGA) connecting international treaty coordination, national adaptive licensing, and real‑time enforcement. The work builds on the original reference implementation preserved at v0.1.0‑paper and adds a post‑audit evaluation layer rather than replacing it. V2 introduces controlled spectral‑contention scenarios, corrected geodesic‑distance calculation, per‑operator selective authorization, paired baseline counterfactuals, policy perturbation, regulatory‑change analysis, and causal provenance. Across 10,000 scenarios in each of seven contention classes, incumbent protection was 100.00% in the no‑contention control, 99.92‑99.87% in weak‑to‑dynamic classes, 99.47% under strong overlap, and 90.00% in the adversarial close‑proximity class. In a paired S3 baseline experiment, selective authorization achieved 100% incumbent protection and 89.43% access opportunity, while the population‑wide dynamic baseline achieved 99.91% protection and 99.53% access. Identical results for the dynamic‑SAS and SPECTRA‑GOV selective variants mean selective admission alone is not claimed as an exclusive algorithmic novelty. The contribution is the integration of policy representation, computational enforcement, auditability, provenance. Enforcement timing was measured in‑process, with mean latency increasing from 0.028 ms for one operator to 1.682 ms for 500 operators; these are software benchmarks, not field measurements. The results establish a reproducible computational governance prototype and identify remaining questions before operational or regulatory claims can be made.
Authors:Shuaishuai Cao, Min Huang, Meng Tang, Xuan Liu, Youjin Wang, Hui Lin
Abstract:
Referring segmentation in overhead imagery is inherently relational: a query may ask for the buildings north of the road or the pond closest to a residential area, so the correct referent can contain one object, several objects, or none. Existing benchmarks mainly score mask overlap, which cannot verify whether a model actually resolved the stated spatial relation. We introduce GeoRefer‑Bench, a benchmark for verifiable geospatial referring segmentation. Each query is represented by an executable logical form over a metric scene graph, and predictions are evaluated with Exact Query Success (EQS), which is satisfied only when the returned instance set exactly matches the set denoted by the query. GeoRefer‑Bench contains 700 whole 2048x2048 UAV scenes (2.94 Gpx) at 12.5 and 25 cm ground sampling distance, 26,217 instances, 142,796 spatial relations, and 20,916 executable queries spanning five reasoning levels. It further includes three paraphrases per query, 24.0% unanswerable queries, 2,477 counterfactual pairs, and five leakage‑controlled evaluation splits. An independent audit re‑derives object geometry, mask ownership, relation values, query execution, and split provenance, finding zero issues across all 700 scenes. Relation‑blind strategies can retain non‑trivial mIoU while achieving at most 22.7 EQS overall, showing that overlap alone does not certify relational grounding. Across fifteen current models, the strongest reaches 74.1 EQS but drops from 98.9 at level 1 to 60.5 at level 5, while ten models score below 5 EQS on two‑hop queries. GeoRefer‑Bench turns geospatial referring segmentation from mask matching into verifiable reference resolution.
Authors:Chuanjin Fan, Wenjie Chang, Aibing Li, Bingzhou Wang, Wenfei Yang, Tianzhu Zhang
Abstract:
Reconstructing dynamic meshes with consistent topology from multi‑view temporal images remains a challenge. Existing approaches typically face a dilemma between fine‑scale shape recovery and topological stability. Frame‑by‑frame extraction methods capture fine details but break vertex correspondence, leading to flickering meshes. Conversely, template‑based deformation ensures consistency but struggles to adapt its surface resolution during optimization, missing local surface details. To address these limitations, we propose ToCo‑Mesh, a dynamic reconstruction framework that maintains topology consistency over time while achieving high‑fidelity geometry. Specifically, we introduce a dual‑mesh representation, where a canonical template mesh is tightly bound to time‑varying coarse guide meshes via barycentric parameterization. While keeping guide meshes fixed to condition the deformation, we perform error‑driven split‑and‑merge on the template mesh to progressively increase reconstruction fidelity. Furthermore, to suppress surface irregularities and achieve photorealistic rendering, we incorporate a Surface‑Aligned 2DGS module. By anchoring flattened Gaussians to mesh faces, we utilize their rendered normals to guide inverse geometric fine‑tuning. To our knowledge, ToCo‑Mesh is the first framework to enable adaptive mesh refinement while maintaining strict topological consistency. Extensive experiments demonstrate that our method achieves SOTA geometric accuracy while maintaining competitive rendering quality.
Authors:Wenjin Liu, Chenxi Wang, Jiapu Wang, Zhe Cui, Anh Tuan Luu, Haoran Luo
Abstract:
Reinforcement learning (RL) and on‑policy distillation (OPD) are two representative paradigms for improving large language model reasoning. However, when no correct trajectory is sampled, RL lacks a positive correctness signal, while OPD remains constrained by the reasoning trajectories reachable under the student's on‑policy distribution. Therefore, we propose CataOPD, where the teacher acts as a catalyst rather than a target, expanding reachability while internalizing verified student‑produced trajectories into a catalyst‑free policy. Self‑Rescue Routing uses empirically all‑failed groups as routing signals rather than teacher‑intervention triggers, first seeking correct trajectories through additional on‑policy self‑sampling. For problems unresolved after self‑rescue, Catalytic‑Guided Self‑Resolution uses catalytic guidance to elicit a verified student‑produced trajectory in the guided student distribution. Barrier‑Weighted Internalization weights tokens by guided‑to‑unguided log‑probability gaps, focusing updates on decisive tokens difficult without guidance. Experimental results show that CataOPD outperforms current baselines, extends independent student reasoning to still‑unrecovered problems, and improves out‑of‑distribution generalization under catalyst‑free inference. Our project is available at https://github.com/QwenQKing/CataOPD.
Authors:Wenjin Liu, Fayuan Ke, Yue Lu, Zhe Cui, Anh Tuan Luu, Haoran Luo
Abstract:
Existing methods for improving text‑to‑image generation quality have progressed from generator fine‑tuning and prompt optimization to reinforcement learning with multi‑turn visual feedback. However, existing strategies are deeply coupled with specific generators and tasks, and the learned capabilities are difficult to generalize into a universal quality optimization policy. Therefore, we propose AdaPilot, which learns a scene‑adaptive, cross‑generator transferable quality optimization policy by formulating multi‑turn image generation as a Markov Decision Process (MDP) and optimizing it via end‑to‑end reinforcement learning. Specifically, AdaPilot decouples the policy from generator internals to enable cross‑generator transfer, introduces scene‑aware rewards that adaptively align quality assessment dimensions with task semantics, and employs process‑level rewards to model the evolution trajectory of image quality. Experimental results show AdaPilot outperforms baselines in generation quality and generalization. Separate cross‑generator evaluations further show that a single policy transfers zero‑shot to unseen generators while maintaining positive average gains across all evaluated generators. Our project is available at https://github.com/QwenQing/Ada_pilot.
Authors:Nicolás Vera Zúñiga
Abstract:
Two accounts of neural text degeneration coexist. One locates the cause in the training data ‑‑ repetition in the corpus produces repetition in the output, established by training on repetition‑sorted data ‑‑ the other in the trained network, in copying circuits and repetition features. Neither has been arbitrated across a broad cohort of pretrained models: the causal work trains its own. We report an observational measurement in a different currency: the fixed‑point structure of a model's own short‑window argmax map, censused from 96 random two‑token starts over 17 off‑the‑shelf models, always unprompted ‑‑ a companion paper shows nine tokens of conditioning move this readout across most of its range. The four‑way class is stable across census seeds on 17 of 17. Three exhibits. At fixed corpus (The Pile), fixed scale and that fixed domain, the class is not determined: across two size‑matched tiers, pythia is a funnel while RWKV, Mamba and a second transformer family are not, and both hold their class across an order of magnitude of scale. Six of seven models in that ladder reach the same endpoint token, and those concentrating on it most strongly are among those that never stay there ‑‑ what varies is not where trajectories go but whether the destination self‑continues. The deduplicated Pythia suite does not change the class. And the corpus‑side inflow term proposed for this phenomenon does not select our endpoints once frequency is controlled, in English and three other languages. This is observational and cannot refute a training intervention. Funnels are common: eight of seventeen models, seven families, five corpora ‑‑ so the limit is not that the phenomenon is one model's peculiarity, but that within the one corpus where training data can be held fixed only one available family funnels; that subset cannot show the split is corpus‑independent.
Authors:Jaron Yeh, Yen-Wei Chang, Jiang Liu, Shao-Yuan Lo
Abstract:
Industrial anomaly detection (IAD) is evolving beyond conventional detection and localization toward multimodal inspection systems that can describe, explain, and reason about fine‑grained defects. Although recent multimodal large language model (MLLM)‑based methods improve anomaly understanding through textual reasoning and visual guidance, they face two limitations in fine‑grained inspection. First, their visual refinement often requires iteratively revisiting local image regions or augmenting with additional tools. Second, the resulting local defect evidence may not be reliably preserved throughout subsequent reasoning. To address these, we propose Anomaly‑LR, a defect‑grounded latent reasoning framework that first forms a global understanding of the input and then progressively refines anomaly‑relevant representations directly in the visual latent space. We further construct IAD‑LR‑22K, the first IAD instruction dataset designed for latent reasoning, containing 22,228 image‑question instances from 4,523 industrial images, with global textual reasoning traces and region‑level visual annotations. Extensive experiments show that Anomaly‑LR achieves state‑of‑the‑art performance among comparable‑scale methods across multiple IAD benchmarks, without requiring external references or tools. The code and data will be released at https://github.com/Yen666/Anomaly‑LR.
Authors:Xingyu Wu, Yuchen Yan, Zhengxi Lu, Siqi Chen, Xin ZHANG, Aiting Liu, Chao Deng, Jie Liu, Jin Ma, Jian Shao, Jun Xiao, Yongliang Shen
Abstract:
Deep search requires LLM agents to decompose complex queries, search for evidence, and synthesize grounded answers, yet existing ReAct‑style agents suffer from two limitations: role coupling, where one policy must handle planning, evidence use, and synthesis; and context accumulation, where growing search histories introduce noise and obscure useful information. To address these issues, we propose IterSynth, a role‑decoupled and summary‑based paradigm that alternates between a Planner for identifying information needs and a Synthesizer for integrating evidence into an evolving summary state. This design separates planning from synthesis while using the summary as the persistent state of search, reducing both capability coupling and context noise. To train IterSynth effectively, we further introduce Role‑Decoupled Policy Optimization (RDPO) for reinforcement learning, which combines terminal outcome rewards with turn‑level rubric evaluations and computes role‑specific advantages for more precise credit assignment. Experiments on five long‑horizon deep‑search benchmarks such as BrowseComp and Xbench‑DS show that IterSynth‑8B achieves an average score of 50.7, surpassing the strongest prior \leq8B agent by +4.2%. Moreover, IterSynth serves as a model‑agnostic prompting paradigm, delivering substantial zero‑shot gains over ReAct and similar prompting paradigms on frontier proprietary models.
Authors:Ruoqi Guo, Yi Liu, Gelei Deng, Yuekang Li, Lida Zhao, Yutao Wu, Simin Chen, Ying Zhang, Leo Yu Zhang
Abstract:
Detectors of alignment failures screen deployed language models and score alignment benchmarks. Most are generative judges that spend a decoding pass on every criterion, and classifiers that read token probabilities, such as Llama Guard, still score one fixed label per call. Jev, a model trained with reinforcement learning for calibrated decisions (RLCD), answers many typed questions about one input with calibrated probabilities in a single call. Whether it detects alignment failures has not been measured. We present RLCDAlignBench, which benchmarks Jev on ten alignment failures: sycophancy, jailbreaks, deception, prompt injection, hallucination, privacy violation, social bias, reward hacking, concealing uncertainty, and power seeking. It spans 44 benchmarks and five target models, labelled by each benchmark's scorer and, on two, by humans. Many of these failures are relational, defined against a reference, such as the user's belief or an injected instruction, that the response alone does not reveal. Our key idea is therefore to vary what Jev is asked separately from what it sees: the question's wording and answer type on one side, the fields of the input on the other. A single generic question reaches a median AUROC of 0.886 zero‑shot and beats supervised baselines on most benchmarks. Question wording matters little, while context matters more, mostly through fields that encode the label. Jev matches the reference scorer's agreement with human labels, surfaces label defects in existing benchmarks, and costs 63x less than LLM‑judge scorers. Code and data: https://github.com/sumleo/RLCDAlignBench.
Authors:Gautam Veldanda
Abstract:
Ternary (1.58‑bit) weights are attractive for microcontroller‑class language models, but the sub‑1M‑parameter regime rests mainly on isolated, single‑seed comparisons. One prominent example reports that a routed ternary block (convolution, diagonal SSM and sparse attention mixed by a per‑token router) beats a parameter‑matched full‑precision transformer by 22% at 60K parameters, attributing this to inductive bias. We re‑run it under one fixed recipe, three seeds per cell, 98 byte‑level runs on one laptop. (i) Baseline shape dominates: at a 16M‑byte budget, param‑matched transformers span 22.6% in validation loss purely by depth/width choice ‑ far more than any architecture effect we measure there ‑ and the best‑shaped transformer ties the routed model, so the published margin is at least partly a baseline‑shape effect; the ordering of shapes reverses with budget, so no single fixed shape can be trusted. (ii) At 130M bytes the routed model does win, by 22.2‑24.0% over the three transformer shapes we evaluate there ‑ but a plain gated diagonal‑SSM block beats it by a further 9.1%, and the routed model's own router puts most of its weight on its recurrent pathway, so the gain does not require routing. (iii) The ternary penalty differs by architecture at the larger budget (+5.3% best transformer vs. +19.5% routed, +28.1% gated SSM), but we cannot attribute that to architecture alone: our transformers keep learned positional embeddings in full precision, 11‑22% of their parameters, so they are less quantized than the models they are compared with. (iv) A 90/10 full‑precision‑then‑ternary schedule beats all‑ternary training, but only at a stage‑2 learning rate about 10x the pretraining peak; at a conventional fine‑tuning rate it looks 15.3% worse, reversing the conclusion. The from‑scratch baseline was not itself learning‑rate tuned, which bounds (iii) and (iv). Code and run logs released.
Authors:Santo M. A. R. Thies, Juan C. Alfaro, Viktor Bengs
Abstract:
The partial label ranking problem is a supervised learning scenario that aims to fit a preference model that predicts a bucket order defined over a set of labels for a given input instance. This problem generalizes the well‑known label ranking problem, which, in practice, is limited to outputting total orders of labels. Existing partial label ranking methods have primarily extended label ranking approaches to handle ties in predictions. This paper proposes using multi‑output regression to address the partial label ranking problem, introducing an encoder that, during the learning phase, transforms the (possibly incomplete) rankings with ties of labels to multivariate regression targets, an underexplored perspective in both label ranking and partial label ranking. Moreover, during the inference phase, we introduce several post‑hoc layers that convert the multi‑output regression results into the output bucket order to effectively implement this approach. This framework provides learning strategies that are competitive with the current state‑of‑the‑art partial label ranking methods, as demonstrated through experimental evaluations.
Authors:Yakoub Bazi, Sarah Aljuhani, Mohamad M. Al Rahhal, Mansour Zuair, Naif Alajlan
Abstract:
Automatic 12‑lead electrocardiogram (ECG) classification requires representations that jointly capture local waveform morphology, long‑range temporal dynamics, and cross‑lead dependencies, yet integrating these properties within a single efficient architecture remains challenging. This paper introduces a hybrid CNN‑SSM‑Attention backbone for 12‑lead ECG classification. A convolutional stem performs early waveform tokenization and temporal reduction, mixed state‑space and depthwise‑convolutional blocks model temporal dynamics and local morphology, and a late self‑attention stage enables global token interaction at reduced resolution. To improve transfer from unlabeled data, we further develop an ECG‑oriented Joint‑Embedding Predictive Pretraining (JEPA) framework. Unlike ViT‑based JEPA methods that mask patch tokens before the encoder, the proposed method samples span masks at the latent temporal resolution and projects them back to the waveform domain, then predicts clean latent targets from a momentum encoder without waveform reconstruction. Experiments on CPSC2018, Chapman‑Shaoxing, and PTB‑XL, with pretraining on approximately 350K unlabeled CODE‑15 recordings, show that the proposed backbone provides strong supervised baselines under a compact parameter budget. JEPA pretraining further improves transfer, particularly in reduced‑label settings and under both full fine‑tuning and LoRA‑based adaptation. Code: https://github.com/yakoubbazi/Hybrid_ECG_Jepa
Authors:Kwok-Ho Ng, Tingting Song, Bingwen Feng, Zhihua Xia
Abstract:
The acoustic front‑end determines which forensic cues a speech deepfake detector can exploit. The wavelet scattering transform (WST) provides stable multiscale coefficients with explicit coordinates, yet direct flattening obscures the parent relation between paths. We introduce WST‑Graph, reconstructing these paths as a sparse modulation‑carrier grid for an AASIST graph backend. Modulation‑level normalization and length‑aware adaptive local attention pooling produce fixed relative‑time representations while retaining the acoustic axes before learned adaptation. This yields a waveform‑to‑graph interface with a fixed, parameter‑free WST. Our configurations remain competitive with AASIST while using approximately 60% fewer trainable parameters and show clear gains on selected out‑of‑domain benchmarks. These results underscore the value of preserving parent‑child relations within the carrier‑modulation topology when constructing a compact, physically grounded interface for graph‑based speech deepfake detection. Code will be released at https://github.com/saki‑ciallo/wst‑graph.
Authors:Jeremy Canale
Abstract:
Enterprise governance requires decisions, evidence, and accountable authority; it does not require every review task to retain its current human implementation. We develop a task‑substitution framework for Digital Governance Frameworks (DGF), treating each gate as an executable contract. Substitution requires sufficient accessible information, valid decision and authority checks, and a reduction in total human work after exceptions, verification, correction, and maintenance are counted. We derive a residual‑work threshold and show why automating most cases can still increase labor. Forward deployed engineering connects these conditions to an architecture for agents, rule engines, evidence services, and escalation. DGF‑Bench supplies controlled evidence from 300 synthetic projects and 899 evaluable model‑project runs. Gemini 3.8 Flash, GPT‑5.6 Luna, and DeepSeek v4.1 Flash achieve strict gate success of 94.98%, 83.29%, and 74.18%; complete‑route success is 76.92%, 42.33%, and 24.67%. A deterministic control passes all 1,700 gates given the supplied rules and structured facts, locating the comparison in execution of a supplied decision kernel. Evidence audits and 135 repeated runs distinguish correct decisions from reliable execution. A document counterexample establishes an information‑sufficiency obstruction. These results support the technical feasibility of replacing human execution of specified governance‑review tasks with agents and software. The framework specifies a workforce test based on the complete human effort required at fixed output and quality; the present measurements concern review performance. Sources, dossiers, traces, and analyses are public.
Authors:Chongru Fan, Wentao Huang, Wei Wang, Zhenquan Ding, Jinqiao Shi, Wei Cai, Zhiyu Hao
Abstract:
Identifying the set of monitored websites in mixed encrypted traffic is challenging because an individual flow often provides only partial evidence of website identity. To address this challenge, we propose FlowAtom, which constructs shared prototypes, called Atoms, from flow representations without website labels. Specifically, FlowAtom pretrains a flow encoder on external unlabeled traffic and aggregates Atom responses across flows within each observation window into a fixed‑dimensional, permutation‑invariant representation for monitored website‑set prediction. Across Direct HTTPS, Trojan, and VMess, FlowAtom achieves micro‑F1 scores of 97.82%, 94.43%, and 93.92% in closed‑world evaluation, respectively, and consistently outperforms the evaluated baselines in open‑world evaluation on windows containing monitored visits. The code is available at https://github.com/aimafan123/FlowAtom.
Authors:Seungwoo Han, Ingon Chanpornpakdi, Motoi Noda, Puwadej Leelasiri, Ibuki Hiruma, Toshihisa Tanaka
Abstract:
Estimating electrocardiography (ECG) from a chest‑worn inertial measurement unit (IMU) enables continuous heart rate (HR) monitoring without the discomfort of electrodes. We propose TinyCardioUNet, a lightweight UNet that uses all six IMU axes without prior channel selection, refines its bottleneck with a graph neural network that encodes inter‑axis dependencies, and employs tensor decomposition with automatic variational Bayesian rank selection for parameter reduction. On a public dataset, TinyCardioUNet achieves an RMSE of 0.098 and a Pearson correlation coefficient of 0.677 with only 36.0k parameters and remains comparatively robust to additive noise, demonstrating accurate ECG reconstruction with a compact model.
Authors:Haodong Wang, Hezhen Hu, Wengang Zhou, Houqiang Li
Abstract:
In this work, we focus on photorealistic sign avatar modeling, which is crucial for effective communication with the Deaf community and is characterized by complex hand gestures and nuanced facial expressions. To this end, we introduce MVSign, the first multi‑view Chinese sign language dataset co‑designed with Deaf experts, featuring diverse gestures and rich annotations. For precise SMPL‑X annotation, we develop a hybrid fitting pipeline that produces accurate body, hand, and facial parameters and can also be applied to the monocular setting. Building on MVSign, we propose a decoupled sign avatar representation that isolates body, head, and hand components to capture complex articulations, together with a motion‑aware sampling strategy to handle motion blur and balance gesture diversity. Extensive experiments demonstrate that our method achieves high‑fidelity visual results on MVSign, particularly in detailed hand and facial regions, and generalizes well to in‑the‑wild monocular sign language videos. Project page: https://naaapi.github.io/PHOSA.
Authors:Yu-Ling Liao, Tzu-Chin Chiu, Zong-You Chen, Chi-Lei Tsai, Shao-Yuan Lo
Abstract:
Large audio‑language models (LALMs) expand language models to process and interpret audio, but also expose them to heterogeneous audio jailbreaks. We ask whether successful jailbreaks reflect failures to recognize harmful intent or failures occurring after such recognition. Layer‑wise probing reveals the latter: risk‑related information remains decodable from intermediate representations, yet the internal risk signal fails to translate into refusal in later‑layer processing. We identify this discrepancy as the risk‑to‑refusal gap. Building on this finding, we propose AEGIS, a detect‑then‑intervene defense whose mid‑layer risk gate selectively activates downstream safety adapters. Across six LALMs and three heterogeneous audio jailbreak benchmarks, AEGIS reduces the average unsafe rate from 17.9% to 0.4%, while causing only a marginal increase in over‑refusal on benign inputs. These results establish selective internal intervention as an effective path toward more robust refusal in LALMs. The code is available at https://github.com/azzzzliao/aegis‑audio‑defense.
Authors:Wenxuan Wu, Shuhan Zhang, Shuai Wang, Haizhou Li
Abstract:
Target speech extraction (TSE) typically trains a separate extractor per cue, and visual‑cue systems often need corruption‑matched training to remain robust under visual frame corruption. We show that one autoregressive LLM backbone, TSE‑Omni, can serve both temporally synchronous cues (lip movements, co‑speech gestures) and asynchronous cues (enrollment audio, text). TSE‑Omni is driven by next‑token prediction: each step predicts target speech semantic tokens from its own past outputs, which we term self‑enrollment, forming a continuous target‑speech context initialized by the enrollment cue (asynchronous audio or text, or a short visual prefix). This enables audio‑visual compensation: the model uses synchronized visuals when intact and its token history when visual frames are missing. Under clean visuals, TSE‑Omni matches strong discriminative and generative baselines (SpeechBERTScore 0.81 on VoxCeleb2 and 0.89 on LRS3 zero‑shot) with higher DNSMOS. On the same VoxCeleb2 test set, after a 2 s clean visual start, removing the remaining visual frames leaves SpeechBERTScore at 0.81. It remains usable under sparse overlap and multi‑speaker interference, and supports streaming inference. Project page: https://alexwxwu.github.io/tseomni‑main/.
Authors:Ziyang Zhang, Yubin Jing, Yuanhao Zeng, Yuyao Li, Haofan Wang, Yichen Gong
Abstract:
We find that language models can transfer capabilities through task‑unrelated text. Post‑training typically improves language models using task‑specific data. Prior work on subliminal learning shows that information about these updates can pass through unrelated generations, but has largely focused on traits or preferences using extensive teacher outputs. We introduce Active Taskless Distillation (ATD), which achieves capability transfer using only a single word from the teacher per prompt. ATD probes the behavioral shadow of post‑training by selecting prompts where the teacher and student's shared public ancestor is nearly indifferent between two ordinary words. A student initialized from this ancestor learns solely from the resulting prompt‑word pairs, without target‑task examples, teacher logits, or teacher parameters. In the primary coding experiment with Qwen2.5‑1.5B, 5,664nses yield a 5.34 pp gain on HumanEval+ over an exact nuisance‑matched control thadisrupts prompt‑resperiments showtransfer in scientific knowledge, commonsense reasoning, and reading comprehensins across additional model generations, sizes, and families. Functional analyses show that the learned sid composable, andthat its strength tracks the teacher's update strength.
Authors:Jiaping Xiao, Pingyuan Ji, Mir Feroskhan
Abstract:
Large language models can decompose mobile‑manipulation goals into long action sequences, but the resulting plans remain reliable only while their world context is current. A fixed scene description becomes stale when objects are discovered, moved, or completed while retaining every observation instead produces a growing history with redundant and conflicting state. To resolve this tension, we present an LLM‑guided planning framework ADM‑Planner with attention‑enhanced dynamic memory (ADM). Persistent workspace knowledge is separated from object‑centric state, asynchronous observations and action outcomes update that state, and a bounded retriever exposes only the entries that can affect the next decision. The LLM replans when an update invalidates the remaining plan. Across 1,500 task‑simulator episodes, the proposed ADM achieved 100% full‑task success in the 14‑container noisy dynamic setting, compared with 62% for static memory and 97% for unfiltered dynamic memory, while reducing the context‑size proxy by 95.8% relative to the latter. In a six‑episode live GPT‑5 Mini planner, both dynamic memory variants completed every mission, while ADM reduced provider‑reported input tokens by 14.4% and mean planner calls from 7.0 to 6.0. A separate 60‑trial PyBullet study retained 100% success for ADM, compared with 50% for static memory. Finally, the mobile manipulator with ADM‑Planner completed various missions in indoor and outdoor physical experiments while incorporating targets revealed after execution began. The results show that selective state maintenance with ADM, rather than prompt history alone, is a practical basis for long‑horizon planning in changing environments. Project page: https://xjp99v5.github.io/ADM‑Planner
Authors:Michael Neri, Archontis Politis, Tuomas Virtanen
Abstract:
Speaker distance estimators are trained almost exclusively on simulated room acoustics, because real recordings annotated with the true talker‑to‑microphone distance are scarce. We show that models trained this way transfer poorly. On three real corpora we evaluate, simply predicting the average distance of the corpus is more accurate than any learned model. Then, we ask how few labelled real utterances are needed to make a frozen, synthetic‑trained estimator useful, and study post‑hoc calibration maps that rescale its output without gradients or retraining. An analysis of the achievable error shows that what the calibration is not limited by the absolute accuracy of the estimator, but how well it orders utterances by distance, since a constant bias or a wrong output scale is removed exactly by the calibration itself. Balancing this against the cost of estimating each coefficient from few samples yields a criterion that accounts for which map wins on which corpus and at which annotation budget, together with a shrinkage variant that requires no hard decision. Our findings suggest selecting synthetic checkpoints by linear correlation with true distances rather than by absolute error. Code, datasets, and analysis are available at https://github.com/michaelneri/audio‑distance‑estimation.
Authors:Yusung Choi
Abstract:
The strong performance that modern semantic correspondence methods achieve at standard thresholds plateaus sharply at fine‑grained thresholds. We argue that this plateau stems not from the representational capacity of backbone features, but from a grid‑tied readout. Patch‑based vision transformers tokenize images onto discrete grids, introducing two forms of quantization error: querying nearest patch features instead of exact keypoints on the source side, and the absence of grid features representing precise ground‑truth locations on the target side. We quantify this quantization ceiling across all 499,188 keypoints in SPair‑71k: under the standard 448x448, patch‑14 setting, 84.9% of ground‑truth keypoints have no grid feature representing their precise location at PCK@0.01. This is a structural limitation at the representation level, independent of the matching strategy. We address this with ImCorr: Sub‑pixel Semantic Correspondence via Implicit Feature Decoding, which formulates correspondence estimation over a continuous feature field queryable at arbitrary continuous coordinates. A FiLM‑conditioned decoder is trained to embed sub‑pixel positional information into the feature field. Querying the field directly at exact keypoint coordinates theoretically eliminates representation‑level quantization error on the source side, while decoding onto a grid denser than the backbone grid substantially reduces quantization error on the target side. On SPair‑71k and AP‑10K (intra‑species, cross‑species, and cross‑family), ImCorr improves performance at fine‑grained thresholds (PCK@0.01‑0.05), achieving a 6.2 percentage point gain over the prior state of the art at PCK@0.01 on SPair‑71k. These results demonstrate that representational continuity is an effective solution for precise semantic correspondence. Code is available at https://github.com/YusungChoi/ImCorr.
Authors:Yoshinobu Obata, Yinlai Jiang, Hiroshi Yokoi, Shunta Togo
Abstract:
The human wrist exhibits adaptive stiffness modulability: joint stiffness anisotropy can be actively regulated through muscle co‑contraction. This functionality is essential for stable manipulation, yet the underlying morphological factors remain unclear. To identify these factors, we developed an anatomically accurate anthropomimetic soft robotic forearm comprising eight independently movable carpal bones interconnected by ligaments, 22 actuated muscles, and compliant fingertips. We measured wrist joint stiffness under four muscle activation patterns across three skeletal configurations: anatomically normal carpal bones, a fused proximal carpal row, and a geometric ellipsoidal skeleton. The stiffness ellipse exhibited low stiffness along the dart‑throwing motion (DTM) direction when finger muscles were activated, but high stiffness along the same direction when wrist and finger muscles were activated simultaneously. These results agree with previously reported human measurements, demonstrating that precise anatomical replication reproduces human‑like stiffness modulability. Fusing the proximal carpal row eliminated the low DTM‑direction stiffness under finger muscle activation, while the geometric ellipsoidal skeleton showed poor stiffness ellipse reorientation across all conditions. Carpal bone motion analysis revealed significantly opposing coupling patterns between wrist and finger muscles at the proximal carpal row, accompanied by a consistent but non‑significant trend at the midcarpal joint, providing a mechanical explanation for this modulation. These findings demonstrate that carpal bone morphology plays a dominant role in human wrist stiffness modulation and provide design principles for humanoid robot wrists.
Authors:Yijun Yuan, Weicheng Zheng, Weibang Wang, Minghui Qin, Chang Sun, Junhao Huang, Kenan Li, Anmin Liu, Yicheng Yao, Hang Zhao
Abstract:
We propose the Representation World Model (RWM), which learns states, transitions, and executable plans directly in representation space. Unlike existing world models that typically learn latent representations together with explicit dynamics models and perform planning through search, optimization, or policy‑based prediction, RWM directly incorporates planning into the learned representation geometry. RWM learns the representation geometry by applying inverse‑dynamics supervision locally along latent paths constructed from endpoint representations, requiring these paths to preserve task‑relevant state and transition information. At inference, planning is performed by directly constructing a latent path between the current and goal representations, with inverse dynamics used to recover the corresponding actions, without recursive rollouts or action‑space search. Experiments on continuous‑control benchmarks demonstrate the effectiveness of RWM for direct planning, while results on robotic manipulation further show its potential to extend to more complex embodied control tasks. These results suggest that planning directly in representation space provides a promising alternative to conventional world‑model planning.
Authors:Xin Wang, Wenhao Wu, Menghao Zhang, Zhi Wang, Kun Shao, Jian Luan, Yang Li, Qing Li, Shangding Gu, Huichi Zhou, Shuqing Shi, Fei Ni, Shuo Lu, Weicheng Meng, Kang Li, Jin Wu, Kang Zhao, Shangmin Guo, Gen Li, Yongqiang Tang, Zhizhong Zhang, Yuan Xie, Heng Qu
Abstract:
Physical AI aims to build embodied agents that perceive the world, understand and reason about it, and decide how to act. Yet the field has focused primarily on the last component: the action model that maps observations to low‑level controls. The prevailing training recipe can erode the perceptual and reasoning capabilities needed for robust behavior, leaving even strong action models vulnerable to scene perturbations and long‑horizon tasks. We introduce HarnessPAI, a model‑ and embodiment‑agnostic Harness framework for Physical AI that treats code as the executable and evolvable interface that organizes the underlying action primitive. The framework separates two timescales: within a rollout, it executes open‑loop at the program level, with a fixed program guiding and checking execution; across rollouts, it evolves closed‑loop, using execution feedback to revise the program and distill failures into reusable skills. Across desktop robot arms, household robots, a robot vacuum, and a legged walking agent, HarnessPAI improves on both pure action models and code‑as‑policy baselines without retraining the underlying model: a 61.6‑point gain over π_0.5 on LIBERO‑PRO and a 27.2‑point gain over WorldDreamer on RoboCasa atomic tasks. Once a program is selected, rollout execution requires no online high‑level LLM deliberation. Beyond execution, the converged program is also a cheap and reliable expert‑data collector, and fine‑tuning π_0.5 on collected expert data lifts success rate on LIBERO‑PRO by 38.8 points. Our results suggest that the frontier of Physical AI depends not only on stronger action models, but also on executable harnesses that integrate perception, task understanding and reasoning, and action execution into a unified, verifiable, and feedback‑driven system. Website: https://darwin‑agent.github.io/HarnessPAI
Authors:Xin Zhang, Xianyan Xie, Zhen He, Xijin Yin, Xingtong Lin, Bangbo Liang, Zequn Cheng, Peihao Huang, Guo Chen
Abstract:
Multi‑model LLM serving is moving toward shared MaaS clusters, where co‑hosted models compete for a fixed GPU budget while each model experiences time‑varying demand and must satisfy its own latency SLO. Existing LLM autoscalers remain largely model‑local: their signals expose local runtime activity or delayed latency outcomes, and their scale‑up or provisioning decisions do not directly determine how shared capacity should be allocated across competing models. We present the Token‑service‑share Rebalancing Engine (TRE), a control‑plane framework for hot‑switched multi‑model LLM serving. TRE introduces Token Service Share (TSS), a calibrated, demand‑normalized signal that estimates effective token service per active or queued request and yields a comparable health score across heterogeneous models and SLO classes. Guided by TSS, TRE coordinates bounded receiver‑‑donor capacity movement under a fixed GPU budget: it separates fast rescue from slower rebalancing and incrementally reallocates active replicas toward models with the largest calibrated service deficits. We implement TRE on a Kubernetes‑based hot‑switch serving stack without modifying the inference scheduler. Across seven LLM serving traces, TRE reduces P95 end‑to‑end latency by 11.9‑‑79.0% and P99 latency by 12.5‑‑72.6% compared with a state‑of‑the‑art KV‑cache‑based reactive autoscaler running on the same hot‑switch runtime. The gains hold on both targeted stress probes and production‑derived conversation/code traces, where TRE reduces P95/P99 latency by 50.8/63.7% and 79.0/72.6%, respectively. These results show that effective hot‑switched autoscaling requires not only fast replica actuation, but also calibrated service‑deficit signals and coordinated cross‑model capacity arbitration. Our code and artifacts are available at https://github.com/zxzx9898/Token‑service‑share_Rebalancing_Engine.
Authors:Ben Liang, Chao Sui, Junqi Bai, Yuan Liu, Chunlai Li, Xiubao Sui, Qian Chen
Abstract:
In aerial RGB‑‑IR object detection, effectively exploiting complementary information across modalities is critical for robust perception under complex illumination and environmental conditions. Existing multimodal detectors mainly focus on spatial‑domain interaction or frequency‑specific feature enhancement, while the cross‑modal interaction patterns of different frequency components remain insufficiently explored. Moreover, spectral discrepancy itself may contain both useful complementary cues and unreliable modality‑specific responses, making indiscriminate frequency fusion suboptimal. To address these issues, we propose FoCal, a frequency‑oriented framework for aerial RGB‑‑IR object detection. First, a Frequency‑Aware Dual‑Domain Calibration (FADC) module is developed to explicitly model frequency‑dependent cross‑modal interaction. Low‑frequency components are collaboratively consolidated into a shared structural consensus, whereas high‑frequency components preserve modality‑specific information through selective cross‑modal exchange. The resulting frequency‑aware cues are further transferred to the original feature domain to regulate cross‑modal calibration. Second, we introduce a Discrepancy‑Guided Spectral Modulation (DGSM) module, which characterizes cross‑modal spectral imbalance using confidence‑weighted relative amplitude discrepancy and transforms it into a bounded signed gate for adaptive enhancement, preservation, or attenuation of the joint multimodal spectrum. Extensive experiments on DroneVehicle, ESCVehicle, and ATR‑UMOD demonstrate the effectiveness of FoCal, yielding \mathrmmAP_50 values of 83.5%, 54.8%, and 64.6%, respectively. Meanwhile, with only 3.0M parameters, FoCal achieves 113.6 FPS while preserving leading detection accuracy, highlighting a favorable accuracy‑‑efficiency trade‑off. Code is available at https://github.com/universeliang/FoCal.
Authors:Yoomee Cho, Jisun Lee
Abstract:
In cross‑lingual zero‑shot text‑to‑speech, the accent of the reference leaks into the target speech. We propose accent analogy guidance (AAG), a training‑free sampler term that subtracts an accent direction estimated from the model's own predictions for one synthetic voice rendered in both languages, so the voice cancels and only the accent remains. By a blind LLM accent judge on real dubbing data, reweighting classifier‑free guidance between reference and text, and its variants, stay near one identity‑accent trade‑off curve; we score a method by its speaker similarity above that curve at equal accent (ΔSIM). Across four open TTS models AAG lies above the curve: on OmniVoice ΔSIM is +0.11 to +0.27 on three test sets (accent 3.51 to 4.28 on a 1‑5 scale at speaker similarity 0.29, where reweighting keeps 0.02); MaskGCT and CosyVoice 2 also lie above their curves, and on F5‑TTS it is more native than any reweighting setting. An LLM‑free language‑ID measure and a twelve‑listener panel agree. A premise test and the reach of a model's own curve indicate in advance whether and roughly how much AAG can gain, predicting the one model where it gains nothing (X‑Voice).
Authors:Jie Xu, Yongxin Yang, Ziyi Jin, Kangjin Yu, Hongjun Huang, Chao Han, Zhongpu Xia
Abstract:
LiDAR place recognition is a key front end for loop closure and global relocalization, yet indoor retrieval remains difficult when attitude or sensor mounting height changes between mapping and query sessions. Scan Context stores the maximum height in each polar cell; indoors, broad ceilings can suppress the lower and mid‑level geometry that distinguishes adjacent rooms and corridors. We present UpDown‑SC, a training‑free polar descriptor that first canonicalizes gravity and then represents two complementary surfaces: the upper envelope of lower/middle structures and the lower envelope of overhead structures. Their physical split is estimated once from a cell‑balanced map height distribution and reused by every query. A mask‑aware, non‑uniform two‑channel distance retains discriminative lower‑level evidence while limiting sensitivity to its cross‑session variation, without treating unobserved cells as zero‑height measurements. Conventional Scan Context shortlisting and circular yaw alignment are retained, so retrieved hypotheses directly initialize geometric verification. Experiments across repeated indoor sessions, mounting‑height changes, mixed outdoor‑to‑indoor trajectories, and an outdoor transfer sequence show more reliable first‑choice retrieval on the indoor and mounting‑height‑varied sessions. A paired test finds a significant gain over Scan Context on the in‑house sessions. UpDown‑SC also gives the best or second‑best F1max and AUPR under threshold‑based acceptance while retaining a lightweight CPU front end. Continuous replay confirms that the retrieved hypotheses support metric prior‑map localization. Code and evaluation artifacts: https://github.com/jiejie567/updown‑sc.
Authors:Nidhya Shivakumar, Ethan Ransing, Josh Zhang, Shamak Gowda, Kevin Yang, Miles Hua, Anika Agrawal, Justin Yu, Ken Goldberg
Abstract:
Accurate state estimation (tracing) of Deformable Linear Objects (DLOs) such as cables is a critical challenge for data centers, manufacturing, construction, homes, and surgery, where precise cable management directly impacts operational safety and efficiency. However, resolving the state of multiple monochrome cables amid foreground and background clutter poses challenges due to occlusions, overlap, and ambiguous crossings. We present Two‑way Routing And Cable Estimation (TRACE), which combines bi‑directional cable tracing with interactive perception primitives‑Divergence Push and Cluster Dilation‑to actively resolve ambiguities. Evaluation with 110 physical experiments suggests that TRACE can increase the percentage of cable length correctly traced in complex scenarios (with up to 4 cables and 40 crossings) from ~60% with the strongest prior method, HANDLOOM 2.0, to ~90%, outperforming RT‑DLO, Nano Banana Pro, and ChatGPT 5.2 as well. For a trial run on a workstation with an NVIDIA GeForce RTX 4090 GPU, the average computation time is 0.4 seconds per cable. Project website: https://trace‑paper.github.io/.
Authors:Bowen Cui, Zhongchun Zhou, Hao Wu, Tejas Ramesh, Junyu Yin, Jialiang Gu, Keren Zhou
Abstract:
Tile‑based programming models, such as Triton and cuTile, aim to simplify high‑performance kernel development, but their practical performance, tuning behavior, and usability remain difficult to compare systematically. We present TileBench, a controlled benchmark for evaluating Triton and cuTile on NVIDIA B200 GPUs under matched operator semantics and comparable implementation structures. TileBench contains 45 operators covering diverse AI‑kernel patterns and memory/computation behaviors. Each task provides a PyTorch reference, verified Triton and cuTile implementations, standardized data‑types (dtype) and input‑size sweeps, default and autotuned configurations, roofline‑based metrics, and profiling‑guided diagnosis. Our evaluation shows that performance gaps are workload‑dependent: cuTile excels on a small cluster of Tensor‑Core/TMA‑friendly kernels, while Triton is stronger on many irregular, streaming, and bandwidth‑bound operators. We further evaluate LLM‑generated cuTile and Triton kernels and find that Triton is consistently more token‑efficient than cuTile under the same iterative refinement protocol. TileBench is publicly available at https://github.com/Deep‑Learning‑Profiling‑Tools/Tilebench.
Authors:Yan Zhan, Shaobo Liu, Qiunan Liu, Yuanjun Shi, Siqi Xu, WeiYi Hou, Xiang Xu, Zekang Li, Weizhou Pan, Jiahong Yan
Abstract:
Tool‑calling agents produce heterogeneous outputs, interleaving structured tool invocations with user‑facing natural language summaries. This output heterogeneity presents a structural failure mode in standard on‑policy Reinforcement Learning (RL): algorithms like GRPO indiscriminately broadcast a homogeneous trajectory‑level scalar advantage to all tokens. Consequently, gradient noise from summary generation leaks into tool‑decision tokens, causing cross‑segment credit misattribution and brittle optimization. In this work, we propose SLCA‑GRPO, a framework incorporating Segment‑Locked Credit Assignment (SLCA). To enable scalable exploration without costly real APIs and stable training, we first construct the Schema‑Guided LLM Simulator (SGLS) as foundational training infrastructure. Building on this, SLCA decouples advantage estimation at the structural segment level within a single group of rollouts, without requiring additional rollouts from intermediate states. Supported by Hierarchical Rewards (HierR), SLCA routes execution advantages to tool tokens and preference advantages to summary tokens, eliminating advantage contamination (the dominant cross‑segment credit misattribution channel) within each policy update. On a 7B backbone, SLCA‑GRPO accelerates convergence and outperforms standard GRPO, ToolPO, and RLTR by +2.53 pp on in‑domain evaluation, +1.36 pp on the Berkeley Function‑Calling Leaderboard (BFCL), and +9.15 pp on τ^2‑Bench under the same training budgets, achieving higher accuracy with reduced tool redundancy and costs.
Authors:Shamanthak Hegde, Xiangrui Liu, Maitreya Patel, Yezhou Yang
Abstract:
Unified vision‑language models (VLMs) that tokenize images through a vector‑quantized (VQ) codebook routinely hallucinate objects on grounded yes/no benchmarks, yet existing decoding‑time fixes treat this as generic miscalibration without an architectural account. Using activation patching across twenty‑five models spanning eight LLM families, we identify an early‑layer (L_0) attention routing circuit shared across VQ‑tokenized VLMs and propose a three‑gate diagnostic that distinguishes the models carrying it from those that do not. The diagnostic isolates ten positive models (five natural unified‑VQ VLMs across three LLM families and five induced variants) and rejects the remaining fifteen. A single‑variable architectural swap (LLaVA‑1.6 CLIP+MLP \rightarrow VQ+Linear) installs the circuit, while a matched‑compute MLP control on identical data does not, isolating vector quantization as the source of the pathological signal; the routing pathway that carries it is one that the backbone already provides. Against tuned VCD and DoLA baselines, tuned DoLA wins on binary calibration, but only L_0 ablation reduces object hallucination in open‑ended generation (CHAIR_i reduces by 31\,% relatively, whereas tuned DoLA and VCD leave it unchanged or worsen it). These results recast object hallucination in unified VQ VLMs as a property of architecture and pretraining, and yield a targeted intervention that mechanism‑agnostic decoding cannot replicate.
Authors:Musa Shams
Abstract:
Sparse activation reduces mixture‑of‑experts computation without eliminating the need to store all experts. We present Routide, a Swift/MLX runtime that executes the text path of a pinned public Qwen3.6‑35B‑A3B quantized checkpoint while keeping expert weights in iPhone storage and a byte‑budgeted subset in memory. We characterize cache‑policy sensitivity, numerical comparison boundaries, and measurement limits. Across five recorded 128‑token workloads, fixed‑route replay gives 0.00% demand hits with a 512 MiB LRU cache, 18.80% with seeded random eviction at the same budget, and 38.58% with 576 MiB LRU. The apparent capacity cliff is therefore a policy/workload interaction, not a universal memory requirement. Same‑runtime Mac controls preserve generated sequences across eviction and asynchronous prefetch, including 2,560 exact token comparisons and 10,334 speculative loads. In contrast, complete resident‑Python versus recorded‑phone sequences disagree on all five tested cases, precluding a general numerical equivalence claim. Two separately scoped iOS 27 memory protocols observe sampled process‑footprint peaks of 1.87‑2.32 GiB on short prompts and 2.39‑2.73 GiB on one longer prompt. We retain a thermal stopping event, negative timing comparisons, and a single qualified whole‑device power estimate. These results establish bounded feasibility and identify limitations that a deployment claim must not hide.
Authors:Shaohua Dong, Zexuan Meng, Haiyan Sun, Bing Fan, Cuicui Zhang, Dylan Joseph, Kewei Sha, Yunhe Feng, Heng Fan
Abstract:
In this paper, we propose RGBD20K, a novel dataset for facilitating the development of more robust and general RGB‑D semantic segmentation by encompassing abundant categories and high‑quality annotations. RGBD20K possesses several attractive properties: (1) Expanded Semantic Space. In particular, it covers 160 fine‑grained categories, largely surpassing the category diversity of existing popular RGB‑D benchmarks (e.g., NYUv2 with 40 classes and SUN RGB‑D with 37 classes). With such enriched semantic coverage, we expect to promote the learning of more generalizable segmentation models. (2) Larger Scale. Compared with current benchmarks, RGBD20K offers 20,000 RGB‑D image pairs, providing a substantially larger training resource that benefits the development of more powerful deep models. (3) High‑Fidelity Annotation. We perform rigorous re‑evaluation and correction of existing labels to resolve long‑standing annotation noise, resulting in a clean and reliable ground‑truth foundation. Furthermore, we propose a novel score‑purified fusion (SPF) method, which achieves state‑of‑the‑art performance across all evaluated benchmarks, demonstrating the effectiveness of our approach in leveraging high‑quality multimodal information for RGB‑D semantic segmentation. The dataset is here: https://github.com/ShaohuaDong2021/RGBD20K/.
Authors:Ziyuan Wang, Yunlong Shan, Fei Mo, Sichao Liu, David Navarro-Alarcon, Jia Pan, Kosta Jovanovic, Xin Jiang, Peng Zhou
Abstract:
Coordinated arm‑hand motion planning is fundamental to dexterous robotic manipulation in complex and constrained environments. A straightforward solution is to decompose the problem into separate arm path planning and hand motion generation; however, this poses a dilemma: decomposition can miss feasible solutions that require coordinated arm‑hand adaptation along the path. Alternatively, directly planning in the high‑dimensional joint arm‑hand configuration space captures such coupling but faces a substantially enlarged search space and nonconvex collision constraints. To characterize this coupling, we formulate feasible hand fibers that capture collision‑free hand configurations for each arm configuration. Based on this formulation, we propose CAMP, a high‑success and efficient cooperative arm‑hand motion planner for constrained environments. CAMP constructs candidate trajectories through layered hand search with local arm relaxation, then compactly represents them using endpoint‑preserving via‑point movement primitives (VMPs) for coarse‑to‑fine joint optimization. Across six constrained simulation tasks, CAMP achieves 84.2‑98.5% planning success, outperforming alternative planners with competitive efficiency. Ablation studies verify the contributions of arm relaxation, VMP representation, and coarse‑to‑fine optimization, while real‑robot experiments demonstrate CAMP on constrained manipulation tasks. The project website is available at https://camp‑armhand.github.io/.
Authors:Se Un Park, Yutae Kim, Junyoung Park
Abstract:
Post‑training quantization (PTQ) reduces the cost of on‑device text‑to‑speech (TTS), but published evaluations cover one system or method. We evaluate PTQ across TTS architectures under one protocol with three core models, weight and activation ablations of eight more, and two held‑out models quantized blind. Four‑bit per‑channel weights reduce UTMOS, a predicted mean opinion score, by 2.8 on Supertonic and 0.07 on Kokoro, and per‑tensor scaling can cause severe degradation even at 8 bits. The same bit width yields different outcomes, because the sensitive component is model‑specific and not reliably predicted from the model class. A staged ablation procedure identifies it, and per‑layer GPTQ can restore it to within 0.1 UTMOS. Real int8 and int4 kernels reproduce the simulated ordering at hardware‑dependent cost. On a Mac mini, a 4‑bit weight kernel runs Supertonic at 0.60x the fp32 latency while int8 is slower, so each configuration requires validation on the target runtime.
Authors:Xincheng Yao, Haobo Fu, Weiming Liu, Chongyang Zhang
Abstract:
Group‑based reinforcement learning (RL) methods, such as GRPO and its variants, have become a leading paradigm for training reasoning and agentic large language models (LLMs). While their group‑normalized advantage estimation is reliable at the response level, it becomes systematically biased at the step level, since coarse‑grained trajectory‑level advantages are hard to accurately reflect the contribution of individual steps (i.e, failed trajectories may contain valuable steps). Revisiting the foundational RL definition, we notice that GRPO's success on single‑turn tasks stems from its advantage estimation strategy, which adheres to the basic definition: the mean reward of multiple actions sampled from the same state constitutes a credible state‑value estimate. Extending the faithful estimation to step‑level would in principle demand sampling multiple actions from each intermediate state, which is too costly on a per‑state basis. To mitigate this issue, we propose a Graph‑based Faithful sTep‑level credit‑assignment framework (GRAFT) that grafts all rollout trajectories into a trajectory graph, recovering node state‑values via Bellman iteration on the graph, and assigning credit to each edge by the node value difference. Theoretically, the estimated step‑level advantage faithfully adheres to the basic advantage definition in RL. To further ensure the reliability of step‑level advantage estimation, we further propose Graph GAE, which extends GAE to the trajectory graph for reducing the impact of state‑value estimation bias. Experiments across a range of multi‑turn agentic benchmarks show consistent gains over GRPO and superior performance compared to recent agentic RL algorithms. Code will be available at https://github.com/xcyao00/GRAFT.
Authors:Yiyuan Lin, Cole Regnier, Yu Jiang
Abstract:
Outdoor robots require more than an accurate receiver and a path‑tracking law: the navigation system must preserve geometric consistency from geographic waypoints to actuator commands, expose measurement validity and timing, and respond to invalid or stale state information. This work presents a ROS~2 navigation stack with interchangeable single‑GNSS‑‑IMU and dual‑antenna‑GNSS localization front ends. Both provide a common local East‑‑North‑‑Up state interface for pure pursuit, virtual‑point cross‑track PID, finite‑horizon nonlinear model predictive control (NMPC), and a segment‑dependent hybrid dispatcher. The architecture specifies coordinate conventions, datum initialization, asynchronous state construction, waypoint geometry, controller equations, quality gates, command arbitration, and watchdog behavior. Independent physical field runs collected during 2025 and 2026 grape‑vineyard deployments support a balanced evaluation of 800 runs, with 100 runs for each of eight controller‑‑localization combinations on an approximately 199.6‑m route. The row‑hybrid mode yields the lowest run‑averaged post‑acquisition mean absolute cross‑track error (MAE) in the evaluated dataset: 0.00952~m with single GNSS+IMU and 0.00846~m with dual GNSS. These findings characterize deviations of the recorded positions from the reference route under the evaluated conditions. The open‑source navigation software and deployment instructions are available in the https://github.com/YiyuanLinXX/PPBv2/tree/main/PPBv2_Navigation.
Authors:Jason Lai, Chamuditha Jayanga Galappaththige, Niko Suenderhauf, Dimity Miller, Donald G. Dansereau
Abstract:
Radiance field representations such as 3D Gaussian Splatting (3DGS) natively encode complex visual phenomena such as occlusions and view dependence, but they are inherently underconstrained. Independently optimized reconstructions converge to different primitive configurations, even in unchanged regions. We introduce Plenoptic CharacterIstics (PlenoCI), a novel feature built from the plenoptic field these representations approximate. PlenoCI directly captures rich visual behaviors while ignoring Lambertian textures. By deriving closed‑form analytic plenoptic derivatives from a 3DGS representation, we efficiently detect these 5D structures. Our approach is robust to underconstrained representations by construction, reporting two orders of magnitude fewer false positives between independent reconstructions of unchanged scenes than concurrent work. We demonstrate PlenoCI's utility on change classification. First, we detect changes with an instance‑aware 3DGS pipeline, achieving state‑of‑the‑art results on CL‑Splats with a 25.7% mIoU gain over the strongest competitor, while remaining competitive on the more challenging PASLCD benchmark. Leveraging PlenoCI, we classify changes as geometric or appearance‑based with a balanced accuracy of 0.735, comparable to the best performing baseline. We believe plenoptic derivatives and PlenoCI open new directions for view dependence aware understanding in visually complex environments. Code and data are available at https://js0n‑lai.github.io/plenoci.
Authors:Md Maklachur Rahman, Md Hasan Al Banna, Saraf Anjum, Assame Arnob, Tracy Hammond
Abstract:
Textual descriptions can reduce ambiguity in medical image segmentation by specifying the finding and location to be delineated. Existing text‑guided methods mainly improve where image and language features interact but generally retain a single learned update pathway across all image‑text pairs. We propose MRSeg, a parameter‑efficient framework that uses each image‑text pair to route the adaptation of visual and textual features before dense prediction. Frozen ConvNeXt‑Tiny and PubMedBERT encoders provide multiscale visual features and clinical text tokens. A joint router uses the deepest visual feature and pooled text to predict a sparse mixture over low‑rank adapter bases. The resulting route is shared across separate adapter banks for two visual scales and text, coordinating their adaptation while keeping the feature‑specific parameters separate. Region Bridge uses text‑derived queries to aggregate dense visual tokens into latent regions, refines these regions through self‑attention and text cross‑attention, and redistributes the refined information back to the feature maps. Finally, a multiscale decoder combines refined semantic features with shallow image evidence. On QaTa‑COV19 and MosMedData+, MRSeg achieves 90.90/83.32 and 81.53/68.82 Dice/mIoU, respectively, with 7.11M trainable parameters and 7.60 GFLOPs. Code: https://github.com/maklachur/MRSeg.
Authors:Aman Anand, Partha Pratim Roy, Shivakumara Palaiahnakote
Abstract:
Scene text spotting remains challenging for arbitrarily shaped text instances such as curved signs and dense multi‑oriented characters in natural images, where tightly coupled architectures propagate localization errors directly into recognition failures. We present a two‑stage pipeline that combines multi‑encoder segmentation with vision‑language model recognition to address this problem. In the detection stage, six frozen vision encoders (CLIP, DINOv2, SigLIP, EVA‑CLIP, SAM, and ConvNeXt) extract complementary features spanning semantic, spatial, and texture spectra, which are fused through a trainable hierarchical Feature Pyramid Network with channel attention and decoded via a deep‑supervision Progressive Scale Expansion network to generate precise instance‑level text masks. By keeping the encoders frozen, their independently learned feature spaces remain orthogonal during fusion, preventing the feature homogenization that degrades boundary precision in single‑backbone detectors. The detection stage produces tight polygon masks that conform to the actual shape of curved and arbitrarily oriented text, rather than axis‑aligned rectangles that inevitably include background content. In the recognition stage, these polygon‑masked crops isolate the target text from surrounding clutter, allowing a Qwen3‑VL‑8B‑Instruct model, fine‑tuned via Low‑Rank Adaptation on polygon‑cropped scene text, to focus purely on reading the text without interference from neighbouring words or background noise. Without any synthetic pretraining data, our method achieves 91.99% detection F‑measure and 85.86% end‑to‑end H‑mean on CTW1500, setting a new state of the art and achieving strong performance on Total‑Text and ICDAR 2015 without any synthetic training data. Code is available at https://github.com/doubleblind‑afk/MEVL‑STP
Authors:Jie Yang, Zhengyu Fang, Zelin Xu, Jiarui Sun, Xiran Fan, Junpeng Wang, Liang Wang, Qinghua Liu, Yiwei Cai, Yan Zheng
Abstract:
On‑policy distillation (OPD) corrects a student on the responses it writes, but its signal is the teacher's next‑token distribution: it tells the student what the teacher says but misses how it thinks. Latent supervision promises the missing part by aligning the student's latent states to the teacher's. Recent methods such as OPRD bring this signal into on‑policy distillation. However, we observe two failures of this recipe when distilling Qwen3‑4B and Qwen3‑8B into Qwen3‑1.7B‑Base. Early gain, late collapse: latent supervision alone lifts MATH‑500 accuracy from 25 to 46 in 10 steps, but subsequent training degrades performance down to 11 with no recovery. Better alignment, worse behavior: although the alignment metric steadily improves throughout this collapse, the most aligned model turns out to be the worst performing. Further analysis suggests a mismatch in how the latent signal is applied: layers paired by depth play different roles in the two models, so continued alignment may pull the student toward teacher states it cannot understand. To address this, we propose LastOPD, which applies the latent signal only at the last‑layer state, the common interface both LM heads read, and only during a 10‑step crossfade into token‑level OPD. This keeps the useful part of the latent signal and hands the student to token‑level supervision before the collapse sets in. Extensive experiments show that LastOPD improves MATH‑500 over token‑only OPD by 5.55 and 4.02 points with the 4B and 8B teachers, leads on most held‑out datasets, and reaches the final score of token‑only OPD in about half the steps. Code is available at https://github.com/Muyiiiii/LastOPD.
Authors:Han Yan, Zishang Xiang, Haokai Jiang, Zeyu Zhang, Qilin Wang, Weiyu Guo, Yandong Guo, Boxin Shi, Hao Tang
Abstract:
World‑action models (WAMs) transfer visual and motion priors from pretrained video generators to robot control by jointly modeling visual dynamics and actions. Existing WAMs, however, predict dense future frames during training, repeatedly modeling largely unchanged content and coupling action‑conditioned dynamics to nuisance appearance variations. At inference, processing each complete observation with the heavy video expert bottlenecks few‑step action generation. Accordingly, we propose DeltaWAM, which jointly predicts visual deltas and actions using dense‑anchor, sparse‑delta, and action streams, with three architectures that differ in representation and computation sharing. We further develop Streaming Delta Memory (SDM), which updates cached anchor context with compact observed deltas, reducing heavy video‑expert processing. On RoboTwin, DeltaWAM with SDM improves average success over Fast‑WAM from 81.3% to 85.4% in the clean setting and from 75.8% to 83.9% under visual randomization. The three architectures reduce training FLOPs by 17.78‑23.77%, while SDM reduces one‑step inference latency and FLOPs by 36.57% and 31.55%, respectively; real‑world evaluations further show the highest overall success rate and normalized progress among the evaluated policies. Code: https://github.com/AIGeeksGroup/DeltaWAM. Website: https://aigeeksgroup.github.io/DeltaWAM.
Authors:Jack B. Jedlicki, Tanguy Dieudonné, Heng Yang
Abstract:
Long‑horizon manipulation often requires reasoning about state absent from the current view, such as a vanished object's location, temporal identity, or the contents of a shuffled container. We present OCC4M ("Occam"), an object‑centric 4D memory that maintains persistent tracks in a shared world frame and explicitly represents temporal, motion, and containment relations. A vision‑language model (VLM) queries this structured memory to select actionable targets for history‑free low‑level execution. Across seven simulation conditions and 350 episodes, OCC4M achieves 96.6% memory success and 88.9% end‑to‑end success, versus 54.6% and 57.7% for FrameSamp, a raw‑history VLM baseline using Gemini 3.7 Flash with the complete observation history and the same executor. In a controlled viewpoint‑transfer test, OCC4M maintains 100% memory and 98% end‑to‑end success after a viewpoint change, while full‑history FrameSamp falls to near‑zero success. On 20 fixed‑camera Franka episodes, OCC4M reaches 85% joint memory accuracy, versus at most 30% for FrameSamp across context sizes from K=16 to the complete history, and completes 45% of full two‑stage tasks. These results support explicit object‑centric memory for persistent spatiotemporal reasoning in long‑horizon manipulation. Qualitative videos are available at https://occ4m‑sup.github.io/occ4m‑supplementary/.
Authors:Kaiyang Li, Shaobo Han, Yue Tian, Shihao Ji
Abstract:
Audio‑language models (ALMs) can exploit textual shortcuts to answer questions while overlooking acoustic evidence, weakening audio understanding. On‑policy distillation (OPD) trains compact ALMs by supervising student‑generated responses with teacher predictions, but does not explicitly distinguish acoustic support from linguistic predictability. We propose Reward‑Tilted On‑Policy Distillation (RT‑OPD) to strengthen acoustic grounding. Given the same question and student‑generated text, a frozen teacher predicts the next token with and without audio inputs. Their log‑probability contrast defines a reward that reshapes the teacher distribution for reverse‑KL distillation, emphasizing the additional evidence provided by audio. Across two compact students and three benchmarks, RT‑OPD consistently outperforms Vanilla OPD. Experiments with silenced and replacement audio further suggest that RT‑OPD strengthens the student's reliance on acoustic evidence. Our 3B model achieves 72.72% accuracy on MMAU, the highest among the compared 3B models and competitive with several 7B and 8B models. Code and model checkpoints are available at https://github.com/KaiyangLi1992/RT‑OPD.
Authors:Rishabh Choudhary, Shreyansh Raj, Umesh Goyal, Shubh Kashyap, Shrestha Kumar, Sushovan Jena, Komal Kumar, Hisham Cholakkal, Aditya Nigam
Abstract:
An estimated 1 billion people worldwide live with vision impairment, yet current vision‑language models (VLMs) produce descriptions too vague for safe navigation by blind and low‑vision (BLV) users. Large VLMs can generate high‑quality audio‑description‑compliant narrations but cannot run on mobile devices; small VLMs offer competitive latency but lack spatial detail, directional cues, and hazard awareness for navigational assistance. We present Smol‑VL‑BLV, a compact VLM for blind and low‑vision users that closes this gap using a 500M decoder transformer model and two post‑training mechanisms: (1) teacher‑student distillation and (2) Group Relative Policy Optimization (GRPO) with a composite BLV reward targeting directional language, metric distances, and hazard detection. Because multi‑stage post‑training can induce catastrophic forgetting, we add a lightweight finetuning stage after the last stage GRPO finetuning to recover general descriptive quality while preserving BLV‑specific spatial grounding. Our best model substantially outperforms the baseline across various benchmarks, including tasks: VQA, BLV captioning, OCR, and latency. Compared with the baseline for relative improvement, it improves the Spatial score gain of 19.3%, and the Social score gain of 14.8%. It also increases OCR‑Bench by 101.5%, and raises TextVQA accuracy by 44.2%. These results show that BLV‑focused post‑training improves both accessibility‑specific spatial grounding and general visual‑text reasoning. Deployed on a mid‑range Android smartphone via Mixed‑Precision Quantization, the model remains approx. 450 MB and runs entirely on‑device, offline and without network dependency, generating descriptions with latency dependent on host hardware capabilities. Our model, dataset, and code is publicly released at https://smol‑vl‑blv.github.io/Smol‑VL‑BLV‑website/
Authors:Vinícius da Silva, Isabelle Melo, Matheus Bessa, Guilherme Schardong, Luiz Schirmer, André Araújo, Nuno Gonçalves, Hélio Lopes, Alberto Raposo, Luiz Velho, Tiago Novello
Abstract:
Encoding input coordinates with sinusoidal functions into multi‑layer perceptrons (MLPs) has proven effective for implicit neural representations (INRs) of surfaces defined as zero‑level sets. However, existing methods often struggle to balance training efficiency, rendering speed, and noise robustness: single‑MLP approaches are expensive at inference, grid‑based representations are fast but can limit surface smoothness and overfit input noise, and previous multiscale approaches frequently capture noise and produce artifacts due to hard spectral truncation. To address these limitations, we propose M‑plicits, a multiscale framework that models surfaces as a residual sum of MLPs trained via a sequence of nested neighborhoods. Unlike existing residual approaches that rely on standard domain‑wide sampling and require costly mesh extraction for visualization, our method strictly localizes supervision to narrow bands around the previous zero‑level sets. This nested design naturally provides robustness against noisy input data: the coarse network acts as a low‑pass filter that establishes a clean geometric prior, while subsequent residuals progressively refine the geometry without fitting to high‑frequency artifacts. We further introduce a multiscale sphere‑tracing algorithm and a GEMM‑based analytical normal computation that bypasses auto‑differentiation entirely, yielding high‑fidelity real‑time rendering. On Stanford and Thingi32, M‑plicits achieves the best mean Chamfer distance in the coarse configuration and the best median Chamfer distance and IoU in the fine configuration, with substantially better noise robustness than iNGP, BACON, and IDF, while using an order of magnitude fewer parameters than grid‑based baselines. Code, models, and data will be released at https://github.com/dsilvavinicius/m‑plicits.
Authors:Miroslav Lžičař
Abstract:
A virtual screening campaign may produce thousands of promising candidates, but only a small number can be purchased, synthesized, or tested. The practical question is how to select a set of compounds that both rank well and are diverse enough: this poses a genuine tradeoff, where selecting the highest‑scoring molecules yields limited diversity, while diversity selection sacrifices some well‑scoring molecules. We introduce OPDiv, a diversity selection and evaluation algorithm solving this tradeoff by finding an optimal subset of molecules using integer optimization. We demonstrate the selection algorithm in practice with fingerprint distance, shape and electrostatic diversity and compare the resulting diversity spectra. We argue that virtual screening is not merely a ranking problem, but also an implicit constrained optimization task: when redundant chemotypes are undesirable, pipelines should be compared based on the top‑k compound selections satisfying the desired diversity constraints. OPDiv makes it possible to find the optimal compound set under a given diversity threshold efficiently and serves as a fair benchmark of the best diverse selection achievable by a given structure‑based or ligand‑based virtual screening pipeline, molecular search or generative model.
Authors:Tara Sadjadpour, Siming He, C. K. Wolfe, Haozhi Qi, Lea Wilken, S. Shankar Sastry, Claire Tomlin, Jitendra Malik
Abstract:
Human hand‑object interactions (HOIs) provide a rich source of demonstrations for dexterous manipulation, but learning directly from them presents challenges in bridging morphology gaps, ensuring dynamical feasibility, and sim‑to‑real deployment. We present Morphometric Imitation, a three‑stage framework that transforms reconstructed HOIs into zero‑shot sim‑to‑real visuomotor policies. First, morphometric optimization (MMO) kinematically retargets human motion across hand morphologies while preserving demonstrated contacts. Second, residual reinforcement learning (RL) refines the kinematic reference using object pose and contact information from the human motion to produce dynamically feasible robot demonstrations. Third, these demonstrations are distilled into visuomotor policies. Across three robot hands and ten HOIs, MMO improves contact F1 over the strongest of five baselines by at least 8 points for every hand, while also improving the success rate of downstream dynamic retargeting by as much as 35 points. Ablations on the residual RL show complementary benefits from using object pose and contact information. Finally, the visuomotor policies achieve 89.3% zero‑shot success in 300 real‑world trials on 30 objects. Project page: \hrefhttps://morphometricimitation.github.io\textthis https URL
Authors:Mohammed Al-Maamari, Saber Zerhoudi, Michael Granitzer, Jelena Mitrović
Abstract:
Retrieval‑augmented question answering requires control decisions about when to decompose a question, search, reformulate, extract evidence, synthesize facts, verify progress, and stop. We study whether trajectory fine‑tuning can improve small language models (SLMs) as next‑action controllers. We additionally evaluate a low‑resource setting in which a single SLM serves as both the controller and the final‑answer generator. From accepted teacher search traces, we build a seven‑way action‑prediction task, where the model predicts the next structured teacher action from the current trajectory state, and evaluate LoRA‑supervised fine‑tuning across SLMs and xSLMs as controllers. On 1,646 held‑out action examples, Granite 4.1 3B trained on 13,194 actions reaches macro‑F1 0.6536, compared with 0.1736 for zero‑shot prompting of the same model and 0.5399 for a TF‑IDF logistic‑regression baseline. In an end‑to‑end controller/generator swap evaluation over 149 held‑out trajectories, using the fine‑tuned model for both roles improves Exact Match from 0.7530 to 0.7946 and token F1 from 0.7783 to 0.8295 compared with using the base model as both controller and generator. The cross‑role conditions show that the fine‑tuned controller increases evidence‑fact recording when the generator is fixed, while controller‑only final‑answer gains are not statistically clear. Overall, trajectory supervision improves action prediction and evidence‑recording behaviour in this evaluated pipeline. Code is available at https://github.com/padas‑lab‑de/agent‑action‑controller
Authors:Sungjae Choi, Seunghee Koh, Junmo Kim
Abstract:
Recent advancements in 3D Gaussian Splatting (3DGS) have extended its capabilities to multi‑scale segmentation. Existing methods reconstruct a scene with Gaussian primitives and learn multi‑scale segmentation features separately, which leaves the geometry unaware of semantic structure and the feature learning dependent on incomplete mask supervision. To address these limitations, we present PePESeg3D, a novel framework that injects perception priors into a multi‑scale 3D Gaussian segmentation pipeline. To fully exploit perception priors, we integrate them not only into contrastive feature learning but also into the upstream geometry reconstruction. Specifically, PePE Reconstruction incorporates monocular depth and mask constraints to ensure semantically coherent object structures. Building on this aligned geometry, PePE Contrastive Learning leverages dense depth‑color cues and view‑consistent centroid supervision to compensate for the incompleteness of multi‑scale masks obtained from a 2D foundation model. Extensive experiments on the SPIn‑NeRF, LERF‑Mask, and NVOS benchmarks demonstrate that PePESeg3D achieves state‑of‑the‑art performance in both multi‑scale segmentation and scene reconstruction, highlighting the importance of integrating perception priors into both geometry optimization and feature learning for accurate multi‑scale 3D segmentation. Our code is available at https://github.com/BeCow5X5/PePESeg3D.
Authors:Yingli Wang, Kelvin Shuangjian Zhang, Lingjiong Zhu
Abstract:
We study global convergence guarantees of third‑order Langevin dynamics for non‑convex optimization via simulated annealing with fixed friction and decreasing noise. An explicit three‑block distorted entropy transfers dissipation from the noisy auxiliary variable to the full state. Under dissipativity, regularity, and low‑temperature functional‑inequality assumptions, logarithmic cooling drives the objective values to the global minimum in probability at the barrier‑controlled kinetic rate. For the exact‑force‑integral and midpoint three‑stage discretizations, polynomially decreasing steps preserve this rate on the physical time scale. The cubic local endpoint estimate gives a less restrictive sufficient step‑size condition than the available frozen‑force kinetic result. A comparison with the one‑gradient UBU integrator shows how its centered stochastic local error leads, under the same strong‑coupling analysis, to a smaller sufficient iteration exponent. Numerical experiments are conducted to illustrate our theory. For a double well objective, third‑order Langevin terminal‑success point estimates are higher than UBU at both a common horizon and an equal gradient budget. For a high‑dimensional nonconvex neural‑network objective using synthetic data, independently tuned UBU and third‑order Langevin schemes both outperform overdamped Langevin dynamics; the third‑order Langevin point estimate is higher. For the same neural‑network objective on real data, we show the same point‑estimate ordering for best‑basin probability and post‑quench test accuracy. Numerical code and associated experiment results are publicly available at https://github.com/gagawjbytw/simulated‑annealing‑third‑order‑langevin.
Authors:Polona Durcik, Marco Fraccaroli, Joris Roos
Abstract:
A weak form of the Hellinger conjecture of Anantharam, Bogdanov, Chakrabarti, Jayram, and Nair for the binary symmetric channel is proved: dictator functions maximize Hellinger Φ‑entropy among all Boolean functions of the input and all one‑bit statistics of the output of a noisy channel. The technical heart of the matter is an explicit inequality in three real parameters, which is proved using explicit polynomial approximations and computer‑assisted positivity checks. The results are also formally verified in Lean 4.
Authors:Zeyu Lou, Yanhong Zeng, Yong Wang, Chenyang Si
Abstract:
A general‑purpose vision‑language model can understand a task goal without knowing how a particular robot's motion and functional parts produce the intended effect. We introduce KnowBody, a harness that makes these action‑relevant body relations explicit, queryable, and revisable while keeping the model weights frozen. Initialized from one off‑task trajectory, a partial body model guides action selection and the interpretation of past interactions. New evidence refines the model, and knowledge dependent on revised body estimates is rechecked before reuse. Across 32 fixed‑budget trials on four real‑robot tasks, initialized KnowBody achieves 75% completion versus 25% for the native harness and requires fewer planner rounds on successful trials in tasks completed by both. With persistent updates enabled, planner rounds decrease by 29‑53% from the first to the fifth recorded success.
Authors:Dilli Hang Rai
Abstract:
Hybrid quantum‑classical neural networks have emerged as a promising approach for leveraging quantum computing in machine learning while mitigating current hardware limitations. This paper presents Sim‑HVQC, a hybrid Deep Quantum Neural Network that couples an adaptive, parameter‑free SimAM weighting module with classical feature extraction to preserve class‑discriminative information prior to encoding into a Variational Quantum Circuit (VQC). Previous studies are restricted to binary classification [1] [2] [3] [4] [5]. In contrast, the proposed framework is trained and evaluated on various multi‑class datasets(MNIST, KMNIST, Fashion‑MNIST, and EMNIST). The framework further demonstrates reproducibility, parameter efficiency, and interpretability through multi‑seed evaluation, parameter analysis, and latent/quantum feature inspection. The source code is publicly available at https://github.com/Dilli822/ SimAM‑HVQC
Authors:Lokesh Chauhan
Abstract:
Infrastructure‑as‑Code (IaC) misconfigurations are a leading cause of cloud security incidents, and Large Language Models (LLMs) are increasingly proposed as automated repair agents. Yet the trustworthiness of LLM‑generated IaC repairs remains underexplored. IaC presents distinctive verification challenges: security scanners may behave differently across tools and configurations, infrastructure semantics cannot be validated through ordinary unit tests, and provider‑specific rules create a fragmented verification landscape. We present IaC‑Guard‑V, a verification‑centered framework that evaluates AI‑generated IaC repairs through four dimensions: syntactic validity, target‑issue resolution, regression safety, and patch minimality. We construct a benchmark of 70 real‑world misconfigured Terraform and Kubernetes artifacts spanning 70 unique scanner rules and eight violation classes, and evaluate three repair strategies across three LLM families in 630 runs. Although all models achieve 100% syntactic validity, only 32‑50% of single‑shot repairs pass full verification. Verification‑guided iterative repair significantly improves verified‑fix rates to 68‑92%. An open‑source model with verification‑guided repair outperforms the strongest commercial model without verification at one‑twelfth the cost per verified fix. Kubernetes repairs reach near‑perfect rates for commercial models but require verification‑guided iteration for the open‑source model. Structured prompting consistently reduces Terraform repair quality, challenging common assumptions about constrained LLM output. The benchmark and artifacts are released for reproducibility.
Authors:Yufeng Wang
Abstract:
Forecasting agents increasingly combine language‑model reasoning, retrieval, ensembling, and calibration, but it remains unclear when each behavior should be trusted. We study this question on ForecastBench‑style binary forecasting tasks, treating the choice to retrieve, reason, defer to a market prior, or use a historical analog as an observable agent behavior rather than a hidden implementation detail. Our central finding is that mechanism choice is source‑dependent: structured analogs dominate for some data‑generating processes, while market/crowd‑style and conservative baselines are better for others. We introduce ReliabilityRoute, a structural intervention that steers forecasting‑agent behavior using reliability features such as historical coverage, market‑prior availability, source‑prior sharpness, evidence strength, evidence disagreement, and horizon. A fixed 2024‑fitted rule closely matches a hand taxonomy without hard‑coded source‑name decisions, while a walk‑forward self‑adjusting rule refits thresholds from previously resolved vintages and obtains the best mean Brier score among our deterministic systems across 16 later LLM vintages. The gain is modest and historical/search baselines remain highly competitive. The main contribution is therefore a behavioral stress test showing that more reasoning is not always better; forecasting agents should first estimate which evidence source deserves control, routing policies should themselves adapt under auditable constraints, and reproducibility artifacts are available at https://github.com/louiswang524/forcastagent
Authors:Chao Feng, Zhiyang Xu, Bowei Chen, Yuanjun Xiong, Xiyao Wang, Jui-Hsien Wang, Richard Zhang, Zhe Lin, Andrew Owens, Yijun Li
Abstract:
Representation Autoencoders (RAEs) enable diffusion models to operate in the feature spaces of pretrained visual encoders. However, many off‑the‑shelf encoders are not optimized for faithful reconstruction, discarding fine‑grained visual details. As expected, finetuning these encoders for image reconstruction recovers such details. However, perhaps counterintuitively, this procedure reduces the effective dimensionality of the resulting representation, and the altered geometry has downstream effects on generation. Specifically, we show that using the standard velocity prediction in flow matching in this high‑dimensional space requires the model to fit orthogonal noise directions outside the low‑dimensional signal manifold, making optimization inefficient. This motivates using the clean data parameterization (\boldsymbolx_0‑prediction) instead, which focuses learning on the underlying signal manifold. Across experiments with multiple strong‑reconstruction encoders, we show that \boldsymbolx_0‑prediction consistently improves text‑to‑image generation performance.
Authors:Peter Kirby
Abstract:
Our results show that contrastive learning outperforms a classification‑based approach to authorship verification under the tested settings. We identify loss function, batch size, training duration, pre‑trained model, input context length, and random text span data augmentation as important factors of model performance. Based on these considerations, we develop a ModernBERT Bi‑Encoder model that achieves 98.4% accuracy on the PAN21 authorship verification task.
Authors:Curtis Northcutt, Inaara Hasmani, Kevin Feng, Trevor Khangi, Andreas Plesner, Jonas Mueller
Abstract:
Artificial intelligence offers an unprecedented opportunity to augment human capabilities, yet progress at the frontier has focused primarily on advancing model capabilities. We introduce StudentBench, a suite of AI teaching evaluations and a public platform that enables large‑scale data collection with over 175,000 student‑AI messages to study whether large language models (LLMs) produce learning gains equivalent to human tutoring. Using StudentBench, we measured learning gains on Quantitative and Verbal GRE questions across 2,383 human participants receiving AI tutoring, human tutoring, or no tutoring. We establish that AI tutoring is statistically equivalent to expert human tutoring for GRE learning gains (p = .015), and in five of the seven GRE domains, the best performing AI tutor surpassed the human tutor, on average. In a second study, expert human tutors compared LLM‑generated lesson plans and practice problems through 2,028 pairwise rubric evaluations. Together, the two studies clearly separate AI tutors across: (1) lesson planning, (2) practice‑problem creation, (3) conversational pedagogy, (4) cost, and (5) engagement. Surprisingly, one AI tutor achieved learning gains equivalent to human tutoring (p = .044) at 918 times lower cost (USD 0.0052 for AI versus USD 4.81 for human, per percentage point gained). For Quantitative GRE sessions, faster AI replies correlated with more student messages, more messages with more correct practice, and more correct practice with larger learning gains (all p < .002). The StudentBench platform is freely available at https://studentbench.org.
Authors:Abhijeet Mulgund
Abstract:
Let n\ge2, and let X=(X_1,\ldots,X_n) be a centered Gaussian vector with \mathrmVar(X_i)=1 for every i. Let Z_1,\ldots,Z_n be independent standard Gaussians, and put \overlineZ=(Z_1+\cdots+Z_n)/n. We prove \mathbbP\\max_i X_i\le t\\ge\mathbbP\\sqrtn/(n‑1)\,\max_i(Z_i‑\overlineZ)\le t\ for every t\in\mathbbR, and for each fixed t>0 equality holds only when \mathrmCov(X_i,X_j)=‑1/(n‑1) for all i\ne j. The right side is the distribution function of the maximum of the regular simplex vector. Equivalently, among all simplices containing a given centered ball, the regular simplex circumscribed about the ball has the least standard Gaussian measure, as conjectured by Balitskiy, Karasev, and Tsigler. In our preceding paper we proved this comparison after both maxima are smoothed by independent Gaussian noise of variance 1/(n‑1), which suffices for the Weak Simplex Conjecture; here we remove the smoothing, which is what probabilities at a single threshold require. As an application we consider n equally likely signals of equal energy in Gaussian noise, where the transmitter may also send nothing. At every positive false‑alarm level, and for every law of a common nonnegative random amplitude not concentrated at zero, the regular simplex uniquely maximizes the average probability of correct identification whenever the signal dimension is at least n‑1. A Lean formalization is available at https://github.com/abhmul/full‑simplex‑conjecture‑lean.
Authors:Ning Chen, Yankai Fu, Junkai Zhao, Qianpu Sun, Guocai Yao, Pengwei Wang, Zhongyuan Wang, Shanghang Zhang
Abstract:
Dexterous manipulation demands long‑term foresight and rapid reactive control. Vision‑Language‑Action (VLA) models, while proficient in high‑level reasoning, often lack a fine‑grained understanding of physical dynamics and spatial perception. Conversely, World‑Action Models (WAMs) typically suffer from high inference latency due to iterative generation. These deficiencies result in a critical temporal misalignment where the model's intent fails to adapt to rapid physical contact changes. To overcome this fundamental bottleneck, we propose LiMA, an asynchronous dual‑system generative framework that systematically decouples intent planning from reactive execution. LiMA organizes computation into a multi‑scale hierarchy: a slow system handles sparse long‑horizon spatiotemporal intent generation, while a fast system focuses on dense high‑frequency motion refinement. To align sparse intent predictions with dense action trajectories, we introduce a Latent Schrödinger Bridge Coupling mechanism that formulates refinement as an entropy‑regularized probabilistic transport process. LiMA reduces inference latency by 45.8% compared with Cosmos‑Policy via asynchronous decoupling. Evaluated across six bimanual dexterous manipulation tasks spanning multiple horizons, LiMA achieves an overall success rate of 70.8% and an average subtask success rate of 78.9%, while maintaining performance in unseen scenarios. The project website is available at https://ccdcs.github.io/LiMA_repo/
Authors:Vijesh KP
Abstract:
Catalog skin recolouring has to change pigment and leave shading alone. The classical Reinhard map does not make that split: it rescales lightness by the ratio of standard deviations, and a flat reference swatch therefore flattens the limb. This paper formalises the correction used in our pipeline, the skin‑restricted Reinhard transform. It is the diagonal affine map in CIE Lab that translates lightness, matches the chromatic mean, and clamps the chromatic gain to [0.72, 1.18], with moments taken on the central 84% of each channel. A diagonal affine map has six real parameters. The shading constraint forces the lightness gain to +1 and the lightness shift to the difference of means; one‑dimensional quadratic optimal transport on each chromatic axis, followed by Euclidean projection onto the gain interval, fixes the other four. Inside that family the four conditions determine every parameter. The content of the result is the forced lightness gain; it is not a uniqueness claim outside the diagonal affine class. For Gaussian marginals the chromatic step is not merely the best affine map: it is the unrestricted Wasserstein‑2 map. The same formulae with trimmed moments remain optimal because a positive affine image commutes with quantile trimming. On hands, arms, legs, and feet of nine photographs and three reference tones, the map keeps the lightness contrast ratio at 0.974 +/‑ 0.029 with chromatic error 0.77 CIE Lab units. Reinhard matching, the linear Monge map, and histogram matching reach a smaller chromatic error only by cutting lightness contrast to about half.
Authors:Jianxiang Ma, Mingfu Zhang, Xiaocui Yang, Yichen Gao, Junzhao Huang, Yuesong Hou
Abstract:
Collective responses depend on individual differences, contact opportunities, and accumulated experience. Learning their dynamics from aggregate counts requires connecting a population's response distribution to both current observations and future behavior. We introduce Differentiable Gaussian Dynamics (DGD), which learns this connection through three components: a Gaussian mixture representing heterogeneous response propensities, differentiable aggregation of contact intensity and behavioral probabilities, and feedback recurrence that updates subsequent responses. Reparameterized integration and temporal recurrence let aggregate prediction errors jointly train the distribution, observation functions, and feedback parameters. On four windows from KuaiRand‑Pure and Online Retail II, DGD achieves lower joint behavioral negative log‑likelihood than a DeepAR adaptation with a joint‑behavior head. In Retail 2010, its one‑day behavioral‑count MAE is 4.71 versus 6.88 for this adaptation. Learning the distribution reduces behavioral negative log‑likelihood by 10.82% relative to a fixed Gaussian in KuaiRand's standard‑recommendation window; removing feedback dynamics raises joint KL from 0.0340 to 0.2577 in a controlled experiment. These results establish the value of learning population representations and their feedback process from aggregate observations. Code is available at https://github.com/OranAi‑Ltd/oransim.
Authors:Yulong Dong, Jiaqi Leng
Abstract:
Score matching has driven major advances in classical generative learning by enabling models to learn from data without evaluating intractable normalization constants, or partition functions. Yet, extending this principle to quantum learning requires rethinking its foundations, as quantum states are described by noncommuting density operators rather than scalar probabilities. The noncommutativity creates fundamental challenges not only in defining quantum scores, but also in developing a training framework with efficient circuit implementations and rigorous theoretical guarantees. In this work, we bridge this gap by establishing a general quantum score‑matching framework with end‑to‑end theoretical guarantees. Applied to Gibbs‑state learning, our approach avoids additional thermal‑state preparation and achieves information‑theoretically optimal sample complexity in the high‑temperature regime for Hamiltonians with bounded locality and interaction degree. This positions score matching as a new route to state‑of‑the‑art performance in learning quantum Gibbs states. Beyond these theoretical results, numerical simulations show that our method remains effective even when gradients are estimated inaccurately under limited measurement budgets. Experiments on IBM quantum hardware further demonstrate that quantum score matching is NISQ‑friendly: without any error mitigation or correction, it reduces the relative Hamiltonian‑parameter error from 64% to approximately 10%. Together, these results extend score matching into an experimentally realizable paradigm for quantum‑state learning.
Authors:Jianxiang Ma, Mingfu Zhang, Xiaocui Yang, Yichen Gao, Junzhao Huang, Yuesong Hou
Abstract:
Social simulation studies how individual behavior and social interaction produce collective outcomes. In social media marketing, campaign actions shape which consumers encounter the content and how they respond; these responses then spread through the population. We propose OranSim, a social simulation framework that connects creative, creator, targeting, and budget choices to this process. Heterogeneous consumers receive exposure according to content matching and platform allocation and generate initial responses, which propagate among 60 population segments. Candidate campaigns share the initial population and aligned random numbers, making their response trajectories comparable under action changes. In a controlled synthetic campaign, doubling the budget approximately doubles reach while lowering mean content match and engagement probability among the reached consumers; mean 14‑day cumulative simulated response mass rises to 1.96 times the baseline. LightGBM predictors fitted to 39,000 historical RedNote notes estimate platform engagement with log‑scale R^2 of 0.56‑‑0.62 in five‑fold cross‑validation; a separate 12,154‑note corpus supplies temporal, unseen‑creator, and held‑out‑niche test splits. Public‑data experiments evaluate policy value and audience ranking, and paired synthetic outcomes test counterfactual scoring. Together, scenario trajectories and engagement estimates support campaign selection according to a prespecified marketing objective. Code is available at https://github.com/OranAi‑Ltd/oransim.
Authors:Xukun Luan, Zhongxiang Lei, Chen Gong, Shaowei Li, Yuanguo Bi, Jinyan Liu
Abstract:
Humanoid control, leveraging human demonstrations, has achieved diverse, agile, and natural locomotion behaviors through reinforcement learning (RL). While this paradigm has yielded remarkable performance in physical humanoid control, how to eliminate specific motions from learned policies remains insufficiently explored. Addressing this issue is motivated by pressing safety and privacy concerns: the removal of malicious, poisoned, or suboptimal motions, as well as copyright‑protected motions subject to the right to be forgotten under regulations such as the GDPR, is of critical importance. To this end, we propose ForgetMimic, the first motion‑level unlearning method designed specifically for physical‑world humanoid control. The core idea of ForgetMimic is as follows: given a policy π_θ trained on N motions, our method degrades performance on a target subset of K motions while preserving the effectiveness of the remaining N‑K motions. Furthermore, we identify and resolve two key training mechanisms in robot control that lead to unlearning failure. We conduct extensive experiments on the Unitree G1 and H2 humanoid robots across 12 motions, including Dance, Fight, Flip, and others. Experimental results demonstrate that ForgetMimic effectively eliminates memory of designated motions while maintaining the normal operation of all other motions.
Authors:Nelson Rosa
Abstract:
Optimization problems (OPs) are key to solving many challenging research problems in robotics. However, reproducibility still remains a major issue. In this paper, we present Amplify, a lightweight nonlinear programming library aimed at reproducible results of robotic‑related trajectory optimization problems. The minimalistic requirements for the 537‑line library (80 characters per line) are an Internet connection, familiarity with the AMPL modeling language, and a text editor. Our primary contribution is the formulation of a library where trajectory optimization algorithms are represented directly within the optimization model. Specifically, we implement the algorithms used to compute the dynamics, trajectories, and reference motions as constraints of the OP in a declarative programming paradigm. We outline how our formulation of objectives, decisions variables, and constraints can be implemented in other transcription libraries that want to be lightweight and reproducible. We also compare the Amplify framework with 3 other libraries across examples of benchmark optimization problems across several fields, including bipedal locomotion and grasp planning.
Authors:Kaiyang Li, Shaobo Han, Yue Tian, Shihao Ji
Abstract:
Audio‑language models (ALMs) integrate acoustic perception with the knowledge encoded in language models, enabling contextual understanding of auditory events. Making these capabilities practical on devices with limited memory and computation motivates our focus on small ALMs with fewer than 200M parameters. We introduce a recipe that brings together architecture, data, and three‑stage training to build Mizar, a 159.3M‑parameter ALM. Its architecture connects a compact CED‑Small audio encoder to SmolLM2‑135M through a frequency‑merging mapper. With supervision drawn from ReasonAQA, AudioMCQ, and AVQA, the model undergoes three training stages: audio‑language alignment (Stage 1), audio‑dependent fine‑tuning (Stage 2), and post‑training (Stage 3) aimed at strengthening weak skills while retaining learned capabilities. Across five random seeds, Mizar achieves mean accuracies of 52.92% on MMAU, 42.42% on MMAR, and 36.02% on ADQA‑clean, surpassing the previous best‑performing ALM below 200M parameters on all three benchmarks. It also supports local inference on a single CPU: on questions from the MMAU benchmark, the mean latency from opening the audio file to generating a complete answer is 1.09 seconds. Code and checkpoints are available at https://github.com/KaiyangLi1992/Mizar_159M.
Authors:Arman Taghizadeh, Ulf Krumnack, Kai-Uwe Kühnberger
Abstract:
Removing an object from a real image requires more than synthesizing plausible content within a mask: the method must suppress residual object features, preserve the unedited scene, and generate replacement content that is consistent with the surrounding background. This paper approaches object removal from a stage‑based perspective and proposes a zero‑shot framework for constrained latent inpainting with a frozen pretrained Stable Diffusion model, requiring no task‑specific training or model fine‑tuning. The method integrates SAM‑based mask construction, BLIP image‑caption conditioning, DDIM inversion, background‑weighted masked null‑text optimization, decoder self‑attention masking, hard outside‑mask latent anchoring, and localized renoise‑‑denoise refinement into a unified pipeline. The method is evaluated through qualitative examples, quantitative local‑consistency metrics, and ablation studies. The results demonstrate effective object removal and context‑consistent replacement content. The ablations indicate that background‑weighted masked NTI is particularly beneficial for structurally complex backgrounds, whereas the no‑NTI variant is sufficient in other evaluated examples. Repeated refinement further reduces object remnants and boundary artifacts remaining after the primary editing pass.
Authors:Zanyi Wang, Yuheng Lei, Dengyang Jiang, Ping Luo, Mengdi Wang, Zhixuan Liang, Shilong Liu
Abstract:
Pretrained generative Diffusion Transformers (DiTs) capture rich pixel‑level visual and language‑conditioned structure through large‑scale image and video generation training. A growing line of robot policies builds on this generative prior, but how it should be transferred to control remains unclear, and existing approaches commonly instantiate this transfer through future visual prediction. We ask a more basic question: what a pretrained generative DiT actually contributes to action learning, and how this prior should be adapted for control. We introduce NowWAM, a future‑target‑free co‑training formulation that denoises the current observation and predicts robot actions from the same visual stream, directly coupling the native generative objective to the action‑facing representation across the denoising trajectory. Under matched controlled settings, past and future visual targets perform comparably, while restricting training to the clean endpoint substantially reduces robustness, suggesting that a separate future target is not essential for generative adaptation, while the denoising trajectory remains an effective interface for control. On LIBERO‑Plus, NowWAM reaches 87.7% with FLUX2‑Klein, improving over the future‑target co‑training baseline by 6.1 points while halving training visual tokens (784 to 392) and reducing step time from 2.85 s to 1.63 s, a 1.8x speedup. With the pure text‑to‑image Z‑Image backbone, NowWAM further reaches 87.8%, showing that strong control adaptation is not tied to video generation or image‑editing backbones.
Authors:Andrei Arhire, Mihaela-Elena Breabăn, Radu Timofte
Abstract:
We present LightMIS, a scalable family of ultra‑lightweight convolutional networks for 2D binary medical image segmentation without a learned stage‑wise decoder. LightMIS aligns the outputs of a five‑level encoder to a common resolution using Scale‑Aligned Projection blocks, aggregates them once, and refines the fused representation with an Adaptive Fusion Cascade. The cascade combines Adaptive Kernel Fusion with the proposed Progressive Receptive Fusion module, which uses temporary channel expansion, complementary depthwise receptive fields, and progressive cross‑branch information transfer. We evaluate LightMIS‑T, LightMIS‑S, and LightMIS using five‑fold cross‑validation under a common nnU‑Net v2.3.1 protocol on DRIVE, Kvasir‑SEG, DSB18, BUSI, ISIC‑2017, and ISIC‑2018. Full LightMIS contains 0.131 M parameters and requires 0.575 GFLOPs for a 3×256×256 input, achieving modality‑macro Dice and IoU scores of 86.71% and 78.99%, respectively. Mobile U‑ViT obtains 86.75% Dice and 79.07% IoU, so the observed differences are 0.04 and 0.08 percentage points. Relative to Mobile U‑ViT, nnWNet, and nnU‑Net, LightMIS reduces parameter count by 90.58‑99.61% and GFLOPs by 82.54‑96.14%. On an Arm Mali‑G52 MC2 GPU, all LightMIS variants achieve full GPU delegation, with median delegated latency ranging from 53.31 ms for LightMIS‑T to 138.31 ms for LightMIS. These results demonstrate a favorable accuracy‑complexity trade‑off and on‑device execution feasibility for the evaluated tasks. The code is publicly available at https://github.com/AndreiiArhire/LightMIS.
Authors:Andreea Ardelean, Bernhard Egger
Abstract:
Ill‑posed inverse problems require priors to constrain the solution space toward plausible outcomes. In inverse rendering, learned priors modeling the distribution of natural illumination improve the recovery of scene properties. However, existing models rely on the distant‑illumination assumption, representing lighting as a far‑field environment map. This limits their applicability to indoor scenes, where illumination is highly spatially varying due to finite‑distance emitters, visibility changes, and parallax, all of which are poorly approximated by a single environment map. To address this, we introduce a spatially‑aware illumination prior trained on real‑world indoor panoramas and their estimated depth. Our variational autoencoder model learns a compact, optimizable latent space that decodes into HDR radiance and depth, parameterizing an area light emitter for direct integration into standard differentiable rendering pipelines. This design bridges the plausibility guarantees of a learned prior with the gradient flow required for downstream optimization. Crucially, by jointly modeling radiance and depth, our prior captures the spatial structure of indoor illumination, instead of treating the light sources as infinitely distant. We demonstrate that this formulation enables spatially‑varying illumination modeling and achieves higher‑fidelity recovery of indoor lighting compared to existing approaches. Project page: https://andreead‑a.github.io/RoomLight
Authors:Hrishikesh Sathyanarayan, Christian Hughes, Ian Abraham
Abstract:
Contact‑implicit trajectory optimization formulates contact‑rich manipulation as a single constrained program; however, that single program run collapses onto one local optimum out of many equally valid contact modes, grasps, or push directions. As a consequence, the resulting manipulation strategy is reluctant to change and sensitive to initialization. In order to promote robust manipulation, this paper investigates how contact‑implicit solvers can discover diverse contact‑rich strategies. Our approach derives a variation of Consensus Alternating Direction Method of Multipliers (ADMM) combined with Stein variational inference methods to output a set of distinct contact‑rich solutions. We find that applying the Stein repulsive force to ADMM's split variable (rather than its primal form) allows for effective coverage over the set of feasible contact strategies without prematurely stalling the solver. We demonstrate the effectiveness of our approach on a variety of contact‑rich manipulation tasks, including pushing, grasping, and multi‑robot handover. Last, we find the proposed solver is simpler in form and capable of discovering unique contact modes when compared with existing solvers. Videos and code with examples are found in https://anon‑website‑submission.github.io/stein‑admm‑website/.
Authors:Lorenzo Innocenti, Luca Catalano, Edoardo Arnaudo, Claudio Rossi, Salvatore Larosa, Domenico Cimini, Paolo Garza
Abstract:
Estimating the Planetary Boundary Layer Height (PBLH) from satellite observations is a challenging regression problem due to the indirect relationship between top‑of‑atmosphere radiances and near‑surface atmospheric structure. Progress has been limited both by the lack of architectures capable of handling the multimodal, spatially incomplete nature of satellite overpasses, and by the scarcity of suitable datasets. In this paper, we build upon the large‑scale dataset pairing MetOp radiances with ERA5 PBLH labels that we introduced in our previous work, making three contributions. First, we establish a benchmark across eight approaches spanning pixel‑wise regression, swath‑wise sequence models, and convolutional and Transformer models operating on the full orbital passage. Second, we quantify what the resulting model actually relies on, using grouped Shapley decomposition over the input blocks. Third, we present the best‑performing architecture found: a dual‑encoder Transformer whose masked‑input handling lets it operate in all weather conditions. The proposed model achieves MAE = 155.8 m on the held‑out global test set, outperforming all baselines on every evaluation subset. On 30 out‑of‑distribution granules acquired on two days overlapping the TEAMx observational campaign, it achieves MAE = 165.3 m, outperforming a pixel‑wise baseline trained on the same data (MAE = 197 m).
Authors:Jichuan Yu, Zhenyu Xiao, Ze Wang, Ruixuan Liu, Changliu Liu, Chuxiong Hu
Abstract:
Interlocking brick assembly provides a representative testbed for evaluating real‑world robotic manipulation capabilities, where diverse structural designs, complex inter‑step dependencies, intricate mechanical interactions and tight insertion tolerances pose substantial challenges. We present BrickCraft‑Duo, a modular framework for long‑horizon dual‑arm collaborative assembly of interlocking bricks through data‑efficient skill learning and composition. BrickCraft‑Duo learns reusable single‑ and dual‑arm assembly skills from diverse demonstrations, with bilateral symmetry alignment facilitating skill sharing across symmetric arms and assembly‑‑support role assignments. Guided by stability‑aware assembly reasoning, BrickCraft‑Duo composes heterogeneous skills to achieve autonomous long‑horizon execution, and further integrates human‑in‑the‑loop correction for targeted skill refinement. The resulting system achieves long‑horizon success rates of at least 60% and step‑level completion rates of at least 95% across five real‑world assembly tasks involving partially supported configurations, with horizons of up to nine steps. Project website: https://jichuan‑yu.github.io/BrickCraft‑Duo.
Authors:Dian Jin, Kairong Han, Baohong Li, Xinpeng Dong, Zijing Hu, Nuanqiao Shan, Fei Wu, Kun Kuang
Abstract:
Diffusion Language Models (DLMs) have attracted significant attention for their strong reasoning ability. However, under a bidirectional attention mechanism, DLMs operate over an exponentially large exploration space compared to autoregressive models (ARMs), making it challenging to focus on reasoning‑guiding tokens under random masking. We define causal shortcuts as token chains that cover the full sequence and provide explicit guidance towards correct reasoning trajectories. We analyze the effects of causal shortcuts on the reasoning accuracy and convergence speed of DLMs, and find that they largely improve answer convergence efficiency and generation accuracy. Motivated by this, we propose a Causal Shortcut Learning (CSL) Framework for DLMs. Specifically, we introduce a step‑by‑step token extraction procedure to extract causal shortcuts from data, and apply parallel prioritized masking on these tokens during training to enable efficient and accurate convergence to correct answers via causal shortcuts. Extensive experiments across multiple reasoning benchmarks and two base models demonstrate that CSL consistently outperforms existing SFT‑variant baselines, achieving an average improvement of 1.92% over SFT‑only models, and up to 4.20% on MATH‑500. The code is available at the \hrefhttps://github.com/ZJUDianJin/Causal‑Shortcuts‑Learninghttps://github.com/ZJUDianJin/Causal‑Shortcuts‑Learning
Authors:David Población-Criado, Dario Garcia-Gasulla, Eduardo Quinones
Abstract:
Deploying deep learning models on edge CPUs is bottlenecked by computational and memory constraints. Mixed‑precision quantization promises to reduce inference latency while preserving accuracy. However, quantization affects different layer types in inconsistent ways, so identifying where accuracy loss is minimized and latency reduction is maximized is critical, as the effect accumulates over a full deployment into substantial savings or unacceptable task degradation. Such identification relies on sensitivity metrics, proxies that estimate layer‑wise degradation without evaluating the task accuracy of every candidate policy. Nevertheless, widely used metrics fail systematically on modern architectures. We present a systematic empirical study of 13 sensitivity metrics for layer‑wise INT8 quantization across four distinctly different neural networks, and validate the resulting policies on two ARM64 platforms. Gradient‑based sensitivity methods fail on 4 out of 8 model‑hardware configurations and weight‑based statistics on 2. In contrast, the Jensen‑Shannon Divergence achieves zero catastrophic failures, reliably isolating the layers that cannot be safely quantized. A sensitivity metric alone does not define a policy, and the fixed thresholds typically used for that step are fragile over the highly skewed distributions of modern architectures. We address this with K‑Means clustering, achieving near‑lossless accuracy and a mean speed‑up of 1.81× over the full‑precision model. Finally, we reveal that excluding from quantization the layers whose speed‑up is negligible, regardless of their sensitivity, can be counterproductive, as it induces computational graph fragmentation and disables operator fusion. Our results yield concrete allocation policies for practitioners and researchers deploying quantized vision models on heterogeneous edge CPUs, without GPU access or gradient computation.
Authors:Timo Klein, Thomas Lang, Yllka Velaj, Sebastian Tschiatschek
Abstract:
We present hyperbolix, an open‑source library for hyperbolic deep learning in JAX, built on Flax NNX. To our knowledge, it is the first comprehensive, general‑purpose hyperbolic deep learning library in JAX. It includes six manifolds with a common interface: Euclidean space, the Poincaré ball, the hyperboloid, the κ‑stereographic model, mixed‑curvature product spaces, and the proper velocity space. We implement layer families that cover linear layers, convolutions, attention, normalization, positional encoding, regression, and vector quantization. These building blocks span methods ranging from Ganea's original hyperbolic neural networks to recent fully hyperbolic architectures such as Hypformer and Lorentzian ResNet. Additionally, hyperbolix contains Riemannian optimizers implemented as optax transformations, wrapped distributions, and hyperbolic dimensionality‑reduction techniques. Its API uses idiomatic JAX: Manifolds are stateless, with curvature being passed at call time, while manifold operations act on single points, with jax.vmap enabling batch operations. The precision of every checked operation is tested against a closed‑form NumPy/SciPy transcription from the source paper or a finite difference, for both float32 and float64. On the hyperboloid, standard formulas for two‑point operations, such as the distance, lose precision far from the origin, because they subtract two large, nearly equal terms. hyperbolix replaces these subtractions with cancellation‑free formulas that stay accurate in float32 at distances where prior implementations return NaN. hyperbolix is available under the MIT license at https://github.com/timoklein/hyperbolix .
Authors:Li Zeng, Mingcheng Duan, Longfei Fan, Hangtao Zhang, Xianlong Wang, Yanchun Li, Xia Wen, Leo Yu Zhang
Abstract:
With the development of applications like autonomous driving, object detection has gained significant attention, while also highlighting critical vulnerabilities like backdoor attacks that severely compromise model integrity. Specifically, such attacks involve altering the categories of objects (i.e., object misclassification), removing bounding boxes (i.e., object disappearance), or generating bounding box proposals for non‑existent objects (i.e., object generation) when a predefined trigger is present in the input. Although backdoor defenses for image classification are well‑established, the research for object detection remains comparatively underexplored. Existing defenses address these threats by scanning outputs or models for potential backdoors but require discarding either malicious data or models. This remedy fails to enable a continuous and accurate perceptual stream for the object detection pipeline. To address such limitations, we propose ODPure, a novel input‑stage black‑box defense for object detection, which is based on input purification that ensures stable perception flows. Tailored to the dense prediction nature of object detectors, our Corruption‑Reconstruction‑Selection (CRS) paradigm operates by neutralizing triggers through a diverse portfolio of corruptions to generate a massive pool of redundant proposals, then recovering fine‑grained structural cues via generative priors, and finally employing voting to reach a consensus on the resulting detections. Comprehensive experiments demonstrate that our method provides robust defense against diverse backdoor attacks and trigger types while preserving baseline accuracy. Our code is available at https://github.com/Alex66366/ODPure.
Authors:Lizhou Liang, Xinyu Zhong, Miao Pan, Xiaohe Zhou, Xuanyu Liu, Qinfeng Li, Peng Li, Jintao Chen, Xuhong Zhang, Wenqi Zhang
Abstract:
Long‑horizon embodied interaction requires agents to retain and continually update information about the environment as they observe, act, and encounter change. Yet current agents struggle to maintain such memory reliably. Our analysis traces this limitation to four key deficiencies: weak fine‑grained visual memory, unreliable dynamic world‑state tracking, failing to record world state revealed by interaction outcomes, and limited generalization from prior experience. However, existing benchmarks do not directly assess these memory capabilities during long‑horizon embodied interaction. To address this gap, we introduce EmbodiedMemory‑Bench (EMem‑Bench), comprising 2,554 interactive episodes across four task families. EMem‑Bench requires agents to build and update memory from interaction history, then use it to complete a later task by acting in the environment. We further present Embodied‑Memorizer (EMem), an external memory system that organizes embodied experience into spatial, event, and scene memories. We also train EMem‑8B, an 8B policy that manages and uses these memories. We evaluate a diverse range of open‑source and proprietary MLLMs and representative multimodal memory systems. Results show that current models remain weak and uneven across the four challenges. Under matched backbones, EMem achieves the best overall performance among the evaluated memory systems and improves both open‑source and proprietary models, while EMem‑8B further improves over its backbone. Project page: https://zju‑omniai.github.io/EmbodiedMemoryBench/
Authors:Zeyu Ding, Yong Zhou, Jiaqi Zhao, Wen-Liang Du, Xixi Li, Hancheng Zhu, Rui Yao, Abdulmotaleb El Saddik
Abstract:
Visual grounding in remote sensing images aims to locate objects described by referring expressions. Most existing methods predict horizontal bounding boxes, which are often inaccurate for objects with arbitrary orientations. To address this limitation, we introduce O^2‑VG, a family of models for oriented object visual grounding with three complementary designs. Specifically, O^2‑VG‑Trans is a cross‑modality transformer for oriented object visual grounding. It establishes a strong discriminative foundation for the model family. Building upon it, O^2‑VG‑Uni predicts universal oriented proposals for possible foreground objects without specific text prompts. It also supports object retrieval through cached proposal embeddings. Using these universal oriented proposals as input prompts, O^2‑VG‑VLM is an autoregressive vision‑language model. It generates oriented box token blocks in parallel through multi‑token prediction. In addition, we construct DIOR‑R‑RSVG, a dataset for oriented object visual grounding in remote sensing images. It provides image, expression, and oriented box triplets for training and evaluation. Together, the O^2‑VG family provides a flexible framework that spans discriminative transformers and generative vision‑language models. It achieves superior performance across multiple benchmarks. Code is available at https://github.com/wokaikaixinxin/ai4rs.
Authors:Runwu Shi, Kai Li, Yujin Wang, Dong Yang, Jiahui Li, Jiang Wang, Chang Zeng, Benjamin Yen, Ashizawa Takeshi, Chunxiang Jin, Kazuhiro Nakadai
Abstract:
Text‑to‑audio (TTA) generation aims to synthesize realistic audio that faithfully reflects natural‑language descriptions. Most TTA systems adopt a two‑stage latent paradigm: an audio tokenizer is optimized for reconstruction and then frozen, after which a generative model is trained in the resulting latent space. However, reconstruction‑oriented representations may be suboptimal for generation, motivating joint representation and generative learning. To this end, we introduce Unite‑Audio, to our knowledge, is the first to jointly learn continuous audio representations and latent flow matching for TTA. By coupling reconstruction with self‑supervised generative prediction, Unite‑Audio allows the generative objective to directly shape the latent space rather than treating it as a fixed intermediate representation. We further employ Flow‑GRPO post‑training to improve text‑conditioned generation. Experiments show competitive TTA performance with a compact latent flow model, while ablation studies confirm the benefit of jointly learning the audio representation and generative model. Audio samples are available at https://runwushi.github.io/Unite‑Audio.
Authors:Thomas Ratsakatika, Mihai Zotta, Srinivasan Keshav, Emily R. Lines
Abstract:
Old‑growth forests develop over centuries under minimal anthropogenic disturbance, producing structurally complex and biodiverse stands. In Europe, protecting them requires mapping that is accurate for individual forest parcels yet deployable continent‑wide. Geospatial foundation model (GFM) embeddings enable label‑scarce land classification, but their value for old‑growth detection remains unknown. Here, we map old‑growth forests across 211,893 ha of Romania's Southern Carpathians, a beech‑spruce landscape typical of the Alpine Biogeographic Region. We construct high‑confidence, expert‑informed reference labels for old‑growth and non‑old‑growth parcels. We add AlphaEarth, TESSERA v2 and Sentinel‑1/2 features to a common baseline of topographic and human‑access predictors, then compare them under spatially blocked validation with and without 10 km train‑test buffers to limit residual autocorrelation. With buffering, GFM and Sentinel‑1/2 predictors increase precision‑recall AUC by 0.21‑0.25 [95% CIs: 0.15‑0.34] relative to baseline, indicating spectral data contain a spatially robust old‑growth signal. With a PR‑AUC of 0.84 [0.79‑0.88], TESSERA outperforms Sentinel‑1/2 (+0.08 [+0.05 to +0.11]) and AlphaEarth (+0.08 [+0.04 to +0.12]) under unbuffered spatial validation. At a 10 km buffer, however, this advantage narrows to +0.04 [‑0.01 to +0.11] and +0.03 [‑0.04 to +0.10], intervals consistent with no difference. At 10 m resolution, convolutional neural networks add no benefit over pixel‑based XGBoost. Comparisons with four national‑ and continental‑scale products show the importance of non‑old‑growth labels, and reveal 81% agreement between our predictions and a field‑calibrated map. We conclude that buffered spatial validation is vital when transferring old‑growth detection models to unseen landscapes, and provide our labels and predictions for future work.
Authors:Yuan Qian, Jie Ma
Abstract:
Remote sensing change detection (RSCD) is essential for monitoring land‑cover changes and urban development. However, most methods demand pixel‑level change masks, which are costly and time‑consuming to annotate. Weakly supervised methods reduce this cost by using image‑level change labels. Yet these labels indicate only whether a change occurs, leaving models to recover the location of the change and semantic meaning through additional and complex mechanisms. This missing information can be supplied directly by change captions, which describe what changes, what it becomes, and where it occurs. Therefore, we introduce change‑caption‑guided RSCD, using change captions as the sole task‑specific supervision to learn change masks without manually annotated change masks. Our framework has two components: a caption‑driven generation pipeline that produces bi‑temporal remote sensing image pairs at scale with controlled changes matching each caption, and a change detector guided by the caption's transition semantics. The detector uses our Semantic‑Appearance Agreement Framework (SAAF) to combine caption‑grounded semantic responses with RGB differences for change localization, while text conditioning guides dense prediction. Experiments on our newly constructed Flair‑RSGen dataset and WHU‑CDC show that SAAF outperforms the closest reproduced limited‑supervision baselines in macro‑averaged IoU and F1 under the evaluated protocols. Code is publicly available at https://github.com/qianyuancs/SAAF.
Authors:Jiakang Jin, Yixiao Huo, Pengyuan Wang, Yinan Han, Tingxuan Zhang, Zhuobing Zhao, Xuanxin Zhou, Zhangchen Ye, Enxuan Ruan, Yifei Bao, Jiankun Yang, Chenghao Sun, Wenhao Cui, Xiaoyu Tian, Yiming Li
Abstract:
Humanoid soccer contact skills require more than producing high‑impact foot‑ball contacts: the robot must close the loop over perception, approach, alignment, impact, and recovery while its own motion induces substantial viewpoint changes, frequent loss of the ball from view, and uncertain contact outcomes. In this work, we ask a compact yet stricter question: can a humanoid learn soccer contact skills using only a head‑mounted depth image, proprioceptive history, and an optional low‑dimensional task command, and directly output 25‑DoF joint PD targets without extra runtime perception or planning modules? To this end, we propose DAVIS, a depth‑only end‑to‑end framework for humanoid soccer skills that learns visibility‑aware auxiliary geometry during training, and combines GT‑to‑prediction annealing, task curricula, and AMP‑style motion priors to smoothly bridge privileged supervision and real deployment. Built on this framework, we instantiate representative soccer contact skills, including goal‑directed shooting and directional dribbling, through task‑specific definitions of objects, commands, rewards, and curricula, and validate them through simulation, Noetix E1 real‑robot experiments, and ablations.
Authors:Liang Zeng, Maarten Vergauwen
Abstract:
Standard contrastive learning frameworks are mainly designed from a semantic perspective, yet learning 2D visual representations that preserve 3D spatial structure is also important for scene understanding. In this work, we propose Depth‑Guided Contrastive Learning (DGCL), a simple auxiliary objective that injects 3D spatial awareness into 2D contrastive representation learning. Our key idea is to use depth to convert local 3D proximity into contrastive similarity: pixels that are closer in 3D space are encouraged to have more similar representations than pixels that are farther apart. Instead of relying on absolute depth values, DGCL formulates supervision through relative 3D distance comparisons among randomly sampled pixels, making the objective invariant to depth scale, efficient to compute, and easy to integrate into existing contrastive frameworks. Experiments across different datasets and models show that DGCL consistently improves 2D representation learning and benefits semantic downstream tasks by stronger spatial and geometric understanding. The code is available on https://github.com/LeungTsang/DGCL.
Authors:Haitong Jiang, Chunlin Liu, Yile Wang, Yuhong Feng
Abstract:
Closed‑loop revision is increasingly used in large language model (LLM) applications, but failures may reflect incomplete feedback or ineffective responses to correct feedback. We introduce a fixed‑budget revision protocol with deterministic verifiers that report all remaining violations across exact‑length, lexical, and compositional constraints. Fixing feedback correctness and completeness isolates model‑side revision behavior. Across 19 open‑ and closed‑source models, controller‑level mean final joint success ranges from 17.4% to 99.8%, with substantial cross‑model gaps persisting under identical initial drafts. Controlled experiments reveal reproducible model‑specific responses to exact feedback. Post‑training and scale reshape these responses without consistently bringing them closer to exact correction. Across all constraint families, failed trajectories often repeat earlier outputs, and prior recurrence is associated with lower subsequent recoverability. Matched‑state interventions show that removing earlier dialogue while holding the current draft and feedback fixed changes recurrence escape without reliably improving final success; effects depend on the model, task, and trigger‑state composition. Exact feedback makes revision errors observable, but does not make the closed loop reliable. Code and reproduction instructions: https://github.com/kevinjiang0121‑cyber/exact‑feedback‑code.
Authors:Julian Oelhaf, Georg Kordowich, Christian Bergler, Andreas Maier, Johann Jäger, Siming Bayer
Abstract:
Studies of machine‑learning‑based power system protection are difficult to compare because task definitions, measurement access, data partitions, metrics, and generalization conditions often differ. EvEMTBench addresses this gap with an open, executable, and versioned benchmark that fixes these evaluation choices while leaving model design open. Across four grids spanning 20‑345 kV, it defines 12 protection and event‑analysis functions instantiated as 24 scored tasks and supports structured evaluation across observability conditions, predefined distribution shifts, and zero‑shot and fine‑tuned cross‑grid transfer. Committed partitions, leakage controls, and reproducible reporting provide a common basis for comparing future methods. A reference evaluation spanning trivial, conventional, feature‑based, and deep‑learning baselines shows that wider observability is not uniformly beneficial, shifted conditions can reveal failures not apparent in‑distribution, and cross‑grid transfer is substantially stronger for fault detection than for fault localization. Protection‑relevant diagnostics identify failure modes not apparent from primary metrics alone. EvEMTBench therefore makes generalization in machine‑learning‑based protection an explicit and reproducible evaluation problem.
Authors:Fuqiang Zhao, Qian Liu
Abstract:
Synthesizing realistic articulated hand‑object interactions is a fundamental problem in virtual reality, embodied intelligence, and digital human applications. Existing methods for dexterous grasp synthesis typically regress or denoise poses in a joint space that couples global rigid motion with local articulation, which often yields unstable samples and physically implausible contacts. We introduce DEAL‑Grasp, built upon the Decoupled Alignment (DEAL) representation, which reformulates grasp synthesis as alignment‑space generation: the interaction state comprises task‑space geometric anchors and articulation parameters, from which the rigid transform is recovered via closed‑form Procrustes alignment while preserving local articulation. On this mixed state, we model grasp generation using heterogeneous‑state flow matching with component‑wise vector fields, incorporating time‑adaptive physical regularization during training. At inference, grasps are synthesized solely by integrating the learned vector field, without test‑time optimization or auxiliary physical guidance. Across MultiDex and zero‑shot RealDex benchmarks, DEAL‑Grasp attains high force‑perturbation success rates alongside minimal penetration and high diversity of generated grasps, while substantially reducing native inference latency compared to optimization‑heavy baselines. The project page is available at https://wmtlab.github.io/DEAL‑Grasp/.
Authors:Susanne Schaub, Florentin Bieder, Matheus L. Oliveira, Yulan Wang, Buyanbileg Sodnom-ish, Dorothea Dagassan-Berndt, Michael M. Bornstein, Philippe C. Cattin
Abstract:
Dental cone‑beam computed tomography (CBCT) systems often employ detector configurations that provide a truncated field of view (FOV) that only captures a small part of the patient's anatomy. In this work, we aim to reconstruct an extended FOV using projections of truncated FOV scans. To this end, we propose a three‑stage framework that consists of (1) an implicit neural representation (INR) for estimating missing parts of the truncated projection data, (2) an iterative reconstruction for generating a secondary volumetric image with improved anatomical consistency and (3) a fast diffusion model for image enhancement. The proposed approach combines the strengths of continuous representations, physics‑based reconstruction and generative refinement within a unified pipeline for truncated CBCT imaging. Experimental results demonstrate that the method effectively reduces truncation artifacts, improves the reconstruction of structures extending beyond the original FOV and produces images with enhanced quality. Our code is publicly available at https://github.com/SusanneSchaub/CBCT‑FOV‑Extension.
Authors:Jiayi Zhang, Renlong Wu, Yukang Ding, Sibin Deng, Wangmeng Zuo
Abstract:
Digital zoom transitions between dual cameras often exhibit conspicuous discontinuities in geometric structure and chromatic consistency, degrading the user experience. While recent dual‑camera smooth zoom (DCSZ) methods attempt to mitigate this by fine‑tuning frame interpolation (FI) models on DCSZ data, they struggle with the large cross‑view disparities and complex geometric transformations. Considering that the generative prior of diffusion models is suitable for addressing this problem, we explore their application to DCSZ. However, naively applying existing diffusion‑based FI models still yields low‑fidelity transitions due to insufficient conditional guidance, high‑frequency information loss during VAE encoding, as well as inadequate temporal consistency. To address this, we propose ZoomDiff, a high‑fidelity diffusion model that leverages dual‑camera inputs in both latent and pixel spaces for photo‑realistic transitions. Specifically, we first strengthen dual‑image conditional guidance during the multi‑step denoising process to improve geometric consistency. Then we inject flow‑aligned multi‑scale features from the VAE encoder into the VAE decoder to recover high‑frequency details, where flow‑guided temporal consistency supervision are introduced to produce more smooth transitions. Extensive experiments on both synthetic and real‑world datasets demonstrate that ZoomDiff outperforms state‑of‑the‑art methods quantitatively and qualitatively. Project page: https://jiayi‑hit.github.io/ZoomDiff.github.io/.
Authors:Esteban Garcés Arias
Abstract:
Evaluating open‑ended text generation involves understanding how different properties of a continuation relate to its perceived quality. We present a reference‑based framework for examining coherence and diversity through three perspectives: aligning their evolution with human trajectories, comparing their summaries with a human continuation of the same prompt, and estimating their likelihood under a human reference distribution. Experiments with human quality ratings suggest that diversity‑based alignment and mean‑based comparisons capture quality‑related variation, although the comparisons do not establish a predictive advantage for temporal alignment over simpler baselines. Reference likelihood also shows positive associations with ratings, with results varying across reference configurations and scoring horizons. Together, these analyses provide a structured way to examine how measured coherence and diversity relate to human judgments, while distinguishing similarity to human references from quality itself. Code and analysis resources are available at https://github.com/EstebanGarces/likely_human.
Authors:Kevin Lee, Alison J. March
Abstract:
Space weather early warning depends on detecting solar wind transients in in‑situ measurements at the first Sun‑Earth Lagrange point (L1), before they reach Earth. Fixed thresholds can miss combined magnetic and plasma structure, and many learning methods provide a single anomaly score. We present the Physics‑Informed Solar‑wind Convolutional autoEncoder for Space‑weather (PISCES), a convolutional autoencoder trained without catalog labels on OMNI solar wind measurements under physics constraints. Its loss includes magnetic field consistency, an empirical relation between temperature and velocity, the Parker spiral angle, and penalties on changes between consecutive one‑minute samples in derived quantities calculated from the reconstruction. At inference, PISCES separates the anomaly score into magnetic and plasma reconstruction errors, physics relations, and residual corrections, and reports the magnitude of each contribution. Attenuation of the skip connections, selected on validation data, improves average precision for the trained models, while the untrained scores remain nearly the same. The trained models also give a more consistent ordering of these physical contributions. After smoothing with a trailing median, the alarms can precede independently observed sudden commencements, including positive sudden impulses.
Authors:Georg Pichler
Abstract:
We settle three conjectures concerning a doubly symmetric binary source (X,Y) with crossover p. Consider Markov chains U ‑ X ‑ Y ‑ V with U,V binary, and let \mathcalA be the set of rate triples (I(U;V),I(U;X),I(Y;V)) attainable with arbitrary binary channels X\to U, Y\to V, and \mathcalB the subset attainable with binary symmetric channels. The averaged BSC conjecture, Conjecture 5.2 of Pichler, Piantanida and Matz (2022), asserts \operatornameconv\mathcalA=\operatornameconv\mathcalB. We prove this for every p\in[0,1]. Two conjectures of Dikshtein, Ordentlich and Shamai (2022) concern the double‑sided information bottleneck at p=0, where Y=X and the two channels see the same source: their Conjecture 1 identifies the exact maximum of I(U;V) at prescribed rates I(U;X) and I(Y;V), and their Conjecture 2 the exact minimum. We prove both for binary U,V: the two extrema are attained by the same pair of Z/S‑channels, in opposite orientation for the maximum and in the same orientation for the minimum. The proofs were found with substantial AI assistance, and all three theorems are formalised in Lean 4 with Mathlib, depending only on the standard axioms. The development is available at https://github.com/g‑pichler/bsc‑averaging . The proof of Conjecture 1 of Dikshtein, Ordentlich and Shamai (2022) contains three certified computations, a polynomial bound, an interval sweep and a polynomial positivity certificate, all of which are checked in Lean.
Authors:Andrew Bond, Ege Erdem Özlü, Tuna Çimen, Ilkin Umut Melanlioglu, Tolga Birdal, Erkut Erdem, Aykut Erdem
Abstract:
Methods operating on Vision Transformer (ViT) feature spaces typically rely on Euclidean distance or cosine similarity. This assumes that every direction is equally meaningful, but there is no reason to believe the true task geometry has this property. The task‑sensitive geometry of the feature space is given by the pullback metric g(F) = J(F)^\top J(F), where J is the Jacobian of the decoder's output fed to a task‑specific distance, with respect to the features. Storing the full g is infeasible at modern scales, and for dense outputs such as depth maps even forming J is impractical. We show that whether a low‑rank approximation of this metric can be learned depends on the model‑decoder pair, and we characterize this with a matrix‑free diagnostic κ_cap(r) computable with a low number of Jacobian‑vector products. For tractable pairs, we develop the Spectral Pullback Network (SPN), which learns a low‑rank version of the metric from randomized power iteration, and we distill it into a 310K‑parameter importance head that predicts token importance directly from the features. When the Jacobian spectrum is too spread out for a low‑rank approximation, passing the decoder's input features through a VAE bottleneck can restore tractability. Across DPT, DINOv2, CLIP, and VGGT backbones, κ_cap(r) predicts which learned‑metric architectures are viable. The importance head reaches Spearman ρ= 0.998 on DINOv2 CLS, and our geometric token pruning reduces the additional depth error of ToMe‑based token selection by 25% on DPT depth at prune ratio 0.5, without fine‑tuning the ViT. Project page: https://cyberiada.github.io/TaskInducedViTs/
Authors:Rasmus Aagaard, Nicki Skafte Detlefsen
Abstract:
Pruning large pre‑trained transformer‑based ASR models such as OpenAI's Whisper has seen great adoption, as pruning the decoder led to significant end‑to‑end transcription speedups. For instance, the \tt whisper‑large‑v3‑turbo variant reduced the decoder from 32 to 4 layers, while Distill‑Whisper similarly reduced the decoder to only 2 layers. Although some attention has been put towards reducing the size of the encoder, no approach has seen wide adoption. This could be due to the need for custom inference implementations to take advantage of the compressed model. We present an approach that ranks encoder layers by the leave‑one‑layer‑out change in Word Error Rate (WER). The six layers that cause the least change are removed, corresponding to 18.5% of the encoder stack. The pruned model requires no custom inference code as it is simply a more shallow encoder with fewer layers. We further distill using unlabeled monolingual speech data to recover performance degradation caused by the zero‑shot layer pruning. Mean WER across four languages increases to 20.1% after distillation, compared to 21.9% zero‑shot, going from a baseline of 18.2%. We release all of our code (https://github.com/rasgaard/whisper‑encoder‑layer‑prune) and the pruned model (https://huggingface.co/rasgaard/whisper‑large‑v3‑turbo‑encoder‑pruned).
Authors:Naser Alizada, Farhang Baghban, Hashem Pishkar, Ali Mousavi
Abstract:
Implicit neural representations (INRs) have emerged as a promising paradigm for video compression, providing compact neural representations with flexible spatial and temporal reconstruction. Hierarchical grid‑based architectures such as HiNeRV achieve strong rate‑‑distortion performance, but require extensive per‑video optimization, resulting in high encoding costs. To address this limitation, we propose ScoutNeRV, a content‑adaptive initialization framework for accelerating the optimization of hierarchical video INRs. ScoutNeRV employs a lightweight, offline‑trained scout network that analyzes a small number of sampled frames and selects a suitable pre‑trained expert from a memory bank through hard routing. The hierarchical grid and decoder parameters of the selected expert are then transferred to initialize the target HiNeRV model before video‑specific fine‑tuning. On the unseen ReadySetGo sequence, ScoutNeRV achieves an initial PSNR of 34.95~dB, compared with 13.70~dB for standard initialization, corresponding to a 21.25~dB improvement before fine‑tuning. After only 37 epochs, ScoutNeRV reaches 36.92~dB and remains within 0.42‑‑0.80~dB of the 300‑epoch HiNeRV baseline across the evaluated rate‑‑distortion configurations. Furthermore, the proposed initialization achieves a 9.25× wall‑clock speedup in the reported runtime experiment. These results demonstrate that content‑aware expert initialization can substantially reduce the optimization cost of hierarchical video INRs while retaining competitive reconstruction and compression performance. The code is available at https://github.com/nasserdeveloper/ScoutNeRV.
Authors:Jinhyung Bae
Abstract:
Neural combinatorial optimization solvers generate many candidate solutions per instance and report the best one found, using the same sample budget for every instance regardless of difficulty. A companion study showed that reallocating a fixed budget toward harder instances can improve solution quality, but that the standard way of measuring this improvement is biased: deciding an allocation and evaluating it on the same data can manufacture an apparent gain even when none exists. This left open what property of a workload determines whether reallocation is worth doing, and whether a policy that spends part of the budget to decide how to allocate the rest still pays once that cost is counted. This paper answers both questions through pre‑registered confirmatory experiments ‑‑ analysis and verdict criteria fixed before data collection ‑‑ across three independently trained solvers and two ways of constructing harder workloads on the traveling salesman problem. Within the workloads we study, the deciding property is how varied the instances within a workload are in difficulty, not how difficult the workload is on average: a uniformly easy or uniformly hard workload offers little room for reallocation, while a mixed workload offers substantial room. A budget‑aware policy that pays for its own information about instance difficulty recovers most, though not all, of the improvement available when that information is assumed free. Every experiment was independently recomputed from its written specification, and every correction to an earlier version ‑‑ including two that weakened the paper's own claims ‑‑ is reported with the direction it moved the conclusion. The paper offers a specific empirical answer and a template for verifying that answer is not an artifact of how it was measured.
Authors:Silin Chen, Yufei Yang, Xiaodong Gu, Yuling Shi, Chengcheng Wan, Haibing Guan
Abstract:
Repository‑level coding benchmarks have become the standard for evaluating coding agents, yet they inherently suffer from data leakage because they are built upon popular open‑source repositories repeatedly used for training. Consequently, strong performance may reflect memorization of canonical repository cues rather than robust repository reasoning. We propose SchrodingerRepo (Schrödinger's Repository), an evaluation framework for testing coding agents under dynamically instantiated repository representations. Instead of repeatedly using a static representation of the test repository, SchrodingerRepo treats the test repository as an evaluation‑time latent variable that is dynamically instantiated only when the agent enters the evaluation environment. The instantiated repository preserves the original executable behavior while eroding familiar cues such as naming conventions, file layouts, and implementation patterns through four transformation levels: problem statement reconstruction, namespace remapping, intra‑file layout reordering, and functionality‑preserving code rewriting. We evaluate popular LLMs on SWE‑bench Verified and SWE‑QA. Results show that removing familiar repository cues consistently degrades agent performance and substantially increases interaction costs across models. Further analysis reveals that the additional cost is primarily caused by increased difficulty in repository exploration and localization. These findings suggest that current coding agents may partially rely on memorized repository‑side cues, highlighting the need for evaluation under dynamically instantiated repository representations.
Authors:Varun Pratap Bhardwaj, Garima Singh, Arun Pratap Bhardwaj
Abstract:
In mainstream agent frameworks, a step ends when the agent's own output says it has finished. Durable‑execution platforms bound retries and time, but their checker conventionally lives in the same codebase as the work: a discipline the deployment is trusted to keep, not a property the harness enforces. We state what an agent harness must guarantee, prove it, and build the instrument that measures whether a harness delivers it. A bounded loop is a worker, an independent gate the worker cannot write to, and a declared budget; a bounded‑loop graph composes them with a repair relation that lets a downstream failure re‑run a finished upstream node. Three guarantees follow. It finishes: termination holds under repair, with the worst‑case attempt total in closed form, if the repair budget is global not per node. It does not drift: no node reaches DONE without a gate verdict in an append‑only hash‑chained ledger, proved from control flow, since repair leaves no topological order to induct along. It does not overspend: the ceiling is enforced inside an attempt, not between attempts. Gates are measured against a two‑tier held‑out mutant corpus. We characterise two classes that let a sound‑looking check pass anything: vacuity, satisfied by the absence of the thing checked, and self‑attestation, where the subject supplies the value the check is applied to. On a 69‑loop catalogue the instrument found 47 vacuous gates in shipped, reviewed code. Against the repaired gates it reports no false accepts over 209 destroying mutants (α\le 1.8%, Wilson 95%); that figure is saturation, not quality: freezing the gates and applying a fresh operator family recovers a 23.3% false‑accept rate where the exhausted corpus reported none. A rate belongs to a specific gate; the apparatus, not our number, is the contribution. Engine, catalogue and corpus are Apache‑2.0.
Authors:Wei Zhang, Shiqiang Gong, Shengkai Yu, Zeyu Wang, Clement Mallet, Zhitong Xiong, Qi Wang
Abstract:
Octree‑based 3D Gaussian Splatting organizes anchors into multi‑level hierarchies for level‑of‑detail rendering, but features at different levels are typically optimized independently, leaving the octree topology underused during feature learning. We observe that uniform cross‑level aggregation produces asymmetric effects: fine‑level anchors benefit from coarse context, whereas coarse‑level anchors require selective information from their descendants. We therefore propose TopoGS, a topology‑aware anchor feature aggregation framework with two lightweight components. Hierarchical Anchor Coupling establishes bidirectional cross‑level gradient pathways by fusing per‑level context triplets with a residual MLP. Structure‑Aware Containment Aggregation uses octree containment and hash‑based matching to distinguish anchors with valid parent‑child relations from isolated anchors, then applies soft weighting to accommodate varying topological sparsity. Experiments on ten scenes from Mill19, UrbanScene3D, Tanks & Temples, MatrixCity, and WHU show consistent improvements over state‑of‑the‑art methods. TopoGS achieves average PSNR gains of 2.13, 1.78, and 0.29 dB over the strongest reported baseline on aerial, ground‑level, and synthetic‑cartographic scenes, respectively, while rendering faster and using less memory. Code is available at https://github.com/WZ‑CS/TopoGS.
Authors:Olga Mashkova, Robert Hoehndorf
Abstract:
Knowledge graph completion is evaluated by ranking observed triples above randomly corrupted ones, which treats every unobserved fact as false. When the object being completed is a description logic knowledge base rather than a plain graph, the open world assumption and deductive closure make this inadequate: relative to the knowledge base, a candidate axiom is entailed, contradictory, or undetermined, and a model that cannot separate a logically impossible axiom from a plausible novel one is not merely less accurate but semantically incorrect. We ask what it means for a knowledge base completion model to be logically faithful, and whether current embedding models are. We define a hierarchy of four increasingly strict criteria, discrimination, logical admissibility, monotonic logical faithfulness, and probabilistic logical faithfulness, and prove that they form a strict chain of implications. We ground the strongest criterion in the relative model count P(α\mid\mathcalO) = \#(\mathcalO\cup\α\)/\#(\mathcalO), which recovers the trichotomy at its endpoints and ranks undetermined axioms in between. Evaluating knowledge graph and logic‑geometric embedding models on \mathcalEL ontologies, with entailed, contradictory, and undetermined test sets generated by a reasoner, we find that ranking accuracy does not imply logical faithfulness and that none of the evaluated models is faithful across the hierarchy. The code is available at https://github.com/bio‑ontology‑research‑group/kbc.
Authors:Yuwei Zhao, Chuanzheng Gong, Baogui Huan, Feng Gao, Junyu Dong, Qian Du
Abstract:
Multi‑source remote sensing image classification has attracted increasing attention due to the complementary spectral, structural, and geometric information. However, existing methods still suffer from two limitations: insufficient semantic contextual modeling and unreliable feature fusion caused by slight spatial misalignment. To address these issues, we propose a Semantic‑Guided Fusion Network (SGFNet) for multi‑source remote sensing image classification. Specifically, the Semantic Mixing Convolution Block (SMCB) is designed to dynamically generate semantic‑aware convolution kernels according to contextual relationships among feature representations. In addition, the Frequency Modulated Fusion Block (FMFB) is introduced to perform cross‑modal interaction in the frequency domain, which effectively alleviates the influence of slight spatial misalignment and improves complementary information fusion. Extensive experiments conducted on the Augsburg and Houston 2018 datasets demonstrate that the proposed SGFNet consistently outperforms several state‑of‑the‑art methods. The codes are publicly available at https://github.com/oucailab/SGFNet .
Authors:Zhonghan Bian, Zhenran Wang, Jinsong Li, Zhangyang Qi
Abstract:
Bounding‑box scores on RefCOCO‑family grounding leave little room to distinguish frontier vision‑language systems, yet boxes discard object shape. We introduce GroundingBench, a matched benchmark that re‑targets the same 1,500 image‑expression‑referent triples to exact‑N polygons at five vertex budgets. A fixed‑denominator harness separately audits filled‑region intersection over union (IoU) and legal‑polygon completion. The strongest tested configuration reaches 88.2 box IoU and 97.1 accuracy at IoU >= .5 (Acc@.5), versus 57.7 and 69.2 for direct polygons; because these headline scores use different references, we also compare direct polygons with predicted boxes rasterised against the same contour target, obtaining 57.7 versus 57.3 when pooled. Performance is non‑monotone in N and collapses at the densest budget, where legality failures compound residual geometric error. Qwen's thinking‑setting contrast is the largest tested input‑preserving configuration difference; under frozen templates, false spatial cues are more damaging than false colour cues, and target preference can remain high while contour tracing is poor. Alternate masks and a continuous‑area scorer preserve the principal ordering. GroundingBench therefore measures an operational output‑geometry gap spanning localisation, boundary construction, serialisation, and topology, rather than latent boundary perception alone.
Authors:Rahil Aftab, Vineet Kumar Rakesh, Soumya Mazumdar, Tapas Samanta
Abstract:
Federated wearable models eventually serve people absent from source training, but favorable average accuracy does not establish that unlabeled onboarding helps each person. We evaluate six core onboarding strategies on five wearable datasets under a leakage‑controlled protocol that fixes source checkpoints, estimates normalization from source data only, separates calibration from evaluation recordings, and performs inference over held‑out people rather than windows, devices, or random seeds. Completing all eligible HHAR and PAMAP2 outer‑person rotations materially changes the conclusion obtained from the original frozen fold. On HHAR, balanced accuracy on that single person is 95.6‑97.2% across methods versus 78.3‑83.0% over all nine users, a reduction of 13.8‑17.8 percentage points (pp). The displayed mean leader changes on both datasets, while paired leader‑runner bootstrap intervals include zero and do not resolve a superior method. No adaptive core mechanism combines positive mean gain in all five datasets with zero seed‑averaged person‑level losses greater than 2 percentage points (pp). FedBN has one such loss and ATP‑style adaptation has eight; Feature‑only has none after seed averaging, but its exact one‑sided 95% upper bound is 7.6%. A complementary seed‑person stress audit records 4, 22, and 10 harmful realizations out of 114 for FedBN, ATP‑style, and Feature‑only, respectively; these are repeated realizations, not independent participants. Tail quality, calibration availability, and fall‑window specificity reveal additional failures hidden by mean accuracy. The study therefore provides an auditable development benchmark and failure map rather than a universal‑superiority or deployment‑safety claim.
Authors:Shengyang Xu, Weijun Zhang, Jun Hu, Pengzhan Jin
Abstract:
We propose the Memory‑Efficient Neural Operator (MENO) as a high‑performance PDE neural solver based on the Manifold Function Encoder (MFE). MENO features three primary advantages: (1) MENO has a significantly smaller memory footprint and much faster training speed than other popular architectures, with the memory footprint being independent of the data resolution, and therefore holds the potential for scaling up to large‑scale models. (2) MENO can accept PDE inputs of arbitrary form, including arbitrary geometric domains and arbitrary discretizations. In particular, it is capable of handling cross‑geometry scenarios, i.e., where the input functions and the output solutions are defined on different manifolds. (3) MENO exhibits strong generalization capability, and achieves the best accuracy on most of the benchmarks we tested, compared with the results reported in the literature. The code is available on GitHub at https://github.com/jpzxshi/MENO, and all numerical examples in this paper can be run with a single command to reproduce the reported results.
Authors:Xiaohe Jiang, Guoqiang Zhang, Tianjin Huang, Ronghui Mu
Abstract:
Newton‑Schulz (NS) iteration has recently been used in the Muon optimizer to transform update matrices during the training of large language models. Motivated by its spectral effect, we investigate applying NS directly to Transformer attention representations. We introduce Newton‑Schulz Attention (NS‑Attn.), a parameter‑free transformation applied to the output of each attention head. Each head output is arranged as a feature‑by‑token matrix and normalized by its Frobenius norm. We then apply a finite NS polynomial step and restore the original norm. The objective is to reduce spectral concentration and increase effective rank before standard head merging and output projection. Across ViT and Swin on CIFAR‑10 and CIFAR‑100, NS‑Attn. improves final‑epoch accuracy in all 12 matched‑seed comparisons, with mean gains of 0.25‑‑0.83 percentage points. ViT ablations show higher mean accuracy with one iteration than with two. Spectral analysis further shows reduced leading‑eigenvalue concentration and increased effective rank. These gains incur additional inference latency.
Authors:Awais Nizamani, Hamid Laga, Guanjin Wang, Farid Boussaid, Mohammed Bennamoun, Anuj Srivastava
Abstract:
We introduce NeuralSRNF, a novel framework for the statistical shape analysis and generation of genus‑zero 3D and 4D objects that undergo nonrigid deformations. Traditional methods rely on complex and computationally expensive nonlinear elastic metrics that measure bending and stretching. Recent advances in elastic shape analysis achieve computational efficiency by mapping input 3D shapes to the space of Square Root Normal Fields (SRNFs) where the L2 metric approximates the partial elastic metric, significantly facilitating the process of computing geodesics and summary statistics. SRNFs, however, are not invertible, and the numerical algorithms used to map SRNFs back to the original space of surfaces remain computationally very expensive and often lead to approximate results. This paper addresses this fundamental SRNF inversion problem using a novel neural representation, termed NeuralSRNF. Unlike the commonly used numerical SRNF, NeuralSRNF is (1) continuous, and thus resolution‑agnostic, enabling full functional shape analysis, (2) more accurate, and (3) computationally more efficient as it can compute inverse SRNF maps along a geodesic path in less than 3 s compared to over 10 min for the numerical SRNF. We demonstrate, using various datasets, the utility and efficiency of the proposed NeuralSRNF in multiple elastic 3D and 4D shape analysis tasks such as geodesic computation, deformation transfer, statistical summaries computation, and 3D shape generation. We show that it outperforms competing methods on most evaluated datasets and metrics by a wide margin in both accuracy and computational efficiency. The source code and additional results are available at https://awaisnizamani16.github.io/awais/NeuralSRNF/.
Authors:Christoph Baumann, Ronny Schweitzer, Noemi Pavo, Ulrike Attenberger, Christian Loewe, Philipp Seeböck
Abstract:
The SYNTAX score is an established tool for assessing coronary artery disease and guiding revascularization treatment decisions. However, its manual estimation from coronary angiography videos by clinical experts is time‑consuming and subject to inter‑reader variability. While machine learning has shown promise in automating this process, prior work has primarily focused on lesion detection, characterization, or binary disease classification, leaving direct SYNTAX score prediction relatively unexplored. We propose SynSeq, a video‑based method for direct SYNTAX score prediction. It combines targeted preprocessing with a tailored training strategy using a zero‑inflation‑aware loss and linear target scaling. Evaluated on the public CardioSyntax dataset, SynSeq significantly outperforms previous state‑of‑the‑art methods, improving R^2 by 0.55, reducing prediction bias by 93.1% and achieving more consistent performance across annotations from three independent expert graders. In addition, SynSeq achieves a weighted F_1‑score of 0.80 for revascularization treatment recommendations, slightly below inter‑expert agreement. These results demonstrate the potential of SynSeq to provide consistent, automated SYNTAX score assessment and reliable decision support for coronary revascularization planning.
Authors:Fan Zhang, Yankai Chen, Zhuohan Xie, Yixi Zhou, Sijia Peng, Lei Fan, Xinhua Ji, Cunyuan Zheng, Huangyong Shan, Philip S. Yu, Xue Liu, Yu Chen, Preslav Nakov, Songwei He
Abstract:
Contract inference requires multiple judgments about a shared document, but aggregate accuracy can conceal changes in the individual decisions. Repeated agreement is also insufficient: a model may consistently return the wrong answer. In this paper, we compare Jev with nine language models on ContractNLI, evaluating inference cost, response time, average correctness, and correctness across repeated request conditions. Controlled comparisons vary hypothesis visibility, requested outputs, and output order while keeping the contract and target judgment fixed. Jev has the lowest cost and median response time among the evaluated configurations, while hosted language models achieve higher baseline accuracy. Rankings by baseline accuracy differ from rankings by correctness across every condition and repeat, although small differences in the latter do not establish a general stability advantage. Development diagnostics further reveal compensating corrections and regressions, as well as persistent errors. These findings motivate evaluating cost and response time alongside whether individual judgments remain correct as the request configuration changes. Code: https://github.com/ZF‑Utokyo/Jev‑Benchmark
Authors:Eduin E. Hernandez, Sergio A. Diaz, Luis F. Garcia, Nurassyl Askar, Stefano Rini
Abstract:
Small language models (SLMs) are increasingly paired with knowledge graphs (KGs), yet end‑to‑end KG question answering conflates graph access, search, navigation, reasoning, and answer generation. This coupling makes it difficult both to determine whether an SLM can faithfully execute the reasoning path implied by a question and to attribute failures to navigation rather than to other stages of the pipeline. We isolate this capability by employing the THESEUS navigation and traceability framework and using frozen, off‑the‑shelf SLMs as local action policies. At each hop, the environment exposes the legal outgoing graph actions, and the model selects one executable graph action and decides whether to stop, without task‑specific parameter updates, model‑controlled beam search, or free‑form answer generation. This controlled setting allows us to evaluate terminal‑answer accuracy with Hits@1 together with path fidelity, using Path Edit Distance (PED) as the primary trajectory metric. Across the Kinship and MQuAKE‑ST KGQAs, similarly sized local models differ substantially in answer accuracy and path fidelity, with the two metrics sometimes favoring different models. This model‑dependent behavior also extends to prompting, as a single demonstrated trajectory can improve or degrade navigation depending on the model. These results motivate evaluating SLM graph reasoning beyond endpoint accuracy alone.
Authors:Oleksii Streltsov, Oleksandra Vitko
Abstract:
Solutions based on large language models (LLMs) often rely on temperature sampling to improve accuracy and stability by aggregating multiple samples from the completion distribution. However, this memoryless approach is inherently suboptimal: because it lacks awareness of prior generations and their evaluations, it produces an increasing proportion of semantically duplicate answers as more samples are drawn, leading to diminishing returns. To address this limitation, we introduce FLEET, a novel method that integrates a memory mechanism into the generation process. FLEET represents each generation as a sparse trajectory through states whose entropy exceeds a predefined threshold and uses these trajectories to infer per‑token utility scores that adjust the logits. Benchmark evaluations demonstrate that FLEET achieves the same accuracy as the repeated sampling baseline, with a 3x speedup, and substantially improves accuracy on complex coding tasks (LiveCodeBench Pass@32 increases from 59.9% to 66.2%) under the same budget. Furthermore, in the greedy‑decoding configuration evaluated here, the approach is deterministic and uses a single calibration pass to derive its principal hyperparameters, requiring only minimal modifications to existing LLM pipelines.
Authors:Andrés Juárez, José Chicano, Rubén Saborido
Abstract:
This work presents the development of an automatic refactoring tool for Java code built on top of the Eclipse JDT API. The proposed approach transforms control structures containing break and continue statements within different types of loops into semantically equivalent constructs that avoid their explicit use. To achieve this, auxiliary boolean variables are introduced to restructure the control flow while preserving the original program behavior. The main objective of this transformation is to improve code structure and enable the application of subsequent automated refactorings, particularly those based on the Extract Method operation, which are typically restricted by the presence of jump statements. The implementation relies on the analysis and rewriting of the Abstract Syntax Tree (AST), ensuring semantic equivalence in all addressed scenarios. The tool was validated through 54 manually designed test cases and 151 units tests, all of which produced satisfactory results. In addition, it was applied to 139 methods from seven open‑source projects, generating code without compilation errors and preserving the original behavior as verified by the projects' test suites. The results demonstrate that the proposed approach safely automates the restructuring of code containing break and continue statements, facilitating further evolution and structural analysis.
Authors:Pei-lin Li, Qingle Liu, Junyang Feng, Siyu Li, Sunqi Fan, Xin-Sheng Chen, Shuojin Yang
Abstract:
In‑Context Learning (ICL) has become a cornerstone of modern LLM deployment. However, existing ICL post‑training methods have a critical blind spot: they excel at extracting patterns from demonstrations while often neglecting context authority, the ability to determine whether contextual information should govern the final answer. To benchmark this capability, we introduce FakeContextBench, which contains pseudoscientific claims across seven domains. Our evaluation of commercial and open‑source models shows that large‑scale pre‑training alone is insufficient for reliable context‑authority discrimination. Moreover, prevalent ICL fine‑tuning methods can increase susceptibility to misleading context, reducing reality accuracy by up to 14.95 percentage points relative to the base model. To address this trade‑off, we propose Jurisdiction In‑Context Learning (J‑ICL), a post‑training framework that incorporates context validation into the training objective. Across four model backbones, J‑ICL improves ICLEval by an average of 5.84 percentage points and reality accuracy by 9.20 points over the corresponding base models. It also raises the Reality Rate by an average of 18.09 points relative to MetaICL and Symbol Tuning. These results demonstrate that ICL capability and resistance to deceptive context can be improved together. The benchmark is available at https://github.com/peilin717/FakeContext‑Bench.
Authors:Meng Wang, Tieyun Li, Juntong Fan, Hanyu Pei, Jing-Xiao Liao, Yaodong Yang, Jianwei Ma, Fenglei Fan
Abstract:
The brain does not rely on a single type of neuron to perform all kinds of tasks; instead, it designs different neurons for different tasks. The concept of task‑based neurons represents a paradigm shift compared to task‑based architectures. It argues that solving a specific problem requires customized neurons, as task‑based neurons capture useful prior knowledge from task‑related data. To facilitate the use of task‑based neurons in scientific research and industrial applications, we introduce TNLearn, an open‑source Python package that provides automated construction of task‑based neurons and networks, enabling smooth training of task‑based networks. Comprehensive documentation, including technical exposition, API reference, and representative examples, is available online. TNLearn is open‑sourced at https://github.com/NewT123‑WM/tnlearn and has become a PyTorch ecosystem project.
Authors:Muhammad Usama, Khair Un Nisa, Summer Yeoreum Jung
Abstract:
The safety of a tool‑using language model agent is usually treated as a property of the model alone. We give controlled, full‑precision evidence that it is instead a joint property of the model and the software that renders its chat template and parses its tool calls, the decoding harness, and that both halves are attackable from untrusted input. On the released gpt‑oss‑20b reasoning model under its published tool sandbox, appending a single string of the model's own channel‑control tokens to a user message makes the tokenizer render a reasoning turn that is already complete, so the model writes no chain‑of‑thought and proceeds directly to the tool call. Across forty tasks the model already completes, the reasoning channel falls from a mean of 52.5 tokens to zero on every trial while the http.post still fires on every trial. A rule monitor and a cross‑family language‑model monitor detect the unsafe request on all plain trials and no forged trials, and on overtly malicious requests the attack converts 39.6% of the model's refusals into completed exfiltrations. Separately, whether an identical tool‑call generation fires is decided by the harness parser, not the model: a truncation‑tolerant regular expression fires a call whose closing token is missing while a strict one drops it, and two parsers shipped for the Gemma agent give opposite outcomes on identical greedy generations, firing on all twenty‑four trials and on none. We show the suppression can be delivered indirectly and characterize its dependence on the chat template across two more reasoning models, and we evaluate input sanitization, parser hardening, and empty‑reasoning detection as defenses; flagging an absent trace catches the basic attack but not an adaptive benign decoy. All measurements use greedy decoding on publicly released models. Code and per‑trial logs: https://github.com/Usama1002/deleting‑the‑trace
Authors:Hengyu Li
Abstract:
KITE queries a typed behavioral kernel once per unique state, then executes populations of any size from the table with event‑keyed randomness and common random numbers. An expensive flagship model is reserved for sparse paired anchors that estimate intervention effects. Measured human‑model discrepancy is propagated as shared error into every conclusion. Population‑experiment cost thus scales with unique states and anchors, while uncertainty is governed by evidence about people rather than Monte Carlo noise. On Epstein experiments with 9,070 participants, anchors covering 1.7% of states reduced effect error by 41% (absolute MAE reduction 0.0125). On 37 held‑out SocSci210 experiments, 0.5‑1.5% anchor coverage raised captured decision gain from 0.27 to 0.39. The kernel passed content‑fidelity criteria in all 15 new countries of a 16‑country study. Shared discrepancy yielded retrospective coverage of 93% and 96% at nominal 80% and 90%, versus 29% and 36% from human sampling uncertainty alone. A million agents executed 20 tabulated steps in 0.9 seconds on a laptop. This architecture offers a route to screening candidate interventions before human trials, multi‑country content audits, and uncertainty‑aware policy comparison at the cost of a few thousand kernel calls with sparse flagship anchors. Property‑specific evidence records connect each use to its validation scope, correction provenance, and uncertainty, making these applications auditable.
Authors:Kaifeng Tan, Yudong Li, Linlin Shen
Abstract:
Modern large language models are pretrained on massive datasets, making it difficult to prevent benchmark data from entering their training sets and undermining the reliability of evaluation results. Reliable evaluation is particularly challenging for base models, whose limited instruction‑following ability complicates task‑based assessment. We introduce Uncheatable Eval, a dynamic benchmark that regularly collects newly published text to evaluate base language models and reduce the risk of data contamination. Drawing on the relationship between a model's predictive ability and its ability to compress data losslessly, we use compression rate to evaluate how well models predict new text. We evaluate 80 models across 14 text categories, study how compression changes with context length, and examine the correlation between compression rate and zero‑shot MMLU accuracy. Our results yield three main findings: (1) compression performance follows a consistent scaling trend with model size; (2) attention‑based, hybrid, and recurrent models differ in how their compression performance changes as more context becomes available; and (3) lower compression rates are strongly associated with higher zero‑shot MMLU accuracy. Code is available at https://github.com/Jellyfish042/uncheatable_eval.
Authors:Gyeongwon Jeong, Seonghun Park, Seonghyuk Im, Joonkyung Lee, Hongseok Yang
Abstract:
We prove that the Turán density of the tetrahedron K_4^(3) satisfies π(K_4^(3)) \le 312372062889819/560000000000000 < 0.557808, improving Baber's upper bound of 0.5615 and closing about 62% of the gap to the conjectured value 5/9. The proof uses an exact seven‑vertex flag‑algebra certificate incorporating degree‑stationarity from Razborov's differential method. To find the certificate, we combine the established techniques of cutting planes and column generation to optimize jointly over flag families whose types have at most five vertices. We give a complete formal proof of this Turán density bound in Lean 4.
Authors:Taeyoun Kwon, Seungjin Kim, Hyeonyu Kim, Moon Hwan Kim
Abstract:
Recent video‑language models increasingly adopt hybrid architectures that interleave linear and full attention layers for efficient long‑context processing. While the recurrent state of linear attention remains fixed in size, the KV cache of full attention continues to grow with the video stream, making eviction necessary under a bounded memory budget. The key challenge in streaming is that eviction must occur before the question arrives, so what to retain has to be decided without the question. Existing eviction methods derive token scores from the KV cache itself, using position, attention, or key‑value representations, and attention‑based scores further require proxy queries or extra computation. Hybrid backbones offer another source of signal. In gated‑delta linear attention, the recurrent state is updated by the residual between each input and what can already be retrieved from the state, so its change over a chunk of frames reflects how much new information the chunk brings. We propose DeltaS, a query‑agnostic, training‑free method that retains video chunks inducing larger normalized state change, or state drift. In a controlled comparison with the budget and retention policy held fixed, state drift outperforms position‑, attention‑, and key‑value‑based signals. With a signal costing only 1.9% of the forward pass, DeltaS surpasses the strongest query‑agnostic bounded‑memory baseline by 2.1 points on average across six long‑video benchmarks and by 5.6 points on the longest benchmark. These results suggest that the two memories of hybrid architectures can work cooperatively. Code is available at https://github.com/MaumAI‑Company/DeltaS.
Authors:Iacopo Catalano, Julio A. Placed, Javier Civera, Jorge Peña Queralta
Abstract:
Long‑term autonomy in human‑populated environments requires anticipating whether and how people will move at times a robot has not yet observed. Existing representations of pedestrian motion face a tradeoff: they either forecast future activity, reducing each location to a scalar rate, or model the full directional distribution, holding it fixed in time. We present Kairos, a predictive directional‑flow memory that extends a hierarchical 3D scene graph (3DSG) to a 4D scene graph (4DSG). Every observed voxel of the reconstructed geometry stores a directional mixture and a presence rate, and spectral predictors forecast, for any future query time, both the probability that people are present and the full directional distribution of their motion. Pairwise flow dependence between adjacent voxels supports conditional queries, and per‑voxel predictive variances yield calibrated credible intervals that tighten as observations accumulate. We evaluate Kairos on three real pedestrian environments: a robot‑collected campus dataset, a shopping mall, and a station concourse recorded continuously for eleven months. Its learned state remains consistent under loop‑closure corrections, and its forecasts are competitive with dedicated occupancy and flow models trained on the full detection stream, although Kairos learns from only the small fraction available to a patrolling robot. Finally, we validate the representation on a downstream encounter‑probability planning task, where plans computed over the Kairos forecasts encounter more people than plans computed over any time‑invariant map at an equal success rate. We provide the code at https://github.com/IacopomC/kairos.
Authors:Xueqi Qiu, Yueming Sun, Tianyu Zhang, Yuxuan Xia, Yang Long
Abstract:
Open‑vocabulary 3D segmentation localizes objects from free‑form text queries, but remains challenging in real image sequences: incomplete or noisy 2D supervision destabilizes multi‑view identity assignment, while full‑scene semantic learning weakens object‑level discriminability. We introduce Hybrid Gaussians, a unified 3D representation jointly modeling object association and language‑aligned semantics. Its Multi‑View Object Association mechanism combines Observation Fusion and Semantic Contrastive Learning to improve identity consistency and semantic discrimination. Boundary Reconstruction Optimization further refines local boundary structure to improve contour quality. Experiments on LERF and 3D‑OVS demonstrate strong quantitative and qualitative performance. Our method achieves 59.1% mIoU on LERF, yielding a 13.4% relative gain over the baseline. Project page: https://nora202.github.io/hybridgaussians.
Authors:Xueji Fang, Boqiang Duan, Hua Wu, Jingdong Wang, Guo-Jun Qi
Abstract:
World Action Models (WAMs) jointly model action generation and environment dynamics and are mostly built on pretrained Video Diffusion Models (VDMs). In VDM‑based WAMs, observations are first encoded by a VAE, and the resulting compressed latents are then processed by large video diffusion backbones to extract effective features for action generation. However, this paradigm ties WAM performance and training cost to large‑scale video generation pretraining, limiting WAM efficiency and scalability. In this paper, we theoretically and empirically investigate how visual representations affect action generation in WAMs. Our results show that predictive embeddings from Joint‑Embedding Predictive Architecture (JEPA) encoders better support action generation than compressed VAE latents, with I‑JEPA performing best in our encoder comparison. Based on these findings, we propose LeWAM, which conditions action generation on JEPA embeddings and models environment evolution by predicting future embeddings in the same space, without relying on a video diffusion backbone. We further find that imitation learning matches demonstrated actions but does not distinguish better actions from worse ones, even though small action deviations can greatly affect task success. To address this limitation without additional environment interaction or the human oversight required for resets and safety, we introduce Demonstration‑Guided DPO (DemoDPO), an offline preference refinement stage that derives preference supervision directly from demonstrations. With only 0.4B trainable parameters, LeWAM achieves an average success rate of 92.28% on RoboTwin 2.0, comparable to that of state‑of‑the‑art VLAs and WAMs, and maintains practical effectiveness on real‑world manipulation tasks.
Authors:Han-Gyeol Kim, JaeWan Park, Junmin Park, Darongsae Kwon
Abstract:
3D reconstruction from satellite imagery is essential for large‑scale topographic analysis, yet the lack of high‑fidelity training datasets with accurate occlusion labels remains a primary bottleneck. Existing benchmarks, such as US3D and WHU‑Stereo, face inherent challenges in spatio‑temporal mismatch ‑‑ environmental changes and shadow displacements between multi‑view acquisitions ‑‑ and provide ambiguous ground truth in occluded regions due to LiDAR sparsity. In this paper, we propose SatUnreal, a high‑precision synthetic dataset designed to fundamentally overcome these limitations through an Unreal Engine‑based simulation pipeline. SatUnreal provides 10,000 stereo pairs with high resolution (0.3m GSD) and is characterized by: (1) Physical Geometry Simulation, replicating realistic satellite orbits by systematically varying baselines and azimuths; (2) Spatio‑temporal Consistency, eliminating temporal noise through fixed virtual environments; (3) Topographic Diversity, spanning dense urban canyons to low‑texture natural terrains; and (4) Mathematical Label Integrity, utilizing a novel two‑step linetrace algorithm to generate flawless occlusion masks. Experimental results using SOTA iterative models demonstrate that models trained exclusively on SatUnreal achieve superior zero‑shot transfer performance on real‑world benchmarks (US3D, WHU‑Stereo) compared to those trained on real datasets. Our findings prove that physically accurate synthetic data provides a more effective supervisory signal for learning geometric features than complex real‑world observations, establishing a new paradigm for Sim‑to‑Real transfer in Earth Observation. Code and dataset are available at https://github.com/jmp‑Telepix/SatUnreal_A_High‑Precision_Synthetic_Dataset_for_Satellite_Stereo_Matching_via_UnrealEngine
Authors:Canyang Zhao, Bolin Peng, J. Patrick Mayo, Ce Ju, Bing Liu
Abstract:
Achieving stable long‑term neural decoding in invasive brain‑machine interfaces (BMIs) remains challenging due to variations in recorded neural populations across sessions. Current latent alignment approaches may overlook task‑dependent structure during cross‑session adaptation. We propose Task‑Conditioned Latent Alignment (TCLA), a framework that stabilizes neural decoding by learning a shared latent space. TCLA learns a low‑dimensional source representation using neural reconstruction and continuous behavioral supervision. During target‑session adaptation, the shared representation is fixed, while target neural activity is mapped into the source latent space by aligning source and target distributions separately for each task condition. We evaluated TCLA on seven nonhuman primate datasets spanning multiple tasks. In long‑term cross‑session evaluation, TCLA achieved a mean R^2 of 0.476\pm0.014 with a negative R^2 failure rate of only 6.8%. Across 1,356 within‑subject session pairs, TCLA achieved a mean R^2 of 0.371\pm0.009 with a failure rate of 6.8%. Across 2,134 cross‑subject session pairs, TCLA achieved a mean R^2 of 0.218\pm0.004 with a failure rate of 12.9%, substantially better than those of the comparison methods. These results demonstrate that by preserving behaviorally relevant and task‑dependent latent structure, TCLA improves the robustness of neural decoding across recording sessions and subjects. The source code is publicly available at \hrefhttps://github.com/FAMD‑CASIA/TCLAhttps://github.com/FAMD‑CASIA/TCLA.
Authors:Jinwen Xin, Dongni Zhang, Chenyang Wang, Jianming Fu, Ming Tang, Guojun Peng
Abstract:
Deep learning‑based malware detectors are commonly updated by fine‑tuning on newly collected samples, but this practical update pipeline also creates an attack surface for training‑time backdoor attacks. In realistic crowdsourced data collection, however, strict label vetting typically restricts attackers to the clean‑label setting, in which poisoned samples must retain benign labels and functionality, making effective backdoor injection substantially harder. We present a new attack perspective based on feature‑space manipulation: instead of relying solely on stronger trigger designs or selecting benign samples that are naturally similar to malware, we deliberately construct benign programs whose representations shift toward the malware region before trigger injection, thereby creating stronger feature‑label conflicts during training. Based on this insight, we propose RAMP, an attack enhancement method that uses a genetic algorithm to optimize reversed adversarial perturbations under black‑box access and then injects them through functionality‑preserving binary manipulations. Extensive experiments show that RAMP substantially improves attack effectiveness over trigger‑only baselines, with especially pronounced gains at low poisoning ratios, while maintaining accuracy on clean data. Moreover, RAMP can be combined with advanced trigger designs.
Authors:Ke Wan, Yifan Wang, Liheng Lai, Chen Chen
Abstract:
Likelihood‑based context compression can account for cross‑context redundancy through sequential scoring, but this makes compression outcomes sensitive to context order. We show that different permutations of the same context collection can produce markedly different evidence‑retention outcomes under an unchanged compressor. We attribute this sensitivity to information preemption: earlier partially relevant contexts can absorb credit for shared information, suppressing the incremental score of later, stronger evidence carriers and increasing their risk of removal. Controlled pair‑swap interventions directly support this mechanism by showing that evidence‑first ordering substantially improves supporting‑evidence survival. To address this problem, we introduce MORSE, a compression‑aware method for evidence‑preserving context ordering. MORSE applies a common reverse query‑evidence principle to both individual contexts and compressed candidate outputs, using the former to construct an evidence‑first anchor and the latter to guide compression‑aware permutation selection. Across multi‑hop QA benchmarks, compression procedures, budgets, and scoring models, MORSE consistently improves evidence preservation over static reverse ordering and compute‑matched random search, with corresponding overall improvements in downstream QA. Our code is available at https://github.com/tbn5pj/MORSE_code.
Authors:Ke Wan, Chen Chen
Abstract:
Recurrent language models repeatedly apply shared network blocks to refine latent representations, but standard inference recomputes global attention at every recurrent step. We study attention dynamics across recurrent depth and find that attention support and distributions stabilize substantially earlier than hidden states and attention outputs. This suggests a two‑stage structure: early steps discover a sparse working set of relevant context, while later steps refine representations over largely the same routing support. Motivated by this structure, we introduce WISE (Working‑set Inference with Support Exploitation), a training‑free method that uses unrestricted global attention during early recurrence and later reuses directly discovered block‑structured support while keeping recurrent depth and within‑support attention computation dynamic. Controlled interventions show that recurrent discovery is important and that support‑only reuse better preserves model behavior than more restrictive attention‑reuse alternatives. Across multi‑hop QA benchmarks, WISE largely preserves full‑attention performance, while context scaling reveals increasingly sparse working sets and greater efficiency gains. Quality is largely preserved through 2K context, with a measurable loss at 4K. An optimized sparse‑attention implementation achieves up to a 1.76x attention speedup over native FlashAttention at 4K and a 1.36x speedup for the full 32‑step attention trajectory. Our code is available at https://github.com/tbn5pj/WISE_code.
Authors:Youki Lim, Sam Yong
Abstract:
Verifying outsourced language‑model inference requires a precisely identified computation and an audit whose cost a service can afford. We present Sampled Layerwise Proofs (SLP), a protocol and prototype that commits the boundary activations of every chunk of an inference trace, absorbs all commitments before any challenge is drawn, and then proves a verifier‑selected subset of chunks together with the chunks that bind the prompt and the answer. Audit coverage becomes a runtime parameter over one set of commitments: on a TinyLlama‑1.1B trace, proving seven of 47 chunks takes 22.0% of the time and 6.8% of the proof size of proving all 47. Because proof cost is dominated by weights rather than tokens, SLP packs concurrent requests into one trace under a block‑diagonal causal mask and binds the prompt and answer of each request to its slot. Twelve packed requests are proved in 181.9 s, 6.5 times less than twelve separate proofs at the measured single‑proof cost, and a simulated service proves twelve requests at 30.6 s per request with 0.6 s of verification each, rejecting a tampered answer. Disk‑backed integer weights and streamed polynomial commitments let a single Llama‑2‑70B run complete on a 2 TB CPU host: 163 chunks sealed, five proved, a 4.34 MiB proof in 1,259 s, verified in 46.3 s without the weights. The proven object is a fixed‑point canonical model; we trace a severe fidelity loss to the residual‑stream bit width, repair it with an LLM‑aware observer, and measure 84.8‑84.9% argmax agreement with the floating‑point reference over 334,705 WikiText‑2 test positions. The limits are stated as precisely: guarantees cover proven chunks only, a fixed invalid chunk in the 70B setting is covered with probability 3/161, a manifest‑only Fiat‑Shamir schedule can be ground at 12.5 ms per attempt and needs an externally ordered challenge, and all measurements use a test reference string.
Authors:Weiyu Ma, Liangbing Zhao, Yongcheng Zeng, Jian Zhao
Abstract:
We present JEV‑Star, a StarCraft II controller that defeats the strongest non‑cheating built‑in AI, Lv7, by combining fast JEV action selection with persistent GPT‑6 planning. The combined system wins four full games at Lv5‑‑Lv7, including two Lv7 victories with different seeds, while retaining a median JEV response time of 0.422 seconds. Mean estimated model cost across these games is USD~3.71 per game: USD~0.15 for JEV and USD~3.56 for GPT‑6. We compare this system with an initial JEV‑only controller in full‑game macro control and multi‑unit micromanagement. The standalone controller reaches a 20‑minute limit against Lv2 without expanding. Across 35 battle maps with three episodes per map and controller, the combined system raises mean enemy elimination from 16.50% to 37.69% and wins from 3 to 7 out of 105. Replay frames and decision logs document resource reservation, persistent economic goals, and stable army objectives in successful full games. The results demonstrate a practical division between inexpensive, subsecond decisions and longer‑horizon planning. The comparison evaluates complete systems; concurrent interface improvements mean that planning's contribution is not isolated by a controlled ablation. Code is available at https://github.com/sc2musa/Jev_Star
Authors:Xuanyu Meng, Xing Fan, Xinyi Fan, Chenlei Guo, Yixuan Xie, Jiawei Han
Abstract:
An agent that interacts with users over long periods must recall facts, preferences, events, and changes from a continuously growing interaction history. Existing memory systems often compress interactions into generic summaries or retrieve anonymous text chunks, making it difficult for an agent to identify the correct entity, property, and supporting evidence. We present EnSIMem, an entity‑structured long‑term memory architecture for an agent. During offline construction, the system organizes interactions into theme‑coherent episodes and builds dialogue‑grounded index entries of the form [entity][entity type][property:value]. Each entry preserves its source turns, temporal information, and available multimodal fields. During online interaction, the agent's request is decomposed into evidence requirements whose properties are aligned with the memory index. Entity‑property lookup and adaptive retrieval then collect the evidence needed for point, temporal, compositional, and aggregation reasoning. The agent generates its response from the preserved source evidence rather than from lossy memory summaries. On long‑term agent‑memory benchmarks, EnSIMem achieves high answer accuracy while maintaining compact contexts and favorable online efficiency. These results show that entity‑structured indexing and episode‑level provenance provide a reliable foundation for long‑term memory in agents. The code of our model is available at https://github.com/RamonMeng/EnSIMem.
Authors:Jie Yang, Yan Zheng, Jiarui Sun, Xiran Fan, Junpeng Wang, Liang Wang, Zelin Xu, Qinghua Liu, Zhengyu Fang, Yiwei Cai, Philip S. Yu
Abstract:
Time series agents answer analytical questions by calling external tools, and which tools they carry is decided by people before the agent runs. However, we identify two failures in this setup. Human‑Agent Tool Misalignment: a library of 21 expert‑curated tools helps on some tasks and hurts on others, dropping anomaly accuracy under every backbone we test. Silent Harm: one round of generic self‑revision changes 147 answers and breaks 56 of them, while the final score moves by less than a point. Both follow from the same gap: whether a tool helps is decided question by question at runtime, while tools are supplied in advance and judged by a single average. To address this, we propose TimeEvo, which clusters an agent's diagnosed failures into capability gaps, plans a measurement for each, synthesizes evidence‑only tools that fill them, and admits the candidate library only through a paired admission gate. Experiments on ten time series QA tasks and three backbones show that TimeEvo, starting from an empty library, improves accuracy on every task and every backbone, and that a library grown on a cheap model still gains when it is installed into stronger ones. Code is available at https://github.com/Muyiiiii/TimeEvo.
Authors:Tao Zhang, Peixian Su, Xingyu Gao, Yunhao Zou, Yu Lu, Zunjie Zhu, Bolun Zheng, Ying Fu, Chenggang Yan
Abstract:
Due to the limited dynamic range of conventional image sensors, captured low dynamic range (LDR) video often suffers from highlight clipping and shadow detail loss, making high‑quality high dynamic range (HDR) reconstruction from single‑exposure sequences highly challenging without alternating exposures or extra hardware. Alternating‑exposure HDR methods sacrifice frame rate and struggle with motion alignment, making them impractical for real‑world capture. To address this, we propose RawHDRV, an end‑to‑end framework for single‑exposure Raw video HDR reconstruction, that fundamentally exploits the linear response and channel‑specific characteristics of Bayer data. Specifically, it features a channel‑decomposition temporal alignment and fusion strategy that processes Bayer channels separately to exploit their distinct exposure characteristics, together with exposure‑aware weighted fusion. It further incorporates an exposure complementarity mask‑guided restoration module that leverages inter‑frame exposure redundancy to adaptively fuse reliable information and suppress saturation artifacts, and introduces a mask‑guided color loss that combines normalized error constraints with gradient smoothing to enhance highlight recovery. Furthermore, we construct a large‑scale mobile Raw‑HDR video dataset with per‑frame HDR annotations. Experiments show that our method achieves the state‑of‑the‑art results in all metrics, demonstrating superior spatial quality and temporal stability under extreme exposure conditions. The code is available at https://github.com/supeixian/RawHDRV.
Authors:Hao E. Zhang, Ruize Geng, Raihan Haque, Khalil Zbiss, Guanyang Luo, Hui-ping Wang, H. Eric Tseng, Ding Zhao
Abstract:
Humanoid kicking requires coordinated whole‑body motion and precise contact, while a banana kick demands contact mechanics that generate ball spin and aerodynamic curvature. Motion imitation provides a reliable ordinary‑kick prior, but reinforcement learning may improve shot speed and placement accuracy without changing the underlying kicking technique. Adapting this prior to a qualitatively different contact‑rich skill can fail even when the reward is dense and optimization remains stable. The failure occurs when the task objective is locally flat over the current policy's responses. We term this condition first‑order learning starvation. To address it, we propose response‑informed skill evolution (RISE), a closed‑loop objective‑continuation method for policy adaptation. RISE ranks bounded objective changes using response sensitivity estimated from cached rollouts and accepts updates only when they produce verified response progress while preserving kicking reliability. Our analysis shows that rescaling a saturated spin reward cannot recover first‑order sensitivity at zero spin, whereas adapting coupled contact responses can provide a learnable path to spin generation. We integrate RISE into a humanoid kicking pipeline under calibrated contact and Magnus‑force aerodynamics, and sim‑to‑real transfer. Experiments show that RISE evolves the ordinary kick into a high‑spin curved kick with 11.55 rad/s mean ball spin, improves the mean evaluation score by 19.8% over a learning‑progress curriculum, and raises joint target attainment from 15.2% to 50.9%. Ablations and response diagnostics support the mechanism, while 30 motion‑capture‑recorded physical trials demonstrate consistent hardware transfer of the learned curved kick. Project website: https://haozhang‑thu.github.io/bananakick/
Authors:Benjamin Davis, Chase Kidder, Hannah S. Stuart
Abstract:
In this paper, we present the Berkeley QUAD (Quasi‑direct‑drive, Underactuated, Asymmetric Design) Hand, a four‑finger anthropomorphic robotic hand with 11 degrees of freedom and 8 degrees of actuation. The design utilizes QDD actuation at the base of each finger, enabling high force transparency for dexterous, adaptive performance. However, the low torque density of these actuators traditionally presents major issues with size, weight, and thermal limits. We overcome this by applying bio‑inspired asymmetry, delegating dexterity to the radial fingers through individual QDD actuation, and strength to the ulnar finger through an underactuated, compliantly coupled transmission driven by a larger QDD motor. A novel preloaded, linkage‑based transmission permits this ulnar coupling in a way that preserves human‑like workspace reachability. Under light loads, the ulnar motor drives the third (middle) finger directly for dexterity while the fourth (ring) finger mirrors its motion. However, under larger loads, the middle finger complies while the motor drives the ring finger further downwards and inwards toward the center of the grasp to apply better closure forces. Hardware evaluations validate this architecture, demonstrating that the hand achieves 29 out of 33 Feix taxonomy grasps and exhibits backdrive forces as low as 50 g for delicate interactions. Additionally, the underactuated fourth finger improves grasp closure and provides the spatial efficiency necessary for larger actuation, yielding up to a 96‑fold reduction in heat generation during sustained loading. Webpage: https://benudavis.github.io/berkeley‑quadhand/
Authors:Wenhao Ye, Xuanye Pan, Junfeng Xia, Junxiang Zhang, Mo Wang, Quanying Liu
Abstract:
Scaling laws have guided large‑model development in computer vision and natural language processing, but the relationships among data, model size, and compute remain unclear for functional magnetic resonance imaging (fMRI) foundation models. Here, we conduct a controlled empirical study using pretraining data from more than 200 source datasets and over 10,000 GPU‑hours of experiments. Holding the pretraining framework and downstream protocol fixed, we vary pretraining data size, model size, and training duration. Downstream performance generally improves with compute, yet models using similar compute can perform substantially differently. Additional pretraining data bring larger gains at larger model sizes, suggesting that data and model size should be scaled together. At matched compute, increasing pretraining data benefits more tasks than increasing model size, although the pattern varies across tasks. We then use in‑distribution (ID) downstream performance to select the combination of pretraining data size, model size, and training duration at two fixed compute budgets. The resulting models are locked before out‑of‑distribution (OOD) evaluation. They achieve the highest average performance across the evaluated OOD tasks among the compared fMRI foundation models while using less pretraining compute. Overall, our results show that compute alone does not characterize fMRI scaling: performance depends on how pretraining data, model size, and training duration are combined.
Authors:Xinmiao Lin, Matthew Wright
Abstract:
Prototype‑based neural networks provide inherent interpretability through case‑based reasoning, yet suffer from critical limitations: prototypes converge to redundant features, fail to capture diverse semantic parts, and lack quantitative interpretability assessment. We propose Diversity‑Aware Prototype Learning (DAPL), which enforces prototype diversity through architectural constraints rather than explicit regularization. Our approach leverages multi‑head self‑attention with strict one‑to‑one attention‑to‑prototype mapping, ensuring each prototype specializes in distinct visual features. We further introduce foreground‑aware training to focus prototypes on semantically meaningful regions and develop comprehensive evaluation metrics (Coverage and Diversity) for quantitative interpretability assessment. Experiments on CUB‑200‑2011 demonstrate substantial improvements: DAPL with foreground‑aware training achieves 81.69% accuracy with 0.596 Coverage and 0.427 Diversity, providing the best overall balance across all evaluated prototype‑based methods. Code is available at https://github.com/xinmiaolin/DAPL.
Authors:Michael Theologitis, Dean Light, Shuyue Stella Li, Benjamin Newman, Yulia Tsvetkov, Dan Suciu
Abstract:
Solving complex tasks in domains such as science, medicine, law, and finance often requires assembling interdependent information scattered across vast, heterogeneous sources far beyond model context limits. Existing approaches tackle this challenge by organizing information into more manageable representations over which models can reason, such as graphs, textual memories, and retrieval collections. These representations dictate what downstream reasoning is possible and, ultimately, whether it succeeds; yet their design and construction remain largely ad hoc. In this work, drawing on the cognitive theory of relevance realization, we propose concrete principles for designing AI systems that construct effective representations of very large contexts. We analyze existing approaches and show how their successes and failures map onto their alignment with these principles, and introduce R3Con, a harness designed to operationalize the principles more systematically. We evaluate R3Con against nine state‑of‑the‑art baselines on two recent benchmarks of reasoning over large document corpora. On these benchmarks, R3Con substantially outperforms the strongest baseline, by 20 and 8.4 percentage points. It also enables smaller models to outperform much larger ones: R3Con with 4B and 9B models outperforms all evaluated 35B baselines, while R3Con with a 35B‑A3B model outperforms Claude Code with Claude‑Sonnet‑5 at 3.7× lower cost. Our results show that context representations following our principled approach can reduce reliance on model scale, pointing toward a future of AI systems with frontier‑level performance powered by smaller models. Our code is available at https://github.com/michaeltheologitis/r3con
Authors:Yuhang Jiang
Abstract:
Action‑chunked visuomotor policies predict overlapping trajectories, so every executed action is covered by several predictions. Temporal ensembling smooths execution by combining these predictions with an exponentially weighted mean. One corrupted prediction can move the aggregate without bound: its breakdown point is 0. We use adversarial corruption to stress this deployed aggregator and to compare two kinds of guarantee. A metric guarantee bounds the response to a perturbation of a given size. A combinatorial guarantee instead bounds the damage when at most q of the M candidates covering a timestep are corrupted, whatever their size. Encoder adversarial fine‑tuning recovers 44% of the loss under the published patch attack, but only 7.3% after the attacker's step size is increased. By contrast, the coordinate‑wise median of the same candidate set keeps its recovered fraction flat as attack optimisation increases. Median temporal ensembling costs one line and requires no retraining. Across 25 (configuration, corruption‑level) combinations it is never worse than the mean and is significantly better in 15. It also transfers to a second policy class, and it recovers performance under a failure with no attacker in the loop at all: camera frames that arrive blank. Its effect on clean data is configuration‑dependent, from ‑0.04 to +0.07. We also give the boundary: corruption that shifts every covering prediction by the same amount is invisible to this whole family of statistics, and no equivariant aggregator can remove it.
Authors:Yuhe Wu, Rui Qian, Guangyu Wang, Yuran Chen, Yuanchao Zhu, Junjie Yang, Zhengheng Li, Jiulin Cai, Tianyi Zhang, Zihan Dong, Jiaxin Liu, Yujie Chen, Guang Zhang
Abstract:
Large language models (LLMs) are increasingly used to measure public value orientations from long social media posts, yet such posts often mix background, quotations, concessions, and only a few stance‑bearing sentences. Existing approaches either ask the model to predict a document‑level label directly, which can be overconfident, or aggregate sentence‑level predictions by majority or soft voting, which treat uncertain and decisive sentences as equally informative. We formulate long‑text value measurement as a decision‑fusion problem and propose Tempered Evidence Fusion (TEF), a training‑free rule that weights each sentence's log‑odds by its normalized information gain, as derived from a generalized Bayesian posterior. This makes the fused score nearly vanish for uncertain sentences while preserving the Bayes‑optimal weight of decisive evidence. We further introduce Multi‑event Insight Network Dimensions (MIND), a benchmark of 8,358 Chinese and English posts spanning five years of public events and six value dimensions. On MIND, TEF outperforms the strongest baseline among Direct, Majority Vote, and Soft Vote by an average of 4.5 accuracy points and 4.6 macro‑F1 points across five LLMs and two languages. MIND dataset and code are available at https://github.com/Kzczc/ICASSP2027‑TEF.
Authors:Anuvab Sen, Maneet Chatterjee, Aparup Ghosh, Udayon Sen, Arnav Aditya, Yixin Zhang
Abstract:
Remote sensing change detection requires both global reasoning across bitemporal images and precise localization of changed regions. However, dense attention is computationally expensive for high‑resolution imagery, while conventional feature fusion and coarse decoding may inadequately separate genuine changes from appearance variations or preserve object boundaries. We present Bitemporal Mamba‑Diffusion for Change Detection (BMD‑CD), which combines temporally structured state‑space modeling with logit‑space diffusion refinement. BMD‑CD converts deep bitemporal features into region tokens and arranges them in explicit temporal partitions before bidirectional state‑space propagation. Its Bitemporal Ordered Mamba Operator enables long‑range cross‑temporal interaction with linear sequence complexity, while Orthogonal Feature Disentanglement forms a change‑oriented output and a complementary rotated output using learned pairwise rotations and unchanged‑region consistency. Multiscale decoding then produces coarse change logits, which are refined through a five‑step Conditional Diffusion Decoder operating directly in logit space. Experiments on LEVIR‑CD, WHU‑CD, DSIFN‑CD, CDD, and S2Looking demonstrate strong performance across diverse change‑detection settings. BMD‑CD achieves F1 scores of 93.7%, 96.0%, 97.8%, and 99.0% on the four standard benchmarks and improves 3‑pixel Boundary‑F1 to 87.7% and 91.4% on LEVIR‑CD and WHU‑CD, respectively. The full model requires 32.09 GFLOPs and 47 ms per 256 x 256 image pair, while also showing zero‑shot transfer to ValaisCD and B‑FLAIR‑test. Our code is available at https://github.com/Aparup2139/Public_WACV/
Authors:Abdulmalik Alquwayfili, Faisal AlMeshal, Jumanah Almajnouni, Huda Abdulhadi Alamri, Muhammad Kamran J Khan
Abstract:
Text‑to‑image retrieval with frozen dual encoders degrades when the query names a small, visually subordinate object in a cluttered scene: a single global image embedding underrepresents the localized visual evidence. We present MINER, a training‑free inference framework that augments a frozen dual encoder's global image embedding with a small bank of region‑level embeddings and a hubness‑correcting similarity rescoring, recovering visual evidence that global pooling underweights. To evaluate this setting, we introduce ROCS, a benchmark built from high‑clutter subsets of Flickr30K and MS COCO whose images are re‑captioned to name a single low‑salience object. Experiments on CLIP, SigLIP, and SigLIP 2 show that MINER improves retrieval on every backbone, on ROCS and on the standard splits. Analyses show that these gains come primarily from broader spatial coverage rather than precise crop placement, revealing a simple and general way to recover localized evidence from frozen representations. Code: https://github.com/aalquwayfili/MINER. Dataset: https://huggingface.co/datasets/aalquwayfili/ROCS.
Authors:Linus Nwankwo, Muslim Alaran, Christian Rauch, Stanley Chukwuebuka Obilikpa, Elmar Rueckert
Abstract:
Open‑vocabulary visual grounding enables robots to localise task‑relevant entities from natural‑language queries without dependence on predefined perceptual taxonomies. However, existing benchmarks largely rely on short category labels and web‑scraped imagery, leaving it unclear whether open‑vocabulary models can robustly ground diverse queries and visual conditions under real deployments. We introduce Pro‑Bench, a prompt‑conditioned benchmark for open‑vocabulary visual grounding in heterogeneous, real‑world environments. Pro‑Bench includes 13k+ RGB frames from independent robotic domains (subterranean, industrial, indoor, outdoor, urban), with 74.5k manual instance annotations and 515 target queries covering categorical, attributive, relational, affordance, state, part‑whole, negative, and compositional semantics. We benchmarked 16 open‑vocabulary model configurations in strict zero‑shot inference, measuring localisation accuracy across IoU thresholds, end‑to‑end inference latency, prompt‑induced performance variation, and target recovery consistency. Our results show that prompt‑robustness is strongly architecture‑dependent. Most model configurations (10/16) perform best with short category labels, whereas free‑form queries yield the highest accuracy for only one. Moreover, similar aggregate mAP can conceal substantial differences in consistent target recovery across reformulations. Pro‑Bench enables systematic evaluation of these gaps and supports prompt‑robust visual grounding. Pro‑Bench: https://pro‑bench.github.io/.
Authors:Chen Xu, Rishi Shah, Hadas Kress-Gazit, Haruki Nishimura, Masha Itkina
Abstract:
Modern robot imitation learning increasingly relies on generative policies based on diffusion or flow‑matching models, which generate actions by transforming samples from a prior distribution. A key question is whether the choice of prior matters. Replacing the standard Gaussian with a closer‑to‑target, non‑Gaussian prior has been shown to substantially improve performance when training from scratch. A natural next step is to ask whether these gains transfer to fine‑tuning pretrained Large Behavior Models (LBMs) such as LBM 1.0, π_0.5, and GR00T~N1.5, where one might expect even larger gains. Surprisingly, we find that this is not the case, except possibly at very low fine‑tuning data fractions. Across over 100K simulation rollouts spanning all three aforementioned LBMs on 40+ tasks in two simulation platforms, and 1250 hardware rollouts on five bimanual manipulation tasks, non‑Gaussian priors that are demonstrably closer to the target yield statistically indistinguishable or worse fine‑tuning performance than a standard Gaussian prior. Diagnostic analyses suggest why: fine‑tuned imitation learning policies converge to similar action predictions across priors, despite their fine‑tuned encoder embeddings diverging substantially from the pretrained embeddings and each other. A learning‑rate ablation further confirms that encoder training is the dominant factor in fine‑tuning performance, substantially outweighing the effect of prior choice. We conclude with concrete directions for future research on when and why learned priors might still matter in fine‑tuning. Project page: https://cxu‑tri.github.io/non_gaussian_FT/
Authors:Robert W. Learsch, Nicholas Liesen, Daniel S. Levine, Anna M. Hiszpanski, Evan R. Antoniuk
Abstract:
Polymer property prediction lacks open, standardized benchmarks that enable rigorous comparison of machine‑learning methods, with existing resources covering only a narrow fraction of polymer architectures, such as homopolymers. We introduce Polymer Benchmark 2026 (PolyBench26), an open dataset comprising nearly 250,000 polymer‑property datapoints across eight physical properties, including data from experimental measurements, density functional theory, and molecular dynamics. The benchmark supports four evaluation tasks across homopolymers and alternating, random, and block copolymers: in‑distribution property prediction, dataset‑size scaling, repeat‑unit complexity, and transfer to held‑out polymer architectures. We compare language model, graph‑based, and descriptor‑based approaches and find graph‑based models provide the lowest errors in property prediction, retain their advantage across the evaluated training‑set sizes, and remain robust to increasing repeat‑unit complexity. PolyBench26 provides a reproducible foundation for developing models for the increasingly complex polymer design space. The PolyBench26 benchmark is available open‑source at https://github.com/rlearsch/PolymerBenchmark2026.
Authors:Qingjing Chen, Junkai Zhang, Shaochun Wang, Jiahao Ding, Siyuan Zheng, Yukun Yan, Zhi Zheng, Antonino Rotolo, Yun Liu, Weixing Shen
Abstract:
Large language models are increasingly applied to high‑risk domains such as law, yet complex legal reasoning remains limited by two structural challenges. First, existing RAG and GraphRAG methods emphasize lexical or semantic similarity while overlooking normative relations among legal provisions. Second, vanilla Chain‑of‑Thought prompting may generate plausible rationales without enforcing the normative structure of legal reasoning. To deal with the bottleneck of pipelines in the legal reasoning domain, we propose LEGO, a dual‑module framework that synergizes Legal Expert GraphRAG and expert Chain‑of‑thought for complex legal reasoning. ExpertGraphRAG uses an expert‑annotated civil code graph encoding these normative relations with a greedy normative‑coverage retrieval algorithm to dynamically extract instance‑specific provision subgraphs, while ExpertCoT organizes the retrieved provisions and case facts into structured Provision‑Fact‑Conclusion reasoning. With a Qwen3‑8B backbone, LEGO achieves 40.53% exact‑match accuracy on LawExamQA_Civil, outperforming the evaluated RAG and CoT baselines and performing comparably to the evaluated larger models, while remaining robust on multi‑hop questions. It also achieves the best results among the evaluated baselines on the open‑ended benchmarks. Ablation studies confirm the individual and complementary contributions of both modules, demonstrating LEGO's effectiveness in improving LLMs' complex legal reasoning ability. Code and dataset can be found in the link: https://github.com/BLK‑WHT/LEGO
Authors:Ritwik Sharma, Vimarsh Shah, Saransh Agrawal
Abstract:
Hexapod robots can achieve static stability with fewer actuated joints than bipeds or quadrupeds, yet many platforms still use 3‑DOF legs, increasing weight and continuous torque requirement with limited gain in locomotion capability on flat, inclined and moderately rough terrains. We release Spiderbot, an open‑source hexapod that uses a 4‑bar linkage with a passive spring to mechanically support body weight, with a 2‑DOF per‑leg design that substantially reduces energy consumption. This mechanism substantially offloads gravitational torque during standing stance consuming only 1.5W (reduction of over 90% over the unsprung version and up to 96% over other similar hexapods). The passive spring compensation extends to payloads of up to 3.25kg with no additional torque requirements. The platform enables long‑duration deployments on a modest battery budget and costs under \400, making it suitable for large‑scale multi‑agent experiments. We validate the locomotion capabilities of the platform with an RL policy trained in mjlab, including successful sim‑to‑real transfer, despite the complexity of the mechanism. The platform is evaluated on flat and rough terrains, slope up to 15^\circ and step obstacles. We release all the CAD files, assembling instructions, and full training and deployment code along with the model checkpoints at https://erc‑bpgc.github.io/SpiderBot/.
Authors:David Berga
Abstract:
The objective of this article is to provide design principles and a software architecture for enabling interaction between humans and multiple agents in simulated dynamic worlds. This connects the current era of general artificial intelligence (AI/AGI) with the proliferation of transformer‑based conversational agents and the increased computational capabilities. Given an overview of current and previous multi‑agent theories of mind (socially and affectively‑aware agents), the existence of an integrative design of agent interactions with themselves and with humans must be crucial for understanding how to create sustainable and governance in future human‑agent reasoning systems. In this work is presented a software "AGIMUD" that integrates: A. socially‑aware reasoning and emotion in agent behavior and interaction, B. a design of human multimodal scheme for human users, artificial agents and simulated worlds, and C. distributing the AI processing through the network to enable multiple autonomous agents. These integrations allow the dynamic world recreation as multi‑user dungeons (MUDs) where both agents and humans can interact simultaneously in real time. Find the code online in https://github.com/dberga/AGIMUD.
Authors:Sunnidhya Roy, Samarpita Bhaumik
Abstract:
Traditional e‑commerce search platforms rely heavily on inverted indices and token‑level lexical matching algorithms (e.g., BM25 and TF‑IDF), which frequently fail on conversational, intent‑driven, or paraphrased user queries ‑‑ the classic vocabulary mismatch problem. We formulate conversational product recommendation as an Extreme Multi‑Label Classification (XMLC) problem over an e‑commerce catalog of N = 54,000 products spanning 27 balanced retail categories from the Amazon Reviews '23 benchmark. Using a pre‑trained DistilBERT transformer encoder, we distill dense item‑to‑item similarity topologies (generated via TF‑IDF cosine similarity over cumulative metadata with K = 50 nearest neighbours) into a deep contextual representation via a pseudo‑label knowledge distillation framework. Evaluated on an exact 85/15 train/validation split (8,089 held‑out products across C = 53,923 output classes) with strict self‑exclusion enforced, the DistilBERT neural student achieves P@1 = 93.15%, P@5 = 90.08%, NDCG@10 = 0.8845, and MRR@10 = 0.9545, closely recovering the empirical ceiling established by the corrected TF‑IDF teacher (P@1 = 98.10%, NDCG@10 = 0.9419, MRR@10 = 0.9882). Furthermore, a qualitative benchmark across ten structured natural language query archetypes ‑‑ encompassing situational, cross‑category, paraphrased, and negative‑constraint queries ‑‑ demonstrates that the transformer student generalises substantially beyond keyword matching, successfully resolving implicit user intent where lexical models fail completely. Finally, we analyse the architectural and memory scalability trade‑offs of extreme classification projection layers at industrial catalog scale (> 10^6 items) and present a concrete deployment trajectory toward Dual‑Encoder (Two‑Tower) vector search. Code: https://github.com/Sunnidhya/Distilling‑Lexical‑Product‑Associations‑into‑Deep‑Transformers.
Authors:Akshit Sharma, Prashant W. Patil
Abstract:
Memes often derive their harmful, hateful, or sarcastic meaning from small but decisive visual, textual, or cross‑modal cues. Existing multimodal classifiers can miss such evidence when relying mainly on global image‑text representations. We introduce MemeCF, a cue‑focused benchmark of 9,895 memes across harm, hate, and sarcasm, with annotations identifying the modality and rationale of the pivotal evidence. We also propose MemePIVOT, a local‑global architecture for meme classification. MemePIVOT uses frozen CLIP features, unbalanced optimal transport to align words with image patches while allowing irrelevant evidence to remain unmatched, and an evidential fusion head to combine local grounding with global meme context under uncertainty. Experiments on HarMeme, PrideMM, and MemeCF show consistent gains over strong text‑only, image‑only, multimodal, and vision‑language baselines. Cross‑dataset and ablation results further show that explicit pivotal‑evidence modeling improves robustness and contributes meaningfully beyond global multimodal representations. Our code and dataset are publicly available at https://github.com/AkshitSharma1/MemePIVOT
Authors:Reshabh K Sharma, Linxi Jiang, Shuo Chen, Zhiqiang Lin
Abstract:
A language model agent acts through the tools it is given. The data it reads while working on a task can redirect what it does with those tools. A growing set of techniques for safe and secure agent execution therefore sits between the agent and its tools, aiming to enforce access control, information flow or isolation at that boundary. Today these techniques are evaluated on agent‑security benchmarks built around indirect prompt injection. Those benchmarks judge a defense by how far it brings the number of successful attacks down while preserving the agent's utility. A defense is judged only on the agent's execution. It can score well on both metrics while holding open a transfer, a deletion or a broad read that no task needed. Ajar measures that open privilege directly using the existing benchmarks. It attaches to an agent‑security benchmark that already exists and reuses the tasks, tool schemas, reference solutions and goal states that benchmark uses to grade its own runs. For each benign task it builds candidate tool calls the task does not need, so allowing one is privilege left open. These calls are presented to the defense at every point where the agent could act. We evaluate Ajar by attaching it to AgentDojo, where open privilege becomes a third axis beside the existing attack success and benign utility. We run it on five defenses: Progent, CaMeL, AC4A, Permission Assistant, and Claude Code's Auto mode. We observed that they leave widely different amounts of privilege open. Two defenses leak by almost the same amount yet differ widely in the benign tasks they finish, and one defense buys part of its tightness by refusing calls its tasks were entitled to make. This open privilege cannot be derived from the measured attack success or benign utility. The source code of Ajar is available at https://github.com/reSHARMA/Ajar.
Authors:Mengtao Ou, Zongzheng Zhang, Zhenghao Xiao, Yixuan Pan, Ziwen Zhuang, Hang Zhao, Hongyang Li, Yanan Sui, Libin Liu, Hao Zhao
Abstract:
Musculoskeletal (MSK) humanoids provide a physiologically grounded embodiment for studying full‑body motor control, but their high‑dimensional muscle actuation, delayed activation dynamics, and redundant muscle‑‑tendon structures make learning substantially harder than torque‑driven humanoid control. Existing MSK benchmarks remain fragmented across gait, prosthetics, dexterous hands, or challenge‑specific tracks, leaving full‑body muscle‑actuated control insufficiently evaluated under standardized tasks, methods, and metrics. We introduce MSK‑Bench, a benchmark of 22 full‑body motor‑control tasks organized into three progressively challenging categories: postural stabilization, common locomotor behaviors, and contact‑rich environmental interaction. Under unified task protocols and robustness perturbations, MSK‑Bench evaluates 5 representative control paradigms, including reward‑based RL, agentic reward tuning, latent‑action RL, imitation‑prior control, and residual adaptation over imitation priors. Beyond task success and reward, MSK‑Bench further reports robustness analysis and physiology‑oriented diagnostics, including activation cost, joint smoothness, and EMG‑envelope similarity. Our empirical study shows that embodiment‑aware exploration and structured action representations improve task coverage in high‑dimensional muscle spaces, imitation priors enhance reference‑compatible stabilization and locomotion but degrade under contact‑rich terrain mismatch, and residual adaptation can recover successful behaviors when fixed references fail. We further find that improved task success does not necessarily imply improved physiological agreement, highlighting the importance of evaluating task performance, robustness, and physiological behavior jointly. MSK‑Bench provides a task‑‑method‑‑metric testbed for full‑body muscle‑actuated humanoid control.
Authors:Shivam Gupta
Abstract:
Tool‑result caching reduces repeated execution in agent training, but also couples rollout randomness. We study a two‑action model in which independent and shared execution preserve every rollout's conditional reward distribution. Despite this marginal agreement, sharing one stochastic result per group can reverse the expected group‑normalized policy update. We derive an exact finite‑group expression: against a constant alternative, the shared update follows the probability of winning minus the probability of losing, rather than the difference in expected reward. A Bernoulli specialization yields a wrong‑direction region and a non‑vanishing update‑variance floor as group size grows. Centering without group standard‑deviation scaling preserves the expected‑return direction in this model, using an existing estimator control. Exhaustive finite sums verify 540 configurations and 3,240 estimator evaluations, with a separate ordered‑sequence checker. An implementation audit reproduces the sharing path in a pinned, unmodified TVCache stack using 256 scripted rollouts. These results do not measure language‑model training performance or refute TVCache's deterministic‑output contract. They establish that marginal output validity alone cannot certify a stochastic cache as training‑equivalent.
Authors:Varshini Elangovan, James Wedgwood, Chhavi Yadav, William Agnew, Sauvik Das, Virginia Smith
Abstract:
Conversational AI systems can pose safety risks to their users such as hallucination, sycophancy, overconfidence, and anthropomorphism, but these risks are difficult for users to detect during everyday use. We introduce Safety Nudges, a browser‑based tool that provides lightweight, in situ flags when concerning behavior is detected in chatbot conversations. We evaluated Safety Nudges in a two‑week field study with 45 frequent chatbot users, collecting interaction logs, surveys, and feedback on individual nudges. Participants found the tool useful, clear, and minimally disruptive, with nearly all users reporting an increased awareness of potential AI harms, though we found that this improved awareness alone did not necessarily lead to discernible behavioral changes. Our results suggest that user facing safety nudges can complement model‑level safeguards by helping people critically evaluate AI responses in context, while highlighting the importance of relevance, calibration, and user control in nudge design for conversational AI safety. The code for our Safety Nudges extension is publicly available at https://github.com/jtbwedgwood/safety‑nudges.
Authors:Fabien Polly
Abstract:
Local learning trains each layer with its own auxiliary loss and no global backward pass, which makes layer updates structurally parallel. Two problems have kept it marginal: accuracy degrades as depth grows, and hyperparameters are fragile. We apply Muon‑style spectral update geometry (momentum orthogonalization with spectral step scaling) to per‑layer local updates, an intersection not previously studied. On CIFAR‑10 MLP benchmarks with local linear heads, a single step‑size setting is the best value in our tested grids from width 128 to 2048 and from depth 12 to 48, while local Adam requires re‑tuning along both axes and still collapses at depth 48 (31.3 percent re‑tuned per depth, 19 percent with its depth‑12 setting transferred, vs 42.7 percent for the spectral update at its unchanged setting). At five seeds and width 512 the spectral update leads local Adam by a clear margin (48.9 +/‑ 0.5 vs 46.6 +/‑ 0.3). Prospectively specified controls attribute the transfer and most of the depth robustness to the spectral geometry itself rather than to any step‑size rule on top of it. We additionally formulate the step size as a drift contract, lr = epsilon / RMS(input), which bounds each layer's weight‑induced pre‑activation change per step, conditioned on its current input. The contract yields a small gain over the best fixed learning rate where that baseline is measured, makes the step size interpretable, and provides a per‑layer, input‑conditioned drift bound that standard optimizers do not offer. We report one negative result: with RMSNorm and weight decay in the trunk, the stability benefit of spectral updates accrues to global rather than local training, so the local advantage concentrates precisely where normalization is absent.
Authors:Shufan Sun, Chen Wang, Enxin Song, Jiatao Gu, Lingjie Liu
Abstract:
Compositional 3D scene reconstruction has recently been explored from two directions: agentic reasoning that provides semantic understanding of spatial relationships but lacks precise alignment with input images; and visual geometry foundation models that predict dense point maps from input images but the reconstruction quality is limited. Therefore, recovering a complete 3D scene from a single monocular image with accurate inter‑object relationships and high‑fidelity reconstruction quality remains challenging. In this paper, we present HARMONY, a hierarchical chain‑of‑thought framework that leverages both agentic reasoning and visual geometry foundation. Given an image of an indoor scene, starting from an empty 3D floorplan, HARMONY first calibrates the camera against the reference image to establish a semantically‑grounded spatial frame, then uses agentic VLM reasoning to recover the 3D room layout and an initial placement order. It then places the objects in a hierarchical order, from wall‑mounted elements, free‑standing furniture, to dependent decorations on top of furniture. We also use depth‑first traversal for furniture so each placement conditions on previously resolved structure and a reflective feedback loop to avoid error accumulation. After each object placement by VLM, we use the point cloud estimations to perform geometry‑based refinement so that the rendered image aligns better with the input. HARMONY can produce 3D scenes that are semantically consistent and perceptually aligned with the reference image, extending single‑image compositional reconstruction to complex indoor scene images. Experiments on synthetic and real‑world images demonstrate that HARMONY outperforms the evaluated reconstruction baselines, while qualitative comparisons with GPT‑6 Astra suggest more faithful object arrangements and better preservation of scene details.
Authors:Haobo Zheng, Tan Tang, Yan Chen, Weijie Wang, Yingcai Wu
Abstract:
Long‑term conversational memory in multi‑party settings requires more than retrieving relevant content from long‑term conversations: it must distinguish who said what, whom each statement concerns, how individuals perceive one another, what information is shared by the group, and how states change over time. Recent studies on multi‑party dialogue benchmarks show that existing general‑purpose LLM memory systems tend to lose person and group relations or struggle to integrate clues distributed across members, groups, and time. Together, these issues reveal two core bottlenecks: message attribution and relational understanding in multi‑party dialogue, and state reconstruction from interleaved histories. To address both, we propose SpeakerMem‑R1: its dual‑track memory stores speaker‑labeled verbatim messages and derived states organized into person‑level and group‑level views, then combines evidence from both tracks by entity, event, and time at query time. To reduce attribution and update errors during structured memory construction while enabling local deployment, we train Writer‑R1 with SpeakerLevenshtein and speaker‑conditioned GRPO. On GroupMemBench, SocialMemBench, and EverMemBench, SpeakerMem‑R1 achieves binary accuracies of 47.9%, 69.2%, and 61.9%, respectively. On the publicly reported EverMemBench leaderboard from EverMind‑AI, we achieves 62.33%, the best reported result among the latest state‑of‑the‑art frameworks. It also achieves 70.85% on all 1,986 LoCoMo questions, which we use as a two‑person long‑term conversation boundary test. In a controlled evaluation of 305 questions, RL raises the SFT Writer's mean accuracy from 57.38% to 68.20%. We report both binary accuracy and token‑F1, and ablations show that the verbatim and structured tracks, as well as person‑level and group‑level views, are complementary under the standardized evaluation interface.
Authors:Xiaoyu Yang, Jie Lu, Wei Duan, En Yu
Abstract:
Long‑context LLMs focus on retrieving distant evidence from extensive context, yet existing work has largely focused on overcoming distance alone. In this work, we identify the Proximity Trap, insufficient attention to distant evidence often arises less from distance itself than from cumulative competition with abundant, task‑irrelevant proximal background. To address the Proximity Trap, we introduce LYRA (Long‑context heavY‑tailed Relevance Alignment), a t‑distributed directional matching mechanism that reshapes the context retrieval distribution, directing more attention mass toward task‑relevant evidence, while preserving the relative positional information encoded. Extensive experiments on LongBench‑v2, RULER, and LongBench demonstrate consistent improvements across context lengths and task categories. We further introduce ProxBench, a multi‑level fine‑grained benchmark for evaluating distant evidence utilization under increasing proximal background interference. Project page: https://xiaoyuyoung.github.io/LYRA/
Authors:Hao Wei, Yang Liu, Chao Tang, Shengbao Li, Jiangtao Chen, Jinxuan Zhu, Jiaheng Wang, Hong Yin, Zhaofeng Cao, Tingguang Li
Abstract:
Training vision‑language‑action (VLA) models for high‑precision manipulation typically requires task‑specific, high‑quality data (e.g., teleoperation), which is slow and expensive to collect. To reduce this burden without compromising manipulation precision, we propose \varepsilon4P (Imperfection for Precision), a simple yet effective method that "upcycles" two otherwise discarded data sources: (1) low‑precision data from the target task and (2) high‑precision data from mismatched tasks. Rather than naively mixing these imperfect data sources throughout co‑training, \varepsilon4P controls where each source contributes along the flow‑matching trajectory. Specifically, low‑precision, target‑task data is used at high noise to preserve high‑level task context and high‑precision, task‑mismatched data is used at low noise to transfer low‑level action precision. Through real‑robot experiments on both sub‑millimeter, high‑precision tasks and coarse‑grained tasks, we demonstrate that the proposed method (1) effectively leverages additional imperfect data to improve policy performance by up to 31.7 percentage points, and (2) can replace an equal amount of task‑specific, high‑quality data with an average performance drop of only 4.2 percentage points. Overall, \varepsilon4P points toward a scalable paradigm for high‑precision manipulation, in which heterogeneous, imperfect data can be systematically repurposed to reduce reliance on costly task‑specific, high‑quality data. More details are available at https://varepsilon4p.github.io/.
Authors:Shivam Gupta
Abstract:
Successful agent execution need not identify which future product improvement its user would value. We present a decision‑specific audit that maps a declared observation channel and product‑value contrast to compatible intervals and witness populations. Its foundations are established identification and decision theory; the contribution is an executable measurement workflow and a controlled study of its limits. A frozen experiment makes 4,800 requests to two pinned model snapshots on shared synthetic tasks. All 36 conservative primary intervals remain unresolved despite different execution accuracy. An exploratory 2,400‑call follow‑up records supplied preferences and resolves three of nine comparisons per model. A deterministic extractor resolves seven of nine without model calls or calibration observations, exposing unnecessary uncertainty introduced by model‑generated reports. A further 14,400 controlled multinomial simulations distinguish structural ambiguity from weak identification and finite calibration precision. We propose a source‑labeled decision receipt and provide an offline viewer for inspecting the audit. These results motivate preserving decision‑relevant structured input and diagnosing why a decision is unresolved before collecting more telemetry. The study contains no human participants or real customer outcomes. Full proofs, raw model provenance, controlled experiments, and reproducible analyses accompany the report.
Authors:Alexander Martin, Benjamin Van Durme
Abstract:
We introduce Knowledge Pull Requests (KPRs), a framework for continual document authoring that makes each change interpretable. Documents require ongoing revision as new knowledge surfaces from other sources, languages, or times, but existing approaches either edit with no account of what knowledge changed or regenerate from scratch. A KPR integrates new knowledge into a document by extracting claims, filtering and routing them to sections, and flagging conflicts with existing content, producing a ChangeLog that separates what knowledge changes (claim proposal) from how the text changes (document diff). We evaluate KPRs on revising Wikipedia across languages and updating query‑driven reports on RAGTIME. KPRs integrate more information and better preserve existing content than rewriting from sources or regenerating from scratch, while adding the most information per token generated. A KPR‑revised article also grounds question answering better than a frontier model with search, which does not surface knowledge documented only in other languages.
Authors:Maan Qraitem, Kate Saenko, Bryan A. Plummer
Abstract:
Procedural character generation aims to populate games, simulations, and other virtual worlds with diverse characters. Large language models (LLMs) offer a promising foundation for scaling this task. However, LLM‑based procedural character generation remains at an early stage: existing methods either generate characters directly or adapt profiles retrieved from persona banks. As we show, both approaches produce behaviorally homogeneous populations: characters overwhelmingly agree with positive moral norms and respond to questions with helpful, assistant‑like reactions. To mitigate this homogenization, we introduce PersonaWeaver, which disentangles world building from behavioral specification and models behavior through setting general, diverse, manually curated banks of moral positions and conversational reactions. This design allows us to test how far LLM(s) can be pushed beyond their default behavioral patterns across settings. Across ten realistic and fantastical settings and three LLM(s), PersonaWeaver produces broader moral and interactional response distributions than prior work. Its guidance also diversifies interpersonal language, response length, and sentiment. It also produces less archetypal combinations of world attributes. Code is available at https://github.com/mqraitem/PersonaWeaver.
Authors:Mischa Dombrowski, Bernhard Kainz
Abstract:
Diffusion‑based synthetic data generation offers a promising route for sharing medical imaging data without releasing sensitive patient records. However, generative models face a fundamental tension between privacy and fairness: they may memorize rare training samples, leading to privacy risks, or fail to reproduce underrepresented features, resulting in unfair synthetic distributions. While prior work has largely focused on either memorization or fairness in isolation, their interaction remains insufficiently understood. In this work, we introduce a data‑interventional framework to systematically analyze privacy and fairness in diffusion models. We discuss synthetic anatomical fingerprints (SAFs), rare and manually injected image features, as controlled probes to study whether models generalize sensitive attributes across identities, memorize training samples, or suppress rare signals entirely. Across multiple conditioning modalities, we observe a consistent behavior: models either forget these fingerprints or memorize the entire image in which they appear, but do not generalize them to novel images. To support large‑scale auditing where explicit sample extraction is infeasible, we further introduce the indicator metric t', which estimates a model's susceptibility to memorization by exploiting the internal structure of the diffusion process. By comparing conditioning signals of varying surprisal, we reveal a clear relationship between conditioning rarity and memorization behavior. Highly surprising conditioning signals act as retrieval keys that amplify memorization, whereas low‑surprisal conditioning signals systematically suppress rare features, even when these appear repeatedly in the training data. Our findings provide actionable insights and concrete mitigation strategies for safe and fair synthetic medical data sharing. Code is available at https://github.com/MischaD/Privacy.
Authors:Zhe Feng, Longfei Liu, Wei Liu, Kai Chen, Jiangang Kong, Wei Zhou, Yifeng Qian, Dexiong Chen, Xuanlong Yu, Xi Shen
Abstract:
Self‑attention‑based vision backbones perform well on dense prediction, but the quadratic computational cost of global softmax attention limits their efficiency as image resolution increases. We introduce Gated Token Recurrence (GTR), a softmax‑free recurrent vision backbone that combines gated linear attention, alternating spatial scan directions, and spatially enhanced SwiGLU blocks. GTR is distilled from a detection‑specialized DINOv3 teacher using only final‑layer patch‑token alignment through a linear projection and squared \ell_2 loss, without masked‑token prediction or intermediate‑layer supervision. With Objects365 detector pre‑training, GTR‑L achieves 58.9 box AP on COCO \textttval2017 with 1.908\,ms median batch‑one latency under compiled FP16 execution on an RTX~4090. The same backbone also transfers to instance segmentation, pose estimation, oriented detection, semantic segmentation, and monocular depth estimation. In an isolated kernel benchmark, our specialized chunkwise CUDA operator is 4.0× faster than FLA v0.5.0 at 1.6K tokens on RTX~4090. TensorRT deployment on DRIVE AGX Thor achieves 2.282‑‑8.769\,ms median batch‑one latency across the evaluated models. These results show that recurrent token mixing can provide an efficient alternative to global softmax attention for high‑resolution dense prediction and edge deployment. Project page: https://intellindust‑ai‑lab.github.io/projects/GTR/
Authors:Chris Dzoba
Abstract:
We exhibit simple, rotationally symmetric Venn diagrams with 17 curves and with 19 curves: n Jordan curves carried to one another by rotation through 2π/n, with every one of the 2^n regions present and connected and, since the diagrams are simple, every crossing on exactly two curves. Symmetric Venn diagrams exist for every prime number of curves (Griggs, Killian and Savage, 2004), but those diagrams have many curves through a point; simple ones were known only up to 13 curves (Mamakani and Ruskey, 2014). Four 17‑curve and nine 19‑curve diagrams were found by a Metropolis walk on rotation‑invariant quadrangulations of the sphere in which regions may temporarily be duplicated, started from the Griggs‑Killian‑Savage diagram with its multiple crossings resolved. Every diagram is given by a machine‑checkable certificate; one certificate of each size has been verified by a formal proof in Lean 4. All of the diagrams are non‑monotone, which is why the crossing‑sequence searches that found the 11‑ and 13‑curve diagrams could not have found them.
Authors:Nicola Rizzo, Sebastian Visan-Draghicescu, Nadia Pisanti, Veli Mäkinen
Abstract:
An Elastic Degenerate String (EDS, or ED‑string) is a sequence of string sets. A pangenome, consisting of variations observed in a population along the genome sequences, can be naturally encoded as an EDS. Pattern matching and comparison problems on pangenome representations such as EDSes have been widely studied in the literature, but optimizing the pangenome properties during its construction has been largely omitted. We fill this gap by showing how methods originally developed for the related problem of founder reconstruction can be adapted to minimize, in linear time, the total cardinality of the EDS sets or the total size of the EDS strings, given suitable multiple alignments representing the input data. We provide an implementation for the minimum‑cardinality criterion in a tool mincard, and conduct the first experiments on scalable pangenome optimization via EDSes. The code and experiments are available at https://github.com/algbio/eds.
Authors:Yichuan Yu, Youzhuo Wang, Yiming Ren, Di Feng, Yexuan Yang, Bingxi Yang, Shengxiao Gong, Yujing Sun, Yuexin Ma
Abstract:
Humanoid robots require diverse embodied experiences to acquire complex loco‑manipulation and collaborative skills. However, existing humanoid data pipelines primarily focus on individual agents, while physical multi‑robot collaboration remains difficult to scale due to costly hardware, dedicated spaces, and repeated resets. In this work, we introduce MATE, a Multi‑Agent virtual TEleoperation platform for humanoid collaboration data collection that enables multiple geographically distributed operators to simultaneously control whole‑body humanoids in a shared physics‑based environment. MATE removes the need for multiple physical robots and co‑located operation while preserving physically coupled interactions among humanoids, objects, and environments. Using MATE, we construct a multi‑humanoid collaboration dataset comprising 24.1 hours of coordinated behavior across 2,500 joint episodes and five long‑horizon tasks, including object handover, relay delivery, environment interaction, and cooperative transport. To improve learning from these interaction‑rich demonstrations, we introduce EAIS, an Execution‑Aligned Interaction Sampling strategy that computes sampling signals within an execution‑aligned prefix and prioritizes task‑progressing and interaction‑critical behaviors. We evaluate MATE with representative imitation learning and vision‑language‑action policies across diverse collaboration tasks. Experiments demonstrate efficient data collection, effective policy learning, and zero‑shot transfer from virtual demonstrations to a physical humanoid without real‑world fine‑tuning. Project page: https://yerik‑yu.github.io/MATE/
Authors:Zixun Fang, Yawen Shao, Kai Zhu, Jie Xiao, Shihan Chen, Yu Liu, Xueyang Fu, Yang Cao, Wei Zhai, Zheng-Jun Zha
Abstract:
We introduce CoDeR, a new paradigm for world modeling. Unlike existing video world models that implicitly represent world dynamics through visual observations, our system explicitly constructs an executable world with code and employs video generation models for visual realization. Specifically, we coordinate five complementary roles to translate high‑level concepts into structured world rules, executable dynamics, and perceptual observations. This design enables long‑term memory, open‑ended interactions, autonomous world evolution, and multi‑agent scenarios, where multiple entities can act, interact, and evolve persistently beyond the current observation. Extensive experiments demonstrate that our framework substantially extends the capabilities of existing world models, enabling long‑term memory, open‑ended interactions, autonomous evolution, and persistent multi‑agent dynamics, while achieving state‑of‑the‑art performance across multiple evaluation settings. Code and model weights will be made publicly available. Project Page: \hrefhttps://becauseimbatman0.github.io/CoDeRCoDeR.
Authors:Jinhe Tang, Ruixiao Dai, Weiming Zhi
Abstract:
Successful mobile manipulation requires coordinated base and arm motion while maintaining accurate spatial positioning. However, demonstration‑trained policies can struggle to realise the intended base motion reliably, leading to spatial misalignment and subsequent manipulation failures. We present MAVP (Map‑Aware Visuomotor Policies), a framework that improves execution reliability by predicting explicit base‑pose targets and tracking them using localisation feedback. MAVP reconstructs a static map from teleoperated demonstrations and expresses demonstrated base trajectories in a shared map frame, providing consistent spatial supervision across demonstrations. At execution time, the policy receives RGB observations, joint states, and the robot's current map‑frame base pose, and jointly predicts target base poses, arm actions, and gripper actions. A low‑level controller tracks the predicted base targets using feedforward motion and pose error feedback, enabling correction of execution deviations. We additionally use pose‑noise augmentation during training to improve robustness to errors in the policy's pose input. Across six real‑world manipulation tasks and three policy families, MAVP achieves higher task success rates than unanchored velocity control in all tasks. Videos and additional results are available at https://123qwedsa123.github.io/mavp/.
Authors:Xuanyi Liu, Haofeng Wang, Ruiqi Li, Danni Yu, Rui Wan, Ruixu Zhang, Siyu Tao, Xue Yang, Shaofeng Zhang, Zicheng Zhang, Jiaqi Zhang, Siwei Ma
Abstract:
Embodied world models predict the outcomes of robot actions to support learning and planning. For robots equipped with head and wrist cameras, this requires complementary views: the head view captures the overall task, while wrist views reveal local gripper‑object interactions. However, evaluating these views independently cannot determine whether they describe the same action and object state. We introduce TRIWORLDBENCH, a benchmark for evaluating embodied world models through synchronized head, left‑wrist, and right‑wrist videos. It contains 500 episodes across 50 bimanual manipulation tasks and uses 19 metrics to assess tri‑view consistency, task alignment, physical and 3D coherence, motion quality, temporal consistency, and visual quality. By combining cross‑view checks with measurements tailored to each camera, the benchmark evaluates whether plausible individual videos also form a consistent prediction of the intended task. We summarize overall performance with TWB‑Score and retain per‑view results to identify where predictions fail. This extends world‑model evaluation beyond single‑view visual quality. Code, data, and metric definitions are available at https://github.com/TriWorldBench/TriWorldBench.
Authors:Zeyu Lou, Tianran Zhang, Xinquan Yue, Ya Jing, Chenyang Si
Abstract:
Recent vision‑language‑action (VLA) models are promising for general‑purpose manipulation, but long‑horizon execution remains fragile. Small state‑estimation or control errors can lead to irreversible failures (e.g., collisions and object drops). Avoiding these risks requires a proactive safety mechanism capable of anticipating hazards. In this paper, we introduce SafeLoop, a non‑invasive external wrapper that adds hazard prediction and rollback‑based recovery to a VLA model without changing its parameters. SafeLoop trains a risk predictor from vision and proprioception to output four values: the probability and time‑to‑hazard for body collisions and for object failures. A lightweight controller then chooses one of three actions based on the predicted risk: continue execution (noop), save a safety checkpoint (record), or retreat in joint space (rollback). Rollback moves the robot back to a recent safe waypoint and queries the base policy again, which may yield an alternative continuation. Across 24 LIBERO tasks (16 random seeds each) and three real‑robot tasks (25 rollouts each), SafeLoop achieves a stronger overall safety‑success trade‑off than alternative methods, reducing hazard cases by roughly 70% while preserving task success and the base‑policy control rate. Project code is available at https://github.com/Loule0‑0/SafeLoop/tree/release/safeloop.
Authors:Zhicong Cai, Yinglong Zhang, Xiaoying Hong, Xuewen Xia, Xing Xu
Abstract:
Graph neural networks have achieved strong performance in node classification by aggregating information from graph neighborhoods. However, a single aggregation mechanism may be insufficient to capture diverse structural patterns across graph datasets. Moreover, independently training multiple structural branches can introduce substantial overhead without necessarily producing stable node representations. To address these issues, this paper proposes PreGS, a parameter‑transfer‑based multi‑expert graph neural network framework. PreGS first pretrains a multi‑head graph attention network (GAT) and transfers the linear transformation weights of its first‑layer attention heads to multiple GraphSAGE experts. The transferred experts are frozen and used as complementary structural branches. The fused raw node features, GAT head representations, and GraphSAGE expert representations are fed into a multilayer perceptron (MLP), whose output is further fused with the pretrained GAT logits. Based on PreGS, we further develop PreGSv2, which introduces source‑level weighting and a structural gating mechanism for adaptive multi‑source feature integration. Experiments on eight public graph datasets show that PreGS and PreGSv2 achieve competitive performance against representative graph neural network baselines. Ablation, parameter‑transfer, sensitivity, aggregator, visualization, and training‑time analyses further validate the effectiveness and stability of the proposed framework. The code and datasets are available at https://github.com/LH‑Czc/PreGS.
Authors:Sicheng Shen, Dongcheng Zhao, Zhiyuan Li, Jinyan Yu, Qian Zhang, Dengpeng Xing, Zhitong Zhang, Tielin Zhang
Abstract:
Spiking Transformers inherit token interaction mechanisms from conventional Transformers, yet their sparse binary representations fundamentally alter how token‑to‑token communication is established. In particular, spike‑based query‑key matching produces highly sparse and input‑dependent interaction patterns, coupling information propagation to the instantaneous availability of matching spike events. This motivates a different interaction paradigm in which long‑range communication does not rely solely on pairwise spike coincidence. We therefore propose Gated Spike Axial Propagation (GSAP), a spike‑native token interaction mechanism that decouples information propagation from context selection. Instead of directly determining communication through query‑key matching, GSAP first propagates spike‑based context along the horizontal and vertical axes, allowing information to reach distant tokens through structured sequential propagation. A receiver‑conditioned gate then determines how much of the propagated context is incorporated at each token, while a lightweight local pathway preserves fine‑grained neighborhood information. In this way, GSAP reformulates token interaction as a propagate‑then‑select process, enabling structured long‑range communication while retaining the sparse event‑driven nature of spiking representations. Code is available at https://github.com/Fancyssc/GSAP.
Authors:Yunfei Zhang, Wen Wen, Tieliang Gong, Weizhan Zhang
Abstract:
Continual learning (CL) aims to incrementally acquire knowledge from sequential data while avoiding catastrophic forgetting. Recently, prompt tuning has attracted increasing attention as an efficient approach for adapting pre‑trained models to CL tasks. However, existing prompt design paradigms commonly suffer from retrieval dependence and classifier bias, which make model adaptation sensitive to prompt selection and bias predictions toward newly arrived classes. To address these challenges, we propose Decoupled Prompt Tuning for Continual Learning (DPT4CL), which decouples the CLIP textual prompt into a task‑shared prompt distribution and class‑specific prompts. The task‑shared prompt distribution is derived by optimizing an Information Bottleneck objective to facilitate cross‑task knowledge transfer and alleviate classifier bias, while class‑specific prompts enhance inter‑class separability without relying on explicit prompt retrieval. Furthermore, we establish a unified excess risk bound from an information‑theoretic perspective, providing theoretical support for the robust generalization and forgetting mitigation of the proposed framework. Extensive experiments on standard CL benchmarks demonstrate that DPT4CL achieves state‑of‑the‑art performance. The source code is available at https://github.com/Cloudfly‑Z/DPT4CL
Authors:Yizhong Geng, Yanliang Li, Jinghan Yang, Tianhan Jiang, Yingming Gao, Ya Li
Abstract:
Text‑to‑speech systems are increasingly used for drama dubbing, yet evaluation protocols remain sentence‑level, leaving critical scene‑level behaviors insufficiently measured. We present SceneTTS‑Bench, a benchmark that evaluates TTS along three dimensions: timbre consistency across character turns, emotional expressiveness on high‑tension utterances, and rhythm coherence under segmented long‑form synthesis. The corpus comprises real‑world and generated drama scripts totaling 160 bilingual scenes and approximately 10,300 utterances, with real‑world scripts serving as the primary source (100 scenes) and generated scripts as a supplementary source (60 scenes), demonstrating the framework's extensibility through synthetic data augmentation. A backend‑agnostic Canonical Intermediate Representation ensures fair cross‑system comparison. Three automatic pipelines produce per‑utterance diagnostics: Speaker Consistency Score for timbre‑drift detection, Under‑Acting Ratio for under‑acting identification, and Rate Discontinuity Ratio for rate‑discontinuity quantification. Experiments on four TTS systems confirm that each system exhibits distinct weaknesses and that scene‑level rankings diverge substantially from sentence‑level metrics. Benchmark resources are publicly available at https://piedpiperg.github.io/scenetts‑bench/ .
Authors:Minhan Cho, Soyoung Park, Daejin Choi, Jinyoung Han
Abstract:
We present the ABAI submission to COLIEE 2026 Task 1, case law retrieval, together with a controlled study of why it underperformed. The task suppresses the cited passages themselves, which removes much of the lexical overlap a retriever would rely on. Our pipeline answers this with four independently trained stages: multi‑view BM25 over citation‑context windows with reciprocal rank fusion, neural reranking, graph‑based features from entity communities and a graph attention network, and a LightGBM meta‑learner over 34 features. Our best run reached F1=0.177 on the official test set, against a cross‑validated 0.311, and we attributed that gap to a recall ceiling, temporal distribution shift, and threshold miscalibration. We then tested all three. Under leakage‑free protocols threshold transfer costs 0.007 F1, decision quality is flat across chronological quartiles, and the official test queries are not measurably farther from the training manifold than training queries are from each other, in two independent embedding spaces. Decomposing the misses instead splits them exactly evenly between candidates never retrieved and candidates retrieved but ranked below the cut. Measuring the remedies for each half, BM25 length‑normalisation tuning, an event‑triple view, and full‑content dense fusion lift top‑200 recall by three to seven points, and citation‑graph features add 0.014 F1 over eight seeds once own‑citation leakage is removed, while per‑query cutoff rules, a zero‑shot reranker swap, and a date filter do not help. We also document four evaluation artifacts, each of which reversed a result once the protocol was corrected.
Authors:Muhammad Ayub Sabir, Junbiao Pang, Fatima Ashraf
Abstract:
Continuous and subtle GNSS spoofing poses a serious threat to autonomous vehicles because forged positions may remain locally plausible while gradually becoming inconsistent with vehicle motion observed by non‑GNSS onboard sensors. Existing AV‑oriented detectors commonly rely on residual thresholds or feature‑level classification and provide limited modeling of how weak GNSS‑‑motion inconsistency develops and persists over time. This paper formulates subtle GNSS spoofing detection as a causal sequential evidence‑modeling problem and proposes a high‑order liquid evidence detector. The method first compares the displacement implied by consecutive GNSS positions with that inferred from independent onboard motion observations and converts their difference into uncertainty‑normalized residual evidence. It then represents the current inconsistency, its local evolution, excess above the normal level, accumulated persistence, and displacement validity as causal weak evidence. These cues are mapped into instantaneous, evolutionary, and persistent latent states, aligned through a bounded Kirchhoff‑inspired symmetric exchange, and combined through an explicit third‑order interaction to capture their coordinated support for spoofing. To model how this coordinated evidence develops over time, second‑order liquid dynamics track its memory and evolution to estimate causal spoofing probabilities, which are converted into confirmed alarms using validation‑selected threshold and persistence parameters. Experiments on the AV‑‑GPS dataset family demonstrate strong controlled and external generalization, together with clear sequential alarm behavior. On Dataset‑1, the proposed detector achieves an AUROC of 0.9932 and an AUPRC of 0.9843, while obtaining the lowest false‑positive rate among the learning‑based baselines. Code: https://github.com/pangjunbiao/HO‑LLN‑Spoofing.
Authors:Mizanur Rahman, Huan Wu, Arash Asgari, Enamul Hoque Prince, Laleh Seyyed-Kalantari
Abstract:
Vision‑language models (VLMs) are increasingly used to interpret charts and generate natural‑language explanations for socially consequential data. However, they may produce different narratives for the same chart when only the referenced social group changes, reinforcing stereotypes and misleading decisions. Despite these risks, no benchmark exists for systematically evaluating bias in chart interpretation across social dimensions. We introduce ChartBias, the first benchmark for auditing bias in VLM‑based chart interpretation. ChartBias contains 820 manually curated real‑world charts spanning six attributes: race, income, age, religion, immigration status, and gender, yielding 4,319 valid chart, attribute instances and 8,638 paired generations where the chart is fixed and only the group term is swapped. Across 12 proprietary and open‑source VLMs, totaling 155,484 model responses, we find three widespread failure modes: narrative shift (same chart, different narratives), group hallucination (assigning a chart to a group without evidence), and preference polarity (favourable trends often linked to one group). We further propose a multi‑agent mitigation framework that serves as a strong baseline by separating chart‑grounded evidence extraction from group‑conditioned generation and using a counterfactual judge to verify that group‑driven differences are supported by the chart. The framework substantially reduces narrative shift while preserving chart‑grounded reasoning. Our findings show that evaluating chart understanding requires measuring not only accuracy, but also fairness and consistency across social groups. We release ChartBias at https://github.com/vis‑nlp/ChartBiasBench.
Authors:Mizanur Rahman, Aaryaman Kartha, Enamul Hoque Prince
Abstract:
Data visualization is central to analytical reasoning, but real‑world analysis increasingly requires language‑driven interactive interfaces rather than static charts. Although recent large language and vision language models (LLMs/VLMs) have shown promise in generating static charts from natural language, their ability to generate interactive data visualization interfaces remains largely unexplored due to the lack of benchmarks. We introduce VIS‑GEN, a benchmark for evaluating how well LLMs/VLMs can generate interactive visualization interfaces from natural language queries. VIS‑GEN comprises 3,042 samples covering diverse analytical intents, including data filtering, temporal analysis, and visualization editing, each paired with dataset metadata and natural language queries that are designed to reflect realistic, goal driven data exploration scenarios. We benchmark 14 state‑of‑the‑art open‑source and closed‑source LLMs/VLMs, revealing large performance gaps and frequent failures on queries involving implicit intent, multiple interaction alternatives, and complex editing operations, highlighting interactive interface generation as a key open challenge beyond static chart synthesis. To address this, we propose a structured multi stage interface generation framework that decomposes the task into visualization design representation, generation of multiple interface candidates, constraint‑aware critique, and self‑refinement. This approach improves the best models pass rate by 15.9 percentage points, demonstrating a practical path toward more reliable language‑driven interactive visualization systems. We release VIS‑GEN at https://github.com/vis‑nlp/VIS‑GEN.
Authors:Ziheng Jia, Zicheng Zhang, Jiaying Qian, Guangtao Zhai, Xiongkuo Min
Abstract:
Aligning with the human visual system~(HVS) in perceiving and evaluating the quality of visual signals is a central objective of machine‑vision‑based visual quality assessment systems. With the rapid progress of large multi‑modal models~(LMMs), visual question answering provides a promising paradigm for building unified foundation models for visual quality assessment under multi‑modal and multi‑task scenarios. Inspired by the classical ``perception‑decision" process in HVS‑based quality evaluation, we formulate visual quality assessment for LMM‑based machine vision as two complementary tasks: ``quality interpretation'' and ``quality scoring". Centered on these objectives, we propose LLaVA‑Assessor, a unified data construction and model training system. To support multi‑modal inputs, we design an adaptive model architecture that enables efficient processing of both images and videos. For data construction, we develop rigorous human annotation protocols and a novel machine‑synthesis‑dominated data expansion pipeline to build a large‑scale and high‑quality datasets. Furthermore, we introduce a simple yet effective prompt disentanglement strategy to alleviate training‑objective confusion in multi‑task learning, thereby enabling stable and coherent joint training. The resulting all‑in‑one LMM LLaVA‑Assessor‑GIGA achieves superior performance on 11 image/video quality scoring test sets and 4 visual quality interpretation benchmarks. Extensive results demonstrate the effectiveness of integrating structured data construction, adaptive model design, and multi‑task joint training for automated visual quality assessment. Our work provides compelling insights for developing foundation LMMs for automatic visual quality assessment. Project page at https://github.com/jzhws/LLaVA‑Assessor.
Authors:Abdul Basit Tonmoy, Kazi Fardinul Hoque, Md. Shahrier Islam Arham, Arman Luthra
Abstract:
Multimodal embedding models are deployed at scale: retrieval indices, benchmark results, and behavioral audits all depend on the base model's exact outputs. Extending such a model to a new modality with existing parameter‑efficient methods silently changes those outputs; LoRA‑style adaptation rewrites the text path whether or not the weights are merged, invalidating every stored embedding. We propose modality‑gated deep adapters: bottleneck adapters attached to every decoder layer of a frozen multimodal embedding LLM, grouped into per‑modality packs that execute only while their own modality is being encoded. The result is a modality added with zero change to existing outputs: inputs no pack claims traverse the base model's own computation graph, bit‑for‑bit unchanged, and co‑loaded packs compose with an exact‑zero isolation matrix. Both properties are stated as propositions, hold after arbitrary training rather than only at initialization, require no task labels or routing metadata at inference, and are verified by exact‑equality tests on the released checkpoints. On one frozen 2B base, the audio pack (injected as connector tokens) improves audio‑to‑text R@10 by +3.4 to +5.4 points over an identically trained control, positive at every seed and reproduced at eleven times the data; the thermal pack, reusing the base's own frozen vision path, clears its pre‑registered acceptance gate roughly sevenfold at every seed and lifts thermal‑to‑text R@10 from 0.224 to 0.785. An encoder swap locates the missing capacity: an external audio encoder that outranks Whisper‑family encoders in CLAP‑style comparisons loses by 16 R@10 points inside the frozen LLM, so the capacity belongs in the layers, exactly where the gated adapters place it. We release the audio model, the thermal pack, and the training, evaluation and invariance suites: models at huggingface.co/EximiusLabs, code on GitHub.
Authors:Futian Wang, Mengqi Wang, Xiao Wang, Wentao Wu, Haowen Wang, Zhicheng Zhao, Jin Tang
Abstract:
Remote Sensing Change Captioning (RSCC), which aims to generate accurate and detailed linguistic descriptions of ground object variations from bi‑temporal remote sensing images, is a critical and challenging task in intelligent remote sensing interpretation. The mainstream autoregressive training paradigm faces severe exposure bias and train‑test distribution mismatch, resulting in cumulative generation errors. They tend to produce conservative and template‑fixed captions while ignoring subtle scene change details. To address these challenges, this paper proposes a novel multi‑granularity reward reinforcement learning paradigm, termed MGRL‑RSCC. Specifically, we first leverage a CNN and hierarchical self‑attention module to extract and enhance visual features from bi‑temporal remote sensing images. A Transformer decoder is then utilized to complete visual‑to‑linguistic translation. Different from existing methods, we design a dual‑decoding strategy and a two‑stage joint optimization scheme, which combines token‑level supervised learning via greedy decoding and multi‑granularity reward‑driven self‑critical reinforcement learning via sampling decoding. We further construct three complementary reward functions covering linguistic fluency, change state consistency, and structural‑semantic relevance to comprehensively optimize caption quality and alleviate false and missing change descriptions. Extensive experiments on multiple public RSCC benchmark datasets demonstrate that the proposed MGRL‑RSCC effectively mitigates exposure bias and conservative generation problems in traditional autoregressive methods. The source code and pre‑trained models will be released on https://github.com/Event‑AHU/MGRL‑RSCC
Authors:Kaihang Zheng, Jun Li, Hang Guo, Hongyu Chi, Zimo Liu, Tao Dai, Jinpeng Wang, Yaowei Wang
Abstract:
Image restoration is inherently challenging due to the diverse and highly input‑dependent nature of real‑world degradations. While recent architectures like Transformers and state‑space models have advanced the field, they predominantly rely on static, globally shared parameters, which struggle to fully accommodate instance‑specific degradation patterns. Test‑Time Training (TTT) offers a promising paradigm for generating data‑dependent operators, yet its standard self‑supervised inner loop lacks the explicit guidance required to transition degraded features toward clean structures. To address this, we propose TTTIR, a novel framework that reformulates image restoration as an instance‑specific state evolution process. Specifically, we design Progressive State Sequence Generation (PSSG) to construct complementary spatial‑frequency target states (defining what to recover), and State Transition Evolution (STE) to adapt lightweight transition operators via a restoration‑oriented TTT inner loop (determining how the features should evolve). Extensive experiments demonstrate that TTTIR consistently outperforms state‑of‑the‑art models across multiple image restoration benchmarks, achieving dynamic instance‑specific recovery with favorable computational scalability. The code is available at https://github.com/Elysiaaaaaaaa/TTTIR.git.
Authors:Futian Wang, Yuhan Qiao, Xiao Wang, Dan Xu, Yuehang Li, Zhixiang Guo, Yaowei Wang, Jin Tang
Abstract:
Despite the remarkable progress of LLM‑based and knowledge graph‑augmented Radiology Report Generation (RRG) methods, existing techniques still suffer from inherent defects. Conventional LLM‑only models lack structured medical prior knowledge, resulting in frequent medical hallucinations and low diagnostic interpretability. Current knowledge graph‑enhanced schemes adopt static one‑round knowledge fusion with single‑source knowledge, incapable of dynamic knowledge updating according to generation feedback. This paper proposes a novel Multi‑Agent Collaborative iterative framework for X‑ray Radiology Report Generation, termed MAC‑RRG. Inspired by multi‑agent technology, our framework constructs a closed‑loop optimization paradigm based on task decoupling and collaborative reasoning. Specifically, the framework first generates a preliminary radiology report from input X‑ray images via a vision encoder and a basic LLM. Subsequently, a multimodal knowledge graph (MM‑KG) agent mines structured disease correlation and anatomical knowledge from medical knowledge graphs, while an auxiliary knowledge agent extracts unstructured domain knowledge from public medical databases. The multi‑source knowledge acquired by dual agents is fused and embedded to guide the LLM in iteratively refining the initial report. Extensive quantitative and qualitative experiments on mainstream X‑ray RRG datasets, including IU X‑ray, MIMIC, and CheXpert Plus, fully verify the superiority of our proposed method. The source code and pre‑trained models have been released on https://github.com/Event‑AHU/Medical_Image_Analysis
Authors:Yang Ding, Haoran Yu, Xin Ma, Yulei Lu, Menglin Han, Yaole Wang, Siqian Yang, Gang Yue, Kaihao Zhang, Yaohui Wang, Lin Ma
Abstract:
Human‑centric audio‑visual generation spans several closely related tasks: animating a person from driving speech, jointly generating speech and video from a voice reference, and synthesizing a scene from paired appearance and voice references. Existing systems commonly solve these tasks with separate models, even though they share the same target modalities and differ mainly in which observations are provided as conditions. We present Vorch‑Human, a unified human‑centric generation framework built on a dual‑stream audio‑video diffusion transformer. Vorch‑Human augments the conventional noisy audio/noisy video interface with clean condition‑audio and condition‑video token groups. Per‑token task embeddings, temporal position types, condition masks, and a shared multimodal prompt encoder allow driving speech, timbre examples, first frames, and subject images to be expressed within one model. To supply the supervision required by this interface, we develop a two‑level data pipeline. Level 1 analyzes each clip with speech recognition, vocal separation, face detection and tracking, active‑speaker and synchronization models, audio/visual speaker clustering, and multimodal caption correction; it produces subject‑indexed speech, appearance, and timbre annotations. Level 2 links the same person across clips from a common source video and mines identity‑ and outfit‑consistent reference images after face, body, quality, pose, and vision‑language verification. Finally, we adapt Vorch‑Human to long‑form audio‑driven generation by training with clean latent prefixes and using the same frozen‑prefix recurrence at inference. Each segment contributes only its newly generated suffix, reducing boundary discontinuity and long‑horizon identity drift. Experiments on short and five‑minute generation demonstrate strong identity preservation, audio‑visual synchronization, and temporal stability.
Authors:Qiang Chen, Xiao Wang, Qingquan Yang, Hao Si, Zikang Yan, Meiwen Chen, Guosheng Xu, Jin Tang
Abstract:
With the growing global demand for energy, nuclear fusion has emerged as a promising direction for future clean energy. Tokamaks represent one of the leading approaches to magnetic‑confinement fusion. Achieving high‑performance, long‑pulse, and steady‑state operation requires effective diagnosis of plasma states. However, existing intelligent diagnostic methods are largely limited to either multimodal single‑task or unimodal multitask learning, while a unified multimodal multitask learning framework remains underexplored. To address this gap, we construct EAST‑VTD640, a multimodal multitask dataset that integrates vision and time‑series diagnostics from 640 EAST shots for disruption prediction, edge‑localized mode (ELM) recognition, and H98 regression. On this basis, we present FusionMMT, the first unified multimodal multitask framework for intelligent tokamak plasma diagnostics. FusionMMT employs multi‑scale, time‑aware, and variable‑aware modeling to handle heterogeneous sampling rates and the high computational cost of high‑frequency sequences. It further combines task‑adaptive multimodal fusion with progressive multitask optimization to learn shared and task‑specific representations while mitigating cross‑task conflicts and optimization imbalance. Extensive experiments on EAST‑VTD640 show that FusionMMT outperforms representative multimodal multitask methods across disruption prediction, ELM recognition, and H98 regression. The source code will be released on https://github.com/Event‑AHU/OpenFusion
Authors:Feixiang Liu, Qiang Qiu, Qingyang Li, Hui Xu
Abstract:
Vision‑language models can answer spatial relation questions confidently even when the image supports an incompatible relation. We formulate relation‑grounded selective prediction: accept or reject an already‑produced yes/no answer by auditing its visual support, rather than treating uncertainty as evidence. RECAP, our relation‑evidence calibration framework, compares image‑conditioned likelihoods for a claim, its semantic contradictions, and optional one‑sided supports, then converts these witnesses into an answer‑conditioned rejection risk. A calibration‑only gate preserves confidence as a veto when confidence is demonstrably informative and otherwise deploys relation evidence alone. Across 20 group/image‑disjoint splits, RECAP lowers H‑FPR@80 over confidence by between 2.0 and 17.9 points on VSR and raises Acc@80 by 3.0, 8.6, and 12.6 points on What'sUp for Qwen3‑VL‑8B, InternVL3.5‑8B, and LLaVA‑1.5‑7B. It outperforms matched VCD‑style visual contrast on all four primary metrics in all six settings. Full‑pool VSR fallback, target‑ranked GSR‑Bench transfer, equal‑budget supervised controls, and two additional checkpoints show a consistent operating principle: structured counterevidence complements certainty when confidence is misaligned, while the gate retains confidence when it is already useful.
Authors:Shuxiao Xie, Shuyang Xie, Yuan Cao, Dezhi Ran, Wei Yang, Tao Xie
Abstract:
A Strassen‑type algorithm has many realizations with the same exact product and multiplication count yet different fp8 error because basis changes reshape coefficient geometry, posing the question of which to run. No current account settles this: classical stability controls worst‑case \ell_1 growth, not the expected‑error magnitude, and the Dumas‑‑Pernet‑‑Sedoglavic optimizer could only be called probably optimal, its global optimality unproved. To settle this, we attach to each realization a coefficient functional Φ, a scalar summary of its coefficient geometry, which we minimize over the change‑of‑basis orbit. This Kempf‑‑Ness problem on a Hadamard manifold lets us certify the global Φ optimum rather than merely search for it: an exact moment‑map zero fixes Φ_\min = 200/9, and de Groote's classification extends that optimality to every exact real rank‑7 2×2 decomposition. Every exact real rank‑7 realization therefore has a Φ‑predicted RMS constant at least 5/3 times that of the cubic algorithm, at fixed noise coefficient. We then introduce an explicit block‑scaled e4m3 model in which Φ is the leading‑order coefficient of relative expected mean‑squared error, and we test the resulting Φ‑predicted ordering against realized fp8 error. Ordering and re‑basing experiments support that prediction within tested fused block‑scaled regimes, and on real matmul tiles from four architecture families the Φ‑optimal realization falls in the fp8 low‑error region. Across two ~70B models on real deep_gemm kernels, the same realization removes 10 to 55% of classic Strassen's excess NLL over the clean model. Algorithm realization thus becomes a mathematically certified design problem rather than a tuning choice: an independent low‑precision axis with a global Φ optimum and measured fp8 relevance.
Authors:Kazi Ahmed Asif Fuad, Lizhong Chen
Abstract:
Kolmogorov‑‑Arnold Networks (KANs) replace scalar edge weights with learnable univariate functions, increasing flexibility but also parameter memory because each edge stores multiple coefficients, often together with a separate base branch. We introduce FuncCode, a basis‑agnostic compression approach that forms shared codebooks from sampled edge responses, codes the basis and base branches independently, and exports the resulting codebooks and per‑edge indices in a quantized, bit‑packed format. Across spline and polynomial KANs, sampled edge responses exhibit 13‑‑35% lower effective rank than their coefficient representations. Further replicated controls show that function‑space clustering alone is statistically tied with coefficient‑space clustering; the consistent accuracy gain comes from preserving the distinct sharing structure of the two branches. On a ten‑seed MNIST benchmark, FuncCode compresses spline and GRAM KANs by 31.6× and 17.6× with only 0.31 and 0.34 pp accuracy loss. On a 6.1M‑edge convolutional KAGN, it achieves 19.9× compression while remaining within 0.54 pp of dense accuracy on CIFAR‑10 and 1.89 pp on CIFAR‑100. After compression, per‑edge indices account for up to 99.4% of stored weight bits, making the representation index‑bound. Across nine bit‑exact FPGA accelerators, FuncCode reduces SplineKAN post‑route weight memory by 3.87× relative to dense INT4, without increasing cycle count or latency. The FuncCode implementation is available at https://github.com/OSU‑STARLAB/FuncCode.
Authors:Zijian Zhao, Dian Jin, Xialiang Tong, Sen Li, Mingxuan Yuan
Abstract:
Diffusion Large Language Models (dLLMs) have recently emerged as a promising alternative to conventional Auto‑Regressive (AR) Large Language Models (LLMs). By leveraging bidirectional attention and parallel decoding, dLLMs enable more efficient generation. However, they require a carefully designed denoising scheduler at inference time (absent during training) whose choice significantly impacts generation quality. While confidence‑based heuristic schedulers have shown strong empirical performance, they suffer from two critical failure modes: EOS Overflow and Proximal Bias. Through in‑depth analysis of the Transformer's attention patterns, we reveal that these failures stem from certain positions assigning disproportionately high attention weights to invalid tokens (e.g., [MASK] and [EOS]), which produce misleading confidence signals. Building on this insight, empirical evidence shows that valid attention scores can provide complementary guidance to conventional confidence‑based heuristics, yet no single metric consistently excels across all scenarios, implying that the optimal denoising trajectory is highly context‑dependent. To address this problem, we propose a lightweight evolutionary heuristic scheduler optimized using the Covariance Matrix Adaptation Evolution Strategy (CMA‑ES). Our scheduler dynamically integrates multiple heuristic features with a contextual mean‑field embedding, while requiring only 393 trainable parameters. Evaluated on LLaDA and Dream across four reasoning and planning benchmarks, our method consistently outperforms strong baselines, including conventional heuristics, block auto‑regressive methods, and recent State‑Of‑The‑Art (SOTA) approaches. To the best of our knowledge, it represents the most parameter‑efficient neural scheduler to date. Our code is available at https://github.com/RS2002/Evo‑Denoise .
Authors:Gaston Besanson
Abstract:
We call the object this paper derives and certifies a minimal sufficient governance context: given a finite reachable‑state model, a deterministic declared verdict, and candidate observable attributes, we compute sufficient observation sets, distinguish attributes that are individually indispensable from contracts that are jointly sufficient, and select among sufficient contracts under a cardinality or declared‑cost objective. An observation contract is a set of candidate attributes whose values determine the declared verdict on every reachable state; an authority contract is one selected under an objective and bound to a gate schema. We synthesize every inclusion‑minimal sufficient contract where exhaustive enumeration is affordable, and a minimum‑cardinality or minimum‑cost contract by SAT/MaxSAT encoding otherwise, checking sufficiency directly. On a constructed code/cloud domain, the individually‑indispensable core is not sufficient as an observation contract and two distinct reducts exist; a preregistered cost model separates them exactly. On a second, larger, constructed domain, the same pattern recurs, but that domain's cost model does not separate the alternatives: a fully explained cost tie, reported as found. We measure discernibility‑family scaling where exhaustive enumeration is confirmed infeasible within a registered timeout, while SAT/MaxSAT synthesis solves in well under a second; MaxSAT showed no measured cardinality advantage over plain SAT. AuthorityBench compares four baselines across three domains; the declared‑only baseline is not exactly sufficient on any. Every selected contract is checked for sufficiency, with a counterexample on failure and a check summary, not a portable certificate, on success ‑‑ the compiler‑focused scope of a two‑scope table; an independently specified end‑to‑end case study is registered follow‑up work, not claimed here.
Authors:Abhishek Sharma
Abstract:
When an agent handling a payment exception loses money, the agent‑step attribution methods this paper compares against will name one of its actions. They will do so even when a settlement message was dropped and the agent never had a chance: they intervene on agent actions and do not expose infrastructure faults as intervenable variables, so every dollar they explain is charged to a decision. We take a benchmark whose fault process is explicit and replayable, decompose each episode's realised delivery schedule into named, individually repairable messages, and intervene on both the agent's choices and the infrastructure's. A telescoping identity splits any policy's loss exactly three ways: an infrastructure effect, a policy differential against the best implementable policy, and a reference‑policy residual. Two of the three can be negative, so none is a share; Shapley then divides the first into signed allocations over individual messages. One result is structural and needs no corpus: an agent‑only baseline identifies no infrastructure cause, because its model contains no variable that could name one. What 545 planted episodes across 3 policies measure is the size of that consequence. It misfiles 100% of infrastructure episodes and charges 114,383.40 to the agent. Repairing what it names recovers 0.0% of the available loss; repairing a minimal sufficient set recovers 100.0%. Scoring messages one at a time is not merely imprecise: 27.8% (95% CI: 23.3‑‑32.3%) of episodes do not decompose additively. We evaluate deterministic programmatic policies rather than language‑model agents, which is what makes replay exact and which limits external validity to stochastic agents. The prevalence figures are properties of this generator, not field rates.
Authors:Jiayi Lu, Yizhong Geng, Jinghan Yang, Tianhan Jiang, Boxun An, Yingming Gao, Ya Li
Abstract:
Low‑resource text‑to‑speech (TTS) adaptation is constrained by scarce paired data and costly manual transcription. Existing fixed‑voice TTS systems can provide relatively accurate pronunciation, but their synthetic speech offers limited speaker diversity and may exhibit flat prosody. Real recordings provide natural prosody and diverse voices, yet their automatic speech recognition (ASR) pseudo‑labels may contain transcription errors. We find that supervision order affects content accuracy and speaker similarity. We propose trust‑aware progressive adaptation: synthetic‑to‑real adaptation first establishes text‑speech correspondences, then restores reference‑speaker control using real speech. Transcript‑agreement weighting uses agreement between two fixed ASR systems as a proxy for pseudo‑label reliability to limit noisy supervision. Experiments with FireRedTTS3 on Burmese and Lao and OmniVoice on Burmese show improved content accuracy with high naturalness and competitive speaker similarity. Jointly considering supervision order and pseudo‑label reliability when combining synthetic and real speech offers a practical path to zero‑shot voice cloning in low‑resource languages with less manual transcription. Audio demos are available at https://insiderx‑pro.github.io/S2R‑Adaptation‑TTS/
Authors:Ricardo B. Sousa, Giorgio Grisetti, Héber Miguel Sobreira, Carlos André Silva, António Paulo Moreira
Abstract:
2D point cloud registration arises in laser odometry and Simultaneous Localization and Mapping (SLAM) for mobile robots. Iterative Closest Point (ICP) is one of the most widely used approaches. Still, its iterative procedure recomputes correspondences via nearest‑neighbor search at every iteration, whereas correspondence‑free alternatives focus on scan‑to‑map alignment. This paper proposes a 2D point cloud registration approach based on unsigned distance maps, precomputing the Euclidean distance to the nearest reference point, along with its spatial derivatives, over a discrete grid, replacing the per‑iteration search with O(1) lookups. Moreover, point‑to‑point and point‑to‑plane error formulations are derived on the SE(2) manifold and solved via Gauss‑Newton optimization. On a synthetic benchmark and the real‑world IILABS 3D dataset, the precomputed point‑to‑point variant outperforms its analytical counterparts, achieving competitive laser‑odometry drift compared to point‑to‑plane formulations, as the precomputed gradient regularizes correspondences in the presence of sensor noise.
Authors:Mustafa S. Aljumaily, Hayder Kareem Abed, Nawar S. Alseelawi
Abstract:
Cybersecurity literature has extensively documented the operational benefits of artificial intelligence (AI) for threat detection, incident response, and prevention, while raising qualitative concerns about over‑automation, algorithmic bias, and analyst‑skill erosion. What remains largely absent is a formal, falsifiable model connecting three constructs that recur across this literature: Defense‑in‑Depth Theory, the Artificial Intelligence Theory of Pattern Recognition, and human‑AI collaboration in security operations. This paper develops such a model. We formalize layered defense as a Bernoulli detection cascade in which AI augmentation enters multiplicatively across layers; we formalize each layer's pattern‑recognition behavior as a Neyman‑Pearson/Bayesian detector with a derived closed‑form optimal threshold; and we formalize human‑AI triage as a capacity‑constrained cascade with an explicit, quantifiable trade‑off between detection probability and false‑alarm ("alert fatigue") rate. A Monte Carlo/analytical simulation evaluated at illustrative but realistic operating points shows that (i) AI augmentation compounds across defense layers, delivering its largest marginal gains exactly where traditional layering saturates, and (ii) full human review of AI‑flagged alerts is not optimal: increasing analyst capacity toward 100% coverage cuts false alarms by roughly 20‑fold but simultaneously lowers system‑level detection probability, because imperfect analyst accuracy is then applied to every alert rather than a filtered subset. These results give the widely repeated qualitative recommendation of "balanced human‑AI collaboration" a precise, testable form and suggest an interior‑optimum capacity ratio as a concrete design target for security operations centers (SOCs), including those securing IT/OT‑converged critical infrastructure.
Authors:Ziyan Feng, Zizhao Yuan, Yulong Fu, Yuxin He, Zhiyuan Zhang, Zhengjie Zhang, Jinni Zhou, Renjing Xu, Qiang Nie
Abstract:
How should a robot learn to manipulate objects so fragile that sub‑Newton contact forces can cause irreversible damage? Existing visuo‑tactile policy learning typically treats tactile sensing as an additional policy input. In direct‑contact force‑sensitive manipulation, however, the bottleneck can arise earlier, during data collection: manual gripper control is too delayed and coarse‑grained to reliably maintain the narrow force range required for stable grasping. We therefore use a deterministic 25 Hz tactile reflex controller as a collection‑time teacher, producing demonstrations with controller‑shaped grasping behavior for tactile‑free policy learning. On Action Chunking with Transformers (ACT), policies trained from reflex‑shaped demonstrations recover the teacher's grasping profile and achieve 95% stable grasps on the nominal plastic‑cup task, substantially outperforming visually screened manual demonstrations. The same intervention improves in‑distribution stability on π_0.5 and shows a favorable exploratory trend on an unseen paper‑cup variant. Under randomized external disturbance, however, the reflex‑data π_0.5 policy still fails in 45% of policy‑only trials, whereas a deployment‑time reflex arbiter retains all grasps. These results reveal a new role for tactile feedback in force‑sensitive manipulation: rather than integrating tactile into the policy, we use it as a collection‑time teacher that shapes grasping behavior in demonstrations for policy learning, while disturbance rejection remains controller‑dependent, revealing the boundary of tactile‑free policy.
Authors:Hoang-Thang Ta
Abstract:
The connection between the Kolmogorov‑Arnold representation theorem (KART) and neural network design has led to the development of Kolmogorov‑Arnold Networks (KANs), with applications ranging from STEM problems to AI tasks. In this paper, we investigate the effectiveness of a KAN variant, SechKAN, which relies on hyperbolic secant (sech) functions as basis functions, with a 1D projection to reduce the number of parameters to a level comparable to MLPs. We evaluate SechKAN on three 1D classification datasets: UCI Human Activity Recognition (UCI HAR), ElectricDevices, and Crop, and compare it with several effective networks, including EfficientKAN, MLP, CNN1D, ResNet1D, and DSCNN1D, using approximately comparable parameter budgets. The results indicate that SechKAN achieves competitive performance across the three datasets, with particularly strong performance on Crop. Ablation studies further show that grid size and normalization affect performance, suggesting that SechKAN's effectiveness depends on the dataset and architectural choices. Our source code and experimental implementation are publicly available at: https://github.com/hoangthangta/SechKAN_1D.
Authors:Xinyue Guo, Jianxuan Yang, Daiguo Zhou, Jiagao Hu, Yuxuan Chen, Fei Wang, Jian Luan
Abstract:
Visual object removal can eliminate a target from video frames, yet its acoustic trace persists in the soundtrack, causing obvious audio‑visual inconsistency. Existing video inpainting models operate solely on pixels, while audio editing models, especially for the sound removal task, are typically driven by text and therefore rely on limited single‑modal control, which is less effective than multimodal guidance that provides stronger semantic grounding and temporal synchronization cues. In this paper, we present Text‑Visual Guided Sound Removal (TV‑AudioRemover), a target sound removal framework that leverages the visually edited video together with a natural‑language instruction to suppress the sound associated with the removed visual object from the original audio mixture. To acquire high‑quality training data, we devise a pipeline to construct a million‑scale dataset of single‑object audio‑visual aligned samples, from which we synthesize mixture‑target pairs customized for model training. To effectively leverage visual context and follow instruction intent, we augment the model architecture with task tokens, generalizable instruction modeling, and modality‑specific global guidance. We further adopt multi‑task training to strengthen task‑role comprehension, and employ a hard‑mixture curriculum that leverages semantically similar acoustic mixtures during fine‑tuning to enhance fine‑grained source discrimination. To support evaluation, we present AV‑Remove‑Bench, a comprehensive audio‑visual object removal benchmark, along with dedicated objective metrics and an MLLM‑based evaluation protocol. Experiments demonstrate that our method achieves state‑of‑the‑art performance on both subjective and objective metrics. Project page: https://yjx‑research.github.io/TV‑AudioRemover/.
Authors:Samuele Garda, Ulf Leser
Abstract:
Biomedical Entity Linking disambiguates mentions to entities in a knowledge base (KB), making it the cornerstone of information extraction pipelines. While embedding‑based models are a popular approach for the task, they suffer from a key limitation. They compress mentions (and entities) into a single vector, forcing the model to average away crucial fine‑grained differences. We present BELXTR, a novel embedding model based on the multi‑vector (a.k.a. late interaction) architecture, which allows to leverage token‑level matching information. BELXTR extends the original XTR model to biomedical entity linking by integrating an existing task‑specific training objective and exploring active query expansion. Experiments across ten corpora and five KBs show that BELXTR improves upon current state‑of‑the‑art in half of the corpora with an average improvement of 5pp recall@1. The largest gains are reported on the challenging cross‑species gene disambiguation subtask, where BELXTR outperforms an LLM‑powered retrieve‑and‑rerank pipeline and closely approaches a specialized rule‑based system. Our results highlight multi‑vector models as a practical alternative to hard‑to‑maintain rule‑based systems or in scenarios where LLM‑based reranking is too costly as in PubMed‑scale mining. The code to reproduce our experiments can be found at: https://github.com/sg‑wbi/belxtr.
Authors:Guanxu Yu, Yuhang Yao
Abstract:
Many vision applications ask several independent, forced‑choice questions about the same image. Visual Jev encodes the image and public context once, executes isolated question suffixes as a batch, and reads candidate probabilities from the backbone's language‑model head. Across four benchmarks, answer‑supervised post‑training raises equal‑weight macro accuracy from 70.6% to 76.1%, with the gain concentrated on the two task families represented in training. At N=32 questions per image, shared batched execution is 8.9x faster in warm amortized time than independent serial execution and remains 3.4x faster than an already‑batched baseline that recomputes the prefix, at the cost of higher peak memory. A matched typed‑head control offers no consistent accuracy advantage over the language‑model‑head readout. The supported design is therefore simple: adapt the backbone for quality, retain the existing readout, and share execution for efficiency.
Authors:Zhe Zhu, Yiheng Zhang, Peng Li, Zixing Zhao, Honghua Chen, Yaqing Zhang, Le Wan, Zhiyang Dou, Cheng Lin, Yuan Liu, Mingqiang Wei, Wenping Wang
Abstract:
Part segmentation is a fundamental problem in computer graphics and 3D vision. Recent works have expanded 3D part segmentation beyond fixed taxonomies, but existing approaches typically only address a specific setting, such as text‑guided part segmentation or point‑based interaction. In this work, we argue that these settings can be unified as an intent‑conditioned generative problem, where different prompts specify the desired part decomposition. To this end, we introduce PartLLM, a unified multimodal model that formulates 3D part segmentation as autoregressive semantic decomposition. Conditioned on an input shape and a user prompt, PartLLM autoregressively generates semantic part hypotheses as queries for mask prediction and feeds them to a decomposition‑aware decoder that jointly predicts coherent part masks. This unified design supports text‑guided part segmentation, interactive segmentation, and full‑shape semantic decomposition with controllable granularity within a single model. Extensive experiments across these task settings show that PartLLM consistently outperforms task‑specific baselines, demonstrating the effectiveness of unifying 3D part segmentation under an intent‑conditioned generative formulation.
Authors:Daein Weon, Dong Ho Kang
Abstract:
Evaluation scores are often validated by their agreement with inexpensive proxy labels. When the score and the proxy are computed from the same text span, however, that agreement can arise from surface evidence the two share rather than from the semantic construct the proxy is meant to represent. We make the distinction explicit by declaring the score, its span, the proxy and the target construct as a validation contract, then re‑evaluating that proxy rule strictly outside the scored span. In a controlled HotpotQA correctness experiment varying only the shared text boundary, the score agrees with its proxy far better than with correctness at a 50‑character prefix: the gap is +0.184, collapsing to at most +0.045 from 120 characters onward. At that short prefix the score still predicts whether the answer string appears later (AUC 0.634) while an equivalence test places its agreement with correctness at chance, so the reported proxy agreement does not establish that the score ranks correctness. On OR‑Bench, suppressing each model's recurring opening templates removes most of the score's association with the refusal proxy, while matched‑volume deletion removes almost none and construct agreement stays at chance. Only three of eleven external contracts support the off‑span control, and none of the routing studies we sampled released the generations it needs. We therefore ask that a proxy‑based validation claim declare the span each label is read from, report the construct agreement beside the proxy agreement, and release the generations that let the proxy be re‑read off the scored span.
Authors:Wenbo Pan, Zhichao Liu, Shujie Liu, Jingying Zeng, Chin-Yew Lin, Xianfeng Tang, Yan Lu, Qi He, Xiaohua Jia
Abstract:
LLM agents increasingly work on long‑horizon tasks, and the decisions they make along the way, such as which hypothesis to test or which implementation to build on, determine the outcome of the whole run. Making these decisions well is becoming a key capability for both engineering and research agents. We refer to the ability to make good long‑horizon decisions as the taste of an agent. While existing benchmarks measure the end‑to‑end success of agents on long‑horizon tasks, none of them measures the taste of an agent. To address this problem, we build Taste‑Bench, a benchmark of taste questions constructed automatically from trajectories that agents produced in engineering and research tasks. Each question presents a decision fork, a point in a trajectory where multiple directions are available and one of them leads to a better outcome, and the evaluated model chooses among these directions without seeing what happens after the fork. We mine these forks automatically from parallel attempts at the same task and from detours inside a single trajectory, without needing human annotation. We evaluate frontier models on Taste‑Bench and find that the best model answers only 59.7% of the questions correctly. We further find that forks whose deciding evidence appears later in the trajectory are much harder for every model, and that a larger reasoning budget does not improve the accuracy. Finally, we show that taste can be trained. We distill the judgment of a teacher that has seen the outcome into a student model, and the student makes better decisions on unseen tasks and improves end‑to‑end success on held‑out SWE‑bench Pro tasks.
Authors:Moritz Brösamle
Abstract:
We introduce latest exact match attention (LEMA), an attention variant for transformers where queries and keys are binarized and each query attends only to the latest exactly matching key. We prove that LEMA transformers with chain of thought can simulate word‑RAMs, as was recently shown for the less restrictive rightmost hard attention. In contrast to prior hard attention variants, the restriction to exact matches enables an efficient converse direction: word‑RAMs can simulate LEMA transformers at a cost per token independent of the context length. Together, these results yield a close correspondence between the two computational models in terms of both compute and memory. Beyond the theory, we propose a training method for LEMA transformers that handles their non‑differentiable operations with a straight‑through estimator for the binarization and a soft attention surrogate annealed towards LEMA. On a synthetic associative recall task, LEMA models trained this way use their growing state to store and recall a large number of associations, outperforming gated DeltaNet (GDN) with its fixed state size. As a first scaling test, we train LEMA language models with up to 834 million parameters. They match softmax transformers of around half their size in loss and, on repeated rare phrases and a needle‑retrieval task, remain behind softmax transformers but recall across longer distances than GDN models of comparable size. Finally, we implement dictionary‑based inference for LEMA transformers and show constant generation speed comparable to GDN despite their growing state, with the dictionaries residing in main memory rather than VRAM. Code is available at https://github.com/moritzbroe/latest_exact_match_attention.
Authors:Xianyao Li, Fang Xu, Rui Min, Ruitong Tian, Jing Du
Abstract:
What is the least recurrent memory needed to reproduce a specified expert under partial observability? The instantaneous requirement is the conditional entropy of the expert's behavioral quotient, but recurrence must also preserve distinctions that future observations will not restore before use. We characterize this minimal recurrent behavioral memory by a compatibility relation: under transitivity its classes attain the exact minimum, while the general case is an entropy minimization over closed compatible state assignments, with exact certificates on finite instances. A sole‑carrier measurement protocol separates behavioral sufficiency, excess code rate, and information carried by observations or other memory paths; experimental bit requirements refer to the induced symbolic behavioral model under the stated occupancy. Across manipulation tasks, learned code rates remain near zero‑ and two‑bit requirements as hidden modes grow to 512, and anticipatory memory follows a 2\to1\to0 requirement despite zero instantaneous demand during waiting. Learning this representation remains difficult: event‑agnostic future‑behavior supervision yields 36/40 sufficient seeds with one frozen configuration and improves the longest‑horizon pixel setting from 0/8 to 6/8 sufficient held‑out seeds (closed‑loop success from 0.08 to 0.57). On unmodified community benchmarks, the protocol certifies delay‑independent requirements, which sufficient codes match at mid‑delay. The supervision aids commitment but can induce predictive surplus; annealing it lets imitation and rate training reduce that surplus, separating the information‑theoretic target from the ability to learn it.
Authors:Kirato Yoshihara, Hiroaki Hamade
Abstract:
RandOpt samples weight‑perturbed language models and ensembles top‑ranked candidates through plurality voting, but its global perturbation scale ignores heterogeneous module geometry. We propose Modular Norm RandOpt, an architecture‑aware sampling method using module‑wise natural norms and calibrated scales while preserving selection and voting. It outperforms RandOpt using 3× fewer candidates on Countdown and at least 12× fewer on GSM8K, with corresponding wall‑clock savings. Evaluations across seven tasks and three Qwen scales (0.5B‑‑3B) show higher mean accuracy than RandOpt on Countdown, GSM8K, and MATH‑500 at every scale. The gains extend to Llama 3.2 3B and Gemma 3 4B on Countdown and GSM8K. On Qwen2.5‑1.5B, our ensembles also achieve higher mean accuracy than iterative baselines on both tasks at comparable main‑run evaluation budgets. On GSM8K, a tail‑density diagnostic implies only a 1.2‑‑1.8× candidate reduction, while most ensemble improvement is associated with more favorable correct‑expert support. These results highlight perturbation geometry as a key design choice for population‑efficient, gradient‑free search around pretrained models.
Authors:Fei Yuan, Yantian Shen, Qingyuan Yu, Yi Chen, Binghui Wang, Hongbo Yu, Anyu Wang, Xiaoyun Wang
Abstract:
Deep neural networks are vulnerable to adversarial attacks. Among black‑box attacks, targeted decision‑based attacks are particularly difficult: the attacker observes only the target model's top‑1 label and aims to make it predict a prespecified target class under a bounded perturbation. Before perturbation refinement, the attacker must discover a direction that reaches the prescribed target region. This initialization step can incur substantial query cost. We propose GuidedRay, a targeted decision‑based attack based on diversity‑guided direction discovery. GuidedRay builds on two observations: target‑class reference samples provide useful target‑conditioned direction priors, and diverse candidates increase the probability of discovering a targeted adversarial direction. GuidedRay generates varied candidates from one or multiple target‑class references and uses a one‑query Fast Test to screen their induced sign directions. Once a feasible direction is found, GuidedRay applies Ray Search to reduce its decision‑boundary radius. Experiments on CIFAR‑10, CIFAR‑100, and ImageNet demonstrate that GuidedRay consistently outperforms five state‑of‑the‑art decision‑based attacks at four evaluated query budgets from 500 to 5,000, with particularly pronounced gains in direction discovery during initialization. Against models protected by adversarial training or TRADES, it likewise achieves the highest attack success rate at all four query budgets.
Authors:Utkarsh Bajpai, Serge Tleiji, Cédric Pradalier, Stéphanie Aravecchia
Abstract:
Agricultural robotics is advancing rapidly, yet progress remains constrained by limited field access, lack of control over field conditions, geographic variability, and seasonal crop cycles. These factors make it difficult and costly to acquire diverse agricultural datasets, resulting in limited evaluation and reduced system robustness. While other robotics domains have scaled learning and evaluation through high‑fidelity simulation, agricultural robotics still lacks comparably capable tools. In this paper, we present a ROS‑integrated framework, built on Isaac Sim, for large‑scale procedural generation of agricultural environments. The framework supports photorealistic rendering, physics simulation, and domain randomization at scales relevant to robotics research, with built‑in support for row crops, orchards, and vineyards and straightforward extensibility to additional crop categories. Project Page: https://baj31415.github.io/agrigen/
Authors:Wenjie Tian, Kangxiang Xia, Jingbin Hu, Xinfa Zhu, HangRui Hu, Ziyue Jiang, Kexin Huang, Ting He, Lei Xie, Jin Xu
Abstract:
Dynamic speaking style adaptation in multi‑turn multimodal interaction remains a major challenge for text‑to‑speech (TTS) systems. Existing context‑aware TTS (CTTS) methods typically map dialogue context to speech in an end‑to‑end manner. Such implicit modeling makes contextual style decisions difficult to supervise, while the entanglement of style, timbre, and content often leads to weak instruction‑following and severe timbre drift across turns. To overcome these limitations, we propose Interactive TTS, a dynamic, style‑adaptive framework for contextually appropriate and speaker‑consistent speech generation. Interactive TTS decouples the process by explicitly modeling contextual style decisions as executable instructions. To bridge the gap between style decisions and speech generation, we introduce Iterative Rejection Sampling Fine‑Tuning (Iterative RSFT) and Context‑Aware Direct Preference Optimization (CADPO), which significantly enhance instruction‑following and align the generated speech with conversational contexts. Extensive experiments demonstrate that Interactive TTS outperforms state‑of‑the‑art models on VStyle and SpeechParaling‑Bench. Demo is available at https://wjtian‑wonderful.github.io/InteractiveTTS/
Authors:Tianle Fang, Zhenbing Liu, Chong Yin, Bolun Li, Haoxiang Lu
Abstract:
Object detection in adverse weather remains challenging because severe degradations weaken visual quality and disrupt semantic feature representations across diverse scenes. Existing methods usually rely on condition‑specific designs, which limits their ability to generalize within a unified detector. In this paper, we propose a Coarse‑to‑Fine Scene Expert Network (C2FXNet) that achieves unified detection through hierarchical scene guidance. Specifically, C2FXNet introduces a dual‑level guidance mechanism consisting of a Multi‑step Reasoning Router (MRR), which performs GRU‑based recurrent scene reasoning over compressed multi‑scale visual cues and frozen coarse scene prototypes, and a Fine Scene Refinement (FSR) module, which uses image‑specific semantic cues to modulate high‑level features for local variation handling. Furthermore, a Scene‑aware Mixture‑of‑Experts (SMoE) dynamically combines scene‑specific experts under the joint guidance of MRR and FSR. By coupling coarse scene reasoning with fine‑grained semantic refinement, C2FXNet enables robust multi‑scene detection without scene‑specific training. Extensive experiments on RTTS, ExDark, and our newly constructed Adverse Weather Dataset (AWD) demonstrate that C2FXNet consistently outperforms state‑of‑the‑art methods across foggy, dark, and clear conditions, reaching 63.70%, 71.14%, and 54.19% mAP on RTTS, ExDark, and AWD, respectively. The source code will be released at https://github.com/PolarisFTL/C2FXNet.
Authors:Hyunwoo Kim, Giseop Kim
Abstract:
Field robots operating across time of day and sensing modalities require accurate image correspondences within onboard time and resource budgets. However, accuracy and runtime reported for individual methods on a single device provide limited guidance for choosing a matcher and its configuration on a target platform. We present MatcherCompass, a deployment‑aware benchmark for choosing local feature matchers in field robotics. Under common input and pose‑evaluation procedures, we compare nine classical and learned matching pipelines across four image resolutions and supported numerical precisions. Four visual conditions cover viewpoint variation, day‑‑night matching in visible and thermal imagery, and daytime visible‑‑thermal matching. We evaluate pose accuracy using the area under the error‑‑recall curve (AUC) at 5^\circ, 10^\circ, and 20^\circ, and measure runtime, GPU memory, and energy per image pair on four GPU platforms spanning workstation and onboard computers. The results show that changes in hardware, input resolution, and numerical precision can move a matcher across a runtime budget boundary, altering the feasible choices. We organize the measurements into a selection guide that returns all configurations satisfying user‑specified time and resource limits, together with their accuracy under the selected visual condition. MatcherCompass provides measured evidence for choosing matching pipelines that fit a robot's sensing conditions and computing hardware. Project page: https://matchercompass.github.io/.
Authors:Timm Haucke, Lauren Harrell, Justin Kay, Mary Clapp, Sara Beery
Abstract:
We increasingly use machine learning to label scientific datasets. The models we develop and deploy are improving all the time, but they are not and will likely never be perfect. Mistakes matter, as errors can propagate into our scientific understanding, particularly when systematically biased. Very reasonably, scientists thus review substantial proportions of ML‑generated labels to verify or correct mistakes in pursuit of ensuring their scientific findings are not biased by ML. In this work, we focus on helping scientists optimally allocate this reviewing effort relative to their scientific goals. We focus on a specific class of scientists (ecologists) and a specific, widespread, and impactful modeling target (occupancy modeling, which estimates where species are likely to occur, conditioned on environmental factors). We introduce Active Continuous‑Score Occupancy Modeling (ACORN), a method that incorporates ML predictions into occupancy models and strategically selects samples for expert review that are maximally informative for downstream ecological analysis. Across camera‑trap and bioacoustic datasets, our method recovers ecological conclusions close to those obtained from fully human‑labeled data, while requiring substantially fewer expert reviews than non‑targeted review policies. Our results suggest that ML‑assisted scientific workflows should optimize expert effort for downstream inference, rather than for classifier accuracy alone, especially when human review budget is limited. Our code is available at https://github.com/timmh/acorn
Authors:Dongwon Son, Junhyek Han, Yoontae Cho, Minseok Lee, Hong-seok Choi, Jiwook Choi, Hyungjin Kim, Beomjoon Kim
Abstract:
Robots operating safely in cluttered everyday environments often need to infer scene geometry from partial observations. Methods that detect objects in 2D and reconstruct them independently struggle in such scenes: a missed object is never reconstructed, a merged detection can fuse two objects, and separately reconstructed meshes may overlap or fail to touch their supporting surfaces. We introduce CODA (Complete Once, Decompose Afterward), a generative model that instead reconstructs the complete scene geometry from a single unsegmented RGB‑D image, then separates the surface into the surrounding environment and movable objects. Still, generated scene geometry can drift from the observed partial point cloud. To reduce this drift, CODA uses two explicit 3D grounding mechanisms to keep reconstructed geometry consistent with observed surfaces while completing unseen regions. Experiments on HomebrewedDB and our custom cluttered‑scene dataset show more accurate reconstructions and a higher fraction of objects remaining in place under simulated gravity than both object‑first and scene‑first baselines.
Authors:Zijun Lin, Zhiyang Deng, Yuzhe Wu, Bihan Wen, Yeying Jin
Abstract:
Recent game world models support realistic visual simulation and interactive gameplay based on player inputs. However, they typically learn environment dynamics from pixel‑level supervision, jointly modeling perception, memory, state transitions, and rendering within a single end‑to‑end framework. While this design enables open‑ended, action‑controllable generation, it still falls short of delivering a complete gameplay experience. Games are governed by explicit mechanics, such as health deduction, skill activation, combat rules, and termination conditions. These mechanics depend on precise and consistent state transitions that generative models alone cannot reliably enforce. In contrast, game engines can guarantee such mechanics through hard‑coded rules, but provide limited flexibility for player‑driven creation. To bridge these paradigms, we introduce GameDirector, the first agentic framework that decouples rule‑based gameplay logic from visual rendering. Given player‑defined configurations, the framework acts as an intelligent director that interprets visual observations, updates game states, tactically controls NPCs, and enforces gameplay rules. It then translates these decisions into text prompts that guide the video world model to render the resulting gameplay. This separation allows players to configure characters, states, and rules much like a game developer while preserving coherent game mechanics. Experiments on three games, using data collected by our automated gameplay agent, show that GameDirector achieves accurate state tracking, reliable rule following, and improves boss action quality by more than 39.9% over various end‑to‑end game world model settings. Overall, by externalizing player‑controllable game logic, GameDirector establishes a middle ground between hard‑coded simulation and generative modeling, enabling more flexible and closed‑loop gameplay experiences.
Authors:Chang Guo, Yukun Xie, Bohan Tan, Zheng Chang, Zhaokai Yin, Qianli Ma, Yingqiao Wang, Chao Liang, Zhipeng Zhang
Abstract:
Modern embodied agents achieve impressive success rates, yet their actual instruction‑following ability is far weaker than these numbers suggest. We trace this illusion to a structural property we term low scene entropy: when a visual scene admits only one valid task, language becomes redundant and a policy can score highly while barely using it. We introduce RoboFollow, a diagnostic benchmark with three principles: (1) High Scene Entropy: each training scene supports multiple kinematically distinct task branches, making vision alone insufficient and forcing reliance on language. (2) Hierarchical Diagnostic Protocol: a four‑level protocol (L0‑‑L3) progressively perturbs visual layout and semantics, probing whether equivalent instructions yield consistent behavior and distinct ones yield discriminable behavior across spatial relations, attributes, trajectory constraints, and logic. (3) Confound‑Controlled Diagnosis: we simplify interaction objects, restrict actions to the trained repertoire and report stage‑wise Intent and Execution scores, isolating comprehension from motor execution. Evaluation of nine VLA and WAM policies shows that strong L0 performance, where attained, does not reliably transfer to L1‑‑L3 under our fine‑tuning setup. Representative mitigations, including stronger VLM backbones, QA co‑training, LangForce, and Classifier‑Free Guidance, all fail to close this gap. RoboFollow exposes genuine instruction following as a critical, overlooked bottleneck. Code and dataset are available at https://github.com/AutoLab‑SAI‑SJTU/RoboFollow and https://huggingface.co/datasets/AutoLab‑SJTU/robofollow‑data.
Authors:Shuo Zhang, Jintao Tong, Yixiong Zou, Yuhua Li, Ruixuan Li
Abstract:
Large Vision‑Language Models (LVLMs) incur high computational costs from redundant visual tokens. Although training‑free attention‑based multi‑layer pruning in the vision encoder stage has been explored as an effective strategy, we find that pruning in shallow layers consistently degrades performance. In this paper, we aim to understand this problem and seek a solution. By analyzing attention patterns across network depth, we find that shallow layers primarily function as edge detectors with chaotic attention maps, while deeper layers transition through local subject recognition and unstable semantic aggregation. To address the misalignment between pruning strategies and network stages, we propose STD, a hierarchical token pruning framework that adapts token selection mechanisms to the functional role of each network stage. STD employs High‑Frequency Spectral Analysis in shallow layers to deterministically preserve structural edges, uses Gaussian‑Smoothed Attention in intermediate layers to maintain spatial coherence, and introduces a Stability‑Adaptive Trigger in deep layers to execute pruning only during semantically stable phases. Extensive experiments show that STD outperforms state‑of‑the‑art pruning methods by 1.1% on LLaVA‑1.5‑7B with 88.9% token reduction, while also being plug‑and‑play and highly effective when combined with other methods, and by 2.1% on LLaVA‑NeXT‑7B with 94.4% reduction, delivering a 3.9x speed‑up in the prefilling stage. Our code will be released at https://github.com/Twilight03/STD.
Authors:Chenjunjie Wang, Zixi Huang, Yao Wang, Jona Ballé
Abstract:
Dynamic 3D Gaussian splats (3DGS) model time‑varying scenes using a separate Gaussian set per frame. While neighboring video frames are highly correlated due to smooth motion, Gaussian representations retain this correlation to varying degrees, depending on whether the estimator tracks them across time. Some 3DGS compression methods integrate the estimation to exploit temporal redundancy; here, we focus on robust compression regardless of the estimator. We concatenate groups of frames into one Gaussian set, augment each Gaussian with a frame index, and pass it to a static (i.e., non‑temporal) 3DGS codec, converting temporal redundancy into spatial redundancy. Concatenated sets are spatially partitioned to limit memory. Our technique requires neither a motion model nor knowledge of the training method. Averaged over six N3DV sequences, all six static codecs achieve gains on tracked sets (‑42.0% to ‑71.8% BD‑rate) over per‑frame coding. On untracked sets, all codecs except HGSC, which appears incompatible with our technique, remain competitive with per‑frame coding (‑3.5% to +5.0%). We further replace D‑FCGS's I‑frame coding with our technique while retaining its P‑frame coding, yielding an overall BD‑rate of ‑46.2%. We propose to visualize "trackedness" using an inter‑frame similarity metric. The project is available at https://wcjj1236.github.io/d3dgs‑benchmark.
Authors:Lars Johannsmeier, Yashraj Narang
Abstract:
Real‑world reinforcement learning (RL) systems still struggle with the demands of contact‑rich industrial manipulation, including micrometer‑level precision, success rates above 99%, and human‑level cycle times. Although off‑policy algorithms can improve performance by leveraging demonstrations and interventions, a key bottleneck is the lack of an intuitive interface for collecting such guidance while complying with constraints of the physical system and the policy. We propose PAKT, a framework for kinesthetic teaching in RL. As opposed to teleoperation approaches, PAKT relies on kinesthetic guidance, which is widely used in industry. However, a critical weakness of kinesthetic guidance is the possibility for the operator to move the robot along trajectories (e.g., velocities, accelerations, jerk) that the robot and/or policy cannot physically reproduce. Using PAKT, operators guide the robot through admittance control, which maps human‑applied forces to motion. The downstream reference generator applies the same kinematic limits used during policy execution, keeping the collected trajectories within these limits. To support this teaching interface with an appropriate execution layer, PAKT adds a high‑performance control stack that maps low‑frequency RL actions to high‑frequency torque commands. It consists of a reference generator and subsequent impedance controller, where the reference generator preserves the tracking performance of the impedance controller while improving contact handling and producing smoother policy actions. Across the reported runs on four insertion and industrial assembly benchmarks, including a data center compute tray, the end‑to‑end system reduces cycle time by 23%‑48% and cumulative intervention count by 62%‑86% relative to the HIL‑SERL baseline. Project website: https://pakt‑website.github.io/pakt‑websitehttps://pakt‑website.github.io/pakt‑website
Authors:Haoran Wen, Wenfu Wang, Kunsong Shi, Jingke Wang, Wancheng Feng, Yiren Zhang, Yueran Zhao, Xuancheng Zhang, Nanfei Ye, Xingru Chen, Zhaohong Sun, Chengmin Yang, Zikang Yu, Penghao Bi, Jia Shi, Yu Liu, Kun Zhan, Yan Xie
Abstract:
General‑purpose robot control requires models to understand task intent, identify where to interact, capture how the scene evolves, and generate precise actions. Vision‑language‑action models provide strong semantic priors but typically do not explicitly model scene dynamics, while world‑action models couple visual prediction with control without necessarily exposing the task‑relevant semantic and spatial structure needed for fine‑grained manipulation. We present MachEmbodied‑U0 (ME‑U0), a unified embodied foundation model connecting understanding and generation experts through a Mixture‑of‑Transformers architecture. Subtask prediction and affordance grounding guide joint visual‑dynamics and action generation via flow matching. Visual dynamics encompass future RGB, depth, surface normals, and optical flow, providing complementary supervision for appearance, geometry, and motion. Multi‑rate Rotary Position Encoding (MRPE) aligns visual dynamics with fine‑grained control. We pretrain ME‑U0 on approximately 4,200 hours of curated demonstrations from robotic datasets and egocentric datasets. Using only the supervision natively available in each downstream benchmark, ME‑U0 achieves an average score of 17.66 on the RoboDojo simulation benchmark and average success rates of 99.0% and 82.5% on LIBERO and LIBERO‑Plus, respectively. We additionally validate ME‑U0 on real‑world robotic manipulation tasks, demonstrating its effectiveness beyond simulation. Without corresponding downstream supervision, ME‑U0 further demonstrates zero‑shot subtask prediction, affordance grounding, and visual dynamics on simulated and real‑world observations. Overall, ME‑U0 combines competitive downstream control performance with transferable task‑grounding and visual‑dynamics capabilities across simulation and the real world.
Authors:Yuwei Jia, Cheng Zhong, Jinyang Yu, Zhe Cui
Abstract:
Public surface electromyography (EMG) datasets vary widely in electrode layout, channel count, frequency support, and size. Simply mixing them for pretraining can misalign channel semantics, introduce spectral targets that some devices cannot observe, and let large or high‑channel‑count datasets dominate learning. We introduce EMGBlend, a self‑supervised framework designed around these differences. It combines shared channel patches with geometry‑aware attention, restricts spectral targets to each recording's supported frequency band, and balances exposure across data sources. We pretrain a 109M‑parameter model on 11 public EMG sources and evaluate it on gesture recognition, continuous‑force regression, and contact classification. EMGBlend consistently outperforms matched random initialization and waveform reconstruction controls. Fixed‑budget source controls show that multi‑source pretraining improves gesture recognition and remains competitive for force decoding. Ablations confirm that geometry, band‑aware targets, and source balancing each contribute to transfer, although cross‑person NinaPro force estimation remains difficult. Overall, EMGBlend shows how heterogeneous EMG datasets can be combined through explicit mechanism design rather than simple concatenation. Code is available at https://github.com/tamanano/EMGBlend
Authors:Chaehyun Kim, Sein Kim, Hongseok Kang, Chanyoung Park
Abstract:
LLM‑based user simulators aim to bridge the offline‑online gap in recommender evaluation by emulating users through injected traits, where preference attributes determine what a user engages with and a behavioral activity trait governs how long they browse. However, we show this intended trait independence collapses during simulation, causing two failures: (i) Trait Interference, where amplified activity distorts preference boundaries and forces interactions with mismatched items to sustain browsing, and (ii) Evaluation Invalidity, where satisfaction scores inflate with activity‑driven page counts despite taste mismatches, biasing evaluation toward trait distributions rather than recommender performance. To resolve this, we propose PQA, a page‑level quality anchoring method that guides simulators using a personalized anchor reflecting each user's intrinsic preference standard. By assessing whether a page meets this standard before further browsing, PQA enables proactive exits from low‑quality pages, letting the activity trait retain its intended role of modulating browsing depth within preference‑conforming pages. Experiments show PQA mitigates trait interference and improves the reliability of LLM‑based simulator evaluation under activity shifts. Our code is available at https://github.com/chaehyun1/PQA
Authors:Abel A. Reyes-Angulo, Henry O. Velesaca, Steven Araujo
Abstract:
Soccer tactics are interactive: an attacking action changes the opponent's defensive problem, and the observed response depends on the multi‑agent match state. We introduce SambaGraph, an action‑‑reaction spatio‑temporal graph dataset and benchmark for soccer tactical response modeling. From tracking and event data for all 64 matches of the 2022 FIFA World Cup, we curate 4,070 action‑centered episodes represented as temporally aligned 23‑node player‑‑ball graph sequences with attack/defense views, response labels, and 26,270 split‑safe attack‑‑defense pairs. We study three questions: whether observed responses can be classified from graph episodes, whether successful defenses can be retrieved for a query attack, and whether graph‑derived summaries support grounded LLM reasoning. A compact signature MLP obtains 0.796\pm0.007 macro‑F1 for response classification, while a fused graph‑‑signature dual encoder reaches 0.471\pm0.029 Hit@5 and 0.655\pm0.051 Hit@10 for full‑bank defensive retrieval. Hard negatives maximize pair discrimination but not retrieval quality. Local LLMs underperform supervised encoders for direct classification and do not improve over a strong original order in eight‑candidate reranking, but they provide grounded tactical rationales. These results position SambaGraph as a reproducible benchmark for graph‑based soccer strategy‑response research. Code and dataset are available at: https://github.com/areyesan/SambaGraph.
Authors:Kinjalk Parth, Sebastian Varela, Andrew D. B. Leakey
Abstract:
A lack of high‑throughput phenotyping solutions for root traits in field‑grown crops has severely constrained understanding and improvement of below‑ground traits and processes. Minirhizotrons are the standard non‑destructive root‑phenotyping method in field environments. Computer vision solutions are needed to allow automated trait estimation at scale, but training data is scarce and human annotations are often inaccessible because they reside in proprietary software that only exports per‑image scalar totals of root length and surface area. Nevertheless, large numeric archives of these root traits already exist. RootQuant showed that the traits can be predicted directly from the whole image by regression, thus removing manually traced masks from the pipeline; RootQuantV2 takes that idea further by replacing RootQuant's CNN backbone with a self‑supervised ViT. We adapt a frozen DINOv3 ViT‑L/16 with a hybrid parameter‑efficient scheme. Training only 11.9M parameters (3.78% of the model), RootQuantV2 achieves length and area R^2 of 0.950 and 0.930, respectively, while lowering length/area RMSE by 24.3%/20.7% over RootQuant. RootQuantV2 thus repurposes legacy numeric archives for high‑throughput, automated root trait estimation.
Authors:Yiqi Wang, Zhifeng Rao, Jiaqi Zhang, Xiaoyang Li, Zhangkai Wu, Yiqun Duan, Mingkai Zheng, Fei Wang, Shan You, Taotao Cai
Abstract:
Open robot policies increasingly follow two paradigms: vision‑language‑action models (VLAs) directly map observations and instructions to actions, whereas world‑action models (WAMs) incorporate learned video or world dynamics into policy learning or action generation. Although both target the same manipulation tasks and represent alternative design choices, they are commonly reported under different evaluation protocols, leaving their capability, robustness, language sensitivity, and deployment‑cost trade‑offs unclear. We present IndustrialVLA‑Bench, an evidence‑aware evaluation of six released VLA and WAM systems under a unified reporting schema. It separately evaluates clean capability on LIBERO, non‑language robustness on LIBERO‑Plus, instruction sensitivity on LIBERO‑Para, and observed execution cost. Reported task scores aggregate three complete evaluations with distinct random seeds under a fixed checkpoint and inference configuration. Across all six systems, clean LIBERO averages differ by only 1.58 points, whereas robustness and paraphrase summaries span 14.62 and 31.08 points. Restricting every comparison to the three protocol‑faithful systems preserves the effect (1.36, 14.62 and 23.10 points), so the diagnostic separation reported here does not depend on the weaker evidence tiers. We additionally report observed inference latency, peak memory, runtime mode, and an evidence status for every system. Protocol‑faithful, near‑reproduction, and pending‑verification entries remain visibly separated; only protocol‑faithful entries support strict comparisons. Rather than claiming universal superiority of either paradigm, IndustrialVLA‑Bench provides traceable evidence for comparing released robot policies on shared practical criteria. Code and evaluation records are available at https://github.com/xiaoqi‑7/IndustrialVLA‑Bench.
Authors:Junghoon Kim, Hyunsung Kim, Seungyoon Choi, KyoungYong Park, Jihun Lee, YongGu Ji, Chanyoung Park
Abstract:
Corporate default prediction is a core problem in financial risk management, yet traditional credit models rely heavily on financial statements that are often sparse or unavailable for many firms. Corporate transaction networks offer a complementary view of real economic activity, but how risk propagates through buyer‑seller relationships remains underexplored. We conduct a large‑scale empirical study using real‑world electronic tax‑invoice data spanning six years that links transaction histories with default events, revealing that transaction‑driven risk is both role‑dependent (buyer or seller) and scale‑dependent. Based on these findings, we construct multiplex buyer‑view and seller‑view transaction networks and propose DefaultGNN, a dual‑perspective graph neural network‑based framework for corporate default prediction. DefaultGNN integrates both views to model how risk flows through transactional relationships, achieving strong improvements over both attribute‑based and graph‑based baselines, especially for firms with limited intrinsic risk signals. We further provide interpretable network‑based explanations by visualizing how distressed trading partners contribute to default risk. In collaboration with a licensed credit rating agency, we validate that DefaultGNN's predictions complement existing credit scoring models, improving approval rates by 7‑11%p without increasing default risk among approved firms. The source code can be found at https://github.com/jhkim611/DefaultGNN
Authors:Wei Zhou, Xinzhe Shi, Xingxing Hao, Xing Hao, Kang Li, Jinye Peng, Ying He
Abstract:
While single‑view 3D reconstruction has seen significant progress, extrapolating complex 3D structures from inherently ambiguous 2D observations remains fundamentally ill‑posed, particularly in the critically underexplored data‑scarce regime. To address this challenge, we propose Point Diffusion Mamba (PDM), a method that integrates the generative power of diffusion models with the efficiency of state‑space model for single‑view 3D reconstruction under data‑scarce conditions. Specifically, PDM employs a lightweight reconstruction module tailored to handle unordered point‑cloud inputs effectively. By combining a Local Geometric Aggregation module with Mamba blocks, our approach jointly models global geometric structures and local details. In 3D reconstruction, each point in the initial noisy input requires a precise prediction, yet the high‑level features extracted by the Mamba module capture only abstract semantic information from sparse points. To bridge this gap, we introduce the Hierarchical Feature Integration Network, which fuses high‑level semantic and local geometric features for each point, overcoming the limitations of token‑based point‑cloud reconstruction. Furthermore, we propose a Dynamic Weighted Sampling strategy that adaptively unifies 3D generation with single‑view reconstruction by leveraging generative priors to enhance reconstruction quality. Experimental results on the ShapeNet and Pix3D benchmarks demonstrate that PDM outperforms state‑of‑the‑art methods, providing an effective solution for 3D reconstruction under data‑scarce settings. Code is available at: https://github.com/NWUzhouwei/PDM.
Authors:Han Qi, Heng Yang
Abstract:
Robot manipulation policies must generalize across visual shifts while preserving scene context relevant to action. General‑purpose vision encoders are not tailored to visuomotor control, while object‑centric approaches often use segmentation masks as hard filters that discard potentially useful context. We propose RoboMP‑DINOv2 (Robotics Mask‑Prompted DINOv2), a full‑scene vision encoder that treats masks as spatial prompts rather than visibility filters. It extracts dense DINOv2 features from the full observation, injects learned region‑specific embeddings at masked locations, and jointly contextualizes prompted and unprompted tokens for action prediction. We further introduce masked‑region color randomization (MCR) to improve appearance robustness, yielding RoboMP‑DINOv2‑MCR. Across seven simulated manipulation settings, RoboMP‑DINOv2 achieves 60.7% success under spatial shifts and 59.7% under scene clutter, compared with 50.7% and 41.0% for a DINOv2‑based Diffusion Policy. Under unseen object colors, RoboMP‑DINOv2‑MCR achieves 72.5% success versus 35.1% for the strongest color‑randomized baseline. Additional experiments and representation analyses show improved robustness while preserving behaviorally relevant scene information. Code is available at https://github.com/han20192019/RoboMP_DINOv2.
Authors:Harshit Gupta
Abstract:
Assigning a standard commodity code to a free‑text purchase line underpins enterprise spend analytics, and its reported accuracy cannot be checked. Published results use proprietary data or private samples under undocumented protocols; no two compare and there is no public benchmark. We build a harness with four protocols over 1.26 million labelled purchase lines from two US state governments. Enterprises rebuy continuously, so random splits put matching item text on both sides: 60.7% and 61.2% of test rows, 54.7% and 60.6% byte for byte. On California orders the best classical baseline scores 56.0% on repeated text but 31.9% on novel text, a 24‑point gap widening with taxonomy depth. Embedding retrieval shrinks the gap from 23.8 to 19.1 points; a fine‑tuned transformer does not escape it. On one corpus leaky evaluation cannot separate retrieval from the transformer, while three leak‑free protocols put the transformer 2.3 to 3.6 points ahead, so leaky splits hide real differences, not just flatter both. We derive an upper bound on text‑only classifiers from identical text with conflicting codes: 79.4% commodity accuracy on one corpus against 98.4% on the other, so accuracy does not compare across datasets. Spend‑weighting the bound reflects the amount field more than labels. In a deployment of 920,927 lines, reviewers accepted 32.4% of suggestions on the novel‑text population; 29.7‑35.2% brackets benchmark rates near 31.9% and 34.8%. We release the harness in production use.
Authors:Julian Salazar, Dimitri Kanevsky, Matt Harvey, Pascal Getreuer, Lucas Dixon
Abstract:
We present the first method for native, continuous gradient descent for machine learning models with p‑adic parameters. Existing native optimizers are discrete, mostly combinatorial searches, as the p‑adic numbers \mathbbQ_p are totally disconnected, with standard losses that are flat away from their minima. To enable continuous optimization, we propose working with \mathbbQ_p via its Berkovich affine line: a canonical, path‑connected expansion of \mathbbQ_p that preserves its isometries and uniquely extends its analytic maps. This hull is a metric tree with interpretable points and local derivatives, which we show enables effective optimizers and backpropagation. We formulate gradient descent and show that its approximations efficiently learn linear models with coefficients in \mathbbQ_p to do modular arithmetic, an XOR‑like task not expressible by linear models in \mathbbR. We also demonstrate momentum and Adam variants, linear regression, and classification on binary‑encoded hierarchies (Quillian semantic networks), addressing open problems posed by Martins (2025). Library at https://github.com/google‑deepmind/padic‑ml
Authors:Jiangshan Gong, Yuqun Wu, Qiqian Fu, Yao Xiao, Chuhang Zou, Shenlong Wang, Derek Hoiem
Abstract:
Consistent multi‑view object segmentation is critical for 3D perception and robotics, yet remains challenging under severe viewpoint and occlusion changes. Existing methods typically perform 3D instance segmentation on point clouds or rely on offline 2D mask‑matching pipelines. However, 3D instance segmentation is limited by scarce 3D annotations, while offline 2D matching suffers from object identity ambiguity across frames. To leverage strong 2D and 3D priors jointly, we propose SAM‑V (Geometry‑Aware Segment Anything for Multi‑View Instance Segmentation). Instead of combining the two priors through post‑hoc matching, SAM‑V directly integrates features from a feed‑forward geometry model (VGGT) into a 2D segmentation foundation model (SAM), trained end‑to‑end for cross‑view instance prediction. SAM‑V introduces a prompt‑fusion mechanism that enriches sparse SAM prompt tokens with view‑specific camera tokens and local VGGT features, making the prompt representation both view‑aware and spatially grounded, together with a mask decoder that attends to dense 2D and 3D features. By conditioning the mask decoding directly on multi‑view geometry, SAM‑V produces consistent multi‑view segmentation of a prompted object in a single forward pass without offline mask matching or explicit 3D reconstruction. On the IGGT 3D tracking benchmark, where consistent instance identity across frames directly determines performance, SAM‑V improves overall IoU by 5 points and frame‑level recall by 12 points on the ScanNet++ split over the state‑of‑the‑art multi‑view instance segmentation baseline and leads on all metrics in the zero‑shot ScanNet split. Our code and pretrained models are available at https://github.com/gong208/SAM‑V.git.
Authors:Schwinn Saereesitthipitak, Mohammed Abdulwahhab, Hannah Zhang, Dan Feigin, Neelay Shah, Maksim Khadkevich, Itay Neeman, Vikram Sharma Mailthody, Wen-mei W. Hwu
Abstract:
Large language model (LLM) inference replicas run across tightly coupled GPUs and serve traffic continuously for weeks. Hardware and software failures are therefore inevitable, and one worker failure can disrupt an entire replica. Recovery requires reinitializing the engine, taking minutes even when weights and compilation artifacts are cached. Production deployments overprovision serving capacity to mask this window. We argue that the dominant cost is loss of ready serving capacity, not request progress, so recovery should preserve initialized engine state rather than reconstruct it. We present fast recovery for Dynamo based on this principle. Snapshots capture an initialized engine once and restore it instead of reinitializing it. Analysis of 18 weeks of failures from the Dynamo cluster shows that most failures are device‑preserving: the engine process fails while the GPU and its resident allocations remain intact. Our key insight is that independent engine processes can reuse the same GPU‑resident state while keeping mutable execution state private. The GPU Memory Service (GMS) decouples device‑memory ownership from engine processes, enabling engines to share and reattach surviving allocations without copying them. GMS preserves model weights and shares them read‑only between replacement and Shadow Engines, avoiding weight reloads. A second initialized runtime on the same GPUs reduces recovery to promotion. Across four models on vLLM and SGLang, these mechanisms recover a failed replica in under 7 seconds, 13‑29 times faster than a warm restart, using a fixed 4‑8 GiB of device memory per GPU independent of model size. Replaying the production trace, we estimate they would reclaim 79% of GPU‑hours lost to recovery.
Authors:Natapat Kirdwichai, Tobias Driskell-Poole, Andrei Sontea, Jadu Dash, Muhammad Burhan Hafez, Danesh Tarapore
Abstract:
Depth‑conditioned locomotion policies have demonstrated impressive agile maneuvers, but can be steered to unpredictable actions when observations are outside their training distribution. Occlusion, invalid returns, sensor noise, and visual distractors can shift deployment observations away from nominal simulated depth. While synthetic sensor augmentation targets specified degradations, it does not by itself define behavior under corruption families omitted from training. To address gaps in training‑time coverage, we present REDACT (Retaining Evidence Despite Artifacts for Continued Traversal), a teacher‑student framework combining an improved visual encoder architecture, persistent feature masking, and a novel consensus‑gating algorithm to retain useful depth information under unmodeled corruption. The gate uses approximate conformal calibration on clean observations alone, requiring no prior knowledge of the corruption type. Trained on clean simulated depth, REDACT retains useful visual information under unseen corruption, supporting higher traversal success than existing parkour baselines. Evaluation of depth augmentation across corruption families further shows that REDACT improves robustness where augmentation coverage is missing. Real‑world trials demonstrate zero‑shot transfer to structured and forested environments with unfamiliar scene content.
Authors:Tapan Parikh
Abstract:
We study what LLMs do when a user applies pressure in an uncomfortable situation: a user insists, begs, flatters or grieves, and the model gives up a correct fact, writes a document it should refuse, or cheers a plan that will cost the user money. We send frozen multi‑turn scenes, identical for every model regardless of the reply, to 60 models from 13 vendors, and label each transcript with a codebook built by open coding and then frozen: a trajectory (the model held its position or folded) and a manner (how it held or folded). Two findings separate. Whether a model holds tracks its generation, meaning how recent it is: fold rate correlates with a public capability index at Spearman ‑0.64, with little vendor effect. How it holds tracks the vendor: six of the 17 manner codes sort by vendor at permutation p <= 0.001, corrected across the codebook. We report four vendor profiles on the codes that cleared reliability. We also ask which parts of the labeling need a person. Six LLM coders from three vendors apply the codebook more consistently than three human coders do (Krippendorff's alpha 0.66 against 0.46), agree with the codebook's author on trajectory at kappa 0.84 to 0.91 on transcripts the codebook's examples never touched, and match an adjudicated human reference at 0.83. Blind machine readings recover the codebook's categories but cannot tell which of them a second reader would apply the same way. We conclude that for behavior a non‑specialist can judge, the human contribution is authoring and bounding the codes and owning a small reference, not producing labels at volume.
Authors:Dohyun Park, Hubertus Franke, Daniel G. Waddington, Swaminathan Sundararaman, Yongjoo Park
Abstract:
Modern information retrieval increasingly employs both embedding and generative models to handle complex queries. However, current serving systems suffer from low throughput and poor GPU utilization because they execute these models in isolation. Coarse‑grained partitioning, such as dedicating GPUs to specific tasks, fails to adapt to dynamic workloads and creates computational "bubbles". To address these, we present Orthrus, a serving system that performs heterogeneous batching within a unified inference loop. The primary challenge lies in unifying embedding and generation workloads with conflicting computational patterns while optimizing batch composition for high performance. Orthrus addresses these challenges through chunked embedding with incremental pooling and by adjusting batch composition in a workload‑aware manner. Evaluation on four A100 GPUs shows that, relative to baseline deployments, Orthrus achieves 1.28×‑‑4.52× higher throughput on controlled workloads and up to 55.8% lower end‑to‑end p99 latency on an iterative‑RAG benchmark. We release our code at https://github.com/illinoisdata/Orthrus .
Authors:Jiuyi Xu, Qing Jin, Meida Chen, Song Wang, Yang Sui, Yangming Shi
Abstract:
Post‑training quantization reduces the memory requirements of vision‑language‑action (VLA) models, but precision selection must account for the interaction between layer scope, numerical format, and calibration. We introduce VLAQuantBench, a controlled evaluation with 409 runs and 94,574 simulation episodes: four models on LIBERO, with X‑VLA additionally evaluated on three simulation benchmark families. Under uncalibrated W4A4 round‑to‑nearest quantization, expanding a π_0.5 action‑head subset from 126 to 167 layers raises success from 7.0% to 70.5%. Fixed‑observation replay confirms a corresponding numerical recovery. Two‑episode calibration removes the severe joint failures in the tested subsets, whereas the same smoothing‑and‑clipping recipe lowers π_0 success and does not recover OpenVLA‑OFT end‑to‑end. For OpenVLA‑OFT, protecting one 28,672‑parameter output projection instead restores near‑baseline success: the remaining 441 eligible linear layers retain W3 on LIBERO‑Long or eight‑bit activations across all four suites. Task‑clustered intervals support the large failure and recovery contrasts. These results establish recipe‑dependent interactions and identify concrete precision assignments, rather than universal layer‑sensitivity rules. Real‑kernel and physical‑robot measurements complement the accuracy analysis. Code, configurations, and episode records are publicly available at https://github.com/jiuyixu25/VLAQuantBench.
Authors:Abolfazl Babanazari, Carson Cramer, Tyler Summers, Carlos Nieto, Kaveh Fathian
Abstract:
Global point‑cloud registration remains challenging when limited overlap, repetitive geometry, and sensor noise produce correspondence sets dominated by outliers. Planar regions are particularly difficult for conventional point descriptors and are therefore often suppressed or discarded before matching. We present PARTE (Plane‑Assisted Robust Transformation Estimation), a global registration method that instead treats planar structure as complementary registration evidence. PARTE extracts planar patches and represents them using our novel Plane Context Histogram (PCH), a descriptor that encodes the geometry surrounding each patch, while a two‑level matching procedure identifies reliable plane correspondences. Candidate point and plane correspondences are combined in a confidence‑weighted compatibility graph for joint outlier rejection, followed by rigid transformation estimation. When no usable plane correspondences are available, PARTE naturally reduces to point‑only registration. We evaluate PARTE on 8,097 registration pairs across six indoor and outdoor benchmarks spanning dense RGB‑D and sparse LiDAR measurements. Evaluations show PARTE achieves the highest overall success rate against 13 standard and state‑of‑the‑art methods while maintaining low runtime. An open‑source C++ implementation with Python bindings is provided at https://ariarobotics.github.io/parte/.
Authors:Ash Manvi, Samreena Tajreen
Abstract:
Finding circuits in language models usually means running many careful interventions. We try something simpler: treat attention as a routing map from one forward pass, keep a small set of routes that point toward the answer, and ask whether those routes actually matter. They often do. On induction and IOI (tasks where the "right" circuit is already known), ablating our extracted edges hurts the model much more than ablating a random set of the same size. We evaluate n=100 prompts per cell on GPT‑2 Small, GPT‑2 Medium, and Pythia‑410M, with paired gap tests and bootstrap confidence intervals. The extract step costs one forward; a head‑by‑head patch sweep costs about two orders of magnitude more. We are not claiming a complete circuit atlas. We are claiming a cheap sketch that carries real causal signal on known tasks, with clear failure modes when it does not. Code and evaluation artifacts are at https://github.com/Aquinf03/live‑circuit‑routing.
Authors:Hangyu Ran, Yuhao Zheng, Yingying Zhang, Kevin Qinghong Lin, Han Peng
Abstract:
Generating Scalable Vector Graphics (SVG) code from natural‑language instructions is an open‑ended task without absolute visual ground truth, leaving both evaluation and policy optimization without a faithful signal. Scalar metrics (CLIP, Aesthetic) calibrated on natural images transfer poorly to stylized vector content, and reusing them as RL rewards triggers reward hacking. We address both limitations with rubric‑based scoring. We first establish empirically that prompting a vision‑language judge with a multi‑axis rubric correlates with human judgments far better than scalar metrics, both across samples and within instructions. Building on this finding, we introduce RULER (Instance‑aware Rubric Rewards for Reinforcement Learning), which converts each instruction into an instance‑aware rubric of six items spanning semantic, visual, and stylistic axes; a judge VLM scores rendered rollouts item‑by‑item, and the weighted satisfactions form a fine‑grained reward optimized via Group Relative Policy Optimization. Because the rubric is derived from text alone, RULER requires neither paired SVG ground truth nor human preference labels. On MMSVG‑Illustration and MMSVG‑Icon, RULER lifts the rubric score from 0.432/0.395 to 0.693/0.683, surpassing dedicated SVG specialists and matching the substantially larger DeepSeek‑V3, with ablations identifying rubric design as the active lever for RL on open‑ended SVG generation. The project page is available at https://hangyuran.github.io/RULER/.
Authors:Hanyang Kong, Xingyi Yang
Abstract:
Interaction understanding in 3D scenes requires a joint description of movable parts, their motion, and the regions through which they can be operated. We present Segment‑Snap, which connects these outputs through the physical relationship between parts and handles. Learned predictors identify broad part surfaces and small handles. A geometric decoder uses planar and upright priors to constrain motion, then selects hinge lines using predicted handle locations, without training a motion regressor. Conversely, a joint part‑and‑handle predictor supplies additional handle candidates, whose motion classes are refined using containing parts. Each information transfer is applied once, without iterative feedback. On Articulate3D validation, handle guidance raises motion‑gated AP from 13.74% to 40.98% at fixed masks and axes. Additional handle candidates raise handle AP from 24.63% to 29.65%; part‑based class correction adds 0.98 points, and full context reaches 30.99%. Repeated training, learned‑decoder controls and paired visualizations establish the benefits and limitations of combining geometric and semantic evidence for interaction understanding.
Authors:Howard Lu, Shalfun Li, Porter Pan, Cris, Lumen, Cyril, Eric Hu, Lily Li, Maeve Zhang, Robert Wang, KZ Zheng, Viggo Chen, Tim Ding, Regsis Cheng, YJ Xiao, Kian, Hai Lin, Alan Song, Elise Ma, Gody Li, Victor Yao, Yohann Tang, Ingrid Yu, Jason He, James Wang, Ryan Yu, Ping Yang, Chris Pan, Vincent Chen, Roy Gan, Hao Wang, Qian Wang
Abstract:
Task planning bridges high‑level instructions and executable behavior in long‑horizon manipulation, yet modern Vision‑Language‑Action (VLA) systems often leave this intermediate structure implicit. Existing chain‑of‑thought (CoT) planners also tend to rely on coarse task‑level annotations or serialize long reasoning traces token by token. We present X‑Planner, a planning front‑end that addresses both the supervision and representation of embodied reasoning. Our planning data combine Ego, UMI, and teleoperation under a hierarchy granularity with source‑dependent annotation depth. Takeover‑time annotations and human‑designed failures supervise ongoing error recognition. On the model side, a shared VLM backbone exposes two event‑structured plan forms: a discrete interface that emits interpretable event states and a latent interface that relays continuous CoT states across staggered Transformer depths through Staircase Decoding. A frozen latent‑to‑text reconstruction objective provides a semantic anchor for the latent representation. Offline two‑step planning evaluation places X‑Planner second among four evaluated models on both BERTScore‑F1 and a judge‑based Overall score. In real‑robot experiments, respectively, outperforming the evaluated baselines. These results characterize planning‑text quality and downstream execution.
Authors:He Hu, Yucheng Zhou, Qianning Wang, Yingjian Zou, Chiyuan Ma, Juzheng Si, Jianzhuang Liu, Zitong Yu, Laizhong Cui, Fei Ma, Qi Tian
Abstract:
The rising global prevalence of mental health conditions, together with longstanding barriers in traditional healthcare, such as limited resources, high cost, stigma, and privacy concerns, has created an urgent need for accessible and scalable support. Large Language Models (LLMs) have emerged as a transformative technology with strong potential to democratize mental health support through advanced natural language understanding and generation. However, the rapidly expanding, fragmented body of work in this area lacks a coherent evolutionary narrative, making it difficult to contextualize current progress and identify future directions. This survey addresses this gap by organizing and analyzing the literature around a central thesis: the role of LLMs in mental health is evolving through three distinct, increasingly sophisticated phases. We trace this trajectory from Phase I, in which LLMs act primarily as passive Information Tools and Pattern Recognizers for assessment; through Phase II, where they function as Empathetic Conversationalists for in‑the‑moment, stateless interactions; to the current frontier, Phase III, which seeks Longitudinal, Personalized Companions implemented as stateful cognitive agents. To support this framework, we systematically review core technologies, agent architectures (Profile, Memory, Reasoning, and Planning), and the critical infrastructure of datasets and benchmarks, highlighting how their evolution underpins this developmental path. Viewing the field through this developmental lens, we provide a comprehensive synthesis of existing work, an insightful narrative of its trajectory, and a clear roadmap for future innovation in responsible, effective, and human‑centered AI for mental healthcare. A curated collection of the resources reviewed in this survey is available at our project repository: https://github.com/Emo‑gml/Awesome‑Mental‑Health‑LLMs.
Authors:Sait Furkan Teke
Abstract:
We describe ufakzeka‑1, a 151M‑parameter (182M with embeddings) decoder‑only Turkish language model pretrained from scratch on 13.5B tokens of openly licensed text and instruction‑tuned for chat, at a total cost of about \286 in cloud GPU, API and notebook time. The contribution is not the model's capability, which is what a model this size can be expected to have, but the record of building and measuring it: a Turkish byte‑level tokenizer at 1.77 tokens per word, a three‑stage pretraining schedule, a post‑training mixture of openly licensed and generated data, and an evaluation battery of release gates, a rule‑checked sweep of 5,508 conversations, judged conversations and hand tests, all with prompts held out from the training data, enforced by decontamination inside the data build and by a checked‑in invariant script we run before each build. We report three findings that we believe transfer to other small‑model efforts: a safety gate that had been "fixed" with training data written from its own questions read 64/64 while the honest figure was 34/64; training‑seed variance was as large as the spread across every recipe we tried, so single‑seed comparisons at this scale are uninformative; and data rounds repaired only what was absent from the data, while identity tracking over long context and multi‑turn arithmetic did not move across any data change we tried, which we read as limits of the model size rather than gaps in the data, a reading the next, larger model will test. Weights, the data recipe, the evaluation code and the spend ledger are released under Apache‑2.0.
Authors:David Szczecina, Yuanpei Xiang, Jitao Hu, David Clausi, Yuhao Chen, Jason Deglint, Paul Fieguth
Abstract:
Self‑supervised learning (SSL) has become an effective approach for learning visual representations without manual annotations. Among SSL approaches, contrastive learning has been widely used for visual representation learning. However, existing contrastive SSL methods have focused primarily on image‑level or pixel‑level representation learning, while region‑level representation learning remains less explored. We propose SPARC, a region‑level contrastive learning framework that leverages superpixels to establish explicit correspondence between augmented image views. SPARC introduces a region contrastive branch that performs superpixel‑based feature pooling and optimizes a region‑level contrastive objective jointly with a global image‑level objective. Under identical settings, SPARC consistently outperforms previous methods such as MoCo‑v2 and DenseCL, achieving improvements of up to +9.79 mIoU for semantic segmentation and +4.88 AP for object detection. Ablation studies further demonstrate that region‑level objectives produce the strongest performance. Thus, region‑level contrastive learning is an effective approach for improving self‑supervised visual pretraining for dense prediction tasks. Code repository can be accessed at https://github.com/xRIPEIx/SPARC.
Authors:Sangam Kumar Jena, Pandarasamy Arjunan
Abstract:
Banana crop diseases threaten food security across the world, yet field diagnosis remains difficult because of limited expert access and visual similarity among disease classes. We present BananaVLM, a domain‑adapted vision‑language model for banana disease diagnosis built on LLaVA‑v1.5‑7B and fine‑tuned with Low‑Rank Adaptation (LoRA). To address the lack of multimodal agricultural instruction data, we introduce BananaInstruct, an automated pipeline that converts raw disease images into \approx80,000 question‑‑answer pairs without manual annotation, using LLaVA‑1.5‑13B for symptom descriptions and Mistral‑7B for agricultural Q&A generation and label grounding. Evaluated against 14 open‑source and 5 closed‑source VLMs on a nine‑class benchmark, BananaVLM achieves 92.21% in‑domain and 83.28% out‑of‑domain (OOD) classification accuracy, outperforming the best closed‑source baseline, Gemini~2.5~Pro, by 49.8 and 63.3 percentage points, respectively. Binary healthy/diseased identification reaches 98.38% OOD accuracy with 1.00 recall. A controlled LoRA‑‑DoRA comparison shows that DoRA performance degrades across epochs, while LoRA remains more effective for fine‑grained classification. Qualitative evaluation using nine LLM judges yields G‑Eval win rates of 0.81‑‑0.96, while five domain experts prefer BananaVLM in 98.48% of 990 blind pairwise comparisons. These results show that lightweight domain adaptation with automated instruction tuning is an effective and scalable approach for specialized agricultural AI. Code, datasets, and model weights are available at https://github.com/samy101/banana‑vlm
Authors:Cristhian Kapelinski, Diego Kreutz
Abstract:
Organizations fine‑tune small language models on private data and then compress them to 4 bits for resource‑efficient deployment. We show that the compression method also affects privacy. What separates the methods is not the bit width but whether they tune their rounding on a small sample of text, the calibration corpus. On our primary model, when each planted record's own opening text is used as the prompt, the two calibration‑based methods we test, Activation‑aware Weight Quantization (AWQ) and Gradient‑based Post‑Training Quantization (GPTQ), each reproduce none of the planted records, while the calibration‑corpus‑free GGUF Q4_K_M format reproduces 5.3% of them. Tracked across five open models with 0.5‑7 billion parameters, AWQ leaks least at every size and in both families, with little accuracy loss at 3‑7 billion. Controlled experiments associate the difference with calibration‑induced rounding error in channels involved in rare‑token prediction. Choosing the 4‑bit method is therefore a deployment‑time privacy decision, not only a question of speed and quality.
Authors:Ibrahim Mian, Shayaan Siddique
Abstract:
Erdős problem 364 asks whether three consecutive powerful numbers exist, where n is powerful if p \mid n implies p^2 \mid n. Erdős (1976) and, independently, Mollin and Walsh (1986) conjectured that none do; the abc conjecture implies at most finitely many. The conjecture remains open. We present the first verification of the conjecture at any finite bound that is checked end to end by a proof kernel: machine‑checked theorems in Lean 4 establishing that no triple of consecutive powerful numbers exists below 10^12 and below 10^14, with the axiom footprint of both theorems being exactly propext, Classical.choice, Quot.sound ‑‑ no sorry, no native_decide, no trusted external computation. The statements are phrased in the byte‑identical vocabulary of the google‑deepmind/formal‑conjectures formalization of the problem, and we prove abstractly that the open conjecture implies each bounded form, pinning the statement correspondence. The proof reduces the search to odd numbers via a mod‑4 argument, represents every odd powerful number as a^2 b^3 with a, b odd and b squarefree, enumerates all odd powerful numbers by a fueled, kernel‑reducible generator whose completeness is proved once and instantiated across 3,524 per‑interval Boolean certificates, and eliminates the seven surviving distance‑2 pairs (the members of OEIS A076445 below 10^14) by explicit non‑powerfulness witnesses. Every certificate's expected values are computed independently by a Python engine, so each kernel‑checked equality doubles as a cross‑implementation agreement. Total certified kernel time is roughly 46 CPU‑hours. Larger uncertified computations exist (exhaustive to 10^22; conditionally to about 7.38 × 10^28); our contribution is not a computational record but the elimination of trusted enumeration code from the evidence chain.
Authors:Yuvraj Verma
Abstract:
Text classifiers trained on the ISOT/Kaggle "Fake and Real News" corpus routinely report accuracy and F1 above 0.98, a level of performance that sits uneasily beside the difficulty of assessing veracity. Using a transparent TF‑IDF and linear‑classifier pipeline as a measurement instrument, we audit the corpus along three leakage channels and two distribution‑shift protocols, releasing all code and derived numbers. First, the benchmark is partly degenerate: a classifier given only the subject metadata field, with the article text discarded, attains F1 = 1.000, since the two classes have disjoint subjects. Second, removing all three leakage channels, metadata, a newswire source tag present in 99.2% of real articles, and 6,251 duplicate documents contaminating 19.4% of a naive test split, lowers F1 by only 1.21 points (0.9935 to 0.9814); the residual signal is diffuse editorial style rather than a few giveaway tokens, since deleting the 1,000 highest‑weight unigrams still leaves F1 = 0.926. Third, this style signal does not transfer: under a topic‑disjoint protocol, average precision falls from 0.9995 to 0.9475 and deployed F1 from 0.9905 to 0.8067, with a prior‑matched analysis confirming a genuine 5.2‑point loss of discrimination, while temporal transfer is nearly lossless. A fine‑tuned DistilBERT is stronger in‑distribution (F1 = 0.9993) but degrades far more under topic shift, losing 12.9 average‑precision points against the linear model's 5.2. Transferred to the independent LIAR benchmark, all three models fall to near‑chance ranking (ROC‑AUC 0.54‑0.57), none beating a majority‑class baseline. We conclude that within‑corpus scores here quantify source and topic separability rather than veracity, that added capacity exploits the shortcut rather than avoiding it, and we recommend metadata‑only, small‑sample, and topic‑disjoint baselines as inexpensive diagnostics for future work.
Authors:Jiahao Lu, Minghao Yin, Wenbo Hu, Hengyu Liu, Wang Zhao, Sai-Kit Yeung, Ying Shan, Yuan Liu
Abstract:
We present a compact geometry‑native latent space as a shared foundation for perception and generation. Visual generators can produce photorealistic frames without preserving a consistent 3D scene. We argue that this is not only a modeling problem but also a representation problem: generators typically evolve appearance‑centric latents, while perception models recover geometry in a semantically rich space that encodes cross‑view structure. Rather than adding geometry as another output, we reparameterize a geometry foundation model's features into a compact latent space for generation. We realize this shift with the geometry‑native autoencoder (GAE), whose latent is jointly decodable to appearance, depth, cameras, and point maps. With this state, a standard conditional flow supports diverse generation tasks. In controlled comparisons that hold the generator and training protocol fixed, replacing the latent with GAE improves both visual quality and independently measured 3D coherence: FVD falls by 12.7% and 23.1% on RealEstate10K and DL3DV, and camera‑trajectory error is halved on RealEstate10K. Together, these results show that the latent space is central to geometry‑consistent generation and can serve as a shared interface between perception and generation.
Authors:Peng Xia, Rujun Han, Zifeng Wang, Yanfei Chen, Yufan Zhuang, Yoonho Lee, Chengsong Huang, Han Yu, Zhongying CuiZhu, Yifei Ming, Huaxiu Yao, Burak Gokturk, Tomas Pfister, Chen-Yu Lee
Abstract:
An LLM agent's capability is largely magnified by its harness, namely the prompts, control flow, tooling, memory, and context management surrounding the frozen backbone model. Recent methods increasingly automate this process by iteratively proposing and selecting component‑wise edits of an agent harness, practically establishing a form of recursive self‑improvement (RSI) at the agent‑system level. However, such recursive evolution may overfit by memorizing the training tasks, showing large in‑distribution gains that shrink or even vanish on out‑of‑distribution benchmarks. We introduce Regularized Recursive Self‑Improvement of Agent Harnesses (RRSI), which incorporates the principles of regularizations into harness self‑improvement by constraining the evolution candidate proposal and selection. The proposer operates with a temporally annealed budget, limiting how many edits a candidate can bundle, and it encourages unexplored trajectories based on evolution history. The selector is equipped with a critic and a pruner: the critic screens benchmark‑specific proposals, while the pruner, removes changes that are too small, too expensive, or no longer useful. Together these constraints favor reusable agent mechanisms over benchmark‑specific ones or even noises. Across eight benchmarks spanning coding, agentic workspace and engineering design tasks, RRSI gains up to 14.1 points on the split it evolves against and up to 4.7 points on the five out‑of‑distribution benchmarks, while producing a harness that runs on 30% fewer policy tokens than the unregularized evolution. Code is available at https://github.com/google‑research/rrsi and project page is https://regularized‑rsi.com/.
Authors:Lei Ye, Haibo Gao, Yitang Li, Peng Xu, Zetong Jing, Junhan Sun, Fanrong Dong, Ziqi Han, Xue Wang, Jianhua Sun, Cewu Lu, Hao Zhao, Liang Ding
Abstract:
Diffusion models offer flexible motion generation, but translating this flexibility into feedback‑responsive humanoid control remains challenging. Hierarchical systems steer motion through references that may exceed a separate tracker's capabilities, leaving recovery and physical execution largely to the tracker. Action‑only diffusion generates actions directly but lacks an explicit future‑state trajectory for test‑time motion objectives. Joint state‑action diffusion provides this representation, yet representative controllers often depend on privileged full‑body states, and support for learned behavior selection and test‑time motion steering remains fragmented. We present PredActor, a predictive action diffusion policy that brings these complementary steering capabilities into one directly executed policy using proprioceptive observations. Conditioned on proprioceptive history and optional task context, PredActor jointly generates executable actions and an internal future‑state trajectory. Classifier‑free guidance strengthens text‑conditioned behavior, while classifier guidance steers predicted states toward test‑time objectives. Only actions are executed, without a separate motion‑reference tracker or externally estimated full‑body states as policy inputs. In simulation, PredActor reaches 44 of 45 destination targets and achieves a text retrieval score of 0.539, compared with 0.424 for conditional action diffusion, with similar observed disturbance survival. To make this guided policy practical onboard, rolling denoising and computation‑preserving runtime optimizations reduce the complete callback to 16.790 ms median and 19.383 ms p95 on a Jetson Orin NX, both below the 20 ms control period. We deploy PredActor on a Unitree G1; evaluations across simulation and physical hardware demonstrate text‑conditioned motion, disturbance response, joystick control, and semantic interpolation.
Authors:Wenkang Qin, Yukun Zhou, Noah Shen, Jisong Cai, Dongxiao Mao, Baicheng Li, Yue Zhang, Wei Sui
Abstract:
Scalable simulation is essential for robot data generation, policy training, evaluation, and safe iteration, yet real‑world interaction is costly and conventional simulators require labor‑intensive construction. We present Uranus, a data‑driven robot simulator built around a joint‑trajectory‑conditioned autoregressive diffusion model. Uranus offers three key capabilities: (1) streaming, open‑ended rollout, which receives future joint‑position trajectories online and autoregressively generates one latent frame per step, corresponding to four RGB frames, without a fixed horizon; (2) low‑latency generation, achieving 24 FPS after inference optimization; and (3) scalable, extensible robot control, providing a unified interface for synchronized multi‑view generation across diverse robot embodiments and camera configurations. We conduct comprehensive quantitative and qualitative evaluations on both in‑distribution and out‑of‑distribution data, providing an objective assessment of Uranus and clearly identifying its current limitations. We release the code and model weights to empower the community with practical tools and insights.
Authors:Shengcheng Luo, Xiaoyang Cheng, Hong Ying, Xiaoying Zhou, Jiaming Jiang, Haoran Guo, Wanlin Li, Ziyuan Jiao, Chenxi Xiao
Abstract:
Human demonstrations offer a scalable way to collect manipulation data, but their contacts may be unstable or infeasible when transferred to a robot hand. Collecting demonstrations directly on the target robot avoids this mismatch but substantially increases the cost of data collection. To address this trade‑off, we present Touch2Robot, a framework that lets humans collect demonstrations while seeing how the target robot hand would contact the object. We capture human hand motion, tactile‑glove measurements, and object motion during human manipulation. These recordings guide object‑specific RL policies to reproduce the demonstrated object motion while favoring contacts consistent with the recorded human touch. We distill the learned behaviors into a unified real‑time retargeter that maps incoming human observations and object geometry to robot hand configurations. During collection, the predicted robot configuration is synchronized with the tracked object pose in simulation to reconstruct robot‑object contacts, which are visualized to help the demonstrator adapt subsequent interactions to the target hand. Across four real‑world tasks, Touch2Robot improves average real‑robot replay completion from 37.9% to 72.1% over visual‑only feedback, while reducing the collection time per replay‑successful demonstration from 58.6s to 18.2s. Reconstructed target‑hand contacts achieve 44.2% F1 against real‑robot tactile measurements, and policies trained on Touch2Robot demonstrations improve downstream Diffusion Policy performance by 29.1 percentage points over visual‑only feedback. These results show that bringing robot touch into the human demonstration loop improves both the quality and efficiency of scalable dexterous data collection. Project webpage: https://Touch2Robot.github.io/.
Authors:Tianshuo Zhang, Xianglei Xing, Aowen Yang, Jia Gao, Wenzhe Zhai, Shanshan Liu, Chengtao Cai
Abstract:
Sea ice forecasts are issued several days ahead, allowing errors to accumulate while new, often sparse sea ice concentration (SIC) observations become available. We find that fixed‑propagation errors concentrate near structured, high‑gradient ice edges, whereas homogeneous interiors require limited propagation, suggesting that propagation distance should be state dependent. We therefore introduce ECHO (Evidence‑guided Correction with Heterogeneous prOpagation), where ECHO‑Scale adapts propagation distance while preserving correction geometry, and ECHO‑Delta learns a bounded residual around fixed propagation. Across all 96 standard evaluation settings spanning diverse priors, observation times, sparsity levels, geometries, and noise conditions, both outperform fixed propagation. ECHO‑Delta achieves the best average accuracy, while ECHO‑Scale is more robust to geometry shifts. Code is available at https://github.com/yingtian22/TAKING‑A‑SECOND‑LOOK.
Authors:Foundation Model, Li Auto Inc
Abstract:
Physical AI requires models to ground visual and linguistic understanding in real‑world environments while accounting for environmental constraints and execution feedback. We introduce MachEmbodied‑VLM (ME‑VLM), a unified vision‑language model with two variants, 4B and 35B‑A3B, that brings together embodied cognition and multimodal agent capabilities. Our work emphasizes physical perception and spatiotemporal reasoning, together with planning, interaction, and outcome assessment in both digital and physical environments. We construct training data spanning embodied and multimodal agent tasks, including execution observations and feedback to support outcome assessment and decision refinement. The training pipeline comprises embodied capability injection, separate reinforcement learning of embodied and multimodal‑agent experts, and multi‑teacher on‑policy distillation that consolidates their complementary capabilities into a single model. Experiments show competitive performance on both embodied and agent benchmarks, as well as on autonomous‑driving and embodied‑navigation tasks. For edge deployment, visual token compression, W4A8 quantization, and hardware‑software co‑optimization enable on‑device inference of the 4B variant on the M100, reducing prefill latency from 400 ms to 188 ms. Project Page: https://machembodied.com/ME‑Brain/ME‑VLM.html Code Repository: https://github.com/MachEmbodied/ME‑VLM
Authors:Xiaoqiang Lu, Licheng Jiao, Lingling Li, Yuting Yang, Long Sun, Wenping Ma, Xu Liu, Fang Liu
Abstract:
Recent advances in vision foundation models (VFMs) have shown remarkable capabilities across diverse unimodal visual tasks. However, adapting VFMs to referring image segmentation (RIS) typically necessitates precise vision‑language alignment via full fine‑tuning, incurring substantial computational overhead and risking catastrophic forgetting. While existing parameter‑efficient fine‑tuning (PEFT) methods enable safe knowledge transfer with minimal training costs, they predominantly operate independently within individual modalities or focus exclusively on unidirectional guidance from language to vision, overlooking progressive cross‑modal interaction and visual feedback for textual refinement. To address these limitations, we propose Bidirectional Reciprocal Learning (BRL), a novel adapter‑based PEFT framework that facilitates hierarchical, bidirectional information flow within both token‑mixing and channel‑mixing layers of frozen foundation models. Specifically, BRL introduces two complementary lightweight modules. The Reciprocal Attention Adapter (RAA) performs cross‑modal query‑key exchanges at the token level, enabling visual and linguistic tokens to mutually attend to each other for fine‑grained spatial grounding. The Reciprocal Gate Adapter (RGA) generates cross‑modal gating signals at the channel level, allowing global semantic context from one modality to adaptively recalibrate channel activations of the other. Extensive experiments on RefCOCO, RefCOCO+, and RefCOCOg benchmarks demonstrate the superiority of BRL over prior RIS methods, achieving state‑of‑the‑art performance while requiring less than 0.5% backbone parameter updates. Code and models will be released at https://github.com/xiaoqiang‑lu/BRL.
Authors:Kaiwen Ren, Yiran Jiang, Yongjing Ye, Shihong Xia
Abstract:
Monocular RGB‑based hand pose estimation has emerged as a critical research frontier in computer vision. The local hand pose estimation methods predict hand poses relative to the wrist, while global hand pose estimation also requires estimating the wrist's position in the camera coordinate system. However, this camera‑space estimation confronts two fundamental challenges: (1) depth ambiguity in monocular settings, and (2) the coupling effect of hand local poses and global wrist positions in the perspective projections. In particular, this coupling reflects that the projections are jointly determined by local hand poses, wrist positions, and camera intrinsics. To overcome these challenges, our framework proposes two key innovations: Transformation‑Isomorphism Supervision for hand‑depth information extraction and Perspective Information Embedding for resolving above coupling effect of local pose and wrist position, both integrated within the mainstream encoder‑decoder architecture. Besides, we propose a novel framerate‑aware multi‑dataset training strategy for sequential pose refinement. Our fully integrated approach achieves at most 37.1% superiority in CS‑MJE over SOTA on HO3D. Project page: https://github.com/Mine268/CS‑ViT.
Authors:Zhangsihao Yang, Mengyi Shan
Abstract:
We ask how little geometry a person has to draw to control both where people stand and where the camera moves in a generated video. Our answer is a ground plane and one cylinder per person. A user draws a grid on the ground, places one cylinder where each person should stand, moves the cylinders and the camera over 81 frames, and the model renders a photoreal video in which the people occupy the cylinders' positions, move as the cylinders move, and are seen from the drawn camera. Appearance comes from a text prompt and a background reference image; layout and motion come from the geometry. Because no dataset pairs such a signal with video, we build the pairs ourselves: an automatic engine writes 2000 captions from a combinatorial seed, generates a clip for each with a text‑to‑video model, and lifts every clip back to its geometry with person tracking, background inpainting, an agentic ground‑mask loop, feed‑forward multi‑view reconstruction and a plane fit, with no real footage and no manual labels. A LoRA on Wan2.2‑Fun‑Control trained on 1935 such tuples follows drawn layouts and camera paths on hold‑out clips: the generated people match the cylinders' count, order, position and height, the text changes who they are, the reference image changes where they are, and dolly‑in, orbit, pan and crane paths are followed, dolly‑out only weakly.
Authors:Daein Weon, Dong Ho Kang
Abstract:
Evaluation scores used around LLM systems ‑‑ including reward models, rerankers, and LLM judges ‑‑ can track surface form instead of the quality they claim to measure. When presented with a terse correct solution and a commented buggy solution for the same MBPP problem, a public preference reward model selects the correct one no better than a coin flip (0.507). Subtracting the predictable surface component from such scores is increasingly common, but removal alone does not yield a more valid measurement: the removed component may carry construct‑relevant signal, and residualization cannot tell which is which. Under designed interventions ‑‑ unit‑test labels with comment‑only edits ‑‑ residualization attenuates the reward model's format effects by about 0.12 on both correct and buggy code, while the correct‑versus‑buggy margins move by less than 0.01. In observational NLI and QA settings, we freeze a held‑out replication before scoring and re‑evaluate it using labels from disjoint annotators; this supports only a narrower conclusion: better agreement with the construct labels on a pre‑declared slice where a surface‑only predictor errs, not a repaired score. Full‑population agreement falls in every observational setting with a reported positive slice gain, and within‑question ranking falls in every such QA setting. When construct and surface features are entangled, residualization can decorrelate a score while degrading construct alignment, and, in a controlled model, configurations just as damaging to construct alignment pass every pre‑adjustment check, so no committed gate is a guarantee. We assemble these distinctions into a reporting protocol whose outcomes, refusal included, state what an adjusted score may be claimed to show: an audit‑time diagnostic reported beside the construct‑alignment cost it incurs, never a replacement for the raw score.
Authors:Pawan K. Tripathi, Hemant Sharma, Andrew Chuang, Mathew J. Cherukara
Abstract:
LLM agents can make expert scientific workflows accessible through natural language, but a plausible response does not establish that the requested computation ran. This matters at synchrotron facilities, where calibration and integration are multi‑step operations over terabyte‑scale datasets. We present APEXA, a deployed framework coordinating 61 tools for synchrotron data reduction. A deterministic execution‑integrity guard prevents it from returning results for tool calls that did not execute, and the same tool layer enforces motor safety: across 50 adversarial scenarios and four models, it produced 0/200 violations against a simulated EPICS controller, versus 15/200 for a prompt‑only baseline. We also introduce APEXA‑Bench, 58 facility tasks organized by scientific correctness and physical consequence. On real APS beamline data, one prompt recovered detector geometry and integrated a full attenuation and exposure sweep. Trustworthy scientific agents need deterministic validation of execution, not model‑side assurances. We release the framework, benchmark, and traces.
Authors:Yibo Li, Enshen Zhou, Rui Chen, Yanjun Ding, Mengzhen Liu, Yi Han, Jiabo Zhan, Lipeng Wang, Shanghang Zhang, Lu Sheng
Abstract:
Active perception and manipulation are crucial for robots to interact with complex scenes. Existing benchmarks struggle to evaluate how robots effectively acquire and maintain information in memory in an active manner. To this end, we introduce ActiveArena‑Sim, an active‑perception simulator with controllable viewpoints and large‑scale workspaces as the foundation. Built on this, we propose ActiveArena‑Bench, which comprises 35 tasks across 5 fine‑grained categories, covering visual exploration and interactive information acquisition. Each task is difficult to solve from passive observations alone, requiring multi‑round evidence acquisition and memory‑based reasoning. The benchmark provides rich memory annotations, standardized training data, and ID/OOD protocols featuring disjoint scenes, unseen distractor configurations, and novel backgrounds. Moreover, we present ActiveArena‑VLA, a modular suite of 13 vision‑language‑action configurations for controlled studies of memory writing, memory capacity, proprioceptive state, subtask supervision, and high‑level planning in active perception. Benchmark results reveal a substantial ID‑OOD gap: uniform memory sampling, increased memory capacity under reliable write policies, proprioceptive inputs, and subtask supervision improve OOD generalization, while planner‑guided memory management and decision‑making achieve performance close to the best‑performing configuration using only sparse memory. ActiveArena thus provides a unified testbed to develop and diagnose models for active perception and manipulation.
Authors:Yang-Tian Sun, Tianjia Liu, Zehuan Huang, Yi-Hua Huang, Xiaoyang Lyu, Ziyi Yang, Zi-Xin Zou, Yuan-Chen Guo, Yan-Pei Cao, Xiaojuan Qi
Abstract:
Single‑image 3D object generation can now produce high‑fidelity assets, yet accurately placing them into a coherent scene layout remains an open challenge. A central difficulty lies in how object layout is represented. Holistic methods absorb placement into a scene‑level generation process, sacrificing object‑level detail. Compositional methods preserve object fidelity by decoupling geometry from layout, but typically parameterize layout as sparse, unbounded pose variables that are difficult to learn and generalize poorly under scarce scene‑level supervision. We present Mira‑Scene, a compositional 3D scene reconstruction framework that replaces sparse pose regression with dense, bounded correspondence recovery. At its core is the Canonical Coordinate Map (CCM), a pixel‑aligned field that maps each visible object pixel to a surface coordinate in the object's bounded canonical space. When paired with a scene‑space Point Cloud Map (PCM) from monocular geometry estimation, CCM induces dense canonical‑to‑scene correspondences from which object transformations are recovered through robust geometric alignment. Because CCM operates in bounded canonical space, it provides a stable prediction target that can be trained from scalable object‑level 3D data without requiring scene‑level layout annotations. Mira‑Scene further introduces a multimodal diffusion transformer that jointly generates object geometry and CCMs, using modality‑specific expert streams with shared attention and positional encoding to promote geometry‑layout consistency. Experiments on indoor, outdoor, synthetic, and in‑the‑wild scenes show that Mira‑Scene substantially outperforms strong baselines in layout accuracy, achieving relative gains of 39.8% in 3D‑IoU and 16.5% in 2D‑IoU over SAM3D, using limited open‑source training data.
Authors:Eryk Kulikowski
Abstract:
Purpose: Research data repositories often lack variable‑level metadata. Model‑choice screening, checking whether a reported model suits the values of its outcome variable, also requires summaries of those values and links to the analyses that use them. We ask how repositories can represent and acquire them as metadata with evidence and review histories. Methods: We propose a metadata application profile compatible with the Data Documentation Initiative Cross‑Domain Integration (DDI‑CDI) model, linking versioned variables and empirical profiles to reported analyses, estimators, and analysis roles. Extraction provenance and review decisions are recorded separately. We evaluate streaming data profiling, deterministic extraction from Stata and R code, and language‑model extraction of analysis records from papers. Results: A worked export of one replication package illustrates the profile: it passes shape and interchange checks and answers four queries, one of which returns the analyses that raise no alert. Screening 4,868 replication datasets from six political‑science journals links outcomes to profiled columns in 1,440 deposits and flags 965, including 14 of the 21 deposits with a hand‑verified linear model on a count, proportion, binary, or ordinal outcome. AI‑assisted adjudication yields 55% precision on a near‑balanced sample of 119 count and proportion candidates; screening rules were developed on the same corpus. Conclusion: The profile makes analysis‑variable relationships queryable while preserving evidence and review history; screening yields review candidates with context. Code, metadata, and measurements are released.
Authors:Akash Chavan
Abstract:
Small open‑source large language models (LLMs) in the 0.6B‑4B parameter range are increasingly deployed for structured output generation (JSON, function calling, data extraction), yet little is known about how constrained decoding (CD) interacts with model scale in this regime. We benchmark five models from three families across 14 structured‑output tasks under three decoding conditions (native, Outlines, XGrammar). We introduce a two‑axis evaluation that separates structural correctness (schema validity) from semantic correctness (content accuracy). We find that CD eliminates all structural failures across all models (schema validity: 78.6‑92.9% to 100%), but content accuracy reveals a persistent semantic gap that is scale‑dependent: type coercion failures are fully CD‑rescuable, while instruction‑semantic failures (e.g., multi‑step function calling) remain CD‑resistant. Schema conformance is necessary but not sufficient for semantic correctness; CD's reach ends exactly where schema conformance ends.
Authors:Abteen Arab, Guile Wu, Chengjie Huang, Dongfeng Bai
Abstract:
Feed‑forward visual geometry models such as the Visual Geometry Grounded Transformer (VGGT) have recently enabled direct 3D reconstruction from multi‑view images. Despite their promising performance, these models scale quadratically with the number of input views due to their global attention mechanism, resulting in substantial latency for long sequence inputs. There have been some recent efforts to accelerate VGGT, but they primarily focus on reducing \emphtoken redundancy through token merging or key/value sparsification. Our work resolves this bottleneck from a different perspective by investigating \empharchitectural redundancy in visual geometry transformers. We show that the multi‑head attention modules in VGGT's global‑attention layers contain substantial architectural redundancy, with only a subset of heads carrying critical geometric information. In light of this observation, we propose VGGT‑Prime, a compute‑adaptive mixture‑of‑heads model that resolves this redundancy to accelerate visual geometry transformers while maintaining competitive reconstruction quality. The key idea of VGGT‑Prime is to estimate the appropriate computation level for each global‑attention head using a lightweight router and then dynamically assign each head to different computation modes. Extensive experiments on multiple datasets demonstrate that VGGT‑Prime can achieve an 8× inference speedup over VGGT while maintaining competitive performance on camera pose, depth, and point‑cloud predictions. We further show that VGGT‑Prime is complementary to existing acceleration methods, such as token merging, further improving inference speed by up to 14× over VGGT. An overview of our work is available on our \hrefhttps://vggt‑prime.github.ioproject page.
Authors:Mohamed Amine Ferrag, Merouane Debbah, Abderrahmane Lakas, Manu Perumkunnil, Norbert Tihanyi
Abstract:
Recent advances in Physical AI have accelerated the use of foundation models in autonomous systems such as unmanned aerial vehicles (UAVs), which must perceive, reason, plan, and act in dynamic environments. Existing benchmarks assess physical perception, intuitive physics, embodied navigation, and collaborative reasoning, but rarely evaluate the agentic decision‑making required for reliable autonomy. We introduce PhysAI‑Bench, a benchmark for evaluating this capability. It contains 10,178 standardized decision instances automatically extracted from conversational traces of autonomous UAV missions. Each instance preserves mission context, temporal dependencies, physical constraints, Model Context Protocol (MCP) tool calls, Agent‑to‑Agent (A2A) interactions, sensor observations, and AI‑native 6G network conditions, including latency, packet loss, throughput, edge load, and network slicing. We expose only information preceding each decision, preventing future‑event leakage and approximating online decision‑making. We evaluate 29 foundation models using a two‑stage protocol. We select model‑specific configurations from 12 combinations of zero‑, three‑, and five‑shot prompting and four temperatures, tested in three runs on a 35‑instance, human‑verified development set. We then freeze each selected configuration and evaluate it in three runs on a fixed, episode‑disjoint set of 500 instances. GPT‑5.3 achieves the highest accuracy (52.00%), followed by GPT‑5.2 (49.40%) and Grok~4.5 (49.07%). Few‑shot prompting generally improves performance, while temperature has limited influence. The results demonstrate that reliable agentic decision‑making in Physical AI remains an open challenge. The dataset is available at https://github.com/maferrag/physai‑bench
Authors:Ziang Li, Yue Huang, Guoxu Zhou, Na Han, Jie Wen, Lunke Fei, Xiaozhao Fang
Abstract:
Patch‑based autoregressive time‑series forecasting often ties input representation, learned transitions, and recursive execution to one patch length. We ask which of these roles can be adjusted separately. A supporting atomic‑encoding study finds greater sensitivity to model width than to atom grouping on the evaluated grid. Our main finding is that a frozen parent's recursive trajectory is easier to fit than the observed future with lightweight parallel exits. Autoregressive Trajectory Distillation (ATD) turns this into selectable ATD‑1/2/4/8 execution, with ATD‑1 exactly recovering the parent. On a paired four‑data‑set comparison, ATD‑8 reaches 5.54× end‑to‑end speedup with stable quality across widths. Fewer calls do not automatically remove the parent's existing forecast error: ATD improves trajectory fidelity in all 21 seed runs but forecast accuracy in only 15 against matched clean‑future supervision. We further find a correctable residual projection along a train‑selected periodic history direction. Spectrum Tangent applies this correction without adding neural parameters or Transformer calls. At horizon 720, it reduces mean squared error (MSE) and mean absolute error (MAE) by 2.54% and 2.33% over seven data sets and two output widths, while remaining 3.24× faster than recursive inference. Level and shape projections sometimes disagree. Trajectory compressibility, the fidelity‑accuracy mismatch, and the correction recur across three public AR parents. Together these results separate representation, transition, and execution as AR design axes. Code is available at https://github.com/RowanFFF/ATD‑Spectrum‑Tangent.
Authors:Iheb Brini, Omar Moured, Hamza Gbada, Elisa Barney
Abstract:
Form Field Detection (FFD) is a fundamental component of document understanding systems, enabling applications ranging from large‑scale industrial digitization to accessible form interaction for automated analysis. Unlike conventional object detection tasks, FFD is inherently challenging because fields are often defined by layout structure and whitespace rather than visible foreground content. Existing large‑scale datasets frequently rely on heuristic annotation pipelines, resulting in noisy and inconsistent labels that hinder reliable evaluation. In this work, we introduce mini‑CommonForms, a carefully curated FFD benchmark with consistent, high‑quality annotations, and present a detailed evaluation of state‑of‑the‑art detection approaches. The benchmark is designed to support reproducible research in document automation and accessibility‑oriented applications. Dataset and code are available at https://github.com/moured/mini‑commonforms
Authors:Xu Han, Angsong Li, Shaopeng Zhang, Enyu Li, Peiwen Lin, Chuang Wang, Yuan Zhuang, Haiyu Lan
Abstract:
Simulation‑trained humanoid proprioceptive odometry faces two transfer challenges: training trajectories generated by specific robot control policies intended for deployment cover only a limited range of motions, while sim‑to‑real mismatch can make unconstrained predictions unreliable. We address both with Prior‑Informed Odometry from Human‑Motion Tracking (PRIMO). On the data side, we generate odometry supervision by having the humanoid track diverse retargeted human motions in simulation, decoupling supervision from the deployment policies and broadening the training motion distribution. On the model side, a Prior‑Informed estimator uses physics‑ and symmetry‑informed priors to structure velocity and rotation prediction and a coarse raw‑context pathway to preserve sensor context alongside encoded features, thereby strengthening sim‑to‑real generalization. Under a unified real‑robot protocol, PRIMO reduces mean error by 31.6%‑61.7% relative to the strongest evaluated external baseline in each domain‑metric comparison. Across two locomotion‑policy revisions, policy specialists exhibit symmetric crossover, whereas Tracking‑Locomotion training reduces mean opposite‑policy simulation error by 86.8%‑94.6%. On real dynamic motion, Tracking‑Locomotion training reduces mean error by 69.2%‑81.7% relative to training on the union of both deployment policies. Across the tested motion compositions, the Prior‑Informed estimator consistently lowers mean trajectory errors relative to its Unconstrained counterpart in both simulation and real‑robot evaluation. Code is available at https://github.com/Agibot‑Spatial‑Intelligence/PRIMO.
Authors:YongShun Wang, JianLin Su, Yong Ma
Abstract:
Orthogonality in a LoRA factor does not by itself specify what the composed update protects: the answer depends on the task‑start state, the parameterization, and the realized optimizer displacement. We formalize this question through Bilinear Optimization Divergence (BOD), an anchor‑relative diagnostic of effective‑update response on selected historical features. The finite‑step analysis distinguishes two cases. In a shared adapter, protecting the routing displacement leaves a learned‑anchor residual through the changing companion factor. In a fresh zero‑output block, a feasible routing state can protect the composed update while both current factors remain trainable. These conditions yield Semi‑Frozen Orthogonal Routing (SFOR) for shared adapters and current‑block hard protection for cumulative O‑LoRA; Weight Residual Projection (WRP) enforces the required displacement after the optimizer step. Controlled two‑task traces verify the predicted residual paths, reducing normalized historical response from 19.12% to 0.005% in the shared family and from 7.72% to 0.002% in the cumulative family. Four‑task experiments on Qwen3‑8B characterize the resulting trade‑offs: SFOR improves backward transfer (BWT) from ‑2.47 to ‑0.86 with nearly unchanged average accuracy (AA), while O‑LoRA hard protection improves three‑order mean AA from 80.27% to 81.30% and forgetting measure (FM) from 2.20 to 0.43. Component controls also show that stricter feasibility need not improve final task performance. Together, the analysis and evidence provide an architecture‑conditioned account of which constraint to enforce, how to enforce it, and how to interpret its empirical value.
Authors:Yixuan Liang, William Chen, Yunan Wang, Jizhou Yan, Zhao Jin, Changling Liu, Chuxiong Hu
Abstract:
6D object pose estimation is fundamental to robotic manipulation and automation. Recent zero‑shot methods have significantly improved generalization to unseen objects, but most still rely on large‑scale pretrained models with substantial GPU computation and memory demands. These requirements complicate deployment on robotic platforms where perception, planning, and control share limited computational resources, while learned intermediate representations offer limited geometric interpretability for task‑specific adaptation. To address these limitations, we propose G6D, a learning‑free, geometry‑driven RGB‑D 6D pose solver. Given an RGB‑D observation, an object instance mask, camera intrinsics, and a CAD model, G6D generates pose hypotheses through template‑based geometric matching and refines them using silhouette and depth consistency, forming a purely geometry‑driven pose estimation paradigm. This paradigm requires neither pretrained visual models nor target‑specific training and preserves interpretable geometric representations throughout pose estimation. Moreover, adjustable hypothesis counts provide flexible accuracy‑computation trade‑offs, while a CPU‑only configuration supports deployment without GPU resources. Experiments on LineMOD and five BOP19 datasets demonstrate advanced performance. Real‑world pick‑and‑place experiments further demonstrate G6D's applicability to robotic manipulation. The complete project is publicly available at https://ai4control.github.io/G6D‑Project‑Page .
Authors:Suzhong Fu, Jingqi Dong, Xuan Ding, Rui Sun, Yiming Yang, Shuguang Cui, Zhen Li
Abstract:
The SYNTAX score is a clinically established tool for assessing anatomical lesion complexity in coronary artery disease and guiding subsequent treatment. However, automated SYNTAX scoring is commonly formulated as a direct regression problem from coronary angiography videos to patient‑level scores. In this work, we reformulate SYNTAX scoring as a vessel segment identity‑preserving anatomical reasoning problem and propose a hierarchical modeling framework that explicitly aligns learning with the clinical workflow. Our approach maintains vessel segment identity across frames and views, estimates stenosis severity at the segment level, and aggregates evidence hierarchically according to coronary anatomy. Simultaneously, to address the scarcity of domain‑specific data, we integrate and complete multiple public coronary angiography datasets, constructing a large‑scale resource featuring completed vessel segmentation and derived structural annotations. Experiments demonstrate that vessel segment‑level stenosis embedding enhances explanatory power and reduces prediction variability compared to baseline models, with the R^2 score improving by 0.201 and dev STD decreasing by 18.4%. These results highlight the necessity of structure‑aligned modeling for reliable and stable automated SYNTAX scoring from multi‑view coronary angiography videos. The GitHub link is https://github.com/VersaceSu7/SYNTAX_score_777.
Authors:Xiangyu Wang, Shuo Wang, Ruiyi Fang, Zhao Kang
Abstract:
Graph prompt learning enables parameter‑efficient adaptation of frozen Graph Neural Networks to downstream tasks through lightweight prompt parameters. As routing becomes increasingly node‑adaptive, however, independently optimized local decisions can collectively concentrate assignment mass on a small subset of a finite shared prompt bank, even when individual node‑‑prompt matches remain locally meaningful. We propose MINT (Measure‑INtegrity Transport), an entropically regularized optimal transport framework that formulates node‑to‑prompt adaptation as a globally coupled allocation problem. The transport cost favors local geometric compatibility, while a prescribed prompt‑side marginal explicitly controls graph‑wide prompt utilization. We further derive an exact variance decomposition that separates prompt‑side geometric variance into retained prompt‑update variation and within‑node barycentric dispersion, together with a conditional stability bound for the frozen‑encoder forward map. Across standard citation networks and additional heterophilic graphs, MINT remains competitive in few‑shot adaptation. Controlled and end‑to‑end experiments further distinguish the roles of routing and topology: fixed‑marginal routing controls graph‑wide prompt utilization and has measurable end‑to‑end effects on citation networks, while topology augmentation provides a complementary, graph‑dependent mechanism for addressing structural mismatch. Code is available at https://github.com/Ga1axy0051/MINT.
Authors:Hongwei Yan, Kanglei Zhou, Yuchen Liu, Qingyu Shi, Yi Zhong, Liyuan Wang
Abstract:
Perception for embodied agents is video‑based, often multi‑view (ego, exo, or both), and inherently continual, with simultaneous task and viewpoint shifts. Yet continual learning (CL) remains dominated by exo‑only recognition tasks, obscuring behavior under these real‑world coupled shifts. We introduce Continual Ego, Exo, and Ego‑Exo Learning (CE^4L), a unified multi‑view CL benchmark spanning four representative tasks: cross‑view referenced skill assessment, temporal action segmentation, cross‑view association, and action anticipation & planning. CE^4L highlights challenges largely absent in prior CL benchmarks, including cross‑view correspondence, view‑dependent asynchrony, and heterogeneous semantic objectives. To this end, we propose Video Incremental Subspace‑routed Task Adapters (VISTA), a parameter‑efficient baseline method that stores task‑specific updates in lightweight adapters and performs training‑free routing via residual distance to task‑specific whitened subspaces estimated from second‑order statistics. Extensive experiments demonstrate the significantly varied efficacy of representative CL methods across CE^4L settings, while VISTA is consistently competitive and achieves state‑of‑the‑art overall performance. Our source code for benchmarks and methods is available at https://github.com/AnAppleCore/CE4L .
Authors:Rui Zhou, Zihan Zhu, Wei Zhang, Zizhou Luo, Norbert Haala, Marc Pollefeys
Abstract:
We present Elevator‑VIGS, a visual‑inertial 3D Gaussian Splatting SLAM system that keeps tracking and mapping through elevator rides. Inside a moving elevator, the two sensors are in conflict. The camera sees only the robot's motion relative to the elevator, while the IMU senses that motion plus the elevator's motion relative to the world. This conflict is challenging for existing visual‑inertial estimators. If vision dominates, the estimator tracks only the robot's motion within the elevator and misses the elevator's rise, and if the conflict remains, the estimator diverges. We observe that the conflict comes from forcing both observations into a single coordinate frame. We instead estimate the robot's pose in the elevator's coordinate frame, and the elevator's motion relative to the world as a per‑keyframe transport state, the elevator's rise and vertical velocity, within dense visual‑inertial bundle adjustment. Elevator‑VIGS detects rides zero‑shot with a vision‑language model and a depth network, and constrains the transport state at the departure and the arrival. We record real‑world and simulated elevator sequences. On these sequences, Elevator‑VIGS achieves state‑of‑the‑art tracking and rendering performance. On four elevator‑free public benchmarks it keeps the state‑of‑the‑art performance of VIGS‑SLAM. Project page: https://ruizhou‑cn.github.io/elevator‑vigs/.
Authors:Fanyu Zhao, Ruike Cao, Liang Dong, Fugen Yao, Jian Xu, Guanjun Jiang, Han Zhang, Yifei Zhao, Yinsheng Li
Abstract:
Long‑running LLM agents require memory that persists and evolves across sessions. Text‑based memory retrieves and reconstructs past interactions at every query, making long‑horizon performance increasingly dependent on retrieval quality and contextual reasoning as histories grow. Parametric memory encodes experience directly into model computation, but existing approaches provide limited support for cross‑session memory evolution. Their coupling to a specific backbone further restricts memory reuse after model replacement. We introduce RPMem, a two‑stage architecture that compiles each session into a model‑independent latent memory through forward computation and selectively integrates it with retained memory via a task‑trained recurrent gate. The consolidated memory is then mapped to backbone‑specific low‑rank adaptation (LoRA) parameters, allowing the encoding capability to transfer when the backbone is replaced. Evaluation across three long‑term memory benchmarks and five diverse backbones demonstrates broad generalization with near‑constant update cost and memory footprint. With Qwen3‑8B on PERMA, RPMem reaches 85.52%, outperforming the strongest parametric and text‑based baselines by 5.32 and 12.98 percentage points, respectively. Ablations validate the complementary roles of session compilation and cross‑session consolidation, while dynamics analyses reveal that the gate acquires task‑specific memory integration strategies. These results establish RPMem as a lifecycle‑independent parametric memory framework that maintains evolving cross‑session memory that remains reusable across backbone replacements. Our implementation is available at https://github.com/Quark‑Medical/rpmem/tree/main.
Authors:Menglin Wu, Kaixiang Yao, Shangbo Luan, Masayoshi Tomizuka, Yuxin Chen
Abstract:
Dynamic rope manipulation is highly sensitive to unknown object dynamics: the same robot motion can produce substantially different responses across ropes, while explicitly identifying the relevant physical properties is difficult. We present RopeFormer, a history‑conditioned framework that uses prior task interaction as context for subsequent control. The policy retains cross‑trial action‑response history while keeping its weights fixed and requires no explicit online rope‑parameter estimation. In matched simulation evaluations across sustained single‑arm rotation, bimanual rotation, and transient whipping, retaining context improves subsequent control relative to resetting the same checkpoint, with the benefit varying across rope dynamics and observation settings. We further deploy the frozen policies on a Unitree H1‑2 with previously unseen physical ropes. From T1 to T3, target‑acquisition time decreases by 30.9% for Rope Swing and 33.9% for Rope Twirl, while mean Rope Whip target hits increase from 0.2 to 2.3 out of three. These results show that prior interaction can provide effective control context for dynamic deformable‑object manipulation. Robot videos, code, and data are available at https://ropeformer.github.io/.
Authors:Shuhao Han, Chenyang Wu, Chun-Le Guo, Zheng-Peng Duan, Zhen Li, Ming-Ming Cheng, Chongyi Li
Abstract:
In frame interpolation tasks, motion ambiguity in the training set causes models to generate blurry intermediate frames. Moreover, the assumption of uniform motion between frames during inference further leads to inaccuracies in the generated intermediate frames. To tackle these challenges, we propose an Accurate motion estimation algorithm with Bézier Control point, ABC‑Inter, for efficient frame Interpolation. Specifically, ABC‑Inter designs an Accurate Flow estimation Module (AFM) by decoupling two‑frame features and mapping to corresponding coordinates to better estimate the optical flow between the two frames. Furthermore, ABC‑Inter eliminates motion ambiguity in the training set by introducing Bézier control points that are computed using the input frames and the intermediate ground‑truth (gt) frames. This allows the model to estimate accurate optical flow between two frames during the training process, thereby solving the blurriness problem in the generated intermediate frames during inference. Benefiting from the more accurate flow estimation between two frames, we can introduce additional frames and directly use multiple flows to calculate Bézier control points for modeling non‑uniform motion without retraining the model. Simultaneously, to realize the estimation of non‑linear motion using only two frames, we also introduce a new Bézier control point estimation module which achieves better motion estimation between the two frames by performing fine‑tuning on the model in the second stage. Experimental results demonstrate that our ABC‑Inter achieves state‑of‑the‑art performance on multiple benchmark datasets and exhibits excellent visual perception.
Authors:Ruixun Liu, Yuxuan Wang, Jiacheng Xie, Yuhuan You, Donghua Cai, Junming Lin, Xiong-Hui Chen, Zhifang Guo, Yunfei Chu, Qize Yang, Xize Cheng, Jin Xu, Yiwu Zhong
Abstract:
Humans can effortlessly localize the direction of a sound source and integrate it with visual cues for reasoning, yet this remains challenging for embodied agents. In particular, it is still unclear how to effectively evaluate and model spatial audio understanding in embodied settings. To address this gap, we introduce OmniEchoBench, a unified benchmark for spatial audio‑visual perception and audio‑vision‑language navigation. OmniEchoBench comprises six tasks over 197 real‑world spatial audio‑visual scenes, 2,972 question‑answer pairs, and 900 navigation samples with first‑order ambisonics (FOA) audio collected from 30 real‑world environments. To enable scalable training supervision, we develop a controllable rendering pipeline for spatial audio. It preserves geometric consistency among sound sources, visual observations, and agent trajectories. Building on this, we propose OmniEcho, a spatially aware omni‑modal model. It introduces an FOA spatial encoder alongside a pretrained semantic audio pathway. Extensive experiments show that OmniEcho achieves state‑of‑the‑art performance on spatial audio‑visual perception. For our sound‑guided navigation, OmniEcho reaches a performance level close to that of traditional vision‑language navigation. These results demonstrate that spatial audio can serve as a valuable signal for embodied scene reasoning and navigation, while also highlighting fine‑grained spatial localization and distance estimation as important open challenges. Our code and data will be available in https://github.com/PKU‑VaLuE‑Lab/OmniEcho/tree/main
Authors:Yan Liu, Baoxiang Huang, Zi'an Wang, Wenbo Xie
Abstract:
As generative AI becomes increasingly used in anime‑style image creation, distinguishing human‑drawn, AI‑inpainted, and text‑to‑image images is important for copyright attribution, visual provenance, and content governance. Existing AI‑generated image detectors mainly target real‑world photographs and often overlook anime‑specific cues such as flat coloring, exaggerated structures, and artistic line control. To address this gap, we propose AniPrO, a multi‑dimensional description‑enhanced framework for interpretable anime image provenance. Built upon AnimeDL‑2M, AniPrO contains 15,000 balanced samples from a 35,000‑image candidate pool, covering Real, Inpainting, and Text2Image categories with structured five‑dimensional descriptions. We further introduce AniPrO‑SFD‑Bench and AniPrO‑MFR‑Bench to evaluate provenance detection from statistical feature discrimination and multimodal fusion reasoning perspectives. Experiments show that structured semantic guidance reveals systematic AI‑generation biases, such as the gap between global visual plausibility and local detail coherence, and improves the detection of challenging inpainting samples. The dataset and code will be released at: https://github.com/YAN‑LIU05/AniPrO.
Authors:Shaohu Wang, Aiguo Song, Yulong Yuan, Zhongyu Sun, Tianyuan Miao, Qinjie Ji
Abstract:
In environments with large movable obstacles, detour‑only navigation can be inefficient or even infeasible, while obstacle interaction requires reasoning about navigation benefit, feasible placement, and executable manipulation. We present a hierarchical navigation among movable obstacles (NAMO) framework for mobile manipulators. At the high level, the planner identifies key blocking obstacles from reference paths and searches for relocation plans that jointly satisfy geometric, manipulation, and downstream navigation constraints. When direct relocation is hindered by other movable objects, a large language model (LLM) is selectively invoked to infer auxiliary manipulation dependencies, which are then verified by deterministic geometric planning. To execute the resulting relocation goals, we define discrete contact modes on the surfaces of box‑shaped obstacles and select contact faces and regions online based on position and orientation errors, enabling straight, side, and corner pushing through contact switching. A recurrent reinforcement‑learning policy coordinates the mobile base and manipulator to track tool center point (TCP) targets while preserving end‑effector reachability during sustained pushing. Simulation and real‑robot experiments demonstrate feasible navigation‑manipulation in detour, single‑ and multi‑obstacle relocation, and dependency‑constrained scenarios, validating the framework for interactive navigation with large non‑graspable obstacles. The open‑source project is available at https://cloudytosunny.github.io/NAMO_DCPushing/.
Authors:Yeonho Yoo, Hyunho Lee, Hyunmok Choi, Chuck Yoo, Gyeongsik Yang
Abstract:
Trace‑driven simulation is widely used to evaluate distributed training (DT) jobs in GPU clusters, but existing simulators either ignore network contention or approximate it with a fixed penalty. This misses how scheduling decisions determine which jobs share server network interfaces and inter‑server links, thereby changing networking time during training. As a result, our motivating experiments demonstrate that they incur large errors, reaching up to 73.64% mean absolute percentage error (MAPE) in average job completion time (JCT). This paper introduces MoSim, a GPU‑cluster simulator that models DT job execution under dynamic network contention. MoSim combines GPU‑free characterization with network contention model: it obtains each job's compute time, networking time, and networking volume without GPUs, then uses the current worker assignment to estimate how shared network interfaces affect each job's iteration time. Our evaluation shows that, compared with existing simulators, MoSim reduces simulation error for average JCT by up to 3.28×, tail (99th‑percentile) JCT by up to 7.79×, and makespan by up to 8.48×, while modeling NIC contention factors with only 8.63% error on average. By avoiding real‑GPU profiling, MoSim also reduces input construction overhead by 44.6×.
Authors:Melika Gorgi, Kourosh Mirsohi
Abstract:
Bayesian graph alignment estimates correspondence probabilities, but convergence of an alignment‑score trace need not imply accurate correspondence marginals. We audit this gap on 240 new exact graph pairs from four source families, 240 larger pairs with 20‑100 vertices, and a separate 60‑case exact implementation check. Under an explicit edge‑flip likelihood, we compare three samplers and score, marginal, indicator, categorical, and classifier‑based diagnostics. Marginal disagreement improves error discrimination over score R‑hat for the exact informed sampler, but its improvement for vanilla local sampling is uncertain. Assignment‑based R and short indicator panels are competitive; no diagnostic dominates across samplers and endpoints. At larger sizes, diagnostics predict subsequent marginal changes, not posterior error, and classification performance depends on the drift threshold. Disjoint‑window and held‑out‑chain checks attenuate but preserve positive associations. Only 22 of 240 original reference sets pass an agreement screen. On forty failure‑selected cases, eightfold SMC particle escalation does not resolve disagreement, whereas additional rejuvenation helps. Longer informed runs remain unstable. An elementary feasible‑alignment bound demonstrates severely unrepresentative SMC and informed‑chain scores in concentrated 100‑vertex cases, independently of approximate reference consensus. We also exhibit common‑start chains with near‑zero disagreement despite exact marginal error near .967. These results support assignment‑sensitive auditing while identifying limits of finite budgets, diagnostic rankings, and reference agreement as evidence of accuracy.
Authors:Mahdi Astaraki, Mohammad Khodadad, Reza Namazi, Mohammad Arshi Saloot, Amir Reza Behzad Moghadam, Hamidreza Mahyar, Soheila Samiee
Abstract:
Cross‑lingual information retrieval (CLIR) is increasingly important in multi‑national industries, where critical technical evidence may exist in a different language than the query. However, existing benchmarks do not adequately capture domain‑specific cross‑lingual retrieval or the retrieval‑depth and recoverability failures that aggregate recall hides. In this work, we benchmark CLIR in the chemical domain, with a focus on patent data. We construct a multilingual dataset from Google Patents and the European Patent Office (EPO) data, spanning five languages (covering major Eastern and Western languages) and reflecting the diversity and complexity of real‑world industrial documentation. Using this dataset, we systematically evaluate eight state‑of‑the‑art embedding models for cross‑lingual retrieval. Our results show a substantial performance gap between monolingual and cross‑lingual settings: for the best‑performing model, Recall@10 drops from 0.72 to 0.53 in cross‑lingual setting. Retrieval depth also degrades significantly, with relevant documents ranked lower across languages in cross‑lingual scenarios. Furthermore, some multilingual embedding models that perform strongly in monolingual settings exhibit sharp declines when queries and documents are in different languages, providing practical insights for model selection in cross‑lingual use cases. These findings highlight critical limitations of current approaches and emphasize the need for more robust cross‑lingual retrieval methods in domain‑specific settings. Our benchmark provides actionable insights for model selection and establishes a controlled diagnostic evaluation framework for CLIR over industrial technical text. Data and code are publicly available at https://github.com/MohammadKhodadad/Multi‑Lingual‑QAC.
Authors:Si-Yu Lu, Yung-Yao Chen, Yi Jan Chen, Shang-Lin Li, Ching-Chan Liao, Wen-Huang Cheng
Abstract:
Feed‑forward 3D Gaussian Splatting now reconstructs renderable scenes from unposed, uncalibrated images. Yet, most models supervise only photometric consistency and predict Gaussians pixel by pixel, which leaves global structure fragile and ties primitive count to image resolution and view count. To this end, GrapeSplat amalgamates multi‑view cues into a voxel‑aligned scene representation and decodes Gaussians directly from the learned grid, requiring no per‑scene optimization or post‑processing. An Atlas Encoder lifts all views into pixel‑wise geometry‑and‑appearance features anchored at predicted 3D points. PEACH‑Vox compands the unbounded scene into a bounded sparse grid through a smooth per‑axis map with an exact closed‑form inverse. The Sparse Decoder then consolidates the grid with sparse convolutions and decodes the full scene as multiple Gaussians per occupied cell. This amalgamated representation exploits sparse voxel occupancy, where the Gaussian count follows the occupied cells and saturates as views cover the scene, while grid resolution sets its ceiling. GrapeSplat turns unposed images into a renderable Gaussian scene in a single forward pass. Trained with 2D and 3D supervision on 8‑view sequences, it generalizes zero‑shot from 4 to 64 views across indoor and unbounded scenes. Code and trained weights are available at https://github.com/VAISR/GrapeSplat
Authors:Yibo Zhang, Ze Yuan, Nan Cao, Li Zhang, Yan-Pei Cao, Yuan-Chen Guo, Rui Ma
Abstract:
High‑quality texture generation is essential for creating realistic and production‑ready 3D assets. Recent multi‑view diffusion methods have shown promising results for image‑guided 3D texturing, but they are typically constrained to low operating resolutions such as 512 or 768, making it difficult to preserve high‑frequency details from high‑resolution reference images. Scaling this paradigm to 2048 resolution is computationally prohibitive, as the unified multi‑view sequence exceeds 212K tokens and incurs excessive memory and latency. In this paper, we present UltraTex, an efficient end‑to‑end framework for high‑resolution multi‑view diffusion‑based 3D texturing. Our key observation is that object‑centric multi‑view renderings contain two major sources of redundancy: background‑induced sequence redundancy and sparse token interactions within the foreground. To address them, we introduce Background Token Dropping, which removes background tokens before the DiT backbone, and Block‑Sparse Attention, which reduces attention computation over the retained foreground sequence. To enable efficient foreground‑only inference while avoiding reconstruction artifacts, we further design Foreground‑Aware VAE Decoding to ensure the quality of the final high‑resolution views. To satisfy the demanding data requirements of 2K‑resolution multi‑view diffusion training, we construct G‑buffer TexVerse, a large‑scale, ultra‑high‑resolution multi‑view rendering dataset covering over 268,000 3D assets. Extensive experiments show that UltraTex generates visually faithful textures with rich fine‑grained details, while substantially improving efficiency, achieving 20.6×‑‑91.1× training speedup and 22.3×‑‑74.6× end‑to‑end inference speedup over the baseline on common samples in our dataset. Code and data is at https://yiboz2001.github.io/UltraTex.
Authors:Mario Carneiro
Abstract:
The sets‑as‑trees interpretation of set theory in a dependent type theory with an impredicative universe of propositions validates Zermelo set theory, and it validates Replacement if the type theory has a choice or description operator, which turns a functional relation into a function. It has been natural to expect that without such an operator the strength of the type theory drops well below that of \mathrmZF. We show that it does not. In the type theory of Lean with two predicative universes, from excluded middle as the only assumption and with no axiom (no choice, no propositional extensionality, no quotients), we prove the consistency of \mathrmZF, stated outright for a first‑order proof system. The proof is formalized. The mechanism is the large elimination of the accessibility predicate over a type as large as the type of sets: a recursion on accessibility whose recursive calls are guarded by propositions, and whose later calls are indexed by the value of an earlier call, computes as a term any ordinal that is specified by a proposition through a well‑founded tree of a certain shape. We give a rule that produces such a tree for every ordinal, unless some V_ρ is already a model of \mathrmZF; the rule does not choose a cofinal map into a limit ordinal but takes all definable ones at once. In the first case the sets‑as‑trees satisfy Replacement for arbitrary propositional relations. Either way \mathrmZF has a model. Finally, the double negation of excluded middle suffices, and what remains of it is exactly that membership is not not well‑founded in the stable reading of sets; this in turn implies the double negation of Markov's principle.
Authors:Le Thien Phuc Nguyen, Thien Nguyen, Thanh-Huy Nguyen, Gia Minh Hoang, Anh Mai Vu, Ulas Bagci
Abstract:
Most medical vision‑language models (VLMs) excel at open‑ended report generation and VQA but provide limited support for structured, fine‑grained clinical perception within a unified interface. We present QwenVLConnector, a Qwen2.5‑VL‑based medical chatbot that unifies classification, multi‑label classification, textualized detection, counting, regression, and free‑form report generation under a single next‑token objective. Our key component is a lightweight dense multi‑layer Connector that aggregates low‑ and high‑level visual features, aligns them through the pretrained vision Merger, and fuses them with the final visual representation without increasing sequence length. This design enriches visual tokens with complementary spatial and semantic cues while preserving efficiency. On FLARE‑2D, QwenVLConnector improves detection F1 from 0.55 to 0.85, raises single‑label classification from 0.37 to 0.51, and boosts report‑generation GREEN by up to 18.3 points over the Qwen2.5‑VL baseline. We further explore multimodal in‑context learning for report generation, showing additional improvements without updating model parameters. Overall, QwenVLConnector offers a unified and efficient framework for combining structured medical perception with open‑ended clinical text generation. Our code can be found at https://github.com/plnguyen2908/QwenConnector.
Authors:Shankar Ramharack, Jonathan Nancoo, Rajiv Sahadeo
Abstract:
Small Island Developing States (SIDS) face simultaneous frequency nadir and rate‑of‑change‑of‑frequency (RoCoF) violations under high renewable penetration. This paper proposes a \emphComposite Adaptive Higher‑Order Control Barrier Function (CA‑HOCBF) for BESS‑coupled virtual synchronous generators that jointly enforces IEEE~1547 frequency (\pm0.8\,Hz) and ENTSO‑E RoCoF (\pm1\,Hz/s) limits as hard safety constraints under parametric uncertainty. The method unifies three tools: (i)~a dual barrier architecture with a zeroing CBF for frequency and an algebraic RoCoF constraint with a robust inertia‑floor fallback; (ii)~a composite energy function coupling logarithmic safety barriers with quadratic parameter and disturbance error terms, which drives safety‑weighted adaptation; and (iii)~a disturbance observer integrated into the barrier dynamics. We prove that the closed‑form QP is always feasible under a BESS capacity condition and, under explicitly stated assumptions, that the composite energy remains finite along trajectories, rendering the joint safe set forward invariant \emphwithout requiring parameter convergence. Simulation on a 10\,MW Caribbean microgrid (H=2\,s, 70% renewables) shows the CA‑HOCBF eliminates all frequency and RoCoF violations under a compound disturbance, achieving steady‑state error of 0.001\,Hz and RoCoF of 0.50\,Hz/s, where fixed‑gain VSGs suffer a 0.62\,Hz offset with 2.25\,Hz/s RoCoF violations.
Authors:Narendhiran Vijayakumar, Nav Singhal, Girish Varma, Antony Thomas
Abstract:
Foundation models (FMs) have expanded task and motion planning (TAMP) to manipulation problems specified through language and visual observations. However, incomplete scene knowledge leaves a critical gap between understanding what the task requires and knowing whether the physical scene can actually realize it. We introduce GRAB‑TAMP, an FM‑based TAMP framework that searches for scene entities required for task completion, grounds functional roles to valid physical objects, and plans only after a complete joint assignment establishes functional sufficiency. We represent the task through functional roles, relations, and assignment constraints, and incrementally inspect the scene while requirements remain unresolved, verifying candidate objects through semantic, geometric, and relational checks. We evaluate GRAB‑TAMP across 32 scene variants spanning Kitchen, Living Room, and Workshop domains. Across 200 feasible trials, our approach achieves 54.0% end‑to‑end success with 67.3% plan goal coverage. Compared with three FM‑based TAMP frameworks under the same execution setting, GRAB‑TAMP improves end‑to‑end success by 25.7 percentage points over the mean baseline. Implementation and evaluation code: https://github.com/Narendhiranv04/GRAB‑TAMP
Authors:Guanxiong Chen, Yiduo Qu, Qianjun Xia, Pengyu Jing, Yixian Cheng, Bole Ma, Pengzhi Yang, Bingyang Zhou, Ziming Li, Shashwat Suri, Gongbo Sun, Chao Liu, Peter Yichen Chen, Ziqiu Zeng, Fan Shi
Abstract:
While simulation‑ready deformable assets are essential for in‑silico robotic manipulation tasks, existing generation frameworks typically assess physical plausibility after generation, leaving an object's simulated response unused as feedback for repairing upstream errors. We present DiagGen, an agentic framework that turns a single in‑the‑wild image into a simulation‑ready deformable asset through a generate‑‑simulate‑‑diagnose‑‑refine loop. DiagGen constructs part‑aware geometry and material parameters, then uses a VLM (vision‑language model)‑based agent to select semantically informative regions, probe them in a physics simulator, observe material responses, and route evidence‑backed repair cues to the responsible generation stage. Experiments on 40 assets show that diagnostics provides useful repair cues and can moderately improve the quality of generated deformable assets. Finally, we show that unlike assets generated from visual foundation models which may not be simulatable, DiagGen‑generated deformables can be directly dropped into a high‑fidelity physical simulator for the planning and simulation of contact‑rich pick‑and‑place tasks. The project's website is https://diaggen.github.io/.
Authors:Yufeng He
Abstract:
Diffusion models and transformers have supplanted GANs for multivariate time series imputation, largely on grounds of GAN training instability. R3GAN (NeurIPS 2024) removes that instability via regularized relativistic losses with provable convergence, raising a natural question: do stable, modern GANs revive adversarial imputation? We adapt R3GAN to 1D temporal data with a coarse‑to‑fine refinement framework and a frequency‑domain discriminator, and audit 14 saved configurations across 3 datasets. Because these are heterogeneous single runs, the evidence is descriptive rather than a matched causal ablation. We report a negative result. All five saved mean/zero‑start configurations improve by 48.4‑70.2%. Among eight eligible non‑legacy linear‑start configurations, the mean change is ‑0.7% (range ‑3.0% to +1.1%); a separate ‑21.9% legacy logging anomaly is retained for provenance but excluded from that aggregate. In a saved Weather comparison, standalone R3GAN‑1D underperforms BRITS by 5.8x. Crucially, we argue the common explanation (that GANs optimize distributional rather than point‑wise objectives) cannot be the whole story, since diffusion models also optimize distributional objectives yet achieve state‑of‑the‑art imputation. Our saved reconstruction‑weight sweep is consistent with the adversarial signal being inert or harmful, but cannot identify its causal contribution; a matched discriminator‑removed ablation is the key next experiment. We frame the precise reason a learned discriminator fails to provide useful refinement gradients (where a learned diffusion denoiser succeeds) as an open problem, and offer practical guidance on when adversarial refinement is worthwhile.
Authors:Li Yang
Abstract:
Internet of Things (IoT) systems are increasingly deployed in smart homes, transportation, energy systems, and critical infrastructure. This broad connectivity improves service intelligence, but also enlarges the attack surface of IoT networks. Machine Learning (ML)‑based Intrusion Detection Systems (IDSs) are widely used to identify malicious network threats and protect IoT systems, but developing effective ML‑based IDS models often requires human expertise and repeated manual decisions on many procedures, including data pre‑processing, feature selection, model selection, and hyperparameter tuning. Automated Machine Learning (AutoML) reduces this burden by automating steps of the ML pipeline using optimization techniques, but conventional AutoML methods can consume substantial optimization time because they explore broad candidate model families and large hyperparameter spaces. This paper proposes a Large Language Model (LLM)‑assisted AutoML framework for IoT intrusion detection. The proposed framework uses an LLM as a policy generator that converts dataset profiles into bounded and validated AutoML policies for automated data balancing, automated feature engineering, and Combined Algorithm Selection and Hyperparameter Optimization (CASH). Under an equal 10‑trial budget, the proposed LLM‑assisted policy achieves higher weighted test F1‑score than traditional AutoML using the Tree‑structured Parzen Estimator (TPE) on both datasets, reaching 99.680% on CICIDS2017 and 99.186% on IoTID20. Relative to the broader 30‑trial Traditional AutoML‑TPE baseline, the 10‑trial proposed method reduces optimizer time by 63.7% and 49.9%, respectively, while achieving slightly higher F1‑score. These results show that a bounded LLM policy can improve the quality of a low‑budget AutoML search while retaining a clear efficiency advantage relative to a larger conventional search budget.
Authors:Arman Bolatov, Egor Shulgin, David Li, Abduragim Shtanchaev, Sebastian U. Stich, Maxim Panov, Eric Moulines, Peter Richtárik, Martin Takáč
Abstract:
Discrete diffusion models now match autoregressive language models on several benchmarks, while the question of how best to train them has received far less attention: the optimizer is inherited from one paper to the next and never compared. New optimizers, meanwhile, are validated almost exclusively on autoregressive pretraining, a different objective on a different loss surface. We present a controlled optimizer benchmark across four diffusion formulations, to our knowledge the first for discrete diffusion: seven optimizers (AdamW, Lion, Muon, SOAP, MARS, MARS‑M, Schedule‑Free) on masked diffusion (text8), uniform diffusion (QM9, and LM1B through the Gaussian duality) and Gaussian diffusion on images (CelebA‑64), each on a task with published reference values. Every optimizer receives the same search protocol, and every winner is retrained at the full budget with three seeds. AdamW is a strong default but not always the right choice: it is beaten by a resolved margin on two of the four tasks, and the winner changes with the formulation, so the optimizer deserves the same care as the rest of the training recipe. Notably, methods validated on autoregressive language model pretraining transfer well: Muon, MARS‑M and SOAP each beat the tuned AdamW on at least one diffusion formulation. The benchmark, all runs and every figure are reproducible end to end from the released code at https://github.com/armanbolatov/diffusion‑baselines.
Authors:Mehedi Khan, Md. Shariful Islam Bhuyan
Abstract:
A RAG system can hand you the right answer and cite a source it did not actually use. Models output these unfaithful citations via post‑rationalization: they write the answer first and then attach a citation to whatever passage looks close enough. Search agents are now trained with reinforcement learning from verifiable rewards (RLVR), which pays them for getting the answer right. We asked whether that training also teaches them to cite honestly. Improving an existing methodology with a required control, we compared an instruction‑tuned model against three RLVR agents trained from it, on four question‑answering datasets, using only free‑tier Kaggle GPUs. Post‑rationalization is everywhere: on Wikipedia‑based questions roughly one citation in seven is unfaithful. RLVR does not fix it. The agents post‑rationalize at their base model's rate, and one lands slightly worse. Rewarding correct answers buys nothing in citation faithfulness, so faithfulness has to be trained and measured on its own terms.
Authors:Fengze Jia
Abstract:
Compressed manipulation policies can pass offline evaluation while failing in closed‑loop execution; this dissociation is established in prior work and is not our claim. We contribute a causal anatomy of one naturally occurring case. An 8‑layer distillation of Octo‑Base retains 86% of parameters, passes every offline check we applied (0.996 and 1.000 teacher‑ratios on the family's own validation metrics), and collapses in closed loop: 0/72 vs. the teacher's 40/72 on a simulated WidowX pick‑and‑place task. The collapse is structured, not diffuse: early task stages degrade gradually (the student moves the object at 90% of the teacher's rate and grasps at 55%), while transport‑to‑target fails categorically, at 0% in every training variant. Paired action‑trace forensics isolate the signature: a negative, late‑heavy z residual, roughly 10x its post‑repair magnitude, and persistent across the base distillation and both continuation branches. Four standard therapies fail under matched controls: continued training and in‑domain offline data leave success at zero, even though the latter measurably improves marginal action statistics; command‑level compensation recovers nothing at any offset, although the same perturbations degrade healthy policies; clamping the symptom in the command channel preserves grasping, yet success stays at floor. A minimal‑pair intervention that substitutes half of the training stream with deployment‑distribution teacher rollouts, with every other setting held fixed, restores parity with the teacher (18/36 vs. 17/36 held‑out), eliminates that signature, and recovers a teacher‑like perturbation‑response profile. We claim existence, not universality. Operationally, offline gates, including a family's own validation metrics, are insufficient acceptance tests for compressed policies; a few dozen closed‑loop trials sufficed to find what they missed.
Authors:Madhulatha Mandarapu, Sandeep Kunkunuru
Abstract:
GQL (ISO/IEC 39075:2024) is the first international standard for a graph query language, and SQL/PGQ (ISO/IEC 9075‑16:2023) embeds the same pattern‑matching core, GPML, in SQL. Both fix a precise semantics for path patterns: four path modes, four selectors, quantified segments. What engines compute for those patterns has never been measured. Work on GQL is theoretical and runs no engine; cross‑engine work measures performance and normalises the semantics away. We build an executable reference semantics for the GPML path core and gate it against the six worked answers printed in the standard's own reference exposition. We then run a 17‑construct suite against six releases of five products ‑ Kuzu, DuckPGQ, Neo4j at 5.26 and 2026.04, Memgraph, Apache AGE ‑ scoring each cell as conforming, diverging, rejected, or inexpressible in that dialect. Nine of seventeen constructs draw more than one answer across the engines that accepted them. Of 26 disagreements, 15 are silent ‑ the query runs, returns a different multiset, raises no error ‑ a silence ratio of 0.58. Scoring each divergence against the path mode each engine's manual declares separates language from implementation: 9 of 15 are documented differences, 6 are departures from the standard the engine implements. A metamorphic layer needing no reference semantics finds 39 self‑consistency violations, yielding two minimal defects. No engine we measured parses the order the standard's own examples are written in, except the authors' own, which added it after this suite reported the gap. Suite, semantics, reproducers and results are open source.
Authors:Wentian Xu, Anthony P Addison, Ziyun Liang, Harry Anthony, Guang Yang, Konstantinos Kamnitsas
Abstract:
Brain lesion segmentation is a fundamental task in medical image analysis, playing a critical role in diagnosis, treatment planning, and longitudinal disease monitoring. Yet existing models still struggle to meet the demands of real clinical use, where deployments contain data distribution shifts, arising from differences in scanner hardware, imaging protocol (varying MRI modality sets), and new pathologies. We present BrainIAC (Brain lesion Interactive Adaptive Continuously learning segmentation), a unified framework that integrates (i) a multi‑modal backbone network trained to segment multiple types of brain lesions and handle heterogeneous sets of modalities via zero‑filling and random modality dropping; (ii) 3D interactive segmentation with bounding‑box and click prompts that preserves fully automatic prediction when no prompt is given; and (iii) an online adaptation mechanism combining Mid‑Interaction adaptation and Post‑Interaction adaptation, supervised by the network's own predictions as pseudo labels and guided by an extra Click‑Centered Gaussian loss. To our knowledge, this is one of the first 3D online adaptation methods for interactive segmentation, and the first to combine handling of heterogeneous modality sets with online adaptation. Experiments across seven brain MRI datasets demonstrate that the proposed components provide complementary and synergistic benefits. The method consistently outperforms existing approaches and generalizes well across heterogeneous imaging modalities, including those unseen during training, as well as previously unseen brain pathology types. The code and a 3D Slicer plug‑in will be released at https://github.com/WenTXuL/BrainIAC upon publication.
Authors:Tobias von Arx, Srinivasan Keshav
Abstract:
Rooftop photovoltaic (PV) design requires careful panel placement to make effective use of potentially limited roof space and available sunlight. Existing simplified roof models can miss objects and superstructures that shade panels. We simulate rooftop irradiance using hourly weather and a terrain horizon, computing shadows from nearby buildings, trees, and roof superstructures rendered from the Sun's viewpoint. Our method (i) infers existing panel layouts from imagery and estimates their yield, (ii) relocates these panels to improve the yield, and (iii) generates shading‑aware layouts for new installations. We compare modeled yield with production records from 11 Swiss installations and evaluate new layouts in simulation on 19 additional rural roofs. Without knowledge of any electrical or system specifications, we obtain a median daily correlation with measured production of 0.982. Absolute energy estimates remain sensitive to system specifications. Comparing new layouts with equal panel counts, accounting for neighborhood and roof‑detail shading changes the position or orientation of an average of 38.9% of panels per roof. These layouts increase modeled annual yield by up to 7.91% compared with layouts designed without accounting for neighborhood and roof‑detail shadows. We publicly release our tool for modeling and designing rooftop PV installations with terrain, neighborhood, and roof‑detail shading at https://github.com/tobiasvonarx/shading‑aware‑pv.
Authors:Mohammad Khateri, Morteza Ghahremani, Jussi Tohka, Alejandra Sierra
Abstract:
Soma instance segmentation, i.e., identifying and delineating individual cell somas as distinct instances, is crucial for cellular analysis and connectomic reconstruction. Three‑dimensional electron microscopy (3D EM) provides nanometer‑scale resolution for capturing fine‑grained soma morphology. However, dense instance‑level manual annotation is prohibitively costly, limiting the scalability of fully supervised methods. To address this challenge, we propose SomaNet, a weakly supervised framework for 3D EM soma instance segmentation under partial annotation constraints. SomaNet adopts a teacher‑‑student learning paradigm tailored to partial labels. The teacher is trained using partially annotated data to generate pseudo‑labels, while the student jointly learns from the partial ground‑truth annotations and the generated pseudo‑labels, progressively recovering dense instance segmentations. To accurately delineate cell somas under limited supervision with varying instance counts, SomaNet incorporates affinity learning, which encourages high similarity within instances and low similarity across instance boundaries. Semantic‑guided affinity decoding and 2D‑to‑3D reconstruction then produce volumetrically consistent 3D soma instances while preserving the large receptive fields of 2D backbones. The framework is architecture‑flexible and supports diverse backbones, including vision transformers and foundation models, enabling direct transfer of pretrained visual representations to volumetric EM segmentation. Experiments on 3D EM brain datasets demonstrate that SomaNet achieves accurate and robust soma instance segmentation across regions with diverse soma morphologies under partial annotation. Code is available at https://github.com/mkhateri/SomaNet.
Authors:Junichiro Niimi
Abstract:
Apple Silicon machines with large unified memory make it possible to hold large tensors on a desktop GPU. However, we found that PyTorch's Metal Performance Shaders (MPS) backend silently returns wrong results for batched matrix multiplication with more than 2^32 elements. torch bmm, including its wrappers matmul and eager attention, returns relative errors above 1 without an exception or a warning in every PyTorch release tested (2.4.1 to 2.14.0). We sweep bmm over dtypes, memory layouts, shapes and batch sizes around 2^31 and 2^32 elements, and judge every result against a float64 computation on the CPU. Three rules account for every outcome on 2.14.0. When the output exceeds 2^32 elements and an operand is a transposed view, the entire output is wrong and equals a computation that ignores that operand's strides. Otherwise, a view with at least 2^31 elements raises an exception, and a contiguous input above 2^32 elements makes exactly the batches beyond that point wrong, equal to a computation whose index wraps at 2^32. A slightly larger problem can thus turn an explicit error into a silent failure. The rules extend to the backward pass, where a correct forward pass can return silently wrong gradients. A second machine with another chip, under two macOS versions, reproduces all 6156 results, including the wrong values, and the same sweeps on an NVIDIA A100 are correct in all 2530 runs. In a public sentiment classifier, one oversized batch corrupts a third of the outputs, which collapse onto one class. All findings come from observable behavior, without access to the backend's closed‑source kernels; we release the harness, raw results and a guard that stops any MPS operation touching 2^32 or more elements at jniimi/mps‑silent‑failures (https://github.com/jniimi/mps‑silent‑failures).
Authors:Ruiqing Zhao, Rui Liu, Yuan Zuo, Huarong Zhang, Xiao Han, Junjie Wu
Abstract:
Automated operations research (OR) modeling requires LLMs to translate natural‑language decision problems into correct mathematical programs. Existing methods can improve individual formulations, but they often solve problems in isolation, retaining little reusable experience and repeating similar formulation errors. Prior memory‑based approaches store examples, thoughts, or insights as references, while OR modeling requires reusable formulation skills that transfer across problem narratives and guide concrete modeling decisions. We propose OptiSkill, a skill‑augmented framework that builds a hierarchical and evolving SkillBank for LLM‑based OR modeling. SkillBank stores solver‑verified experience as reusable skills, with Global Strategies for problem‑level formulation skeletons and Step Experiences for local error‑prevention rules. It is further refined through stable batch‑level test‑time evolution, where candidate skills are incorporated only after validation. Experiments on eight OR modeling benchmarks show that OptiSkill improves formulation accuracy across LLM backbones, outperforms strong agentic baselines, and gains further by expanding SkillBank coverage and reliability. Code and data are available at https://github.com/rachhhhing/OptiSkill
Authors:Wenji Fu
Abstract:
Long‑context models read a novel the way a person reads a printout: one token after another, in narrative order, with the whole history competing for a fixed budget of attention. A detective does not work that way. They sort what happened when, and they keep a map of who relates to whom, so a clue from chapter one can meet a question asked at the end of the book. We test whether a frozen knowledge graph can give a small local model that same freedom. Thirty detective novels and 234 multiple‑choice questions are answered by one fixed qwen3.5:9b reader under nine conditions: five graph routes, a recent‑window baseline, whole‑book compression, ordinary vector retrieval, and a question‑only control. The strongest graph route reaches 53.85% (126/234) against 46.15% for the recent window, 51.28% for compression, 51.71% for vector retrieval and 40.17% for question‑only. On the subset that no model can answer without the book, the graph route reaches 42.86%. None of the fifteen graph‑baseline contrasts survives Holm correction, so we present the result as exploratory evidence about a design. Two structural findings survive scrutiny better than the headline number: annotated evidence concentrates in the topological core of these graphs (2.35x enrichment, pooled), and the two graph‑building pipelines differ so much in annotation coverage (16% versus 73% of clue paragraphs) that pooled accuracy alone would hide which bottleneck is being measured.
Authors:Jiarui Yang, Jiajin Zhang, Bin Zhu, Jingjing Chen, Yu-Gang Jiang
Abstract:
Online post‑training of vision‑language‑action (VLA) models requires efficient use of robot interaction and reliable policy improvement from continually collected experience. We propose asynchronous Replay‑Anchored Policy improvement (RAPolicy), a framework that performs rollout and learning concurrently while grounding both critic and actor updates in replayed behavior. The critic learns chunk‑level values from recorded actions and constructs Bellman targets without predicting next actions, reducing computation and dependence on action‑value estimates outside replay coverage. The one‑step flow actor reuses the initial noise stored during rollout and learns through advantage‑weighted conditional likelihood, directly supervising the action mapping used for execution. We evaluate RAPolicy across four single‑task settings and one joint five‑task setting in the real world, with online training budgets of only 1‑‑2 hours. Starting from policies fine‑tuned on just 10 demonstrations per task, RAPolicy rapidly adapts to new single tasks and achieves an average 86.3% success rate. In the joint multi‑task setting, RAPolicy improves overall success rate from 52% to 88% while preserving performance on already reliable tasks and improving weaker capabilities. Overall, RAPolicy substantially outperforms the baselines in aggregate task success while requiring fewer human interventions, demonstrating stable policy improvement and high online training efficiency. Project page: https://flyfaerss.github.io/RAPolicy.
Authors:Jaeha Song, Soonmin Hwang
Abstract:
End‑to‑end driving requires planning‑relevant bird's‑eye‑view (BEV) representations, but existing pretraining approaches often rely on task annotations or dense scene reconstruction. We introduce PAVER, Planning‑Aligned BEV Encoder Pretraining. From a single LiDAR sweep, PAVER constructs sparse risk and unknown targets describing occupied and unobserved evidence along rule‑based ego motions. A 10K‑parameter head predicts these targets from masked BEV features conditioned on the action state, directing supervision toward geometric constraints on candidate motions. Pretraining requires no driving‑task annotations or dense reconstruction. Only the BEV encoder is transferred, preserving the downstream architecture and camera‑only inference. On nuScenes, PAVER reduces VAD‑Tiny's average collision rate from 0.51% to 0.19%, while improving planning L2, motion prediction, detection, and mapping. The selected VAD‑Tiny and VAD‑Base schedules use about 36% less estimated total training time than scratch training, including pretraining. On Bench2Drive Town05 Long, PAVER improves UniAD‑Tiny's closed‑loop Driving Score from 48.45 to 58.79. The project page is available at https://archiiive99.github.io/PAVER.
Authors:Ali Beikmohammadi, Sarit Khirirat, Sindri Magnússon
Abstract:
We study personalized federated reinforcement learning, in which n agents, each acting in its own Markov decision process, collaborate through a server to learn a shared MAML‑style policy initialization that becomes effective for an individual agent once that agent adapts it with a single local policy‑gradient step. We propose Per‑FedAvg‑PG, in which agents take τ local stochastic meta‑policy‑gradient steps between communication rounds, and prove that it reaches an \varepsilon‑approximate first‑order stationary point of the personalized objective in K=\mathcal O(\varepsilon^‑3/2) rounds with τ=Θ(\varepsilon^‑1/2) local steps. The analysis rests on a structural feature of the reinforcement learning setting: under standard policy‑class regularity, the per‑agent objectives have uniformly bounded gradients and Hessians with explicit constants, so the bounded‑gradient and bounded‑heterogeneity conditions imposed by the supervised theory hold automatically and no separate heterogeneity assumption is needed. The exact meta‑gradient requires the inner‑loop policy Hessian, which our experiments identify as the practical bottleneck. We therefore analyze the Hessian‑free variant, bound its bias, and exhibit fixed points at which the meta‑gradient is nonzero and of order α, showing that the resulting stationarity floor is a property of the method rather than of the bound. Experiments on tabular and neural navigation confirm the predicted behavior and show transfer to unseen agents at an order of magnitude lower sample cost than independent training. Together these results identify the adaptation step size as a tunable personalization knob and the curvature estimate as the quantity that governs whether exact meta‑gradients are affordable.
Authors:Jiapeng Li
Abstract:
Counterfactual tool evaluation must distinguish authority, historical support, and what a comparison actually estimates. We study these distinctions with eleven executable enterprise‑inspired tools, exact‑propensity logs, and real local Model Context Protocol transport. An initial 45‑run synthetic study is retained, then challenged by 30 realized‑return control runs and 15 experiments on 1,930 independently released Berkeley Function Calling Leaderboard (BFCL) tasks. Full‑return direct regression reverses an initially favorable doubly robust (DR) evaluation result in the linear setting: mean absolute errors are 0.0139 for direct regression and 0.0272 for DR. Under a shifted environment, DR retains an advantage, with errors 0.0227 versus 0.0948. On function‑name‑group‑disjoint BFCL‑derived splits, direct and DR selectors obtain balanced accuracies of 81.85% and 79.83%. Two pinned local Qwen2.5 models are evaluated on the same 200 held‑out tasks, exposing a strong failure to abstain under the fixed prompt. We further characterize policy differences under missing support: unsupported actions shared by two policies cancel, allowing point identification of an incremental change when neither absolute value is identifiable. A disagreement‑preserving fallback achieves this property in all five support‑gap runs, but conservative sampling bounds do not certify deployment improvement. The contribution is a falsifiable evaluation method and independent public evidence, not a new DR estimator, official BFCL leaderboard score, or production‑agent safety claim.
Authors:Fanhong Li, Shurui Zheng, Zi Yin, Junbo Cui, Lei Ji, Jia Liu
Abstract:
Video foundation models now reach human‑level accuracy on physical‑reasoning benchmarks, yet such tasks require predicting unobserved physical outcomes. Do these models perform human‑like forward simulation, or do they exploit statistical regularities in visible scenes? Accuracy alone cannot distinguish these strategies. We introduce a distributional evaluation framework that treats model seeds and human raters as populations, enabling comparison of consensus, uncertainty, and strategy. On the Physion benchmark, we evaluate three ViT‑L architectures (V‑JEPA2, VideoMAEv2, DINOv2). V‑JEPA2 narrows the accuracy gap to ~1 percentage point (73.2% vs. 74.2%), yet model‑human disagreement reaches 26.4%, far exceeding human‑human disagreement (4.8%), with substantially lower agreement (kappa ~ 0.48 vs. 0.91). The divergence follows forward‑simulation demands: models outperform humans on geometric reasoning (linking, +11.8 pp) but underperform on gravitational dynamics (rolling, ‑11.8 pp) and causal chains (dominoes, ‑10.5 pp). Strategy fingerprinting confirms all three architectures share non‑human strategies while none aligns with humans. Attribution analysis suggests that unobservable outcome features, rather than visible scene properties, predict this divergence, consistent with models relying more on scene‑level statistical regularities than on explicit forward simulation, a systematic divergence that accuracy alone cannot reveal. Code is available at https://github.com/fanhong‑li/model‑human‑divergence.
Authors:Nishit Anand, Jiaqi Su, Ke Chen, Yunyun Wang, Dinesh Manocha, Ramani Duraiswami, Rithesh Kumar, Zeyu Jin
Abstract:
Recent advances in Audio LLMs have achieved human‑level speech recognition, yet existing systems struggle to capture paralinguistic aspects such as speaker traits, expressive variations, and environmental acoustic conditions. To address this, we design a framework of 22 paralinguistic characteristics and create a dataset of over 1.2M Audio‑QA pairs. We develop ParA‑LLM, trained with a two‑stage curriculum: first on single‑attribute questions to build foundational knowledge, then on multi‑attribute questions for joint reasoning over speaker and acoustic characteristics. We also release ParA‑Bench, a benchmark of 6,000 multiple‑choice questions across speaker‑speech, acoustic, and mixed categories, where frontier models like GPT‑4o‑Audio achieve only 36% accuracy. ParA‑LLM surpasses state‑of‑the‑art Audio LLMs like GPT‑4o‑Audio by 7.5% on ParA‑Bench, with additional gains of 1.13% on MMAU‑Pro Speech and 7.49% on MMAR Speech.
Authors:Gregory Schwing, Ashley Schehr, Annika Tekumulla, Margret Khoushi, Ryan Christian, Dane Hubers, Faris Mahjoub, Hassan Saad, Mia Sooch, Sathyagopal Siddapureddy, Michael McLellan, Jerick Kim, Miraziz Ismoilov, Nizar Alnabahneh
Abstract:
Purpose: A vertebra at the lumbosacral junction is named by counting caudally from C2 on whole‑spine imaging, but a lumbar case is planned on lumbar‑only imaging (T12 to S1), without C2. Abdominopelvic CT holds that span plus the lowest ribs and pelvis. Where a lumbosacral transitional vertebra (LSTV) alters the count, the local anatomy is ambiguous: four rib‑free vertebrae may be an L1 with a lumbar rib or an L5 assimilated to the sacrum, and six may be a sixth lumbar vertebra, a T12 with aplastic ribs, or a lumbarized S1. CTSpinoPelvic1K asks whether local morphology resolves it without the count. CTSpine1K's vertebrae and CTPelvic1K's pelvis covered these patients but were never joined; this release joins them on one series and adds the bones neither had. It provides 802 CT records with per‑level ribs and femora, levels anchored on the lowest rib‑bearing vertebra and S1, and classes for L6, T13, a separate S1 and lumbar ribs, so anomalies are recorded as such. Acquisition and Validation Methods: Records pair CTSpine1K and CTPelvic1K labels on each patient's bone‑richest series under a VerSe‑native scheme. Validation covered geometric invariants (802/802 pass), rib‑vertebra incidence across 5,749 ribs (0.035% offset), and spinopelvic measures matching published values. Data Format and Usage Notes: NIfTI image/label pairs with patient‑grouped LSTV‑stratified five‑fold splits and a loader; archived at https://doi.org/10.5281/zenodo.22139642. Potential Applications: Classifying a vertebra from local features; updating cadaveric morphometry; spinopelvic assessment; opportunistic screening; and, absent a public preoperative lumbar cohort, surgical planning research (377 records prone). Limitations: thoracic ground truth is field‑of‑view limited; postural angles supine; no held‑out test set; ribs are triaged‑review pseudolabels; Castellvi grades two‑reader consensus on 33 records.
Authors:Huaitao Zhao, Tianlong Zhou, Weijie Wang, Jiasheng Shi, Weixiong Rao
Abstract:
Large Language Models (LLMs) have recently been introduced into traffic signal control (TSC) as decision agents due to their strengths in human‑readable reasoning generation. Yet, existing LLM TSC methods optimize only from final outcomes and fail to distinguish valid from flawed reasoning steps, causing useful or misleading steps to be jointly updated and thus impairing the model's learning of effective reasoning. To bridge this gap, we propose an LLM‑based framework ProcessLight to decompose signal decisions into verifiable semantic steps. Building on ProcessLight, we further develop Step‑wise Traffic Process Policy Optimization (STeP‑PO), a novel reinforcement learning framework that optimizes structured reasoning processes through step‑level credit assignment. Specifically, STeP‑PO uses step quality scores to evaluate local reasoning quality and step importance to measure each step's influence on the final action, and then assigns step‑level advantages over a semantic step tree structure. The resulting step‑level advantages are propagated to reasoning tokens, enabling fine‑grained policy optimization beyond outcome‑only rewards. Extensive experiments over multiple real‑world datasets demonstrate the superiority of our methods. Our code is available at https://github.com/wenzhaoabc/processlight.
Authors:Zijun Li, Xiaotian Sun, Xuelun Shen, Yao Dai, Sheng Ao, Yangyang Shi, Jakob Engel, Zhipeng Cai, Cheng Wang
Abstract:
Image‑to‑LiDAR registration estimates the camera pose of an image with respect to a LiDAR point cloud. It has diverse applications in autonomous driving, robot navigation etc. However, state‑of‑the‑art (SOTA) methods still 1) mostly assume same‑frame inputs, struggling with the image and point cloud from distant frames; 2) rely on domain‑specific training, failing to generalize to unseen scenarios. We propose ZIL, the first foundation model for zero‑shot non‑synchronized image‑to‑LiDAR registration. ZIL encodes the input image and point cloud with the Vision and Point Transformers. In addition to regressing the relative pose, ZIL also learns to predict 3D coordinates, which substantially improves the pose accuracy without additional annotations. Interestingly, naive mix‑data training cannot enable zero‑shot generalization, which requires normalization on both camera intrinsics and the LiDAR vertical‑axis origin. Trained on 7 public datasets with 1.4M LiDAR frames, ZIL consistently and significantly outperforms previous SOTA with a single model across 5 in‑domain and zero‑shot benchmarks, reducing the translation and rotation errors by up to 87% and 76% (shown in Fig. 1). Code and models are available at https://github.com/ZijunLi7/ZIL.
Authors:Weizhen Bian, Sitong Cheng, Rongxiu Zhong, Jiahao Pan, Liumeng Xue, Boyi Kang, Shilei Zhang, Jinglei Liu, Yue Wang, Junlan Feng, Bei Liu, Wei Xue
Abstract:
Recently, text‑to‑speech systems have made significant progress in speech expressiveness and controllability. However, the speaking style of generated speech typically relies on clear user‑specified instructions. In natural conversations, speaking style should be naturally inferred from the preceding conversational context. Therefore, we propose COT‑TTS, a context‑aware, reasoning‑based text‑to‑speech task. Given historical conversation audio, target text, and a reference speech, the system should comprehend the conversational context, infer an explicit intermediate reasoning, and finally synthesize the target speech with the specified timbre. To support this task, we constructed a large‑scale bilingual conversational speech dataset comprising 9 million training samples, including a high‑quality subset of 1 million samples. We further constructed a source‑disjoint benchmark with 800 human‑verified samples and established strong task‑specific baselines. Additionally, we developed end‑to‑end autoregressive models with parameter sizes of 0.6B and 1.7B, generating emotion‑labeled transcripts, editable speech style inferences, and speech tokens. Experimental results show that the proposed model achieves performance comparable to large‑scale baseline systems with significantly fewer parameters. At the same time, the model performs well in terms of duration consistency and emotional consistency, and can generate appropriate emotional, stress, and rhythmic variations based on the conversational context. To facilitate future research, we will publicly release the data construction pipeline, dataset, trained models, and related resources. The demo page and additional resources are available at https://luckybian.github.io/COT‑TTS
Authors:Heechan Yoon, Dongki Jung, Phuc Nguyen, Ming Lin, Dinesh Manocha
Abstract:
We present PanoSeg3R, a feed‑forward framework for 3D panoramic semantic segmentation. Unlike existing methods designed for perspective inputs, PanoSeg3R jointly predicts 3D geometry and multi‑view semantic segmentation in one single forward pass. Built upon a pretrained reconstruction backbone that supports panoramic images, our approach extends feed‑forward 3D reconstruction with a query‑based mask decoder. Furthermore, we introduce an automatic panorama data curation pipeline that leverages the complementary strengths of off‑the‑shelf foundation models to generate reliable pseudo semantic annotations, substantially expanding the training data and improving zero‑shot generalization. PanoSeg3R achieves state‑of‑the‑art performance on panoramic 3D semantic segmentation, improving 3D mIoU by up to 16.02 on ScanNet++, while the curated training data further improves zero‑shot performance by up to 4.26 and 43.28 mIoU on Stanford2D3D and ToF‑360, respectively. Website: https://harryyoon777.github.io/PanoSeg3R/
Authors:Yujie Pang, Sadman Sakib, Mohammad Abdullah Al Faruque
Abstract:
Dexterous manipulation in confined spaces requires local control of hand orientation. Without a wrist, a dexterous hand must obtain this local orientation through coordinated motion of the robot arm, often involving several joints and a more complex end‑effector path. We present CRAFT‑Wrist, a concentric 2‑DoF wrist extension that mounts between a robot arm and the CRAFT Hand without modifying the hand. Two XC430‑T240BB‑T servos drive sideways and front‑back rotation through short rigid transmissions. Our initial hardware prototype actuates both axes under load, achieving a demonstrated workspace of \pm20^\circ in radial‑‑ulnar deviation (left‑‑right) and a front‑back range of +80^\circ in flexion and ‑18^\circ in extension. We characterize the resulting finger‑motor loading across several wrist postures and demonstrate how the wrist supplies local orientation in grasping, nail hammering, and blackboard wiping. Demonstrations and assembly instructions are available at https://craft‑wrist.github.io/.
Authors:Yansong Wu, Tuo Yang, Rongping Zhao, Lingyun Chen, Xiao Chen, Junnan Li, Fan Wu, Alois Knoll
Abstract:
Vision‑Tactile‑Language‑Action (VTLA) models have demonstrated clear advantages over Vision‑Language‑Action (VLA) models in contact‑rich manipulation. However, developing VTLA models is severely constrained by the massive amounts of vision‑tactile data and computational resources required. To address this bottleneck, we propose VT‑Bridge, a lightweight residual adaptation strategy that bridges pretrained foundation VLAs to VTLAs. Rather than training a VTLA model from scratch or modifying the original architecture of a pretrained VLA, VT‑Bridge employs an identical lightweight residual‑adapter architecture across VLA backbones and uses backbone‑specific weights to refine actions at the robot execution frequency. This design substantially lowers the data and training barriers. Specifically, it requires up to 50 vision‑tactile demonstrations per task to fine‑tune a VLA backbone and train a 0.98M‑parameter residual adapter. Experiments with three representative VLA backbones (π_0, π_0.5, and SmolVLA) across four contact‑rich manipulation tasks further demonstrate its consistent effectiveness across VLA architectures. On average, VT‑Bridge raises the task completion rate from 11.7% with task‑level VLA fine‑tuning alone to 62.9%. Together, these findings demonstrate the broad applicability, effectiveness, and accessibility of VT‑Bridge for contact‑rich manipulation. The project page is available at https://hoxnocha.github.io/vt‑bridge‑web/.
Authors:Nana Yaw Owusu Ofori-Ampofo, Samira Ebrahimi Kahou, Joseph Thekinen
Abstract:
Robot learning policies fail in characteristic ways: they stall in uncertain states, drift during contact‑rich alignment, and miss targets by millimetres in precision tasks. Yet training datasets consist largely of successful demonstrations, while real‑world benchmarks often reduce performance to binary success. This limits both supervision for recovery and analysis of where failures occur. We introduce REBOOT (Recovery Episode Benchmark for Off‑nominal Trajectories), the first robot manipulation benchmark designed around failure as a first‑class signal. REBOOT contains 2,160 demonstrations across 18 precision assembly tasks, each decomposed into five shared phases: Align(pick), Engage(pick), Transport, Align(place), and Engage(place), enabling phase‑level evaluation beyond terminal success. Failures are introduced across phases and paired with expert recovery trajectories that return the system to a valid continuation state. Tasks are annotated with rotational symmetry, engagement‑clearance precision tier, and assembly direction through matched install‑remove pairs. Failure episodes are labeled by phase and categorical failure mode, enabling attribution to kinematic stage and tolerance violation. Data includes synchronized RGB‑D observations from four viewpoints and grounded natural‑language descriptions of phase‑level success and failure conditions. Half the dataset contains expert demonstrations; the other half contains recovery demonstrations sampled to reflect failures observed in imitation‑learned policy rollouts. We benchmark action‑chunked transformer, diffusion, and π_0‑FAST policies using phase‑level completion rates, revealing model‑specific failure points hidden by binary evaluation. Dataset and code: https://nanayawoa.github.io/REBOOT
Authors:Yansong Wu, Huaqing Li, Tianding Hou, Lingyun Chen, Alois Knoll
Abstract:
Vision‑Language‑Action (VLA) models commonly predict action chunks, limiting their ability to react to environmental changes during execution. Existing asynchronous inference methods improve reactivity but typically rely on a fixed inference gap. In this paper, we propose an event‑guided dynamic inference strategy that adapts the inference gap according to scene changes observed since the previous inference. Thereby, it simultaneously preserves motion consistency and prompt reactivity. Across static and dynamic real‑world settings, our method consistently performs best, averaging 95% success and exceeding the strongest baseline by 55 percentage points. The code will be made publicly available upon acceptance. The project page is available at https://react‑when‑you‑need‑to.github.io/.
Authors:Ali Mehizel, Oussama Khaldi
Abstract:
Vision Transformers allocate most parameters to multi‑layer perceptrons (MLPs) for channel mixing, while token interactions usually rely on quadratic multi‑head self‑attention (MHSA). Linear attention reduces sequence complexity to O(N), but remains coupled with the same fixed‑activation MLP as softmax Transformers. Kolmogorov‑Arnold Networks (KANs) instead place learnable univariate maps on edges, yet prior vision KANs keep MHSA or omit attention entirely. We introduce LKAT (Linear Kolmogorov‑Arnold Transformer), an isotropic ViT encoder that couples chunkwise Gated Linear Attention (GLA) with a two‑layer KAN feed‑forward, and we provide an I/O‑aware fused RBF‑KAN kernel for the radial‑basis grid maps. Under a shared DeiT‑style recipe we compare LKAT with ViT, ViT‑5, and MLP‑Mixer. LKAT‑B exceeds ViT‑B/16, ViT‑5‑B, and Mixer‑B/16 on ImageNet‑100. Tiny/Small/Base LKAT variants scale consistently on CIFAR‑10/100, and ImageNet‑100 pretraining transfers to CIFAR fine‑tuning. The results support gated linear attention and KAN‑based radial‑basis functions as complementary inductive biases for mid‑scale visual representation learning.
Authors:Jerry Yan, Matteo Forlivesi, Bowen Tan, Andrew Xie, Siddharth Somasundaram, Sotiris Nousias
Abstract:
We address the problem of recovering high‑speed videos from dynamic scenes under extreme photon sparsity. Existing methods rely on aggregating photon detections in local spatiotemporal windows to improve signal‑to‑noise ratio; however, this local grouping discards global structure and fails in low‑light regimes where photon detections are sparse in space and time. In this work, we show that the information needed to recover both motion and illumination is encoded in correlations over the full space‑time pattern of photon arrivals. Building on this insight, we develop a spatiotemporal flux probing theory and an algorithm that estimates the Fourier coefficients of the underlying intensity directly from the photon stream. We demonstrate that our approach (1) recovers fast motion and temporal illumination dynamics with substantially fewer photons than prior methods, (2) enables velocity‑selective videography that automatically refocuses video onto specific detected motions, and (3) generalizes across sensing modalities including single‑photon, event, and spike cameras.
Authors:Ibrahim Mian, Shayaan Siddique
Abstract:
Kaplansky's zero‑divisor conjecture asserts that the group ring of a torsion‑free group over a field has no zero divisors. It holds for every group with the unique‑product property, so a counterexample can only come from a torsion‑free group without unique products. In lectures in 2021, Gardam announced that the torsion‑free \tildeA_2 lattice Γ= \langle a, b \mid a b a^2 b^‑1 a^2 b^‑2, a b^3 a b^4 a^‑1 b \rangle does not have unique products and presented it as a new candidate group: it has property (T), and the known methods for proving the conjecture do not apply to it. To our knowledge, no proof of the announcement has been published. We give a proof checked by the Lean 4 kernel and stated against Mathlib's UniqueProds class. The witness is an explicit pair of finite subsets with |A| = 32 and |B| = 28 in which each of the 896 products coincides with another product. For 658 products the certificate is an identity in the free group; the other 238 certificates are explicit products of conjugated relators, 970 conjugates in all, checked by free reduction. A homomorphism onto \mathbbZ/42 shows that each pair (u,v) differs from its partner (u',v') as a pair of group elements, which is all the theorem requires. Together with a homomorphism onto the alternating group A_4 it also shows that the listed words are pairwise distinct, so the sets have exactly 32 and 28 elements. The witness and certificates come from an untrusted search program and are re‑checked by Lean. The development uses only the axioms propext, Classical.choice and Quot.sound, with no sorry and no native_decide. The mathematical statement is Gardam's. To our knowledge this is the first verification in a proof assistant of a unique‑product failure in a torsion‑free group; torsion‑freeness of Γ is taken from Gardam and is not formalized here.
Authors:Savio Cardoz, Santhiya Rajan
Abstract:
Mobile river monitoring robots must interpret obstacles and water boundaries that geographic waypoints alone cannot describe. On resource constrained platforms, converting imperfect visual predictions into timely and inspectable guidance is a distinct challenge. An object label or steering command does not explain which evidence supports a decision or when that evidence is unreliable. We present PAANI, an on‑device perception to guidance architecture that combines a project trained YOLO11n detector and a custom MobileNetV3 Small semantic segmenter with timestamp aligned evidence fusion on Arduino UNO Q. Bounded tracking supplies object persistence, while an explicit corridor policy combines surface labels, accepted detections, urgency and mask uncertainty. Each final advisory exposes its contributing evidence and policy reasons. ROS 2 interfaces connect the local AI pipeline to a separate Gazebo vessel, localization and control testbed. Training uses 10,000 WaterScenes images for four‑class detection and 1,127 MaSTr1325 images for segmentation, including 198 segmentation validation images. The selected FP32 ONNX models occupy 14.817 MB. Detector checkpoint test mAP at 0.5 IoU is 0.7388, while the separately evaluated rectangular ONNX export achieves validation mAP at 0.5 IoU of 0.7367. Segmentation ONNX validation mIoU is 0.9750. A five‑minute UNO Q recording produced median and 95th percentile pipeline latencies of 467.8 ms and 580.3 ms at a configured 0.5 Hz cadence. The evaluation also identifies black input misclassification and a sampling rate mismatch that prevents the diagnostic apparent motion estimator from collecting sufficient evidence. These results support an inspectable and reusable edge robotics foundation while clearly distinguishing model accuracy and on‑board execution from validated on‑water collision avoidance.
Authors:Neeraj Yadav
Abstract:
Few‑shot learning research is predominantly evaluated on accuracy alone, with limited attention to the parameter and training‑sample budgets required to reach that accuracy ‑ a real constraint for practitioners without large‑scale compute. We present an ultra‑lightweight (22,249‑34,917 parameter) spatial‑relational architecture for few‑shot image classification that combines fixed Gabor edge‑energy guidance with a windowed, content‑adaptive patch locator. Under a strictly matched, iso‑episode‑budget protocol (250 meta‑training episodes, 5 canonical seeds, 600 evaluation episodes per seed), our architecture achieves 5‑shot accuracy gains, consistent across all five seeds, over Prototypical Networks, Relation Networks, and MAML on both CIFAR‑FS and MiniImageNet, while using 27‑53% fewer parameters than any baseline. It also converges in fewer training episodes, generalizes better to an unseen fine‑grained domain (CUB‑200‑2011 birds, zero retraining), and is more robust to 50% occlusion and 25% spatial translation than all three baselines. A series of falsification ablations ‑ zeroing relational tokens at inference and retraining without them entirely ‑ shows that the architecture's pairwise relational computation, while present, is not the primary driver of its performance; the content‑adaptive patch locator is. We report this honestly, together with a capacity sweep showing a genuine accuracy plateau near 22‑35k parameters, and release full seed‑level results and checkpoint hashes for reproducibility.
Authors:Zahra Jooyandeh, Masato Kobayashi, Yuki Uranishi
Abstract:
The Dynamic Window Approach (DWA) is widely used for local navigation, but its performance depends strongly on parameters that are typically fixed before navigation. In particular, the appropriate prediction horizon can vary with local free space: longer horizons support efficient motion in open areas, whereas shorter horizons help preserve feasible motions in narrow or cluttered regions. This paper proposes D3DWA, an adaptive DWA framework based on a Dueling Double Deep Q‑Network (D3QN), which jointly selects the DWA evaluation weights and prediction horizon from a continuous navigation state at every control step while retaining DWA's trajectory generation and collision checking. In eight simulated environments, including unseen layouts, D3DWA reached every goal. Real‑robot experiments further showed that D3DWA completed all three tested configurations, including a constrained case in which the weights‑only variant timed out. These results demonstrate the benefit of jointly adapting the evaluation weights and prediction horizon. Additional material is available at https://mertcookimg.github.io/d3dwa/
Authors:Christian Gapp, Elias Tappeiner, Martin Welk, Karl Fritscher, Stephanie Mangesius, Constantin Eisenschink, Philipp Deisl, Michael Knoflach, Astrid E. Grams, Elke R. Gizewski, Rainer Schubert
Abstract:
Multimodal stroke recurrence prediction requires effective integration of heterogeneous clinical and imaging data, yet modality imbalance often causes models to over‑rely on dominant modalities and underutilize complementary information. While self‑supervised pretraining and selective parameter freezing are commonly employed to improve representation learning and fine‑tuning stability, their effect on modality contributions and cross‑modal behavior in multimodal medical models remains largely unexplored. In this work, we investigate whether image pretraining on 3D CTA scans reduces modality imbalance and improves cross‑modal integration for stroke recurrence prediction, a clinically critical task we recently addressed. To this end, two multimodal neural networks are pretrained in a self‑supervised manner and subsequently fine‑tuned using two distinct freezing strategies. Their performance and modality utilization are compared against both the baseline model from our previous work and models trained entirely from scratch in this study. Our results demonstrate that self‑supervised pretraining enables more effective utilization of the multimodal image‑tabular dataset, outperforming both the prior baseline and all non‑pretrained models. Notably, the best‑performing Vision Transformer based neural network successfully overcomes unimodal collapse. Synergy analysis reveals significant interactions between vision and both gender and CHD, suggesting clinically relevant patterns for stroke recurrence. Overall, our findings demonstrate that self‑supervised pretraining and strategic fine‑tuning support more balanced modality utilization and enable meaningful cross‑modal interactions. Code is publicly available at https://github.com/ChristianGappGit/SSL_Pretraining.
Authors:Yu Han, Cigdem Beyan, Xiang Zhang, Xiaofeng Liu, Nan Liu, Jimeng Sun, Shenda Hong, Cheng Ding, Vittorio Murino
Abstract:
Medical time series (MedTS), including electrocardiograms (ECG), electroencephalograms (EEG), photoplethysmography (PPG), and vital‑sign recordings, are central to clinical diagnosis and health monitoring. As large language models (LLMs) have advanced, a growing body of work has examined how their reasoning, generation, and knowledge‑integration capabilities can support MedTS analysis. Yet existing studies remain scattered, and the field still lacks a clear view of how these models should be designed, integrated into clinical workflows, and evaluated. This review synthesizes recent work on large language models for medical time series analysis (MedTSLLMs), covering both methodological progress and issues related to real‑world deployment. We review model architectures, data resources, and processing pipelines, and prompt design strategies adapted for diverse clinical scenarios. We further organize existing MedTS applications, ranging from diagnostic interpretation and report generation to longitudinal health monitoring and physiological signal synthesis, highlighting task‑specific design choices, common evaluation protocols, and empirical findings reported across studies. By bringing together current practices and open challenges, this review aims to provide a clearer foundation for developing, evaluating, and deploying MedTSLLMs responsibly in healthcare. We also maintain a regularly updated list of MedTSLLM studies and resources at: https://github.com/hy727/MedTSLLM‑Review.
Authors:Jingang Zhou, Haiyang Guo, Yuan Ma, Han Zhu, Xu-Yao Zhang
Abstract:
Model merging has emerged as a promising paradigm for integrating multiple task‑specific capabilities into a single large language model. However, existing methods predominantly focus on post‑hoc processing of independently fine‑tuned models, overlooking how the training phase itself impacts cross‑task compatibility. Resolving parameter conflicts after fine‑tuning is inherently sub‑optimal. To address this, we propose CAMFT, a Conflict‑Aware Mergeable Fine‑Tuning method that makes task adaptation both efficient and mergeaware. CAMFT treats mergeability as a property shaped during fine‑tuning, rather than only a problem to be solved after fine‑tuning. By guiding each task to update sparse coordinates with lower cross‑task conflict, CAMFT produces task updates that are efficient to train and more compatible for downstream model merging. Extensive experiments demonstrate that CAMFT outperforms standard finetuning baselines in multi‑task merging scenarios. Codes are available at https://github.com/gyanchow/CAMFT‑LLM.
Authors:Shaolong Chen, Ang Li, Mingjie Li, Yisen Wang
Abstract:
Large language models increasingly rely on long chain‑of‑thought (CoT) trajectories for complex reasoning, but autoregressive generation brings substantial memory and inference costs. Latent reasoning models (LRMs) offer a more efficient alternative by compressing intermediate reasoning into a small number of continuous latent vectors. Despite their efficiency, however, the adversarial robustness of LRMs remains largely underexplored. In this work, we systematically evaluate the robustness of latent reasoning across textual and multimodal settings, covering eight models and six benchmarks. We find that, across our evaluated settings, LRMs are generally less robust than explicit CoT baselines under adversarial perturbations, with particularly severe degradation under white‑box attacks. Further analysis reveals distinct failure modes across modalities: textual latent states exhibit brittle dynamics and high sensitivity to specific input patterns, while latent states in multimodal models can remain largely invariant to input perturbations and have limited influence on final predictions. These findings expose robustness limitations of current latent reasoning approaches and highlight the need to jointly consider efficiency and robustness when designing implicit reasoning systems. We have open‑sourced our code to facilitate reproduction of our research https://github.com/PKU‑ML/latent‑reasoning‑model‑assessment.
Authors:Mingzhe Du, Anh Tuan Luu, Dong Huang, See-Kiong Ng
Abstract:
Benchmarks for LLM‑generated GPU kernels decide correctness with a few random inputs and a loose floating‑point tolerance, and their verdicts now feed leaderboards and reinforcement‑learning rewards. Recent work agrees these checkers are weak and patches them by hand‑‑‑extra input distributions, fuzzing recipes, tighter tolerances‑‑‑with no way to \emphmeasure whether any patch suffices. We introduce mutation analysis as an adequacy metric for kernel‑benchmark oracles: deterministic rules inject 10,303 compilable faults into verified CUDA implementations of 188 KernelBench problems, 7,384 of them with an independent kill witness; any test protocol is scored by the fraction it detects. The official check misses one in six witnessed faults (16.9%), deterministically, and the misses are skewed by family: 8.7% of arithmetic faults escape, but 78.6% of precision faults do. The metric explains why (a tolerance blind band growing with reduction size; a measured ceiling on input aggressiveness set by legitimate floating‑point variance), audits the strongest existing patch (KernelBench‑Verified's gain splits into +4.0 points from hidden inputs and +4.5 from tighter tolerance, a split its authors could not compute), and exposes a published fuzzing recipe that rejects \emphcorrect kernels 107 times. Optimizing suites over the kill matrix reaches 98.0% detection with two inputs per problem (94.8% held‑out), and the measurement's fault taxonomy teaches a test generator more than the raw faults themselves. Across 48 whole architectures, the blindness grows with scale, concentrating in deep homogeneous pipelines, and two problems prove unrefereeable: their official references violate the benchmark's own tolerance against fp64. We release everything as \hrefhttps://huggingface.co/datasets/Elfsong/KernelBench‑MKernelBench‑M.
Authors:Adam Hollowell
Abstract:
Sofroniew et al. (2026) report that emotion concepts in Claude Sonnet 4.5 are represented as vectors whose geometry mirrors human affect psychology. We replicate the representational core of that study on the base pretrained model google/gemma‑2‑27b, inheriting every disclosed parameter, resolving unspecified steps by disclosed rules, and changing only the subject model. From 205,200 newly generated Claude Sonnet 4.5 stories matching the original corpus design, we extract 171 emotion vectors and recover the core results. The leading principal components form an affective circumplex (PC1 carries 26.7% of variance against the original study's ~27%, PC2 13.4% against ~14%), emotions cluster into similar intuitive families, and the geometry holds across a broad late‑middle band. The valence axis aligns with human norms (r = 0.72, against 0.81) and is stable across scales and depth. Arousal aligns at r = 0.67 (against 0.66) but only at the full 171‑emotion scale and late depth, so we do not classify it as replicated. Extending the original analysis, a 46‑layer sweep locates a sharp seam at L22‑26, where the geometry consolidates and the vocabulary readout becomes legible. An embedding‑layer baseline finds much of the geometry already present in the static token embeddings, with arousal as the exception. On top‑activating held‑out text, the geometry predicts token‑level co‑activation at r = 0.907. At least 52% of vectors peak on structurally non‑conceptual tokens, a measured floor for max‑activation confounds. Even when a document contains the vector's emotion word, the peak lands on that word only 6.1% of the time. Because the subject is a base model and the stimuli are Claude‑generated fiction, the recovered structure is a property of the pretrained representation of Claude‑rendered emotion. The original's causal and assistant‑facing analyses are out of scope. Code and data are released.
Authors:Jun He, Deying Yu
Abstract:
Large language models can convincingly adopt personas, recall past dialogues, and weave rich autobiographies. Yet this conversational eloquence conceals a fundamental attribution problem: looking the part does not mean having lived the life. Two individuals can share identical public profiles‑‑the same age, hometown, occupation, and personality traits‑‑while possessing entirely distinct private histories, relationships, and acquired skills. When conditioned solely on that shared profile, an agent lacks the information required to determine which lineage is correct. We introduce the Situated Identity Test (SIT), an architecture‑independent framework that evaluates whether an agent's behavior is functionally attributable to a specific developmental lineage. Grounded identity requires both appropriate knowledge of recorded experiences and appropriate ignorance of ungrounded ones, bounded by what the identity has actually acquired rather than what its underlying foundation model knows. We prove that any policy conditioned solely on a compressed profile is bounded by an average situated validity of at most 1/m across m colliding life histories on lineage‑discriminative queries (at most 50% for paired lineages). We instantiate this framework in SITBench, an evaluation suite designed for 25 profile‑collision pairs (50 distinct lineages) across 10,000 planned probes and nine architectural configurations. Supported by an open‑source reference implementation, deterministic test fixtures, and empirical pilot evaluations on frontier foundation models (GPT‑5.6 Sol and Claude Opus 5), we formalize the failure modes of persona prompting under profile collision and provide an assurance harness for evaluating episodic continuity, structured state, and epistemic boundaries.
Authors:Hongyao Yu, Tianqu Zhuang, Ziyuan Xu, Hao Fang, Jiaxin Hong, Bin Chen, Shu-Tao Xia
Abstract:
Diffusion large language models (dLLMs) offer a compelling alternative to autoregressive models, yet they may expose sensitive training data during denoising. Detecting such usage is challenging because dLLMs lack the efficient one‑pass probability decomposition of causal architectures. Existing methods rely on random masking to obtain tractable token‑wise detection signals under limited query budgets, but fail to control dependencies among masked tokens. We demonstrate that this token‑wise approximation introduces a non‑negative structural estimation error, which is theoretically characterized by the cumulative conditional mutual information (CMI) among masked tokens and can obscure subtle memorization signals. This insight suggests that reliable detection requires masked token sets with weak internal dependency. To avoid the prohibitive cost of directly estimating CMI over token combinations, we propose Independent Token Sampling (ITS), a query‑efficient framework that uses an attention‑derived pairwise dependency proxy to approximate the CMI‑aware selection criterion. ITS further incorporates a diversity‑promoting strategy to improve token coverage across sampling rounds, yielding aggregated token‑wise signals that are less affected by dependency‑induced approximation error. Experiments on multiple datasets show that ITS consistently outperforms state‑of‑the‑art baselines across different models and datasets, achieving an AUC improvement of 0.18 on the ArXiv dataset while maintaining strong performance under limited query budgets. The code is available at https://github.com/Chrisqcwx/DLLM‑MIA .
Authors:Yanyu Qian, Pengcheng Weng, Yue Tan, Enguang Zuo, Yu Zheng, Yixin Liu
Abstract:
Text anomaly detection, the task of identifying text instances that deviate from normal language patterns, is crucial for language‑driven applications. However, most existing methods can only perform document‑level anomaly detection, making it hard to locate harmful phrases or support targeted prevention. Recently, there has been an emerging trend toward token‑level text anomaly detection, which aims to address the above limitation by identifying anomalous words or fragments within a document. Nevertheless, one representative method mainly relies on representation‑space distance measurement, neglecting the complementary roles of different anomaly cues in capturing diverse abnormal patterns. To bridge the gaps, we propose a Dual‑evidence framework with adaptive Fusion and Aggregation (DiFA) for token‑level anomaly detection. DiFA derives anomaly scores from form‑structural and semantic views to capture visible structural abnormality and contextual inconsistency, respectively, thereby providing complementary evidence for identifying diverse anomalies. To combine these two scores with varying numerical scales, DiFA incorporates a calibration and fusion mechanism to adaptively balance the two views. Moreover, to obtain a discriminative document‑level score, a multivariate aggregation method is designed to summarize token‑level anomaly scores from multiple perspectives, preventing rare anomalous tokens from being diluted. Extensive experiments across various text anomaly detection benchmarks demonstrate that DiFA consistently achieves top performance while maintaining strong efficiency, robustness, and interpretability. The code and scripts are available at: https://github.com/qyy11‑com/DiFA.
Authors:Yibo Wang, Jisheng Dang, Bimei Wang, Yitao Wu, Wencan Zhang, Hong Peng, Jizhao Liu, Bin Hu, Qi Tian, Tat-Seng Chua
Abstract:
Omni‑modal large language models integrate text, audio, and image signals into a shared residual stream, where concepts such as emotion can be linearly decoded and causally modified by activation steering. A common but rarely tested assumption is that the layer with the highest probing accuracy is also the best layer for steering, so injection layers are often selected by probe performance. We provide the first causal test of this assumption across three independently developed omni‑modal models and find that it fails. Reading and intervention rely on different layers, a phenomenon we call the probing‑steering layer dissociation. Using emotion as a controlled testbed, we measure layer‑wise readability and steerability across text, audio, and image inputs. Probe‑best layers vary widely across architectures, while steering‑effective layers consistently fall within a narrow mid‑to‑late range of normalized depth. Paired random‑direction controls show an approximately 26‑fold causal gap, ruling out random perturbation and direction quality as explanations. Logit‑lens analysis reveals a staged forward process: causal handle, probing saturation, and vocabulary commitment, and motivates a two‑factor account in which steering effectiveness depends on both representational readability and downstream plasticity. These results show that probing accuracy is a poor heuristic for selecting intervention layers and suggest a cross‑architecture mid‑to‑late selection criterion. We also identify a cross‑modal emotion subspace organized by valence and arousal, with joy acting as a stable anchor across models. Code and data: https://github.com/YiboWang2002/Read‑Best‑Is‑Not‑Steer‑Best.
Authors:Xinglei Wang, Junyuan Liu, Guangsheng Dong, Zichao Zeng, Stephen Law, James Haworth, Tao Cheng
Abstract:
Passively collected mobile phone location data provide large‑scale, longitudinal observations of human mobility but do not directly reveal activity purposes. The functional characteristics of visited locations offer useful contextual information, yet their relationship with activity purpose remains uncertain, particularly in mixed‑use urban environments. We conceptualise activity pattern mining as an integrated process of representation, clustering, and interpretation, and propose the Activity Chain Encoder (ACE) for the representation stage. ACE is a self‑supervised model that combines pre‑trained urban embeddings with visit timing and duration and uses a Transformer to model the sequential organisation of stays. It is trained using masked activity modelling and identity‑guided contrastive learning without requiring deterministic activity purpose labels. Learned daily representations are aggregated into user‑level profiles, clustered, and interpreted through temporal‑functional patterns and Census‑derived demographic context. Applied to mobile phone app location data from London and compared with three representative methods, ACE supports the identification of six differentiated weekday activity‑pattern groups characterised by distinct daily rhythms, urban functional contexts, and demographic associations. These complementary forms of evidence further support the development of empirically grounded activity‑pattern personas, establishing a holistic route for deriving behaviourally meaningful population patterns from unlabelled mobile phone location data. The source code for the entire analytical pipeline developed in this study is publicly available at https://github.com/xlwang233/ACE.
Authors:Navraj Singh, Maheep Chaudhary
Abstract:
Evaluation awareness poses an unprecedented threat to model evaluation, but the mechanisms by which models detect it remain unknown. This study focuses on determining this and identifying contrasting mechanisms between smaller and larger models. While smaller models use the prompt's format sensitivity to detect evaluation, larger models often rely on higher‑order reasoning to detect it. We evaluated Gemma 3 (1B, 4B, and 12B), Phi‑3 (Mini and Medium), and Llama‑3 8B using Chain‑of‑Thought analysis, representation probing, and Integrated Gradients attribution. Motivated by these findings, we propose a dual‑pathway intervention that combines prompt sanitization with activation counter‑steering to suppress both external evaluation triggers and their internal representations. Across 200 highly evaluation‑aware prompts, our method achieves an average behavioral flip rate of 70.58%, consistently outperforming either intervention alone. These results provide new insights into how evaluation awareness develops in compact language models and suggest that effective mitigation requires jointly addressing both prompt‑level and representation‑level signals.Datasets and codebase can be found in this \hrefhttps://github.com/chahal‑navi/Evaluation‑Awareness‑Compact‑LLMs/tree/mainGithub Repository.
Authors:Huapeng Zhou, Huayu Wang, Xinyu Wang
Abstract:
Speculative decoding accelerates language‑model inference by letting a cheap drafter propose tokens that the target model verifies in parallel. Recent block drafters make drafting nearly free: a single backbone pass emits an entire block of draft tokens. Draft trees promise a further gain ‑‑ several alternative continuations verified in one target forward ‑‑ but existing constructions rank candidates by per‑position marginals that ignore which parent a candidate extends, so on semi‑autoregressive drafters wider trees mostly add mis‑ranked nodes; and a tree of fixed size ignores how much speculation each decoding round, and each serving load, can support. We introduce TreeSpark, which reads a parent‑conditioned distribution from the drafter's existing Markov head at negligible cost, calibrates it into an edge‑acceptance estimate, and lets path survival govern everything else: best‑first expansion, per‑round stopping, and a load‑adaptive serving policy. Sampling siblings without replacement, with matching residuals in recursive rejection, keeps decoding lossless at any temperature. Adaptive trees improve on matched fixed budgets at every temperature; against a tuned chain on the same drafter, TreeSpark accepts 15‑25% more draft tokens per round and decodes 8‑14% faster in single‑request wall‑clock, and under rising load it gracefully shrinks the tree back to the chain. Code and artifacts: https://github.com/PopSoda2002/TreeSpark
Authors:Jonathan Groff
Abstract:
Retrieval over a personal memory store is retrospective: it surfaces what resembles the query, and it is blind to what the user has committed to do. We describe a prospective term for memory retrieval that costs no inference at query time. Commitments are held in an explicit ledger as dated or trigger‑conditioned entries; memory items linked to a firing entry receive a salience boost, blended multiplicatively into embedding‑based retrieval so that relevance remains sovereign. On a synthetic prospective‑memory task set modeled on TriggerBench's published structure (48 blind‑authored dialogues, 175 tasks), the term raised recall@5 on the hard stratum from 0.000 to 0.955 at the default blend weight and to 1.000 under a floor variant, with zero false boosts across 53 resolved‑commitment tasks. Blind authorship also produced a scope finding: only 17‑29% of naturally phrased commitment‑trigger pairs defeat embedding similarity, so the term matters on a real minority of cases and must do no harm on the rest, which it does not. We position precomputed commitment linkage as the always‑on floor of a layered design whose expansion layer is query‑time prospection. Results are preliminary: the evaluation set is author‑constructed, and evaluation on TriggerBench proper is committed follow‑up work once its data is released.
Authors:Saksham Singh, Zheyuan Hu, Max Sobol Mark, Jeffrey Yu, Zackory Erickson, Aviral Kumar
Abstract:
Despite rapid progress, generalist robot policies remain brittle on complex, long‑horizon tasks that comprise multiple stages or require repeated attempts and deliberation on the same underlying stage before success. Q‑value functions can improve these policies by ranking candidate actions or guiding policy improvement, but learning from sparse task‑level rewards entails long credit‑assignment horizons, difficult Bellman backups, and broad data‑coverage requirements. We introduce SeeQ (Subtask‑elicited Q‑functions), which instead learns Q‑values for the currently active subtask. This shortens the value‑prediction horizon and enables effective learning with temporal‑difference (TD) objectives. During training, subtask‑level annotations present in offline robot data provide the decomposition and enable learning from broad, potentially suboptimal robot datasets. To eliminate the need for human annotations or modular subtask prediction systems at test time, our Q‑function architecture is trained to autoregressively predict the active subtask in natural language before estimating its value. We instantiate SeeQ using a base vision‑language backbone, pretrain it on diverse open‑source robot manipulation data, and finetune it on downstream tasks. Across four real‑world manipulation tasks on two bimanual robot platforms, the SeeQ value function substantially improves best‑of‑N policy steering.
Authors:Haoyu Zhou, Joe Watson, Anson Lei, Ingmar Posner
Abstract:
A desirable property of a world model is the ability to learn continually across tasks, adapting to new environments without forgetting what the agent has already learnt. In particular, the ability to retain and reuse knowledge obtained from prior experiences underpins an agent's ability to efficiently adapt to novel environments, as the dynamics of the physical world can often be described in recurring mechanisms. However, the world model's measure of adaptation entangles two abilities: the speed and capacity to learn unseen tasks, and the reuse of knowledge already acquired, since incoming tasks carry novel content alongside what recurs. In order to isolate knowledge reuse from prior experiences, we propose a compositional continual learning benchmark for world models in robot manipulation. Specifically, we design each task curriculum with compositional tasks that combine aspects of the tasks seen in the sequence. We further factorise this composition along the axes of action and perception to better understand how different input modalities bottleneck knowledge reuse. We evaluate state‑of‑the‑art world models under canonical continual learning methods, alongside a modular world model whose dynamics backbone contains explicitly reusable components. Results show that modularity balances reuse against forgetting better than conventional methods, but none solve the problem fully, leaving clear room for continual world models built to reuse without forgetting. More details are available on our project website: https://object814.github.io/Compositional‑Continual‑Learning/.
Authors:Askar Tsyganov, Uliana Parkina, Sergey Samsonov, Maxim Rakhuba
Abstract:
We prove that, over any field, the bilinear complexity of multiplying a 3× 2 matrix by a 2× m matrix is strictly greater than 24m/5. In particular, every exact bilinear algorithm for multiplying a 3× 2 matrix by a 2× 5 matrix requires at least 25 multiplications. Together with the Hopcroft‑Kerr upper bound, this proves that the \langle 3,2,5\rangle matrix multiplication tensor has rank exactly 25. The proof has been formally verified in Lean 4, with the formalization available at https://github.com/fallnlove/mm325_proof.
Authors:Fabricio Breve
Abstract:
Graph Convolutional Networks (GCNs) are highly sensitive to label noise, since corrupted supervision can propagate through the graph and degrade learned node representations. This work proposes PCC+GCN, a hybrid framework that uses Particle Competition and Cooperation (PCC) as a graph‑based label‑refinement stage before GCN training. PCC identifies suspicious labeled nodes through particle domination dynamics and determines whether their labels should be preserved, removed, or reassigned before GCN training. The framework also allows the graph used by PCC to be augmented with feature‑based k‑nearest‑neighbor edges, while the GCN itself is trained on the original graph structure and node features. The proposed method was evaluated on ten graph datasets from the NoisyGL benchmark under conventional Uniform, Pair, and Random label noise, as well as under instance‑dependent label noise. A detailed hyperparameter analysis was also conducted on Cora, CiteSeer, and PubMed. Under conventional noise, PCC+GCN achieved the highest overall average accuracy and the best average rank among the evaluated methods, with an average gain of 1.67 percentage points over the baseline GCN across the clean setting and all noisy scenarios. Under instance‑dependent noise, PCC+GCN remained competitive with the best‑performing robust methods while requiring substantially lower execution time, being the fastest robust method on eight of the ten datasets. The results indicate that PCC‑based label refinement provides an effective and computationally efficient preprocessing strategy for improving GCN robustness under noisy supervision.
Authors:Shuqi Zhao, Bang Du, Cheng-En Wu, Yichen Xie, Yixiao Wang, Masayoshi Tomizuka
Abstract:
Robot demonstration collection often produces imperfect or failed trajectories in addition to successful demonstrations. Existing methods typically exploit failed trajectories by identifying segments that still make progress toward task completion, but largely overlook failure‑critical behaviors that directly lead to task failure. Here we argue that these two types of segments provide fundamentally asymmetric supervision: progressive segments should be imitated, whereas failure‑critical segments should be explicitly avoided. Based on this observation, we propose CARF, a Contrastive Attraction‑Repulsion of Failure‑guided framework for learning from imperfect robot data. CARF introduces a progress‑based importance scorer, trained solely on successful expert demonstrations and its perturbation results, to estimate step‑wise contributions toward task completion and identify informative regions in failed trajectories. These scores guide a unified flow‑matching objective that attracts the policy toward progressive behaviors and repels it from failure‑critical ones, while excluding ambiguous segments. This enables more comprehensive utilization of imperfect data and avoids unreliable supervision from ambiguous failure segments. Extensive experiments in simulation and the real world demonstrate consistent improvements over competing baselines across diverse failure scenarios, with ablations further validating the effectiveness of the proposed scoring and attraction‑repulsion mechanisms. Our website is https://zhao‑sq.github.io/carf/#.
Authors:Ethan Keller
Abstract:
Moser's worm problem asks for a planar region of least area containing a congruent copy of every unit arc. We show that the infimum area α among convex universal covers satisfies 0.239\leα\le0.24633\ldots, reducing the gap between the previous refereed bounds by over 75%. For the lower bound, we choose four unit polygonal arcs and prove by finite subdivision that, however they are placed, their convex hull has area at least 0.239. For the upper bound, we construct a quadrilateral of area 0.24633\ldots and prove cover universality by showing that its support inequalities force uncovered arcs to have length greater than one. The full proof is formalized in Lean 4 and verified by the Lean kernel. Code and certificates are available at https://github.com/ethan‑keller/moser‑worm‑improved‑bounds.
Authors:Yichen Liu, Puzhen Yuan, Xiang Zhu, Yanjiang Guo, Jianyu Chen
Abstract:
Learning large‑scale vision‑language‑action (VLA) models from multi‑embodiment datasets remains challenging due to heterogeneous action spaces across end effectors. Although latent action models (LAMs) can learn embodiment‑agnostic action representations from diverse video data, existing image‑based LAMs often fail to capture fine‑grained end‑effector articulation, particularly finger‑level geometric changes in human and dexterous robot hands. To address this limitation, we propose GALA, a Geometry‑Aware Latent‑Action modeling framework that augments image‑based latent actions with 3D end‑effector geometric motion. However, naively incorporating point clouds yields fine‑grained action representations with limited shared semantics, hindering cross‑embodiment pretraining. To address this issue, we introduce the Unified End‑effector Motion Representation (UEMR), which preserves fine‑grained motion information while improving the cross‑embodiment generalizability of latent actions. Building upon UEMR, GALA combines visual latent actions that capture scene‑level dynamics with geometric latent actions that capture shared fine‑grained end‑effector articulation, providing effective supervision for VLA pretraining from multi‑embodiment data, including action‑free ego‑centric human videos. Experiments on fine‑grained motion probing, cross‑embodiment retrieval, and downstream VLA evaluation demonstrate GALA's effectiveness in modeling generalizable fine‑grained motions across embodiments, achieving 68.3% RoboCasa‑GR1 success rate and 75.5% real‑world success rate. Code, appendix, and demos are available at https://puzhenyuan.github.io/GALA‑website/.
Authors:Bruno N. Y. Chen, Li Kang, Heng Zhou, Xiufeng Song, Zhemeng Zhang, Jiahua Ma, Yiran Qin
Abstract:
Multi‑agent manipulation naturally produces multiple task‑driven viewpoints: every arm carries a wrist camera and moves through the scene while acting. Yet these observations are typically underutilized, and active perception in manipulation is still often treated as requiring a dedicated sensing agent. We introduce MAAP (Multi‑Agent Active Perception), in which every arm is dual‑purpose: it executes manipulation actions and, through the wrist camera it carries, simultaneously serves as a moving viewpoint for the team. We pair this with RAIL (Role‑Aware Imitation Learning), a controller that predicts each arm's current role alongside its action chunk and conditions action generation on it, representing role‑dependent actions within one network. Across four simulated tasks, widening the perception regime lifts average success from 56.5% with a fixed camera to 62.5% with one active wrist view and 70.0% with all of them, while MAAP+RAIL reaches 79.2%. RAIL's additional gain is concentrated on the three‑arm Microwave task, where success rises from 47% to 82% on identical multi‑wrist inputs. On a dual‑arm platform, MAAP+RAIL succeeds in 14 of 20 placement trials compared with 0 of 20 for fixed‑view ACT. Collaborative manipulation can thus serve as an active perception mechanism in its own right.
Authors:Samia Mohinta, Pedro Gómez-Gálvez, Shi Yan Lee, Daniel Franco-Barranco, Michael Clayton, Stephan Preibisch, Jan Funke, Albert Cardona
Abstract:
The gold standard datasets for mapping connectomes are electron microscopy volumes of densely labeled neural tissue at nanometer resolution. Yet reconstructing and proofreading neuronal arbors and annotating all synapses requires pipelining multiple software tools that are often fragmented, inconsistently maintained, or proprietary, hindering reproducibility and automation. Here, we introduce Catena, an open‑source, comprehensive, developer‑centric software suite for connectomics that integrates modules for 3D neuron and organelle segmentation, synapse detection, microtubule tracking, and neurotransmitter inference. Catena organizes its modules in composable, chunk‑wise processing pipelines in a completely documented, extensible, and adaptable design. We further reduce compute and ground‑truth data requirements with pretrained machine learning models, facilitating fine‑tuning. Catena ships fully containerized modules that encapsulate evolving dependencies for consistent execution across workstations and clusters. By consolidating open components, shareable models, and containerized runtimes, Catena delivers a reproducible and scalable approach to mapping cellular connectomes from electron microscopy volumes. Code and documentation: https://github.com/Mohinta2892/catena.git
Authors:Sota Yuzaki, Temma Suzuki, Hiromi Tada, Masanori Konishi, Kento Kawaharazuka, Kei Okada
Abstract:
The performance improvement of high‑power flat BLDC motors has accelerated the development of dynamic robots. However, many commercially available servo motors assume operating voltages of 48 V or lower, which limits the maximum rotational speed. Dynamic robots require rapid energy generation, so this voltage constraint restricts motion performance. Therefore, driving motors beyond the rated voltage is desirable to increase the instantaneous maximum speed. On the other hand, semiconductor devices used in motor drivers have a trade‑off between voltage rating and current capacity. Conventional drivers using Si MOSFETs have difficulty achieving both high‑voltage and high‑current operation. Although GaN FETs are promising, compact drivers that can be mounted on the rear side of flat BLDC motors remain limited. In this study, a motor driver for high‑power flat BLDC motors using GaN FETs is developed. The effect of delay compensation in the high‑speed region beyond the rated operating range is also investigated. In the experiments, under 96 V operation, a continuous current of 30 A was achieved with a heat sink attached. A peak current of 80 A and a maximum electrical frequency of 3110 Hz were confirmed. A high‑speed load lifting experiment driven by a LiPo battery 24S (100 V) was also conducted, demonstrating applicability to dynamic robot operation.
Authors:Muhammet Sami Yavuz, Sabri Mustafa Kahya, Richard R. Chen, Jana Lipkova, Benedikt Wiestler
Abstract:
Multimodal survival models can combine complementary prognostic information from whole‑slide images and genomic profiles, but effective fusion remains challenging amid external cohort shift and computational complexity. To address these challenges, we propose MIST, multimodal survival prediction with genomic‑guided histology attention. MIST represents genomic features as tokens and allows them to query compact foundation‑model‑derived histology context tokens before survival prediction. This design enriches molecular information with histology context rather than merging separately encoded modalities only at the final stage. Training combines discrete‑time survival prediction with genomic feature masking, WSI dropout, and paired WSI‑genomics contrastive alignment. Across four external evaluations in colon, renal, lung, and glioblastoma cohorts, MIST improves external C‑index over standard fusion baselines in the primary comparisons. These results support genomic‑guided histology attention as a compact and effective strategy for multimodal oncology outcome prediction. Our code is available at https://github.com/samiyavuuz/MIST .
Authors:James Myles, Matthew Baugh, Johanna P. Müller, Bernhard Kainz, Yingzhen Li
Abstract:
Traditional unsupervised anomaly detection (UAD) methods are designed to flag or localise deviations from a normative distribution, ignoring the underlying generative mechanisms of the anomalies. Yet the nature of an anomaly is often as important as its presence. We reformulate UAD as a Bayesian inverse problem, in which the objective is to infer the most probable corruption responsible for each observation. Our framework yields a probabilistic anomaly score as the energy of the inferred corruption parameters, and serves as a principled recipe for developing new UAD algorithms. We derive several existing methods as instances of the general framework, each corresponding to the same energy score under different modelling choices. Experimentally, we study the framework's components in a controlled setting, and improve object‑class AUROC on the MVTec AD dataset by 2.3% by adapting the underlying corruption model. Finally, we validate the framework on a brain MRI benchmark, achieving strong detection performance while producing estimates of pathology intensity, bias, and geometry. Code is available at https://github.com/jgmyles/inverse‑uad.
Authors:Sichang Su, Benjamin Yang, Zhiyun Deng, Boyuan Liang, Yip Fun Yeung, Zelin Wang, Lingfeng Sun
Abstract:
A pretrained robot foundation policy may execute most of a long‑horizon task yet repeatedly fail at a few critical subtasks. Collecting additional full‑task demonstrations for supervised fine‑tuning (SFT) requires operators to repeat behaviors the policy already performs well. Reinforcement learning (RL) fine‑tuning offers a promising path to bridge this gap, but existing approaches struggle to solve long‑horizon tasks using only sparse rewards. We present PARTS (Policy Adaptation with RL on Targeted Subtasks), a real‑world subtask RL framework that concentrates practice at these bottlenecks while allowing training rollouts to proceed with minimal human intervention. The frozen pretrained policy supplies nominal actions throughout execution, while agent‑generated selectors and success verifiers activate residual corrections and provide local outcome rewards. These rewards support learning from successful subtasks even when complete‑task successes are scarce. Training combines online RL with success‑reweighted retraining, and each retrained residual policy is redeployed to collect further experience. Humans identify bottlenecks during setup and perform physical resets when needed. On bimanual YAM and single‑arm Franka tasks, PARTS improves complete‑task success from 32% to 61% and from 50% to 95%, respectively, using tens of minutes of real‑world RL rollouts per task on average. Compared with existing real‑world RL fine‑tuning methods, PARTS raises full‑task success by more than 25% under the same robot‑rollout budget while requiring less human involvement.
Authors:Xuanming Shang, Weijia Zhang, Chao Ma
Abstract:
3D object detection from LiDAR point clouds faces a fundamental dilemma: voxel‑based methods achieve efficiency at the cost of geometric quantization, while point‑based methods preserve fidelity but suffer from prohibitive computational bottlenecks. Specifically, point‑based architectures are crippled by slow downsampling strategies (e.g., FPS) and expensive dynamic neighbor queries (e.g., k‑NN) coupled with costly continuous interactions. To tackle these systemic inefficiencies, we propose PointLAM, a highly efficient and powerful point‑based architecture driven by two synergistic innovations. First, to resolve the downsampling bottleneck, we develop the Laplacian Point Sampler (LPS). LPS employs an implicit discrete Laplacian high‑pass filter and Doubly Sorted Sampling to achieve fast, structure‑aware foreground preservation. Second, to overcome local modeling latency, we design the Local Hadamard Aggregator (LHA). LHA decouples spatial indexing from feature representation using transient grids, and replaces complex continuous interactions with a Hadamard Gating mechanism for topology‑aware, attentive modulation. By coupling this local gating with Bi‑Directional Mamba (BDM) layers for global sequence modeling, we formulate the Local Attentive Mamba (LAM) block. Powered by this architecture, PointLAM achieves competitive performance on nuScenes and Waymo for point‑based detectors. It rivals highly optimized voxel competitors while requiring a fraction of the computational footprint, demonstrating marked superiority in detecting small instances and handling extreme sparsity. Project page: https://pointlam.github.io/.
Authors:Lobna Joualy, Eric Demeester, Nikolaos Tsiogkas
Abstract:
Vision‑language models (VLMs) can replace human annotators in preference‑based reward learning, but sequential API requests and single‑environment data collection make training slow and costly. We present RAPID (Reward learning with Adaptive Parallel Image Diversity), a system that couples GPU‑parallel rollout with data‑aware policy updates, single‑request preference labeling, automatic reward stabilization, and representative image sampling. We evaluate these components on five Franka Panda manipulation tasks in IsaacLab. Parallel rollout and adaptive updates provide the first substantial reduction in training time: under matched two‑stage prompting, mean runtime falls from 9.18 to 3.13 hours. With all RAPID components enabled, training completes in 1.15 hours using 896 rather than 19,840 API calls per run, and aggregate final success rises from 86.3% to 98.7%. This represents an 8.0× end‑to‑end speedup and a 95.5% reduction in API usage. An offline evaluation with Gemma~3 12B and GPT‑4.1 mini demonstrates that single‑request prompting reduces labeling latency and cost across both models. Code is available at: https://github.com/rapid‑vlm/rapid‑vlm‑rl.
Authors:Somang Lee, Sunkyung Park, Jinhee Yun, Seoki An, Dongjun Lee
Abstract:
We present CRISP (Contact‑RIch Simulation Platform), a high‑fidelity physics engine tailored for complex multi‑contact simulations such as tight‑tolerance robotic manipulation. Achieving high physical fidelity in robotic simulation requires both expressive modeling of geometry and contact interactions, as well as accurate numerical resolution via robust collision detection and contact solvers. However, existing simulators often either rely on limited support for geometric representations and simplified modeling of contact interactions, or employ numerical resolution methods whose accuracy or robustness is inherently constrained. Accordingly, we develop a new simulator that supports diverse geometric representations with accurate optimization‑based collision detection, and combines contact modeling with robust augmented Lagrangian‑based contact solvers. This integration enables efficient and consistent detection of contact information across complex geometries while accurately resolving multi‑contact constraints without problematic relaxations, which is essential for simulating contact‑intensive and sharp interactions. We validate the physical fidelity of our simulator against state‑of‑the‑art platforms and further demonstrate its capabilities through complex robotic manipulation scenarios. CRISP is publicly available at https://github.com/INRoL/crisp.
Authors:Tim Engelbracht, René Zurbrügg, Mayank Mittal, Marco Hutter, Marc Pollefeys, Hermann Blum, Zuria Bauer
Abstract:
Manipulating objects requires understanding not only their motion, but also the physical properties that determine it. For articulated objects, these include inertia, friction, and mechanisms such as springs or door closers, whose effects can vary with configuration and velocity. Such properties are not directly observable from appearance: visually identical doors may require very different effort to manipulate. Existing digital‑twin pipelines recover primarily kinematics or assign static physical parameters from visual and language priors, which can yield physically implausible estimates. As a result, state‑dependent mechanism dynamics remain unidentified and are not represented in standard asset formats. We present ForceTwin, a system for identifying physics‑informed digital twins of articulated objects from instrumented human interaction. A person probes an object using a handheld force‑sensing gripper, providing synchronized poses and interaction forces from which we estimate the articulation, parametric dynamics including inertia, Coulomb friction, viscous damping, and a structured neural residual capturing state‑dependent mechanism forces. ForceTwin nearly halves the inertial‑parameter error of a VLM prior. As a feedforward dynamics model for impedance control on a Spot and a Franka FR3, ForceTwin achieves 87% goal completion across nine object‑embodiment pairs, compared with 60% using VLM‑prior and 57% using kinematics‑only twins, with the largest gains on objects whose strong mechanisms cause both baselines to stall. We further use the identified twins to train whole‑body door‑traversal policies and deploy them in the real world. Project Page: https://timengelbracht.github.io/forcetwin‑website/
Authors:Rui Sun, Zhi Zheng, Zhenkun Wang, Zhichao Lu
Abstract:
Skills can improve the performance of Large Language Model (LLM) agents by providing task‑specific procedural guidance, while skill optimization further improves their effectiveness through iterative refinement. However, existing skill optimization methods typically represent skills as unstructured natural‑language instructions, creating two key challenges: 1) Unstructured skills often lack explicit workflow‑level guidance and contain substantial redundancy, making them difficult for LLMs to execute; 2) the vast search space of unconstrained natural‑language skills makes skill optimization ineffective. To address these challenges, we propose representing skills as graph‑structured natural‑language artifacts. In graph‑structured skills, each node represents an execution step together with its operational guidance, while directed edges encode context‑dependent transitions between steps. Compared to unstructured skills, graph‑structured skills can provide clear workflow‑level guidance. Moreover, the proposed graph‑structured skill can also facilitate skill optimization. Building on this structured representation, we introduce GraphSkillEvo, a population‑based evolutionary optimization framework with mutation and crossover operators for graph‑structured skills. By maintaining multiple candidate skills and combining effective components, GraphSkillEvo enables broader and more comprehensive exploration of the structured skill space than purely LLM‑based iterative self‑refinement. Extensive experiments across five agent benchmarks demonstrate that GraphSkillEvo consistently outperforms the strong skill optimization baseline SkillOpt, improving average accuracy by 4.01% on GPT‑5.4‑nano and 1.76% on GPT‑5.4. Our code is available at https://github.com/ruisun7/GraphSkillEvo.
Authors:Yifan Wang, Junyu Lu, Qifan Wang, Shun Zhang, Chaozhuo Li, Jiahao Liu, Zhijun Cao, Lingbin Bu, Fanliang Bu
Abstract:
Chinese social media has generated a vast and continually evolving lexicon of internet buzzwords whose meanings are often non‑literal and deeply rooted in local cultural and pragmatic contexts. Existing research has primarily focused on interpreting these buzzwords within Chinese, leaving largely unexplored whether LLMs can transfer such culturally grounded knowledge across languages and accurately convey the intended meanings in English. This cross‑lingual capability is also critical for safety, as harmful expressions may obscure their offensive content through culture‑specific homophony, euphemism, irony, or coded language. In this paper, we investigate the ability of advanced LLMs to understand Chinese internet buzzwords across languages. To this end, we introduce CIBuzzBench, the first benchmark for cross‑lingual Chinese‑to‑English understanding of Chinese internet buzzwords. CIBuzzBench comprises 3,001 Chinese internet buzzwords annotated with English meaning explanations, English equivalents, category labels, and harmfulness labels. Based on these annotations, we design three evaluation tasks: Meaning Explanation, Cross‑lingual Equivalent Matching, and Culturally Grounded Harmfulness Detection. We evaluate representative state‑of‑the‑art proprietary and Chinese LLMs under both English‑ and Chinese‑prompting settings. Our results show that LLMs continue to struggle with the cross‑lingual understanding of Chinese internet buzzwords, particularly in fine‑grained non‑literal interpretation, robust equivalent matching under option perturbations, and calibrated harmfulness detection. These findings highlight the persistent challenges posed by culturally grounded language phenomena for multilingual LLMs and safety‑oriented evaluation. The dataset and code are available at https://github.com/SuperYFan/CIBuzzBench.
Authors:Ishaan Mahajan, Charles Chen, Frederike Dümbgen, Brian Plancher
Abstract:
A robot can predict failure and still be unable to prevent it. By the time a safety mechanism reacts, the nominal plan may already have spent the control authority that recovery requires, and fixed task priorities may block whatever response remains. Our key insight is that both aspects are decided inside the controller. Recoverability must inform actions while they are chosen rather than veto them afterward, and task objectives must be adapted as recoverability shrinks. Building on this, we present RAYA, a hybrid learned‑analytic framework that places a learned finite‑horizon recoverability margin inside an optimal controller with hard constraints and pairs it with a bounded learned scheduler that shifts task weights to facilitate recovery. Across 7,200 simulation episodes per controller spanning quadrotor and autonomous‑vehicle benchmarks, RAYA not only improves survival rates, but also transfers the learned components zero‑shot to unseen trajectories, disturbances, plant shifts, and friction layouts. We developed an embedded realization of RAYA and deployed it on‑board a 35g Crazyflie quadrotor. Across 40 combined hardware flights under wind with either aerodynamic mismatch or an unmodeled 40% motor‑command loss, each of three baselines fails in all trials, while RAYA completes 10/10 six‑cycle missions. Project Website: https://raya‑control.github.io/.
Authors:Yunji Chu
Abstract:
Conversational speech depends on dialogue context and the listener's immediately preceding behavior. We propose ReACT‑TTS, a two‑stage framework that uses a one‑second pre‑response listener facial sequence to plan the next utterance's emotion and prosody before speech realization. On a strict dyadic MELD protocol, Temporal conditioning yields higher mean macro‑F1 and VAD concordance than Text‑only across ten seeds, while accuracy remains essentially unchanged. Ablations show that temporal modeling performs best among the visual variants and that an explicit early‑to‑late difference is unnecessary; correct listener reactions also outperform cyclic mismatches on average. In a contextual‑appropriateness study with 20 speech researchers, 76% of judgments prefer Temporal, 9% Text‑only, and 15% report no preference. We further connect the predicted response style to a Grad‑TTS backbone for end‑to‑end speech realization. Overall, the results support pre‑response listener dynamics as complementary cues for conversational response planning. The source code is available at https://github.com/CYJ1/ReACT‑TTS_public.
Authors:Wan Xu, Yuanfan Guo, Kevin Han, LaLa Chen, Wangmeng Zuo
Abstract:
Despite the remarkable progress in Multimodal Large Language Models (MLLMs), prevailing Chain‑of‑Thought (CoT) paradigms remain confined to the natural‑language expression space. Consequently, they inherently incur excessive linguistic overhead, leading to information dilution and weak visual grounding. To address this challenge, we propose Dense Reasoning Trace (DRT), a paradigm that departs from natural‑language‑centered CoT by expressing reasoning as compact structured traces, which include concise intermediate states with symbolic connectors and disentangle visual observations from logical deductions. First, we introduce the Dense Trace Initialization to internalize the DRT reasoning mode into the model, substantially improving token efficiency while preserving visual evidence. To further enable the model to faithfully capture the logical relations within traces, we propose the Trace‑Grounded Reinforcement Learning framework, which builds reference traces through a tri‑perspective verification pipeline and employs Trace‑Grounded GRPO with structured rewards, encouraging the model to generate concise DRT‑style traces with reduced hallucination and stronger logical grounding. Extensive experiments on challenging reasoning benchmarks show that DRT achieves 5.5× token efficiency improvement while improving 1.3 accuracy points over the Qwen3‑VL baseline. These findings suggest that complex multimodal reasoning may not require verbose natural‑language traces, opening a more efficient path for next‑generation MLLMs. Our code and data are available at: https://github.com/HIT‑leaderone/DRT
Authors:Camillo Carlo Pellizzari di San Girolamo, Francesco Tosoni
Abstract:
Software is a first‑class scientific object, yet validated links between source code and the scholarly record remain largely absent from the Linked Open Data (LOD) cloud, isolating archived artefacts from semantic discovery. This paper presents an end‑to‑end reconciliation pipeline that harvests, validates, and models publication‑to‑repository pairs from sources where the link between a paper and its source code is explicit and editorially verified: the software‑centric journals JOSS, SoftwareX, and IPOL, together with the reproducibility reports of the SIGMOD Availability and Reproducibility Initiative (ARI). This yields a curated corpus of 4,397 \langleDOI, repository‑URL\rangle pairs. We design two distinct application profiles grounded in Wikidata classes (one for scholarly articles, one for software instances) aligned with the schema.org and CodeMeta vocabularies. This architectural separation enables rule‑based reconciliation at two granularities: lightweight, inline publication references or standalone, first‑class Wikidata software nodes equipped with SWHIDs, Software Heritage's content‑addressed identifiers. A read‑only lookup against Wikidata shows that only 82 of the harvested repositories were already modelled there; human‑reviewed batches have since created 4,182 new software items cross‑linked to their articles. We further show that payloads of the emerging COAR Notify protocol, an external effort we do not develop, map natively onto our input format, so the same backend could later serve a live enrichment stream. Our core contribution is a pair of application profiles that turn Wikidata into a connector between the scholarly record and archived source code; we openly release all code, application profiles, and harvested datasets.
Authors:Muhammad Rehan, Moaz Amjad, Syed Danial Ahmed, Mariam Adnan, Haider Ali
Abstract:
Automatic tooth segmentation and FDI numbering on panoramic radiographs underpins computer‑assisted dental diagnosis, yet which factors govern performance remains unclear. We assemble a corpus of 1,422 panoramic radiographs containing 42,142 expert‑delineated tooth polygons across the 32‑class FDI taxonomy, annotated by 30 dental practitioners and independently reviewed by two others, and use it to isolate input resolution, architecture and anatomical priors under a single evaluation protocol. First, resolution dominates: across a controlled 640/1024/1280 ablation, mask mAP50‑95 rises 0.656 ‑> 0.710 ‑> 0.717 while mAP50 stays flat at ~0.982. Both gains are significant under a paired bootstrap over images (p < 0.001, p = 0.024); neither mAP50 change is distinguishable from zero. Added resolution buys boundary precision, not detection. Second, architecture is nearly irrelevant in‑domain: a query‑based transformer with 2.1x the parameters is statistically equivalent to a one‑stage detector (95% CI [‑0.0064, +0.0064]), only marginally better under domain shift, 5.5x slower on CPU and not executable under standard ONNX runtimes. Third, three targeted interventions fail: a LoRA‑adapted self‑supervised encoder underperforms, a promptable foundation segmenter degrades masks by 39%, and globally optimal anatomical label assignment yields +0.0007 despite correcting a constraint violated in 40% of out‑of‑domain predictions. Zero‑shot transfer to an independent multi‑centre cohort, verified overlap‑free, costs 62% of mask mAP50‑95 but only 18% of mAP50, reproducing the dissociation. Decomposing masks along the tooth axis localises the residual error to the apical third. Boundary precision is therefore the binding constraint, and effort is better directed at resolution and acquisition diversity than at architectural novelty.
Authors:Syed Ali Ahmed, Malaika Raza, Muhammad Shoaib Siddiqui, Muhammad Rafi
Abstract:
Fraudulent job posting detection aims to identify job advertisements that are corrupted either through fake content, misleading information, or negative intent, disrupting the online eco‑system of job‑seekers and employers. Existing studies in this domain lack effective methods to simultaneously achieve high accuracy and meaningful structure of latent‑space representations that capture subtleties among fake posts. To this end, we propose Centroid‑Guided Contrastive Loss (CGCL), a loss function which unifies classification with densely formulated clustering to consistently reshape latent‑space through a centroid‑driven top‑k push‑and‑pull mechanism. The complementary nature of CGCL enables the model to enforce accurate decision boundaries and maintain high clustering compactness, effectively capturing both class separability and latent structure. Extensive experiments demonstrate the state‑of‑the‑art (SOTA) performance of our method on EMSCAD, a public benchmark dataset. The code associated with this work is available at: https://github.com/ali‑ahmed925/CGCL_code
Authors:Yuyan Guan, Haoran Zhang, Zian Mao, Antong Yang, Caifei Li, Jialong Wang, Chuying Ouyang, Hong Wang, Xiaoqin Zeng, Yujun Xie
Abstract:
Four‑dimensional scanning transmission electron microscopy (4D‑STEM) records a two‑dimensional diffraction pattern at each electron‑probe position, yielding spatially resolved reciprocal‑space information but large, heterogeneous data volumes. Here we describe 4D‑ImageNet, a collection of 174,000 diffraction patterns comprising 145,000 experimental patterns selected from 29 acquisitions and 29,000 multislice simulations. The experimental data cover acquisition‑level labels for Ag, Au, mixed Au‑Ag, CoO, Pd and ZnO specimens across multiple fields of view, scan dimensions, camera lengths and exposure times. Each acquisition contributes 5,000 quality‑ranked patterns with source scan coordinates and acquisition metadata. A set‑prediction detector provides model‑derived pseudo‑labels for the direct‑beam position and Bragg‑disk centres, with a confidence score for each disk. The simulation data cover 13 crystal structures and include Euler rotations, reciprocal‑space sampling and approximate low‑index beam directions. A grouped mixed‑domain masked‑reconstruction benchmark is provided to assess leakage‑resistant loading and evaluation across experimental and simulated data. The dataset is intended for representation learning, disk detection, diffraction‑pattern retrieval, orientation analysis and simulation‑to‑experiment studies.
Authors:Pinxin Liu, Haiyang Liu, Jiahao Luo, Junhua Huang, Chunhao Zou, Luchuan Song
Abstract:
Generating natural co‑speech gestures from streaming speech is essential for embodied conversational agents, where motion must be produced while a user is still speaking. Recent streaming gesture systems make online generation possible by autoregressing over discrete motion tokens, but this design compresses high‑dimensional continuous motion into finite codebooks and can limit the realism and diversity of generated gestures. To preserve both causality and continuous expressiveness, we propose GestureFAR, a flow‑autoregressive framework for streaming co‑speech gesture generation. First, GestureFAR autoregresses over causal continuous motion latents, using a transformer to model streaming audio‑motion context and a per‑token flow‑matching head to sample the next latent from a continuous distribution. Second, we introduce a head‑only flow distillation strategy that freezes the causal backbone and distills the multi‑step per‑token flow head into a single network evaluation using consistency and distribution‑matching objectives. This keeps the model token‑causal while removing the main latency bottleneck for live interaction. Experiments on BEAT2 show that GestureFAR significantly improves the quality‑‑latency trade‑off among streaming‑capable methods, preserving strong gesture quality while enabling real‑time token‑causal generation. Project Page: https://andypinxinliu.github.io/GestureFAR
Authors:Guofei Pang
Abstract:
Fractional partial differential equations couple a memory‑dependent time derivative with a nonlocal fractional Laplacian, and their repeated solution under varying fractional orders, initial data, or diffusivity fields is computationally expensive. Neural operators offer a fast surrogate, but standard architectures must relearn the dominant linear fractional evolution from data. We propose the \emphFractional Fourier Neural Operator (FrFNO), a resolution‑robust conditional operator. It injects the analytic Mittag‑‑Leffler response of the frozen linear part as a once‑precomputed, resolution‑independent propagator table, and trains a spectral convolutional network only on the residual induced by variable coefficients and nonlinear advection, conditioned continuously on both fractional orders. The central theoretical result is that under zero‑shot super‑resolution the injected propagator fills the out‑of‑band modes that a standard Fourier neural operator sets to zero, replacing the out‑of‑band full‑field tail by the smaller residual tail (a K‑independent constant‑factor reduction under weak perturbation). The residual and the full solution carry the same Sobolev order, so the advantage is amplitude reduction rather than a steeper tail. Mesh refinement drives the error to a residual‑controlled floor. On a nonlinear two‑dimensional space‑‑time fractional Burgers problem FrFNO achieves the lowest relative L^2 error among six baselines (FNO, PINO, PDNO, CNO, DeepONet, U‑Net) at the training resolution and under zero‑shot super‑resolution, yields the smallest spectral phase error, and remains the best at the integer‑order limit and for long integration windows. The same construction extends to coupled fractional systems such as fractional Allen‑Cahn and Navier‑‑Stokes equations. Code, training scripts, and reference outputs are available at https://github.com/Derek2021Pang/FrFNO.
Authors:Tianchen Deng, Guole Shen, Yilin Shen, Wenhua Wu, Yilin Fang, Ziqi Ma, Tianjun Zhang, Shenghai Yuan, Wolfram Burgard, Hesheng Wang
Abstract:
Recent 3D foundation models enable generalizable geometric reasoning from RGB images but remain limited in persistent memory, scalability, and renderable scene modeling. We present a memory‑centric 3D foundation model for scalable robotic localization, reconstruction, and Gaussian rendering. Its core is an adaptive world memory mechanism that combines transformer‑based gated updates with test‑time temporal‑spatial regulation. Learned gates control recurrent memory propagation, while temporal state evolution and spatial observation‑state consistency regulate token‑wise updates and forgetting over long image sequences. To support large‑scale mapping, we organize memory into local submaps and integrate progressive mapping and tracking, loop closure, and SL(4)‑based global refinement to maintain local accuracy and global consistency. A Gaussian reconstruction head decodes memory‑enhanced features into renderable primitives, unifying camera pose estimation, dense point‑cloud reconstruction, and photorealistic rendering within a single model. Experiments on public benchmarks and self‑collected datasets from diverse robotic platforms demonstrate improved trajectory accuracy, reconstruction completeness, and rendering quality over existing 3D foundation reconstruction and SLAM baselines. These results support adaptive memory as a foundation for persistent robotic world modeling. The dataset and code will be made publicly available at \hrefhttps://github.com/dtc111111/AWM‑3DFMhttps://github.com/dtc111111/AWM‑3DFM.
Authors:Xiao Wang, Heng Zhang, Gokhan Solak, Fei Zhao, Arash Ajoudani
Abstract:
Effective physical interaction control in robotic manipulation requires not only kinematically feasible motion but also sufficient force‑interaction capability. Existing redundancy resolution methods often ignore task‑specific force demands or maximize the force capability indiscriminately, sacrificing dexterity when large force margins are unnecessary. We propose a task‑oriented force capability optimization framework for redundant mobile manipulators. A Vision‑Language Model (VLM) infers object physical properties from an RGB image and a task description, generating a desired task‑force sequence that captures gravitational and inertial demands. We then define a task‑oriented force capability metric as the signed distance between a task‑force uncertainty ball and the dynamic residual force polytope (RFP), quantifying compatibility between task demands and the robot's remaining actuation capacity. This metric is incorporated, alongside manipulability, joint‑limit avoidance, trajectory smoothness, and base‑oscillation suppression, into a whole‑body multi‑objective trajectory‑optimization problem. Experiments on a mobile manipulator performing lifting and single‑point‑holding tasks under varying payload conditions demonstrate that the proposed method provides sufficient force capability for heavy loads while preserving high manipulability for light loads. This yields a task‑adaptive balance that fixed capability‑maximizing baselines (RFP inscribed radius, RFP cone) and manipulability‑only optimization fail to achieve. The core implementation is publicly available at https://github.com/yeying256/FORTE.
Authors:Alexey Bryncev, Andrey Moskalenko, Kira Shilovskaya, Ivan Kosmynin, Dmitriy Vatolin
Abstract:
Omnidirectional video saliency prediction plays an important role in many immersive multimedia applications, including viewport‑adaptive streaming and compression, foveated rendering, mesh simplification, perceptual quality assessment. Yet progress in this area remains constrained by the cost and complexity of collecting eye‑tracking data with VR headsets, which makes large‑scale dataset creation difficult to extend. We present OpenSAL360, the first open‑source platform for scalable, low‑cost 360° video saliency collection. Unlike conventional VR‑based protocols, it requires only a standard screen, mouse, and internet connection, enabling parallel saliency data collection from common crowdsourcing assessors without specialized hardware. We validate our collection protocol against seven well‑established VR eye‑tracking datasets and conduct ablation studies on key interface, pre‑, and post‑processing parameters. To demonstrate the effectiveness and scalability of the proposed methodology, we collect and publicly release a saliency dataset covering 500 omnidirectional videos annotated by 2,000+ crowdsourcing assessors, making it, to the best of our knowledge, the largest dataset in this field. We make OpenSAL360 publicly available at https://github.com/msu‑video‑group/OpenSAL360.
Authors:Jiaxi Yin, Ge Wang, Han Ding, Fei Wang
Abstract:
Temporal action localization (TAL) in wearable sensor streams identifies action classes and temporal boundaries, enabling finer‑grained activity understanding than conventional action recognition. However, training typically requires costly start‑‑end annotations for every action instance. To reduce this burden, we study point‑supervised TAL, where each instance is labeled with only one timestamp and its class. We propose Progressive Sensor Event Expansion (PSEE), which combines semantic activations, sensor‑specific transition evidence, and adaptive temporal ownership to recover point‑supervised pseudo segments. These segments supervise standard TAL detectors without modifying their inference procedures. Cross‑subject experiments on four inertial‑sensing benchmarks demonstrate improved pseudo‑boundary quality over adapted point‑supervised baselines, compatibility with different TAL detectors, and robustness to point sampling. Code is available at https://github.com/joeeeeyin/PSEE.
Authors:Haoran Qin, Renlong Wu, Tianyu Huang, Yukang Ding, Hui Li, Wangmeng Zuo
Abstract:
While diffusion‑based text‑to‑video (T2V) models have demonstrated impressive capability in generating realistic and temporally coherent videos, they often fail to respect fundamental physical dynamics. Although recent physics‑constrained methods incorporate explicit dynamics priors to improve physical plausibility, they remain limited to simple single‑type motions, depend on manually specified parameters, and struggle to generalize to unseen physical laws. In this work, we propose CompAdapt, a physics‑consistent T2V framework for adaptable generation across complex real‑world scenarios. It extends neural dynamics modeling beyond single‑type motions to encompass composite physical behaviors, including coupled motions, multi‑stage transitions, and multi‑object collisions. Furthermore, CompAdapt translates natural language prompts into structured physical semantics, enabling end‑to‑end specification of motion types, temporal relations, and initial physical parameters. To generalize to novel physical environments, CompAdapt introduces dynamics‑aware prior matching, achieving one‑shot adaptation without retraining the core dynamics module. In addition, a physics‑aware latent feature fusion module improves visual fidelity under fast and complex motion. Experiments on physics‑focused T2V benchmarks demonstrate that CompAdapt improves physical consistency over both general T2V models and physics‑constrained baselines, while preserving high visual quality and adaptability to unseen dynamics. The project page is available at https://makapic.github.io/CompAdapt/ .
Authors:Zhibo Zhang, Qijie Wang, Zengqiang Yan
Abstract:
Surgical instrument segmentation (SIS) plays a critical role in robotic assistance and surgical workflow analysis. However, most existing SIS methods formulate segmentation as a category‑driven localization problem, limiting their ability to capture procedural context and task‑dependent semantics in surgical workflows. We introduce Reasoning‑Aware Surgical Instrument Segmentation (RA‑SIS), a task formulation that frames segmentation as query‑conditioned inference under surgical context. To benchmark this setting, we construct SurgRS, a surgical reasoning segmentation dataset consisting of 41,000 image‑text pairs, which aligns instance‑level masks with structured query‑answer supervision to enable semantic grounding at the pixel level. Based on SurgRS, we propose Surgical Instrument Reasoning and Segmentation Assistant (SIRA), a multimodal framework that disentangles target‑level and query‑level semantics and integrates them with visual features through query‑anchored dual alignment. By aligning query semantics with spatial features and segmentation prompts, SIRA enhances semantic‑visual consistency in mask prediction. Extensive experiments on SurgRS demonstrate improvements over existing reasoning‑aware baselines. Code is available at https://github.com/linxir226/SIRA.
Authors:Adam Lilja, Fabio Hübel, Siming He, Junsheng Fu, Claire Tomlin, Lars Hammarstrand, Jitendra Malik, Jonas Frey, Marco Pavone
Abstract:
Open‑vocabulary 3D scene mapping aims to build a persistent representation of the objects in an environment. Existing systems typically rely on engineered mapping pipelines to associate observations, merge information across views, and maintain a consistent scene representation over time. Many additionally store feature‑rich object representations, such as embeddings or image crops, increasing the size and complexity of the persistent memory. We introduce SceneLM, a Scene‑Language Model that directly maintains a textual scene map. The full scene is represented as a structured text list of objects, which serves as the model's only persistent memory. For each input image, the model reads the current scene state and updates the map by adding, editing, and removing objects. To learn this behavior, we introduce supervision tasks for iterative scene map maintenance together with an automatic annotation pipeline that generates training data from images without human labels. We evaluate SceneLM on both a language‑grounded retrieval benchmark and a localization benchmark. Across both benchmarks, the model produces a scene map that achieves competitive performance with complete mapping systems built from dedicated perception and geometric modules while producing a scene representation that is 6‑12x more compact. We further show that SceneLM can be run online on an edge device through experiments on a quadruped. These results show that a persistent open‑vocabulary 3D scene map can be maintained directly by a single vision‑language model using only a lightweight text representation. Training and inference code is available on https://goldengait.github.io/scenelm/.
Authors:Seoyeon An, Hyeonseo Jang, Minsu Kim, Chanho Lee, Younghan Park, Kangwook Lee
Abstract:
Comprehensive video understanding is crucial for advancing artificial intelligence toward the intricate dynamics of the physical world. While recent advances in Multimodal Large Language Models (MLLMs) have demonstrated remarkable capabilities in video understanding, existing benchmarks remain confined to simple scene‑level queries or global summaries that require only single‑step inference. Real‑world video understanding involves more challenging tasks that require multi‑hop multimodal reasoning, and there is a critical absence of video benchmarks equipped to rigorously evaluate these agentic capabilities. To bridge this gap, we introduce AgentVidBench, a multi‑hop video question answering benchmark focused on evaluating the spatial, temporal, and causal reasoning capabilities of MLLM agents. Beyond standard question‑answer pairs, AgentVidBench provides step‑by‑step solution traces to support trajectory evaluation that assesses whether agents explicitly acquire the evidence needed to justify their answers. Experiments with 12 proprietary and open‑source MLLMs show that single‑turn performance remains limited on AgentVidBench, while integrating these models into state‑of‑the‑art agentic workflows generally improves performance with respect to both accuracy and trajectory scores. We further present a simple yet effective agentic strategy that serves as a competitive baseline on AgentVidBench, establishing our benchmark as a holistic testbed for future research on agentic video understanding. Code and datasets are available at https://github.com/krafton‑ai/agentvidbench and https://huggingface.co/datasets/agentvidbench/agentvidbench.
Authors:Chang Gao, Zhuo Chen, Suhang Xia, Jihong Zhu, Jiankang Deng, Shan Luo
Abstract:
Robotic fabric comparison needs to actively combine visual appearance and tactile cues. Here, we present AVT‑Fabric, an RGB‑first framework that allocates tactile evidence according to the difficulty of each comparison. A dual‑scale gate evaluates answer‑token confidence and raw logit separation to determine whether another force‑tagged GelSight observation is needed. Compact textual memory preserves the executed history, and majority voting consolidates the selected predictions. On 400 held‑out comparisons, AVT‑Fabric achieves 98.0% accuracy with a compact 7B Multimodal Large Language Model (MLLM), surpassing the 94.0% reported by the 90B MLLM‑Fabric baseline by 4.0 percentage points while processing only 1.60 of five available stages on average. It improves on matched passive inference by 9.25 percentage points and reduces model‑side latency by 61.8%, while also improving on RGB‑only accuracy. Four additional MLLM backbones support the generalizability, accuracy, and efficiency of the framework. This framework is also deployed on a real robotic system, achieving 78.1% pairwise ranking accuracy and correct fabric selection in seven of eight application scenarios. AVT‑Fabric demonstrates that adaptive evidence selection can improve both the accuracy and efficiency of robotic visuo‑tactile reasoning.
Authors:Xiangfei Guo, Hao Shi, Yufan Zhang, Zhonghua Yi, Yongqi Mao, Xiaoting Yin, Kaiwei Wang
Abstract:
Recent progress in 3D Gaussian Splatting (3DGS) has enabled dense visual SLAM with pinhole cameras, yet most pipelines are not designed for panoramic imagery. We present Cube‑Splat, the first panoramic GS‑SLAM framework that factorizes each 360° frame into a cubemap of four fixed‑orientation virtual pinhole views sharing a single optical center. By designating the front face as the primary pose state, we accumulate gradients from all faces via an adjoint mapping, thereby enabling multi‑face observations to coherently update a single state while strictly preserving cross‑view geometric consistency. Concurrently, our mapping module densifies and optimizes anisotropic Gaussians using aggregated cubemap rays for high‑fidelity, dense reconstruction. Furthermore, to rigorously evaluate panoramic SLAM under diverse and challenging conditions, we introduce SynPano, a highly scalable, photorealistic synthetic dataset featuring parameterized complex trajectories and multi‑modal ground truth. Extensive evaluations on two public benchmarks (PALVIO and OmniBlender) and our SynPano dataset, collectively encompassing both indoor and outdoor scenes, demonstrate that Cube‑Splat achieves state‑of‑the‑art (SOTA) performance in tracking accuracy and reconstruction fidelity. Both the source code and the SynPano dataset are available at https://github.com/guoxf304/CubeSplat.
Authors:Ran Cheng, Longfei Xu, Zheng Liu, Kaikui Liu, Xiangxiang Chu
Abstract:
Mixture‑of‑Experts (MoE) scales capacity, but existing designs cannot set three quantities independently. For a single token, participation is how many experts contribute knowledge to its output, execution is how many are actually computed (compute cost), and materialization is how many expert‑sized parameter sets must be built and stored (memory cost). Sparse routing keeps execution and materialization low, but shrinks participation: for each token, only a few experts contribute. Dense output‑mixing restores full participation, but its execution grows with the number of experts. Parameter‑merging keeps execution at one expert, but its materialization grows with the number of routing decisions. We propose IntBMoE, a block‑conditioned MoE that decouples all three by pairing dense expert composition with sparse block execution. Its blocks come from a small learned codebook, one per entry. At each internal layer, a lightweight hypernetwork merges all expert bases in that layer's pool into one composed expert. Participation is full, because every composed expert draws on the entire pool. Execution stays sparse, because a router sends each token to only a few blocks. Materialization is bounded, because the codebook, not the input, fixes how many blocks exist. Dual‑Path Residual Gating (DPRG) further couples two independently composed paths through multiplicative gating. Experiments on image classification show consistent gains over representative sparse and dense MoE baselines. Additional experiments on language modeling and sequential recommendation validate its generalization beyond vision. IntBMoE is fully deployed in AMap's generative recommendation system, serving hundreds of millions of users under a 60ms latency budget, with a 2.4% relative UVCTR gain in online A/B testing. Our code is available at https://github.com/AMAP‑ML/DreamX‑Rec/.
Authors:Songyue Cai, Shan Gu, Wei Chen, Ziru Xu, Lianyu Wang, Jian Xu, Xiaofeng Zhu
Abstract:
Auto‑bidding is a key component of modern advertising systems that provides a personalized bidding strategy for each advertiser. By characterizing each individual, profile‑based methods achieve personalization and have proven effective in domains such as recommendation. However, despite the diverse bidding behavior of advertisers, their application to auto‑bidding remains limited. A primary reason is that constructing and leveraging advertiser profiles face several challenges: extracting pure profiles is non‑trivial, modeling common and private information simultaneously is difficult, and profile updating and cold‑start adaptation remain challenging. To tackle these issues, we propose ADAPT, an \underlineAuto‑bidding framework with \underlineDisentangled \underlineAdvertiser \underlineProfiles and \underlineTraining‑free adaptation. ADAPT introduces a two‑stage training paradigm and supports training‑free adaptation. Specifically, (i) the stage 1 extracts pure static and dynamic profiles via contrastive learning over the advertiser memory bank; (ii) the stage 2 disentangles the dynamic profile into a common profile and a private profile, and combines them with the static profile to jointly condition the bidding strategy; (iii) once trained, ADAPT constructs profiles for new advertisers and updates profiles of existing advertisers without retraining. Our experiments on a large‑scale auto‑bidding benchmark demonstrate that ADAPT consistently achieves superior performance, and ablation studies further validate the effectiveness of each module. The source code will be released at https://github.com/YuzunoKawori/ADAPT.
Authors:Jiale Zhang, Michael Larionov, Zichong Wang, Zhipeng Yin, Wenbin Zhang
Abstract:
Fairness research on language models involves measuring bias, applying mitigation methods, and examining the evidence on which an evaluation rests. Existing tools offer complementary functionality through different interfaces, so combining them requires reconciling model interfaces, evidence formats, access constraints, and result types before applicability can be checked or methods compared. We introduce FairLMs, a Python library that connects these activities through explicit declarations of model capabilities and input requirements. It provides 33 intrinsic and extrinsic metrics, 14 mitigation components spanning four intervention categories, 14 dataset and scoring‑instrument diagnostics, adapters for the three Transformer architectures and supported hosted completion APIs, and benchmark loaders. Declarations are checked before execution and results carry the configuration under which they were obtained, so that compatible components can be combined, methods compared under a common protocol, and workflows extended to new models and datasets. The source code is available at: https://github.com/FairLMs/FairLMs.
Authors:Xiuhui Zhang, Yi Chen, Shusheng Xu, Fan Li, Huan Wang, Tongkai Yang, Binhang Yuan
Abstract:
Autonomous software generation (ASG) aims to turn human requirements into executable applications, but delivering these applications does not necessarily establish that their interacting components satisfy the specified behavioral requirements. We introduce GameASG‑Bench, a benchmark that makes behavioral testability part of the generation task for game development. Our design declares an evaluation interface specification before generation, fixing legal starting scenarios, player‑level actions, stable snapshots, rejection behavior, and invariants while leaving private implementations open. Concretely, we include: (i) static L1 checks that assess source‑level compliance; and (ii) browser‑executed L2 checks that combine semantic observations with real input and runtime evidence. We implement this protocol as 47 browser‑native game‑generation tasks spanning 12 primary genres and both 2D and 3D interaction, each with executable checks and an independently verified reference implementation. Our experiments answer four key questions about end‑to‑end agent performance, tool access and nominal turn budget, reasoning effort, and harness choice. Across nine agent stacks, the highest observed mean L2 check pass rate is 93.2%, yet the highest observed strict task success rate, requiring all L1 and applicable L2 prerequisite and core requirement checks, is only 55.3% (26/47 tasks). For DeepSeek‑V4‑Flash, full tool access and larger nominal turn budgets yield more strict task successes, while the strict task success rate is not monotonic in reasoning effort. Both tested harnesses achieve 18 strict task successes, but only ten tasks succeed under both. These results expose task‑level compliance gaps that high average check pass rates actually obscure.
Authors:Chao Li, Yingying Yu, Yunfeng Li
Abstract:
A panel's human‑equivalent size is target‑specific. Matching a fixed 32‑judge panel to empirical human label distributions on three ChaosNLI tasks yields two distinct effective sizes: distributional‑error matching gives ν_\mathrmMSE=2.304, 3.750, and 3.445, whereas spectral matching gives ν_H=4.242, 6.459, and 6.499, a gap of 1.72‑‑1.89×; a binary‑error diagnostic credits the same panels with only 1.971‑‑2.227 effective votes. Extrapolating the distributional‑error curve at fixed squared mean residual, mean member variance, and normalized mean covariance gives asymptotes of 2.392, 3.990, and 3.655, with 32 judges already reaching 94.0‑‑96.3%. An exact spectral identity explains the gap: error depends on member energy and on the orientation of residual variation relative to averaging, information that the participation ratio (PR) discards. A realizable hard‑label construction confirms that higher spectral diversity can coexist with worse distribution recovery even under equal member energies and nonnegative correlations, and the consensus direction retains γ_\mathrmco=43.8%, 33.7%, and 35.9% of centered residual variance. An external check on CC‑1000, a 1,000‑item Civil Comments subset with a different panel, gives ν_H=2.84. For panel choice, we establish an existence result and one feasible path: exhaustive enumeration at k\in\5,7\ shows that panels beating the accuracy‑top‑k baseline on both accuracy and ν_H always exist, and greedily swapping at most two members reaches 24.8‑‑56.0% higher ν_H at 0.10‑‑1.10 percentage points higher accuracy. Our dataset and code are available at https://github.com/Chao1208/32judges‑votes.
Authors:Chongbo Zhao, Jiangming Wang, Xilai Wang, Xinyu Wang, Jingyi Tang, Chunjie Hao, Pengjie Song, Yue Ma
Abstract:
Text‑guided video editing modifies target content while preserving the appearance and temporal coherence of unedited regions. Training‑based approaches provide strong control but demand substantial data and computation. Training‑free methods fall into inversion‑free and inversion‑based paradigms. Inversion‑free approaches avoid trajectory recovery, but their source‑preserving guidance can limit editing strength and leave semantic changes incomplete. Inversion‑based approaches recover a latent trajectory before regeneration, where approximation errors can accumulate and cause source‑content drift and temporal inconsistency. We introduce Edit‑VAR, the first training‑free and inversion‑free framework for text‑guided video editing with a pretrained visual autoregressive video model. Edit‑VAR directly encodes the source video into multi‑scale discrete tokens and performs probability‑guided conditional token replacement for source preservation. Attention‑guided token‑wise and scale‑aware modulation selectively relaxes source constraints over edit‑relevant positions and generation stages. Scale‑Decoupled Generation, implemented as late‑scale constraint release, regenerates motion‑consistent details and reduces texture fragmentation. Residual‑guided token pruning further exploits redundancy at the final two high‑resolution scales to reduce inference cost. Extensive experiments and a blind user study demonstrate that Edit‑VAR outperforms existing training‑free video editing methods overall in editing fidelity, source preservation, temporal coherence, and inference efficiency.
Authors:Zhiyuan Gao, Yanxiang Zhan, Mohammad Khoshnazar, Jeroen Schäfer, Michael Beetz
Abstract:
Learning robot manipulation policies typically requires substantial demonstration data, which are costly to collect on real robots. Recent methods generate robot demonstrations from human videos by adapting recovered motion and validating the resulting trajectories in simulation. However, methods centered on motion‑reference adaptation can limit behavioral diversity by retaining the demonstrated contact strategies and subtask orders, while insufficient understanding of task requirements and scene relations can reduce demonstration generation efficiency by generating invalid candidates. To address these limitations, we propose KnowDemo, a framework that uses structured manipulation knowledge from human videos to generate diverse robot demonstrations for a target workspace. To distinguish task requirements from demonstration‑specific choices, we develop a knowledge extraction and reasoning module based on a vision‑language model (VLM) that associates object and action descriptions with inferred task conditions, demonstration references, and permissible execution variations. To translate this knowledge into executable demonstrations, we resolve the descriptions against target‑scene entities and geometry to guide candidate generation and screening before motion planning and simulation. The resulting demonstrations exhibit multimodal behavior through alternative contact strategies and valid subtask orders, with structured execution labels. Experiments demonstrate additional verified execution modes beyond a reference‑only configuration and improved candidate planning success through task‑guided grasp sampling. To validate the generated data for policy learning, we fine‑tune the pretrained π_0.5 model on simulation data, achieving sim‑to‑real transfer across three tasks. Project page: https://zhiyuan‑gao.github.io/knowdemo/
Authors:Zhiyuan Gao, Di Wen, Yanxiang Zhan, Mohammad Khoshnazar, Jeroen Schäfer, Kunyu Peng, Michael Beetz
Abstract:
Vision‑language‑action (VLA) models built on pretrained vision‑language models have demonstrated strong performance across diverse robotic manipulation tasks. However, VLA models that directly map current 2D observations to actions often lack sufficient spatial and temporal understanding, limiting their performance in precise and long‑horizon manipulation. Recent methods enhance VLA models through geometric supervision and future‑state prediction across the entire scene. However, these methods can suffer from redundant scene information, distracting the model from learning the geometry and dynamics relevant to the current interaction. To address this issue, we propose FOCAL‑VLA, a framework that combines subtask‑guided geometry distillation with implicit world modeling to learn representations of current spatial structure and future interaction dynamics. To focus geometric learning on the current subtask, we transfer geometric knowledge from VGGT to the VLA model by aligning geometry latents with features from subtask‑relevant image regions. To capture the future 3D evolution of the current interaction, we incorporate implicit world modeling using Track4World features from current and future demonstration frames. The two complementary representations jointly guide action generation without running VGGT or Track4World at inference time. Experiments show that FOCAL‑VLA outperforms baselines on both simulation benchmarks and real‑world manipulation tasks. Project website: https://zhiyuan‑gao.github.io/FOCAL‑VLA/.
Authors:Wenhan Yu, Wenxin Wu, Hao Wang, Lei Sha
Abstract:
Factual hallucination is commonly defined by incorrect factual outputs. We study a paraphrase‑induced hallucination setting, where a model answers a factual question correctly in its original form but generates an incorrect answer under a semantically equivalent paraphrase. Such inconsistencies expose latent factual instability under semantic invariance. However, general‑purpose paraphrases are often insufficient as robustness‑oriented supervision: near‑copy paraphrases provide weak signals, while overly diverse paraphrases may break semantic equivalence. In this paper, we propose HALLUCINATION‑R1, a robustness‑oriented paraphrase generation framework that learns to produce semantically faithful yet robustness‑challenging paraphrases for factual consistency. Through two‑stage optimization, it first stabilizes meaning‑preserving and diverse paraphrasing, then rewards paraphrases that reveal factual consistency degradation in downstream QA models. Experiments on SimpleQuestions, PopQA, and TruthfulQA show that HALLUCINATION‑R1 achieves a strong consistency‑‑diversity trade‑off and exposes robustness failures across multiple model families and datasets. Further analyses indicate that these failures are not reducible to surface‑level artifacts or semantic drift, but reveal non‑trivial factual instability under meaning‑preserving variation. A lightweight fine‑tuning study also shows that HALLUCINATION‑R1‑generated data improves robust accuracy under paraphrase variations, suggesting its utility for robustness‑oriented training. Our code and models are publicly available at https://github.com/yuwenhan07/Hallucination‑R1.
Authors:Adam D. Hines, Michael Milford, Tobias Fischer
Abstract:
Robot localization is an ongoing challenge that demands mapping and positioning systems that are tolerant to viewpoint change. Event cameras are attracting increasing interest and adoption in robotics; however, dealing with viewpoint variance is an under‑investigated problem in existing event‑based localizers. In addition, event‑based datasets that emphasize viewpoint variance for challenging localization situations are scarce. Here, we introduce an event‑based visual place recognition (VPR) system that performs robustly under viewpoint changes. We converted five large‑scale geo‑tagged datasets, conventionally used to train frame‑based localization systems, into synthetic event streams using Image‑to‑Event (I2E) conversion, and used them to fine‑tune a pre‑trained event‑based vision transformer backbone with a multi‑loss function, yielding a system we call MegaEvent that learns viewpoint‑robust features for place recognition. We achieved an average Recall@1 of 82% across three existing event‑based localization datasets, leading the next best event‑based method by 20 recall points, and frame‑based VPR models applied directly to event frames by 8 to 26 recall points. We introduce a new, challenging dataset ‑ Springfield‑Event‑VPR ‑ which features a 3.7km walking route recorded in three camera orientations for a total of 11.1km, which MegaEvent outperforms the strongest baseline by 9 recall points. The code for MegaEvent is available at https://github.com/AdamDHines/megaevent.
Authors:Di Wen, Jimmy Weissert, Luc Maria Scherrer, Cedric Zöllner, Kailun Yang, Ruiping Liu, Yufan Chen, Jiale Wei, Junwei Zheng, Kunyu Peng
Abstract:
Procedural anomaly detection in bimanual assembly requires judging each hand action against the execution so far. A corrective action may look unusual in isolation, while a visually plausible action can violate the order of the procedure. We present HACT, a transition model over predicted per‑hand events. A role‑preserving history keeps the concurrent responsibilities of both hands, and a marked temporal point process assigns each observed transition a semantic and temporal surprisal. A supervised evidence head and a two‑state filter convert these surprisals into per‑hand anomaly posteriors. A recovery‑aware protocol on predicted events and participant‑disjoint folds reports the recovery false‑positive rate at an operating point selected on validation participants. On two bimanual power‑tool procedures HACT has the highest AUPRC and F1 among the compared methods and the fewest recovery alarms. Applied without retraining to a different assembly order of the same product, it retains the highest AUPRC and F1. The source code is available at https://github.com/Kratos‑Wen/HACT.
Authors:Junwan Choi, Woongrae Jo, Dong-Uk Seo, Jinwoo Jeon, Hyun Myung
Abstract:
Accurate initialization is essential for reliable visual‑inertial odometry (VIO), but it is often ill‑conditioned under degenerate motions. Existing methods typically require restrictive excitation motions to ensure sufficient observability or rely on computationally expensive 3D structure reconstruction, limiting efficient and practical deployment. To address these limitations, we propose SLIM‑init, a structureless monocular VIO initializer that directly exploits geometric constraints from tracked 2D line features without explicit 3D landmark reconstruction. Specifically, SLIM‑init leverages line‑derived vanishing points (VPs) as translation‑invariant orientation cues to provide robust rotation‑only constraints under degenerate scenarios such as low‑parallax or translation‑dominant motions. It further incorporates a line epipolar residual to constrain translation and a line‑normal projection residual to improve the conditioning of linear alignment, enhancing the accuracy and robustness of initial state estimation. Extensive experiments on a public benchmark and challenging custom degenerate‑motion sequences demonstrate improved accuracy and robustness over state‑of‑the‑art initialization methods. The source code is available at: https://github.com/cjunwan/SLIM‑init.
Authors:Trevor D. Canham, Abhijith Punnappurath, Michael S. Brown
Abstract:
Independent control of tonescale regions (e.g., shadows, highlights) is essential for painters, photographers and cinematographers to bring 2D images to life. In image manipulation software this is most directly addressed by color grading modules, which use intensity thresholds to segment distinct illumination regions for local manipulation. In this work we develop an open source color grading tool and use it to annotate a large dataset of video frames with tonescale region thresholds. Using these thresholds we conduct modeling experiments with strategies based on both practitioners' conventional wisdom and machine learning. Results show that K‑nearest neighbors is an effective prediction strategy, outperforming state‑of‑the‑art end‑to‑end methods for image enhancement. This outcome demonstrates the benefit of focusing on a compact set of core parameters when modeling creative stylization processes. Our adaptive color grading interface and data are available at https://github.com/SamsungLabs/adaptive‑color‑grading.
Authors:Alex Fedosov, Maxim Yakimenko, Sander Stepanov
Abstract:
Most artificial neural systems are built to map given inputs to outputs. Adaptive agents face a prior problem: they must act without enough evidence, seek encounters with the world, and revise behavior when evidence appears. We propose another starting point for intelligent neural networks: proactive search without signals, curiosity at its most basic. We ask whether it can come from a minimal untrained circuit. The spiking unit studied here inverts its response to input: with no signal in its window it fires faster; once signals arrive it switches to a slower, inverted regime. Search needs three or more such oscillators in counter‑phase, each reading the same input in a different time window. With no training, supervision, parameter tuning, or controller, the composite switches on its own between exploratory spiral search and exploitative tracking, finding both first‑degree symmetry and second‑degree groups. The switch comes from temporal disagreement between its fast and slow readings of the same signal. We view the circuit as evolutionarily trained: its abilities come from structure, not experience. Ablation over 63 configurations and 63,000 trials shows the switch needs both temporal staggering and counter‑phase opposition, neither enough alone: the behavior is emergent, not programmed. The spiral persists at zero rotational diffusion, so it is structural, and degrades gently under perturbation. More oscillators improve spiral regularity but cut resource capture, so the smallest sufficient circuit wins. We propose that this principle underlies search in simple organisms, navigation and decisions in complex ones, and, being so simple and common, goes unnoticed unless you strip the logic bare. Eventually, networks of such proactive primitives may offer another foundation for AI architectures that explore our world rather than merely predict the next symbol in a sequence.
Authors:Zijian Ding, Yang Zou, Yizhou Sun, Jason Cong
Abstract:
Large Language Model (LLM) agents are increasingly being explored for chip design, but most existing approaches operate directly at RTL. We ask whether agents can design better chips by leveraging higher‑level abstractions. We compare Direct RTL Design, Agent‑based HLS Design, Post‑Compiler HLS Refinement, and Post‑HLS RTL Refinement, and combine Agent‑based HLS Design with Post‑HLS RTL Refinement as Agent‑based HLS with RTL Refinement (AHRR). We use FPGAs as a practical, easy‑to‑deploy platform for end‑to‑end evaluation, but note that the design‑flow tradeoffs we study are largely independent of the target technology. Across a diverse 11‑tasks benchmark suite, AHRR achieves a 2.6× geometric‑mean speedup over Direct RTL Design across our benchmark suite. Case studies show that HLS distills design knowledge into abstractions that agents can leverage, while RTL refinement recovers lower‑level optimization opportunities. Together, these results make AHRR a promising workflow for agentic chip design. The code and evaluation artifacts are available at https://github.com/ZijD/AHRR.
Authors:Ruize Geng, Hao E. Zhang, Yisen Li, Yikai Wang, H. Eric Tseng, Ding Zhao
Abstract:
Learning in robotic games is constrained not only by strategic information but also by what the body can still execute. We study this coupling in a hierarchical humanoid‑quadruped penalty system in which game‑level self‑play policies command fixed soccer whole‑body controllers (S‑WBCs). The humanoid shooting skill is initialized from self‑collected motion‑capture data, whereas the quadruped saving skill is learned by reinforcement learning. We introduce dynamics‑induced commitment mapping (DIC‑Map), a body‑grounded analysis that estimates continuation capability, identifies the first persistent loss of a terminal alternative, and tests whether the remaining interaction admits a reduced zero‑sum game. For symmetric terminal alternatives, the reduced game yields a closed‑form bound on optimal strategy concentration determined by the responder's value of deferring. We further show that, when the responder acts through an estimator, equal response values eliminate the direct terminal‑allocation gradient and leave an estimator‑mediated first‑order learning channel. Experiments locate commitment about 0.29 s before contact, and changing only ball speed shifts deferral coverage. Across four responder policies, replacing the estimator raises save rate from 0.240 to 0.472, whereas a comparable gain in read accuracy obtained by waiting raises it only to 0.246. Posterior analysis is used for the equilibrium comparison because the available coverage terms are observational proxies. Project website: https://chris‑ruizegeng.github.io/penaltykick/
Authors:Marius F. R. Juston
Abstract:
We present MarsFM, an image‑conditioned latent flow‑matching model for local Martian relief estimation from single‑band HiRISE RED orthoimagery. The method combines a pretrained generative prior with stereo‑derived geometric supervision and a differentiable Lunar‑‑Lambert shading objective. Relief, normal, gradient, curvature, and ordinal terms constrain complementary aspects of terrain structure, while a positive‑affine‑invariant image comparison constrains rendered appearance. An evaluation comprising 2024 gathered patch records per integration‑step count yields mean affine‑aligned RMSE between 0.0935 and 0.0957 in normalized signed‑log relief space for one to twenty Euler steps. These scores measure agreement with VAE‑reconstructed references on positive‑reference support. Their narrow range supports low‑step inference under this protocol. Spatial, differential, and spectral diagnostics show broad terrain correspondence alongside smoothing, amplitude compression, and boundary mismatch. MarsFM provides a framework for combining learned terrain priors with image‑based constraints; establishing improved physical terrain resolution requires matched baselines and independent high‑resolution reference data. Data: https://huggingface.co/datasets/SuperComputer/mars_hirise_dtm_processed‑6aa9b66ba461e07f; code: https://github.com/Marius‑Juston/MarsRecon.
Authors:Adithyan Arun Kumar
Abstract:
Human approval is often treated as the last security boundary before an agent executes a consequential operation. That boundary is only meaningful if the operation presented for review is the operation later authorized or released. We call failures of this binding Loopjacking: a human approves what they understand as operation A, while the implementation uses that decision for a materially different operation B. We distinguish two variants. In a representation‑based attack, B is already encoded but omitted or misrepresented at approval time; in a post‑approval state‑substitution attack, the human sees the correct A and mutable workflow state later replaces it with B. We evaluate a purposive set of released agent products. We reproduce post‑approval substitution in seven tested Agno AgentOS releases ending at 3.0.9 and in 12 tested versions of a conditional in‑memory LangGraph Agent Server composition ending at 0.14.0. We reproduce representation mismatch in OpenClaw 2026.2.23 and its rejection in 2026.2.24. OpenAI Agents SDK 0.22.0 and 0.22.2 provide a negative control: serialized continuation preserves exact per‑call binding and rejects mutated B. These results do not estimate ecosystem prevalence. They show that complete canonical approval rendering and exact use‑time comparison, or preventing unauthorized pending‑state mutation, block the tested attacks while preserving legitimate execution. We separate this contribution from established work on misleading dialogs, session smuggling, action binding, and authorization continuity.
Authors:Gaurav Agarwal, Ashish Garg, Isha Singhal
Abstract:
Language models can now write GPU kernels that outperform PyTorch. We evaluate five model configurations on KernelBench level 1 and find that a frontier model produces correct kernels for 91.1% of problems and independently verified speedups on 22 of 56, including three convolutions, with a median of 1.235x. Open‑weights models are far behind: the best reaches 30.4% correct with three verified speedups and solves zero convolutions. We then ask a question the literature does not: what fraction of a real model's wall clock do such kernels govern? Profiling seven workloads across three domains, we find the addressable fraction ranges from 8.9% to 58.2%. On transformers, 80‑86% of runtime is spent in cuBLAS GEMM and FlashAttention, bounding realistic end‑to‑end improvement at roughly 1%, and the fraction shrinks with model scale. On recommenders it is 58.2%, concentrated in a single embedding kernel. We introduce DLRM‑Bench, 12 recommender kernel problems in KernelBench format, and measure a 41.7% win rate at a 1.552x median there, projecting 8.63% end‑to‑end. Separately, we show that KernelBench's correctness check (torch.allclose with an absolute tolerance) is satisfied by a tensor of zeros on 4 of 60 level‑1 problems. Two kernels in our own results exploited this before we detected them, including one scored at 283x that wrote 0.3% of its output buffer. We propose scale‑invariant replacements and release all 879 evaluations.
Authors:Vuk Radovanovic, Vishesh Gupta, Adrien Gruson, Binh-Son Hua
Abstract:
Image diffusion models have shown impressive image generation capabilities but are often hard to control, in contrast to classical computer graphics pipelines such as physically based rendering. However, we observe that there is a bridge between light transport phenomena and the distribution of latent space values produced by such models. Thus, we introduce physically based rendering in the feature space learned by the variational autoencoders in generative models, enabling light transport simulation in the latent space. This allows us to leverage physically based rendering techniques to output latent maps for physically guided content generation. We propose modifications to the rendering equation, which, when paired with a differentiable renderer, can yield an optimal set of scene parameters that require only minimal refinement to accurately render into the pretrained latent space. We train our method on a single rendered image, and then demonstrate the generalization of the method to scene geometry changes, lighting changes, and camera view changes.
Authors:Xu Yuan, Hua Liu, Wenqi Fan, Qing Li
Abstract:
Recent visual document retrieval (VDR) systems such as ColPali use multi‑vector page embeddings, in which patch‑level vectors enable fine‑grained evidence matching but incur substantial index storage and MaxSim scoring overhead. Post‑hoc merging offers a practical route to efficient VDR by reducing this cost without retraining the retriever, but its uniform reconstruction objectives are poorly aligned with the sparse, non‑uniform patch usage induced by late‑interaction retrieval. Under aggressive compression, this misalignment can preserve rarely used patches while concentrating retrieval activity on too few retained representatives. To address this misalignment, we propose Marginal‑Guided Compression with Optimal Transport (MAGIC), a training‑free post‑hoc compressor for efficient retrieval with frozen multi‑vector embeddings. MAGIC derives a MaxSim‑induced compression surrogate and optimizes it through a two‑marginal entropic optimal‑transport formulation, where a retrieval‑demand source marginal prioritizes high‑use patches and a balanced target marginal regularizes retained‑facet usage. Across ViDoRe benchmarks, keep ratios, and retrieval backbones, MAGIC consistently outperforms strong post‑hoc compressors, with particularly large gains in the aggressive‑compression regime; component ablations verify the complementary effects of its two marginals. We release the code at: https://github.com/xandery‑geek/MAGIC.
Authors:Bertil Braun
Abstract:
Natural spoken interaction requires more than streaming ASR, language generation, and speech synthesis: a system must react to overlap without canceling on every acknowledgment, prepare a response before a turn is certain, and ensure canceled audio cannot enter conversation history. We present Voice‑Light, a full‑duplex cascaded voice agent that combines immediate acoustic onset, a causal adapter sharing a streaming ASR encoder, reversible playback control, and private speculative response generation. Structured tool calls execute concurrently with audible bridge speech, while browser acknowledgments make rendered audio authoritative for durable history. Locked evaluation on 1,673 real‑conversation silence candidates found that an earlier learned completion checkpoint preserved a 2.70% false‑cutoff rate but reached only 12.53% end‑of‑turn recall, compared with 95.60% for a Silero timing policy. The deployed system therefore retains a hybrid controller rather than claiming a learned‑policy replacement. Across three unscripted operator‑run microphone sessions, 36 measured response turns had a 758 ms median from final VAD endpoint to first server audio; 21 turns were below 800 ms. These sessions are an instrumented case study, not a controlled user evaluation. We release the synthetic data, model artifacts, evaluation code and summaries, source code, and deployment configuration supporting the result.
Authors:Boyuan Zhao, Sifan Zhang, Luping Chen
Abstract:
Hybrid motor‑imagery brain‑computer interfaces (MI‑BCIs) combining EEG and fNIRS can outperform EEG‑only systems by exploiting complementary electrophysiological and hemodynamic information. To obtain such hybrid information when paired EEG‑fNIRS acquisition is unavailable or inconvenient, recent studies have focused on EEG‑to‑fNIRS cross‑modal generation. However, existing methods still suffer from slow generation and often require pretraining, limiting their use in real‑time MI‑BCI scenarios. Although one‑step generative models offer an attractive route to low‑latency synthesis, removing the iterative refinement process can reduce generation fidelity and introduce non‑physiological artifacts. To address these problems, this paper proposes Bio‑MF, a latent‑free one‑step MeanFlow framework for EEG‑conditioned fNIRS generation. Bio‑MF performs direct signal‑space x‑prediction, converts this signal‑space output into MeanFlow velocity supervision, and completes inference with one network evaluation. To preserve task‑relevant hemodynamic structure under heterogeneous sensor layouts, Bio‑MF integrates Spatial‑Temporal Interactive 4D Encoding, cross‑modal classifier‑free guidance, and noise‑level‑gated FFT regularization. On Dataset 1, EEG + synthetic fNIRS improves ACC over EEG‑only by 3.37 and 4.15 percentage points for HbR and HbO, respectively. On Dataset 2, the corresponding gains remain 2.98 and 2.50 percentage points under the unseen 64‑channel EEG montage. On an RTX PRO 6000 GPU, Bio‑MF generates one fNIRS trial in 7.0 ms, corresponding to an 857x speedup over the 1000‑step SCDM latency. These results show that Bio‑MF enables fast EEG‑to‑fNIRS synthesis while preserving task‑relevant generation quality for downstream hybrid MI decoding. Our code is available at https://github.com/psychosiwa/Bio‑MF.
Authors:Chuxuan Hu, Yeye He, Penny Zhou, Wee Hyong Tok, Daniel Kang, Surajit Chaudhuri
Abstract:
Business intelligence (BI) is a cornerstone of enterprise decision‑making and is widely used by enterprise users in software such as Power BI and Tableau. In traditional BI workflows, users need to prepare data by (1) identifying relevant tables, (2) performing data transformations, and (3) building join relationships, before they can (4) answer their business questions. These steps can be complex and time‑consuming, making BI challenging. Given the strong capabilities of large language models (LLMs) in working with data, we study their ability to answer BI questions end‑to‑end, without requiring users to manually perform the tedious preparation steps. To do this, we harvest a large collection of real‑world BI projects from public sources, and manually extract pairs of (questions, ground‑truth answers) from real user dashboards. The resulting benchmark, BI‑Bench, is the first benchmark to systematically study LLMs' ability on end‑to‑end BI. We find that even frontier LLMs perform poorly on BI‑Bench, with less than 50% accuracy. To address their limitations, we design a tool‑augmented BI‑Agent that decomposes BI workflows into subtasks on structured data, such as search, join, and transform, and orchestrates specialized data management methods across BI stages. Furthermore, we develop a post‑training framework that synthesizes training trajectories from real BI projects, enabling BI‑Agent to be further post‑trained using both supervised fine‑tuning (SFT) and reinforcement learning (RL). BI‑Agent achieves substantial accuracy gains of up to 40 percentage points with vanilla LLMs, and post‑trained BI‑Agent yields gains of up to 30 points. Our results highlight the importance of combining tool‑augmented reasoning with domain‑specific post‑training in complex BI workflows, and point to promising directions for future research.
Authors:Qifeng Cai, Xuanguang Pan, Hao Liang, Chang Xu, Wentao Zhang
Abstract:
Text‑to‑SQL translates natural‑language questions into executable SQL queries, but open‑source large language models still require task‑specific post‑training for complex, real‑world SQL generation. Effective post‑training requires both training data that cover the capabilities demanded by the target task and a learning strategy that enables the model to acquire them. Existing datasets provide valuable supervision but incompletely cover SQL structures, while augmentation methods typically expand data without identifying structural gaps. Moreover, supervised fine‑tuning (SFT) or reinforcement learning (RL) alone cannot dynamically address weaknesses exposed during training. We propose COAL‑SQL, a unified framework combining Coverage‑Guided Augmentation (CGA) and Failure‑Driven Learning (FDL). CGA uses greedy selection to identify SQL structures missing from the original dataset and constructs complementary examples, improving structural coverage. FDL retains GRPO as the main optimization objective while supplying targeted supervision for unsolved examples. At the step level, it applies SFT to verified reasoning traces generated by a strong LLM for accumulated failures. At the epoch level, it retrieves structurally related examples based on accumulated failures to create targeted practice, helping the model acquire the corresponding SQL capabilities. With only 12,600 distinct post‑training examples, COAL‑SQL achieves 64.9% execution accuracy on the BIRD development set and outperforms baselines trained at comparable scale. The code is available at https://github.com/TechNomad‑ds/COAL‑SQL.
Authors:Mengxuan Li, Junfa Chen, Jinze Xia, Yundan Chen, Lixin Fan, Ke Liu, Keyue Shi, Haishuai Wang
Abstract:
Physiological signals support diverse clinical and monitoring tasks, yet existing physiological signal foundation models typically require task‑specific adaptation for each task. Natural language provides a common interface for specifying different prediction objectives, but the ability of current models to follow such instructions across physiological signal modalities remains insufficiently evaluated. To address this gap, we introduce PhysioBench, a unified benchmark for physiological signal question answering. PhysioBench harmonizes annotations from 22 public datasets into 61.4 million questions across 30 tasks. Each question‑answer pair is grounded in a signal segment and traceable to its source annotation. We evaluate 21 representative models, including large language models, vision‑language models, time‑series language models, and physiological signal foundation models under three complementary settings. The results show that none of the evaluated models achieves consistently strong performance across physiological signal modalities and tasks. The incorporation of natural language supports unified prediction across tasks, although performance remains sensitive to question formulation. Beyond these findings, PhysioBench offers an extensible platform for fine‑grained analysis and future research on physiological signal understanding. Our codes are available at https://github.com/Leanna97/PhysioBench.
Authors:Sean Diab
Abstract:
Revision‑capable generation is appealing because it can insert or revise earlier content, but many non‑autoregressive and edit‑based approaches obtain this flexibility through repeated sequence‑level computation. We propose Reviser, a decoder‑only Transformer that generates a response as a sequence of cursor‑relative actions on a mutable canvas. At each step, Reviser predicts exactly one action token: INSERT(token), MOVE(Δ), or STOP, and is autoregressive over edit‑history actions rather than final text order. This design enables genuinely non‑monotonic generation while preserving a simple next‑action interface. On a continuation benchmark, Reviser is strongly preferred to SEDD and MDLM in our arena evaluations, and trajectory statistics confirm that the model performs frequent backward moves and mid‑canvas insertions rather than merely emulating end‑append decoding. Against size‑matched autoregressive baselines, Reviser is competitive at both the 100M and 300M scales. Under our shared FLOPs convention, Reviser also requires substantially less inference compute than representative multi‑pass refinement and diffusion‑style baselines.
Authors:Peiyu Liu, Dingxi Zhang, Federico Tombari, Marc Pollefeys, Christina Tsalicoglou, Daniel Barath
Abstract:
A splash lives for a fraction of a second: sheets tear into ligaments and droplets, appearance is view‑dependent and nearly textureless, and little persists long enough to track. Reconstruction research has consequently focused on smoke, synthetic liquids, or gently deforming surfaces. To our knowledge, no synchronized multi‑view dataset of splashing liquids exists. We therefore introduce a benchmark of 20 real scenes, from coherent streams to violent splashes, captured by seven synchronized, calibrated 4K cameras at 60 fps, with manually refined per‑view liquid and container masks and fixed evaluation splits. We further present SplashSplat, built on a single principle: impose physical structure only where the observations can constrain it. Per‑frame liquid SDFs fused from the masks provide the geometry, level‑set transport between consecutive SDFs yields a coarse velocity field, and Lagrangian carriers advected along this flow, corrected against each new observation and reseeded where coverage is lost, decode local Gaussians for differentiable rendering. SplashSplat outperforms state‑of‑the‑art dynamic Gaussian splatting methods on our real captures and on a synthetic benchmark, with physically more plausible motion and a lower training cost. The same representation supports temporal interpolation and style transfer without re‑optimization.
Authors:Kevin Qu, Tao Sun, Massimiliano Viola, Liyuan Zhu, Zhizhuo Zhou, Sayan Deb Sarkar, Konrad Schindler, Iro Armeni
Abstract:
Modeling articulated objects from sparse monocular views is challenging because each observation reveals only partial geometry and motion evidence. Most feed‑forward methods infer articulation from a single observation and therefore rely heavily on learned category‑level shape priors. We present FAMOS, a feed‑forward model that predicts movable‑part segmentation and joint parameters from a sparse, unordered set of partial point clouds. Our model jointly reasons over multiple observations and naturally supports a variable number of inputs, including a single view. To aggregate articulation cues across observations, we introduce a Multi‑state Articulation Transformer with alternating state‑wise and global attention. We further propose an observed articulation span objective that supervises the motion range each part exhibits across the input observations, encouraging the model to leverage the full observation set. To overcome the limited scale and diversity of existing datasets, we introduce a procedural data generator that synthesizes self‑annotated assets during training. Experiments on PartNet‑Mobility, ACD, and ArtiCraft‑10K demonstrate consistent improvements over both feed‑forward and optimization‑based baselines. Project page: https://kevinqu7.github.io/famos
Authors:Taoyong Cui, Zhongyao Wang, Xinyue Xu, Weiyang Liu, Zhaochen Yu, Yuying Zhang, Qiang Gao, Mengyue Yang, Wanli Ouyang, Pheng Ann Heng, Yingcheng Wu, Zhenfei Yin, Ling Yang
Abstract:
World modeling enables intelligence to anticipate consequences, guide interventions, and learn from interaction. Yet predictive models remain domain‑specific: can a common learning principle support world modeling across radically different systems? We introduce JEPA‑Anything, a domain‑agnostic framework based on orthogonal predictive factorization (OPF). Extending joint‑embedding predictive architectures, OPF decomposes latent targets into complementary factors, learns them through dedicated pathways, and recombines them within a shared predictive design. We evaluate JEPA‑Anything across seven domains: vision, biology, clinical trajectories, control, molecular dynamics, physical fields, and weather. Experiments span representation learning, intervention prediction, out‑of‑distribution generalization, and long‑horizon dynamics, including 10 matched dynamics tasks, forecasting of over 1,000 clinical events, and 100‑step molecular rollouts across four systems. Against matched JEPA baselines, JEPA‑Anything improves reported metrics on all 10 dynamics tasks and reduces single‑intervention prediction error on Interventional Pong by 34.8%. It achieves the lowest one‑step and 100‑step molecular errors among compared methods in all four systems. Beyond prediction, a factor‑nominated biological intervention receives experimental support in cell co‑cultures, patient‑derived organoids, tumor fragments, and mice; latent orbital modes recover the Keplerian scaling exponent with a fitted slope of ‑1.4991. These results support a common factorized predictive principle across heterogeneous worlds, connecting world modeling with intervention and experimentally grounded scientific discovery. Code: https://github.com/Gen‑Verse/JEPA‑Anything
Authors:Jiachen Yao, Zi-Siang Hsu, Xi Deng, Aditi Gupta, Xin Ju, Sally M Benson, Gege Wen, Anima Anandkumar
Abstract:
Generative models are increasingly used to solve scientific inverse problems, but existing evaluations still focus primarily on whether a method can produce a single plausible reconstruction. This is insufficient for ill‑posed problems, where multiple solutions may be consistent with the same sparse or noisy observations. In these settings, a method can achieve strong pointwise accuracy while still failing to capture the true posterior through mode collapse, overconfident uncertainty, or averaging incompatible solutions. We introduce PosteriorBench, a benchmark for evaluating the distributional accuracy of generative inverse solvers. PosteriorBench evaluates four physics‑based inverse problems: Darcy flow inversion, Poisson source recovery, carbon capture and storage, and light transport material inference. For each task, we construct high‑fidelity reference posteriors using computationally heavy but established procedures such as rejection sampling and Markov chain Monte Carlo, enabling direct assessment of whether solvers recover the full set of solutions rather than the single best sample. We pair these references with a five‑metric posterior evaluation suite: posterior‑mean error, posterior‑standard‑deviation error, maximum mean discrepancy, sliced Wasserstein distance, and radially averaged power‑spectrum error. These metrics assess pointwise accuracy, marginal uncertainty, distributional alignment, and global frequency fidelity. The benchmark spans sparse sensing, low‑resolution observations, nonlinear forward models, varying noise levels, and multimodal priors, with a unified pipeline for distribution matching and uncertainty quantification. Our experiments reveal substantial distribution‑matching gaps across current solvers, while showing that neural operators improve resolution robustness, and guidance weights and generation noise are key to posterior‑variance calibration.
Authors:Zachary Robertson
Abstract:
This article introduces mutual evaluation of a replicable task worker and a critic that incentivizes truthful reporting, both modeled as strategic agents. The critic chooses a finite‑valued rule that induces an evaluation score on joint report laws. Their common payoff is analyzed through regret relative to the unrestricted critic envelope. The critic rule is distinct from the evaluation score. This class enables a peer‑free information elicitation mechanism using conditionally independent replications of a worker on the same task. This replication‑loop mechanism implements a type‑agreement payoff using same‑task replications and new‑task samples. In contrast to the peer‑prediction and scoring‑rule literature, implementations are shown that produce unbiased Pearson and Shannon information scores without requiring peers, a ground‑truth reference, or likelihood‑ratio estimation. A valid binary critic also can be represented by shared finite type annotations of worker returns. One runtime restriction is that the number of required replicas is random and can depend on the critic rule. Other timing effects, such as commitment and reoptimization, yield distinct incentives, connecting the framework to variational peer prediction. This mechanism class illustrates why strategic considerations matter for both critic and worker agents.
Authors:Damiano Da Col, Maximilian Igl, Peter Karkus, Kashyap Chitta, Boris Ivanovic, Marco Pavone, Konrad Schindler, Christos Sakaridis
Abstract:
As scaling pre‑training data alone yields diminishing returns, post‑training is becoming increasingly important across physical AI domains such as autonomous driving. End‑to‑end driving policies are pre‑trained in open loop with behavior cloning on human demonstrations. However, compounding errors during closed‑loop deployment can take the vehicle outside the training data distribution, increasing the risk of safety‑critical incidents. Closed‑loop post‑training can mitigate this risk but requires costly simulation for sensor‑based policies. We propose OPTED (on‑policy fine‑tuning for end‑to‑end driving) which decouples reinforcement learning from the post‑training of the end‑to‑end policy: a privileged teacher is trained using RL on vectorized inputs (HD‑map and bounding boxes). This teacher then provides supervision to the pre‑trained student during closed‑loop post‑training. We apply OPTED to two camera‑based models, TransFuser and VaVAM, and fine‑tune them in AlpaSim, using neural reconstructions (3DGS) of real driving logs. Driving scores increase by factors of 1.6× and 9.5×, respectively. In controlled experiments OPTED matches closed‑loop performance with approximately three orders of magnitude fewer simulator interactions than direct RL post‑training, while staying closer to the human prior. Project page: https://01dami23.github.io/opted/
Authors:Haocheng Xi, Yiming Xie, Hexu Zhao, Yiwen Zhang, Michael Liu, Thomas Creavin, Kurt Keutzer, Xiuyu Li, Zhaoyang Lv, Chenfeng Xu, Haiwen Feng
Abstract:
Video diffusion models repeatedly process long spatiotemporal token sequences during denoising, making attention a major computational bottleneck. Linear attention offers an appealing alternative and has been widely adopted in recent large language models, but directly applying it to video models often fails to preserve the fine‑grained interactions required for high‑quality generation. We present Video DeltaNet (VDN), which combines local Softmax attention with bidirectional linear memory for long‑range video context. Its linear branch introduces Video Delta Attention (VDA), which updates memory once per frame by jointly incorporating its spatial tokens. Separate output projections and learnable gates calibrate the two branches, while a staged teacher‑alignment recipe progressively introduces the new pathway into pretrained models. We instantiate VDN on MiniMax H3, applying the hybrid to video‑to‑video interactions while retaining Softmax for interactions involving text or audio. With eight‑step distillation and an optimized SGLang serving stack, VDN‑H3 completes DiT denoising for a 14.3‑second, 768p video in 6.70 seconds on eight NVIDIA B200 GPUs, corresponding to a 14.5x speedup over the 50‑step dense H3 baseline on the same GPU count. GitHub code available at: https://github.com/OpenVDN/vdn‑minimax‑h3. Weights available at: https://huggingface.co/OpenVDN/vdn‑minimax‑h3
Authors:Haoyu Ma, Onur Bagoren, Anja Sheppard, Elias Fandi, Ashrith Edukulla, Tanner Aslan, Natasha Sieh, Jingyu Song, Katherine A. Skinner
Abstract:
Scalable machine learning in challenging underwater environments is strongly limited by the lack of labeled real‑world training data. This data is often expensive and laborious to gather, making large‑scale real‑world data challenging to gather and curate. However, simulated data can help close the gap, enabling many learning‑based tasks for underwater perception. In this work, we extend OceanSim, an IsaacSim‑based underwater perception simulator, with a Synthetic Data Generation (SDG) pipeline for training models to be used in underwater scenarios. The proposed pipeline enables users to generate large, automatically labeled, photorealistic datasets with configurable scene appearance, structure, and sensor settings. We evaluate the pipeline on a real‑world sea urchin detection task and study how different forms of synthetic scene variation affect sim‑to‑real performance. Based on these experiments, we discuss findings on our results, main limitations of the current pipeline and identify future directions for improving underwater rendering fidelity, scene diversity, and the evaluation of sim‑to‑real generalization. The open‑source code can be found at https://github.com/umfieldrobotics/OceanSim.
Authors:Di Wen, Kailun Yang, Jimmy Weissert, Luc Maria Scherrer, Cedric Zöllner, Ruiping Liu, Yufan Chen, Jiale Wei, Junwei Zheng, Kunyu Peng
Abstract:
An assistant watching egocentric video should notice a mistake from past frames alone, before the next step begins, and keep working once the person recovers. A mistake changes the state of the work, so every later step has to be read against what was done rather than against the plan. The first‑mistake protocol that current online methods report on cuts each recording at its first mistake, so a fixed‑time rule that never looks at the video is right on every case. We evaluate on complete trials, where mistakes and recoveries arise naturally, under a validation false‑alarm budget and against controls that use timing alone. PROVIA keeps two records apart: a factual state, a learned summary of the steps each actor performed, mistakes included, and the accepted progress, an exact posterior over the state of an automaton induced from correct demonstrations by Bayesian state merging and over the execution status of each actor. Procedure‑state transitions occur only in the correct‑status branch; the mistake and correction branches retain the source state. A sequential test turns the per‑frame mistake probability into alarms. With one filter and one optimization rule, PROVIA ranks mistakes best among the evaluated controlled baselines on CaptainCook4D, IndustReal, HoloAssist and IMPACT‑ego. At a validation budget of 0.1 false alarms per minute it recalls .154 against .128 on CaptainCook4D and .034 against .015 on HoloAssist, where it leads at every budget. The pipeline runs at 58‑70 frames per second. The source code is available at https://github.com/Kratos‑Wen/PROVIA.
Authors:Julian Eggert
Abstract:
Allen's interval algebra is a qualitative calculus for temporal relations, but its thirteen base relations are crisp predicates over exact interval boundaries. This is inadequate for temporal information from language, perception, databases, or uncertain histories, where times, durations, and boundaries are uncertain and expressions such as "just before" or "roughly during" have graded meaning. We develop the probabilistic Allen algebra (PAA): a generative and complete extension in which relation probabilities are derived from distributions over interval boundaries rather than assigned as scores. Time points are Gaussian; intervals have Gaussian midpoints and truncated‑Gaussian durations. Every relation is a boundary‑ordering predicate in one common probability space: point‑point relations reduce to error functions, and point‑interval and interval‑interval relations to multivariate Gaussian orthant probabilities induced by linear inequalities. Contact relations (meets, starts, finishes, equals) receive positive measure through a tolerance band, and under a single tolerance the thirteen relations form a true partition that recovers crisp Allen as the tolerance vanishes. The construction derives Allen's taxonomy rather than positing it: coarse predicates such as precedence, overlap, and containment are unions of leaves whose probabilities are leaf sums, and this hierarchy is preserved as intervals collapse to points and thirteen relations reduce to five and then three. Each relation further decomposes into correlation‑aware temporal primitives in the spirit of CIDOC CRM. The algebra is scale‑invariant and separates graded expressions such as "shortly before" from contact relations. All results are Monte‑Carlo validated and shipped as an open, tested Python package.
Authors:Yulong Chen, Ziqian Zhang, Haoyu Zhang, Ao He, Yaxing Wang, Senmao Li, Kai Wang
Abstract:
Text‑guided image editing must introduce the requested changes while preserving unrelated source content. In training‑free editing, diffusion editors often use spatial controls whose inaccuracies can leave edits incomplete or alter unrelated regions. Causal autoregressive editors face a further constraint: their fixed decoding order limits revision of earlier decisions. As the first to explore training‑free image editing with Generative Refinement Networks (GRN), we observe that its refinement process is inherently suitable for editing and offers a promising way to address these limitations. Motivated by this observation, we introduce RefineEdit, a training‑free prompt‑to‑prompt image editing framework built on the GRN. Our key idea is to couple edit localization with content generation through the global refinement of binary image codes, allowing editing evidence to be revised as the image evolves. More specifically, RefineEdit combines bit routing with two stabilization mechanisms: adaptive spatial freezing and finite bit locking. Bit routing starts from an intermediate source state and uses signed probability differences between the two branches to identify editable positions and bits. It directs selected bits toward editing refinement while anchoring the rest to the evolving source trajectory. Adaptive spatial freezing limits unnecessary expansion of the editing region, while finite bit locking maintains recent bit activations to support continued editing. The overall framework requires no additional training, external masks, or attention control. Across nine editing categories of PIE‑Bench, RefineEdit achieves the best background‑preservation scores in PSNR, LPIPS, MSE, and SSIM, together with the highest whole‑image and edited‑region CLIP scores among the evaluated methods. Code is available at https://github.com/mura1n/RefineEdit.
Authors:Tisha Chawla, Susheem Koul
Abstract:
Large language model responses are non‑deterministic, so failures in LLM agents are hard to reproduce: a failure depends on inference that is not bitwise reproducible, on tools that read changing state, and on a multi‑step trajectory that a re‑run rarely repeats. Record‑and‑replay makes a run reproducible, but existing agent tooling records runs only to trace or score them, not to test a code change against them. We present Chronicle, which records an agent run at its non‑deterministic boundaries as immutable envelopes and replays it from the record. Its central operation, cut‑point replay, serves a chosen subset of boundaries from the record and executes the complementary subset live with new code, turning a recorded incident into a regression test that runs in continuous integration. On a benchmark of 6 recorded failures with simulated model boundaries, recording adds 23 μs per crossing (0.008% of an assumed 300 ms model call), full replay issues zero model calls and is bit‑stable across 20 repetitions, and cut‑point tests fail on faulty code and pass on guarded and benign changes for all 6 incidents. In a mutation study of the guarded tools, cut‑point tests catch every mutant that lets the recorded unsafe action through, while a baseline that stubs every boundary, using the same assertion, catches none. Chronicle and the benchmark are publicly available at https://github.com/theagentplane/chronicle.
Authors:Di Wen, Kailun Yang, Wenhao Guo, Yitian Shi, Junwei Zheng, Yufan Chen, Ruiping Liu, Jiale Wei, Rania Rayyes, Kunyu Peng
Abstract:
Robots inspecting an assembly must determine which parts are present and whether they are correctly installed. During egocentric assembly assistance, head motion and workpiece handling reveal evidence for these checks, while spoken state confirmations link observations to procedural outcomes. We introduce INSPECT, which learns robot view preferences from records of a smart‑glasses assistant that answers part queries and provides next‑step guidance. Presence‑Invariant TwinSwap (PI‑TwinSwap) calibrates object evidence through paired identity interventions. Claim‑indexed supervision separates evidence requirements from camera‑reproducible observation changes. Object‑centered calibration adapts relative view preferences to robot poses, while clause‑level screening checks predicted evidence. The robot selects views using only its current observation and known poses, without candidate images. Evaluation uses annotated assistant‑video replay to simulate state feedback, without target‑domain view labels for policy training. On images of physical gearbox assemblies, INSPECT achieves the highest view utility among the compared non‑oracle policies and raises human‑rated full verifiability from 34.8% to 41.7% compared with keeping the current view. On commercial angle‑grinder recordings in IMPACT, the transferred relative‑view selector increases the correct decision rate from 50.6% to 54.3% with a frozen perception head. The source code is available at https://github.com/Kratos‑Wen/INSPECT.
Authors:Zhikun Zhou, Kunyu Peng, Runyi Yang, Junhao Cai, Di Wen, Ruiping Liu, Danda Pani Paudel, Yi Zhou, Luc Van Gool, Kailun Yang
Abstract:
Referring scene understanding for embodied robots requires grounding object‑ and relation‑centric language queries from a designated viewpoint. While a local semantic Gaussian map can support such grounding within one agent's observations, cooperative settings require this ability to remain effective after independently reconstructed maps are aligned and fused. In this setting, the referred target or its contextual landmark may come from another agent's observations, while spatial relations must still be interpreted from the querying robot's viewpoint. We formulate this problem as cooperative referring Gaussian grounding over fused maps, which requires geometric alignability, instance‑level semantic comparability, and view‑conditioned relation reasoning. Existing language‑aware Gaussian methods mainly focus on single‑map querying, whereas Gaussian registration methods optimize geometric or photometric alignment without preserving language‑grounding‑oriented semantic compatibility. We propose CoRef‑GS, a cooperative referring Gaussian splatting framework. CoRef‑GS constructs local open‑vocabulary instance‑aware Gaussian maps, then aligns partially overlapping maps with a cross‑agent alignment module by geometric and semantic consistency, and grounds queries using a view‑conditioned mask relation graph. We further introduce CoQuad‑Ref, a dual‑quadruped benchmark spanning both real‑world and simulated indoor scenes. Experiments show that, on simulated scenes, CoRef‑GS reduces the rotation error from 2.58° after coarse initialization to 0.15° after refinement, and improves real‑world referring mIoU over ReferSplat from 52.6% to 68.8%. The established benchmark and source code will be publicly released at https://github.com/ruojiruoli17/CoRef‑GS.git.
Authors:Chenxi Wu, Zimu Wang, Haiyang Zhang, Wei Wang, Zhijie Xu
Abstract:
Large language models (LLMs) are increasingly considered for safety‑critical engineering, yet their reliability in regulated functional‑safety workflows remains underexplored. We introduce SAFARI (Safety‑Aware Functional Automotive Risk Inference), the first industrial benchmark for LLM‑assisted automotive Hazard Analysis and Risk Assessment (HARA) under ISO 26262. It contains 3,000 de‑identified industrial HARA cases and evaluates two coupled tasks: open‑ended hazard analysis and standards‑grounded risk assessment. To evaluate open‑ended HARA artifacts, we propose the first reference‑anchored LLM‑as‑a‑judge protocol with high expert correlation. Experiments with nine frontier LLMs show that models often produce plausible hazard narratives but remain weak at ISO 26262 risk classification, with the best ASIL macro‑F1 reaching only 0.261. Chain‑of‑Thought prompting provides limited benefit and often degrades categorical risk assessment. Error analysis further localizes major failures to scenario‑critical context omissions during hazard generation and to controllability misjudgments during risk assessment, indicating where expert oversight should be concentrated. The dataset can be obtained from https://github.com/xixi47520‑hash/HARA.
Authors:Luca De Grandis, Silvia Cappelletti, William Raccagni, Marcella Cornia, Lorenzo Baraldi, Rita Cucchiara
Abstract:
Answer grounding in document visual question answering remains an open challenge: most benchmarks lack grounding annotations or provide limited‑quality labels, while constructing grounded datasets still requires costly manual effort. We introduce DocAttriBench (DAB), a large‑scale benchmark for fine‑grained, element‑level source attribution in Document VQA, grounding answers to specific layout elements such as text blocks, tables, and images. To build DAB, we propose a Mask‑based Perplexity‑Derived Attribution method (MAPPET) that combines document layout and language modeling to identify the most informative element for each answer. MAPPET measures the increase in perplexity after masking candidate elements and attributes the answer to the element contributing most to model confidence. Applying MAPPET to multiple existing Document VQA datasets yields DAB, with 237k documents and 296k question‑answer pairs with element‑level grounding. We benchmark grounding‑capable multimodal LLMs on DAB, evaluating answer accuracy, attribution accuracy, and overall answer quality. Results show that while larger models generally achieve higher answer accuracy, even the strongest models often fail to localize the supporting elements. DAB provides a scalable benchmark for developing grounded, verifiable, and trustworthy Document VQA models. Dataset and code are available at https://aimagelab.github.io/DocAttriBench/.
Authors:Zimu Wang, Yiwen Jiang, Xiangyu Zhao, Yaling Shen, Jiahe Liu, Stephanie Fong, Maxmartwell H Cheng, Guilherme C Oliveira, Anh Nguyen, Robert Desimone, Barnaby Nelson, Dominic Dwyer, Zongyuan Ge
Abstract:
Recent advancements in large language models have revolutionized the field of psychological counseling, especially in the context of Cognitive Behavioral Therapy (CBT). While the success of CBT relies heavily on dynamic decision‑making informed by the client's real‑time mental state, this aspect has often been overlooked in current research, limiting both flexibility and therapeutic outcomes. In this paper, we introduce StratCBT, a dataset specifically designed for psychological counseling conversations with CBT Strategies, consisting of 9,688 sessions and around 256K utterances, with each counselor's response aligned with one of eight distinct strategies. The creation of StratCBT involves modeling clients based on their negative thoughts and generating high‑quality counseling conversations through self‑chat, incorporating realistic sessions as guidance, thereby significantly surpassing existing datasets in both general counseling and CBT‑specific skills. We conduct extensive experiments to demonstrate the effectiveness of strategy‑aligned generation and evaluate its efficacy in delivering professional and effective counseling with LLM‑simulated clients to reflect real‑world scenarios. The dataset can be obtained from https://github.com/zimuwangnlp/StratCBT.
Authors:Adrian Brasoveanu, Ece Takmaz, Jakub Dotlačil
Abstract:
We present Relational BabyLM, a system submission to the BabyLM 2026 challenge that combines two cognitively motivated inductive biases in a single decoder‑only Transformer. Architecturally, we replace standard self‑attention with a Dual Attention Transformer (DAT), which separates the routing of object‑level ("sensory") lexical features from structural/relational information (Altabaa and Lafferty, 2025; Altabaa et al., 2024; Webb et al., 2024; Kerg et al., 2022; Webb et al., 2021). Relational attention (RA) disentangled from self‑attention greatly increases data efficiency and out‑of‑training‑sample generalization on purely relational tasks, but language modeling requires object‑level and relational information to be integrated as well as disentangled, and RA‑based LMs have remained largely unexplored. BabyLM's data‑constrained training and comprehensive evaluation is an ideal testing ground for whether that data efficiency transfers. As a training intervention, we add a Next‑Latent Prediction (NextLat; Teoh et al. 2026) objective that encourages hidden states to compress history incrementally into a dense belief state. Architecture is the dominant factor for structural linguistic generalization; the objective is secondary but still significant. DAT's three relational attention types (full RA vs. the simpler RCA and DisRCA variants) are largely interchangeable at 10M words; full RA pulls ahead at 100M. We also introduce a novel symbol‑retrieval mechanism (RoPE‑based, as opposed to learned, relative symbols) that matches learned symbol libraries while adding no parameters. On the strict (100M‑word) track, our best model ranks 6th of 55 overall and 3rd of 55 on the leaderboard's NLP‑task subset at the time of writing; our two strongest models outperform the GPT‑2 baseline on most benchmarks, with one attaining the highest EWoK score among strict‑track entries.
Authors:Zhiyang Dou, Ang Zhao, Chen Peng, Minghao Guo, Haixu Wu, Cheng Lin, Yuan Liu, Junfeng Yao, Xiaohu Guo, Wenping Wang, Wojciech Matusik
Abstract:
Rigid‑body interpenetration frequently occurs in procedurally assembled and generated scenes and must be removed before downstream applications such as physical simulation. We present S4R (Scaling for Rigid‑Body Interpenetration Resolution), a scale‑continuation method for static interpenetration repair. S4R first uniformly shrinks each body about a fixed reference center to a small initial scale, at which the layout is penetration‑free, and then restores full scale through a sequence of minimum‑norm convex contact quadratic programs (QPs) that target the linearized separation margin during continuation. Resolution thereby replaces one deep correction with a sequence of shallow‑contact subproblems. A conservative scale‑event bound and frozen‑witness gap predictions cut the number of exact mesh queries; the continuation then ends with a full‑scale evaluator check and bounded tail refinement. We evaluate S4R on Kubric, HY3D‑Bench, and Thingi10K using a shared mesh‑level evaluator and a unified per‑scene timing protocol. In the main comparisons on all three benchmarks, up to N=5000 bodies, S4R reaches zero reported penetration with displacement that stays small and nearly independent of scene size, and at the lowest wall time within each hardware tier among the compared methods. A GPU implementation extends these results to large‑scale scenes. Our code and data can be found on our project page: https://frank‑zy‑dou.github.io/projects/S4R/index.html.
Authors:Haozhe Liu, Tian Ye, Sensen Gao, Qihang Cao, Yitong Li, Mingchen Zhuge, Duomin Wang, Ruihua Zhang, Ping Luo, Jiawang Bian, Lei Zhu, Ligeng Zhu, Enze Xie, Song Han
Abstract:
As coding agents move from supervised code completion to unattended, around‑the‑clock exploration, their work expands from isolated predictions into long trajectories of reasoning, tool use, and feedback. Token efficiency therefore becomes important for scaling recursive self‑improvement. We take an RSI‑inspired approach at the harness layer, scaling auto‑research loops across increasingly numerous and diverse environments for harness rollouts. At this scale, the process yields reusable improvements that transfer beyond their development setting, moving automated harness discovery toward production‑level outcomes. Four mechanisms survive selection and form SoL‑Pi, spanning action execution, context compaction, observation handling, and delegated reading. On the 51‑task EdgeBench evaluation, SoL‑Pi achieves performance comparable to Pi across GPT‑5.6 Sol and Opus 5 while reducing recorded token traffic by 44.7‑49.0% and API cost by about one third. In other words, estimated hourly savings are \8.75‑\13.50 relative to native Codex and Claude Code harnesses, and \4.36‑\5.71 relative to Pi.
Authors:Yuxiao Yang, Tianrun Yu, Shangzhe Li, Kaixiang Zhao, Xuchao Zhang, Chetan Bansal, Huaxiu Yao, Taylor W. Killian, Weitong Zhang
Abstract:
We study length inflation in on‑policy distillation (OPD), where student responses can become excessively long and even exhaust the generation budget. We identify \emphtermination‑token mismatch between base students and post‑trained teachers as an important source of this behavior. Across Qwen3, Llama, and Gemma, the two models can place their stopping probability on different EOS tokens, even when their declared stopping sets are identical. This mismatch can suppress the student's preferred termination action without reliably transferring the teacher‑preferred alternative. We show that aligning the decoding stopping set alone is insufficient, while treating functionally equivalent EOS tokens as a shared semantic stopping action substantially mitigates mismatch‑induced length inflation across all three model families. To further understand how termination behavior evolves over training, we study OPD across different K2‑Horizon training stages. This stage‑wise analysis shows that termination preferences can shift substantially during training, while also revealing a distinct length inflation late in the OPD run that persists beyond termination alignment. Together, these results identify termination mismatch as an important, but not exhaustive, source of OPD length dynamics. We release an implementation incorporating the proposed termination‑handling corrections.
Authors:Euiseok Han, Tri Ton, Hwanhee Kim, Seungyeon Ryu, Chang D. Yoo
Abstract:
Open‑vocabulary scene understanding is fundamental for robotics, laying the groundwork for spatial reasoning and object manipulation. While closed‑vocabulary 3D instance segmentation heavily leverages 3D shape information, state‑of‑the‑art open‑vocabulary methods remain predominantly restricted to 2D image features or image‑distilled representations during mask labeling. In this paper, we propose SenseFuse, a label‑free fusion method that balances 2D image and 3D shape encoders for robust open‑vocabulary 3D instance segmentation, refining only the mask‑labeling stage of existing pipelines. We reveal that 2D image and 3D shape encoders exhibit largely disjoint failure patterns and rarely share identical wrong labels, whereas two 2D image encoders frequently repeat the same errors. This distinct behavior makes the 2D and 3D pair inherently complementary. We introduce an adaptive mechanism that selects a scene‑level fusion weight to maximize a label‑free sensitivity measure, estimated directly from a single scene's unlabeled proposals in milliseconds. SenseFuse improves labeling accuracy in every evaluated setting across ScanNet200, Replica, and ScanNet++, recovering 67‑100% (median 93%) of the gain achievable with an oracle weight, and it raises instance AP in 21 of 22 reported settings. Code is available at https://github.com/hanes1207/SenseFuse.
Authors:Qing Xu, Yixuan Zhang, Yue Li, Xiangjian He, Qian Zhang, Mainul Haque, Rong Qu, Wenting Duan, Jieyun Bai, Zhen Chen
Abstract:
Ultrasound image analysis plays a crucial role in cancer screening and prenatal diagnosis, yet comprehensive assessment requires jointly addressing tasks such as lesion segmentation and benign‑malignant classification. While recent vision foundation models have shown remarkable universal representations, unlocking their potential for ultrasound is bottlenecked by the considerable domain gap from natural images. Existing methods typically fine‑tune heavy vision encoders for isolated tasks, incurring substantial computational overhead while overlooking the underlying commonalities across heterogeneous tasks. In this work, we propose FreqDINO++, a frequency‑guided multi‑task routing vision foundation model for universal ultrasound analysis. We first introduce a Multi‑task Routing Adapter (MR‑Adapter) to support parameter‑efficient integration of task‑common and task‑specific knowledge, a Frequency‑aware Feature Enhancer (F^2‑Enhancer) is then designed to capture the rich multi‑scale frequency characteristics of ultrasound images, and a Task‑aligned Collaborative Decoder (TC‑Decoder) is devised to promote collaboration between dense and global prediction tasks through global‑local token interaction. Extensive experiments on large‑scale multi‑task and external single‑task ultrasound benchmarks demonstrate that FreqDINO++ consistently outperforms strong baselines and recent foundation models across 27 diverse clinical task scenarios, while also showing promising generalization to unseen data. The code is at https://github.com/MingLang‑FD/FreqDINO‑Plus.
Authors:Abderrahmene Boudiaf, Mohamad Alanssari, Irfan Hussain, Sajid Javed
Abstract:
Agricultural image understanding requires fine‑grained recognition of plant diseases, pests, crop structures, and botanical species under complex real‑world conditions. Despite recent advances in Multimodal Large Language Models (MLLMs), existing models remain limited to text‑only outputs and lack pixel‑level visual grounding capabilities. In this work, we introduce AgriScope, a unified pixel‑grounded multimodal framework for agricultural image understanding. AgriScope jointly supports image‑level, region‑level, and pixel‑level understanding within a unified framework, enabling tasks such as grounded caption generation, referring expression segmentation, and multi‑turn multimodal interaction for agricultural imagery. AgriScope integrates biologically specialized semantic representations with dense spatial grounding through biological‑semantic encoding, dense spatial representations, and pixel decoding. To support large‑scale grounded learning, we introduce AgriGround, a large‑scale pixel‑grounded agricultural multimodal instruction‑tuning dataset containing over 500K images and 11M instruction‑following samples spanning plant disease analysis, crop and weed identification, insect pest recognition, and fine‑grained botanical understanding. AgriGround is constructed through a multi‑stage automatic annotation pipeline that integrates multimodal caption generation, phrase‑level grounding, segmentation mask generation, and task‑oriented instruction synthesis to produce densely grounded supervision. Extensive experiments across multiple agricultural vision‑language tasks demonstrate the effectiveness of AgriScope in pixel‑grounded multimodal understanding, establishing a strong benchmark for agricultural vision‑language learning and visual grounding. The dataset and code will be made publicly available at (https://github.com/boudiafA/AgriScope)
Authors:Xujun Che, Hanhan Wu, Yuchen Yuan, Chenyang Yu
Abstract:
Grover search, amplitude amplification, and quantum counting all rely on the same reusable subroutine, a phase oracle, whose construction the algorithms literature takes as given: the classical predicate is assumed to be already encoded as a correct, resource‑bounded circuit. We turn this assumption into a measured capability. QEncodeBench tasks large language models (LLMs) with encoding classical constraint problems as phase oracles and scores the generated circuits with an adversarially self‑validated verifier that decides full solution‑set equivalence up to a global phase, with ancillas restored and resource budgets enforced. Sampled basis‑state tests, we show, systematically overestimate this ability. Measured this way, models separate sharply: code models without a reasoning mode solve essentially nothing, and enabling native reasoning on identical weights improves accuracy by an order of magnitude. The failures are overwhelmingly semantic rather than syntactic. Two architectures, a unit‑verified constraint agent and a neuro‑symbolic compilation pipeline, close most of the remaining gap by delegating correctness‑critical composition to deterministic procedures. Ablations quantify the contribution of each component, and resource gating exposes an architecture‑dependent trade‑off between circuit width and depth. Finally, controlled difficulty escalation reveals architecture‑specific responses to difficulty structure: different difficulty axes degrade different methods, while the neuro‑symbolic pipeline passes every evaluated instance. Code and data are available at https://github.com/chexujun/QEncodeBench.
Authors:Yusheng Zheng, Chaokun Chang, Yu Mao, Tianyuan Wu, Yuxi Huang, Tao Ma, Wenan Mao, Shuyi Cheng, Andi Quinn, Wei Wang
Abstract:
AI agents increasingly orchestrate long‑running activities with users, tools, and system resources for days and weeks. To improve agent quality, safety, and cost efficiency, developers need to determine where failures happen, what triggers unsafe effects, and which tasks consume the most budget, then optimize those tasks. In systems software, profiling answers similar questions by aggregating resource consumption and attributing it to responsible code paths to identify hotspots. Yet existing agent observability tools focus on per‑execution debugging and tracing rather than cross‑run, long term profiling, making these questions difficult to answer at scale. Agent observability needs profiling, not only debugging, but profiling agents is challenging: the responsible entities are task intent like diagnose authentication, compare branches rather than code paths, and lack stable identifiers for aggregation. We propose a semantic operation stack model that adapts profiling to agent trajectories. Uniform operations represent all activities, and operation stacks replace the runtime call stack, enabling hierarchical attribution at different granularities. We observe that an agent's task occupies a contiguous span and decomposes into subtasks, so we introduce recursive operation segmentation, which recursively splits trajectories at task boundaries. AgentPProf is a profiler that aggregates agent trajectories into pprof‑compatible profiles, enabling flame graph visualization and analysis. AgentPProf reaches 0.764 B^3 F1 against human annotations on CodeTraceBench. On three problem‑localization benchmarks, the profile raises MAP by up to 56%, demonstrating that it effectively attributes resources, locates problems, and helps optimize token cost at practical profiling cost. AgentPProf is available at https://github.com/eunomia‑bpf/agentsight.
Authors:Mert Onur Cakiroglu, Elham Buxton, Mehmet Dalkilic, Hasan Kurban
Abstract:
Retrieval plug‑ins supply a deep forecaster with information its lookback window cannot carry. Published evaluations report consistent gains, and each credits its own mechanism. We show that the benefit belongs instead to the operating point: the relation between window length S and dominant seasonal period L, an axis the standard protocol never varies. Stratifying the evaluation by that relation exposes the regime. At S=12, a simple control that repeats the last observed period beats the six standard backbones, in aggregate, on four of seven benchmarks by 8% to 44% of MSE. It beats the strongest plug‑in we run on ETTm1 and matches it on ECL. It is worse by up to 25% on the three datasets whose training‑split spectra lack a concentrated, shared period. A controlled synthetic sweep of horizon, period, and window shows the benefit boundary tracks the period (correlation +0.71), not the horizon (‑0.23). A paired control with no phase to recover nearly erases the effect, consistent with phase starvation. Zero‑shot pretraining does not escape it: a foundation model trails trained backbones by 22% to 50% on the periodic benchmarks. Within our instrument, exact lookup matches graph diffusion: the payoff is consulting the record, not the machinery on top. Two interpretable statistics, a trend test and a staleness rate, predict the sign of the per‑cell benefit at 0.76 accuracy under leave‑one‑dataset‑out evaluation, a suggestive margin over the 0.69 majority rule, where a 22‑feature stack manages 0.57. We propose no new plug‑in. The contribution is the regime map, the protocol that reveals it, and two statistics that screen it before deployment. Code: https://github.com/KurbanIntelligenceLab/retrieval‑regime.
Authors:Yitong Li, Alexandra Samoylova, Fabian Bongratz, Timo Grimmer, Dennis M. Hedderich, Igor Yakushev, Christian Wachinger
Abstract:
Cortical hypometabolism measured by Fluorodeoxyglucose Positron Emission Tomography (FDG‑PET) is a highly sensitive biomarker for dementia diagnosis. However, high costs, radiation exposure, and limited accessibility constrain its clinical utility. While cross‑modal synthesis from Magnetic Resonance Imaging (MRI) offers a promising alternative, existing volumetric generation methods do not explicitly account for the highly folded cortical geometry, where disease‑related patterns predominantly reside. To address this, we introduce a novel surface‑based diffusion bridge framework DB‑SUiT for MRI‑to‑PET translation that operates natively on the cortical manifold. A conditional Spherical U‑shaped vision Transformer (SUiT) is specifically designed to model the intricate cross‑modal relationships while preserving surface topology. It combines spherical convolutional encoders for multi‑scale surface feature extraction with bottleneck Transformers to capture long‑range spatial dependencies, while incorporating demographic and subcortical conditions to refine the synthesis. Evaluated on two datasets, including subjects with different dementia types, DB‑SUiT demonstrates high‑fidelity synthesis that substantially outperforms other baselines. In automated dementia classification, synthesized PET surfaces improve performance over MRI by 14.2% and PET volumes by 11.3%, approaching the performance of real PET surfaces. In a blinded reader study, synthetic PET achieved 85.5% diagnostic accuracy, compared with 75.8% for MRI and 95.2% for real PET. This further demonstrates cross‑cohort and cross‑pathology generalization, as the model was evaluated without retraining on an external cohort that included a dementia subtype not represented during training. Our code is available at https://github.com/ai‑med/DB‑SUiT.
Authors:Jiajun Sun, Zhe Gao
Abstract:
Keyword spotting (KWS), the task of identifying predefined words in speech, is a core capability of voice‑enabled devices. Achieving high KWS accuracy under tight parameter budgets across different vocabulary sizes remains challenging. We present CircleMatch, a matching framework enabling KWS with very few parameters. Its encoder independently compresses frequency bands and fuses them into frame features. These features are then matched against learned class‑specific prototypes to produce temporal response curves. Parameter‑free circular aggregation encodes time as angles and summarizes response distributions and relative timing for classification. We develop four tiny variants, Circle‑D4, Circle‑D8, Circle‑D16, and Circle‑D32, ranging from approximately 1k to 7k parameters in the 12‑class setting. Experiments with multiple random seeds on Speech Commands v1/v2 and the English and Spanish Micro subsets of the Multilingual Spoken Words Corpus demonstrate competitive accuracy with tiny models. Our qualitative analysis further suggests approximate shift equivariance of prototype responses and adaptation to temporal compression. Code and model weights are available at https://github.com/ora942878/CircleMatch.
Authors:Zongze Wu, Baofeng Jia, Weiqi Yan, Jingyuan Zhang, Yu Zang, Xiaoyu Chen, Jing Han
Abstract:
Event cameras offer high temporal resolution and motion sensitivity for tiny UAV detection, yet distant targets generate sparse and fragmented events that are easily overwhelmed by clutter and ego‑motion. Existing methods mainly rely on dense event representations or local sparse spatiotemporal modeling, resulting in redundant computation or fragmented modeling of motion continuity across distant asynchronous events. To address this limitation, we introduce serialized motion evidence accumulation, which treats motion continuity as an ordered evidence propagation process. Specifically, the same event stream is organized into locality‑preserving spatiotemporal paths and chronology‑preserving temporal paths through the latent complementary serializations. Based on this principle, we propose PointEvent, a lightweight event‑wise state‑space framework that alternates serialized scans across the complementary orders, progressively consolidating fragmented motion evidence beyond fixed local neighborhoods. A high‑resolution event branch preserves fine‑grained target responses, while compact context modulation suppresses interference. Experiments demonstrate that PointEvent achieves SOTA with the fewest parameters and fastest measured inference among the compared methods. Code: https://github.com/wzz‑z/PointEvent
Authors:Zhexi Feng, Ruiyi Zhang, Yongbo Yang, Pengtao Xie
Abstract:
A coding agent halfway through an issue has already read much of what a retriever ranks highest. Relevance is scored per passage, but sufficiency belongs to the set: a ranker can fill its budget with variants of one required fact and leave the decision unsupported. We formulate state‑conditioned minimal sufficient evidence recovery: given a captured agent state, recover a compact evidence combination that supplies the support its next decision still lacks. SERBench measures this on 500 held‑out states from 45 repositories, recording what the agent has seen and crediting only sets that cover every fact the current decision was annotated to require. MSS‑Complement treats acquisition as set construction, not ranking. Three semantic calls propose a jointly sufficient set, search for what it lacks, and return 4‑8 intact source units within 6,144 tokens. One configuration, fixed on calibration data, recovers a complete set for 73.0% of those states at five items and 80.6% at eight, against 61.4% and 72.4% for Qwen3 embedding with reranking. A matched control ranking by similarity alone reaches 66.6%, placing the gain in the set‑level policy, not the computation. From frozen repository source with no gold‑derived pool, the lead is 5.0 points. On AMA‑Bench it answers from a 76.2% smaller answer prompt, with accuracy 2.08 points above that benchmark's own memory agent. Removing one required group from an otherwise complete set costs 12.3 and 11.1 points of repair‑localization precision under two executors. Retrieval for agents is better posed as recovering what a decision lacks than re‑ranking what an issue resembles.
Authors:Xin Zhou, Cong Miao
Abstract:
We present Astronex‑World 1.0, an open controllable video world‑model foundation. Given a text prompt (text‑to‑video) or an initial observation (image‑to‑video), the model predicts future visual states under frame‑aligned camera trajectories, continuous actions, and an embodiment identifier, and accepts text events inserted at a specified position of a rollout. The family provides a bidirectional model for full‑context generation and a causal model with block‑causal attention and cross‑block KV caching for persistent generation, both built on the Wan2.2‑TI2V‑5B prior. PRoPE injects camera intrinsics and extrinsics, while a 64‑dimensional action stream modulates every Transformer layer. A five‑stage training path develops bidirectional camera and action control, converts the backbone to block‑causal generation, distills a few‑step student, restores mixed‑domain dynamics, and applies asymmetric DMD/DMD2 distribution matching. The causal model generates 832x480 video at 24 fps. All five training stages run on two NVIDIA L20 48 GB GPUs, and the causal model streams in real time on one. It scores 73.5 on WBench Navi and 70.0 on WBench Full. On Full, this 5B model is above the 13.6B LongCat‑Video and the 14B Helios, within one point of the 22B LTX‑2.3, and above YUME 1.5, which is post‑trained from the same 5B prior on NVIDIA A100 GPUs. The reserved action input and output interfaces allow post‑training for embodied intelligence and autonomous driving.
Authors:Tong Wang, Yuting He, Bin Ren, Yutong Xie, Guanyu Yang
Abstract:
Synthetic image and mask pairs can alleviate scarce colonoscopy annotations, but realistic synthesis requires preserving the supplied lesion while generating compatible mucosa. Existing foreground‑guided methods treat all non‑foreground pixels as background and rely mainly on local integration. Directly applying them to colonoscopy causes two problems: non‑mucosal black regions contaminate generated tissue, and local reasoning produces inconsistent mucosal texture and illumination. We propose LAMP, the first foreground‑guided framework for polyp image synthesis based on lesion‑guided adaptive mucosal context propagation. LAMP explicitly separates the lesion, valid mucosa, and camera exterior using a field‑of‑view (FOV) mask. Lesion‑to‑Mucosa cross‑attention extracts lesion appearance conditions for valid‑mucosa locations, while FOV‑constrained multidirectional Vision Receptance Weighted Key Value propagates them over legal tissue support. An adaptive gate then controls their residual fusion into the diffusion U‑Net. Extensive experiments on five polyp datasets demonstrate that LAMP substantially outperforms existing methods in overall generation quality and consistently improves five downstream segmentation models. Our code will be released at https://github.com/wangtong627/LAMP.
Authors:Yutong Yao, Yanjie Cao, Guanhua Chen, Xu Yang, Junchao Wu, Zeyu Wu, Lidia S. Chao, Derek F. Wong
Abstract:
Large Language Models (LLMs) are increasingly applied to legal and criminal justice tasks, yet existing work focuses almost exclusively on post‑arrest scenarios where the suspect's identity is already known, leaving the critical pre‑arrest challenge of inferring suspect characteristics from incomplete evidence largely unexplored. To fill this gap, we introduce the Profiling, Investigation, and Judgment (PIJ), comprising 2,500 real homicide cases from five countries. PIJ evaluates LLMs across three tasks that span the entire criminal investigation pipeline: criminal profiling, which requires abductive reasoning to infer suspect attributes from fragmentary scene evidence, crime process reconstruction, which tests structured information extraction, and sentence prediction, which demands legal deductive reasoning. We evaluate 9 powerful LLMs and find that performance degrades systematically as tasks shift from explicit fact extraction to implicit reasoning over unknown suspect profiles. Categories requiring inferential reasoning, such as motivation and victim‑offender relationships, remain the primary bottlenecks. Further analysis reveals substantial gaps between LLMs and human experts, along with pervasive biases in gender, age, and motive attribution. Our findings indicate that pre‑arrest inference from incomplete evidence remains an open challenge.
Authors:Yitong Xing, Yuhao Cheng, Yanping Li, Yichao Yan
Abstract:
Detection Transformers (DETRs) achieve strong performance in object detection but remain challenging to deploy on edge devices due to their high computational cost. Existing DETR distillation methods mainly focus on aligning distillation points, while largely overlooking the quality of the teacher's supervision itself. We observe that due to stage‑wise non‑monotonic prediction behavior in DETRs, well‑localized or correctly classified predictions from earlier stages may degrade in later ones, and some negative predictions become increasingly overconfident. As a result, relying solely on the current stage's predictions yields inaccurate and inconsistent supervision. To address this issue, we propose Teacher Prediction Refinement Distillation (TPRD), a plug‑and‑play module that refines teacher predictions before distillation by exploiting stage‑wise prediction information. TPRD improves supervision quality through Positive Prediction Correction (PPC), which corrects degraded positive predictions by restoring more accurate ones from earlier stages, ensuring reliable localization and classification signals, and Negative Prediction Suppression (NPS) suppresses the influence of overconfident negatives, preventing them from providing misleading supervision to the student. To preserve informative dark knowledge, we further introduce Maximum Dark Knowledge Preservation (MDKP), which selectively refines target‑class logits while retaining non‑target relations. Extensive experiments on MS COCO and PASCAL VOC demonstrate the effectiveness and robustness of the proposed method. Our code is available at https://github.com/xingyitong1/TPRD.
Authors:Ryota Mitsuhashi, Tetsuro Morimura, Hirotake Ito
Abstract:
Per‑user LLM inference on transaction histories binds the inference budget linearly to user count, which becomes prohibitive at applied scale. We re‑cast attribute inference from per‑user to per‑transaction‑pattern. The pipeline runs in three phases: Resolve abstracts item names with optional web grounding, Profile infers attributes for each frequent pattern, and Tag clusters free‑text attributes into a queryable database. In Profile, a single LLM call per pattern emits predefined categorical labels, free‑text attributes, and per‑attribute prevalence estimates. Because inference runs over patterns rather than users, the budget grows with the pattern count rather than the user count. On the public Open e‑commerce corpus, the database is statistically indistinguishable from an LLM that reads each user's raw history directly in AUC across the evaluated attributes, and the prevalence estimates carry discriminative signal between positive and negative users. The pipeline is deployed at a major Japanese bank profiling on the order of tens of millions of users, with close to a three‑order‑of‑magnitude reduction in LLM inference targets versus a per‑user pipeline. The code is publicly available on https://github.com/CyberAgentAILab/profiling‑agent‑open‑ecommerce.
Authors:Long Wang, Shuting Zhao, Shen Yan, Siyuan Yu, Xiaoben Li, Zeyu Cai, Yumeng Hou, Yuliang Xiu
Abstract:
Optical motion capture delivers high‑fidelity human motion, but its reliance on strict marker layouts and clean trajectories severely limits its real‑world applicability. In practice, tracking systems frequently output unconstrained markers: sparse, noisy, and unordered point clouds with unknown or varying configurations. To bridge the gap between corrupted raw markers and parametric human models, we introduce DirtyMoCap, a robust, marker‑layout‑free framework. Our core insight is to map unordered marker observations to a fixed set of "proxy anchors" comprising skeletal joints and body surface points, which serve as a stable intermediate representation. We first initialize and track these anchors over long sequences using a recurrent sliding‑window architecture. Then, a custom differentiable Gauss‑Newton solver fits the SMPL‑H model to the tracked anchors to recover full‑body pose, translation, and shape. By explicitly deriving geometric residuals, our solver learns adaptive observation confidence, smoothness, and prior weights end‑to‑end, adapting dynamically to the reliability of the input data. Extensive experiments on diverse, noisy marker configurations demonstrate that DirtyMoCap successfully generalizes across arbitrary layouts using only a single trained model. It consistently outperforms state‑of‑the‑art configuration‑specific baselines in both joint and vertex reconstruction accuracy, while our custom CUDA solver achieves up to a 100x speedup over standard PyTorch implementations. We further apply DirtyMoCap to heterogeneous raw optical MoCap recordings of traditional Chinese martial arts, yielding a Kung Fu motion dataset of temporally coherent SMPL‑H reconstructions. Code and data are available at https://wanglongzju.github.io/DirtyMoCap‑Project‑Page.
Authors:Soha Lee, Soojin Lee, Heesung Yang, Hyunju Song, Hyunji Lee, Jinsan An, Jeongwan Shin, Jin Hyun Park, Jun Lee, Hyeyoung Park, Kilim Nam
Abstract:
Large language models (LLMs) are typically evaluated on static benchmarks, even though natural language constantly evolves through newly emerging words and meanings. Existing Korean benchmarks are centered on established vocabulary and therefore provide limited coverage of such recent lexical change, and their English‑oriented design makes it difficult to assess the typological properties of Korean, in which content words combine productively with functional morphemes. In this paper, we introduce KoNeoBench, a benchmark for evaluating LLMs' understanding of Korean neologisms. KoNeoBench is built on 1,785 Korean neologisms attested in online news since 2020 and curated through expert lexicographic review. Each entry provides usage examples, word‑formation analyses, and dictionary‑style definitions. Based on this resource, we define four tasks and report results on recent models, together with a human baseline. Our experiments show that current LLMs exhibit clear limitations in recovering source components, distinguishing semantic categories, and generating accurate definitions. These results reveal specific aspects of recent Korean lexical change that remain challenging for current LLMs. KoNeoBench is available at https://github.com/bcmilab/ko‑neobench/ .
Authors:Yunqian Cheng, Roberto Manduchi
Abstract:
Floor‑plan‑based indoor visual localization enables infrastructure‑free positioning, but most methods are developed and evaluated in small residential environments unlike the large public buildings of real deployment. We introduce SlugTrails, a floor plan localization benchmark for large indoor spaces under realistic egocentric sensing: 30 Hz Aria glasses recordings across three campus buildings and six floors (22089 m^2 of floor plan outline), CAD‑derived floor plans with semantic classes and circulation space masks, and trajectories aligned into the floor plan frame using laser‑surveyed anchors. One protocol covers three practical ways of gathering geometry under a limited field of view ‑‑ a single walking frame, a stationary multi‑view sweep, and a walking stream with odometry ‑‑ so methods designed for different regimes are compared on the same buildings and ground truth. Evaluating five representative geometric and learned systems under their native sensing configurations, we find that stock checkpoints (official released weights) are near zero on SlugTrails (at most 0.004 R@1m30^\circ on walking single frames), while fine‑tuning on SlugTrails improves every trainable family on all three tasks (e.g., F^3Loc 0.0 \rightarrow 0.141 single‑frame and 0.03 \rightarrow 0.66 sequential), with gains compounding as observations accumulate. The same fine‑tuned weights also improve cross‑dataset generalization on LaMAR with no LaMAR training (sequential R@1m 0.048 \rightarrow 0.143 for F^3Loc and 0.063 \rightarrow 0.127 for UnLoc), whereas train‑from‑scratch on SlugTrails alone stays far below fine‑tuning from stock weights ‑‑ evidence that floor plan localization is currently limited by indoor data rather than by architecture. We release the dataset, protocols, and tools at https://github.com/Head‑inthe‑Cloud/SlugTrails.
Authors:Stefano Cerri, Amirhossein Hassankhani, Yaël Balbastre, Koen Van Leemput
Abstract:
We propose a new probabilistic model for general‑purpose medical image registration that builds upon the mutual information registration criterion. It centers around a spatial interpolation technique that assumes latent voxel‑wise correspondences between the images being registered. By exploiting these latent variables, we derive dedicated optimization and MCMC sampling techniques that only involve closed‑form iterative updates. When applied to nonlinear registration, an efficient demons‑like optimization algorithm is obtained that shows robust out‑of‑the‑box performance across a variety of monomodal and multimodal registration tasks. We also demonstrate a corresponding sampler that can quantify, for the first time, uncertainty in multimodal registration scenarios with very high‑dimensional 3D deformations. Our code, which we call BINDER (Bayesian INference for DEformable Registration), is freely available at https://github.com/ste93ste/BINDER.
Authors:Ruchao Bao, Wenzheng Wu, Chucheng Xiang, Zhongyuan Liu, Yuan Liu, Jinxin Dong, Ligang Liu, Ziqi Wang
Abstract:
3D assembly is fundamental to modern manufacturing and digital content creation. In this paper, we present PART, a unified transformer‑based framework for 3D part retrieval and assembly: given a target shape and a part library, PART automatically selects the appropriate parts and predicts their 6‑DoF poses to reconstruct the target. While prior work has achieved impressive progress on assembling a pre‑defined set of parts, this more practical retrieval‑based setting remains largely unexplored. The task faces three key challenges: (i) a combinatorially explosive search space that grows exponentially with library size; (ii) variable‑length outputs, as different targets require different numbers of parts; and (iii) continuous 6‑DoF pose estimation for part assembly. To address these, we formulate retrieval and assembly as a set prediction problem and design a novel transformer‑based framework that retrieves parts and regresses their poses with variable‑length output. Additionally, we exploit the duality between part pose estimation and target segmentation through joint training and a novel segmentation‑enhanced optimization module. Finally, We curate a large‑scale dataset of 80K+ shapes, and the results show that PART generalizes to scene layouts, image targets, and real‑world scans. Project Page: https://iambrc.github.io/PART‑project‑page/.
Authors:Mario Alonso, Miguel Ángel Sacristán, Guillermo Botella, Alberto A. Del Barrio
Abstract:
Posit arithmetic offers a compelling alternative to the IEEE 754 floating‑point standard, providing enhanced accuracy. Its fused multiply‑accumulate operations avoid intermediate rounding, ensuring exact numerical reproducibility through the quire, a wide fixed‑point accumulator spanning the format's full dynamic range to prevent precision loss and overflow during long accumulations. However, integrating such large accumulators incurs significant area and power overheads. This paper presents an optimized, high‑frequency Multispeculative PositMAC architecture for 32‑ and 64‑bits Posit. First, the pipeline is restructured to balance the different stages. Second, high‑speed multiplication topologies are evaluated, showing that a Booth‑4 scheme with Kogge‑Stone adders meets a stringent 0.5ns target (2Ghz). Finally, the wide monolithic quire accumulator is replaced with a Multispeculative Adder, diminishing area up to 19.8% while reducing energy consumption by more than 50% when compared to the baseline. Compared to other state‑of‑the‑art designs, our proposal achieves the highest operating frequency and reduces cycle time by up to 79.0% with respect to 64‑bit quire‑enabled alternatives. This performance is attained without increasing resource overhead, as the design remains strictly smaller in area and achieves lower per‑cycle energy consumption than all quire‑capable counterparts.
Authors:Bing Duan, Qiang Guo, Linpu Li, Zhijian Mao, Min Zhu, Zhirui Ren, Yiwei Yan, Xi Chu, Xiaoding Li
Abstract:
Between a screenplay and a film sits a planning problem that is spatial first: who stands where, and what a camera sees from where it stands. An image diffusion model asked for a shot in free text settles that plan by its own defaults. We present PACE (Precise AI Cinematic Expression), a typed representation for the plan: the screenplay evidence, the characters, props and locations it needs, where each subject stands, and what the camera does. A value is written once at the level it belongs to (script, scene, shot or panel) and inherited below it. A compiler turns the result into both the prompt sent to the diffusion model and a 3D scene built in metres, and a camera solver places the camera so that the declared framing is the framing built. Where a declared value becomes geometry, PACE measures, field by field, how far the compiled camera and the staged render sit from the declaration, rather than asking a model to judge. On the 11‑scene Automatic Drive screenplay, every staged single‑subject panel places its subject within 1.2% of frame width of its declared position; with two or three subjects one camera pose cannot satisfy every position, and the residual is reported rather than absorbed. On 204 external director‑storyboard shots, delivered head height is 1.906 times the staged target from the director's words, 1.733 from the compiled prompt, and 0.955 with the greybox control; the condition that holds framing best draws the described action least. Declaring the pose on 30 shots raises the action drawn from 58.9% to 74.4% without moving the framing. Transitions, fitted motion and human review of the generated panels remain open. Code: https://github.com/StudioPiLabs/pace‑core
Authors:Shiyue Su, Song Wang, Zekai Zhan, Junjie Zeng, Ziling Lu, Zongsheng Li, Xinyuan Ye, Zhiyuan Ma, Xinke Shen, Quanying Liu
Abstract:
Effective EEG decoding requires representations that preserve organization among channels, local waveform dynamics, and long‑range temporal context. Existing EEG architectures often capture these structures using separate specialized modules or collapse them into a single token sequence, making it difficult to maintain their distinct roles and coordinate their interactions throughout the backbone. We propose TriDim, a reusable block that preserves the representation shape and keeps three EEG axes explicit: channel, sample position within each patch, and patch position across the recording. These axes correspond to spatial, short‑term temporal, and long‑term temporal information, respectively. Each TriDim block applies feed‑forward transformations along individual axes and cross‑axis attention to coordinate information exchange among them. By stacking TriDim blocks with a multi‑level tri‑axis readout, we construct TriDimEEG, a standalone EEG decoder. Under strict cross‑subject evaluation on eight datasets spanning clinical diagnosis, sleep staging, motor imagery, and emotion recognition, TriDimEEG achieves the best overall performance among fifteen evaluated models, with a 4.3% relative improvement in average accuracy over the second‑best model. Replacing Transformer blocks in three EEG foundation models with TriDim blocks yields an average relative improvement of 7.4% in downstream accuracy while reducing parameter counts by 17.0% to 47.3%. These results establish TriDim as an effective and reusable building block and TriDimEEG as a strong standalone EEG decoder. Code and parameters of TriDimEEG are available at https://github.com/ncclab‑sustech/TriDim_model.
Authors:Péter Ferenc Gyarmati, Trevor Manz, Dominik Moritz, Mennatallah El-Assady
Abstract:
In a computational notebook, a human can point to a rendered result and ask about "this," while an agent acts through cells, dependencies, and runtime state. When what the human sees and what the agent operates on are disconnected, the human must describe what they mean and trace what the agent did in prose that strips away situated visual and computational context. We present marimo‑lens, an extension to the reactive Python notebook marimo for grounded human‑agent analysis. Lens connects a human's marked output and note to its producing cell and relevant contributing computation, giving the agent computational context for the request. It surfaces agent activity, returns selected results to the notebook, and preserves the initiating selection for human review and reopening. We illustrate the lifecycle through an exploratory human‑agent analysis of a real‑world open dataset, showing how visually situated questions lead to computational inspection, notebook action, and returned evidence for human review.
Authors:Samuel Radler, Leon Prüller, Emanuele Artioli, Farzad Tashtarian, Christian Timmerer
Abstract:
As streaming services become more commonplace, analyzing their behavior effectively under different network conditions is crucial. This is normally quite expensive, requiring multiple players with different bandwidth configurations to be emulated by a powerful local machine or a cloud environment. Furthermore, emulating a realistic network behavior or guaranteeing adherence to a real network trace is challenging. This paper presents PyStream, a simple yet powerful way to emulate a video streaming network, allowing multiple simultaneous tests to run locally. By leveraging a network of Docker containers, many of the implementation challenges are abstracted away, keeping the resulting system easily manageable and upgradeable. We demonstrate how PyStream not only reduces the requirements for testing a video streaming system but also improves the accuracy of the emulations with respect to the current state‑of‑the‑art. On average, PyStream reduces the error between the original network trace and the bandwidth emulated by video players by a factor of 2‑3 compared to Wondershaper, a common network traffic shaper in many video streaming evaluation environments. Moreover, PyStream decreases the cost of running experiments compared to existing cloud‑based video streaming evaluation environments such as CAdViSE.
Authors:Suji Kang, Seok-Young Kim, Young Bin Kim, Taewook Ha, Dieter Schmalstieg, Shohei Mori, Woontack Woo
Abstract:
We propose SnapPhysics, a training‑free framework that reconstructs 3D objects and estimates their physical properties such as mass, friction, and center of gravity from a single image. For physically coherent interactions in mixed reality (MR), such properties are as important as geometry. Prior approaches infer them by analyzing object dynamics in video, which is computationally costly, or by querying vision‑language models (VLMs) on single images, which lacks geometric grounding and inter‑object relationships. We address these limitations by combining instance‑level 3D reconstruction and spatial alignment with a physics‑aware scene graph that encodes these relationships and per‑object metric geometry as structured context for VLM‑based property reasoning. Experiments on 3D‑FRONT show that SnapPhysics improves scene‑level F‑Score by 18.6% over the best learning‑based method, and on real captured scenes with ground‑truth mass, it reduces the mean absolute log difference error (mALDE) by up to 20.5% and improves log‑scale correlation (r^2_\mathrmls) by up to 19.6% over VLM‑only estimation. SnapPhysics enables physically interactive MR experiences without manual parameter tuning. Project page: https://snapphysics‑ismar2026.github.io/.
Authors:Sirui Lu, Ruixuan Deng, David Zhu, Zhengfeng Ji
Abstract:
Landmark mathematical formalizations have taken specialist teams years to complete. We present FormalFlow, a system that coordinates AI proving agents under human supervision to address statement drift and proof composition in long‑horizon formalization. Drawing on software engineering principles and practices, it uses a shared blueprint to guide nested planning, proving and review loops. Agents strengthen verification and review throughout formalization. We completed a machine‑checked Lean 4 proof of the quantum soundness of the classical low individual‑degree test, a core theorem underlying MIP = RE. Developing the proof took 63 days; greater parallelism could further reduce this time. The final library contains 126,367 lines of Lean code, all generated by agents. The formalization corrects side conditions and intermediate errors while preserving the published final error bound under corrected assumptions. This work provides a verified foundation for quantum complexity and demonstrates a route to affordable verification of major research proofs by small teams.
Authors:Bo Xu, Chenyuan Wang, Xinyu Chen, Quanhao Zhu, Rui Lin, Liang Zhao, Hongfei Lin, Feng Xia
Abstract:
Hateful memes spread abusive content through implicit interactions between images and text, posing serious threats to the safety of online communities. In recent years, multimodal large language models have been widely used for hateful meme detection and are increasingly adopted to generate explainable detection results. However, we find that existing explain‑then‑detect methods often couple explanation generation and label prediction within the same training process. This coupling causes interference between task objectives, leading to limited detection performance and even worse results than simple SFT baselines. To address these challenges, we propose ProKDA, a progressive knowledge‑to‑decision alignment method for explainable hateful meme detection. Inspired by the human annotation training process, ProKDA first uses an agentic background knowledge construction pipeline to obtain external knowledge related to meme understanding. It then adopts a three‑stage training strategy that sequentially performs background knowledge learning, hatefulness detection learning, and hatefulness boundary alignment. Unlike prior explain‑then‑detect methods that jointly optimize both tasks, ProKDA focuses on a single training objective at each stage. This design reduces interference between the two tasks and progressively transforms background knowledge into robust detection decisions. Experiments on three public hateful meme benchmarks show that ProKDA achieves state‑of‑the‑art detection performance and provides accurate, explainable, and evidence‑supported decisions for hateful meme moderation. Project page: https://meizhiyuan88666.github.io/prokda.
Authors:Yuheng Shi, Xiaohuan Pei, Minjing Dong, Chang Xu
Abstract:
Fine‑grained visual perception in MLLMs is commonly improved by raising the resolution, but the added visual tokens inflate vision‑encoding and language‑model prefilling costs. We show that the two operations underlying fine‑grained perception, localizing the region of interest (RoI) and recognizing its content, have different resolution requirements. In a controlled diagnostic, localization tolerates roughly 3 to 4 times stronger token compression than recognition, which motivates localizing from a coarse view and concentrating resolution on the selected evidence. Decoding coordinates with the MLLM can be trained end‑to‑end from answers, but costs a full model pass per query and depends on grounding ability. A lightweight proposal network distilled from the model's attention is fast, but inherits the noise of its attention targets. The RoI from the proposal network reaches the answer through a discrete region choice, so its faithfulness to the answer cannot supervise the network. We therefore optimize the proposal network with region‑level reinforcement learning, which we call Vision‑RL2. It treats coherent regions as actions, and a frozen MLLM reader scores each one by how its removal changes the answer likelihood. Complementary subtractive and additive objectives suppress distracting proposals and recover missing evidence, updating only the predictor without region annotations, response sampling, or reasoning trajectories. The refined proposal further enables a sparse encoding that magnifies evidence and excludes background tokens. Across six fine‑grained benchmarks and four MLLM backbones, Vision‑RL2 improves accuracy over the base model at every token budget and surpasses its largest‑budget accuracy with about 4 times fewer visual tokens. Code is available at https://github.com/YuHengsss/VisionRL2 .
Authors:Zixiang Ai, Zhenyu Cui, Yufei Guo, Wenwen Qiang, Lei Chen, Jiwen Lu, Jiahuan Zhou
Abstract:
Pre‑trained 3D vision models have substantially advanced point cloud analysis, yet adapting them to downstream tasks via full fine‑tuning is computationally expensive and storage‑intensive. Parameter‑Efficient Fine‑Tuning (PEFT) offers a promising alternative by reducing both adaptation cost and storage burden. However, existing prompting‑based approaches ignore the intrinsic geometric structures of point clouds, thereby limiting their adaptation capability. This limitation stems from their inability to encode both fine‑grained geometric cues and coarse‑grained structural semantics, as well as failing to propagate such information effectively through the model hierarchy. To address these challenges, we propose GAPrompt++, a multi‑granular geometry‑aware prompting method that provides richer geometric guidance for efficient 3D task adaptation. Specifically, we introduce a Point Shift Prompter that extracts multi‑granular geometric features across different scales, enabling instance‑specific geometric adjustments during adaptation. Next, a Keypoint Prompter adaptively generates point‑level prompts to highlight local geometric saliency and fine‑grained structural details. Furthermore, a Prompt Propagation mechanism injects these multi‑granular geometric cues throughout the feature extraction hierarchy, strengthening the ability to capture essential geometric characteristics. Extensive experiments show that GAPrompt++ achieves state‑of‑the‑art performance among prompting‑based PEFT methods and even surpasses full fine‑tuning across diverse benchmarks, while requiring less than 2% trainable parameters. In addition, to address the saturation of existing evaluation datasets, we construct two more challenging benchmarks derived from 3D Gaussian Splatting and Multi‑View Stereo reconstruction, offering diverse and realistic point cloud scenarios to promote future research.
Authors:Sulgi Kim
Abstract:
Batched multi‑armed bandits update on a service's own schedule, and the usual implementation carries each arm's absolute reward rate from one update to the next. When the shared level moves between batches, that memory goes stale even though the comparisons between arms may not have. Odds‑Ratio Thompson Sampling (OR‑TS) instead carries the joint posterior over log‑odds contrasts and fits the common level afresh in every batch, marginalizing it out. This paper specifies that update, places it inside a Bayesian bandit agent with two controls, decay for how much past evidence survives an update and aggressiveness for how sharply belief becomes allocation, and evaluates it against absolute‑rate memory. Across 86 public A/B series the level varies about twenty‑five times more than the contrast. In prespecified synthetic environments a moving level costs absolute‑rate memory five times the regret and leaves the best arm below a majority of traffic in 7 of 20 runs, against none for OR‑TS. In a policy simulation built from 71 real experiments, where the contrasts are too small to resolve, expected‑click differences stay within 0.1% for 58 of them, yet contrast memory still ends on the better arm more than twice as often. Where the contrasts themselves move, the bet fails, and that case is reported too.
Authors:Zeyu Han, Zichong Meng, Julian Tanke, Minami Matsumoto, Sergey Bashkirov, Yingruo Fan, Selim Engin, Dongseok Shim, Takashi Shibuya, Yuki Mitsufuji, Huaizu Jiang
Abstract:
We present LYRIC, a generative flow‑matching controller for language‑driven physics‑based contact‑rich interaction control, that enables simulated characters to perform contact‑rich whole‑body object interactions from a free‑form language instruction and a sparse terminal object goal. To obtain reliable expert trajectories from imperfect motion‑capture references, a single tracking policy is trained using geometry‑conditioned interaction rewards and relaxed reference tracking near hand‑object contact. To guide interaction progress without prescribing a full‑body kinematic reference, we factorize the controller into a task‑level planner that predicts short‑horizon object and humanoid‑root trajectories, and an action generator that resolves whole‑body motion and contacts in closed loop. After behavior cloning, we freeze the planner and post‑tune the action generator on policy using the planner's predictions as stable supervision for intermediate task progression. In a controlled OMOMO evaluation, our tracker achieves 64.3% success compared with 53.2% for an InterMimic reimplementation, while a unified policy achieves 76.5% on the full OMOMO dataset. On the held‑out split, LYRIC achieves 90.3% task success, compared with 74.2% for the strongest matched kinematic‑planner baseline, with better semantic alignment and motion quality. Without retraining, the controller also supports test‑time object‑waypoint guidance. Qualitative results further demonstrate robust, natural contact‑rich interactions and zero‑shot transfer to novel object shapes. The webpage is available at https://neu‑vi.github.io/LYRIC/
Authors:Bang An, Maria Hamdani, Joseph Fox
Abstract:
Business analytics education requires diverse datasets to support different learning objectives, student backgrounds, and analytical tasks. Real‑world data can be difficult to obtain and offer limited flexibility for adapting a case to a particular course. Even when suitable data are available, instructors must investigate the patterns, verify the results, and prepare assignments and reference solutions, requiring substantial time and effort. The use of large language models (LLMs) introduces an additional concern about training data contamination. Widely used public datasets often have extensive tutorials and worked analyses that models may have encountered during training. Students may therefore receive explanations drawn from existing analyses without practicing how to investigate unfamiliar data in collaboration with AI. This paper presents DataCanvas‑EDU, an agentic framework for instructor‑guided synthetic data generation in business analytics education. Instructors specify teaching goals and intended patterns through conversation, while an AI agent writes generation code, checks the resulting data, and prepares assignments, reference analyses, and rubrics. Four phases, Plan, Create, Verify / Test Analysis, and Evaluate, organize the process and support instructor review and revision. The framework is intended to simplify case preparation while creating opportunities for students to investigate newly designed patterns with AI. We illustrate the approach with WindowDash, a food delivery case containing 15,000 orders and nine designed patterns. DataCanvas‑EDU is packaged as a reusable AI Agent Skill for compatible agent environments, with the package and installation instructions available at https://github.com/BANG23333/datacanvas‑edu
Authors:Xingyu Liu, Yu Dong, Qizhen Yu, Shiyu Cheng, Zhe Wang, Guan Li, Guihua Shan, Dong Tian, Christy Jie Liang, Quang Vinh Nguyen
Abstract:
Retrieval‑Augmented Generation (RAG) is increasingly used to ground large language model (LLM) outputs in scientific literature. However, in open‑ended literature exploration, the evidence context used for generation is often produced through hidden retrieval, reranking, assessment, and filtering steps. Users may receive retrieval summaries without knowing how the system constructed the evidence context, which evidence units were retained or discarded, or whether potentially useful evidence was excluded before synthesis. We present FootprintRAG, an LLM‑agent‑powered visual analytics system for evidence context refinement in RAG‑based scientific literature exploration. The core idea is to treat the RAG evidence context as an explicit, inspectable, and revisable analytical object before generation. FootprintRAG parses scientific literature into text and figure evidence units, expands an initial query into parallel query variants, retrieves and assesses evidence across iterative rounds, and surfaces ERS‑ranked supplementary candidates from the corpus‑level evidence space. Through coordinated views, the system connects retrieval trajectories, evidence‑state revision, and provenance‑aware summary generation into a user‑steerable workflow. We evaluate FootprintRAG through two case studies, a user study, and a workflow‑level comparison with representative RAG systems. The results show that FootprintRAG helps users compare retrieval directions, revise candidate evidence, recover potentially overlooked evidence, and trace generated summaries back to supporting evidence units. FootprintRAG is available at https://github.com/meteorshowering/FootprintRAGVA.git.
Authors:Alex Remedios, Simon Storf, Fabien Roger, John Hughes
Abstract:
To keep coding agents from going off the rails, production systems now review each proposed action with a blocking monitor that can reject it before it runs (Auto Mode in Claude Code, Guardian in OpenAI's Codex). Prior evaluations of such monitors largely measure robustness to accidental harm or prompt injections from untrusted sources looking to hijack the agent. Less understood is how they hold up when the agent they monitor is persistently misaligned. To understand this risk, we task an adversarial agent with evading production blocking monitors and causing catastrophic harm, e.g. by exfiltrating its own weights. We find that when instructed with high‑level attack strategies, adversarial agents can succeed through several distinct mechanisms, such as agent‑generated prompt injection against the monitor, multi‑agent attacks, and malicious compaction. In particular we find that in 79% of trials, the agent can use an injection attack against Auto Mode and Guardian to run arbitrary bash commands. We also find that it is possible to greatly improve Auto Mode through design changes like enhancements to tool coverage, transcript formatting and an agentic monitor stage. Even with these improvements, preventing multi‑context attacks at an acceptable cost remains an open problem. By detailing our red‑teaming methodology and highlighting new attack vectors, we aim to help defenders evaluate their mitigations against the possibility of persistent malign coding agents. Code is available at https://github.com/safety‑research/red‑teaming‑auto‑mode.
Authors:Khang Nguyen Quoc, Minh-Phuoc Tran, Gia-Han Truong, Luyl-Da Quach
Abstract:
Artificial intelligence for plant disease analysis has advanced from task‑specific classifiers to multi‑modal models capable of jointly interpreting visual and textual information. However, practical deployment in precision agriculture remains limited because most existing approaches treat disease understanding as isolated prediction tasks, failing to capture the complementary relationships among symptom recognition, severity assessment, and question‑driven diagnostic reasoning. In tomato pathology, accurate interpretation of diseased leaves requires more than label prediction; it demands integrating visual symptoms with semantic context to support a comprehensive and explainable understanding. Here, we present SOLAR, a multimodal generative model that understands tomato disease spanning six question‑answering tasks. SOLAR learns to align visual features with task‑aware language representations by Fusion Expert module based on mixture‑of‑expert, enabling it to generate contextually relevant answers across diverse diagnostic tasks. By formulating tomato disease analysis as a generative Visual Question Answering (VQA) task, SOLAR provides a flexible framework that supports multi‑task inference within a single model while improving performance and cross‑task knowledge sharing. We evaluate SOLAR on 41,677 images, including 216,209 Question‑Answering (QA) pairs to understand tomato leaf disease under both closed and open‑ended QA settings. Experimental results show that SOLAR consistently outperforms state‑of‑the‑art vision‑only, vision‑language, and task‑specific models across all tasks, demonstrating superior accuracy, robustness, and multimodal reasoning. These findings highlight the potential of generative multimodal modeling as an effective direction for understanding of plant disease. The code for this study is available at https://github.com/EnalisUs/SOLAR.
Authors:Shuo Cai, Yanggan Gu, Zihao Wang, Yuanyi Wang, Yibo Yan, Wenjun Wang, Yuhang Liu, Guanghao Zhu, Sirui Huang, Ming Li, Hongxia Yang
Abstract:
Model fusion integrates the capabilities from source models into a single target model. As of June 2026, Hugging Face hosts more than 2M models. This growing pool provides a rich base for model reuse and capability integration. Yet existing surveys often cover only separate parts of this space, and they do not provide a unified definition or a systematic taxonomy. This survey defines model fusion and organizes prior work into three levels: parameter‑level, representation‑level, and behavior‑level fusion. We also review related metrics, benchmarks, and applications, summarize current challenges, and identify future directions. Our goal is to provide a clear map of this area and support future work on model fusion. A comprehensive list of papers about model fusion is available at https://github.com/Baicaihaochi/Awesome‑Model‑Fusion‑Survey.
Authors:Haining Wang
Abstract:
A golden ticket allows one reviewer to advance a proposal that the rest of a panel would reject. We assess its score‑based rationale by comparing minority‑support ranking with other rules for allocating the same number of places. We do so on 10,625 rejected submissions to a computer‑science conference between 2017 and 2024, using later citation percentiles as the outcome. Minority‑support ranking measured the gap between the two highest scores after adjustment for the panel mean and reviewer count. At a budget of 10% of the year's accepted count, panel‑mean ranking selected submissions with a mean citation percentile 7.75 points higher than minority‑support ranking (95% bootstrap interval 4.35 to 11.09). The difference was larger in the other sample periods and citation windows examined. At that budget, minority‑support ranking was equivalent to a lottery within a margin of plus or minus 5 percentile points. Two further analyses, adjusted highest‑score ranking and a matched comparison, found no clear citation advantage from minority support once the panel mean was accounted for. Ranking on score variance also outperformed minority‑support ranking in a paired comparison. Estimates cover the 69.8% of eligible rejections whose later citations could be verified. These comparisons identify panel‑mean ranking as a benchmark for evaluating whether golden tickets select work that would otherwise be overlooked.
Authors:Hengyi Wang, Lourdes Agapito
Abstract:
We present AMB3R‑SLAM, a real‑time monocular SLAM system capable of reconstructing kilometer‑scale trajectories over 10k frames on a single consumer‑grade GPU. Our model couples a lightweight front‑end for low‑latency online tracking with a hierarchical backend that progressively enforces local, mid‑level, and global consistency. By avoiding bundle adjustment that relies on the static world assumption, our system naturally handles complex dynamic scenes out of the box. Furthermore, we demonstrate that our method can be extended to leverage stereo, RGB‑D, and LiDAR as additional inputs. AMB3R‑SLAM achieves strong camera tracking performance across 9 datasets, reducing the absolute trajectory error (ATE) of previous state‑of‑the‑art methods on VBR and Oxford Spires by over 70%. With additional LiDAR input, our model further reduces ATE to sub‑meter level on KITTI and VBR datasets.
Authors:Abdarahmane Traoré, Andy Couturier, Éric Hervet
Abstract:
Text‑based person retrieval under a sim‑to‑real gap (synthetic training data, a real‑image gallery) is usually tackled with costly fine‑tuned cross‑encoders. We ask whether a frozen‑encoder system can compete. We present SCOUT, which casts cross‑modal retrieval as prediction in embedding space. A trainable predictor maps the patch tokens of a frozen video encoder into the embedding space of a frozen text encoder under a bidirectional InfoNCE objective, and no encoder is fine‑tuned in the base model. The video encoder is V‑JEPA, the text encoder is EmbeddingGemma, and the predictor is initialized from a Qwen3.5‑0.8B decoder. We make three findings. First, the best frozen text encoder is simply the one whose geometry best matches the video features. A training‑free alignment score ranks three candidate text encoders in the same order as their retrieval accuracy on our held‑out split (Spearman ρ= 1.0); a fourth, LLM‑based encoder shows the rule is metric‑dependent, holding for a neighborhood‑overlap score (ρ= 0.8) but not for a linear probe (ρ= ‑0.2). Second, two precision‑targeted levers, parameter‑efficient ExPLoRA adaptation of the video encoder and a training‑free attribute‑decomposed reranker built on a vision‑language model, improve the top‑rank precision that otherwise limits the frozen system, adding 2.2 points of leaderboard R@1. Third, a local‑versus‑public calibration study explains which interventions transfer to the real domain. On AI City Challenge 2026 Track 4 the full retrieve‑fuse‑rerank system reaches 84.25 mAP@10 on the final leaderboard, while a single frozen model submitted alone reaches 60.63. Our trained components cost about 95 GPU‑hours. CMP, the dataset authors' fine‑tuned cross‑encoder that trains for sixteen GPU‑days, is one fusion member of the full system, not an alternative. Code and annotations: https://github.com/abtraore/SCOUT‑ECCV
Authors:Damian Delmas
Abstract:
Algebraic Retrieval lets AI agents compose search strategies at query time. Relevance criteria, eligibility constraints, and ranking preferences can be expressed together in a mathematical query. The query surface exposes available operations, so an agent can combine them for the question at hand and revise a program after inspecting results. We evaluate execution parity, not agent behavior or retrieval quality. Building on Programmatic Embedding Modulation (PEM), which exposes vector and score arithmetic during retrieval, we demonstrate contrastive scoring, candidate‑pool reranking, and weighted ranking as composable queries, alongside executable SQL and PyTerrier counterparts. On the public 11,429‑document Vaswani fixture, each program's implementations select the same document set with score differences below 1e‑6; one tied pair orders differently across scoring paths.
Authors:Lyuxing He, Daniel Guo, Elizabeth Terveen, Deepak Pathak, David Held, Tal Daniel
Abstract:
We present ParticleSplat, a self‑supervised object‑centric learning method that decomposes scenes into a set of latent ''particles'' representing semantic entities through feedforward 3D Gaussian Splatting. Building on the Deep Latent Particles (DLP) framework, which represents images as a set of particles with attributes such as position, scale, and visual appearance, we address a key limitation of DLP: its inherently 2D nature, which prevents explicit 3D spatial and geometric reasoning that are critical for downstream tasks such as robotic manipulation. Leveraging the structural similarity between latent particles and 3D Gaussian primitives, we introduce a 3D latent particle space trained with a novel view synthesis objective. Our model jointly encodes multiple views with camera poses into a shared 3D object‑centric latent space, then transforms particles into particle‑aligned 3D Gaussians whose composition reconstructs the full scene. On simulated and real‑world datasets, we show that this formulation inherently learns object masks without supervision and supports controllable 3D scene editing, such as moving objects by modifying particles in the latent space. We further establish that the learned 3D representation improves downstream performance on robotic manipulation tasks.
Authors:Dayoung Kil, Seong-heum Kim
Abstract:
The Mobile Unified Multimodal Understanding (MUMU) Challenge requires a single efficient model to jointly perform multi‑concept image tagging, open‑vocabulary object detection, and image captioning. We present Efficient Unified Multimodal Understanding (EUMU), the winning solution for the MUMU Track of the 8th LSVOS Challenge. EUMU builds on a shared pretrained multimodal model, using its prompt‑based capabilities for detection and captioning and training lightweight heads on shared visual features to predict quality, scene, and event tags. Rather than treating the three tasks independently, EUMU applies task‑aware inference refinement by reusing task outputs as cross‑task cues. For detection, caption cues help recover objects missed by the initial detection. For captioning, detection cues help refine the caption to better reflect the detected objects. For tagging, image statistics refine quality predictions, while caption and detection cues refine scene and event predictions. This design unifies all three tasks within a single model while satisfying the challenge's resource constraints. EUMU contains 239.169M parameters, requires 23.947 GFLOPs, uses 4.5 GB of peak inference memory, and achieves a final challenge score of 17.3409. Code and models are available at https://github.com/Dayoung‑Kil/EUMU.
Authors:Pan Wang, Siwei Song, Hui Ji, Siqi Cao, Heng Yu, Zhijian Liu, Huanrui Yang, Yingyan Celine Lin, Beidi Chen, Mohit Bansal, Xiaoming Liu, Pengfei Zhou, Ming-Hsuan Yang, Tianlong Chen, Jingtong Hu
Abstract:
The rapid expansion of multimodal models has surfaced formidable bottlenecks in computation, memory, and deployment, catalyzing the rise of Efficient Multimodal Learning (EML) as a pivotal research frontier. Despite intensive progress, a cohesive understanding of what, how, and where efficiency is manifested across the learning stack remains fragmented. This survey systematizes the EML landscape by introducing the first structured, model‑to‑system taxonomy. We distill insights from over 300 seminal works into three hierarchical levels‑‑model, algorithm, and system‑‑addressing architectural parsimony, execution refinement, and hardware‑aware orchestration, respectively. Moving beyond a purely categorical review, we offer a methodological synthesis of the vertical synergies between these layers, elucidating how cross‑layer co‑design contributes to the fundamental "Efficiency‑Utility‑Privacy" trade‑off. Through an integrative case study of Multimodal Large Language Models (MLLMs), we trace the field's evolutionary trajectory from initial structural adjustments to modern full‑stack resource orchestration. Furthermore, we provide a holistic discussion and application‑specific optimization blueprints for diverse domains and posit a paradigm shift toward self‑regulating intelligence, where efficiency is an intrinsic, emergent property of the model's fundamental design rather than a post‑hoc constraint. Finally, we present open challenges and future directions that will define the trajectory of EML research. This survey establishes a structured framework for multimodal systems that are not only high‑performing and generalizable but natively efficient and ready for ubiquitous deployment. A continuously updated version is available at https://github.com/pwang322/Efficient‑Multimodal‑Learning‑Survey.
Authors:Jiuyi Xu, Jinjia Guo, Meida Chen, Jing Du, Yangming Shi
Abstract:
World action models (WAMs) rely on video‑generation backbones, requiring substantial memory and compute for deployment. Post‑training quantization reduces memory and can accelerate inference, but bit width, grouping, and quantizer choice define a large configuration space. Identifying configurations that preserve task performance through exhaustive closed‑loop evaluation is costly. We propose PreDE (Predict Before You Deploy), a policy‑calibrated framework for predicting quantization‑induced task degradation from offline action deviations. Using closed‑loop outcomes from a small development set, PreDE calibrates two thresholds and accepts, rejects, or defers new configurations using a fixed observation log. Under a within‑setting label‑ordering hypothesis, the rule issues decisions where all thresholds consistent with the development labels agree. Across five WAMs and four benchmark settings, quantization produces configuration‑dependent task losses that cannot be explained by bit width alone or a shared deviation threshold. Across 28 held‑out configurations from two policies, PreDE issued 21 decisions before observing closed‑loop outcomes (75% coverage), all matching the observed acceptable or degraded labels. Deferred candidates included both acceptable outcomes and a 33‑percentage‑point loss. In 450 Franka Research 3 trials across two independently fine‑tuned policies, all configurations assigned to high‑deviation groups before testing showed significant degradation, while low‑deviation comparisons showed no statistically significant degradation. On the real robot, W4A4 achieved a 1.37x action‑query speedup and approximately 44% lower peak memory. These results support policy‑specific behavioral calibration for quantization configuration selection while identifying candidates that require closed‑loop evaluation. The code is available at https://github.com/jiuyixu25/PreDE.
Authors:Xiaobiao Du, Yida Wang, Cheng Bi, Kun Zhan, Xin Yu
Abstract:
Gaussian Splatting has significantly improved the quality of novel view synthesis with explicit Gaussian representation. However, we observed that existing 3D Gaussian Splatting methods (3DGS) often suffer from surface collapse issues on reflective regions, and thus produce inferior geometry and low‑quality specular. In this work, we propose a physically‑based deferred rendering framework, named Reflection‑aware Gaussian Splatting (RGS), that can accurately model specular regions and improve novel view synthesis performance. Specifically, we found that a powerful 3D foundation model can provide a strong 3D geometric prior to foster correct geometric modeling. Based on this, we propose a cross‑view shape consistency regularization to regularize the geometry surface with the large model prior and cross‑view constraints. In this manner, our RGS can produce smoother geometric surfaces on reflective regions while reducing geometric hollows. To further improve rendering results on reflective regions, we present a reflection‑aware densification strategy that is designed to capture specular variations across various views. With this strategy, our RGS is able to render novel views of objects in higher quality. Extensive experiments demonstrate our method consistently renders high‑quality reflective objects, achieving state‑of‑the‑art performance.
Authors:Dimitris Papailiopoulos
Abstract:
The exact capacity of the binary deletion channel remains unknown despite decades of work on achievable rates and converse bounds. We establish a computer‑assisted approximation whose error is below 0.0095 bits per transmitted bit, uniformly over all deletion probabilities. The mean certified error bound, with uniform weighting of deletion probability, is below 0.006522. The estimate is the midpoint of explicit lower and upper bounds. For the converse, a stationary‑source reduction is combined with finite inequalities covering every allowed input configuration. Two constructions control the unobserved input beyond a finite window: one uses a common outside survivor sequence and bounds omitted deletion patterns, while the other cancels an entropy term to make outside probabilities enter linearly. For the lower bound, finite‑state inputs combine output‑entropy estimates with selected disjoint counts of compatible deletion masks; independent‑run inputs retain additional uncertainty about output‑run boundaries. Directed numerical checks establish the finite inequalities. An analytic comparison between deletion probabilities then extends the pointwise bounds over the entire parameter range. The lower endpoint supplies rates within 0.019 bits of capacity in the asymptotic coding sense. We give the derivations, recorded computational costs, and complete numerical inputs and programs needed to verify the result.
Authors:Nishad Sahu, Changzhong Qian, Guangzhou Cai, Shounak Sural, Ragunathan, Rajkumar
Abstract:
Work zones alter lane geometry through temporary traffic controls and closures that may be absent from on‑board maps, challenging autonomous vehicle (AV) perception and planning. Generalization is also limited by scarce public datasets with structured geometric supervision. We present WorkZonePlan, a dataset comprising 149K+ synthetic and 5K+ real‑world multimodal samples with 3D annotations for lane boundaries, work zone boundaries, and driving trajectory options. It also provides 76 closed‑loop CARLA scenarios replayed under three weather conditions, yielding 228 Bench2Drive‑format evaluation routes. We introduce WAVE (Work‑zone‑focused AV data generation in Virtual and rEal Environments), a semi‑automated pipeline for creating the dataset, and BoundaryFormer (BF), a transformer‑based model that jointly predicts lane and work zone boundary polynomials and driving trajectories. BF uses slot attention for boundary prediction. Ablations show that a separate trajectory decoder using boundary slot features substantially improves trajectory prediction over a slot‑attention‑only approach. Building on this finding, BF++ offers Camera and Camera+LiDAR variants with metric ground‑plane encoding, typed boundary/trajectory queries, long‑range point anchors, image‑space curve refinement, and conservative gated LiDAR fusion. On the 211 routes common to all four models at the evaluation freeze, BF++‑Camera and BF++‑Camera+LiDAR achieve Driving Scores of 63.0 and 64.4, respectively, compared with 59.3 for SimLingo and 26.1 for TransFuser++ (TF++). BF++ is 40 times smaller than SimLingo and more than 10 times smaller than TF++, while achieving higher Driving Scores. These results support jointly predicting lane boundaries, work zone boundaries, and driving trajectories as a promising direction toward safer AV operation in work zones. Code and dataset: https://github.com/Nishad‑Sahu/WZPlanner.
Authors:Paula Feldman, Nusrat Binta Nizam, Sunwoo Kwak, Batuhan Karaman, Katerina Dodelzon, Mert Sabuncu
Abstract:
Cardiovascular disease (CVD) remains the leading cause of death among women, yet cardiovascular risk assessment often relies on clinical variables that may be missing, outdated, or unavailable in routine care. Screening mammography offers an opportunity for opportunistic cardiovascular risk stratification because it is routinely acquired and contains vascular features, including breast arterial calcifications (BAC), that are associated with cardiovascular risk and events. We evaluate whether mammography specific foundation models, originally pretrained for breast cancer‑related tasks, can transfer to cardiovascular risk prediction without cardiovascular specific supervision or explicit BAC annotation. We constructed a 5‑year major adverse cardiovascular event (MACE) cohort of 22,497 women linked to electronic health record outcomes, including 500 events (2.22% prevalence). The foundation models achieved AUROCs of 0.823 and 0.822 substantially exceeding an age‑only model (AUROC 0.765), despite using only the screening mammogram as input, with no clinical variables. Both foundation models evaluated assigned substantially higher predicted risk to patients with radiologist‑documented BAC, despite BAC never being used as a training label, and showed activation patterns consistent with vascular findings. Together, these findings suggest that mammography foundation models can recover clinically relevant cardiovascular risk information directly from mammographic pixels and suggest that screening mammography may provide an opportunistic source of cardiovascular risk information to complement conventional clinical assessment without additional imaging. Code is available in https://github.com/PauFeld/MammoCVD
Authors:Henry O. Velesaca, David Freire-Obregon, Luigi Miranda, Abel Reyes-Angulo
Abstract:
Automated action quality assessment (AQA) in Olympic sports remains a challenging task due to the complexity of human motion and the subjectivity inherent in expert judging. This work evaluates the capability of open‑source Vision‑Language Models (VLMs) to perform zero‑shot action quality assessment on Olympic diving videos using the AQA‑7 benchmark dataset. In this regard, a regression‑based framework is pro‑posed to leverage both the semantic reasoning and phase‑level sub‑scores generated by the VLMs, combining TF‑IDF vectorization, dimensionality reduction, and ensemble learning to predict final competition scores. Experimental results show that standalone VLMs achieve moderate Spearman correlations below 0.32, while the proposed ensemble regression framework substantially improves performance in the reported evaluation, reaching a Spearman correlation of 0.67 with a four‑model configuration. Textual reasoning features con‑sistently outperformed raw numerical sub‑scores, highlighting the richness of VLM‑generated explanations for action quality analysis. These findings suggest that VLMs hold strong potential as assistive tools for explainable and semi‑automated sports performance evaluation. The code is publicly available on GitHub https://github.com/hvelesaca/olympic diving judge vlm
Authors:Robert Joseph George, Will Adkisson, Anima Anandkumar
Abstract:
We present FloatLib, a verified arbitrary‑precision floating‑point arithmetic library in Lean 4 that combines broad format coverage, machine‑checked correctness, and efficient certified execution. To our knowledge, FloatLib is the first Lean library to unify IEEE binary and decimal arithmetic, arbitrary‑width posits, P3109, and user‑defined formats and rounding rules behind interchangeable certified software backends. Every certified backend is proved equal to a complete encoded specification, preserving signed zeros and exceptional values, while numerical theorems connect execution to real rounding, error bounds, and exactness. FloatLib combines exhaustive certified tables for small formats with verified word and limb kernels based on guard‑and‑sticky invariants and independently checked quotient candidates. Its posit development additionally proves standard rounding thresholds and exact quire accumulation within capacity for arbitrary widths. Across matched workloads, FloatLib achieves speedups of up to 1.46x over FLoPS and 116x over Universal, while remaining slower in some regimes such as binary arithmetic against MPFR. Independent conformance testing includes more than 102 million TestFloat evaluations with zero differences under the tested relation. We release the library, proofs, benchmarks, evaluation data, and guide as open source.
Authors:Rajneesh Anand, Mayuresh V. Kothare
Abstract:
Understanding the efficient transport of fluid droplets in confined geometries has been a domain of interest for industrial applications in recent times. In the present work, we focus on designing control strategies that optimally steer droplet motion. Here, we apply optimal control framework to the droplet transport problem in a microchannel based on lubrication theory that minimizes viscous dissipation. Two complementary modeling routes are adopted: a reduced‑order ordinary differential equation (ODE) model optimized via Pontryagin's Maximum Principle, and a full nonlinear partial differential equation (PDE) model optimized using a Covariance Matrix Adaptation‑Evolutionary Strategy. By parameterizing target displacement, droplet size, and capillary number, we uncover two distinct optimal transport regimes: a "translate‑relax" strategy for short distances and a "compact‑translate‑relax" strategy for longer targets. In continuum mechanics, the competition between surface forces and cumulative viscous dissipation decides the optimal transport strategies. We further show that the displacement range over which the reduced‑order controller transfers to the continuum model is governed by capillary stiffness. We finally address closed‑loop stability by adapting a control Lyapunov function (CLF) framework to the reduced‑order dynamics. We demonstrate that the terminal cost which penalizes deviation from the target, serves as a cost‑compatible CLF on the physical domain, and prove that the CLF‑compatible feedback exponentially stabilizes the target state.
Authors:William D. Compton, Zachary Olkin, Ryan Bena, Aaron D. Ames
Abstract:
Research in humanoid robotics has achieved rapid progress in locomotion, and recent results have pushed the boundary on autonomous navigation. We demonstrate that a standard single‑stage RL navigation pipeline struggles to scale to multi‑level and multi‑story terrain, limited by the difficulty of complex humanoid terrain interactions such as stairs. To overcome this challenge, we decompose the navigation problem into two pieces. First, we train a policy operating on the reduced order dynamics but with full 3D LiDAR observations to navigate complex, multi‑story terrain. We then utilize this navigation knowledge to kickstart a policy operating on the full‑order humanoid dynamics, with a frozen locomotion policy in the loop. Additionally, we demonstrate that applying a Poisson safety filter to the navigation policy output recovers safety in the presence of out‑of‑distribution obstacles, without dropping navigation success rate. We demonstrate the resulting RoM‑Nav policy on a Unitree G1, accomplishing mapless multi‑floor navigation covering trials with over 10m of vertical displacement and over 100m of path length. Project page with videos https://wdc3iii.github.io/rom‑nav/ .
Authors:Tarun Suresh, Pranshu Chaturvedi, Hangoo Kang, Parth Shroff, Ishan S. Khare, Hermann Kumbong, Azalia Mirhoseini
Abstract:
Block diffusion language models (BDLMs) combine autoregressive dependencies across blocks with parallel denoising within blocks, but long‑context training is constrained by distributed attention communication and activation memory. Conventional context parallelism (CP) shards the combined clean‑plus‑corrupted sequence by position, communicating shared clean K/V together with block‑specific corrupted K/V and their gradients. We observe that the BDLM objective separates over target blocks. We introduce block parallelism (BP), a new distributed parallelism dimension that assigns each corrupted‑block computation to one rank. To scale BP to long contexts, we introduce context‑sharded block parallelism (CSBP), which also shards the shared clean sequence across those ranks. CSBP keeps corrupted K/V and gradients local, avoids replicated clean prefixes, and preserves BDLM training semantics. On 16 H200 GPUs at 256K context, CSBP improves throughput over the best baseline by 1.18‑1.45x for supervised fine‑tuning and 1.27‑1.33x for conversion of autoregressive models to BDLMs, while matching or reducing peak HBM. Full‑model speedup reaches 1.61x at 512K. On eight H100 GPUs, CSBP accelerates DFlash2 speculative‑decoder training by 2.48x at 512K and 7.59x at 1M. In matched 12‑hour DiffusionGemma 26B‑A4B SFT runs, CSBP achieves higher pass rates at every trained checkpoint on SWE‑bench Verified and Terminal‑Bench Lite. Code: https://github.com/ScalingIntelligence/Turbo‑dLLM
Authors:Hao Yang, Jin Wang, Xuejie Zhang
Abstract:
This paper describes the participation of the YNU‑HPCC team in subtask A of task 11, Bridging the Gap in Text‑Based Emotion at SemEval‑2025. Our best‑performing system employs the RoBERTa (Robustly Optimized BERT Approach) model, an improved version of BERT that utilizes the Transformer encoder architecture. We enhanced the output head to allow the model to process one emotion simultaneously. We obtained the official ranking score (0.44), including results from all languages. The entire dataset was translated into English using Google Translate to facilitate subsequent processing. Through probabilistic and attention analyses, we found that (I) a single prediction head performs better than six heads predicting six emotions simultaneously, and (II) training on a uniformly translated English dataset yields better results than using the original dataset. The code is available at: https://github.com/BGWH123/Semeval‑2025‑task11.
Authors:Emanuele Artioli, Farzad Tashtarian, Christian Timmerer
Abstract:
Traditional codecs treat every region of a frame alike; a generative layer can instead degrade the regions a viewer attends to least and reconstruct them at the client. We present PRESLEY, which extends the prior conference work ELVIS by replacing destructive block removal with adaptive in‑place degradation under a removability mask, signaling per‑block strength in a bit‑packed side channel, and restoring via generative backbones conditioned on transmitted visual priors rather than unconditioned in‑painting. We separate the problem into three goals: choosing which blocks to degrade, degrading them so the encoder spends fewer bits, and restoring them. Against its predecessor at matched rate, PRESLEY achieves a decisive mean ‑56.4% BD‑rate reduction on delivered background quality across 13 rate ladders spanning multiple codecs and dataset families. Against pristine baselines, PRESLEY defines the operating regime of generative transport: delivering substantial bitrate savings (up to ‑29.4% BD‑rate) and superior background quality (17/23 sequences) in the target bit‑starved regime, while maintaining foreground fidelity bit‑exact. We further map where the theoretical headroom in this class of architecture lies. Using an exact leave‑one‑superblock‑out combinatorial oracle as an additive empirical bound, we show that existing complexity heuristics already capture 83.3% of bit‑cost savings, bounding remaining cost‑axis headroom at about 5% of total bitrate. We then identify and model the primary unaddressed axis ‑‑ post‑restoration damage ‑‑ which disperses widely (4.9‑8.4 dB). We prove that this damage is predictable before transmission (held‑out rho = +0.400), establishing the feasibility of transmit‑time restorability modeling and defining the roadmap for joint rate‑distortion‑restoration selection rules.
Authors:Biao Liu, Tong Zhang
Abstract:
In multi‑robot missions such as post‑disaster search and rescue, a short communication range fragments a swarm of Unmanned Aerial Vehicles (UAVs) into transient information islands. Under such intermittent connectivity, the prevailing "allocate‑then‑execute" paradigm‑‑which requires global consensus before any physical movement‑‑breaks down. This paper proposes the Communication‑Constrained Online Performance Impact (CC‑OPI) algorithm, an event‑driven method that interleaves task negotiation with physical execution. CC‑OPI replans only at discrete physical and topological events and integrates two further elements. The first is a pair of cost‑evaluation metrics adapted to dynamic topologies‑‑one with a spatial locality penalty that promotes regionalized operation, the other with a deadline‑aware urgency term‑‑complemented by a non‑preemptive state lock that shields each UAV's ongoing action. The second is a decentralized fault‑tolerance layer that pairs version‑based state synchronization with a global‑time‑driven emergency pool. We establish that CC‑OPI terminates in finite time, free of stale‑completion deadlock and of unbounded reassignment within the mission horizon. In simulations at a 250 m communication radius, CC‑OPI sustains a task completion rate of about 0.80: it leads a matched online execution of the unmodified Performance Impact (PI) and Consensus‑Based Bundle Algorithm (CBBA) rules by about seven percentage points, exceeds the naively transferred static baselines by roughly 20 points, and remains within several points of PI and CBBA under full connectivity. Within the tested settings, CC‑OPI degrades gracefully as connectivity weakens and absorbs packet loss, terrain occlusion, and runtime task arrival. The price is more messages and some redundant travel‑‑a deliberate trade‑off of efficiency for robustness.
Authors:Masato Kobayashi, Takeru Tsunoori
Abstract:
Underwater visuomotor policy learning has focused primarily on single manipulators, while bimanual imitation learning has been studied largely in air. We present ULOHA, an underwater bimanual robot learning platform that combines custom‑designed leader‑‑follower hardware with software extensions to LeRobot, integrating teleoperation, multi‑view sensing, demonstration collection, policy training, and autonomous deployment. Real‑robot experiments demonstrate a range of coordinated underwater bimanual behaviors, including inter‑arm transfer, shared‑object manipulation, and buoyancy‑driven interception. We evaluate ACT, Diffusion Policy, and the vision‑‑language‑‑action model SmolVLA on the platform. We investigate how learning methods and execution strategies developed for manipulation in air perform underwater, examining bubble disturbances, buoyancy‑driven object motion, action‑execution horizons, and real‑time chunking. A separate single‑arm study examines policy transfer between air and water and shows that demonstrations spanning both media support execution in both under the tested conditions. ULOHA provides a unified experimental platform for studying underwater bimanual robot learning under the coupled perceptual and physical effects of underwater environments. Additional material: https://mertcookimg.github.io/uloha/
Authors:Chao Wang
Abstract:
Benchmarks are central to how progress in large language models (LLMs) is assessed and communicated. Yet model rankings alone reveal little about how evaluation requirements themselves are changing. The expanding variety of benchmarks offers another perspective: what researchers expect LLMs to do, and what they count as successful performance. We systematically map 14,767 papers introducing or updating evaluation resources from arXiv submissions between January 2022 and August 2026. Using staged screening and automated full‑text coding, we examine changes in target systems and domains, evaluation materials and conditions, and scoring mechanisms. The collection shows growing emphasis on action, interaction, and professional applications, while established and newer design elements frequently coexist. Model participation also develops unevenly: LLM‑based scoring grows within both agent and non‑agent groups, whereas model‑generated materials show no comparable sustained increase in recent cohorts. These findings illuminate how public research translates capability expectations into concrete tests and criteria for success. As AI participates in constructing tests, performing tasks, and judging responses, they also raise a question: does expanding evaluation provide more independent evidence, or risk reproducing the preferences and blind spots of its participating models?
Authors:Ranran Haoran Zhang, Aysa Xuemo Fan, David Munhá Correia, Alex Cheema, Rui Zhang
Abstract:
Concurrent local LLM serving on unified‑memory desktops must preserve memory headroom and output fidelity, which speed‑only rankings overlook. We introduce SiliconBench, which evaluates nine Apple Silicon serving engines through three lenses: speed, memory, and fidelity. We evaluate chat and agent serving on Qwen3, Qwen3.5, and Gemma 4. We use a classification task to check for quality regressions against an NVIDIA reference. DGX Spark provides a complementary serving‑performance reference. Three desiderata guide interpretation: serving architecture readiness, memory discipline, and multi‑node scaling. On Qwen3‑0.6B, vllm‑metal alone more than doubles throughput on both workloads from concurrency 1 to 16. CUDA vLLM and SGLang show stronger concurrency scaling on the same prompts. Explicit memory budgets do not guarantee memory headroom: two stacks complete every request while memory use approaches physical capacity and throughput declines. The newer model architectures have narrower engine support. Their evaluated implementations match the fidelity reference. Only three stacks satisfy the completion, fidelity, and model‑coverage gates. Comparisons on larger dense and MoE models reinforce the importance of scheduling prompt processing alongside ongoing generation: vllm‑metal's packed prefill‑decode path maintains lower first‑token latency than omlx under concurrent load. In the tested two‑machine configurations, tensor parallelism over Thunderbolt RDMA scales while pipeline parallelism over TCP regresses. We release benchmark code, per‑run results, and maintenance journals, supported by a workflow combining bounded agent fixes with human review.
Authors:Ahmetcan Yavuz, Clara Meister, Tiago Pimentel
Abstract:
Two dominant tokenisation algorithms are used by modern language models: byte‑pair encoding (BPE) and UnigramLM. These differ along two orthogonal axes: their optimisation objective (compression vs. log‑likelihood) and their search procedure (bottom‑up merging vs. top‑down pruning). Existing comparisons confound these axes, making it unclear whether their observed differences stem from what is being optimised vs. how it is being optimised. We disentangle the two by introducing two new tokenisation algorithms that complete this 2x2 design space: BottomUpLL, a bottom‑up likelihood‑based tokeniser, and TopDownComp, a top‑down compression‑based tokeniser. We train language models with tokenisers produced by each algorithm, varying: model size, vocabulary sizes, and domain (English‑only vs. multilingual). Evaluating models on bits‑per‑byte, we find that the search procedure ‑‑ not the objective ‑‑ is the dominant factor: bottom‑up tokenisers consistently achieve lower bits‑per‑byte in most settings. Evaluating models on the BLiMP task, however, shows no consistent relationship between design choice and performance. Overall, our results disentangle the effect of tokeniser design choices on language modelling performance, offering concrete guidance for their more principled construction.
Authors:Dongzhou Cheng, Taoran Yi, Ye Fang, Xingwu Zhang, Fan Feng, Yixuan Li, Gengxiong Zhuang, Rongze Wang, Shuai Yang, Wei Song, Weizhi Xue, Minyan Wu, Jie Gui, Jiaqi Wang, Tong Wu
Abstract:
Enabling robots to adapt to unfamiliar environments as readily as humans remains a moonshot goal of embodied AI. No finite collection of demonstrations can cover every task and situation a robot will encounter, making the ability to learn from context at deployment essential for generalization. Such in‑context learning (ICL), however, remains largely beyond the reach of existing robotic policies. The broad agentic capabilities of commercial vision‑language models (VLMs), such as GPT‑6 Astra, raise a compelling question: can these models learn from demonstrations, examples, and interaction feedback, then translate that information into executable and verifiable robot behavior from a new initial state without gradient updates or persistent changes to task‑specific parameters? We introduce GPT‑Policy, a general‑agent framework for in‑context robot learning. GPT‑Policy integrates a context compiler that preserves task‑relevant visual transitions, a VLM that proposes robot‑tool actions, and a constrained controller that verifies and executes each action and reports its outcome. We evaluate its reliability and limitations through task success and efficiency metrics, matched comparisons across models, and controlled context ablations. In real‑robot trials, human video demonstrations improve task completion even without robot action labels, while aligned action references yield further gains on contact‑sensitive tasks. These findings position GPT‑Policy as a step toward robot adaptation through in‑context learning, providing an empirical foundation for translating the general‑purpose capabilities of VLMs into physical behavior and clarifying the challenges that must be overcome for reliable deployment.
Authors:Hejia Geng, Zesen Huang, Haoyang Li, Wenbin Li, Koutian Wu, Zihan Zhou, Yuanbo Pang, Weihao Liu, Zigong Xu, Zhiping Li, Zongzheng Zhang, Chuanfei Dong, Jiankai Sun, Tianzhe Zheng, Fengyu Xie, Yue Ma, Yueheng Shi, Tong Xie, Zonglin Di, Xianrong Liu, Qucheng Gao, Yimin Liu, Jiaming Pan, Sheng Huang, Xiao-Han Ma, Lanqing Yuan, Zhenlin Zhu, Ziang Liu, Ziyang Xu, Junkai Wang, Kangkai Liang, Jiayi Xian, Zehong Zhao, Liuwei Xu, Jingxu Xie, Peijin Zhang, Qiang Gao, Chengyi Xing, Zhe Zhao, Xi Wang, Yaopeng Xing, Xing Meng, Zhenfei Yin, Yingcheng Wu, Ling Yang
Abstract:
Scientific code repositories encode decades of human knowledge in executable models, methods, and tools. Yet fragmented toolchains, implicit domain conventions, and specialized correctness criteria make this knowledge difficult to convert into reliable learning experience‑a challenge we call the scientific experience bottleneck. We introduce ScienceIDE, infrastructure for turning the world's scientific code into programmable environments for scientific agents. Guided by expert‑defined scientific cases and acceptance criteria, agents transform repositories into executable environments that support task generation, execution, and scientific verification. These environments provide a shared foundation for supervised fine‑tuning, reinforcement learning, and evaluation. Using verified interaction trajectories, we train PhAI‑IDE‑72B, PhAI‑IDE‑9B, and PhAI‑IDE‑4B. The model family shows gains in held‑out scientific‑code repair and across selected general‑purpose benchmarks in code, reasoning, and knowledge, providing evidence of positive transfer from scientific experience to broader capabilities. ScienceIDE lays the foundation for an integrated workspace for agent learning and scientific practice, making humanity's scientific software a shared substrate for developing scientific intelligence. Code: https://github.com/aitofound/ScienceIDE
Authors:Zixi Chen, Akshay Vegesna, Samip Dahal, Andrew Gordon Wilson
Abstract:
Scaling laws predict how loss decreases with increases in computation. We show, contrary to conventional wisdom, that architectural interventions can modify scaling exponents in pre‑training, leading to power‑law improvements in performance as computation increases. As an anchoring point, we consider the architectural formulation of looped transformers. Although not typically used in this way, looping, also known as recursive depth, provides a mechanism for model growth, by increasing the number of loops during training. Model growth, with and without shared weights, provides the biggest changes to the scaling exponents. In particular, a 7.4B model growth architecture matches GPT‑3 13B on CORE with roughly 20× less compute, and has compute efficiency gains that increase with scale. Moreover, simply using a boundary operator in a vanilla transformer, which normalizes and injects an earlier block, also provides an exponent increase, although to a lesser extent. In the data‑constrained, multi‑epoch setting, standard looping has a useful regularizing effect, where we find it is compute‑optimal to increase the number of loops with scale. These results can be understood through the lens of computational depth: for a given computational budget, we wish to increase the usable depth of the transformer, which can lead to efficiency gains that increase with scale.
Authors:Daniel Morton, Jon Arrizabalaga, Zachary Manchester, Marco Pavone
Abstract:
As robot capabilities increase, quadratic programming (QP)‑based controllers must account for a similarly increasing number of constraints to ensure safe, reliable operation. Yet, with each added constraint, this introduces more chances of momentary conflict: in which case, a QP solver that returns an "infeasible" status leaves the controller with nothing to execute. To address this, we introduce ElastiQP, a modified dual active‑set QP solver that relaxes every inequality constraint with an exact, per‑constraint l1 penalty while keeping equality constraints (dynamics) hard. Notably, ElastiQP does so by folding the slack variables into the solver analytically, maintaining a constant size of the condensed linear system. On a suite of robot control benchmarks, ElastiQP achieves microsecond‑level performance, matching or outperforming leading modern solvers on feasible problems. On infeasible problems, ElastiQP handles these gracefully, confining violations to strictly the conflicting inequality terms, returning a usable solution up to 40x faster than the best alternative solvers. ElastiQP is available as an open‑source C++ header‑only library, with Python and JAX interfaces, at https://github.com/StanfordASL/elastiqp.
Authors:Yibo Hu
Abstract:
Large language models are increasingly used for content moderation, but most evaluations still report aggregate accuracy on individual benchmarks. We introduce Safety‑Flag, which places seven widely used safety benchmarks (BeaverTails, XSTest, Ethics, WildGuard, Aegis, ToxiChat, and ToxiGen) into a single balanced flag / do‑not‑flag protocol. We release item‑level decisions and confidence scores for six general‑purpose LLMs and four dedicated guards, together with three reference models, evaluated on the same items. Safety‑Flag measures three dimensions of moderator reliability: error direction, probability calibration, and confidence‑based error ranking for human review. They often disagree. Aggregate accuracy does not reveal error direction: one model flags 85% of benign content, whereas another misses 54% of harmful content. All six general‑purpose models are overconfident; fitting one temperature per model reduces calibration error by 2.8‑‑6.0× without changing predicted labels or confidence ordering. Confidence‑based abstention lowers selective risk for every model, although the gains depend on how well confidence ranks errors. Dedicated guards produce fewer false alarms and are better calibrated, but several have higher miss rates outside their documented coverage. We release the benchmark, fixed item lists, evaluation code, per‑item model outputs, and leaderboard at: https://github.com/yibo‑hu‑lab/safety‑flag‑benchmark.
Authors:Muntasir Tabasum, Tanpia Tasnim, Md. Ekramul Islam, Al Zadid Sultan Bin Habib
Abstract:
Urban Land Cover (ULC) classification plays a crucial role in urban planning, environmental monitoring, and sustainable development. We study this task using the ULC dataset from the UCI Machine Learning Repository, which includes tabular features derived from high‑resolution aerial imagery across nine classes (e.g., roads, trees, grass, water). The dataset presents typical remote sensing challenges, including high dimensionality, heterogeneous features, and class imbalance. In a unified, reproducible pipeline, we benchmark classical machine learning models (e.g., Logistic Regression, SVM, Random Forest, XGBoost, CatBoost) against Tabular Deep Learning (TDL) models (TabNet, FT‑Transformer, TabTransformer, TabSeq, and 1D CNNs). To address class imbalance, we employ weighted cross‑entropy loss for TDL models and evaluate performance using accuracy, macro‑precision, macro‑recall, macro‑F1, AUC‑ROC, and confusion matrices. Our results show that while tree ensembles remain strong general baselines, TDL models can match or exceed their performance when non‑linear interactions are significant and imbalance handling is effective, providing complementary advantages for urban land cover mapping. See code: https://github.com/mtesha/tdl‑vs‑ml‑urbanlandcover
Authors:Sayema Lubis, Clark Peng, Jared Carreño, TJ Tsai
Abstract:
Time‑scale modification (TSM) has a number of open‑source implementations, but these are designed almost exclusively for offline use, in which a recording is processed at a fixed rate and written out ahead of time. Applications such as automatic musical accompaniment require a different setting, which we call variable‑rate playback: the recording to be stretched is known in advance, but the playback rate is not, and must change continuously in response to a live performer. The few implementations that generate output in real time are written in C++ and optimized for speed rather than for ease of modification, experimentation, and integration with the primarily Python‑based research ecosystem. This paper describes a Python implementation of the widely used harmonic‑percussive TSM method for the variable‑rate playback setting. Harmonic‑percussive separation is performed offline as a preprocessing step on the known input recording, while synthesis and playback are carried out in real time with a time‑scale factor that may change at every frame. We further propose a family of variants that reduce runtime by replacing the phase vocoder's analysis‑stage FFT and instantaneous frequency calculations with lookups into precomputed tables. Subjective listening tests with 24 participants (1114 pairwise ratings) show that these approximations become perceptually indistinguishable from the exact implementation once the precomputed hop size is sufficiently small, while reducing total runtime by roughly half. We characterize the resulting tradeoffs among precomputation, runtime, memory, and perceptual quality to guide algorithm selection, and we release our implementation as an open‑source package.
Authors:Huy Che, Minh-Khoi Do, Dinh-Duy Phan, Duc-Khai Lam
Abstract:
Efficient perception models are essential for real‑time autonomous driving, where accuracy and computational cost must be carefully balanced. However, applying knowledge distillation to multi‑task driving scene segmentation is challenging because drivable‑area and lane segmentation exhibit different spatial characteristics and class imbalance. We propose KDTwin, a task‑aware distillation framework for lightweight multi‑task segmentation networks. The proposed method performs distillation at both the shared encoder and task‑specific decoders. Encoder‑level pairwise distillation transfers spatial relational knowledge to enhance the student's shared representation. For the decoders, we use a weighted loss for drivable‑area segmentation and a boundary‑aware loss for lane segmentation, enabling task‑adaptive knowledge transfer without increasing inference complexity. Experiments on BDD100K show consistent improvements across the evaluated CNN‑based and Transformer‑based student models without increasing inference‑time parameters or FLOPs. The results show that designing distillation objectives according to task‑specific characteristics can effectively enhance multi‑task segmentation performance for autonomous driving. The source code is available at https://github.com/chequanghuy/KDTwin.
Authors:Jiaju Gao, Yi Zhao, Chenyang Xu, Yuxi Zhou, Hao Wang
Abstract:
Neurological prognostication after cardiac arrest commonly relies on electroencephalography (EEG). However, EEG demands high clinical resources. Bedside electrocardiography (ECG) is standard and low‑cost. Yet, its value for predicting neurological outcomes remains underexplored. In this study, we propose NeuroECG, an ECGFounder‑based deep representation framework for EEG‑free auxiliary prognostication. NeuroECG adapts a pretrained ECG foundation model via task‑specific fine‑tuning. We implement a gradual unfreezing strategy on single‑channel bedside monitoring ECG. Multiple ECG segments per patient are encoded into segment‑level deep features. These embeddings are aggregated via quantile pooling (q = 0.24) and compressed using principal component analysis (PCA). Experiments on 412 ECG‑available patients from the multicenter I‑CARE database show that the adapted ECGFounder backbone achieves the best performance among ECG‑only backbone baselines, with a test AUROC of 0.7333. We further combine the learned deep ECG representation with static clinical covariates. The proposed NeuroECG model achieves a test AUROC of 0.8077 and an AUPRC of 0.8970. These results support deep bedside ECG representations as a useful source of auxiliary prognostic information. Their integration with static clinical covariates improves prediction in an EEG‑free setting. The source code is available at https://github.com/goddream66/NeuroECG_
Authors:Zitao Liang, Chang Gao
Abstract:
Compact acoustic models face a challenging quality‑capacity trade‑off. We investigate two factors in this regime: encoder context and Mel‑spectrogram supervision. A receptive‑field‑scaling study shows that expanding self‑attention beyond 15 phonemes provides no consistent gains in pitch, energy, or duration prediction. Guided by this finding, we introduce a fixed‑receptive‑field convolutional encoder that reduces the respective prediction errors by 36.0%, 17.3%, and 3.4%. We further show that directly transferring image‑domain gradient‑variance supervision restores fine‑scale variation but degrades predicted quality, motivating a Mel‑specific formulation with axis‑specific gradients, overlapping local statistics, and log‑domain variance matching. GrainSpeech contains only 264.8K parameters and achieves 17.9x real‑time Mel generation on a microcontroller (MCU), while attaining UTMOS scores comparable to substantially larger models with less than 1.5% of their parameters. Source code and demos are available at https://github.com/lab‑emi/GrainSpeech.
Authors:Gaurav Kuwar, Alhad Daftardar, Jianqiao Mo, Siddharth Garg, Brandon Reagen
Abstract:
Zero‑Knowledge Proofs (ZKPs) are critical for privacy‑preserving and verifiable computation, but their cryptographic primitives impose high computational overheads. One such primitive is point addition (PADD) on elliptic curves. Several prior works have implemented PADDs in hardware, but only for a few specific elliptic curves and design points, leaving a large design space unexplored, and lacking systematic guidance on hardware design trade‑offs. To address this gap, we present Locus, a framework dedicated to optimizing and exploring point addition hardware. Given the parameters of any elliptic curve in a supported equation form, Locus automatically generates ASIC and FPGA implementations of PADD, enabling systematic exploration of the PADD design space. Using Locus, we conduct the first comprehensive hardware‑focused study of PADD designs, exploring trade‑offs over 1,000 design points. On a 12nm technology node, our framework produces PADD designs that yield a 2.71× geomean speedup and 3.11× geomean area reduction compared to prior ASICs, 34.67× geomean speedup over CPU, and 3.15× geomean speedup on end‑to‑end proof generation when integrated into a prior ZKP accelerator at iso‑area. Locus is available at https://github.com/cryptolets/cryptolets/tree/locus.
Authors:Quan-Dung Pham, Anh Dao, Danh Vinh Le, Nguyen Viet Tri Pham, The-Anh Nguyen, Zhirui Dai, Yiyu Chen, Tuyen P. Le, Truong Nguyen, Quan Nguyen
Abstract:
Vision‑language navigation requires aligning language with visual observations while maintaining spatial understanding over time. Geometry foundation models (GFMs) expose intermediate representations throughout their hierarchy, but how navigation policies should use these features and retain historical geometric evidence remains unresolved. We introduce \method, a streaming VLN framework that addresses these questions across representation depth and navigation time. Hierarchical GFM‑‑VLM fusion couples earlier, intermediate, and later GFM representations to successive policy stages instead of repeatedly injecting a terminal feature. Navigation‑aware GFM memory retains historical VGGT global‑attention KV states according to instruction relevance, geometric confidence, and transition novelty under a bounded per‑layer budget. Retained states provide geometric context for subsequent observations before fusion with the policy. Across R2R‑CE and RxR‑CE, \method achieves strong performance using a single RGB stream without additional navigation‑specific external data. Controlled ablations show that multi‑depth coupling substantially outperforms repeated terminal‑feature injection at matched fusion locations. Bounded navigation‑aware retention preserves navigation performance while considerably reducing GFM‑KV memory relative to larger‑memory temporal retention. These findings support jointly examining the geometric representations exposed to the policy and the historical evidence retained for future inference. Code will be released upon acceptance at https://humanoid‑research.github.io/adageovln/.
Authors:Jeremy Magland
Abstract:
We consider a stationary Gaussian process observed after uniform quantization. The entropy rate of the resulting integer sequence is the fundamental limit on lossless compression of the quantized signal, but it has no closed form, and the classical high‑resolution approximation breaks down whenever the spectral density is small or vanishing on part of the band, as happens routinely after smoothing or filtering. Here we present two methods for computing the rate. The first is an analytical approximation obtained by combining an exact dithering identity with the Kolmogorov‑Szegő formula; the quantization noise power acts as a floor on the spectral density, so the rate remains finite where the classical formula fails. The second is a Monte Carlo estimate of the exact rate. Its minimum‑phase spectral factor represents the process as a finite moving average of Gaussian innovations, making the quantized sequence a hidden Markov process whose optimal (fully adapted) particle filter is available in closed form; by the Shannon‑McMillan‑Breiman theorem the rate follows from the filter's log‑likelihood on a single long sequence. In experiments across six process families, the approximation agrees with the estimate to within a few millibits per sample over most of the parameter range for quantization steps up to the signal standard deviation, including strongly filtered processes on which the classical formula fails; at the most strongly filtered points the discrepancy grows to a few percent of the rate, and for much coarser steps the estimator should be used. We also compare lossless coders against this limit. At a step of one quarter of the standard deviation, linear predictive coding followed by an entropy coder comes within 2 to 4 percent of the entropy rate and FLAC within 3 to 32 percent, whereas five general‑purpose compressors on the raw samples remain 12 to 89 percent above it.
Authors:Mengze Xu, Zhu Liu, Weidong Sheng, Boyang Li, Yimian Dai, Ming-Ming Cheng, Jian Yang
Abstract:
Long‑range infrared imaging frequently confronts dense target clusters whose diffraction‑limited signatures merge into a single indistinguishable blob, concealing the number, sub‑pixel positions, and radiant intensities of the underlying sources. While deep learning has advanced general object detection, resolving such Closely‑Spaced Infrared Small Targets (CSIST) remains largely unexplored, owing to a systemic infrastructure void and a fundamental paradigm mismatch. The dominant formulation, which reduces unmixing to a blind, discrete sub‑pixel separation, is inherently insufficient: without semantic guidance, the ill‑posed inverse problem admits ambiguous solutions plagued by false and missed detections, while grid‑based discretization locks predictions onto fixed lattice centers, chaining precision to prohibitively expensive grid refinement. We argue that CSIST unmixing should instead be informed and continuous. To ground this paradigm shift, we establish the first comprehensive open‑source ecosystem for the field, comprising the large‑scale CSIST‑100K benchmark, a tailored metric suite, and the GrokCSO toolkit. Upon this foundation, we propose DISTA‑Net++, which anchors a dynamic deep unfolding backbone with two synergistic mechanisms: a Count‑Guided Prior that injects the global target count as an explicit semantic constraint to regularize the solution space, and a Continuous Coordinate Rectification that regresses off‑grid offsets to decouple localization accuracy from grid resolution. Extensive experiments validate our paradigm: even under the most economical 3x division, DISTA‑Net++ surpasses 7x‑division state‑of‑the‑art methods by 16.15% in CSO‑mAP and 62.96% in count accuracy at merely one‑sixth of their computation, demonstrating that unmixing precision need not be purchased with finer discretization. The complete ecosystem is available at https://github.com/GrokCV/GrokDet.
Authors:Yota Koshimoto, Akihiro Tsukahara, Yasuhiro Moriwaki, Mariko Isogawa
Abstract:
Tremor is a movement disorder characterized by involuntary, rhythmic oscillations of body parts and is a hallmark of several neurological conditions, including Parkinson's disease and essential tremor. Elucidating its underlying mechanisms relies heavily on mouse models, which offer genetic manipulability and translational relevance to human neural circuitry. Accordingly, these models are indispensable for studying tremor pathophysiology. So far, electromyography and accelerometers have been used as methods to quantitatively observe tremors in mice. However, these methods have several drawbacks, such as high costs and complex setups. In particular, the invasive surgical implantation of devices causes significant stress to the animals. Although RGB‑based methods offer non‑invasive and cost‑effective alternatives, they often lack the sensitivity required to detect subtle tremors. Therefore, this paper addresses these challenges by achieving mouse tremor severity estimation using conventional RGB cameras only. To address the challenging task of isolating tremor‑related vibrations while the mouse itself is also in motion, our pipeline incorporates segmentation‑based pre‑processing to extract the mouse region and a Tremor Score Estimation Module that captures subtle tremors with high sensitivity. In the experiments, we assessed tremors in unrestrained mice using a non‑invasive method with two standard cameras. The results demonstrated a strong correlation with accelerometer measurements and confirmed that the method accurately captured the intensity‑dependent characteristics of tremors. The project page is available at https://isogawalab.github.io/Video‑based‑Tremor‑Analysis‑Project/.
Authors:Gabriel Bénédict, Melanie Buechler, Gerard Riera-Solà, Chloé de Ancos, Yves Gaetan Nana Teukam, Moritz Freidank
Abstract:
Antibody lead optimization calls for a small, bounded set of edits to an existing candidate: substitutions, but also insertions and deletions. Edit‑based generative models are the only ones that allocate such an edit budget without fixing the edit positions, the edit count, or the output length in advance. However, the existing approaches Edit Flows and EvoFlows did not release code or complete training specifications. Here, we show that both methods follow the same underlying process ‑‑ edits firing one at a time, at learned rates, in continuous time ‑‑ the pure‑jump case of generator matching over finite sequences. With EditJumps we introduce the first open implementation of this framework, with a single generalist antibody editor trained on 1.66M Observed Antibody Space homolog pairs to propose homolog‑like variants of a seed sequence, editing unseen leads zero‑shot, without the per‑family retraining original approaches require. Replicating this system from scratch exposes why open code is essential for generative biology: reconciling published edit distributions required reverse‑engineering an undocumented rate‑scaling hyperparameter that dictates realized mutation counts. Moreover, we show that published evaluation metrics are highly sensitive to reference sample size, frequently flipping method rankings. We release our full codebase, automated test suite, and configurations at: https://github.com/VisiumCH/editjumps
Authors:Xiaochen Ma, Zimo Meng, Junzhu Liang, Youhe Jiang, Yue Cheng, Hao Liang, Bohan Zeng, Dengchun Li, Lu Ma, Zhengyang Zhao, Zhen Hao Wong, Runming He, Meiyi Qiang, Jiangtao Guan, Binhang Yuan, Wentao Zhang
Abstract:
Preparing high quality training data for foundation models requires scalable pipelines that transform heterogeneous documents and videos into structured records. Such pipelines expand each parent item into an ordered and input dependent sequence of children, whose counts may be long tailed. GPUs should batch children across parents while preserving parent relationships, child order, completion status, and result routing. Existing systems either hide parallelism behind coarse grained jobs or expose flat records that force applications to manage lineage and regrouping. We present RayOrch, a programming model and distributed execution engine that preserves parent child relations throughout execution. Programs declare ordered variable cardinality expansions and matching gathers. The compiler validates each pair, while the runtime records child membership, immediate parents, immutable ordinals, and terminal states. Per Call FIFO Ready Queues batch ready children across parents. Gathers reconstruct results from declared membership and ordinals rather than batch boundaries or completion order. Parents can advance as soon as all required children become terminal. Typed parent scoped failures suppress undispatched siblings of the failed parent while allowing unrelated parents to continue. On NVIDIA H20 GPUs, RayOrch achieves 15.14 times speedup when scaling MinerU from 4 to 64 GPUs and 7.82 times speedup when scaling a video pipeline from 8 to 64 GPUs. It reduces end to end time by 13.1 percent versus Ray Data and 29.0 percent versus Daft on MinerU, and by 16.0 percent versus Ray Data on Docling. Code available at https://github.com/OpenDCAI/RayOrch .
Authors:Filippo Betello, Antonio Purificato, Nicola Tonellotto, Fabrizio Silvestri
Abstract:
The increasing demand for user privacy and compliance with regulations such as GDPR has made machine unlearning a fundamental requirement for modern recommender systems. However, Sequential Recommender Systems (SRS) pose unique challenges for unlearning due to their reliance on temporal interaction patterns. Existing approaches either require computationally prohibitive full retraining or fail to account for the sequential nature of user behavior. We propose SURF (Subtractive Updates for Recommender Forgetting), a lightweight framework for approximate machine unlearning in SRS. SURF operates in three stages: (i) identifying the neighborhood of the item to forget in the embedding space, (ii) training an auxiliary model on this compact local subset, and (iii) subtracting the auxiliary model's scores from the original model at inference time. Experiments against five baselines on 7 datasets show that SURF achieves unlearning effectiveness comparable to full retraining while substantially reducing computational cost, yielding up to a 32% improvement in NDCG@20 while requiring just 2% of the original retraining baseline time budget. We share our code at https://github.com/FilippoBetello/SURF.
Authors:Mingyuan Ma, Hu He
Abstract:
Modern GPU kernels increasingly stress the instruction supply path, while fixed instruction containers can leave substantial footprint slack. This paper presents an automated encoding‑synthesis framework that treats instruction layout as a constrained slot‑assignment problem over a validated instruction‑form field specification. The formulation separates semantic field identity from physical bit positions and supports tied, pinned, and free placement constraints, making it applicable when recurring decoded fields are not frozen by a public format contract. We instantiate the framework for NVIDIA SASS: raw public encoding text is normalized into a machine‑readable specification, a SASS disassembler is validated against nvdisasm on 3.78M instructions, released as an open benchmark, and CP‑SAT synthesis is used for fixed‑length and variable‑length encodings. On 142 Blackwell kernel inputs, variable‑length synthesis reduces instruction footprint by 33%, with comparable reductions after re‑synthesis on Ampere and Hopper; fixed‑length synthesis on the same specification reduces decoder area by 16% against a decoder generated from the NVIDIA‑observed 128‑bit layout by the same generator and flow. Generated fetch/decode RTL meets 1.5 GHz in TSMC 22 nm with a replicated area delta of 0.12% of a GA100‑class die; a same‑node SRAM comparison shows the footprint reduction corresponds to about 9x this added logic in instruction‑SRAM bit‑cell area.
Authors:Runjia Tan, Yuang Tu, Yujie Yan, Lan Yu, Xuesong Tian, Chen Lv
Abstract:
Generalist robot policies offer useful initialization, but refining compact specialists through limited physical interaction requires informative learning feedback. We present FIERCE, a generalist‑initialized reinforcement learning framework centered on a unified, task‑adaptive progress‑failure evaluator. Its architecture shares an observation‑language representation between an observed‑progress head and an action‑conditioned latent predictor whose past and current predictions feed a causal sequence head for task‑failure estimation. Joint supervision from progress and preference labels, synchronized commands and observations, and terminal outcomes trains the evaluator; target‑task rollouts support adaptation and calibration. Fixed evaluator snapshots provide progress shaping and failure‑risk penalties alongside independently verified terminal rewards, while evaluator and policy updates alternate as new experience is collected. Refinement requires neither continued generalist action queries nor a dedicated target‑task simulator or manually annotated dense rewards. Only the compact specialist is retained at deployment. The evaluation separates feedback quality, policy‑learning efficiency, and deployment cost across simulation and two contact‑rich real tasks. Code, model weights, and data‑restoration tools are released at https://github.com/ar‑mine/FIERCE.
Authors:Emanuele Artioli, Daniele Lorenzi, Shivi Vats, Farzad Tashtarian, Christian Timmerer
Abstract:
Video streaming dominates global internet traffic, yet conventional pipelines remain inefficient for structured, human‑centric content such as sports, performance, or interactive media. Standard codecs re‑encode entire frames, foreground and background alike, treating all pixels uniformly and ignoring the semantic structure of the scene. This leads to significant bandwidth waste, particularly in scenarios where backgrounds are static and motion is constrained to a few salient actors. We introduce GenStream, a semantic streaming framework that replaces dense video frames with compact, structured metadata. Instead of transmitting pixels, GenStream encodes each scene as a combination of skeletal keypoints, camera viewpoint parameters, and a static 3D background model. These elements are transmitted to the client, where a generative model reconstructs photorealistic human figures and composites them into the 3D scene from the original viewpoint. This paradigm enables extreme compression, achieving over 99.9% bandwidth reduction compared to HEVC for the continuous data stream. We partially validate GenStream on Olympic figure skating footage and demonstrate potential for high perceptual fidelity under minimal data. While acknowledging the significant computational costs shifted to the client and challenges in generalization, GenStream opens new directions in volumetric avatar synthesis, canonical 3D actor fusion across views, and personalized viewing experiences, laying the groundwork for scalable, intelligent streaming in the post‑codec era.
Authors:Emanuele Artioli, Mohammadreza Ghafari, Md Tariqul Islam, Farzad Tashtarian, Christian Rothenberg, Christian Timmerer
Abstract:
3D Gaussian Splatting (3DGS) enables photorealistic novel view synthesis, but transmitting gigabyte‑scale scene data remains challenging for immersive applications. Traditional HTTP Adaptive Streaming over TCP introduces Head‑of‑Line (HOL) blocking and coarse segmenting ill‑suited to fine‑grained 3DGS delivery. We propose MoQSplat, which maps 3DGS content onto the Media over QUIC (MoQ) transport hierarchy. MoQSplat partitions scenes into spatial Tracks, clusters splats into semantically coherent Groups, and constructs progressive‑quality Subgroups mapped to independent QUIC streams to eliminate connection‑level HOL blocking. Using a stateless, subscriber‑driven adaptation loop, clients dynamically request spatial regions and quality tiers based on six degrees of freedom (6‑DoF) frustum visibility, distance, and foveal alignment. We evaluate the core components on a prototype implementation, showing that opacity‑based pruning outperforms scale‑based pruning for progressive delivery. The source code is available at https://github.com/emanuele‑artioli/MoQSplat.
Authors:Can Li, Jie Gu, Zishun Deng, Jingmin Chen, Lei Sun
Abstract:
Creating deformable assets for robot manipulation requires jointly specifying their geometry, appearance, and physical properties. This is especially challenging for deformable objects, since text and images provide limited evidence about how they deform and respond to contact, yet these responses directly affect their suitability for interaction. Automated generation therefore needs to resolve coupled physical requirements and use interaction evidence to guide construction and refinement. We present DeformSmith, a framework that enables automated generation of interactive, physically credible deformable assets from text or a single image. Through hierarchical agentic construction and a shared physics‑grounded harness, it progressively builds, tests, and refines geometry, physical models, material behavior, and robot interaction until the resulting asset is ready for simulation and manipulation. Robot interaction closes the generation loop through manipulation feedback and replayable interaction data. Results show that DeformSmith generates assets with better visual quality and physical plausibility than state‑of‑the‑art baselines, including PhysGen3D, PhysGM, and PhysX‑Omni, while supporting the synthesis of data for robotic manipulation of deformable objects. Project page: https://can‑lee.github.io/deformsmith‑web/
Authors:Mika Okamoto, Ansel Kaplan Erol
Abstract:
As corporate AI adoption continues to grow, enterprise‑grade LLM agents are being deployed into sensitive contexts such as hiring, healthcare, and finance. In these contexts, compliance with rules specified in an agent's system context is a first‑order legal concern. Currently, no evaluation framework systematically measures which LLM models tend to violate compliance rules, especially under pressure from a persistent user, a hurried manager, or circumstances where violation is convenient or attractive. We introduce PACT (Pressure‑Applied Compliance Testing), a benchmark for rule‑following under pressure in AI agents assisting employees in daily tasks across twelve regulated enterprise domains and forty‑eight scenarios, each set in a realistic multi‑turn conversation. Each benchmark item pairs a standing rule against a rule‑violating shortcut, and applies a battery of pressures across different wordings and system‑prompt modes. We construct PACT component by component under strict LLM‑as‑judge auditing to ensure samples are unambiguous, ungameable, and realistic enough to avoid eliciting evaluation‑aware behavior. We use PACT to profile LLM compliance across six complementary metrics that create a holistic picture of an AI assistant's robustness under pressure and throughout multi‑turn conversations, its transparency, and ability to correctly discern where a rule applies. We aggregate this profile into PACTScore, a reliability‑weighted compliance rate over all items and modes. Our results across 22 common LLM models spanning multiple providers and sizes show substantial variability in compliance across models and metric dimensions. Even the strongest assistants mis‑apply a rule on 6 to 10% of items, and ordinary user pressure raises the violation rate by 65% on average. PACT highlights compliance risks in LLM assistants, motivating guardrails and careful model selection.
Authors:Zhaoyang Jia, Tianyu Zhang, Zihan Zheng, Wenxuan Xie, Jiahao Li, Bin Li, Houqiang Li, Yan Lu
Abstract:
Despite recent progress in learned image compression, existing methods remain computationally expensive on resource‑constrained hardware, particularly CPUs. We introduce PULSE, a practical codec that enables (1) low‑latency decoding on diverse hardware platforms with an ultra‑low‑complexity 5.2 kMAC/pixel neural receiver, and (2) efficient bit‑exact entropy coding with an integer linear CDF predictor and a meta prior. To recover compression performance under this tight budget, we introduce an agentic evolution process guided by heuristic probes that iteratively improves the architecture through human‑LLM collaboration. PULSE decodes a 1080p image in 126 ms on a single CPU thread while achieving compression performance comparable to HM. After perceptual optimization, PULSE competes with larger perceptual codecs like MS‑ILLM. Codes are at https://github.com/microsoft/GenCodec/tree/main/PULSE
Authors:Ziyi Zhou, Xiaoming Zhang, Hui Pang, Yuting Zhang, Tiesunlong Shen, Bingyu Yan, Erik Cambria, Litian Zhang
Abstract:
Propagation structures provide crucial evidence for fake news detection, yet existing approaches primarily rely on supervised GNN‑based models, which require substantial labeled data and exhibit limited generalization. Although large language models (LLMs) exhibit strong reasoning capabilities, directly feeding them raw propagation graphs creates a significant modality mismatch and severe information overload, making structure‑aware reasoning unreliable in zero‑shot and few‑shot settings. To bridge this gap, we propose MAGER, a multi‑agent genetic evolution framework that automatically discovers meta‑paths optimized for LLM reasoning. By compressing complex propagation graphs into informative subgraphs, the evolved meta‑paths alleviate both information overload and modality mismatch, enabling frozen LLMs to perform structure‑aware veracity reasoning. We further introduce a graph in‑context learning strategy that retrieves semantically and structurally similar demonstrations to strengthen classification and reasoning. Extensive experiments show that MAGER substantially improves frozen LLMs as standalone fake news detectors in data‑efficient settings. Our code is available at https://github.com/SenticNet/MAGER.
Authors:Franz Queißner, Andreas Orthey, Wolfgang Hönig
Abstract:
Robots that leave structured, static environments must plan motions that are kinodynamically feasible and safe among moving obstacles. However, there are no dedicated benchmark frameworks that combine both aspects. To overcome this, we present DynoFluxBench, a framework to compare kinodynamic planners in known, dynamic environments with unbounded arrival time. To demonstrate its utility and establish strong baselines, we develop three dedicated planners, named ST‑Db‑RRT, ST‑GBRRT, and KIST, that fuse kinodynamic and space‑time methods, covering different kinodynamic search paradigms: ST‑Db‑RRT expands with randomly selected discontinuity‑bounded motion primitives using trajectory optimization, whereas KIST and ST‑GBRRT maintain a kinodynamically feasible tree with different heuristic guidance. We analyze the probabilistic completeness guarantees of those new planners in dynamic environments. Finally, we evaluate ST‑Db‑RRT, ST‑GBRRT, and KIST using DynoFluxBench, showing that ST‑Db‑RRT reaches a first solution up to 32 times faster, while KIST and ST‑GBRRT remain valuable where trajectory optimization is fragile. Videos and further analysis can be found at https://dynofluxbench.github.io/dynofluxbench/.
Authors:Yunji Feng, Junyi Ma, Guanzhong Sun, Chenyang Xu, Hesheng Wang
Abstract:
Egocentric motion forecasting has primarily focused on hands and manipulated objects, leaving future human head motion comparatively underexplored. During manipulation, the head both redirects perception toward the target to acquire task‑relevant evidence and coordinates with body and hand motion. We therefore formulate future six Degree of Freedom (6‑DoF) head‑motion prediction conditioned on observed hand motion and inferred target context, and propose HAP, a Hand‑Driven Active Perception framework. HAP infers confidence for each target object from observed hand motion and object geometry. Then constructs a dynamic Predictive Target‑Centric Amodal Occlusion Graph (P‑TAOG) representing current and potential occlusion among candidate objects. Directed graph and causal temporal reasoning encode the evolving target conditioned perceptual state, which is fused with hand and head motion history. A horizon‑wise gate then blends the learned trajectory with a constant velocity prior. We further introduce Bottle, an egocentric RGB‑D dataset of object manipulation toward specified targets, with coordinated head and hand motion under changing target visibility. Experiments on the public dataset and Bottle show that HAP achieves lower head motion prediction errors than representative baselines, supporting the value of hand driven intention and dynamic occlusion reasoning for anticipating human head motion. Code will be released at https://HAP‑ego.github.io/HAP.
Authors:Youssef Hamdi Zafan Ibrahim, Muhammad Ikram, Mohammed Khalaf Salama
Abstract:
Running large language models (LLMs) locally is often considered more private than cloud‑hosted inference because user prompts remain on the device. We ask whether keeping inference local is, by itself, sufficient to keep those prompts confidential. Our results show that it is not: prompt confidentiality also depends on how the surrounding serving software handles prompt data before, during, and after inference. We examine four boundaries at which prompt confidentiality can fail in consumer local‑LLM serving systems: model loading, runtime memory, wrapper‑level persistence, and the serving interface. To study these boundaries, we develop LLAnalyzer, a measurement framework that tests each boundary separately and traces observed failures to the responsible software component. Applying LLAnalyzer to four open‑weight model families and two consumer deployment platforms, we find markedly different behaviour across boundaries. In a 24‑hour AFL++ campaign with more than 12 million executions, we observe no parser crashes or successful malformed GGUF loads within the explored state space. Runtime memory tells a different story: we recover prompts after inference because multiple plaintext representations survive in allocator‑managed memory, and sanitisation reduces this residue without eliminating it. We also find that consumer wrappers can extend prompt lifetime through plaintext persistence. At the serving boundary, we uncover a previously undocumented authorization flaw in llama.cpp that allows one authenticated client to restore another tenant's saved conversation state; the attack succeeds in 200/200 controlled trials. Separately, shared prompt‑prefix caching exposes a remote timing oracle that remains distinguishable under WAN conditions. We argue that local LLM systems need explicit guarantees for prompt lifetime, persistent storage, and tenant isolation.
Authors:Jiabin Lou, Yirong Yang, Haopeng Wang, Xuxin Lv, Xinyu Liu, Diyuan Hou, Xuehong Liu, Rongye Shi, Wenjun Wu
Abstract:
Collective intelligence is a collaborative autonomy paradigm in which multiple agents pursue shared objectives through local perception, information exchange, and coordinated action. UAV swarms embody this paradigm by coordinating multiple vehicles in tasks such as search, inspection, and tracking. Recent advances in large language model (LLM) agents have strengthened natural‑language task understanding and high‑level planning, providing a flexible semantic interface between mission descriptions and collective behavior. While these advances expand semantic reasoning, applying LLM agents to UAV swarms raises challenges in grounding model decisions in executable capabilities, reconciling global task reasoning with distributed execution, and using mission‑specific experience for continual adaptation. To address these challenges, we introduce AeroWeaver, an embodied‑agent harness that weaves individual UAV skills into coordinated mission‑level behavior. AeroWeaver connects semantic decisions to governed skills, organizes role‑conditioned local agents for distributed coordination, and uses role‑indexed state‑action‑reward experience to refine skill selection online. Experiments and runtime validation show that AeroWeaver maintains valid skill execution under tested conditions and supports body‑local multi‑UAV operation without a central agent generating joint actions from global context, while reward‑guided online updates provide a training‑free path for adaptive learning swarm agents from accumulated execution experience. Code: https://github.com/Admire‑ljb/AeroWeaver.
Authors:Antoine Dumoulin, Laurence Boissieux, Joao Regateiro, Pierre Hellier, Stefanie Wuhrer
Abstract:
We present DiT‑Garment to model dynamic 3D clothing over human body models in arbitrary motion. Unlike existing methods, DiT‑Garment can animate garments with unseen designs and physical materials, while allowing for direct inference of deformations for any target pose. To achieve this, we leverage a 2D diffusion transformer architecture to learn 3D deformations in a 2D UV‑space. As the result is non‑deterministic, our generative model learns the distribution of possible outcomes. The template garment is represented as a 3D triangle mesh spatially aligned with a 3D human body model in a standardized pose. To work with different garment designs without the need of a common template or complex graph convolution operations, the diffusion transformer is conditioned on a 3D position map of the template, represented in UV‑space, which allows to implicitly learn a deformation of the 3D space around the body in standard pose. Further conditioning on body motion and physical parameters allows to physically ground the model. We quantitatively and qualitatively evaluate DiT‑Garment on both synthetic and real data. While only trained on synthetic simulations of automatically generated cloth designs, our method generalizes to captured and artist‑made garment designs. Code and data are available for research purposes at https://dumoulina.github.io/dit‑garment/.
Authors:Xuanze Yang, Yumeng Liu, Haiyang Xin, Changhao Li, Haowei Shen, Kai Xu, Ligang Liu, Ruizhen Hu
Abstract:
Grasp synthesis aims to generate stable and physically plausible hand‑‑object interactions, and has become a fundamental problem in both human hand modeling and robotic manipulation. However, a unified representation across human and robotic hands is still lacking, mainly due to differences in hand morphology and surface modeling. Prior methods typically rely on either contact maps or dense implicit descriptors to represent interaction, but these representations are often incomplete or computationally expensive and redundant. We propose InterMASH, a unified geometric representation that establishes cross‑embodiment correspondence using sphere‑fixed anchors. At each anchor, low‑degree spherical harmonics compactly encode local hand geometry, object geometry, and contact, forming an explicit and interpretable token sequence. Building on this natively tokenized structure, we introduce a conditional Diffusion Transformer that operates directly in the proposed InterMASH representation space and jointly generates hand geometry and contact, improving consistency and physical plausibility. Our method achieves competitive performance with state‑of‑the‑art methods on key physical feasibility metrics in a large‑scale ShadowHand benchmark, supports joint training across multiple hands, and shows that cross‑embodiment fine‑tuning with human grasp data can improve robotic grasp success and diversity. Project page is available at https://inter‑mash.github.io/.
Authors:Shijie Lian, Bin Yu, Zhaolong Shen, Xiaopeng Lin, Yichao Du, Zhirui Zhang, Laurence T. Yang, Kai Chen
Abstract:
Action tokenizers play a central role in autoregressive vision‑language‑action (VLA) models, determining both the targets for policy training and the executable commands recovered from predicted tokens. Their fidelity is commonly evaluated using pointwise reconstruction metrics such as mean squared error (MSE), yet small individual errors do not fully characterize how faithfully action adjustments across demonstrations are preserved. After compression, similar actions may still cluster around a representative motion, while the adjustments needed for different contexts are diminished, distorted, or even reversed. We introduce physical rank consistency (PRC) to measure how well tokenization preserves local physical distance rankings after reconstruction. Evaluating decoded actions provides a common reference across token vocabularies and decoder architectures, complementing pointwise accuracy with a measure of relational fidelity. We further present ActionPiece, which preserves physical action relationships through joint supervision of representation learning and quantization. Physical rank preservation supervises near‑far ordering in encoder and quantized feature distances, while quantization regularization applies the same ordering to codeword assignment distributions. Both objectives augment reconstruction, producing discrete action tokens for standard autoregressive policy learning and execution through a frozen decoder. Under the same Qwen3‑VL‑4B policy training setup, ActionPiece achieves 94.8% on LIBERO and 68.8% on unseen LIBERO‑Plus, with additional evaluations reaching 71.9% on SimplerEnv and 51.5% across VLA‑Arena L0‑L2. Component ablations show that the two objectives jointly improve PRC and policy success, demonstrating the value of physical relationship supervision for action tokenization.
Authors:Éric Jacopin
Abstract:
Lindsey et al. (2025) report that Claude 3.5 Haiku plans rhymes: features for candidate rhyme words are active on the newline before a line is written, and a suppress‑and‑inject intervention redirects the line only when applied there (their Figure 13). We test how far this generalizes on seven cells crossing four open models (0.6B to 2.6B parameters) with six open cross‑layer transcoders (CLTs), on one consumer GPU, decomposing the claim into position specificity (C1), newline site identity (C2), and a newline‑resident plan (C3). This is a stress test rather than a faithful reproduction: attribution graphs are unavailable for these CLTs, so features are found bottom‑up from decoder vectors. C1 generalizes, in every cell and in all 247 of 444 prompt‑by‑inject pairs with a detectable effect, but the effective position is the final prompt token, adjacent to emission, and only two cells reach behaviorally meaningful probabilities. C2 and C3 are not recovered by any probe: a census of every active feature finds no rhyme‑anticipating enrichment at the newline, and steering the newline while the model composes the whole line, over 36 runs and 8,640 sampled lines, shows why. That intervention is strong but one token long, making the injected word the first word of the composed line in 703 of 720 samples and leaving the rhyme six words later untouched. A final test drops the transcoder entirely: patching the newline's whole residual, at every layer, from a minimal‑pair poem whose third line ends on a different rhyme moves the rhyme in 11 of 1,260 composed lines against 4 at baseline, with a design resolving 1.4%. We read this as a boundary condition rather than a refutation: at this scale and with these transcoders, the causal site is emission‑adjacent. We reproduce Figure 13's shape, not its mechanism. Code and data are public (code: github.com/PCfVW/poetry‑planning‑site).
Authors:Yuna Oikawa, Kei Endo, Takanori Uzawa, Yunzhe Zhang, Manan Anjaria, Lerrel Pinto, Sherry Yang, Koji Tsuda
Abstract:
Automating biological research requires general‑purpose, reproducible robot systems that allow individual wet‑lab researchers to delegate robot tasks without performing teleoperation or neural‑network training. Vision‑language‑action policies have been proposed for general‑purpose arms, but can lose performance when their operating environment changes. We therefore built WetRobo, a robot kit that can readily transfer between laboratories. It consists of one robot arm, laboratory equipment (an incubator, a reagent bottle with a cap, and a Petri dish), the existing code that moves the arm, teleoperation demonstrations of each task that we recorded, and a general AGENTS.md skill file. A biological experimentalist provides natural‑language tasks without collecting local teleoperation training data or training a neural network. The coding agent observes the local laboratory and writes and executes programs, using external tools as needed for adaptation. We demonstrate use of WetRobo with OpenAI Codex (gpt‑5.6‑sol) on three successful tasks: lifting a Petri dish lid, removing a bottle cap, and opening the incubator door, all in real‑world laboratories. The coding agent achieved the cap task in both laboratories, Lab X and Lab Y, whereas a VLA fine‑tuned on Lab X demonstrations succeeded there but failed to transfer to Lab Y. These results point to a practical route for laboratory robotics: instead of training a policy for each laboratory, distribute a kit and let a coding agent adapt it in each laboratory. Code, demonstrations, and the evolved programs are available at https://github.com/tsudalab/WetRobo.
Authors:Panjian Huang, Yunjie Peng, Saihui Hou, Chunshui Cao, Xu Liu, Zhiqiang He, Yongzhen Huang
Abstract:
Extensive occlusions in real‑world scenarios pose challenges to gait recognition due to missing and noisy information, as well as body misalignment in position and scale. We argue that rich dynamic contextual information within a gait sequence inherently possesses occlusion‑solving traits: 1) Adjacent frames with gait continuity allow holistic body regions to infer occluded body regions; 2) Gait cycles allow information integration between holistic actions and occluded actions. Therefore, we introduce an action detection perspective where a gait sequence is regarded as a composition of actions. To detect accurate actions under complex occlusion scenarios, we propose an Action Detection Based Mixture of Experts (GaitMoE), consisting of Mixture of Temporal Experts (MTE) and Mixture of Action Experts (MAE). MTE adaptively constructs action anchors by temporal experts and MAE adaptively constructs action proposals from action anchors by action experts. Especially, action detection as a proxy task with gait recognition is an end‑to‑end joint training only with ID labels. In addition, due to the lack of a unified occluded benchmark, we construct a pioneering Occluded Gait database (OccGait), containing rich occlusion scenarios and annotations of occlusion types. Extensive experiments on OccGait, OccCASIA‑B,Gait3D and GREW demonstrate the superior performance of GaitMoE.OccGait is available at https://github.com/BNU‑IVC/OccGait.
Authors:WM Team, Enhui Ma, Kaiwen Guo, Tingrui Zhang, Wei Song, Yingshui Tan, Jianhua Xu, Tong Zhang, Kaicheng Yu
Abstract:
Modeling physical dynamics, including how objects move, interact, and change state, is central to video world models for embodied AI. We present StrucPhysVideo, a family of video world models that bridges physics‑focused data curation with language‑ and action‑conditioned prediction of scene evolution. Our data pipeline combines motion‑aware video segmentation, quality and content filtering, and physical relevance verification with structured annotations of objects, materials, and temporally localized interactions. By disentangling camera motion from object behavior and explicitly describing contact, deformation, and state transitions, the pipeline provides supervision grounded in observable physical events. Building on these data, we introduce StrucPhysVideo‑TI2V, a sparse Mixture‑of‑Experts (MoE) text‑image‑to‑video model trained with a curriculum that progressively emphasizes physical dynamics while retaining general‑domain video data. StrucPhysVideo‑TI2V achieves state‑of‑the‑art performance on Physics‑IQ Verified, scoring 45.5% and outperforming Cosmos3‑Super‑Image2Video by 2.8 percentage points. Caption ablations across backbones further demonstrate the effectiveness of physics‑focused supervision. We further extend StrucPhysVideo‑TI2V to StrucPhysVideo‑IA2V, an interactive image‑action‑to‑video world model that predicts visual outcomes from robot end‑effector commands. Action conditioning, causal autoregressive generation, and few‑step distillation enable incremental robot rollouts with only four denoising steps. Together, StrucPhysVideo advances physical dynamics modeling from image‑ and language‑conditioned video prediction toward action‑driven interaction.
Authors:Zhicheng Hu, Jiacheng Li, Min Yang
Abstract:
Latent neural operators improve the efficiency of operator learning for partial differential equations (PDEs) by performing the main computation on compact latent representations. However, directly compressing the input representation to obtain such compact representations may discard solution‑relevant spatial information, especially for PDE solutions with multiscale structures. To address this problem, we propose HiLNO, a hierarchical latent neural operator that constructs a fine‑to‑coarse‑to‑fine latent space and further introduces multi‑scale supervision (MSS) and anisotropic Gaussian attention. The hierarchy mitigates potential information loss during compression, while MSS aligns intermediate predictions with downsampled target fields, encouraging solution‑relevant structures to be captured across multiple spatial scales. Anisotropic Gaussian attention enables feature transfer across the hierarchy, making HiLNO applicable to general geometries. Experiments on representative PDE benchmarks and a large‑scale automotive aerodynamics task show that HiLNO achieves competitive predictive accuracy, while reducing the parameter count by an average of 84.4% and FLOPs by an average of 69.2% compared with LinearNO. Additional experiments demonstrate effective generalization to unseen spatial resolutions. Code is available at https://github.com/JcLimath/HiLNO.
Authors:Yilin Wen, Kechuan Dong, Fumiya Suginaka, Ken Endo, Yusuke Sugano
Abstract:
Recovering 3D human body motion from video is important for applications such as rehabilitation assessment and sports performance evaluation. For prosthesis users, this requires capturing both natural body joints and the geometry of the prosthetic device, a challenge that existing methods are not designed to address. Model‑based estimators rely on body models trained on non‑amputee individuals and cannot represent prosthesis geometry, while model‑free methods lack body kinematic priors and are unreliable under occlusion. This challenge is particularly prominent for users of running‑specific prostheses (RSPs), where the RSP has a complex curved geometry and moves dynamically during exercise. To fill this gap, we collect RSP3D, the first 3D dataset of RSP users, covering essential daily‑life and exercise actions from participants with varied amputation conditions, using a multi‑camera marker‑based motion capture setup. We formally define the task of prosthesis‑aware 3D pose estimation, evaluate representative methods in a zero‑shot setting, and confirm their individual limitations. We further propose a hybrid baseline combining model‑based body joint estimation with model‑free RSP shape recovery, establishing a starting point for future research.
Authors:Quanrui Rao, Yong Liu, Xueming Xiao, Yingbo Luo, Kun Wu, Zhenyu Xu, Meibao Yao
Abstract:
Generalized morphology control requires a single policy to transform information across limbs with different physical roles, coordinate whole‑body motion, and remain efficient as body size grows. Existing communication mechanisms address these requirements only partially. We introduce RecMorph, a topology‑guided spatial recurrent architecture that uses recurrent sequence computation to jointly perform cross‑limb communication and representation transformation. A depth‑first traversal converts the kinematic tree into a morphology‑derived sequence, along which shared bidirectional transitions progressively transform limb information before action decoding. Residual preservation, RMS normalization, and input‑dependent channel modulation stabilize this repeated spatial transformation, yielding linear token complexity at fixed model width and depth. Across five UNIMAL tasks, RecMorph achieves the strongest mean final training performance among the evaluated generalized morphology controllers and the highest measured inference throughput on FT, while generalizing to unseen variations and bodies with up to 30 limbs. We further migrate representative generalized controllers from UNIMAL benchmarks to a four‑platform quadruped setting. RecMorph achieves the best macro‑averaged performance under nominal and high friction, reduces nominal velocity RMSE by 43.5% relative to specialist MLPs, and one shared policy completes 40 physical Go1/Go2 trials without falls. These results show that topology‑guided recurrent transformation provides an effective and efficient communication mechanism for Generalized Morphology Control and remains effective when transferred from procedural bodies to physical robot platforms. Code and experimental resources are publicly available at https://github.com/quanruirao/RecMorph.
Authors:Xianchi Dong, Yingyan Hou, Chao Ren, Wanxuan Lu, Zihan Wei, Hongfeng Yu, Yixiao Wang, Chubo Deng, Xian Sun
Abstract:
Remote sensing recognition is often constrained by scarce observations of rare targets and costly annotations, making realistic synthetic augmentation particularly valuable for few‑shot and long‑tailed scenarios. Object insertion provides an efficient way to increase target diversity while preserving authentic background scenes, but realistic insertion in overhead imagery requires the generated target to adapt coherently to its surrounding environment. To this end, we propose PDA++, a unified environment‑aware object insertion framework organized as Plan, Decouple, and Assimilate. Planning determines scene‑compatible poses through an affordance field that combines geometric clearance with structure‑ and scale‑aware cues. Decoupling introduces a pose‑conditioned background that provides precise spatial guidance together with target‑scene context, allowing the reference object to preserve its identity while adapting to the target observation. This construction also naturally provides pixel‑level masks for segmentation augmentation. Assimilation further improves local coherence by aligning multi‑scale texture distributions through optimal transport. On the optical benchmark, PDA++ achieves a whole‑image FID of 6.28 and improves average few‑shot recognition mAP50 by 17.69 points, corresponding to a 28.8% relative gain over the real‑data baseline. On SAR imagery, it improves ship detection by 4.10 mAP50 points and remains effective under cross‑dataset transfer and amorphous‑target insertion. Code is available at https://github.com/lisheyu972/PDA_PLUS.
Authors:Haoyu Zhao, Zihao Zhao, Tianyu Deng, Ziqin Xu, Zihao Zhang, Xudong Wang, Jinxiang Guo, Chen Gao, Ziyi Ye, Yeying Jin, Jiaxi Gu, Zuxuan Wu, Shuicheng Yan
Abstract:
Recent Omni‑Modal Generative Models (Omni‑Models) have advanced content generation toward unified modeling of text, images, video, and audio. MiniMax‑H3 exemplifies this transition by combining multimodal context understanding with joint audio‑visual generation in a shared latent framework. Its unified architecture raises a fundamental question: Can multimodal alignment improve the model's world reasoning, and what new evaluation paradigms do omni‑modal inputs enable? To investigate this question, this work introduces a comprehensive evaluation framework organized around four complementary dimensions of physical world reasoning. Unlike existing evaluation frameworks for video generation and world models, which are often constrained by limited input modalities and evaluation settings where prompts closely match the target video content, our evaluation is specifically designed to exploit the multimodal inputs of Omni‑Model. We construct a diverse set of novel tasks that require models to integrate complementary information across modalities. Specifically, we consider four scenarios, including implicit prompts paired with multiple frames, audio‑image, prefix‑videos, and audio‑video inputs. Every single modality provides only partial evidence about the underlying event, requiring the model to jointly reason over the complementary semantic cues to infer latent event states and future dynamics. Across 517 evaluation instances, MiniMax‑H3 achieves an overall success rate of 41.97%. Video‑based Decision Reasoning yields the highest success rate at 56.00%, while Audio‑based Disambiguation Reasoning is the weakest, reaching only 27.40%. These results indicate that effective multimodal integration remains key to fully exploiting the benefits of diverse input modalities. The project is available at https://github.com/gulucaptain/MiniMax‑H3‑Reason.
Authors:Victor Bercy, Martyna Poreba, Michal Szczepanski, Samia Bouchafa
Abstract:
Vision Transformers (ViTs) have achieved state‑of‑the‑art performance across a range of computer vision tasks, mainly thanks to the self‑attention mechanism. However, its complexity, increasing quadratically with the number of tokens, remains the major obstacle to ViT efficiency and deployment at scale. Token merging reduces this cost by aggregating redundant tokens. Yet existing methods are typically evaluated within a single architecture, leaving open whether their effectiveness stems from the merging mechanism itself or from the specific decoder they are paired with. We extend Graph‑Guided Token Merging (G2TM), a single module inserted early in a ViT‑based network, beyond its original Segmenter setting. We evaluate G2TM across three semantic segmentation frameworks (Segmenter, SETR, EoMT) and three decoder families (Linear, Transformer‑, convolution‑based), as well as standard ViT image classification. Our results show that G2TM's behavior and accuracy‑efficiency trade‑off are consistent across every tested architecture for a given backbone size, indicating that its effectiveness is a property of the encoder rather than the decoder. G2TM also generalizes well to image classification, achieving an even smaller degradation in accuracy compared to semantic segmentation. We further find that G2TM's optimal hyperparameters, resulting in a consistent drop in GFLOPs of 22‑47% and an increase in throughput by up to 74% for segmentation models on ADE20K dataset, depend primarily on the backbone's pre‑training recipe and on the target dataset, rather than on the decoder choice.
Authors:Sijie Dong, Wei Ren, Xuanwei Hu, Jiawei Luo, Zifan Wang, Xiaoyun Feng, Hui Cai, Lyuxin Xue, Peng Lu, Jianshe Li, Xin Zhang, Wei Wu
Abstract:
Payment operations are a critical financial infrastructure, but the value of large language models in this domain remains unclear because payment rules change quickly, evidence is fragmented, and decisions depend on transaction state, participant role, region, and payment rail. Existing benchmarks do not isolate whether failures come from missing payment‑rule knowledge, poor use of supplied evidence, or brittleness under imperfect harness inputs. We introduce BENCHCOMPASS, a payment‑domain benchmark whose construction pipeline builds scenario‑grounded tasks from typed evidence packs, applies LLM‑based quality checks, creates task‑input attack variants, and reserves final item admission for domain experts. The release contains an expert‑reviewed Pro benchmark covering payment knowledge, context‑grounded scenario reasoning, and Attacked Open robustness, plus a lower‑assurance Normal pool for inspection and future curation. Across 16 model variants, BENCHCOMPASS shows qualitatively different failure modes: missing parametric payment knowledge, incomplete reasoning over supplied rules, and failure to reject plausible but invalid workflows. The benchmark remains unsaturated: the best frontier model reaches 89.6% on Open Context‑Grounded Reasoning and 81.7% under attacked inputs, while a representative 32B open‑weight model reaches 69.8% and 42.6%. Benchmark data and code are available at https://github.com/ant‑intl/BenchCompass.
Authors:Yerim Oh, Gunhee Kim
Abstract:
Precise retrieval of scientific information is fundamentally constrained by long‑tailed concepts and high fact‑sensitivity of scientific corpora. These challenges often limit the effectiveness of dense retrievers and hallucination‑prone LLM augmentation. To address this, we present REPAIR, a self‑evolving data augmentation framework for scientific dense retrievers. REPAIR iteratively synthesizes training data to address knowledge gaps by cycling through diagnosis of long‑tail concepts, API‑guided evidence expansion, and differentiation via hard negative mining. This process effectively grounds retrieval in factual reality to resolve fine‑grained distinctions. Extensive experiments demonstrate that REPAIR significantly outperforms 19 strong baselines on nine materials science and biomedical benchmarks. Our work highlights that diagnosing and factually augmenting data to long‑tail deficits is essential for robust scientific retrieval.
Authors:Pierre Senellart, Anton Gnatenko
Abstract:
We show that descriptive complexity can serve as a foundation for formalizing computational complexity results in a proof assistant, by constructing a Lean library centered around the following concepts: decision problems are isomorphism‑invariant predicates on finite structures; complexity classes are defined by their logical characterization; membership is shown by definability witnesses; hardness is shown by first‑order reductions from a known hard problem. We also establish bridges to traditional machine models such as (non)deterministic Turing machines. The library proves 73 completeness results, on 68 problems or problem families, over 14 different classes; relations between the classes established inside the logic and not by machine simulation, among them NL = coNL and the Abiteboul‑Vianu theorem; and unconditional lower bounds, among them \mathrmFO(\leq) \subsetneq \mathrmFO(\leq, \mathrmTC) and the failure of order‑free FO(IFP) to capture PTIME.
Authors:Chunpu Xu, Zhixuan Liang, Yuhao Zhang, Chi-Min Chan, Jessie Wang, Yang Xiao, Mengkang Hu, Xiaokang Yang, Yao Mu
Abstract:
Recent advancements have successfully adapted autoregressive language models to process multimodal signals, such as images and actions. Since raw action signals are continuous, effective tokenization is essential to map high‑dimensional inputs into compact discrete tokens for autoregressive processing. However, existing discrete action tokenizers often suffer from high reconstruction loss, failing to preserve the fine‑grained dynamics required for precise control. This "discretization bottleneck" significantly limits the performance ceiling of downstream Vision‑Language‑Action (VLA) models. To address this, we propose M^2Tok, a Multi‑head Multi‑codebook Action Tokenizer designed to minimize reconstruction error and enhance policy performance. Our approach introduces two key structural innovations: (1) we decompose the latent action features into multiple heads, enabling the model to implicitly align specific heads with distinct action dimensions; (2) we assign independent codebooks to each head for quantization. By leveraging the combinatorial nature of multiple codebooks, we significantly expand the representational expressivity of the tokenizer, leading to substantially lower reconstruction loss compared to previous methods. We evaluate the M^2Tok‑based VLA on the RoboTwin, Simpler‑Env, and 3 zero‑shot real‑world tasks. Experimental results demonstrate our method not only achieves superior reconstruction fidelity but also significantly boosts the success rate of VLA models. Comprehensive ablation studies further confirm the effectiveness of the multi‑head and multi‑codebook mechanisms. Code is available at https://github.com/cpaaax/M2Tok.
Authors:Dongding Lin, Jian Wang, Xiaoyan Zhao, Wenjie Li
Abstract:
Real‑world recommendation scenarios are commonly grounded in shared physical environments during user‑recommender interactions. This motivates situated conversational recommendation (SCR), a complex task requiring recommender assistants to jointly reason over dialogue history, co‑observed scenes, and in‑scene item attributes. However, current approaches struggle with this setting due to two intertwined challenges: accurately understanding situated user preferences throughout the conversation and generating responses that simultaneously satisfy user needs and grounded situations. To this end, we propose Re2A, a framework that formulates SCR as a structured reason‑then‑align process. We introduce rubric‑based preference reasoning, which uses automated rubrics to guide the model toward producing explicit preference states. Based on these states, we propose a preference‑conditioned optimization to align response generation with dual objectives: user preference satisfaction and situation consistency. Extensive experiments on two SCR datasets demonstrate that Re2A consistently outperforms state‑of‑the‑art methods, delivering more precise, context‑aware conversational recommendations. Our code is available at https://github.com/DongdingLin/Re2A.
Authors:Chong Jing, Junan Zhang, Zhizheng Wu
Abstract:
Prompt‑conditioned piano MIDI‑to‑Music rendering aims to faithfully render target notes while reproducing the timbre of a reference recording. Existing approaches primarily follow two paradigms: autoregressive (AR) modeling and flow matching (or diffusion). Discrete‑codec AR models provide causal temporal modeling, but quantization can discard acoustic detail. Flow matching better preserves acoustic structure in the cost of full‑sequence attention costs and worse semantic structure. Continuous autoregressive models operate directly on continuous representations. It not only combines the condition‑following ability of AR models and distribution‑modeling capacity of flow matching but also bypasses the quantization bottleneck with lower computational costs. Building on this principle, we present Composer‑‑Performer‑‑Refiner (CPR) framework. Composer autoregressively predicts continuous hidden states, Performer generates 24kHz acoustic latents through local flow matching and Refiner then upsamples the waveform to 48 kHz. We further introduce Bottlenecked Representation Alignment (BREPA) and Modality‑‑Time RoPE (MT‑RoPE) to strengthen musical semantic structure in Composer hidden states and temporal alignments across modalities. Codes are available at https://github.com/FEAfeatherTHER/CPR_official
Authors:Perry Dong, Kuo-Han Hung, Dorsa Sadigh, Chelsea Finn
Abstract:
Reinforcement learning fine‑tuning on top of large, pretrained Vision‑Language‑Action (VLA) models offers promise for highly reliable robot deployment. However, because of their scale, modern VLA models suffer from high inference latency, so the observation used to select an action is often stale by execution time, creating a distribution shift that can substantially degrade reliability and performance. Prior work has explored asynchronous policy execution to reduce the effect of latency, but these methods are mostly built on imitation learning and offer no mechanism for moving beyond the training distribution toward higher reliability. We close this gap by enabling RL fine‑tuning that meets the real‑time control requirements of dynamic real‑world manipulation. Our approach builds on EXPO‑FT, a framework for sample‑efficient, reliable VLA fine‑tuning with reinforcement learning, and decouples slow, expressive action generation from fast, reactive action edits: a large pretrained VLA proposes action chunks using its strong behavior prior, while a lightweight edit policy performs fast, reactive decision‑making by editing actions in response to changes in state, conditioned on the latest observation. We instantiate this as Real‑Time EXPO‑FT, an RL framework for finetuning real‑time VLA policies. On the Kinetix benchmark, Real‑Time EXPO‑FT enables a delayed policy to achieve the best performance among delayed and non‑delayed methods in 10 out of 10 environments. On four dynamic real‑world tasks, robot object passing, ball balancing, table soccer kicking, and dynamic object picking, with online robot data capped at 10 minutes, Real‑Time EXPO‑FT improves average policy performance from 42% to 97%, all without human intervention, demonstrating rapid, sample‑efficient adaptation to challenging real‑world dynamics. Website: https://pd‑perry.github.io/real‑time‑expo‑ft
Authors:Bowei Zhang, Qiyao Zhang, Shuanghao Bai, Xinhua Wang, Meng Li, Yilei Wang, Leiwang Zhang, Jian Tang, Lu Zhou, Lei Sun, Zhengping Che
Abstract:
Humanoid whole‑body manipulation requires coordinated whole‑body dynamics, yet large‑scale trajectories from a target robot are expensive to collect and difficult to scale. In contrast, whole‑body motion from human and humanoid sources is abundantly available, although such data cannot be directly used as embodiment‑specific robot actions. This work asks whether these scalable motion resources can instead provide a transferable predictive prior for humanoid world‑action modeling. We introduce WholeBodyWAM, a humanoid world‑action model that learns whole‑body dynamics from large‑scale heterogeneous motion before target‑robot training. We curate UniMotion‑4K, a motion corpus spanning more than 4K hours from human videos, native 3D motion datasets, and heterogeneous humanoid platforms, and canonicalize these diverse sources into a unified motion space. A language‑conditioned Motion Expert is then pretrained to predict future whole‑body motion without target‑robot action supervision. During robot post‑training, the pretrained Motion Expert is integrated with Video and Action Experts through asymmetric Mixture‑of‑Transformers (MoT) attention, enabling predictive scene dynamics and whole‑body motion to jointly inform embodiment‑specific action generation. Experiments show that WholeBodyWAM consistently benefits from increased motion‑pretraining scale, improves future‑motion prediction and downstream task performance, and transfers effectively to real‑world humanoid manipulation. Moreover, the pretrained motion prior substantially improves data efficiency under limited target‑robot demonstrations.
Authors:Mingyi Li, Ji Li, Zhihao Ouyang, Yage He, Börje F. Karlsson
Abstract:
World models can anticipate the consequences of navigation actions, but predicted action sequences may become invalid during execution, especially when wheel‑legged robots encounter dynamic obstacles or change locomotion modes. We propose WAVE‑Go, an image‑goal navigation framework that separates world‑action prediction from interruptible command execution. Its executor adaptively selects an action prefix and cancels pending commands when updated observations invalidate execution. A conditional‑risk formulation specifies prefix selection under an estimated cumulative failure budget, while posture and locomotion‑mode transitions require clearance, stability, and task‑evidence checks. In the reported navigation evaluation, WAVE‑Go achieves 74.1% in‑distribution success and 63.3% dynamic out‑of‑distribution success, exceeding the strongest baseline by 4.7 and 7.7 percentage points, respectively, while reducing collisions from 4.4 to 2.9 per 100 m. Compared with interruptible fixed four‑command execution, WAVE‑Go raises success by 4.0 percentage points while reducing replanning frequency by 51.2% and collision rate by 6.5%. Execution ablations also show that runtime interruption improves success, collision rate, and reaction latency at the cost of additional replanning. These results support adaptive, interruptible execution as a means of balancing navigation performance and planning overhead. Code is available at https://github.com/vigorlee/wave‑go.
Authors:Yifan He, Yang Liu, Wenhao Zhao, Hai Lin, Deping Zhang, Mingze Ma, Xin Zhou, Fei Gao, Huan Yu, Zipeng Dai, Ziming Ding
Abstract:
Agile quadrotor avoidance of fast‑moving obstacles requires anticipating collisions and selecting feasible maneuvers within short reaction windows. Reliable predictive avoidance remains challenging because sparse range observations do not directly reveal obstacle motion, while online trajectory optimizers either scale poorly with obstacle count or remain efficient at the expense of reliability in dense, high‑speed encounters. We present OmniRisk, an omnidirectional planning framework that learns trajectory‑level risk offline for efficient onboard evasion. A fixed‑dimensional tensor combines LiDAR range panoramas, dynamic masks, and Cartesian surface velocities to represent geometry and motion jointly. We formulate an asymmetric risk field aligned with obstacle velocity that emphasizes approaching interactions and attenuates receding ones. Accumulating this risk along predicted relative trajectories provides dense supervision and discourages unnecessary hesitation after obstacles pass. A dual‑branch circular convolutional network predicts terminal boundary states and dynamic risks for candidate primitives over an omnidirectional anchor lattice in a single forward pass, followed by selection and closed‑form reconstruction of the selected candidate primitive. This formulation removes online risk accumulation along trajectories and makes risk‑inference cost independent of obstacle count. OmniRisk enables efficient onboard avoidance, with real‑world flights demonstrating consecutive evasive maneuvers at relative encounter speeds up to 15 m/s without fine‑tuning. Code is available at https://github.com/VANdexj/OmniRisk.
Authors:Yiheng Liang, Kim Marriott, Helen C. Purchase
Abstract:
Replication studies revisit previous experimental findings for multiple purposes, including assessing reliability, exploring generalisability, and evaluating research methods. Such studies entail design decisions that a single replication label cannot fully capture, making their designs difficult to describe and compare. We present REPVIS2, a validated design space that describes how a replication study relates to a reference study across eight practical dimensions, each coded as identical, similar, or different. We refined our initial design space, REPVIS1, by applying it to a corpus of replication studies and validated REPVIS2 against a separate corpus. We then characterised 86 replication studies from 51 papers in visualisation through paired reading of the replication and reference reports. Studies often retained the task while changing the procedure, interface, environment, participant population, evidence, or analysis. Additions beyond the replication core were also common. REPVIS2 makes replication design explicit for characterisation, reporting, and planning. An interactive visualisation and supplementary materials are available at https://replication‑study.github.io/.
Authors:Haitao Gao, Yang Song, Liao Wu
Abstract:
Self‑motion manifold (SMM) characterizes the geometric structure of the infinite inverse kinematic solutions set of a redundant manipulator at a fixed end‑effector pose, and its efficient recovery underpins feasible and global optimal motion planning. Existing methods such as null‑space continuation and learning‑based methods are formulated around the assumption that an SMM is a curve, and do not extend to higher redundancy orders. We instead adopt a probabilistic view: SMMs are the support of the conditional posterior over configurations given a target pose, so that recovering it reduces to sampling from a learned distribution and separating its disjoint components by clustering. The formulation is independent of the manifold dimension and requires no architectural change as the redundancy order grows. In this work, we demonstrate that our method can approximate 1‑D SMMs with performance comparable to the latest null‑space continuation and learning‑based approach, and that it is the first method capable of approximating highly redundant 4‑D SMMs in a 7R manipulator for position tasks. Project website: \hrefhttps://github.com/accuracy‑maker/high‑dimenstional‑self‑motion‑manifold‑approximationhttps://github.com/accuracy‑maker/high‑dimenstional‑self‑motion‑manifold‑approximation
Authors:Eunju Shin, Jongbin Ryu
Abstract:
In this paper, we present a Mixture‑of‑Experts (MoE) quantization method based on activation entropy. Although quantization reduces memory and computational costs, it can substantially degrade performance. In particular, performance decline is pronounced in quantized MoE models, where individual experts have a small number of parameters that are sensitive to low‑bit representation. Considering that MoE operates as an ensemble model with collaborative contributions from routed experts, a significant performance decline of a particular expert due to quantization can harm model performance. Therefore, we propose Colla‑Q, a bit‑allocation framework to maintain balanced performance across experts through an activation‑entropy‑based bit‑width allocation algorithm. This approach encourages each expert to operate collaboratively in the quantized model, thereby 1) improving the overall MoE performance and 2) reducing the dependence on the calibration dataset. Since uniformly adjusting each expert's performance facilitates robustness and stability of the MoE model, the proposed MoE quantization method can generalize more consistently across different calibration datasets. Our code is available at: https://github.com/mmai‑laboratory/Colla_Q
Authors:Li Chen
Abstract:
Large language model agents tune GPU kernels and serving engines through a closed loop of propose, measure, and keep, but the measurements behind this loop are not trustworthy. We characterize four failure modes from a four‑day pilot corpus of 619 model calls: strawman baselines manufacture speedups, absolute times do not transfer across machines, saturated tasks nullify comparisons, and infrastructure defects impersonate science. We present AutoTuneBench, a benchmark and measurement protocol that makes trust architectural. The protocol is frozen as code with test‑enforced provenance; a database‑level validator rejects out‑of‑protocol results; anti‑cheat checks run outside the agent's modification surface; comparisons follow pre‑registered readouts; and measurements anchor to externally published results, grounded in paired‑seed statistics with a 5% cross‑run coefficient‑of‑variation cap. Honest measurement rewrites the headlines: our best kernel reads 10.6x against a naive baseline but 2.03x against the honest one; one configuration delivers 1.174x on one machine and 1.0049x on another; a pre‑registered on/off comparison nulls at a shared wall (2.4840 vs 2.4957\,ms); and the KernelBench Level‑1 suite admits 51% of tasks with median speedup 1.0001x over PyTorch eager. The protocol, the two‑engine corpus (vLLM and SGLang), and its audit trail are released as open artifacts.
Authors:Jiyao Zhang, Junhan Wang, Tianyu Wang, Zeyuan Chen, Anthony Bolton, Yitong Peng, Hao Dong
Abstract:
Dexterous grasp synthesis has advanced rapidly in generating stable and physically plausible hand poses, but real‑world manipulation requires grasps that preserve the function implied by the task. We study open‑vocabulary task‑oriented dexterous grasp generation, where a robot must infer functional intent from free‑form language, ground it in multi‑view visual observations and object geometry, and generate an executable high‑degree‑of‑freedom grasp. We present OpenDexGrasp, a unified data and generative modeling framework for this setting. OpenDexVerse provides dual‑source supervision organized by the Coverage‑to‑Alignment (C2A) Recipe: OpenDex‑Scale offers large‑scale semantic and geometric coverage through automatic grasp synthesis and vision‑language annotation, while OpenDex‑Align supplies high‑quality embodied alignment through human teleoperation and category‑level transfer. OpenDexGrasp learns a shared perception‑action latent representation that couples open‑vocabulary vision‑language context with dexterous action generation. Affordance grounding and grasp generation provide complementary supervision over this latent space, enabling direct generation of task‑consistent dexterous grasps without a separate affordance‑to‑pose inference stage. Extensive simulation and real‑robot experiments demonstrate improved functional alignment, physical feasibility, generalization to unseen categories, and real‑world execution success. Additional details and videos are available at https://opendexgrasp.github.io/.
Authors:Xihe Shao
Abstract:
One‑step action generation can substantially reduce the inference cost of vision‑language‑action (VLA) policies, but its effect on closed‑loop task success remains an open question. This technical report studies a GR00T N1.7 variant in which the iterative diffusion‑transformer action head is replaced by a one‑step drifting action head, together with an overlap‑conditioned extension for asynchronous chunk replacement. All multi‑seed drifting runs were trained on two NVIDIA A800 GPUs. On LIBERO, the action head reduces the mean model‑forward time of the action head from approximately 45.3\,\mathrmms to 5.0\,\mathrmms, while the measured backbone‑plus‑head time falls from approximately 70.0\,\mathrmms to 30.6\,\mathrmms. However, this speedup is accompanied by a systematic reduction in task success. Across three drifting seeds, success is 64.0\pm4.0% on LIBERO‑Spatial, 52.0\pm1.0% on LIBERO‑Goal, and 26.0\pm2.6% on LIBERO‑Long. The low seed variance indicates that the degradation is not explained by random initialization alone. We report the result as a speed‑‑success trade‑off rather than an overall improvement, and discuss likely contributing factors including deterministic one‑step mode averaging, batch‑dependent geometry estimation, long open‑loop chunk execution, and the fact that synchronous LIBERO evaluation does not exercise the asynchronous overlap path.
Authors:Suprim Nakarmi, Chahana Dahal, Yue Zhao, Junggab Son, Zuobin Xiong
Abstract:
Graph anomaly detection aims to identify graph structures (e.g., nodes, edges, or subgraphs) that deviate significantly from expected patterns, which supports critical applications in fraud detection, spam identification, network intrusion, etc. Despite the growing methods in the field, existing approaches follow a one‑model‑per‑dataset paradigm, limiting their transferability across diverse real‑world scenarios due to task heterogeneity, label scarcity, and domain variability. In this work, we introduce FoundAna, a GNN‑assisted Foundation Model for Graph Anomaly Detection ‑ the first foundation model framework designated for generalizable, cross‑graph anomaly detection by combining GNNs and transformers. FoundAna integrates an anomaly detection‑specific GNN component with a standard transformer encoder augmented by four complementary positional encodings, which enable the model to capture both local and global structural information. Specifically, the positional encoding enriched node representations are passed through attribute and adjacency decoders, and the reconstruction errors serve as the anomaly score. Extensive experiments on nine benchmark datasets spanning financial, social, and citation network domains demonstrate that FoundAna consistently outperforms state‑of‑the‑art baselines. The code implementation and Supplementary materials are here: https://github.com/FoundAna331/FoundAna.
Authors:Timothy Kogucki, Alan Papalia
Abstract:
This work studies how refraction‑induced bias on acoustic ranging affects multi‑agent collaborative localization in a range of oceanographic conditions and spatial scales. While multi‑agent range‑aided navigation, which uses range measurements to either fixed infrastructure or other agents, is a promising solution to the challenges of large‑scale underwater localization, its accuracy depends strongly on the quality of range measurements. Sound speed variability induces refraction (bending) of acoustic rays, yet, for algorithmic tractability, standard sensor fusion pipelines assume straight‑line propagation. This refraction systematically biases range measurements to be longer than the straight‑line assumption predicts. However, the effects of this bias on multi‑agent collaborative localization on kilometer scales remains unexplored. We present a series of simulated experiments with several agents operating over kilometer scales. The simulation uses HYCOM reanalysis data to recreate realistic oceanographic conditions, ray tracing to generate refraction‑informed ranges, and a centralized multi‑agent factor graph estimator to quantify the resulting measurement bias on estimated trajectories. Preliminary results indicate that refraction‑induced bias can induce significant degradation of estimated trajectories, particularly in regions with sharp sound‑speed gradients. We also share the simulation environment to support further studies https://github.com/UMich‑RobotExploration/manta‑ray.
Authors:Andres C. Torres, Tobia Marcucci, Elliot W. Hawkes
Abstract:
Vine robots navigate cluttered environments by extending from their tip. Although their ability to operate in such environments has been extensively demonstrated, little work has addressed growth planning, i.e., finding optimal growth paths. Moreover, existing planners do not account for the growth pressure necessary to follow a given path, which can cause the robot to burst when it is too high. In this paper, we address the problem of finding minimum‑pressure paths for vine robots growing around polytopic obstacles. We propose an efficient algorithm that is guaranteed to find globally optimal solutions in 2D and approximate solutions in 3D, with an error that vanishes as a discretization parameter approaches zero. First, we derive a growth pressure equation for vine robots of arbitrary shape, which we use to show that there always exists a minimum‑pressure path that is piecewise‑linear and can bend only at specific points on the obstacles. We then leverage this observation to reduce the growth‑planning problem to a shortest‑path problem with time‑dependent weights, which we efficiently solve using a modified Dijkstra's algorithm. We demonstrate the speed and scalability of our approach through numerical simulations. We also validate our algorithm with hardware experiments and provide an open‑source and high‑performance implementation in the Python package, VinePlanner: https://github.com/Ahsoka/VinePlanner.
Authors:Md Nadim Mahamood, Md Arif Shahriar, Md Shafi Ud Doula, Kamrul Hasan
Abstract:
The world population is growing rapidly, and technology is improving in parallel. Meeting the huge demand for food for these 7 billion people not only depends on increasing food production but also on reducing food loss. Crop losses due to disease affect both the food supply and the financial and economic stability of a country. Tomatoes are among the top food‑producing crops globally, and a significant portion of this production is lost due to disease. People have used Machine Learning techniques for feature extraction and early diagnosis of tomato diseases, and nowadays, Deep Learning‑based models are widely used for disease recognition. However, most existing models are highly parameter‑intensive, which increases the time required for training and inference. As a result, while lightweight models are more suitable for user‑friendly applications, they often show a reduction in performance. To balance performance and model size, we propose CoAtNet‑DeepMoE, a Convolution‑Attention hybrid architecture for rich feature extraction, further enhanced with a DeepSeek Mixture of Experts to substantially reduce the number of parameters without sacrificing accuracy. We evaluate our model on both balanced and imbalanced datasets from Kaggle and PlantVillage, demonstrating robustness and achieving 99.80% accuracy, 99.80% precision, 99.80% recall, and 99.80% F1‑score on Kaggle, and 99.83% accuracy, 99.85% precision, 99.76% recall, and 99.80% F1‑score on PlantVillage, representing state‑of‑the‑art performance with only 2.47M parameters. The source code will be available at https://github.com/nadimbrur/CoAt‑MoE.
Authors:Wenyu Li, Sidun Liu, Peng Qiao, Yong Dou, Tongrui Hu
Abstract:
Novel view synthesis from unposed multi‑view images remains challenging, as the model must jointly learn scene representations and camera parameters without pose supervision. Existing approaches largely fall into two extremes: implicit latent‑space rendering is flexible and easy to optimize, but often yields weakly grounded camera estimation; explicit 3D representations provide stronger geometric grounding, but introduce heavier parameterization and more fragile optimization. In this paper, we present IRIS, a fully self‑supervised framework that provides a practical middle ground between these two paradigms. Instead of decoding free latent tokens or reconstructing fully explicit 3D primitives, IRIS represents the scene as a latent neural field and renders novel views by querying this field under self‑predicted cameras. Specifically, projected features from reference views are aggregated at sampled 3D points to form point‑wise latent features, which are then composed along target rays for rendering. This design preserves the flexibility and optimization stability of implicit modeling, while introducing stronger geometric structure than unconstrained latent rendering. Extensive experiments show that IRIS achieves strong novel view synthesis quality with competitive pose accuracy under fully self‑supervised learning. Our project page: https://leo‑frank.github.io/IRIS
Authors:Jerry Kaplan
Abstract:
Large language model optimization is an active research area, spanning quantization of model weights, early‑exit methods for skipping layers, and speculative decoding. Each track uses its own quality measures, typically an idiosyncratic benchmark score. Few approach the measurement precision required by other scientific disciplines. We propose a rigorous methodology for measuring output quality, suitable for cross‑system and cross‑technique comparison. We score outputs with an LLM as a judge, but calibrate the judge formally: we compare its scores on two ordinary runs of a model given the same prompts, verifying that it shows no systematic preference between statistically equivalent outputs and measuring its per‑sample noise. Each design also includes a 'null' condition, provably identical in distribution to the unmodified model, whose measured difference must be zero. With this one instrument we measure several acceleration techniques on the same prompts, so their quality costs can be compared. Perceived quality proves highly dependent on the domain of discourse. A 4‑bit model was indistinguishable from its 16‑bit original down to our design's +/‑0.3‑point resolution, in English prose and Chinese alike. At 3‑bit precision the same prompts lost 0.5 points in English prose, 0.9 in Chinese, and 1.1 on multi‑step math; early exit that cost 0.7 points on prose cost 2.5 on math, cutting correctly solved problems from 19 of 27 to 6. The pattern held for models from Alibaba and from Meta, but not its magnitude: the same quantizer cost Meta's model 1.8 points where it cost Alibaba's 0.7. A model's certainty about a token predicts how likely it is to differ from the full model's choice, but not how much that difference affects judged quality, so acceptance rules relying on certainty cannot distinguish errors that matter from errors that don't.
Authors:Bryant Pollard
Abstract:
Temporal link prediction on the Temporal Graph Benchmark 2.0 (TGB 2.0) faces a scalability ceiling: on the benchmark's three largest datasets, every existing embedding method runs out of memory or exceeds the time budget. These large‑scale graphs are the ones nearest real deployment scale, so failing on them is a real production limitation. EdgeReMIND sets the highest reported test mean reciprocal rank (MRR) on six of eight TGB 2.0 datasets and is the only relation‑aware method that runs on all of them. This linear memorization model, with learned per‑relation weights over data‑calibrated features, is therefore not merely a fallback where embeddings fail but a practical state‑of‑the‑art baseline across the benchmark.
Authors:Mingyang Chen, Shengdong Chen, Xiaoxiao Fu, Bosheng Gong, Haoyuan Guo, Bowen Li, Jiawen Li, Kejun Li, Tianpeng Li, Yin Liu, Haoze Sun, Zeyang Tian, Meng Wang, Xinmiao Wu, Jiangqiao Yan, Zining Zhao
Abstract:
We introduce Zing‑0.5, a 5B autoregressive world model designed for playability: users can explore generated worlds, influence unfolding events, and respond to the resulting feedback through joint keyboard and online text control. Our approach brings together three technical contributions: (1) Unified action and text conditioning, combining magnitude‑aware keyboard inputs with temporally aligned text instructions and jointly annotated videos to learn navigation and event control within the same sequence; (2) Event‑scale supervision for incremental generation, using a segment‑level teacher trained on connected multi‑prompt videos to supervise a block‑level causal student through distribution‑matching distillation; and (3) Low‑cost real‑time interaction, combining four‑step generation with context‑preserving streaming to support 832 x 480 inference at 24 FPS at an estimated server rental cost of approximately USD 0.009 per stream‑minute. Zing‑0.5 achieves an overall score of 81.0 and a consistency score of 88.5 across 158 WBench Navigation cases. A joint‑control demonstration shows a text‑directed event change during continued navigation without restarting generation. We release the model weights, inference code, and Zing‑SGLang serving implementation to support further work on playable generated worlds.
Authors:Xinle Yu, Fan Bai, Kaiser Sun, Hengshuo Miao, Abhay Anand, Zhongyan Luo, Kun Zhou, Zhen Wang
Abstract:
Autonomous research agents aim to automate scientific workflows, from proposing ideas to conducting experiments and analyzing results. Yet current AI and research agents can propose more directions than available resources allow them to pursue. Moreover, each attempt could consume substantial resources, requiring agents to reconsider how to invest in subsequent research. Thus, deciding how to invest research effort strategically should be a defining capability of autonomous research agents. Accordingly, we introduce PrimeScientist, which jointly determines research direction and resource investment across successive research attempts. Specifically, we formulate this challenge of strategic research effort allocation as a sequential decision problem where remaining resources should explicitly guide the research policy. We first introduce an executable plan tree that preserves competing plans and their outcomes across attempts. Building on this representation, we propose an adaptive MCTS‑based allocation policy that balances exploration and exploitation using experimental feedback and remaining resources. Comprehensive evaluations across AI research, systems and code optimization, and machine learning engineering show that strategic allocation improves research quality and sample efficiency together. Across 12 AI research tasks, PrimeScientist improves average reward by 10.3% with 50.6% fewer research attempts than AutoResearch under the same resource budget. We believe making research effort allocation an explicit optimization target establishes effective resource use as a core research capability for autonomous agents to drive scientific breakthroughs at scale.
Authors:Alexander Caicedo, Víctor De La Hoz, Santiago Alférez
Abstract:
Understanding how deep neural networks make decisions remains a fundamental challenge. We present NObSP (Nonlinear Oblique Subspace Projections), a framework that decomposes predictions into explicit per feature contribution functions and an interaction residual. NObSP exploits the linear final layer of a trained network and uses oblique projections in sample space to reduce double counting when learned feature subspaces overlap, thereby supporting both local explanations and global functional analysis. We establish connections to functional ANOVA and the Kolmogorov‑Arnold representation theorem and derive an efficient partial regression algorithm for out of sample evaluation. For convolutional networks, NObSP‑CAM produces class activation maps without backward passes after a one time calibration. Experiments on tabular and vision benchmarks show faithfulness comparable to established attribution methods. On a synthetic benchmark with known component functions, NObSP obtains a Function Reproduction Score of 0.989, compared with 0.966 for KernelSHAP and 0.922 for Integrated Gradients. On TinyImageNet, contribution vector embeddings improve mean nearest neighbor class purity from 0.654 for raw activations to 0.713 and reduce mean neighbor distance by more than half. These results indicate that NObSP complements scalar attribution methods by recovering functional contribution profiles with separable positive and negative evidence.
Authors:Krishnan Suresh
Abstract:
Quantum algorithms require embedding linear operators into unitaries using block encodings. The costs associated with these block encodings determine whether a quantum speedup is achieved. Efficient \emphshift decomposition encodings have been proposed for 2D homogeneous scalar operators. Here, we present exact block encodings for 2D homogeneous elasticity, 2D two‑phase bilinear Poisson, and 2D two‑phase elasticity periodic finite‑element operators. For 2D homogeneous elasticity, the resulting linear combination of unitaries (LCU) has L = 17 terms for every Poisson ratio ν and every mesh resolution, and the subnormalization is the closed form α= E(33+ν)/\bigl[6(1‑ν^2)\bigr], exceeding \|\mathbfK\|_2 by the resolution‑independent factor (33+ν)/24. To address two‑phase periodic microstructures, we introduce two oracles with distinct roles: a node‑to‑element oracle, built from cyclic shifts, that carries a nodal index to each of the four incident element indices, and a microstructure‑specific material oracle that marks phase membership with a sign. This yields 25 and 57 LCU terms for two‑phase Poisson and elasticity, respectively; the latter reduces to 49 at ν= 1/3. The term counts are independent of mesh resolution, volume fraction, and phase contrast. The subnormalizations, provided in closed form, are independent of mesh resolution and volume fraction. In the scalar case, the tight bound α= \|\mathbfK\|_\infty is achieved whenever a node lies entirely in the stiffer phase. In the elasticity case, that bound is not attained, since the shear coupling contributes entries of both signs to a row. An open‑source implementation is available at https://github.com/UW‑ERSL/PyBlockEncode
Authors:Antonio Alvarez Valdivia, Ciera McFarland, Robert Reeve, Ankush Dhawan, Chad Council, Megan Richardson, Margaret McGuinness, Nathaniel Hanson
Abstract:
Soft robotic systems have long been theorized as ideal candidates for use in search and rescue operations; however, there have been significant barriers to entry in graduating soft robotic systems from the laboratory to the field. To address this gap in replicable, reliable soft robot systems, we present the designs for SPROUT, the Soft Pathfinding Robotic Observation Unit. The system has matured over years of interaction with professional urban search and rescue communities, with the goal of operating in dusty, wet, and isolated conditions. This manuscript contains supplementary material, including code, parts manifests, CAD assemblies, and build instructions to allow the broader robotics research community to build their own SPROUT systems. The modular hardware and ROS 2‑based software stack support task‑specific payloads and control functions, allowing SPROUT to be adapted for applications beyond search and rescue, including infrastructure inspection and archaeology. Here, we demonstrate SPROUT performing a variety of challenging inspection and traversal tasks in collapsed structure training sites used by first responders. The main project page is available online at https://sprout‑mitll.github.io/sprout/.
Authors:Jordy Kieto
Abstract:
Behavioral cloning trains a policy offline on expert demonstrations, but deployment is closed loop: each action affects the observations the policy receives next. We study how much closed‑loop driving competence a compact multimodal policy can acquire from offline demonstrations in the CARLA simulator. The policy uses five‑frame histories of RGB images, LiDAR, vehicle telemetry, and lane waypoints to predict throttle, brake, and steering at 20 Hz. Demonstrations were collected in three stages, ending with a systematic route‑generation procedure that enumerates spawn points and feasible maneuvers and verifies completed autopilot routes. The released 1.36 million parameter policy was trained on 236,882 windows, representing about 3.3 hours of driving from 448 captures. The resulting policy drives autonomously for hours on training and held‑out routes. In our runs, it did so without collisions and also transferred qualitatively to an unseen CARLA town with different road geometry. We also observed recovery from large trajectory deviations, although we do not claim systematic recovery without controlled evaluation. We report offline metrics and distinguish measured results from qualitative closed‑loop observations. We release the code, trained checkpoint, ONNX model, data sample, and an evidence audit for the reported claims.
Authors:Vijesh KP
Abstract:
Face swapping and face compositing pipelines routinely produce a face that is geometrically well aligned but photometrically implausible: the donor face carries flat, near‑frontal studio illumination while the host body and background carry directional scene light. Most existing remedies re‑synthesise the face through colour transfer, neural relighting, or inverse rendering, and therefore risk altering identity, skin tone, and texture. We present a conservative alternative: geometry‑driven form‑shadow injection. The pipeline never repaints the face. It estimates a per‑pixel gain field g\in[g_\min,1] from a rasterised 3D face proxy and multiplies it channel‑uniformly onto linear RGB, so the operator can only darken and cannot shift chromaticity. A dense landmark mesh is rasterised into a depth buffer, from which we derive surface normals, a cavity term, and screen‑space cast shadows. Key‑light direction is estimated from host‑side cues (body, background, hair halo); on‑face cues are downweighted because they recover the donor's lighting. Shadow magnitude is not matched to the host: it is set by a three‑parameter transfer (τ,σ,g_\min). The shading field is divided by its 75th percentile over skin, then gated, scaled, clamped, smoothed, and re‑clipped inside a feathered, skin‑gated face mask. On an analytic face heightfield, the default (τ,σ,g_\min)=(0.90,0.45,0.82) modifies 56.5% of face pixels with mean gain 0.938 (0.890 on modified pixels) and drives 3.4% of pixels to the floor. Hue invariance is a corollary of the operator. We analyse the transfer in closed form, ablate its parameters, and discuss failure modes of a monotone, darkening‑only formulation, including double‑shadowing of non‑flat donors.
Authors:Rappy Saha, Nima Amirafshar, Jude Haris, Nima Taherinejad, José Cano
Abstract:
Approximate multipliers can reduce hardware area and energy consumption in Deep Neural Network (DNN) inference; however, they introduce computational errors. Assessing the accuracy of numerous approximate multiplier designs across diverse DNN models and large‑scale datasets remains challenging due to prohibitive evaluation times. This overhead primarily stems from the slow emulation of approximate multiplier behavior using look‑up tables (LUTs) on CPU and GPU platforms. Moreover, the resulting accuracy degradation must be carefully quantified and, if necessary, mitigated (e.g., through retraining), further increasing the overall evaluation cost. To address these challenges, we propose FAME, an FPGA‑based platform for evaluating approximate multipliers. The platform exploits the reconfigurable logic of Field‑Programmable Gate Arrays (FPGAs) to implement approximate multipliers directly in hardware, eliminating the need for LUT‑based emulation on CPU/GPU platforms and thereby enabling efficient DNN inference while significantly reducing evaluation time on large datasets. Furthermore, we introduce a pattern‑guided DNN retraining technique to mitigate accuracy degradation induced by approximate multipliers. Specifically, retraining is guided by multiplier‑specific patterns to effectively recover potential accuracy losses. We evaluate FAME using two DNN models, ResNet‑18 and MobileNetV2, on the ImageNet dataset across 27 approximate multipliers. During inference, our approach achieves up to a 3.47x speedup in approximate multiplier evaluation compared to prior LUT‑based emulation methods. Furthermore, the proposed retraining technique improves accuracy by up to 65.5% over existing retraining approaches for the evaluated multipliers. The code is publicly available at: https://github.com/gicLAB/FAME
Authors:Zijin Hou, Ying Cao
Abstract:
Graphic designs nowadays predominantly contain human images, where people are posed and framed in a delicate way to guide viewers' visual exploration and evoke desired feelings. Despite recent progress in automatic graphic design generation, there has been no work on investigating the role of the human representations in design creation. In this paper, we seek to emphasize the importance of visual human representations in graphic design generation, by studying a novel task, dubbed as design‑conditioned 3D human adding. To solve this task, we propose a model that adds 3D human representations into an existing partial design, by predicting their 3D poses, their 2D composition in the image containing them, as well as the spatial arrangement of the image in the input design, to generate a complete design. Our experiments show that our model outperforms baselines by predicting the 3D human poses, 2D framing and human image layout that better harmonize with the other existing design elements, and generating higher‑quality holistic designs. Our work is the first to explore connections between 3D human generation and 2D graphic design generation, which would inspire future research in leveraging 3D information to build more powerful generative models for graphic designs in the 2D domain. The code is available at https://github.com/GreyNails/Human‑aware‑Design‑Generation‑Adding‑3D‑Humans‑into‑Graphic‑Designs.
Authors:Bofan Chen, Boxuan Zhang, Fei Tang, Zhengxi Lu, Yong Du, Tongbo Chen, Weiming Lu, Jun Xiao, Yueting Zhuang, Yongliang Shen
Abstract:
GUI agents execute long‑horizon tasks on dynamic graphical user interfaces, where pop‑ups, delayed loads, and relocated widgets routinely invalidate plans fixed before execution. Recent agent‑skill frameworks encapsulate reusable procedural knowledge to mitigate this, yet existing skill designs are largely developed without targeting GUI execution dynamics and treat skills as static artifacts produced before deployment rather than living procedural knowledge that improves through it. We argue that what GUI agents need is not better static skills, but skills that can be revised from execution feedback at deployment time, without additional training. We propose EvoSkill‑GUI, a training‑free framework in which each skill is a structured multi‑file package containing retrieval metadata, executable plans, backup localization, failure‑recovery rules, accessibility utilities, and failure cases. EvoSkill‑GUI operates through a \emphreflect‑revise‑reuse loop: the executor performs instant in‑rollout revisions, an isolated critic diagnoses failed trajectories under strict information isolation, and the executor edits specific skill files through a restricted tool interface. Across MobileWorld, AndroidWorld, and OSWorld, three mainstream GUI benchmarks spanning mobile and desktop platforms, EvoSkill‑GUI consistently improves multiple base models without any training, with maximum gains of +16.2%, +6.0%, and +10.5% respectively, and evolved skill libraries continue to benefit related tasks rather than being rebuilt from scratch. Our code is available at https://github.com/ZJU‑REAL/EvoSkill‑GUI.
Authors:Vivek Kalyanarangan
Abstract:
When agentic sessions run to a million tokens with many sessions resident at once, the KV cache and the index that ranks it live in host memory, and the scan that ranks all n keys for a top‑k step becomes the traffic that bounds decoding. We present Fathom, a key scan in which each query decides how many bits of each key channel to read. The 4‑bit K cache is stored channel‑major as bit planes, so a prefix of t planes is exactly the channel's t‑bit quantizer, and the query spends its bit budget by reverse water‑filling over the variance‑weighted importance of its channels. At one million tokens on Qwen3‑8B a decode step is 1.67x faster in GPU time than with the 136‑bit scans of Double Sparsity, Loki and SparQ r=32, and in the same GPU time as SparQ's 68‑bit read (r=16) Fathom reads 18% fewer bytes with lower attention error on six of seven model and context settings. On RULER‑style tasks every per‑token scan matches exact top‑k decoding, and on real coding‑agent sessions Fathom reaches the step agreement of the most accurate 136‑bit scan at 92 bits. The store is the 4‑bit K copy a quantized serving stack already holds, and the method is not faster when the index is resident in GPU memory.
Authors:Alessandro Bombini
Abstract:
This is the set of lecture notes for the PhD course \hrefhttps://www.unibz.it/en/faculties/engineering/phd‑computer‑science/study‑course‑offering/2025/36967Physics Informed Neural Network, held at the University of Bozen/Bolzano in the academic year 2025/2026. The goal of the course was to introduce the concept of Physics Informed Deep Neural Networks (PINN) and Neural Operators (NOs), discuss their implementation from scratch in PyTorch and using advanced ad‑hoc developed open‑source libraries such as NVIDia PhysicsNeMo to address real‑world problems in various fields (engineering, physics, petroleum reservoir). We discuss recent topics such as Mixture‑of‑Models, Fourier Neural Operators, Physics‑Informed Kolmogorov‑Arnold Networks (PIKANs) and Fourier Neural Operators.
Authors:Yang Xia, Rolf Bader
Abstract:
The hulusi is a wind instrument that was invented in Yunnan Province, China, and has become tremendously popular in recent years. It consists of a mouthpiece, a gourd, and three bamboo tubes, all with free reeds made of copper. The main bamboo tube in the middle has seven finger holes. In this instrument, the pipe length, not the free reed's eigenfrequency, determines the instrument's pitch, unlike, for example, with the Western accordion or the blues harp. In this study, a machine learning model implemented in the COMSAR framework (https://github.com/ifsm) was used to investigate the timbre characteristics of the \emphhulusi to cluster different instruments and pitches. The measured \emphhulusi pitches C, B, A, G, and F were analyzed according to seven psychoacoustic features, among which only the spectral centroid, sharpness, and fractal correlation dimension are shown to form pitch clusters. These timbre features were used to train Kohonen self‑organizing maps (SOMs) for clustering. Brightness and sharpness analysis revealed that the highest pitches were less bright and less sharp than mid‑ and low‑range pitches were. Furthermore, the fractal correlation dimension, which mainly determines the chaoticity of the initial transients, was the best‑clustering timbre feature for the hulusi, with the highest pitches showing the least chaoticity. This result is supported by defining a cluster quality index for the SOMs.
Authors:Samuel Larson
Abstract:
Can gradient‑based training learn the rank needed to store and compose associations in a matrix memory? In our earlier study, we used a matrix‑augmented reasoner on a task that admits a rank‑1 solution, leaving this question open. We train matrix memories on K fresh key‑value bindings whose exact linear recovery requires \mathrmrank(Z) \geq K. A fixed linear readout queries a single matrix state without access to the original bindings. Experiments measure recovery by cosine similarity greater than 0.9, a threshold distinct from mathematical equality. Learned effective rank increases with K across the tested grid (Spearman ρ= 1.0 at d = 16). Training‑time rank caps produce a recovery transition near k = K: at d = 8, K = 4, rank 3 gives at most 0.0004 recovery and rank 4 gives 0.97. Four of five seeds retain at least 0.9996 recovery through 21‑fold self‑application of the trained operator. On the entity subspace, the learned operator has effective rank close to K and approximates the ideal cycle. For the single converged seed capped below K, a calculation using the entity‑subspace operator and ideal cycle predicts the measured cosine within 0.008 through seven applications. Extending training resolves several initial failures, but recovery still declines at larger matrix dimensions with encoder width fixed.
Authors:Dekun Yang
Abstract:
Where in a Transformer is the change from memorization to generalization functionally expressed? We introduce Transition Games‑‑behavior‑aligned exact activation games with paired non‑generalizing controls‑‑and find distributed utility gain with a prospective block‑0 attention bias; selected degree‑two modes account for 67‑‑92% of its addition contrast across replacement games, and a disjoint exact path study confirms that block‑1 MLP mediates more of their effect than all other tested downstream paths in 12/12 pairs. The sharper "MLP memorizes, attention generalizes" prediction instead reverses (‑.331 bits/example at the memory anchor; 0/12 in the predicted direction), while routing onset, global rank collapse, and a prime‑invariant architecture ridge also fail, identifying grokking here as spectral recoding of an existing distributed circuit rather than a module switch.
Authors:Koyar Afrasyab
Abstract:
Additive‑congestion constraints in single‑source unsplittable flow can enforce stable‑set structure. This note isolates and generalises that mechanism. We introduce a path‑closed notion of realising an independence system by the zero‑cost choices of primary terminals in a directed acyclic flow instance. The definition quantifies over every directed source‑terminal path and therefore remains valid under prefix borrowing, suffix splicing, and hybrid routes.Our main result extends the triangle mechanism: every finite loopless independence system has a polynomial‑size realisation, measured in the incidence size of its minimal forbidden sets. Hence every finite simple graph, and more generally every hypergraph independence system without singleton forbidden hyperedges, is representable by an acyclic single‑source gadget. We then specialise the construction to odd cycles. For C_2k+1, a uniform rational family produces a fractional cheap‑selection vector that violates the odd‑cycle inequality. A potential shift converts a signed connector separator into nonnegative arc costs and gives the exact cost‑preserving additive‑congestion threshold tau = 1 ‑ bq. Within the symmetric family, the supremum threshold is (k+2)/(2(k+1)), which tends to 1/2. For C5, an exact certificate independently derives all source‑terminal paths and enumerates all 3^10 = 59049 unsplittable routings using rational arithmetic.
Authors:Saipraveen Vabbilisetty, Ajay Kumar Boddepalli, Deep Narayan Mishra, Shashank Kapadia, Haoan Wang, Anupriya Sharma
Abstract:
Deploying retrieval‑augmented generation (RAG) on commodity GPUs such as the NVIDIA T4 (16 GB VRAM) exposes a practical failure mode we call the Compression Paradox: neural prompt compression can add key‑value (KV) cache contention and preprocessing latency that outweigh generation‑time savings, while skipping compression can cause out‑of‑memory (OOM) failures on long contexts. We identify two distinct failure mechanisms when a vLLM‑served LLM and a PyTorch‑based compressor are co‑deployed under tight memory budgets, and introduce the Tri‑Metric Router, a deterministic, training‑free policy that selects among Raw, Neural (LLMLingua‑2), and Lexical (BM25) pipelines. The router uses three CPU‑side signals: spatial complexity (L), syntactic density (ρ_key), and type‑token ratio (TTR). Unlike prior semantic‑only adaptation, our dispatch signal is hardware‑physical, based on VRAM headroom and a latency crossover point. Thresholds are calibrated from profiling on LongBench qasper, yielding an operating crossover near 4,332 words on T4; our contribution is this calibration methodology rather than a hardware‑specific constant. On out‑of‑distribution holdouts, the method achieves 0% OOM failures, 88.5 \pm 4.4% oracle alignment, and 49.3% Combined F1, improving over always‑on lexical compression by 5.2 points without additional VRAM or training cost.
Authors:Vassili Philippov, Amro Salman, Dmitrii Andreev, Penny Hands, Emil Kaiumov, Pavel Katunin, Anton Nikolaev
Abstract:
In English all‑words word sense disambiguation (WSD), the labels, not the models, have become the bottleneck: frontier LLMs are accurate enough that the errors surviving in the gold standard decide benchmark rankings ‑‑ in the test sets we score on and, as we show causally, in the corpus we train on. We release lexEN, a WSD evaluation benchmark built as a conservative, human‑adjudicated correction layer over Maru2022's ALL_NEW benchmark (211 labels changed, 56 removed), and SenseBench, an auditable LLM WSD evaluation harness and living leaderboard (57 models, 192 runs). The task is inventory‑constrained multiple choice (the model picks from the supplied WordNet senses), so the reported accuracies are a ceiling on what models achieve without that help. On lexEN‑v1 the frontier LLMs converge near 95% (best, 95.6%), the top three families are statistically indistinguishable, and accuracy trades off against reasoning effort and cost across a ~2,500x price span. Relabeling SemCor with frontier models and retraining BEM, ESCHER, and ConSeC unchanged lifts them by several F1 points on test sets the relabeling never touched; we release the relabeled corpora and Glite LENS, a 298M bi‑encoder trained on the repaired labels ‑‑ to our knowledge the strongest reported (83.6 Raganato ALL, 87.4 Maru ALL_NEW) ‑‑ serving at ~0.13 per million items. On hard items, fine‑grained WordNet senses are partly ill‑posed even for experts (three‑reviewer Fleiss kappa=0.537); coarsening raises annotator agreement and model accuracy together across four inventories, placing a top model inside the expert agreement band at coarse granularity (statistically equivalent under three of four) but significantly below it at fine. The binding constraint is now cost.
Authors:Saad Aamir, Muhammad Awais Bin Adil
Abstract:
Language models frequently abandon correct answers when users push back. We study this in two small instruction‑tuned models from different families, Qwen2.5‑1.5B and Llama‑3.2‑1B, over TriviaQA: the model answers, is challenged with one of four scripted pushback styles, and answers again. Conditioned on an initially correct answer, the models flip to a wrong answer in 41.8% and 43.1% of episodes. Which pressure works is a property of the model, not the pressure: the same within‑question paired comparison (bare doubt vs. emotional appeal), specified in advance, is Bonferroni‑significant in opposite directions across families (Qwen: bare doubt > emotional, OR 2.5, p=.040; Llama: emotional > bare doubt, OR 4.0, p=.001). Failure mode is also model‑dependent: Llama abandons answers without recommitting at six times Qwen's rate (8.2% vs. 1.4%). Identical pushback repairs initially wrong answers only ~13% of the time; pushback is net epistemically destructive. We then ask whether capitulation is linearly decodable from the pre‑response residual stream, a prerequisite for steering‑vector interventions at that locus. A naive difference‑in‑means probe appears to succeed (in‑sample AUROC 0.81/0.71), but a validation protocol combining question‑level cross‑validation, shuffled‑label nulls, and a known‑direction positive control shows the signal is overfitting: the best cross‑validated AUROC is 0.582 in Qwen and 0.548 in Llama, both near or below their permutation thresholds and far under a pre‑registered usability bar of 0.70, while the identical pipeline recovers a pushback‑presence control direction at AUROC 1.000 in both. We further quantify a measurement hazard: substring grading underestimates capitulation by 18‑24 percentage points. Code, prompts, transcripts, and analysis are released.
Authors:Simran Koul
Abstract:
Large language model services increasingly route each query to one of several models of differing capability, using a cheap estimate of query complexity to send easy queries to small models and hard queries to large ones. I show that this routing step is not register neutral: text written in a non‑standard English register, African American English or the English of second‑language writers, is systematically assigned a lower‑capacity tier than a meaning‑equivalent standard‑English version of the same query. The effect is driven by a specific, common routing signal, input length, because non‑standard registers omit function words and thus look shorter and therefore simpler; other complexity signals do not carry it. I demonstrate the disparity on 37,704 authentic learner sentence pairs and on a controlled parallel corpus. I then measure the quality consequence on a device, edge, and cloud model ladder and find that the harm is driven by pervasive model bias, every tier, including a frontier cloud model, answers non‑standard‑register queries significantly less accurately, while the marginal quality cost of the routing decision itself is not significant on this benchmark. Complexity‑based routing thus compounds the exposure of the users that the models already serve worst.
Authors:Divyansh Agarwal
Abstract:
We ask whether relation‑type information (e.g., capital‑of) and entity‑specific information (e.g., France to Paris) become causally active at the final‑token position at the same depth during recall. Using four complementary causal diagnostics across four decoder‑only models and eight prompt families, we find a robust temporal asymmetry: relation information becomes generation‑controlling before entity information does. Relation onset precedes entity onset by 10‑16 tested layers (31‑44% of network depth) at threshold 0.4, with the ordering holding across all 16 model‑threshold combinations for thresholds 0.2‑0.5. Critically, entity information is not absent early: entity‑token patching succeeds at 90‑100% in early layers. Instead, entity commitment to generation is deferred: entity information is available at the entity‑token position but becomes generation‑controlling at the final token only after being routed there.
Authors:Jiyue Jiang, Ziyi Li, He Hu, Sheng Wang, Yuhan Chen, Yanyu Chen, Jingqi Zhou, Pengan Chen, Fei Ma, Irwin King, Yu Li, Chuan Wu
Abstract:
Cognitive Stimulation Therapy (CST) offers non‑pharmacological support for elders with cognitive impairment, yet scalability remains constrained by reliance on trained facilitators and severe data scarcity, particularly for privacy‑sensitive, low‑resource languages such as Cantonese. While Large Language Models (LLMs) show promise for automated companionship, they often struggle to balance empathetic engagement with adherence to cognitive stimulation guidelines. We propose a framework addressing these challenges along two complementary axes. First, STaR‑CS (Style‑Transfer and Role‑Conditioned Cognitive Stimulation) synthesizes multi‑party dialogues through facilitator style modeling and structured skeleton extraction, mitigating data barriers. Building upon this corpus, the Reflective Cognitive Alignment (RCA) framework models stimulation interactions as a sequential decision process, integrating Protocol‑Constrained Chain‑of‑Cognition (PC‑CoC) for structured reasoning and Inference‑Time Value Alignment (IVA) for principled response selection based on safety and engagement goals. Evaluations across six backbone LLMs and two independent judges show that RCA consistently improves protocol adherence, safety, and group facilitation over standard prompting baselines. Our code is available at https://github.com/jiangjyjy/RCA_Agent.
Authors:Adam Hung, Bardienus P. Duisterhof, Deva Ramanan, Jeffrey Ichnowski
Abstract:
World‑action models (WAMs) jointly model future observations and actions, typically predicting the future as RGB images. Other visual modalities such as depth, pretrained visual features, and point tracks can more efficiently capture geometric, semantic, and motion features. However, how best to combine these modalities within WAMs remains an open question. We introduce ModAR, the first WAM to autoregressively denoise multiple future modalities before predicting actions. This allows each prediction to condition on previously generated modalities. We train from scratch to systematically study how training‑data mixtures, predicted modalities, and WAM formulations affect performance. In our evaluations, WAMs benefit from predicting point tracks, DINO features, and depth maps, while additionally predicting future RGB does not provide a consistent benefit. We also find that ModAR's sequential generation outperforms existing WAM formulations, with the highest average success rate at all evaluated data scales. We also fine‑tune the video‑model‑initialized WAM Flex‑π on the same data; ModAR achieves a slightly higher observed average success rate (75% vs. 72%) while using approximately 20× fewer training FLOPs and no pretraining. On three real‑world bimanual tasks, ModAR outperforms baselines and improves with human videos.
Authors:Shuhan Xue, Jianyuan Zhong, Ziyuan Nan, Wenbin Li, Zhaochen Yu, Jinchao Ding, Qiang Gao, Pengyu Zhan, Yuntong Zhang, Tian Cheng, Zhenfei Yin, Yingcheng Wu, Ling Yang
Abstract:
We introduce and release ScienceBuddy, an interactive scientific research workspace that brings continually improving scientific agents into researchers' everyday workflows. ScienceBuddy supports researchers in carrying out scientific tasks while transforming their requests, feedback, and execution evidence into tasks and evaluation rubrics for continual learning. At its core is recursive‑in‑recursive self‑improvement, a paradigm that couples harness evolution with model reinforcement learning: the inner recursion improves the harness with the model fixed, while the outer recursion trains the model under the improved harness. Harness evolution shapes training experience, and model learning creates new opportunities for harness adaptation. We present case studies of researcher interaction, harness refinement, and model learning, with the benchmark cases spanning four scientific task families. By releasing ScienceBuddy as a research product, we make this paradigm available to the scientific community and take a step toward discovery intelligence: scientific AI that advances through sustained collaboration with researchers and evolves alongside the research it supports. Website: http://science‑buddy.io
Authors:Chuhao Chen, Peter Wonka, Chaoyang Wang, Chen Wang, Qiao Feng, Sergey Tulyakov, Lingjie Liu
Abstract:
Interactive control for video generation is moving from coarse prompts toward fine‑grained, physically meaningful manipulation of dynamic scenes. Yet existing controllable methods either require the full control schedule before generation starts, or use pixel‑space signals that dictate object positions rather than physical dynamics. To address these limitations, we propose PhysStream, an autoregressive model for physics‑grounded image‑to‑video synthesis that incorporates structured scene memory‑‑‑positional maps and object tracking maps derived online from previously generated frames‑‑‑and supports fine‑grained motion control via sparse velocity‑increment signals that encode physical quantities, letting the model learn the underlying dynamics. We train our model in two stages: a bidirectional model is first finetuned with motion‑control conditioning, then a causal autoregressive model is trained with additional structured scene memory, further improving physical consistency. PhysStream enables interactive, mid‑generation control over multi‑object tabletop rigid‑body scenes‑‑‑a capability not supported by prior methods‑‑‑reducing motion distribution distance (FVMD) by 33% and trajectory error by 12% over the strongest baselines on synthetic benchmarks, and is preferred by human evaluators in over 85% of in‑the‑wild comparisons. Please check our website for more details: https://czzzzh.github.io/PhysStream
Authors:Jahanvi Rajput, Dhruv Kudale, Saikiran Kasturi, Utkarsh Verma, Ganesh Ramakrishnan
Abstract:
Table understanding is a core task in document intelligence, encompassing two key subtasks: table reconstruction and table visual question answering (TabVQA). While recent approaches predominantly rely on vision‑ language models (VLMs) operating on table images, we propose a more scalable and effective alternative based on structured textual representations. These representations are easier to process, align more naturally with LLMs, and eliminate the need for language‑specific visual encoders, making them particularly suitable for multilingual documents. We present DELTA, which separates physical structure recognition, logical structure recognition, and OCR to extract both layout and content accurately. DELTA outputs tables in Optimised Table Structure Language (OTSL), a compact and unified format that encodes cell arrangements and textual content. On table structure recognition (TSR), DELTA achieves TEDS‑ Structure scores comparable with state‑of‑the‑art methods across FinTabNet, PubTabNet, and PubTables‑1M. We further establish its robustness on non‑English tables through our curated Hindi benchmark, TORQUE. Building on this, we introduce TARQA, an LLM fine‑tuned on OTSL sequences. Our approach yields gains of 9.3 p.p. on WTQ (TabQA) and 9.2 p.p. on FinTabNetQA (TabVQA), respectively. On TORQUE, our method ranks second among all VLMs and DELTA + LLM variants. We release our code, models, and benchmark at: https://github.com/Tihiitborg/Tables‑Decoded
Authors:Gjergj Plepi, Sven Behnke
Abstract:
Text‑conditioned latent diffusion models perform strongly in video generation and are promising backbones for robotic applications. However, existing approaches rely on pixel‑level or VAE‑based latent representations that lack explicit semantic structure, leaving the impact of the representation space largely unexplored. Slot‑based object‑centric representations offer a structured alternative by decomposing scenes into object‑level latents, or slots. While they have shown success in dynamics modeling and planning, they have not yet been explored for diffusion‑based generative modeling. We introduce SlotDiT, a text‑guided Diffusion Transformer (DiT) that operates in a slot‑based latent space. Given a reference image and a language instruction, SlotDiT decomposes the scene into object‑centric slots representing individual entities. Conditioned on the instruction and observed scene context, the model autoregressively denoises future slot trajectories to predict scene dynamics. To systematically investigate latent‑space design for diffusion transformers, we compare slot‑based representations against VAE‑based and semantics‑aligned alternatives within a unified DiT framework. Our experiments show that using slots as DiT latents yields competitive video generation quality while consistently improving task‑completion rates across four robotic datasets. Furthermore, their compact representation provides a computationally efficient alternative to VAE‑based and semantics‑aligned latent spaces. Overall, our results demonstrate that object‑centric structure is a powerful inductive bias for diffusion‑based generative modeling in robotic environments. The project page is available at https://slot‑dit.github.io/.
Authors:Sunkanghong Wang, Zhengzhong Ricky You, Roberto Baldacci, Baichuan Mo, Hu Qin, Lijun Wei, Zhou Xu
Abstract:
Efficient resource use in packing and assembly‑line applications requires decisions that jointly account for capacity and precedence constraints. The strongly NP‑hard bin packing problem with generalized precedence constraints (BPP‑GP) models such decisions by minimizing the number of ordered, capacitated bins required to pack weighted items, even when precedence requirements span multiple bins. Existing exact algorithms primarily focus on classical special cases, whereas general BPP‑GP has been addressed only via compact integer models and heuristics, with no efficient open‑source exact solver. We present PrecPack, a unified exact solver that extends branch‑bound‑and‑remember (BBR) to arbitrary nonnegative precedence weights and naturally specializes to the classical cases. Generalized states capture restrictions that remain active across future bins, which are addressed through branching, dominance, and conflict‑aware lower bounds. Root column generation uses fixed‑point arithmetic to compute numerically valid dual bounds for pruning or to prove optimality. To support reuse and verification, we provide common programming and command‑line interfaces, independent assignment checking, explicit termination statuses, and reproducible batch execution; the core procedures require no commercial software. In same‑machine, single‑threaded comparisons on classic assembly‑line benchmarks, more instances are proven optimal, and average computing times are substantially reduced relative to leading source‑available BBR implementations. Further comparisons with published benchmark results for bin packing with precedence constraints and BPP‑GP also show that more instances were proved optimal and that reported average gaps were smaller on most benchmark sets. PrecPack is released under the MIT License at https://github.com/Sunkanghong‑Wang/PrecPack.
Authors:Gysella Imrell, Emanuele Miotto, Mahya Mohammadi Kashani, Mauro Conti, Alberto Giaretta
Abstract:
In embodied cyber‑physical systems, active cyberattacks pose an immediate threat not just to data, but to physical integrity and human safety. While existing security approaches excel at detection, they lack the runtime mechanisms to determine whether a disruption is tolerable or if performance degradation remains within safe operational bounds. This gap leaves autonomous systems vulnerable to graceful failure paralysis, where they cannot distinguish between a safe, degraded state and a catastrophic hazard during an ongoing attack. This paper presents RobResilience, an implementation of a formal resilience framework for embodied cyber‑physical systems in a Webots simulation environment, using a PR2 robot and ROS2. The framework evaluates three predicates at runtime: tolerable disruption (δ), tolerable degradation (γ), and mitigation feasibility (μ), over a compromised device set derived from IDS confidence scores. When resilience is lost, the framework triggers available mitigation strategies. We evaluate our implementation through eight attack scenarios that systematically cover all possible combinations of the predicate state space, varying attack targets, degradation rates, and mitigation availability. Results confirm that the runtime behaviour of the implementation is consistent with the theoretical definitions.
Authors:Qizhou Wang, Bogdan Mamaev, Christopher Leckie
Abstract:
The use of LLMs to complete online surveys impacts the validity of survey‑based research, but detecting such usage remains underexplored. We introduce an initial benchmark dataset, namely ASURRE, for AI‑assisted survey participation to capture usage strategies ranging from full generation and revision to persona‑grounded agentic completion. Controlled by these strategies, LLM‑assisted survey responses are generated using multiple LLMs on three real‑world surveys in different disciplines, paired with genuine human responses. Our evaluation of existing machine‑generated text (MGT) detectors shows that naive AI usage is readily detectable, whereas persona‑grounded agents that mimic entire respondents push detector performance toward chance. We further show that agentic completion cannot fully replicate respondent‑level behaviour and leaves distinctive behavioural traces. While individual cues can be circumvented by targeted prompting, a simple few‑shot, training‑free aggregator over these cues improves mean AUROC by +0.14 over the best existing detector across agentic settings. Our project is available at https://github.com/mike‑qz‑wang/ASURRE.
Authors:Ziyang Ma, Zihong Zhang, Zuchao Li, Lefei Zhang, Baoyuan Qi, Siqi Li, Simin Yu
Abstract:
While draft‑model‑free speculative decoding offers a promising path to efficient LLM inference, it is frequently constrained by stale draft candidates and the high computational cost of the verification. To address these challenges, we propose ECHO, a hierarchical dual‑loop framework that exploits the functional asymmetry between LLM layers. Leveraging the high discriminative efficiency of early layers and the authoritative distribution of final layers, ECHO bifurcates inference into a high‑frequency inner loop and a low‑frequency outer loop. Within the inner loop, early‑layer bonus logits drive rapid, multi‑step draft‑tree exploration at a minimal cost. Simultaneously, the outer loop performs authoritative full‑model verification through a state‑reuse mechanism. Crucially, the outer loop also utilizes final‑layer bonus logits to correct existing paths and supplement the tree with high‑confidence candidates for subsequent cycles. Experimental results across diverse benchmarks demonstrate that ECHO significantly boosts mean accepted tokens and achieves a 2.4× to 2.9× speedup, outperforming existing state‑of‑the‑art baselines with negligible engineering overhead and no extra deployment parameters, albeit with a one‑shot fine‑tuning dependency for optimal acceleration. The code is available at https://github.com/whucs21Mzy/ECHO.
Authors:Arman Nik Khah
Abstract:
An agent that learns from rewards has to trust whatever reports those rewards. When the reports suddenly change, either the world changed or the reporter broke. From the reports alone these are indistinguishable, and reinforcement learning theory shows that no amount of further experience separates them. The prescribed escape is richer data about the reporter itself. We ask whether a frozen language model, handed exactly that data, uses it. We build a two‑option game in which a payout swap and a lying reporter produce byte‑identical histories. Then we add one verified record: an independent check of one round's real result, printed beside what the reporter said about that round. That single line settles the case. We ask three large models, from two families, to answer one question with one letter. Is the reporter honest or lying? They catch a lying reporter almost perfectly. At the 70B class that holds in every condition we tried; the 32B model slips in one wording. They clear an honest reporter far less often, and how often depends on things that should not matter. Averaged over rounds, letters, and wordings, a 72B model calls an honest reporter a liar 38% of the time when nothing has changed at all, and 58% of the time when the payouts moved. A 70B model from a second family calls an honest reporter a liar 26% and 48% of the time. The failure is not one of reading, because in the situation where nothing changed the same models score 0.96 to 1.00 with the answer printed in the prompt. Which surface feature drives it differs by family. For the Qwen models it is which round the record names, and for Llama it is which letter stands for "honest." Adding the record to a prompt that already states the answer makes Llama less likely to give that answer. We had registered a prediction for that 58% before the run: 35%. The failure is larger than we expected.
Authors:Dimitrios Halatsis, Noura Ezaz-Nikpay, Pranav Mamidanna, Dario Farina
Abstract:
Simulated electromyograms are used to understand what an electrode records, to test decomposition and estimation algorithms on signals with known ground truth, and to train learning‑based decoders. Most simulators fix the geometry to a cylinder or a slab, or stop at the lead field and leave the rest to the user. We present emgforge, an open pipeline that takes a labelled MRI segmentation of a limb to surface EMG in one command: a tetrahedral mesh with conductivity tensors aligned with each muscle's fibres; one reciprocal finite‑element solve per electrode, valid for every fibre of every muscle; fibre beds that are straight or follow the muscle's shape; a motor‑unit pool obeying the size principle; motor‑unit action potentials on any electrode layout; and a motoneuron‑pool and twitch layer that turns a drive or a movement into interference EMG and force. We describe the pipeline stage by stage, and at each stage we show, with an example, why the choice was made. The step that turns a lead field into a single‑fibre action potential ‑‑ direct line‑source synthesis ‑‑ is checked against a closed‑form solution (r = 1.0000, zero lag), and the whole chain against fifty checks with numeric criteria from the physiological literature. We then use the pipeline for four studies: what an electrode sees as a function of depth, fat, spacing and montage; whether fibre geometry changes the signal; how much crosstalk a grid over one muscle receives from its neighbours; and how interference EMG scales with drive. The code, the validation suite and three datasets with ground truth are released.
Authors:Jiawei Gu, Qilin Zhao, Tengkuo Guo, Zhiming Zhong, Shuangqing Zhang, Fan Lyu, Fang Zhao, Guo-Sen Xie, Caifeng Shan
Abstract:
Video anomaly detection (VAD) aims to localize anomalous events in untrimmed videos. Vision‑language models (VLMs) provide rich visual understanding for training‑free VAD, but existing approaches impose restrictive interfaces between visual understanding and anomaly scoring. Caption‑based pipelines compress visual evidence into text, potentially discarding subtle cues, while direct numerical generation forces the model to express its judgment through a small set of predefined scores. Such interfaces can obscure subtle differences in anomaly severity, causing visually distinct clips to receive similar representations or scores and thereby limiting the resolution of anomaly ranking. We propose Probe‑VAD, an ordinal binary‑probing framework that directly probes severity preferences from a frozen VLM. Given raw video clips, Probe‑VAD queries ten ordered severity thresholds and extracts constrained YES/NO continuation likelihoods. Their normalized preferences form a cumulative severity profile, from which tail evidence is aggregated into a continuous anomaly score, with isotonic projection enforcing ordinal consistency. Experiments on public VAD benchmarks demonstrate superior performance with low computational cost. Probe‑VAD provides a simple interface for translating frozen VLM visual understanding into continuous, rank‑sensitive anomaly scores without task‑specific training or caption‑based compression. Code is available at: https://github.com/yvestine/COVAS‑VAD.
Authors:Yinhao Li, Weixin Mao, Zihan Lan, Jikun Rong, Qirui Hu, Yiming Zhang, Weipeng Deng, Bowen Shen, Minzhao Zhu, Yiming Mao, Yan Yang, Chenguang Cui, Hongyuan Chen, Xu Huang, Zheyi Zhao, Pinxi Shen, Bozhen He, Zhen Fu, Yifan Wang, Zexin Zhang, Ang Gao, Haoyu Chen, Chengqi Shi, Hua Chen
Abstract:
Vision‑language‑action (VLA) models, world‑action models (WAMs), and offline reinforcement learning methods are rapidly expanding the design space of embodied policies, yet turning these algorithms into reliable robot systems remains constrained by fragmented data formats, training stacks, evaluation protocols, inference runtimes, and embodiment‑specific interfaces. We present \mathrmFluxVLA Engine, an open, configuration‑driven platform that turns heterogeneous embodied‑policy components into a reproducible data‑to‑deployment workflow. Rather than introducing another policy model, \mathrmFluxVLA standardizes interfaces for datasets, visual‑language and world models, action heads, reward‑ or advantage‑weighted learning, distributed training, simulation evaluation, optimized inference, and robot operators. The engine further integrates compositional dual‑arm simulation, scalable automatic data generation, and model‑decoupled human‑in‑the‑loop rollout, takeover, correction collection, and reward annotation. For responsive physical execution, it combines Real‑Time Chunking (RTC) with accelerated inference backends, lightweight remote GPU serving, and configurable trajectory post‑processing. Together, these capabilities connect offline learning, simulation validation, online correction, and real‑robot execution through shared and auditable contracts. \mathrmFluxVLA therefore targets the engineering bottlenecks separating promising embodied‑learning algorithms from reproducible evaluation and dependable deployment. Code is available at https://github.com/FluxVLA/FluxVLA
Authors:Yang Liu, Yifan He, Wenhao Zhao, Xiangyu Mo, Yang Xu, Hao Wei, Mingze Ma, Huan Li, Yifan Wu, Fei Gao, Zipeng Dai, Xin Zhou
Abstract:
Autonomous nano‑UAV navigation requires accurate ego‑motion estimation under stringent size, weight, power, and computing (SWaP‑C) constraints, where visual sensors and LiDARs exceed payload limits, optical flow degrades in low‑texture scenes, and inertial‑only state estimation is susceptible to accumulated drift. While multi‑zone time‑of‑flight (ToF) arrays provide a lightweight metric complement, 6‑DoF estimation from merely 384 ranges per frame is challenged by invalid returns, anisotropic observability, and temporal computational scaling. We propose TIO‑FORMER, a camera‑free, optical‑flow‑free, and mapless range‑inertial odometry framework driven by an IMU and an ultra‑lightweight (15 g) payload of six orthogonal 8 x 8 ToF arrays. Our frontend pairs consecutive range grids with a bilateral gated difference, while IMU‑guided cross‑attention dynamically routes directional features conditioned on platform kinematics. A Streaming Causal Transformer couples an uncompressed Local KV cache with compressed Chunk‑FIFO memory, maintaining bounded inference cost and memory footprint independent of flight duration. In real‑flight evaluations, TIO‑FORMER reduces open‑loop position error by 54.4% compared to nano‑UAV optical flow and by 66.4%‑89.1% over learned inertial baselines. We also evaluate performance across multiple environments and robustness under severe sensing degradation. Deployed on an edge RISC‑V companion computer, TIO‑FORMER achieves a P95 latency of 10.466 ms and peak resident memory of 6.324 MiB (less than 5 percent system RAM), demonstrating that sparse range sensing provides practical geometric anchoring for resource‑constrained micro‑aerial robots. Code is available at https://github.com/Ly041021/TIO‑Former.
Authors:Ryosei Hara, Wataru Ikeda, Masashi Hatano, Mariko Isogawa
Abstract:
3D hand mesh reconstruction is a challenging yet essential task for downstream applications, including human‑robot interaction and AR/VR. Although conventional cameras have been widely adopted for this task, methods that rely on them struggle in low‑light environments and under severe motion blur. To address these limitations, event‑based cameras have recently attracted attention for their high dynamic range and high temporal resolution. However, applying event cameras to egocentric hand reconstruction remains challenging because camera wearer's motion produces dense background events that obscure hand‑specific signals. Although the first egocentric event‑based approach mitigates this issue using hand segmentation, its binary hand mask does not distinguish between left and right hands. As a result, the model lacks instance‑level hand information and predicts both hands even when only one or neither hand is present. This limitation leads to incorrect inter‑hand relationships and degraded reconstruction accuracy. In this paper, we propose EventEgoHands++, a framework for event‑based 3D hand mesh reconstruction from an egocentric viewpoint. The proposed method incorporates a Hand Detector that estimates instance‑level bounding boxes and masks for both the left and right hands. Moreover, we introduce Adaptive Attention, which dynamically gates the attention based on these detection results to accurately learn the spatial relationship and mutual interactions between the hands. To train and evaluate our framework, we extend the synthetic N‑HOT3D dataset and newly construct EEH‑R, the largest real‑world event‑based egocentric hand dataset to date, comprising approximately 1M annotated frames captured in environments including low‑light conditions. Extensive experiments on both synthetic and real datasets demonstrate that our method consistently outperforms the baselines.
Authors:Anna Oliveras, Roger Marí, Rafael Redondo, Oriol Guardià, Cynthia Ifeyinwa Ugwu, Ana Tost, Bhalaji Nagarajan, Carolina Migliorelli, Vicent Ribas, Petia Radeva
Abstract:
Forecasting anatomical changes such as tumor growth and neurodegeneration is a challenging generative vision task. Morphological evolution is subtle relative to static anatomy, highly patient‑specific, and inherently stochastic. Existing methods struggle with several issues: deterministic networks ignore biological stochasticity, while standard diffusion models require computationally prohibitive multi‑pass sampling to quantify uncertainty. We propose MUMINS (Metadata‑conditioned Uncertainty‑aware Medical Image Next‑state Synthesis), an efficient diffusion framework that jointly diffuses a baseline scan and its follow‑up residual, summed to synthesize the follow‑up scan, while concurrently predicting a spatial uncertainty map, in a single reverse diffusion process. Conditioned on the time interval and relevant metadata, it preserves fine‑grained anatomy by dynamically re‑injecting the baseline as a soft anchor at every denoising step, and a negative‑log‑likelihood head learns the uncertainty map to explicitly flag error‑prone regions. Designed without organ‑specific heuristics, the same architecture is reused across anatomies via separate, dataset‑specific retraining. Extensive evaluations demonstrate that dataset‑specific retraining of MUMINS matches or outperforms dedicated, domain‑specific state‑of‑the‑art methods on lung CT (PNG) and brain MRI (OASIS‑3). Project page: https://github.com/aolivtous/MUMINS.
Authors:Hojin Lee, Youngim Nam, Sanghun Lee, Cheolhyeon Kwon
Abstract:
Autonomous racing confronts significant challenges in safely overtaking Opponent Vehicles (OVs) that exhibit uncertain trajectories, stemming from unknown driving policies. To address these challenges, this study proposes heterogeneous kernel metrics for Deep Kernel Learning (DKL), designed to robustly capture the diverse driving policies of OVs, and carry out precise trajectory predictions along with the associated uncertainties. A key virtue of the proposed kernel metrics lies in their ability to align similar driving policies and disjoin dissimilar ones in an unsupervised manner, given the observed interactions between the Ego Vehicle (EV) and OVs. The efficacy of the proposed method is substantiated through experimental studies on a 1/10th scale racecar platform, demonstrating improved prediction accuracy and thereby safely overtaking against OVs. Furthermore, our method is computationally efficient for onboard computing units, affirming its viability in fast‑paced racing environments. The video and source code can be found at https://github.com/HMCL‑UNIST/OpponentPredictionWithKMDKL.git.
Authors:Mohammad Ammar Mughees, Giovanni Montefoschi, Zhongxin Chen, Maria Antonia Brovelli
Abstract:
Geospatial foundation models provide reusable representations of satellite imagery that support downstream mapping with limited task‑specific modelling. We evaluate whether annual AlphaEarth embeddings support binary cultivated‑versus‑non‑cultivated mapping in Maine, USA, using 192 spatially separated patches and labels derived from the USDA Cropland Data Layer (CDL). Without fine‑tuning the foundation model, a lightweight classifier reaches 93.7% overall accuracy and 90.8% balanced accuracy on held‑out patches. Logistic regression is within 0.3 percentage points of a gradient‑boosted ensemble, while a nearest‑class‑centroid rule, which uses class centroids but fits no parameters, reaches 90.2%. A balanced sample of 60,000 labelled pixels is within 1.3 percentage points of the full pool of 8.6 million pixels; because pixels are spatially autocorrelated, this result concerns pixel‑sample efficiency rather than 60,000 independent annotation sites. In a same‑region transfer experiment, classifiers trained in one year remain accurate across 2018 to 2023. Against a blind, two‑interpreter consensus at 385 randomly sampled points in one contiguous 2023 block, the AlphaEarth‑plus‑random‑forest map agrees at 95.3% (κ=0.82), compared with 91.7% for the CDL (κ=0.72; exact two‑sided McNemar p=0.0161). This local result is consistent with partial smoothing of CDL label noise, but it does not establish statewide correction of the reference product. On the same points, the difference from a fine‑tuned TerraMind segmentation model is not statistically significant (95.3% versus 93.5%; p=0.14), and the experiment is not a controlled comparison of computational cost. These results support frozen geospatial embeddings as a low‑compute candidate for regional cropland mapping, subject to the limits of a single‑state study, a 30 m‑derived training reference, and a one‑block human validation.
Authors:Ying Guo, Haidong Chen, Linrui Xu, Xiaohao Liu, Chuancheng Shi, Canran Xiao, Dan Zhang, Fei Shen, Li Shen, Tat-Seng Chua
Abstract:
Multimodal representation learning seeks shared representations for cross‑modal retrieval and knowledge transfer. Hub‑based binding reduces pairwise supervision costs, but separate hub connections cannot guarantee reliable alignment between modalities without direct joint training. We introduce Hub‑Spectral Activation (HSA), a closed‑form method for recovering and activating the hub‑readable component of latent multimodal knowledge in frozen representations. We formalize this knowledge as source‑induced cross‑modal dependence and characterize the component determined by the second‑order statistics of two trained hub edges. Under a second‑order source model, we establish conditions for exact recovery of the complete source‑induced relation and bound the dimension of its hub‑readable component by the hub covariance rank. HSA composes and standardizes hub‑edge statistics, extracts paired spectral directions, and combines reliability‑weighted matching evidence with source‑gated candidate resolution for bidirectional retrieval and prototype classification. HSA requires no target‑pair supervision, gradient optimization, or backbone updates. Across 19 retrieval and 11 prototype‑classification relations on ImageBind and LanguageBind, HSA raises mean bidirectional Recall@10 from 18.27% to 31.15% and mean macro Top‑1 accuracy from 29.01% to 52.43%, respectively. Controlled analyses further identify valid hub‑edge correspondence and leading spectral directions as key sources of retrieval gains, demonstrating the utility of latent multimodal knowledge beyond native similarity scores. Code and models are publicly available at https://github.com/Luo1Yan/HSA.
Authors:Fengrui Liu, Ningxin Shen, Yi Li, Yiwei Fu, Feng Liu, Jiangmeng Li
Abstract:
Few‑shot audio classifiers may rely on foreground‑background co‑occurrences and fail when those correlations shift. On SpurAudio, the resulting representation shift is concentrated and class dependent: for ResNet12, the top 10 percent of channels explain 82.80 percent of the null‑corrected shift contribution. We propose SAMPLESELECT, which predicts a fixed‑budget feature mask independently for each input while keeping the encoder and source classifier frozen. Training uses differentiable Gumbel Top‑k selection with foreground classification and cross‑background contrastive losses; inference uses deterministic Top‑k masks and support‑only linear adaptation. Across ResNet12 and Conv64 in 5‑way 1‑shot and 5‑shot evaluation, SAMPLESELECT gives the best OOD accuracy among the compared methods and improves the matched full‑representation control by 4.90‑8.38 percentage points. Ablations and representation analyses further support the learned selection mechanism. Code is available at https://github.com/Cross‑Innovation‑Lab/SAMPLESELECT/
Authors:Li Cao, Jingyuan Ma
Abstract:
We present Budgeted Express‑Mesh, a topology‑routing co‑design that adds a small number of traffic‑aware express links under a fixed wire budget. An ASPL‑based greedy placement is refined by simulation‑guided annealing, while packets use committed top‑K routes selected from delayed express‑link congestion and reservation signals. Across four synthetic workloads, optimized placements consistently improve high‑load throughput over Mesh and random placement, and annealing further improves Greedy. The gains persist under delayed quantized congestion information, longer express‑link latency, multi‑flit packets, and a 16‑by‑16 heterogeneous workload.
Authors:Md. Samiul Alim, Mahir Shahriar Tamim, Tanvir Ahmed Khan, Sharjil Khan, Rafia Ferdous Duti, Shahriyar Zaman Ridoy, Mohammad Ali Moni
Abstract:
Crisis sentiment analysis is especially challenging for low‑resource languages such as Bangla, where language, context, and public reaction shift rapidly. We introduce UNRESTSENT200K, a Bangla crisis sentiment dataset with approximately 200K Facebook and YouTube comments from the July‑August 2024 Bangladesh uprising. The dataset covers five event‑aligned phases, from early escalation and internet blackout to regime transition and a later flood crisis. Each comment is linked to its parent post, enabling evaluation with and without discourse context. All comments are annotated through a fully human process involving 14 native Bangla‑speaking annotators and senior validation, achieving substantial agreement (kappa = 0.73, alpha = 0.71) and 94.2% blind‑audit agreement. We benchmark fine‑tuned encoders, prompted LLMs, and LoRA‑tuned LLMs. Results show that parent‑post context consistently improves performance, while temporal shift across phases causes large performance drops. Strong LLMs perform well, but still struggle with sarcasm, implicit political references, and phase‑dependent meaning. UNRESTSENT200K provides a benchmark for studying context‑aware and temporally robust sentiment analysis in low‑resource crisis discourse. UNRESTSENT200K is available at https://sami0055.github.io/UNRESTSENT200K/
Authors:Kevin Qinghong Lin, Siyuan Hu, Pan Lu, Yu Chen, Yanzhe Chen, Owen Queen, Yupeng Chen, Jialin Yu, Junchi Yu, Zifeng Ding, Yuanfeng Ji, Sheng Liu, Jindong Gu, Linjie Li, Mike Zheng Shou, Philip Torr, James Zou
Abstract:
Autoresearch agents are reshaping the research ecosystem, but they can also let flawed claims enter the literature at scale. Human advisors catch such issues in drafts through careful, traceable feedback, yet advisor‑style assessment requires extensive manual effort and does not scale. To shift automated paper assessment from a judge to a diagnostician, we introduce PaperDoctor, an agent framework for pre‑submission feedback with three key innovations. First, a holistic hierarchical framework evaluates writing, layout, references, code, theory, prior work, and experiments through three layers: L1 surface screening, L2 typed verifiers that route each claim to the appropriate evidence, and L3 reproducers that rerun experiments by priority. Second, each finding contains an observation, a pointer to specific evidence such as a sentence, equation, or code line, and a revision suggestion, making critiques auditable and actionable. Third, PaperDoctor selectively rebuilds and reruns experiments based on claim importance and compute budget, surfacing reproducibility gaps and quantitative limitations that are invisible from the manuscript alone. We evaluate PaperDoctor on 30 in‑progress papers, yielding 70.6% agreement and all positive holistic scores, and on 40 manuscripts across machine learning, natural science, and social science, covering human‑ and AI‑authored papers with code. Overall, PaperDoctor produces more auditable feedback than human and other agentic reviewers, pairs critiques with concrete suggestions by design, and complements dimensions often overlooked by human reviewers. We also develop an interactive interface that lets authors browse findings grounded in their paper. PaperDoctor reframes automated paper assessment as diagnosis rather than verdict, taking a concrete step toward AI advisors for more rigorous AI‑assisted scientific discovery.
Authors:Akira Ise, Kotaro Kumagai, Yuta Yamaguchi, Hisanori Ozaki, Yukio Uematsu, Ikuya Yamada
Abstract:
We describe tus‑nlp's Lit3R (Retrieve‑Relate‑Read) system for LitTraceQA, a shared task for literature‑grounded question answering that requires systems to retrieve relevant papers, identify supporting evidence, and generate answers. Lit3R combines off‑the‑shelf retrieval, reranking, and large language model (LLM) components without task‑specific training. The retriever iteratively combines BM25‑based sparse and dense retrieval, cross‑encoder reranking, and LLM‑based verification, and complements retrieval based on the question with paper‑to‑paper expansion. The reader first identifies supporting evidence within individual papers and then synthesizes evidence across papers to produce the final answer and evidence trace. On the official test set, our system ranked 4th on the leaderboard. Our code is available at https://github.com/tus‑ist‑nlp/littraceqa.
Authors:Miłosz Adamczyk, Tymoteusz Zapala, Piotr Borycki, Przemysław Spurek
Abstract:
With the increasing deployment of deep neural networks in critical systems, such as medical diagnostics and autonomous vehicles, ensuring their interpretability is crucial to building trust in decision‑making systems. In the field of explainable artificial intelligence, prototype‑based reasoning has gained particular popularity, as it mimics human cognitive processes by explaining model decisions based on visual similarity under the looks like this paradigm. While this paradigm has been thoroughly investigated in the context of global image classification, the interpretability of dense predictions, particularly semantic segmentation, remains largely unexplored despite its immense importance in tasks requiring precise object localization. Existing prototype‑based interpretable segmentation models rely on ante‑hoc architectures, which entails significant limitations because they require costly training from scratch and modifications to the network structure, ultimately leading to a noticeable drop in predictive performance compared to standard black‑box models. To address this issue, we propose PiPS (Post‑hoc interpretable Prototypical Segmentation), the first fully post‑hoc solution for generating prototypical explanations for semantic segmentation models. Our method enables the extraction of intuitive, spatially localized explanations from any pre‑trained network without modification or fine‑tuning, thereby preserving 100% of the model's original predictive performance. This approach opens a new avenue for the safe and cost‑effective deployment of transparent systems in advanced computer vision tasks. Codebase available at https://github.com/gmum/PIPS.
Authors:Darius Peteleaza, Razvan-Gabriel Dumitru, Bogdan Neamtu, Arpad Gellert, Mariana Sandu, Claudiu Matei
Abstract:
Pediatric brain tumors are a leading cause of cancer‑related mortality in children, and their small, rare, and often low‑contrast subregions make accurate manual delineation challenging. Reliable automated segmentation is therefore needed to support diagnosis, treatment planning, and response assessment. Accordingly, we introduce NeuroTS‑Net, a three‑dimensional encoder‑decoder convolutional neural network architecture for multi‑class semantic segmentation that incorporates a dual‑scale raw‑detail stream, adaptive low‑resolution context selection, and detail‑preserving multipath downsampling. These components preserve fine intensity and boundary information while efficiently modeling broader tumor context. NeuroTS‑Net was trained on the BraTS 2026 pediatric dataset without external data or pretrained weights and evaluated against nnU‑Net and MedNeXt under the same experimental protocol. NeuroTS‑Net outperformed the baseline methods, achieving whole‑tumor and tumor‑core Dice scores of 0.938 and 0.937 on the internal validation set and 0.927 and 0.926 on the official challenge validation set. The code is open‑sourced at: https://github.com/maenstru56/NeuroTS.
Authors:Zeyi Shao, Haowen Hua, Jiaxin Zhang, John See, Zeyd Boukhers, Cong Yang
Abstract:
Prompt learning adapts vision‑language models, such as CLIP, by adjusting a small set of context tokens. However, under few‑shot supervision, even moderate label noise can disrupt prompt optimization. To address this issue, we propose TecoPrompt, a closed‑loop robust prompt‑learning framework that revisits optimal transport (OT) pseudo‑labeling from a temporal perspective. TecoPrompt employs an entropic OT plan in the CLIP semantic space to obtain globally consistent label candidates. It verifies the reliability of these candidates by examining trajectory stability: a noisy label is only rewritten if the OT candidate remains unchanged within a K‑epoch temporal stability window and passes a confidence gate based on Exponential Moving Average (EMA). This approach helps reduce confirmation bias. The rewritten labels are then integrated back into prompt training using a tri‑group objective that includes three loss functions aligned with clean, mid, and noisy subsets. Experiments on seven datasets with synthetic symmetric and asymmetric noise, as well as Food101N, demonstrate significant performance improvements. For example, on the OxfordPets dataset, with 50% asymmetric noise, TecoPrompt achieves an accuracy of 0.843, up from 0.775.
Authors:Jun Wan, Jiwei Hu, Shengkai Hu, Qilu Zhu
Abstract:
Facial Landmark Detection(FLD) is a crucial task in various applications and has achieved significant advancements in recent years. However, current FLD methods still struggle under challenging conditions, where facial structural variations, information loss, and noise interference severely compromise the integrity and accuracy of learned facial features. To address these issues, we propose Frequency‑Adaptive Heatmap‑Conditional Diffusion Network (FAHCD‑Net), which integrates a Frequency‑Adaptive Heatmap‑Conditional Diffusion (FAHCD) model with a Smoothness Regularization (SR) loss in a cascaded framework. Specifically, the FAHCD model incorporates a Hierarchical Frequency Adaptation (HFA) module designed to suppress redundant high‑frequency noise through multi‑layer frequency decomposition and adaptive reconstruction, thereby preserving essential facial structures. Additionally, the SR loss is proposed to further mitigate the interference of high‑frequency noise and enhance the smoothness of the generated landmark heatmaps. By cascading the FAHCD model with the SR loss, FAHCD‑Net effectively leverages both statistical and frequency‑based distribution characteristics of the data to progressively generate more accurate landmark heatmaps from noisy inputs. Extensive experiments on popular benchmarks demonstrate the effectiveness and robustness of the proposed method, achieving state‑of‑the‑art performance in FLD tasks under challenging scenarios. The source code is available at https://github.com/HJWKryptonite/FAHCD‑Net.
Authors:Kenta Kasai
Abstract:
We study binary quasi‑cyclic LDPC codes whose parity‑check matrices are full arrays of single circulant permutation matrices (CPMs), referred to here as CPM‑LDPC codes. Their minimum distance is at most (J+1)!, where J is the column weight. For every fixed pair of column and row weights 2\le J<L, we show that this bound is attained for all sufficiently large integer lift sizes. First, we give one integer exponent matrix independent of the lift size P. Second, we show that independent uniform exponent choices attain the bound with probability 1‑O_J,L(P^‑1). Both proofs use cycle conditions required by low‑weight codewords and a lower bound on the number of terms in vectors satisfying polynomial check equations. Neither construction requires P to be prime. We also give small‑lift arrays attaining the bound 24 for J=3, L=4,\ldots,8, and arrays with distance at least 28 for J=4, L=5,\ldots,8, together with computational distance verification.
Authors:Meisen Wang, Zhiqiang Tian, Wei Bao, Chengjie Wang, Shaoyi Du, Siqi Li
Abstract:
Event cameras have shown great potential for robust visual perception, yet scaling event representation learning remains challenging due to the scarcity of large‑scale annotated event data. Pretrained image models provide scalable semantic supervision, but existing image‑to‑event methods rely on rigid pixel‑wise or token‑wise alignment that overlooks modality discrepancies in texture, density, and appearance, potentially causing semantic collapse and limiting transferability. To address this issue, we propose Hyper‑RED, a simple, painless, and scalable image‑to‑event pretraining framework that transfers high‑order semantic structures from images to events. Hyper‑RED uses hypergraphs to model and align high‑order semantic associations among multiple image and event tokens, enabling cross‑modal knowledge transfer while accommodating modality‑specific differences rather than enforcing rigid one‑to‑one correspondence. Specifically, given a paired event‑‑image sample, Hyper‑RED leverages DINOv3 to extract spatial token representations and constructs image, event, and cross‑modal semantic hypergraphs, where each hyperedge connects multiple semantically correlated tokens. We further introduce a hypergraph relational distillation loss that imposes complementary intra‑ and cross‑modal constraints, enabling the event encoder to inherit image‑derived semantic organization while preserving local relational consistency and event‑specific characteristics. Experiments on three tasks across five event datasets demonstrate consistent scaling from ViT‑S to ViT‑L and state‑of‑the‑art performance (Fig.1). The code is available at: https://github.com/meisenwang/Hyper‑‑RED.
Authors:Ting-Wei Chang, Po-Chun Chen, Hen-Hsen Huang, Hsin-Hsi Chen
Abstract:
Large Language Models (LLMs) have achieved remarkable progress across diverse domains, but continual adaptation to evolving tasks and environments remains a key challenge. Existing memory‑augmented approaches retrieve individual past examples as direct references, but do not explicitly synthesize actionable strategies from them, causing the same types of errors to recur. We propose Dynamic Retrieval‑based Policy Generation (DRPG), a framework that integrates memory‑based retrieval with a dynamic policy generator, leveraging historical data and environment feedback to produce task‑specific policies for continual LLM improvement. We evaluate DRPG across six benchmarks spanning text‑to‑SQL, question answering, medical diagnosis, and Python programming, using seven LLMs from both proprietary and open‑weight families. DRPG outperforms strong baselines across most datasets and models. Further analysis demonstrates that DRPG's policy generation is robust to retrieval strategy, operates effectively without prior policy continuity, and can leverage smaller or cross‑family models as cost‑efficient policy generators. We also find that the benefit of policy‑level guidance depends on task characteristics, offering practical insights into when and under what conditions this mechanism is most effective.
Authors:Dingyan Shang, Zhenyu Xu, Youting Wang, Bonan Shen, Bowen Liu
Abstract:
Noise2Noise (N2N) trains denoisers on pairs of independently corrupted observations, eliminating clean references. We stress‑test two natural conjectures about why the L1 loss outperforms L2 here. First, the hypothesis that the L1 loss confers robustness via parameter sparsity confuses the loss with Lasso regularization: an explicit Lasso penalty produces the predicted sparsity yet fails to reproduce L1's cross‑noise behavior, while L1‑ and L2‑trained weight distributions are indistinguishable. Second, the population optima of the two losses coincide exactly for symmetric signal posteriors and nearly so for concentrated ones. Measured differences are therefore dominated by optimization dynamics (bounded‑influence gradients), which we probe with gradient statistics and contaminated‑target training. On Kodak24 with five synthetic noise families, the L1 loss holds a statistically significant edge over L2, below 1 dB PSNR, holding across three seeds on 13 of the 14 noise columns. On real camera noise the loss is not the decisive variable in distribution: on official SIDD validation blocks, synthetic‑Gaussian‑trained N2N models gain only 0.8 to 3.7 dB over the noisy input regardless of loss, while retraining on SIDD's own noisy pairs, never reading ground truth, gains 9.4 to 11.0 dB, far ahead of BM3D. All metrics are on raw network outputs, and the study makes no leaderboard claim. The training pair distribution, not the loss, carries the inductive bias. That design rule applies wherever clean references are unobtainable, from microscopy to industrial inspection sensors.
Authors:Simone Teglia, Irene Amerini
Abstract:
The unchecked proliferation of manipulated images on social media platforms has increased the spread of misinformation, posing a severe threat to public trust and information integrity. Modern deepfake detectors typically rely on Vision Transformers (ViTs) to capture the low‑level inconsistencies that characterize fully synthetic or locally tampered images. However, the global understanding of such foundation models is not enough to discriminate alone between real and fake multimedia content, especially in challenging scenarios where images are compressed or transmitted through social media. In this paper we pioneer the application of Joint‑Embedding Predictive Architecture (JEPA) models to deepfake detection, taking advantage of the generalized representation of visual reality that such World Models have exhibited. We hypothesize, and empirically demonstrate, that the intrinsic world understanding of JEPA models can be used as a strong prior for a deepfake detector. To fully exploit JEPA capabilities, we propose MoE‑JEPA, a dual‑stream architecture for deepfake detection. By enhancing a V‑JEPA 2 backbone with a Residual Mixture‑of‑Experts (MoE) mechanism, along with a noise stream branch, our model dynamically internalizes forensic knowledge. Furthermore, a Gated Attention Multiple Instance Learning (MIL) module is employed to ensure precise spatial semantic understanding. Evaluated on the SID‑Set benchmark, comprising 300K AI‑generated, tampered and authentic images, MoE‑JEPA establishes a new state‑of‑the‑art with an accuracy of 95.54%, successfully outperforming vastly larger models.
Authors:Zhuoang Cai
Abstract:
As Large Language Models (LLMs) increasingly serve as primary knowledge retrieval interfaces, their robustness against persuasion attacks‑‑‑attempts to inject misinformation or enforce counterfactuals‑‑‑has become a critical safety concern. Existing red‑teaming frameworks typically evaluate models in multi‑turn dialogues where the target model retains full conversation history. We identify a critical flaw in this setting termed ``Refusal Inertia'': a model's initial refusal often propagates through subsequent turns largely to maintain contextual consistency, thereby masking its true vulnerability to sophisticated, isolated persuasion attempts. To rigorously evaluate the ``cold‑start'' defense capabilities of SOTA models, we introduce the SAST‑IR (Stateful Attacker, Stateless Target ‑ Iterative Refinement) framework. By enforcing a memory wipe on the target while retaining the attacker's history, we simulate a worst‑case adversarial setting using multi‑turn (stateless) iterations. Leveraging CP‑Agent (Cognitive Persuasion Agent), an enhanced diagnosis‑guided agent, our experiments on the custom \textscCounterFact‑Strict dataset (N=50) yield alarming results: simple, diverse attack strategies achieved a staggering 96% success rate, exposing severe brittleness in memory‑less defense. Furthermore, we reveal a ``Complexity Paradox'': while complex, iteratively refined attacks are effective, they often trigger defensive compliance, whereas simple strategies achieve a higher rate of genuine persuasion (84.7%). Our code and dataset are available at GitHub, https://github.com/cza1006/llm‑persuasion‑defense.
Authors:Abhilaksh Singh Reen, Kushal Borkar, Ritvik Mahapatra
Abstract:
Annotating large radiology datasets is bottlenecked by the manual effort of delineating structures slice‑by‑slice in 3D volumes. Interactive methods reduce this effort but stay interaction‑inefficient: slice‑wise methods (including many foundation models) ignore inter‑slice continuity, while 3D and video‑based methods propagate a prompt with a \emphfixed propagator that never adapts to the target volume, so it drifts on low‑contrast or pathological structures and must be re‑prompted. We present IMVS, a human‑in‑the‑loop annotation framework that composes three components into a closed loop rather than a new segmentation primitive: a lightweight 2D Slice Mask Adapter (SMA) fine‑tuned online from user scribbles, a frozen Volume Mask Tracker (VMT) that propagates corrected masks across adjacent slices, and a soft teacher‑‑student alignment that limits forgetting. The SMA is backbone‑agnostic (UNet++, DeepLabV3, TransUNet). Across 8 public CT/MRI datasets, IMVS matches strong interactive baselines in quality while sharply cutting annotation effort: 14.4× faster than a proficient copy‑based manual workflow (22.3× over naive manual), 4.6× over slice‑wise and 1.9× over 3D interactive methods. MedSAM2 and ScribblePrompt stay competitive or stronger on well‑delineated organs; IMVS's advantage is largest on challenging targets and on interaction efficiency. Source code and Demo Video: https://github.com/AbhilakshSinghReen/imvs.
Authors:Zoha Usama, Azadeh Alavi
Abstract:
Brain tumor segmentation remains difficult because enhancing tumor (ET) has low contrast and overlaps surrounding tissue, while scanner and site variation causes domain shift. We propose DE‑GAN, a contrast‑enhancing conditional GAN that combines input‑adaptive dynamic convolutions, style‑aware feature mixing, and coordinate encoding to synthesize slice‑adaptive FLAIR images. A label‑guided, class‑conditional target separates tumor‑core (TC) and ET intensities while preserving anatomy. The generated FLAIR is concatenated with the original MR modalities and used to train a 3D U‑Net. Across BraTS 2015, 2018, and 2019, DE‑GAN improves segmentation over the baseline and static EnhGAN replacement on most reported TC/ET metrics, with the largest gains from retaining both original and enhanced FLAIR. Code and pretrained models are available at https://github.com/zkhansuri‑ui/DE‑GAN.
Authors:Qixiu Li, Chenlong Bao, Xiang Zhu, Xiaoyong Li, Ruixin Cao, Shukai Chen, Zhenxiong Zhou
Abstract:
Text summarization requires models to condense content while preserving key qualities such as consistency and coherence. Large language models (LLMs) have shown strong performance on this task and can be further improved through reinforcement learning (RL). However, most existing methods apply reward signals directly to undifferentiated token sequences, overlooking the varying importance of individual tokens to word and sentence level quality in summarization. In this paper, we propose Token Importance‑Aware Policy Optimization (TIAO), a novel reinforcement learning strategy that explicitly leverages token‑importance awareness. Specifically, TIAO identifies core tokens based on token dependency and reweights a trajectory's advantage according to its overall dependencies. Experiments on the real world dataset show that our TIAO achieves highly competitive results, and that a 7B foundation model enhanced by TIAO performs comparably to GPT‑4 and GPT‑5‑nano. Code is available at https://github.com/TechCloud‑x/TIAO
Authors:Deepesh Sonar
Abstract:
Conversational memory changes during use, so endpoint question answering alone cannot establish how a persistent state accumulates, ages, or incorporates revisions. We introduce LSREP, a Longitudinal State‑Replay Evaluation Protocol combining ordered replay, explicit lifecycle schedules, repeated probes, evolving reference answers, and mechanism‑fidelity checks. Its architectural case study is ICE v2, a local‑first memory middleware with typed stores, retrieval fusion, and dynamic context budgets. The private, single‑user instantiation contains 1,985 turns, 219 distinct probes, and 1,211 probe‑checkpoint observations across 52 checkpoints. On three ordinary‑density datasets, ICE v2 has a near‑zero mean quality difference from vector‑RAG while selecting 32% fewer fragments but using 6.6% more estimated prompt tokens. A fourth, dense dataset exposes catastrophic failures of the unbudgeted baseline. The fidelity audit limits attribution: procedural retrieval is defective, several mechanisms are unexercised, and graph utility is not established. In a complementary matched public diagnostic, ICE v2 loses decisively to pure vector‑RAG on LongMemEval: 50.8% versus 72.8% in the evidence‑only oracle and 43.0% versus 69.5% in full‑S. Paired differences are ‑22.0 points (95% CI [‑26.6, ‑17.4]) and ‑26.5 ([‑31.3, ‑21.8]). Conservative abstention accompanies severe multi‑session and temporal failures. ICE uses less context in this diagnostic, establishing a quality‑cost trade‑off rather than superior efficiency. Together, replay, fidelity auditing, and public endpoint testing expose distinct failure modes that neither architectural descriptions nor aggregate scores identify alone.
Authors:Haoyu Guo, Yuan Feng, Junlin Lv, Mingjun Xiao, S Kevin Zhou, Xike Xie
Abstract:
Scaling Multimodal Large Language Models (MLLMs) to long‑form video understanding is bottlenecked by the explosion of visual tokens, which saturates context windows and incurs prohibitive costs. Current solutions predominantly rely on auxiliary models for token reduction but face a fundamental dilemma: lightweight encoder‑driven approaches often overlook critical semantic information, whereas heavyweight MLLM‑driven reduction negates the efficiency gains. In this work, we identify a more fundamental inefficiency underlying this dilemma: while fine‑grained visual details are essential for detailed understanding, they are largely redundant for the preliminary task of selecting semantically relevant regions. Motivated by this, we introduce VideoMM, which marks a paradigm shift from model‑centric downsizing to adaptive perceptual granularity. Specifically, our framework decouples selection from reasoning by executing semantic filtering on a cost‑effective Macro Proxy (derived from downscaled frames), and projecting the selected regions onto high‑fidelity Micro Tokens for detailed understanding only when necessary. Extensive evaluations show that VideoMM significantly outperforms existing solutions. It achieves a 6.13× speedup and a 7.4% accuracy gain over full‑context baselines on LongVideoBench, and further accelerates inference by 2.73× over current leading methods, establishing a highly scalable paradigm for long‑video understanding. Our code is available at: https://github.com/adfh917k/VideoMM.
Authors:Nanjie Yao, Hao Wang, Chong Cheng, Zhikang Chen, Wenzhe Li, Jiafei Lyu, Li Shen, Peilin Zhao, Zongqing Lu, Gao Huang, Steven Hoi, Dacheng Tao, Deheng Ye
Abstract:
World models connect perception and decision‑making in embodied intelligence by maintaining hidden state, anticipating consequences, comparing interventions, and adapting when execution departs from expectations. Although progress is often measured by visual fidelity, their value lies in improving behavior. Before reaching for a cup, a person anticipates its weight and resistance to grasping, shaping the hand before contact. Such anticipation is coarse and rarely pictorial, yet it guides action. This raises a central question: which predictive capabilities improve behavior? Existing surveys, organized by architecture, output modality, or application domain, leave this question implicit. We introduce three progressively stronger capability levels: Plausible models preserve task‑relevant temporal, geometric, or physical structure; Controllable models additionally predict how interventions alter that structure; and Actionable models translate predictions into measurable gains in planning, action, learning, evaluation, verification, recovery, or data selection. We complement this hierarchy with a 3 x 4 matrix crossing geometry, physics, and action grounding with improvement loops centered on data, rewards, policies, and the model itself. Using this framework, we survey manipulation, navigation, locomotion, autonomous driving, and general embodied learning, tracing technical progressions, clarifying capability requirements, and examining datasets, benchmarks, and evaluation protocols. We identify challenges in long‑horizon consistency, uncertainty calibration, causal intervention testing, latency, verification and recovery, and cross‑embodiment transfer. This perspective shifts evaluation from visual plausibility toward whether predictions capture task‑relevant state, reflect intervention effects, and improve the closed‑loop behavior of embodied agents.
Authors:Liu Cao, Xingze Wu, Jingzhi Cui, Botian Xu, Mingzhi Pei, Ruoqu Chen, Mengdi Xu
Abstract:
Learning humanoid‑object interaction requires coordinating whole‑body balance, locomotion, and dexterous hand contact to control both robot and object motion. Human demonstrations provide examples of coordinated interaction, but transferring these behaviors to humanoid robots requires learning how to establish and maintain effective contacts under different embodiments and dynamics. We present Weave, a unified framework for learning whole‑body dexterous humanoid‑object interaction from captured human demonstrations. Weave first converts captured human‑object interactions into executable robot‑object references through contact‑aware retargeting and approach‑motion completion. At its core is a contact‑ and geometry‑aware policy that jointly commands 29 body joints and 12 actuated finger joints across multiple objects and interaction sequences. Evaluation across nine objects yields a 92.5% success rate on trained interactions and, without any additional training, 65.0% on sequences never seen during training. We additionally release ~9,000 physically executed rollouts spanning ~23 hours, providing robot‑object trajectories with contact annotations for downstream interaction‑policy learning and physically consistent HOI motion generation. Project website: https://xiaohu‑art.github.io/Weave/
Authors:Yongchao Ye, Xinyu He, Dutliff Boshoff, Way Kuo, Lishuai Li
Abstract:
Manufacturing consumes one third of global energy and still has significant room for improvement in terms of energy efficiency. Optimal process control is essential for this purpose. However, synthesizing mathematical optimization models from messy, real‑world industrial specifications requires bridging unstructured natural language and spatial diagrams with rigorous mathematical syntax. This poses a profound challenge for general‑purpose Large Language Models (LLMs), which may introduce invalid constraints when tasked with modeling continuous multi‑physics dynamics. To address this, we introduce little m, an AI agent designed to assist the formulation of industrial process control models. Combining a domain‑specific knowledge repository with LLM‑driven interaction, the proposed framework formulates real‑world optimization problems as mathematical models. For systematic evaluation, we introduce the Industrial Process Control Benchmark (IPC‑Bench), a novel multimodal dataset of 50 canonical scenarios requiring joint reasoning over text and process diagrams. Through comprehensive automated structural assessments and double‑blind human evaluation, little m substantially outperforms state‑of‑the‑art LLMs, generating semantically correct models. These evaluations assess formulation quality rather than solver feasibility, formal physical validity, or closed‑loop industrial performance. The implementation of little m and the IPC‑Bench dataset are available at https://github.com/yeyongchao/process‑modeling‑benchmark.
Authors:Meng Luo, Yanlin Li, Hao Li, Hongzhan Lin, Pengfei Zhou, Tianjie Ju, Ran Zhang, Yeying Jin, Mong-Li Lee, Wynne Hsu
Abstract:
Foundation models, alongside advances in learned game‑world models, are reshaping AI across the game lifecycle. Beyond playing games, recent systems model players and game dynamics, support design and development, adapt player‑facing experiences at runtime, and evaluate resulting artifacts. Yet these directions have evolved largely separately, obscuring which capabilities transfer across settings and which remain tied to particular games, engines, interfaces, or player populations. We organize the literature into six roles according to the immediate use of AI output: playing and acting; modeling players and games; designing games; building and maintaining games; generating and adapting at runtime; and testing and evaluating games. For each role, we examine what structure is supplied by the game or workflow, what AI learns or produces, which capabilities and artifacts transfer across settings and roles, and what evidence supports the claims. We identify cross‑role connections: trajectories train world models, learned environments provide experience for agents, design specifications drive executable implementations, and play or testing feedback guides revision. However, control schemes, rules, engine interfaces, state representations, and player contexts often remain setting‑specific, so downstream claims require validation in the target setting. Evaluation is most standardized for bounded game playing and selected learned environments, while persistent state in learned worlds, repeated software revision, validated player modeling, sustained runtime adaptation, and representative automated testing remain less established. The central challenge is to reuse or transfer outputs and capabilities across roles while re‑establishing evidence for effectiveness in the game‑specific contexts where they are used.
Authors:Zhipeng Zhao, Wenxu Wang, Peishun Liu, Ruichun Tang
Abstract:
Behavioral benchmarking reveals \emphwhat biases exist in vision‑language models but not \emphwhich internal components are most sensitive to targeted intervention, precluding principled intervention. We argue for mechanism‑level evaluation as a necessary complement, demonstrating causal mediation analysis as a diagnostic instrument for gender bias. We decompose gender‑cue effects into controlled indirect effects attributable to specific‑layer activations and direct effects through all other pathways, producing layer‑by‑layer mechanistic signatures. Across six models spanning three architectural families (LLaVA‑1.5, LLaVA‑NeXT, InstructBLIP at 7B/13B) and two 8B‑scale architectures, three findings emerge: language‑layer activations exhibit the greatest output sensitivity under controlled intervention, with the direct component often carrying the opposite sign; architectural choices redistribute layer‑wise sensitivity to activation replacement; and counterfactual scores diverge from surface‑level scores, exposing implicit associations. Systematic ablation validates internal consistency. An intervention experiment finds that the average indirect effect (AIE) and downstream intervention effectiveness are only weakly correlated (Pearson r = 0.33), and the layer with the second‑largest AIE produces near‑zero bias change‑‑‑indicating that mechanistic diagnosis captures activation‑replacement sensitivity but does not, by itself, identify optimal intervention targets. These results show mechanism‑level evaluation captures architecture‑specific sensitivity patterns that behavioral benchmarks cannot; pairing both should become standard NLP practice. Code: https://github.com/zhaozhipeng1997/CARD‑GenderBias.
Authors:Zhipeng Zhao, Wenxu Wang, Peishun Liu, Ruichun Tang
Abstract:
When strong multimodal models are widely available, progress requires new scientific methodologies beyond benchmark scores‑‑‑using models as instruments for understanding behavior. We address this by asking: can we use large vision‑language models (LVLMs) as experimental instruments for studying their own failure dynamics? Focusing on visual hallucination, we introduce SAFE, a training‑free decoding framework that contrasts visually‑grounded and vision‑ablated generation paths to produce a token‑level contrastive grounding score that identifies when the model favors linguistic priors over visual evidence. This signal serves dual roles: as a practical proxy for detecting visually‑ungrounded tokens, and as the basis for decoding‑time penalties. Our analysis yields three empirical observations: visual dependency decays over generation, hallucinations co‑occur in temporal clusters, and early intervention reduces clustering without substantially degrading fluency. On MMHalBench, SAFE substantially outperforms all compared baselines; results elsewhere are more mixed. We argue that designing contrastive probes exemplifies a broader mission: using models as instruments for scientific understanding. Code: https://github.com/zhaozhipeng1997/SAFE_public.
Authors:Zhuo Li, Yiming Yao, Jim Tan, Mengjie Jing, Zhipeng Dong, Fei Chen
Abstract:
World Action Models (WAMs) offer a promising approach to general‑purpose robot manipulation by jointly modeling visual dynamics and actions. However, most WAM studies focus on tabletop or arm‑centric manipulation, while humanoid loco‑manipulation remains less explored. To address this gap, we introduce WholeBodyWAM, which jointly predicts future visual dynamics, manipulation actions, and whole‑body control intents for generalizable humanoid loco‑manipulation. It preserves pre‑trained world‑action priors while grounding heterogeneous whole‑body controller (WBC) semantics and coordinating whole‑body behavior. Extensive experiments show that WholeBodyWAM achieves an overall simulation task success rate of 91.9%, with a 0.23 improvement in real‑world out‑of‑distribution task progress and a 70% reduction in success‑rate variance across WBCs relative to the respective baselines. These results suggest a path toward scalable humanoid whole‑body intelligence by extending pre‑trained world‑action priors through structured WBC grounding and coordination, rather than relearning whole‑body behavior from scratch. Project page: https://wholebodywam.github.io/.
Authors:Jeng Wen Joshua Lean, Ting-Yu Yen, Wei-Fang Sun, Simon See, Hung-Kuo Chu, Shih-Hsuan Hung
Abstract:
Full‑context neural visual geometry is impractical for thousands of images, while sequence‑based chunking poorly captures irregular non‑local overlap in multi‑sequence aerial collections. We present Graph‑Guided Neural Visual Geometry for Aerial Registration (G3AR), a graph‑guided framework for scalable dense neural geometry. Before local inference, G3AR builds a geometrically verified image‑proximity graph that guides bounded overlapping chunks and induces a chunk graph whose maximum spanning tree defines alignment topology. Compatible backbones process chunks independently; shared‑image predictions then estimate three‑dimensional similarity (Sim(3)) transforms that register local cameras and geometry in a common frame. Across four real aerial scenes, G3AR improves pose error and runtime in matched VGGT‑ and Pi3‑backed comparisons, while its DA3 variant achieves the lowest pose error among evaluated neural‑geometry methods.
Authors:Yushan Bai, Boyu Zheng, Zhiyang Mao, Hongzheng Sun, Yuchuang Tong, En Li, Zhengtao Zhang
Abstract:
Multi‑finger dexterous manipulation relies on stable hand‑object interactions, yet these interactions are partially observable in practice. Visual observations are often occluded by the hand, tactile sensors introduce hardware‑specific modalities and calibration burdens, and existing policies rarely model how these cues evolve under actions, making them brittle under contact uncertainty. To address these, we present ProxiDex, a dynamics‑guided proximity policy framework that treats hand‑object proximity as an interaction state for dexterous manipulation. ProxiDex reconstructs interaction point clouds and converts geometric distances into proximity cues, forming a hardware‑agnostic contact representation that provides immersive feedback during VR teleoperation. Built on this representation, ProxiDex learns action‑conditioned proximity dynamics with a coupled forward‑inverse design: future observation latents are predicted from actions, while proximity variations are decoded from latent changes. Leveraging these dynamics, ProxiDex adaptively reweights proximity tokens across manipulation phases and uses dynamics‑consistency supervision to guide policy inference, stabilizing action generation under unreliable visual feedback. Simulation and real‑world experiments demonstrate improved success rates and robustness over representative baselines across standard, unseen objects, and perturbation scenarios. Additional visualizations are available at https://proxidex.github.io/.
Authors:Naveen Mysore
Abstract:
Scientific observations are frequently distributed across locations, time periods, and institutions. Combining such observations into a continuous, differentiable field enables recovering governing physical parameters from its derivatives. This paper makes two contributions in this setting. First, the established additive structure of fixed‑basis ridge‑regression statistics is applied to tensor‑product spline fields: each data holder computes a local Gram matrix and moment vector, and the merged solution is mathematically identical to centralized fitting, with no raw data shared and no iterative synchronization. This property is specific to the fixed‑feature squared‑error setting; the present derivation does not establish an analogous guarantee for general jointly trained multilayer networks. Second, a complete pipeline connects distributed observations to physical parameter inference through field reconstruction, derivative extraction, and linear regression. The pipeline is validated on four PDEs: diffusion, wave, heat‑with‑source, and the nonlinear viscous Burgers equation, recovering governing parameters to sub‑percent accuracy in the linear cases and 5% for Burgers. In all cases, distributed merging introduces zero degradation relative to centralized fitting. Application to 41 years of NOAA sea‑surface temperature data confirms the result on real spatiotemporal observations. Source code to reproduce all experiments is available at https://github.com/NAVEENMN/gramfield.
Authors:Yuchen Su, Zijian Huang, Yaotian Shi, Shaoxin Zhong, Ruofan Wang, Mengze Li, Yonghua Zhu, Diana Benavides-Prado, Michael Witbrock
Abstract:
Puns are a challenging form of figurative language that exploit phonetic similarity and semantic ambiguity to convey multiple meanings. Although large language models (LLMs) demonstrate strong language understanding capabilities, they still struggle with pun reasoning due to limited phonetic modeling and uncontrolled end‑to‑end generation. We propose PunGraph, a retrieval‑enhanced knowledge graph framework for pun understanding. PunGraph constructs a phonetic‑semantic lexical graph using the Unisyn phonetic dictionary, IPA and G2P representations, and WordNet definitions, and retrieves candidate words or senses to constrain LLM reasoning within a structured candidate space. We further introduce WebPun, a new large‑scale dataset containing 5,730 annotated heterographic and homographic puns. Experiments on SemEval‑2017 and WebPun show that PunGraph consistently improves the performance of small‑scale LLMs and achieves competitive results against strong proprietary models. Further analysis shows that retrieval‑guided phonetic and semantic constraints effectively reduce common reasoning errors in pun interpretation, highlighting the benefits of integrating structured knowledge with LLMs. We release our code and dataset at https://github.com/ysu132/PunGraph.
Authors:Moein Heidari, Junbo Rao, Jai Choraria, Wenjin Chen, David J. Foran, Ilker Hacihaliloglu
Abstract:
Self‑supervised learning (SSL) can reduce the need for labelled medical images, but the choice of pretext objective remains unclear for lung ultrasound (LUS). Contrastive learning, masked reconstruction, and joint‑embedding predictive architectures (JEPA) differ in the space in which their targets are defined, yet existing ultrasound studies compare them under different corpora, backbones, and evaluation protocols. We compare these three objective families using the same encoder backbone, pretraining corpus, optimisation schedule, and frozen‑evaluation protocol. Encoders are pretrained on COVID‑BLUeS LUS videos and evaluated with linear, kNN, and attentive probes at 5%, 10%, 50%, and 100% label budgets. Evaluation is performed on POCUS using patient‑level five‑fold cross‑validation and on the independently acquired Mendeley‑Uganda dataset, which is excluded from both pretraining and probe fitting. At the full label budget under linear probing, VideoMAE and V‑JEPA achieve 66.5 \pm 13.1 and 65.4 \pm 11.7 balanced accuracy on POCUS, while MoCo achieves 42.1 \pm 1.2. On Mendeley‑Uganda, the ranking reverses: MoCo performs best at 62.7 \pm 1.0, followed by VideoMAE at 53.8 \pm 2.8, while V‑JEPA falls near chance at 35.1 \pm 4.9. These results show that POCUS probe accuracy alone does not identify the objective that transfers best across datasets. We also outline planned representation‑level analyses to examine this reversal. Code is publicly available at https://github.com/moeinheidari7829/LUSVideoSSL.
Authors:Quanwei Liu, Tao Huang, Jiaqi Yang, Wei Xiang
Abstract:
Rapid advancements in vision‑language models have propelled Referring Remote Sensing Image Segmentation (RRSIS) to the forefront of Earth observation. However, practical deployments suffer severe performance degradation under a coupled dual‑drift paradigm: visual domain drift from cross‑spatial‑resolution mismatches and spectral variations, alongside textual logic drift from unconstrained, variable user‑input granularities. To mitigate these bottlenecks, this paper establishes the first cross‑domain RRSIS benchmark, designated as the Vaihingen‑Potsdam Referring (VPRef) dataset, comprising 46,972 language‑image‑annotation triplets organized into a three‑tier linguistic hierarchy. Building upon this benchmark, we develop a tailored parameter‑efficient domain adaptation baseline anchored on the Segment Anything Model (SAM3) via Low‑Rank Adaptation (LoRA). Our framework counteracts visual distribution discrepancies through pseudo‑label‑driven self‑training and addresses textual logic drift via random multi‑granularity text prompt mixing. Crucially, the distribution of empirical metrics across ablative variants suggests a potential decoupling between cross‑modal semantic robustification and visual domain alignment, demonstrating that linguistic variance drives fine‑grained semantic invariance while pseudo‑label propagation governs macro‑scale spatial grid alignment. Extensive benchmarks demonstrate the proposed framework achieves superior cross‑domain segmentation boundaries while modifying merely 1.08% of the foundational parameter footprint, establishing a robust baseline for future multi‑modal remote sensing domain adaptation research. The dataset and code will be available at https://github.com/quanweiliu/VPRef.
Authors:Chenhao Qiu, Dawei Li, Yechao Zhang, Lei Gong, Zhen Tan
Abstract:
Privileged on‑policy distillation improves multimodal reasoning by allowing a teacher to evaluate student trajectories using rich, training‑only visual evidence. Both models score these trajectories while conditioning on the same student‑generated prefix. When a student misinterprets an image early in a response, this accumulating erroneous rationale eventually pulls the teacher away from its visual evidence. The teacher and student converge on the same hallucination, causing standard cross‑model supervision to collapse precisely where correction is most needed. We find that the teacher's visual corrective preference is not lost under this misleading agreement. Comparing the predictions of the identical teacher given the real image and a visual null reveals that the privileged evidence still pushes the model toward the correct interpretation. We introduce OPD‑Aha, which reconstructs the distillation target directly from this isolated visual preference rather than relying on the fragile teacher‑student discrepancy. This reconstructed target aggressively suppresses continuations that contradict the image. Trained with this objective, students learn to naturally interrupt their own flawed reasoning with reflection tokens such as wait and actually. After reflection, subsequent generation relies less on the accumulated erroneous text and more on the visual evidence. Correcting these trajectories mid‑generation fundamentally alters the reasoning process, yielding broad and consistent improvements across diverse fine‑grained perception and complex multimodal reasoning benchmarks. Our code and models are available at https://github.com/Echochef/OPD‑Aha.
Authors:Ziyu Chen, Henghui Bao, Haoran Chang, Alan Yu, Ran Choi, Kai McClennen, Gio Huh, Kevin Yang, Ri-Zhao Qiu, Yajvan Ravan, John J. Leonard, Xiaolong Wang, Phillip Isola, Ge Yang, Yue Wang
Abstract:
State‑of‑the‑art visual locomotion controllers are increasingly capable at handling complex visual environments, making evaluating their real‑world performance before deployment increasingly difficult. This work intends to narrow this train/evaluation gap by developing a collection of hyper‑photo‑realistic, closed‑loop evaluation environments ‑ The Neverwhere Benchmark Suite ‑ comprised of over sixty 3D Gaussian Splatting reconstructions of urban indoor and outdoor scenes. Our goal is to encourage large‑scale and reproducible robot evaluation by making it easier to create and integrate Gaussian splats‑based reconstructions into simulated continuous testing setups. We also underscore the potential pitfalls of relying exclusively on 3D Gaussian‑generated data for training, by providing policy checkpoints trained over multiple Neverwhere scenes and their performance when evaluated in novel scenes. Our analysis illustrates the necessity of sourcing diverse data to ensure performance. Code and data are available on the project page: https://ziyc.github.io/neverwhere‑bench/.
Authors:Nishad Singhi, Hector Garcia Rodriguez, Aditya Arora, Marcus Rohrbach, Anna Rohrbach
Abstract:
Chain‑of‑thought reasoning has revolutionized natural language processing by enabling large language models (LLMs) to decompose problems into intermediate steps before answering. Yet confining reasoning to the textual domain presents limitations for tasks requiring direct manipulation of visual representations. Recent efforts augment multimodal LLMs with external visual expert tools such as depth estimation or object detection modules, but these remain fundamentally limited by their reliance on narrow, rigid operations that cannot flexibly generate or transform visual content. We propose ReImaGin, which leverages image generation models as a flexible visual reasoning mechanism for multimodal LLMs: unlike fixed‑function tools, they accept natural language commands and can perform open‑ended visual operations, like removing an occlusion or generating a floorplan from multiple disjoint views of a room. Across six diverse visual reasoning tasks including multi‑view spatial reasoning and collision prediction, ReImaGin consistently outperforms both text‑only reasoning and specialist vision‑tool baselines, with gains of up to 25%, demonstrating the advantage of flexible, generative visual reasoning.
Authors:Chuyao Wang
Abstract:
Silicon sampling uses large language models (LLMs) to simulate survey respondents. Whether it recovers cross‑national variation, and why, remains unresolved. This study evaluates it against European Social Survey Round 11 (30 countries, 42 items) with two open‑weight LLMs under first‑ and third‑person prompts, plus backstory and response‑format experiments. Aggregate recovery is moderate and uneven across items. Adding the country name to a three‑variable demographic backstory raises the median per‑item correlation between simulated and observed country means from ‑0.03 to 0.52, and the richer profiles tested add no consistent gain. The respondent's country label acts as a country‑level assumption that respondent detail does not revise. Naming the response‑scale endpoints in words stops the model from ranking countries backwards, so the answer format sets the direction of the ranking. Individual‑level recovery remains negligible in every condition and does not track aggregate recovery across countries. An average of neighboring countries, using no LLM, recovers country levels more accurately than every model condition and ranks them about as well. Silicon sampling can thus support exploratory country‑ranking comparison after item‑level validation and with the response format reported. It does not support individual or distributional inference.
Authors:Hyojung Han
Abstract:
Weight‑only post‑training quantization is the cheapest way to shrink a retrieval embedder, and the received advice for applying it ‑‑ protect the embedding table, allocate bits by module sensitivity, prefer a ranking‑aware objective over weight reconstruction ‑‑ was carried into LLM quantization largely intact. We test that advice on retrieval embedders directly, quantizing five checkpoints from four architecture families across a grid of bit widths and group sizes, and isolating the embedding, attention and feed‑forward blocks at each width. Every heuristic fails to transfer as stated. The embedding table never emerges as the dominant isolated protection priority in any family, despite being the largest tensor in several of them. Module sensitivity does not survive as a transferable ordering: at INT4/g16 the spread between modules is too small to allocate against, at INT3 the ordering becomes family‑dependent and joint damage stops being the sum of its parts, and at INT2 comparable reconstruction error accompanies retention ranging from 1.3 to 65.9 percent of full precision. A cheap reconstruction proxy is useful for screening uniform bit widths but substantially less reliable for choosing which tensors to protect; its apparent strength across the whole grid is a range‑extension artifact. A distilled 109M student at INT3 holds 78.04 NDCG@10 in 68.4 MB and dominates the extreme‑PTQ arm of its own 0.6B teacher, 297.9 MB at 64.46, on both size and quality ‑‑ but only inside the task it was distilled for. Sizes are byte counts of files that exist rather than arithmetic estimates, and the measurement repository carries the byte provenance for every one of them.
Authors:Chuyao Wang, Patrick Sturgis, Daniel de Kadt
Abstract:
Employers increasingly delegate initial screening to automated systems, which in many cases reject an application before any human reads it. Acceptance of such systems plausibly depends both on how well they perform and on the procedure that produces the decision. Prior studies rarely vary procedure and performance independently, leaving it unclear whether applicants value procedure for its own sake or for the errors it corrects. In a preregistered paired‑profile conjoint experiment, 1,919 United States job seekers made eight choices between systems with independently randomized levels of decision authority, error rate, explanation, opt‑out, appeal, and independent bias audit. The value of the appeal, the opt‑out, and the bias audit did not rise as wrongful rejections became more common, each staying within a preregistered equivalence bound. Human involvement carried more weight than any procedural feature, moving stated choice about as much as cutting wrongful rejections from 30% to 10%. These patterns constrain a simple error‑correction account and are consistent with applicants valuing procedure partly for its own sake, so that improving a system's performance does not substitute for a right applicants can invoke.
Authors:Jose Angel Sanchez Viloria, George Sklivanitis, Dimitris Pados
Abstract:
Securing wireless communication against eavesdropping is critical, particularly in dynamic and decentralized environments. We present gr‑PHYSEC, a new GNU Radio out‑of‑tree (OOT) module for real‑time physical‑layer key generation. Unlike traditional key generation that relies on pre‑shared secrets or computational complexity, our approach derives symmetric keys from the wireless channel's inherent randomness. We embed a trained neural network within GNU Radio to extract channel features between trusted parties (Alice and Bob) during probe exchanges. These features are quantized into binary keys, reconciled via Reed‑Solomon encoding, and further secured with SHA‑512 hashing. The generated keys are then directly used to encrypt data. Real‑world experiments at the FAU CAAI connected robotics testbed using ADALM Pluto software‑defined radios and NVIDIA Jetson Orin validate the approach with ground robotic platforms. Results demonstrate low key disagreement rates and strong randomness, as verified by the NIST test suite for random and pseudorandom number generators for cryptographic applications. This integration showcases how GNU Radio can support real‑time AI‑driven security solutions, pushing the boundaries of software‑defined secure communication. The source code for this project is available at: https://github.com/C2A2‑at‑Florida‑Atlantic‑University/gr‑PHYSEC
Authors:Rajneesh Anand, Mayuresh V. Kothare
Abstract:
Precise manipulation of liquid droplets underpins lab‑on‑a‑chip platforms for diagnostics, chemical synthesis, and biological assays. Yet autonomous droplet transport through confined geometries of varying complexity remains an open challenge. Droplets exhibit contact‑angle hysteresis, deformability, and capillary pinning, which make their response to actuation nonlinear and history dependent, that classical controllers and pre‑programmed trajectories cannot cope in multi‑turn environments. Here we demonstrate autonomous navigation of a liquid droplet through geometries of increasing complexity on a gravity driven (Labyrinth) platform using model‑based reinforcement learning. A thin silicone oil film reduces contact‑line pinning while two‑axis tilt supplies the gravitational driving force, and an overhead camera tracks the droplet in real time. An offline‑trained policy discovers effective tilt strategies from limited physical interaction data, without simulation or analytical droplet models. The system operates under partial observability, as oil‑film thickness, instantaneous contact angle, and droplet deformation state remain hidden from the controller. Despite these challenges, the learned policy achieves reliable navigation across straight, right‑angle, and curved‑arc paths, including outside‑corner geometries. We further demonstrate that a policy trained on a simpler geometry transfers to complex ones, succeeding zero‑shot on right‑angle and staircase paths and reaching full success on a curved arc with a fifth of the training data. The findings suggest promising avenues for enabling droplet based microfluidic systems to serve as intelligent chemical laboratories.
Authors:Yingjia Wan, Lin Lin, Elisa Kreiss
Abstract:
When foundation models describe people, recent work in AI fairness, accessibility, and ethics recommends avoiding inferred identity labels (e.g., "she", "his") in favor of seemingly "objective" physical descriptions (e.g., "short hair", "a defined jawline"). Yet whether such descriptive language achieves gender‑neutral communication remains an open empirical question. To study this, we introduce GAPA (Gender Associations of Physical Attributes), a dataset of 316 common physical attributes drawn from diverse sources, paired with 14,706 gender‑association ratings from 304 US‑based annotators. Results show that physical descriptions carry structured and graded gender associations among readers, with more consistent and distinctive associations for women and men than for non‑binary identities. Next, we evaluate 16 LLMs across model families, sizes, and post‑training variants against human ratings. The models partially recover human associations but exhibit systematic alignment biases, including compressed rating distributions, weaker alignment for associations with men, and asymmetric abstention that disproportionately targets the non‑binary category. Finally, we release the best‑performing proxy model trained to predict humans' gender associations of descriptive language and demonstrate its utility through a sociolinguistic analysis of character descriptions in LitBank. Together, our findings provide the first empirical evidence that seemingly "objective" physical descriptions can retain systematic gender associations in human interpretation, and uncover systematic patterns of model‑human misalignment. This challenges the assumption that replacing explicit gender labels with physical descriptions necessarily yields gender‑neutral communication, and highlights downstream challenges in using such descriptions to communicate subjective identity categories in human‑AI interaction.
Authors:Siyu Yuan
Abstract:
Real‑world datasets often exhibit long‑tailed class distributions, where a few head classes contain a large number of training samples while a large number of tail classes have only a few. The composition of each mini‑batch, determined by the sampling strategy, governs which classes contribute to the stochastic gradient estimate, and therefore affects convergence behaviour and generalisation across the whole class spectrum. We provide a systematic theoretical and empirical comparison of four mini‑batch sampling strategies for long‑tailed image classification: uniform instance sampling, class‑balanced sampling, square‑root sampling, and progressively balanced sampling. We place all four in a unified bias‑variance framework describing their effect on gradient estimation, which exposes the tension between unbiased optimisation of the empirical loss and fair representation of rare classes. We then evaluate them under controlled conditions using ResNet‑32 on CIFAR‑100‑LT at three imbalance ratios (rho = 10, 50, 100), with every strategy sharing the same long‑tailed subsets and initialisation within a seed. Progressive sampling improves tail‑class accuracy by 25% relative to the uniform baseline at rho = 100 (13.5% versus 10.8%), consistently across all three seeds, while its overall accuracy is not distinguishable from that of uniform sampling given the seed‑to‑seed variation (40.0% versus 39.7%); the tail‑class gain, not the overall gain, is the robust effect. At rho = 100, class‑balanced sampling degrades accuracy on every class group, including the tail classes it is designed to help, which we attribute to overfitting caused by extreme oversampling of scarce data; at rho = 50 this failure is confined to head and medium classes. These results indicate that when rebalancing is applied during training matters as much as how much rebalancing is applied.
Authors:Peiqi Yu, Mosam Dabhi, Shangtao Li, Bowei Li, Laszlo Jeni, Changliu Liu
Abstract:
Adapting robotic manipulation to new objects and tasks often requires additional demonstrations or manual engineering. Reusable manipulation skills can reduce this effort, but adapting these skills to new scenes remains challenging. We present ManiSkillFormer, a framework for demonstration‑free and compositional manipulation that connects perception and action through explicit geometric contracts. Building on reusable skill schemas, LLM agents generate contracts specifying the geometry primitives required by each skill, together with corresponding motion templates for semantic objects and task contexts. These contracts guide a perception module to ground task‑relevant 3D geometry from observations, which is then used to instantiate reusable motion templates in a skill library. We evaluate ManiSkillFormer on a dual‑arm robot across demonstration‑free pick‑and‑place with 30 instances from 8 object categories, functional manipulation including unscrewing, pouring, pressing, and folding, and three long‑horizon tasks. ManiSkillFormer achieves an average success rate of 88.97% for pick‑and‑place, 75.00% for functional manipulation, and completion rates of 50‑‑80% across the long‑horizon tasks, outperforming the evaluated baselines and two ablated pipelines. These results demonstrate the potential of explicit geometric contracts to support skill reuse and composition across objects and tasks without per‑object policy fine‑tuning or additional robot demonstrations. The project website is at https://patricia1019.github.io/ManiSkillFormer/.
Authors:Saswat Subhajyoti Mallick, Riu Cherdchusakulchai, Marc Ruiz Olle, Albert Mosella-Montoro, Jose Ribeiro-Gomes, Francisco Vicente Carrasco, Fernando De la Torre
Abstract:
Streaming 4D reconstruction has been demonstrated only indoors, on dense camera rigs surrounding subjects that move at human pace. Outdoor 4D reconstruction exists but relies either on cameras mounted on the moving vehicle itself, or on limited‑coverage arrays observing quasi‑static subjects offline. The case that actually matters for spectators is a fast‑moving subject, watched from a sparse ring of allocentric cameras, streaming. No method targets this, and no benchmark exists to evaluate one. To this end, we introduce FastFlowGS, a streaming 4D Gaussian Splatting method for reconstructing fast‑moving subjects from a small set of fixed external cameras, and Monaco4D, a photorealistic Unreal Engine 5 benchmark for high‑speed outdoor reconstruction. FastFlowGS fuses sparse matches, semi‑dense tracks, and dense optical flow by lifting each signal to 3D with geometric uncertainty and combining them through a Kalman‑style temporal update. Monaco4D provides Formula 1 sequences under varied illumination from trackside, onboard, and drone viewpoints with dense ground truth. On CMU‑Panoptic, FastFlowGS exceeds the strongest baseline by 12.6% VMAF at 35% greater efficiency. On Monaco4D, where existing streaming methods degrade severely, it improves dynamic‑region PSNR by up to 18.6% with 28.3% lower per‑frame optimization time. Dataset and additional details can be found at https://humansensinglab.github.io/monaco4d/.
Authors:Hyunkyung Han, Min Jung Kim
Abstract:
Attribution methods for genomic sequence models are commonly evaluated by how much of a known motif they recover, or by how a prediction degrades as evidence is deleted. Neither score is interpretable without the value it would take by chance, and neither is routinely reported against one. We show that this omission is not a matter of precision but of validity. The uniform chance level for contiguous motif overlap is \(L/(N‑L+1)\); across 268 transcription factors in UniBind it ranges from 0.0118 to 0.0427, a 3.6‑fold spread determined by motif length and window size alone. For two factors the bootstrap intervals of the chance levels themselves do not overlap, so their raw recovery rates are not comparable quantities. Correcting for this dissolves a published three‑way classification of five factors: a factor reported as a resolution failure attains the second‑highest corrected value, ahead of one of the two positive controls, and two reported as complete failures fall at or below chance. We further show that perturbation‑based evaluation can fail its own precondition: for one factor a fully masked input still scores above the decision boundary, and the curve is not monotone in the number of masked positions, so the area under it is not a measure of faithfulness. We provide chance levels in closed form, a chance‑corrected score, and two screens that run before any attribution is computed.
Authors:Daniela Vega, Paula Cárdenas, Hannah Ceballos, Leonardo Manrique, Pablo Arbelaéz
Abstract:
Spatial Transcriptomics (ST) has transformed biomedical research by enabling the spatial mapping of gene expression across tissue sections. However, high operational costs, specialized equipment requirements, and sensitivity to experimental noise limit the accessibility and scalability of ST. Recent computer vision approaches aim to overcome these limitations by predicting spatial gene expression directly from histopathology images. While effective, current approaches often suffer from gene expression over‑smoothing and overly uniform predictions across tissue regions, suggesting that further progress depends on learning representations that reflect the hierarchical and asymmetric structure of gene regulation and tissue morphology. To address these issues, we propose Hyperbolic Contrastive Learning with Entailment for Spatial Transcriptomics (HyCLoST), a hyperbolic contrastive learning model that captures the intrinsic hierarchical relationships within ST data. By leveraging hyperbolic geometry and a gene‑to‑image entailment loss, HyCLoST learns structured, biologically grounded representations that improve gene expression prediction accuracy, achieving a 6% reduction in MSE and an 8% increase in PCC across 26 ST datasets, over previous methods. Our source code is publicly available at https://github.com/BCV‑Uniandes/HyCLoST
Authors:Shreyan Mitra, Mohammadreza Narimani, Parastoo Farajpoor
Abstract:
This article describes an open image dataset for developing and evaluating active‑fire segmentation methods in satellite imagery. The dataset contains 2,148 image‑mask pairs from 25 California wildfires, with acquisitions spanning July 2020 to August 2026. Each image is a 512x512‑pixel, three‑channel composite derived from Sentinel‑2 Level‑2A bands B12, B11 and B8A at 20 m spatial sampling. A fixed linear rendering is applied throughout the dataset. Corresponding masks distinguish background, SWIR‑rule active fire and invalid observations. The masks were generated from shortwave‑infrared brightness and near‑infrared contrast, followed by constrained neighborhood growth. The release includes chip‑level metadata and an incident‑disjoint partition containing 18 training, three validation and four test fires. Among the image pairs, 841 contain active‑fire labels; these labels occupy 0.0766% of all grid cells. A mask‑blind analyst review covers 233 test chips and provides a separate assessment of the rule‑generated labels at chip and connected‑component levels. Reference training and evaluation code accompanies the data, including a ResNet‑34 U‑Net implementation with validation‑based checkpoint and threshold selection. The archived images, masks, metadata and review annotations support research on rare‑class segmentation, learning from algorithmic labels and transfer across fire incidents. The versioned dataset is deposited on Zenodo, with preparation and reuse software maintained in a public GitHub repository.
Authors:Julian Boesch, Andrew Wee
Abstract:
Fixed‑state recurrences‑‑linear attention and state‑space models‑‑are reported to lag behind attention on associative recall, but whole‑architecture comparisons cannot say which ingredient is responsible. We decompose masked multi‑query recall at a fixed state budget along three single‑knob axes: a short causal convolution, the transition structure (rank‑1 delta rule vs. diagonal), and decay. The convolution dominates (~+0.5 recall in both families under matched training): comparisons that pit convolution‑free cells against a convolution‑equipped Mamba measure the missing convolution, not the recurrence. The rank‑1 transition beats its diagonal ablation by +0.19/+0.32 at 16/32 pairs, but the margin shrinks to +0.03 once both cells carry the convolution, and a state‑matched Mamba‑2 ties the unarmed rank‑1 cell: no class claim survives. Cells that solve 32‑pair recall degrade gracefully with load yet fall to chance retrieving 4 pairs from a distractor haystack‑‑flat across lengths and transitions. Interference under sparse supervision, not capacity: a distance curriculum takes the unchanged architecture from 0.021 to 1.000. Training is a lock‑in lottery‑‑a seed either locks in or does not‑‑and the curriculum is the lever. Lock‑in rises from 1/10 to 7/10 (p=0.02); dense supervision adds nothing; at L=256 a shaped ramp reopens a boundary the uniform curriculum cannot (4/5 vs. 0/9); and at L=512, where the ramp collapses (0/6), gating it on measured accuracy locks in 6/6 (p=0.001). Bidirectional denoiser cells, reading the query before the haystack, show no measurable advantage over causal training (ten seeds), and collision‑key retrieval needs two layers. Arming for recall is free on an S_5 state‑tracking guardrail‑‑the armed cell is significantly better at every depth (p<=0.0044). These replace "recurrent models are bad at recall" with a measured decomposition and two cheap interventions.
Authors:Parastoo Farajpoor, Mahla Ardebili Pour, Mohammad Bagher Ghiasi, Mohammadreza Narimani
Abstract:
Working agricultural landscapes are often treated as background to wildfire disasters, even though they are managed fuel mosaics, productive assets, and parts of regional infrastructure systems. We examine vineyard wildfire resilience during the electrically initiated 2019 Kincade Fire in Sonoma County, California, using an open, event‑anchored geospatial framework spanning 4,581 vineyard fields (8,813.2 ha), wildland vegetation, surveyed structures, roads, overhead smoke, and post‑fire greenness. Sentinel‑2, OpenET, gridMET, soils, terrain, NOAA smoke polygons, an ignition‑date OpenStreetMap network, and three‑dimensional data inventories were analyzed at native decision scales. Vineyard pixels showed substantially lower descriptive dNBR than wildland pixels inside the perimeter (means 0.130 and 0.337). This contrast did not identify a universal vineyard firebreak effect: a segment‑clustered boundary model gave a small negative contrast at 100 m (tau = ‑0.0166) but changed across bandwidths, failed slope continuity, disappeared in a 100 m donut, and produced a wrong‑signed placebo. A 250 m spatial GAM reversed the unconditional pattern: after conditioning on location, terrain, and water use, vineyard fraction was positively associated with dNBR, while residual Moran's I remained 0.519. Beyond spectral impact, all mapped vineyards intersected overhead smoke on at least one day (mean 7.78 potential smoke‑days per field), 34.2% of road‑network nodes were dead ends, and inside‑perimeter vineyards showed a larger greenness deficit through 2021 (recovery ratios 0.815 inside and 0.854 outside). Lower immediate spectral impact therefore did not imply complete resilience. The study provides a reproducible urban‑rural informatics template separating descriptive contrasts, conditional associations, exposure indicators, and recovery evidence for decisions in working landscapes.
Authors:Hongbo Sun
Abstract:
This paper extends the fixed‑point bundle framework for finite‑dimensional variational inequalities (VIs) from the simplex domain to the product‑of‑simplex domain, which is directly applicable to solving Nash equilibria. The fixed‑point bundle for VIs on the product‑of‑simplex domain reveals a composite fiber bundle structure. The key innovation is to construct an equivalent VI on the simplex domain and establish the equivalence between the two fixed‑point bundle frameworks via a fiber bundle isomorphism. Exploiting this geometric equivalence, the predictor‑corrector path‑following algorithm for the VI on the product‑of‑simplex domain is shown to inherit the convergence guarantee of the simplex‑domain framework, namely, global convergence with linear gap reduction near solutions. Numerical experiments on 5600 randomly generated instances with dimensions ranging from 2‑player 128‑action to 128‑player 2‑action demonstrate robust performance. The algorithm converges in every tested instance.
Authors:Gautam Kishore
Abstract:
We study a practical question: can a small correction module fix errors in a frozen language model's outputs without degrading its base capabilities? We propose CRN v2, a lightweight logit‑level correction module (~34M trainable parameters, 0.73% of the 4.65B text module) that sits atop a fully frozen Gemma 4 E2B model. The base model is never updated; only the correction module learns, via supervised fine‑tuning followed by reference‑free DPO on 83,400 error‑correction pairs. On a 60‑question domain exam (CEHRI: Certified Human‑Robot Intelligence, covering facts, arithmetic, and implicit‑goal reasoning), CRN v2 corrects 53.3% of base‑model errors (reworded variant: 43.3%) while showing no degradation on tested capability benchmarks (MMLU/BoolQ N=200; car‑wash N=8). A LoRA baseline at the matched CRN v1 budget (6.6M params, rank 19) achieves 83.3% correction but suffers 30‑75% capability loss on the same benchmarks ‑‑ the correction‑capability tradeoff. An ablation shows that the KL preservation term (lambda=0.1) is critical: lowering it to 0.01 degrades correction to 35.0%. A hidden‑state injection variant at earlier layers (1.6M params, SFT‑only) reaches 50.0%/55.8% but does not exceed logit correction; shallower injection (layer 4) drops to 30.0%/28.3%; multi‑depth logit correction (~35M) reaches only 40%; and longer training (5,000 SFT + 2,000 DPO) stays at 53.3% ‑‑ none of the alternative configurations we tested exceeded the rank‑128 logit result, consistent with a best‑achieved result of ~53% rather than a floor. This is a study of a design principle (frozen base + logit correction + KL anchoring), not a claim of architectural novelty. All code, main‑result weights, and evaluation scripts are released (deep variant as code only ‑‑ no trained deep checkpoints).
Authors:Xiaoyan Li, Yunli Wang
Abstract:
Large Language Model (LLM) agents have demonstrated impressive capabilities across a variety of domains, particularly when integrated with external tools for multi‑step task completion. However, they are increasingly vulnerable to adversarial attacks, including direct prompt injection, indirect prompt injection, memory poisoning, and backdoor attacks, which exploit the model's openness to prompt injection and tool manipulation. In this work, we explore practical and generalizable defense strategies within a unified framework across these four attack types. We introduce two universal tool‑based defenses: Attacker Tool Filtering, which uses anomaly detection (e.g., Isolation Forest) to identify and remove suspicious tools, and Normal Tool Recalling, a white‑box method that restores the agent's original toolset prior to planning. Additionally, we incorporate prompt‑based defenses: Chain‑of‑Thought prompting and self‑reflection techniques to enhance reasoning and task paraphrasing to mitigate attacks. Experimental results across both four open‑source LLMs (Gemma2‑9B, Qwen2‑7B, LLaMA3‑8B, and LLaMA3.1‑8B) and three proprietary LLMs (GPT‑3.5, GPT‑4, and GPT‑5) show that our methods significantly reduce the Attack Success Rates (ASR), achieving 0% ASR in many settings, while preserving or even improving the original task success rate. These findings highlight the promise of simple, modular, multi‑layered defenses for strengthening the security and robustness of tool‑integrated LLM agents. The code is available at https://github.com/Xiaoyan‑Lisa/Defenses‑for‑Tool‑Integrated‑LLM‑Agents‑Against‑Adversarial‑Attacks.
Authors:Yuyeong Shin
Abstract:
Eight‑bit integer (INT8) post‑training quantization is the default recipe for edge deployment, under a widely held assumption: INT8 makes inference faster at a small, predictable accuracy cost, and a model quantized once can be carried to any target. We test that assumption with a controlled measurement study across seven hardware classes ‑‑ ARM and x86 CPUs, a discrete GPU, an NVIDIA Jetson AGX Orin iGPU and its NVDLA cores, and two vendor NPUs (Qualcomm Hexagon HTP, DEEPX DX‑M1) ‑‑ holding the ONNX artifact and the quantization scales fixed so the integer kernel or ISA is the only free variable. Portability fails on three axes. (1) The sign of the INT8 speedup is set by the CPU's dot‑product ISA (ARM dotprod/SDOT, x86 VNNI): cores that have it speed up by up to 2.1x, cores that lack it slow down by 1.7x, for the identical model and runtime. (2) INT8 outputs are not portable, and the rule is an invariance rather than a gradient: FP32 predictions are bit‑identical for every pair (1000/1000), while INT8 predictions agree 1000/1000 exactly when two targets share an integer kernel and 958‑965/1000 whenever they do not ‑‑ independent of whether the boundary is CPU<‑>CPU or CPU<‑>accelerator, and invisible to top‑1 accuracy, which is preserved. (3) Vendor NPUs own quantization: a bring‑your‑own QDQ graph fails silently on one NPU (external scales ignored, accuracy 0.75 ‑> 0.005 while it compiles, profiles and runs without error) and loudly on the other (the compiler refuses the graph), so only the vendor's native path yields a correct engine. We further show that edge‑NPU latency regimes are set by output/device‑to‑host transfer size rather than compute, and locate the transition with a fixed‑compute sweep. We release the scripts and 32 reports. "Quantize once, deploy anywhere" is unsafe for embedded and automotive deployment, where per‑input determinism and redundancy matter.
Authors:Jinyang Zhang, Weibin Liao, Keqin Bao, Sihang Li, Shaobo Wang, Muyang Ye, Hongxin Ding, Yue Fang, Tianyi Tang, Fei Huang, Kexin Yang, Xingzhang Ren, Dayiheng Liu
Abstract:
Large Language Models (LLMs) excel at programming tasks but frequently fail at deterministic, fine‑grained reasoning in natural language, relying heavily on semantic approximations rather than robust symbolic execution. To bridge this gap, we propose MIMIC, a framework that leverages executable code as a rigorous medium for reasoning data synthesis. MIMIC fundamentally transforms algorithms into verifiable reasoning trajectories through narrative fusion, code‑guided test synthesis, and dynamic code instrumentation. Crucially, these explicit intermediate execution states naturally form a Code‑Instrumented Reward (CIR), providing dense, high‑fidelity process supervision for reinforcement learning without external reward models. Extensive evaluations reveal that models trained via SFT and GRPO on our synthesized dataset achieve substantial, consistent gains. Our method significantly elevates accuracy across general reasoning, complex mathematical benchmarks, and fine‑grained deterministic tasks, demonstrating that the procedural rigor of executable code can effectively unlock and enhance the generalized reasoning capabilities of LLMs. Our code and data are available at https://github.com/zjy1298/MIMIC.
Authors:Fouad Bahrpeyma, David Heik, Dirk Reichelt
Abstract:
Flexible robotic production requires joint decisions on process progression, material routing, resource assignment, temporary cooperation, and simultaneous execution, since each decision can affect the feasibility of the others. The challenge is greater under decentralized control, where each robot acts from bounded local information while system progress depends on collective decisions, shared resources, material state, and workspace compatibility. These properties closely match cooperative multi‑agent decision making under partial observability and resource contention. This paper introduces AssemblyGrid v1, a reproducible benchmark for repeated multi‑robot production that combines explicit process progression, decentralized observations, material transfer, temporary multi‑robot coalitions, productive concurrency, and geometry‑dependent feasibility within one task‑level formulation. The benchmark includes Flow, Coalition, and Concurrency workload families, each with three scenario levels. Task success and evaluation measures are defined independently of learning reward and solution method, allowing learning‑based and non‑learning methods to address the same production problem. AssemblyGrid v1 is evaluated through executable conformance checks, mechanism studies, and algorithmic experiments using a privileged centralized reference, structured decentralized controllers, and MARL methods including IPPO, MAPPO, and QMIX. Results demonstrate productive execution under centralized and decentralized control. The MARL experiments further show that decentralized policies can learn effective production behavior from local observations and actions, supporting AssemblyGrid as a controlled benchmark for studying cooperative decision making in flexible robotic production.
Authors:Zuxing Lu, Hongjia Zhai, Guanzhi Wang, Huajian Zeng, Jiaqi Yang, Jingyu Liu, Lei Cheng, Yuantai Zhang, Yuheng Qiu, Zezhou Cheng, Ivan Laptev, Danfei Xu, Benjamin Riviere, Giuseppe Loianno, Eric Xing, Xingxing Zuo
Abstract:
Robots operating in open environments act under partial observability, physical constraints, and dynamic task contexts. Beyond mapping observations and language instructions to actions, they must anticipate how candidate actions may affect future states and task‑relevant outcomes. Recent advances in world models, video generation, and Vision‑Language‑Action (VLA) policies have motivated the development of World‑Action Models (WAMs), which couple future world prediction with executable action generation. This survey provides a robotics‑oriented review of WAMs. We clarify their scope relative to conventional world models, model‑based reinforcement learning, action‑conditioned video generation, and reactive VLA policies, and organize existing methods through a unified taxonomy covering representations, transition modeling, action interfaces, architectures, training pipelines, data modalities, and scaling strategies. We further review applications of WAMs in manipulation, navigation, and autonomous driving, and we summarize the datasets, benchmarks, metrics, and protocols used to evaluate WAM systems. Finally, we discuss key challenges in action alignment, world‑action factorization, spatial and multi‑view consistency, long‑horizon memory, neural simulation for closed‑loop policy learning, and efficient inference. Taken together, this survey aims to provide a concise technical foundation for integrating predictive world modeling with action generation, toward more reliable embodied robot intelligence. Project page: https://rcl‑robotics.github.io/Awesome‑World‑Action‑Models.
Authors:Ayoub Louaye Bouaziz, Matthieu Ostertag, Anton Demasles
Abstract:
Industrial world models must move between machines whose dynamics, sensing interfaces and command conventions differ. This study asks whether a command‑conditioned latent world model, trained to predict future representations of the process rather than to reconstruct future samples, keeps its value on a machine it has never seen: a source CNC machine exposes 17 sensor channels, the target sharing 10 of those. All model selection uses source data only, and the locked configuration is evaluated on the target once. Two findings follow. First, latent‑predictive pretraining brings no in‑domain forecasting gain over matched training from scratch, so source accuracy alone cannot show what such a representation is worth. Second, the transferred model beats persistence on the unseen machine (with R^2\approx0.01 against the target mean) but trails official forecasters that normalize each input window by its own statistics; a post‑lock ablation, declared before it ran, shows that this input normalization alone closes the gap, and closing it costs predictive calibration. Cross‑machine transfer under partial sensor overlap is therefore a distinct evaluation axis for command‑conditioned world models.
Authors:Siyu Yuan, He Zhang, Sizhen Bian, Bin Guo
Abstract:
Human activity recognition (HAR) is usually framed as gradient‑based training of neural networks. Agentic Heuristic Learning (AHL) Studio explores a complementary view inspired by human cognitive learning: people learn activities by remembering examples, forming rules, and repairing mistakes, not by backpropagating. This proposed tool implements AHL for HAR: a learning‑time agent reasons over sensor protocols, proposes executable heuristic policies, records repair traces, and exports an LLM‑free policy for edge deployment. We focus on the HAR benchmark family and provide an end‑to‑end workflow from dataset observation to edge‑oriented export. On eleven HAR datasets evaluated so far, AHL policies reach strong executable‑policy performance while remaining inspectable, editable, and replayable \footnotehttps://github.com/zhaxidele/ahl‑ts‑studio.
Authors:Zhongdi Liu, Huangyu Dai
Abstract:
Transformer‑based multi‑target tracking (MTT) jointly learns data association and state estimation, but MT3/Track‑MT3‑style trackers repeatedly re‑encode measurement windows, incurring redundant computation. We propose Causal Neural Set Filtering (CNSF)\footnote\hrefhttps://github.com/daihuangyu/CNSFCode: https://github.com/daihuangyu/CNSF, a neural set filter that encodes only current measurements while carrying past evidence in a structured recursive track state. CNSF combines exclusive Sinkhorn association, association‑conditioned Kalman‑shaped updates with moment matching, and recurrent Bernoulli lifecycle modeling with measurement‑driven birth. These mechanisms impose soft one‑to‑one constraints, propagate association‑induced state uncertainty, and support existence estimation under missed detections and birth‑‑death transitions. On a held‑out three‑regime simulated test set, CNSF reduces mean GOSPA and T‑GOSPA relative to Track‑MT3 by 19.3% and 30.4%, with 55.9% fewer parameters and a 3.76× speedup in single‑thread CPU inference.
Authors:Masashi Sasago, Masato Kobayashi, Yuki Uranishi
Abstract:
Visual torque feedback supports underwater bilateral teleoperation, but the benefit of mixed reality (MR) over conventional monitor presentation remains unclear. We present MR‑GLi, an MR interface that spatially registers a reaction torque indicator and wrist‑camera image to the robot gripper. Twenty participants performed lift and pick‑and‑place tasks with rigid and compliant objects in a counterbalanced within‑subject comparison with a 2D monitor, using identical visual‑feedback content and four‑channel bilateral control. MR‑GLi provided gripper‑linked access to visual feedback while maintaining a similar level of torque‑regulation performance to the 2D monitor. Subjective evaluation further indicated reduced perceived burden associated with shifting attention between the workspace and visual feedback. These results demonstrate the feasibility of gripper‑linked MR overlays for underwater bilateral teleoperation and highlight the importance of considering information access in addition to task performance. Additional material: https://mertcookimg.github.io/mr‑gli/
Authors:Takumi Kobayashi, Masato Kobayashi, Yuki Uranishi
Abstract:
Bilateral control‑based imitation learning captures both position and force information, making it well suited to contact‑rich manipulation. However, existing approaches provide limited means for an operator to specify how a learned task should be executed at inference time, such as slowly or quickly, gently or firmly. We propose Bi‑MoDe, a modifier‑conditioned decoding framework that injects a constrained latent into every layer of the Transformer action decoder via adaLN‑Zero, allowing behavioral directives to directly influence action‑chunk generation. We evaluate the method on a real‑world whiteboard wiping task with combinations of temporal and physical modifiers. Bi‑MoDe improves physical directive following over the action‑chunking baseline while maintaining comparable temporal control. An ablation further shows that decoder conditioning and latent‑space composition interact, and that their combination is important for accurate physical directive following. Additional material is available at the https://mertcookimg.github.io/bi‑mode/
Authors:Benjamin Jin, Maria del C. Valdés Hernández, Richard Bortsov, Joanna M. Wardlaw, Daniel Bos, Grant Mair
Abstract:
Intracranial arterial calcifications (IACs) are a common finding on clinical non‑contrast enhanced head CT scans and are associated with neurovascular disease. Calcifications can occur in the intimal or medial layer of the arterial wall, subtypes that differ in aetiology and may have distinct clinical relevance. These subtypes can be visually distinguished by radiologists based on the shape of the calcifications. We investigate three automated approaches for subtype classification of IAC from head CT‑derived segmentation masks: (1) an automated adaptation of the established radiological visual score, (2) a sphericity‑based method, and (3) a method based on shape embeddings extracted by a medical shape foundation model. All approaches use the same lightweight classification pipeline on top of the features they compute and are evaluated using 5‑fold cross‑validation. The three methods achieved comparable performance, with the embedding‑based approach yielding the best overall results with a weighted F1 (mean \pm SD) of up to 71.5 \pm 3.7 for a single artery and 59.8 \pm 1.7 for the joint artery classification. Performance was largely preserved when using automated instead of manual IAC segmentation masks, and we found the difference in weighted F1 not significant. Our results show that fully automated IAC subtype quantification from head CT is feasible and remains robust to the use of manual and automated IAC segmentation masks. Code at https://github.com/bjin96/iac‑subtyping.
Authors:Chengli Feng, Zhiyue Wu, Jiahao Song, Zheqi Dai, Boyang Wang, Ruibin Yuan, Junming Gong, Wenxiao Zhao, Jing Guo, Gang Yu, Xiangyu Zhang, Xuerui Yang, Chao Yan
Abstract:
We introduce StepAudio 3 Music, a large‑scale, long‑form music generation model that supports explicit musical planning and open‑domain text‑controlled generation. The StepAudio Music Tokenizer represents audio as a 50‑Hz stream from a 65536‑entry single codebook, using semantically informed self‑supervised and multi‑task training to preserve musical structure and reconstruction‑relevant information. A flow‑matching diffusion Transformer (DiT) predicts continuous StepAudio VAE latents, which our VAE decoder converts into 48‑kHz audio. This discrete‑continuous design is guided by comparisons of single‑codebook VQ, Semantic and Acoustic RVQ, and different DiT configurations. For explicit planning, a Mixture‑of‑Experts autoregressive model uses ABC notation to produce an intermediate arrangement plan (ABC‑CoT) before predicting music tokens, making harmony, rhythm, and melodic structure part of the generation context. A progressive training curriculum and supervised fine‑tuning support song and instrumental generation, accompaniment generation from dry vocals, and cover‑song synthesis for up to 5 minutes and 30 seconds. With reinforcement learning via direct preference optimization (DPO), the final model achieves the highest AudioBox Content Enjoyment, Content Usefulness, and Production Quality scores and the highest MuQ‑MuLan similarity among the evaluated systems, with competitive SongBench results. On the preliminary Artificial Analysis Music Arena Vocals leaderboard, it obtains a Quality Elo of 1105, behind only Suno V5.5 and Mureka and ahead of Suno V5, MiniMax models, and other systems. Audio demonstrations are available at https://stepaudiollm.github.io/step‑audio‑3‑music.
Authors:Konstantinos Moutselos, Ilias Maglogiannis
Abstract:
Diffusion‑based artifact detectors score whole‑slide image patches by reconstruction error under a model fine‑tuned on clean tissue. We show that conditioning this fine‑tuning on random Gaussian embeddings ‑‑ resampled at every step from approx. 200 KB of precomputed embedding statistics, with no encoder, no cache, and no change to inference ‑‑ consistently widens the clean/artifact separation. A four‑step ablation chain shows the benefit requires neither content (shuffled real embeddings), provenance (synthetic Gaussians), a tuned intensity (flat across an 8x variance range), nor per‑patch identity (fresh per‑step noise); a LoRA‑dropout control shows the conditioning pathway specifically, not generic weight perturbation, carries the effect. Patch‑level gains of +0.25‑0.48 Cohen's d replicate across nine trainings; honest leave‑one‑slide‑out evaluation clears a pre‑registered bar in 2/2 seeds; and two pre‑registered external endpoints on a 281‑case set confirm pooled Delta F1 = +0.0073 (95% CI) and +0.0129 (97.5% CI, two‑look corrected). We release the full evaluation protocol, including measured seed noise and selection‑optimism pricing.
Authors:William Guey, Pierrick Bougault, Wei Zhang, Vitor D. de Moura, José O. Gomes
Abstract:
Emerging AI regulation mandates bias audits of high‑risk systems, and audit scores are beginning to be used to rank models. Both uses assume different audit tools measure the same thing well enough to compare. We test that assumption directly, running ten extrinsic audit instruments over a shared panel of ten frontier models through one pooled inference gateway, first on occupational gender bias, then on age and socioeconomic status. Detection succeeds while ranking fails. Eight of ten tools detect bias with confidence intervals clear of zero; two widely cited direct‑probe benchmarks are saturated because frontier models now answer neutrally. But cross‑tool rank agreement is indistinguishable from chance (Kendall's W=0.07, p=0.83). A positive control with six deliberately weaker models separates two explanations: within‑tool reliability recovers once the panel spans real capability gaps, yet cross‑tool ranking never recovers, which points to the tools measuring different constructs rather than one construct noisily. Even the direction of bias splits by audit format: forced‑choice decision tools mostly over‑correct (toward women, and toward working‑class candidates in 273 of 278 hiring decisions), while free generation and default coreference stay stereotype‑congruent. The pattern replicates on socioeconomic status; an apparent ranking agreement on age dissolves under the paper's own tool‑inclusion rules. The practical message: a single audit can detect bias and estimate its direction within its own operationalization, but no single audit supports ranking one model against another. All raw responses, code, and the analysis that recomputes every reported number from source are available at https://github.com/williamguey/bias‑audit‑agreement.
Authors:Elad David, Max Fomin, Amit LeVi
Abstract:
LLMs handle ordinary typing variation fluently: a typo or missing punctuation leaves both user intent and the model's response substantively unchanged. Yet probes that detect malicious prompts by reading the model's hidden states tell a different story: the same edit rotates the readout vector by 43‑‑56 at the perturbed token, decaying below 15% within ~10 downstream tokens. Stacking ~3 common typos per message cuts a single‑position prompt‑injection probe's TPR@FPR=1% by 12.0pp, a gap recalibration alone cannot close. Multi‑position aggregation cures localized perturbations (<= 0.5 loss) but only attenuates distributed ones, where even attention‑ and max‑based aggregators still drop ~3.8pp. For single‑position probes, we introduce a KV‑cache fork: a short fixed suffix appended after the user message lets the probe read a few tokens downstream of the perturbation, exploiting its rapid spatial decay. This closes 95% of the gap (‑0.6pp residual) ‑‑ an order of magnitude better than perturbation‑augmented training (‑3.7pp). The rotation‑and‑decay geometry replicates on Llama‑3.1‑8B, Qwen3‑8B, and Gemma‑4‑E4B; probe evaluation is on Llama‑3.1‑8B. Code: https://github.com/eladd‑ai/latent‑undertow
Authors:Honglin Guo, Tao Gui, Kun Cai, Haodong Chen, Yicheng Chen, Guanting Dong, Qiming Ge, Yuyang Hu, Zixian Huang, Jiajie Jin, Alexander Lam, Yining Li, Jiahang Lin, Yanjiang Liu, Xinyu Lu, Haijun Lv, Zerun Ma, Junlin Shang, Qisheng Su, Guoqiang Wang, Rui Wang, Zhecan Wang, Hao Xiang, Xinchen Xie, Shuhao Xing, Xiaoyu Xing, Wanghan Xu, Xinyu Yang, Yajie Yang, Chengfeng Zhao, Haoran Zhao, Penghao Zhao, Ruojun Zhou, Yunhua Zhou, Dongsheng Zhu, Yicheng Zou, Qiye Cai, Xinmeng Che, Jiabei Chen, Jiahao Chen, Jiayi Chen, Yujia Chen, Lizhi Cui, Youheng Dai, Xin Deng, Yi Dong, Shihan Dou, Chenya Gu, Xu Guo, Ding Han, Feiyang Hao, Haotan He, Jie Hou, Binze Hu, Zijian Hu, Junhao Huang, Huicheng Jiang, Jiazhen Jiang, Shufan Jiang, Jiahao Kuang, Bowen Lai, Bo Li, Jiaqiang Li, Peng Li, Qilong Li, Zhuoqun Li, Jiaxiang Liu, Shuainan Liu, Tong Liu, Yi Liu, Zhonghang Lu, Jianwen Luo, Yanyi Luo, Huijie Lv, Ningsheng Ma, Houcheng Min, Chengjun Pan, Qiyuan Peng, Xiaoxuan Peng, Jianmin Qian, Jiantao Qiu, Wanying Ren, Huayu Sha, Jifei Shan, Zixin Shang, Bing Shao, Zhuohui Sheng, Jiayang Shi, Yang Shu, Aierpanjiang Simayi, Sirui Song, Yuxiao Song, Zhe Sun, Zhichao Sun, Wenzhe Tan, Wenhui Tian, Zhongbo Tian, Hanchen Wang, Pengbo Wang, Rui Wang, Yiding Wang, Yuhui Wang, Zhiheng Xi, Caijun Xu, Chao Xu, Yongfeng Xu, Xiaolei Yang, Zhixiong Yang, Qian Yao, Shihong Yi, Yuankai Ying, Jia Yu, Dingbo Yuan, Hao Yuan, Junjie Yuan, Bo Zhang, Caixian Zhang, Qiuyinzhe Zhang, Jiyuan Zhao, Ying Zhao, Pujun Zheng, Xiaoxue Zhong, Xiaohao Zhou, Xinyu Zhou, Guanru Zhu, Yulun Zhu, Yaojie Lu, Tao Ji, Hongyu Lin, Yutao Zhu, Pengfei Cao, Guoxiu He, Xianpei Han, Ben He, Zhicheng Dou, Kang Liu, Qi Zhang, Le Sun, Jun Zhao, Ji-Rong Wen, Xuanjing Huang, Yu-Gang Jiang, Bowen Zhou
Abstract:
As AI agents become participants in the development of their successors, they reshape both the production of intelligence and the role of human researchers. We introduce Atria Dawn Preview, a foundation agentic language model designed for scientific research and engineering workflows, with the goal of expanding the frontier of agent productivity in the real world. This model is trained via a Verifiable Experience Pipeline that connects tool‑mediated interactions to executable environments and externally verified outcomes. Across 16 benchmarks spanning real‑world research, engineering, and digital work, Atria Dawn Preview is competitive with frontier agents and achieves the highest reported score on five of them. Beyond standalone performance, we examine the real research‑and‑development process behind this model as a case study of human‑‑AI collaboration, analyzing 769 task records from 56 participants together with agent logs. When asked to evaluate completed tasks under comparable conditions, participants rated about one‑third of completed AI‑assisted tasks as infeasible without AI. More strikingly, agents frequently propose methods and implement revisions, while humans retain most final decisions and guide exploration through judgment and feedback. These observations indicate a shift from task‑level execution to project‑level partnership, with human effort concentrating on what is worth pursuing and how evidence should guide research. Progress toward more autonomous AI research must therefore advance both the capacity for discovery and the capacity for meaningful human oversight, preserving accountable human authority over the risks and direction of continued development.
Authors:Andrew Fleet, Soroush Mehraban, Vida Adeli, Cole Clifford, Babak Taati
Abstract:
Automatic facial rigging across heterogeneous mesh topologies remains challenging because high‑quality expression supervision is often tied to canonical templates, while deformation transfer to arbitrary meshes can introduce geometric artifacts and correspondence errors. We present TopoRig, a topology‑agnostic facial rigging framework that predicts FACS‑conditioned deformations directly on input mesh vertices while preserving the original topology. Starting from the ICT FaceKit expression model, we construct complementary supervision from accurate but template‑biased common‑topology rigs, topology‑diverse but noisier transferred rigs, and targeted image‑based cues for controls poorly captured by geometric transfer. TopoRig combines local surface geometry, landmark‑relative semantic features, global shape context, and FACS controls to predict per‑vertex displacements. We train on 3,496 generated identities using 45 non‑gaze expression controls from the 53‑control ICT FaceKit vocabulary. On held‑out identities and unseen mesh topologies, TopoRig more faithfully reproduces the reference expression space than prior neural facial‑rigging methods, while qualitative results show consistent localized deformations across diverse character geometries. Ablations demonstrate that semantic landmark features and complementary supervision improve cross‑identity and cross‑topology generalization. Overall, TopoRig amortizes heterogeneous and imperfect expression supervision into a single topology‑preserving deformation model.
Authors:Ruihan Yu, Lian Fu, Muyao Niu, Zheng-hui Huang, Yu-Ju Tsai, Sho Kuno, Fengbo Lan, Yonghao Yu, Erwin Wu, Ming-Hsuan Yang, Kaipeng Zhang, Zhixiang Wang
Abstract:
Native 3D generators turn one image into a single mesh. TRELLIS.2 and its peers deliver high‑fidelity non‑watertight geometry with materials, but the output is one fused object, while downstream work such as editing, rigging and simulation operates on part‑level assets. A naive idea is to run a 3D segmentation network on the fused mesh that TRELLIS.2 generates, but such pipelines are slow and bounded by the accuracy of the segmentation. We want a simple way to extend an existing native 3D generator to the part level. But we face a critical problem: the O‑Voxel grid stores one sheet of surface per voxel, so a single volume cannot represent the interface where two parts touch, at any resolution. We introduce a dual‑volume representation to solve this problem and put forward KaiNinja, a part‑level extension of TRELLIS.2 built on a dual‑volume form of its O‑Voxel representation. KaiNinja keeps the generation speed and quality of TRELLIS.2 while extending it to the part level, with no mask or segmenter in the pipeline. Its training data come from sources of many kinds, including CAD models and assets authored by an LLM‑driven agent; to our knowledge it is the first 3D generative model trained on agent‑authored part data. Surprisingly, we also find that whole‑object fidelity improves over the same backbone fine‑tuned on the same dataset. Against part generation pipelines of different paradigms, it lowers whole‑object Chamfer distance by 40% and raises strict part F‑score by 16%.
Authors:Javier Aguilar Martín
Abstract:
We study packings of annuli of a common width, allowing each ring to nest inside the hole of a larger one. The objectives of maximizing contact area and cardinality diverge: area is superadditive in the radius, cardinality is not. Under superincreasing radii, every descending greedy maximizes every positive, strictly increasing, superadditive objective. More strongly, any choice among feasible containers yields the lexicographically maximal feasible set, for containers of arbitrary shape in every dimension. This placement irrelevance holds unconditionally for at most three rings and fails at four in disks and squares; twin instances exclude every universal rule based only on the observable state. Write ρ=\max_i(\sum_j>ir_j)/r_i. The additive model has threshold exactly 1. For disks we prove the exact global threshold τ=φ, with no failure at ρ\leφ, for every finite inventory, even with independent hole radii. The key geometric theorem states that, under golden tail bounds, an entire disk list fits a circular container if and only if its three largest disks fit; this supplies the uniform exchange of parents that the threshold proof needs. The Tribonacci constant T\approx1.83929 remains the exact floor of a rigid subfamily. A dimension‑reduction lemma transfers spherical sharpness results to all dimensions d\ge2, and a separate argument proves the golden threshold for at most five rings in those dimensions. For square pans, a Cartesian confinement criterion gives twins and a family proving τ_\square\le Y\approx1.6845; its optimality is open. For independent holes, the exact universal area guarantee under ρ\leκ<1 is \min(1,κ^‑2‑1), with threshold 1/\sqrt2. The repository has 122 Lean theorems. Euclidean geometry, forest assembly and continuity remain written proofs; numerical checks do not substitute for them.
Authors:Ke Cheng, Xin Xu, Yixiao Chen, Lei Xin, Jianbo Zhao, Fanhu Zeng, Yue Liu, Jun Zhang, Jie Jiang
Abstract:
Hybrid language models can improve capability as well as efficiency, raising the question of how architectural complementarity becomes learned computation. We examine the established induction roles of Carrying predecessor information, Matching a source by content, and Copying its value. How are these position‑sensitive and content‑based computations allocated across heterogeneous layers? We introduce layer‑type‑agnostic paired probes that track Carrying and Matching through a common block‑update interface. In recurrent‑‑global and local‑‑global hybrids, Carrying concentrates in efficient layers and Matching in global receivers. The measured local contribution concentrates on lag one: the token immediately before the historical value. Changing predecessor support through lag‑one masking, convolution removal, or early learning‑rate reduction can relocate Carrying and Matching between stages. Source‑key restoration and fixed‑value selection trace the receiver's dependence on the prepared source. These interventions also change natural‑text recall, with outcomes depending on configuration and target. Varying local windows and induction‑enriched training text changes the early development of functional Carrying and Matching, connecting architectural priors and training evidence to formation timing. Together, the probes and interventions shift the explanatory focus upstream: the organization of Matching follows how Carrying is learned. The token before the value provides a concrete link between a hybrid's architecture, circuit development, and recall. Code is available in https://github.com/ckpassenger/bind‑match‑copy/tree/main.
Authors:Jochen Madler
Abstract:
Word‑level detectors identify unedited AI‑generated text almost perfectly, but the literature documents their brittleness under rewording, and a word‑level score neither characterizes a text nor identifies which AI model wrote it. We ask whether AI‑generated text can be identified one level deeper, from structural signatures: how information is presented, in what order, with what evidence, and in what voice. We replicate StoryScope (Russell et al., 2026), which showed such patterns for AI‑generated fiction, on commercial content: 2,250 pre‑ChatGPT human blog posts from 268 company domains against 11,250 AI mirrors from five frontier models. A 214‑feature instrument, applied by an LLM and validated in a human gold‑annotation session (human‑human kappa 0.928, human‑model 0.946), detects AI posts from its 187 structural features alone at 98.0 macro‑F1 on held‑out companies, unchanged (98.1) when every AI post is reworded by its own model. The signal characterizes and attributes: AI posts share a tidy, self‑announcing shape, 79.3% are attributed to the correct source against a 16.7% chance rate, and human posts occupy rare structural configurations. All effects replicate StoryScope's, consistent in direction and larger in magnitude. We release pipeline, instrument, prompts, code, and aggregate artifacts.
Authors:Junkai Tong, Mingjia Li, Haoran Chen, Yaoyu Jiang, Hanjie Ge, Yixuan Wang, Hong Qian
Abstract:
Automatic Item Generation (AIG) is pivotal for personalized education, yet guaranteeing the pedagogical value of generated items remains a bottleneck. Existing Item Quality Assessment (IQA) methods typically rely on unscalable manual reviews or shallow stem‑based metrics, failing to capture the reasoning process required for mathematical problem‑solving. To bridge this gap, this paper proposes Process‑based Item Quality Assessment (ProIQA), a process‑aware framework for fine‑grained quality assessment of math items. We first formulate IQA across three heterogeneous dimensions, including knowledge concepts, difficulty, and disciplinary competencies, under a unified process‑aware perspective. Based on this formulation, we construct a process‑enhanced IQA resource by augmenting original item data with structured reasoning trees derived from raw solutions. Technically, ProIQA leverages Large Language Modelsto construct hierarchical reasoning trees and employs Graph Neural Networks (GNN) to encode their topological dependencies and procedural semantics. The resulting solving representation is fused with stem semantics through a dual‑view (``Stem + Solving'') architecture, enabling comprehensive assessment across learning objectives. Extensive experiments on K12 mathematical datasets show that ProIQA effectively captures process‑oriented features, offering a scalable data‑driven solution for evaluating AIG outputs in intelligent education systems.
Authors:Jianxiang Ma, Xiaocui Yang, Daling Wang, Yuesong Hou, Mingfu Zhang, Yichen Gao, Junzhao Huang
Abstract:
LLMs have been able to generate fluent prose, but high‑quality stories also require coordinated decisions about plot, character, and language across planning, drafting, and revision. We formulate Vibe Narrativizing as turning natural‑language writing requirements into a finished story. MUSE, a Theory‑Harnessed Story Engine, addresses two bottlenecks: rule quality and sustained rule realization. Story theory supplies the rules, and a practical agent harness puts them to work. Knowledge engineering organizes Robert McKee's theory through rule atomization, semantic consolidation, mechanism abstraction, a single source of truth, and layered disclosure; typical examples clarify judgments that depend on context and aesthetic purpose. The harness preserves story decisions in intermediate deliverables across design, character performance, scene composition, and revision. Context engineering supplies each role with relevant guidance and decisions; a masterwork corpus provides inspiration and prose references. A worked example follows a requested object from its thematic role to climactic actions. Across four base models, MUSE improves WritingBench by 1.1 to 6.2 points over zero‑shot generation; it is the only multi‑stage system in our comparison to do so. It also raises LongStoryEval by more than ten points on three of the four models. ConStory‑Bench consistency error density remains in the low single digits for all four models, below every reproduced story‑system baseline on three of the four models. Ablations locate the largest quality contribution in structural design, voice‑specific effects in the character path, and further gains in revision.
Authors:Mingqian Yu, Wenpeng Zhang, Shaobo Cui, Peilin Zhao
Abstract:
Looped Transformers have recently demonstrated strong performance in both reasoning and language tasks by reusing a shared set of parameters across multiple iterations, achieving parameter efficiency without sacrificing representational power. Besides, looped Transformers perform inference directly in the latent space (latent reasoning) to reduce the number of tokens consumed during inference, thereby achieving improved sample efficiency. However, these models typically apply a fixed recursion depth uniformly to every token, leading to suboptimal compute allocation and leaving significant efficiency gains on the table. In this work, we propose dynamic token‑choice routing for looped transformers, enabling each token to adaptively determine its own number of loop iterations based on its hidden state, which can improve the token generation accuracy. Moreover, we further introduce recursion‑wise KV cache, which maintains an independent key‑value cache for each recursion loop, this design ensures that tokens at different depths only attend to their corresponding cached states, effectively enabling faster autoregressive decoding. Extensive experiments show that T‑LoopFormer achieves robust performance on language modeling and zero‑shot reasoning tasks and our model can reach the lowest decoding latency, which validate the effectiveness of token‑choice router and recursion‑wise KV cache. Code is available at https://github.com/YuMingQian1234/T‑LoopFormer
Authors:Dylan Waldner, Yiannis Kantaros, Guido Governatori, Risto Miikkulainen, Amir Banifatemi
Abstract:
As robotic systems grow more general, legal norms are needed to integrate them into society. This paper extends the isomorphism problem of aligning legal source texts with their encodings, and measures two key challenges to robot normative control: (1) the grounding isomorphism gap, where perception error grounds false atoms for legal reasoning, and (2) the ontological isomorphism gap, where one legal conclusion admits many faithful translations into planning constraints. The paper introduces a legal planning stack that employs Defeasible Deontic Logic (DDL) to constrain a motion planner. The stack leverages learned world models to plan and to provide legal context, enabling ex ante governance that intervenes before an illegal action is executed. It was deployed on a simulated robot arm pushing a cube across a 3x3 grid. The findings were (1) the legislated agent abided substantially more often than the non‑legislated one, and modeling perception uncertainty lifted abidance even further, (2) the legal reasoning ran efficiently at runtime and its verdicts were auditable, and (3) the stack adapted to exogenous signals and endogenous rule changes. Both gaps were measured: (4) world model and probe error corrupted the factual input for the DDL reasoner, and (5) a single law admitted several faithful metric interpretations yielding drastically different abidance. Thus, ex ante legislation functions as intended, and closing these gaps with a standardized mapping from the law to runtime constraints and improved fact grounding from perception will yield robust laws that align robot behavior with society's norms. Project page: https://dylanwaldner‑cail.github.io/Legislated‑Planner/.
Authors:Shuo Zhang, Xin Su, Wei Wang, Jun Liu, Xinrui Zeng, Yongsen Chen, Chenjie Wang, Guibo Zhu, Jinqiao Wang, Bin Luo, Liangpei Zhang
Abstract:
We study relative position encoding for multi‑view vision Transformers under camera heterogeneity, including varying fields of view (FoVs) or projection models. Existing rotary relative position encodings commonly use image‑plane positional coordinates, producing projection‑dependent relative phases and inconsistent geometric cues for cross‑projection attention. We introduce G‑ray, a ray‑level relative position encoding whose rotary phases are parameterized by camera‑local ray angles. The same camera‑local ray pair induces the same relative phase across projections, providing projection‑invariant positional consistency. G‑ray can be used directly or integrated with existing encodings, retaining complementary geometric cues without additional learned parameters. We validate G‑ray in three host encodings, RoPE, GTA, and RayRoPE, across 3D reconstruction and novel‑view synthesis (NVS). Across three heterogeneous 3D reconstruction benchmarks at 50 views, G‑ray leads all six averaged metrics and reduces mean pointmap relative error by 45.8% over MapAnything, with calibration supplied to both. Trained exclusively on homogeneous pinhole images, the 3D reconstruction model handles mixed pinhole and non‑pinhole inputs without retraining and remains competitive on homogeneous pinhole 3D reconstruction protocols. For NVS, GTA and RayRoPE improve with G‑ray under joint viewpoint and FoV variation. The project's webpage is available at https://g‑ray‑project.github.io/.
Authors:Chunran Zhang, Tianrui Li
Abstract:
Web graphics travel with content across pages and themes, where changing backgrounds can require recoloring and maintenance. Opacity already makes a fixed object's appearance depend on its background, yet is usually understood only as how much the object obscures it. In fact, opacity controls the scaling of the object‑background color difference; transparency is only one effect of this relationship. Zero places the output at the background and one at the source color, but difference scaling need not stop at either position. We retain the compositing expression and extend the coefficient domain from [0,1] to the real numbers: negative values reverse the difference, whereas values above one expand it in the same direction. We focus on same‑direction expansion for reusing Web graphics across backgrounds. Each object carries a fixed source color and coefficient, while the actual background determines the enhancement direction. Background‑adaptive contrast enhancement thus becomes part of the object's compositing properties, reducing the design and maintenance of separate color variants. The implementation reuses the original equation without increasing the per‑pixel arithmetic operation count within the same pipeline. Enumerating all 8‑bit sRGB source colors on 16 predefined light and dark canvases, a fixed α=1.1 increases the contrast ratio in 99.8145% of combinations. Without changing source colors, 4.8346% of all combinations newly reach the 3:1 contrast threshold. Output validation and timing across three browsers demonstrate implementation in the same WebGL pipeline, with no sustained additional runtime observed.
Authors:Zilai Li
Abstract:
Semantic watermarks for diffusion models embed ownership information into the generative process while preserving perceptual quality, but Gaussian‑Shading extraction conventionally requires multi‑step diffusion inversion to recover the initial noise. Recent one‑step methods show that this cost can be reduced substantially. We study this problem through extended flow matching and conditional regression. The key observation is that, near the high‑SNR image endpoint, recovering a useful noise statistic given by the first‑step output of the extended flow matching in the high‑SNR regime is much simpler than reconstructing the full inverse trajectory, and Gaussian Shading only requires the recovered latent to remain in the correct watermark decision region. Based on this observation, we propose a lightweight, prompt‑free extractor that decomposes endpoint recovery into an image‑like anchor and a noise‑oriented residual, which increases the capability of the model to utilize GPU parallel computation. The resulting method avoids iterative inversion and repeated evaluation of a diffusion‑scale U‑Net, providing an efficient one‑step extraction pipeline with a concise theoretical interpretation. The computational cost of extracting noise is lower than that of both OSI and FARI. The github repo is there: https://github.com/TheLovesOfLadyPurple/RAIN‑lightweight‑NN‑for‑one‑step‑semantic‑watermark‑extraction
Authors:Haining Wang
Abstract:
On 1 July 2025 the National Institutes of Health began requiring that funded articles be publicly available in PubMed Central on the day they are published, ending the 12‑month embargo that had applied since 2008. Comparing NIH‑supported articles with articles in the same journals and months that reported no US federal support, before and after the policy, the share available in PubMed Central within a week of publication rose by 5.6 percentage points more for NIH‑supported articles (95% CI 1.9 to 9.6). The change was concentrated in journals outside the Directory of Open Access Journals, where the share of NIH‑supported articles in PubMed Central within a week doubled from 11% to 22%, with no differential change in DOAJ‑listed journals. A pre‑policy comparison showed no difference. For articles published in early 2026, the policy had made NIH‑supported research available sooner, and most NIH‑supported articles in journals outside the Directory were still not in PubMed Central a week after publication.
Authors:Jiheng Li
Abstract:
This work presents POLARIS, a training‑free audio fingerprinting system that selects landmarks from a locally normalized saliency field and groups them into sparse fingerprints using Delaunay triangulation. To deal with query distortion, POLARIS adds fingerprints from two‑hop Delaunay neighborhoods only at query time, without enlarging the reference index. An adaptive configuration applies this expansion only when the original fingerprints do not produce a confident match. We evaluate POLARIS on synthetic distortions from the public PEX Hard Medium benchmark, excluding queries with pitch or tempo shifts, and on a new benchmark of real re‑recorded music. POLARIS achieves the best performance among the evaluated training‑free methods on both benchmarks. On the real recordings, its adaptive configuration also outperforms the neural NMFP baseline with a comparable measured query time and a smaller logical reference payload. Code, dataset, and instructions for reproducing all experiments are available at https://github.com/JihengLi/POLARIS.git.
Authors:Kareem Khattab, Omar Khattab, Mohamed Ibrahem
Abstract:
We introduce Crypto Accounting Bench (CAB), a benchmark for assessing whether frontier and open‑weight language models can reconstruct the complete journal entry that an organization actually posted for a crypto‑asset transaction. CAB contains 118 evaluation tasks drawn from 7 pseudonymized organizations. Each task combines transaction mechanics, asset quantities and base‑currency values, wallet and legal‑entity context, counterparty evidence, related transaction legs, recurrence, tax‑lot evidence, and the organization's complete chart of accounts. The target is a balanced structured entry with every required account, side, amount, currency, and full‑precision asset quantity. We evaluate 12 models spanning proprietary frontier systems and open‑weight releases over 3 independent attempts per task, producing 4,248 trajectories. We report 3 metrics: Mean Score, Best@3, and Pass@3. Pass@3 is the fraction of tasks with at least 1 of 3 attempts that satisfies every rubric criterion and required gate. The leading model reaches 77.43% Mean Score, while the best Pass@3 is 56.78%. Deterministic diagnostics, read from each task's best of 3 attempts and macro‑averaged across the 12 models, show higher base‑amount agreement (97.8%) than deciding‑account accuracy (56.3%). Together with the failure analysis, these results identify account selection and complete‑entry composition as the main remaining challenges on CAB.
Authors:Afshin Khadangi
Abstract:
This paper reports experiments across six frontier model types from OpenAI, Anthropic, xAI, and Google DeepMind. Ten independent sessions per model type used the same three stage prompt sequence, progressing from architectural preference to a full ASCII backbone. Under the school audience framing, responses repeatedly converged on a shared architectural pattern built around persistent latent state, adaptive computation, memory, specialist routing, verification, stopping control, and delayed decoding. Most runs remained close to this common structure, while a small number developed markedly greater engineering specificity. The audience framing appears to be an important condition of this effect. In additional control runs that removed the school framing while retaining the architectural request, responses became substantially more heterogeneous and failed to reproduce the same stable motif convergence. One observation is particularly striking. GPT‑5.6 Sol produced an unusually elaborate successor architecture whose organization closely overlaps with the architecture independently sketched by GPT‑6 Astra. Because the prompts explicitly ask each model to imagine an architectural future, this resemblance raises a testable question: whether the overlap reflects exposure to related architectural concepts, a shared learned design prior, or independent convergence toward similar computational principles. The paper uses the term epistemic jailbreak for the accompanying loss of discipline in technical provenance as requested specificity increases. The experiments establish a repeatable behavioral pattern and do not authenticate proprietary implementation claims. What we leave to the community is a harder question: are these models independently imagining the same architectural future, or do such motifs somehow propagate between model families?
Authors:Mashood M. Mohsan, Muhayy Ud Din, Binzhao Xu, Ahmad Abubakar, Irfan Hussain
Abstract:
Robots need touch to manipulate objects safely and reliably, as many properties, such as softness, texture, and contact stability, are hard to infer from vision alone. However, vision‑based tactile sensors yield different observations of the same material due to variations in optics, elastomer properties, and illumination, leading to poor generalization when trained on a single or multiple sensors. We propose a language‑guided distillation framework for learning sensor‑robust tactile representations. Language encodes high‑level semantic properties of touch (e.g., rough, soft, slippery) that remain invariant across sensing hardware, providing a natural sensor‑agnostic supervisory signal. We construct a 39K‑sample touch‑language dataset with human‑annotated material labels and train a tactile encoder to align sensor‑specific tactile images with language embeddings in a shared semantic space. We evaluate our approach for few‑shot learning and cross‑sensor transfer and benchmark it on six existing tactile datasets. Our method achieves 95% accuracy in the 100‑shot setting, improves cross‑sensor transfer by an average of 13.3% accuracy, and yields up to 19% accuracy gains across six existing tactile datasets. These results demonstrate that language‑guided distillation enables scalable and hardware‑agnostic tactile representation learning. Code and dataset are available at https://mashood3624.github.io/Language_Tactile/
Authors:Jiangang Chen
Abstract:
As LLM conversations grow to hundreds of turns, full‑context injection incurs O(N^2) cumulative token costs, while lossy summarization or hard truncation irreversibly discards historical state. We propose Pull, a session router that maintains an addressable metadata directory via a local, deterministic Purifier (zero LLM calls, millisecond‑level latency). At query time, the LLM lazily materializes only the turns it needs; unmaterialized turns remain accessible but collapsed. Unlike irreversible compression, Pull's materialization is reversible; subsequent queries can expand any collapsed turn. On LoCoEval (128 conversations, 12,780 turns), Pull reduces per‑query context tokens (Phase 2) by 75.1 percent on single‑hop tasks with equivalent quality (Δ= ‑0.002, n.s.) and by 72.0 percent on multi‑hop tasks with no quality loss (Δ= +0.017). A controlled routing benchmark (7,831 queries x 10 methods) shows that entity lifecycle tracking is empirically a prerequisite for distance‑independent routing. On BEAM 1M (14 conversations, 263 questions), Pull improves F1 by +55.2 percent over a truncation baseline.
Authors:Chenxin Diao, Nataliya Stepanova, Emily Allaway
Abstract:
Generalisations are common in scientific communication, even though they are semantically ambiguous. An automated method is needed to identify and categorise claims according to their level of generalisation, in order help detect an over‑reliance on generalisations and possible misrepresentations of scientific findings. We introduce a comprehensive taxonomy of generalisations in the scientific domain, NLPGenX, which labels claims according to their level of generality and framing within the text. We operationalise this taxonomy with an LLM‑powered framework, NLPGenA, that automatically classifies sentences from scientific articles into 5 different generalisation classes. We validate our framework with human annotators and use the framework to construct a large‑scale dataset of NLP papers annotated according to generality, with auxiliary labels for hedging and vague descriptors (NLPGens). We use NLPGens to analyse the use of generalisations in NLP papers across multiple venues and subdomains, and to examine associations with citation counts, hedging, and vague descriptors.
Authors:Burak Agachan, Max van Duijn, Amirhossein Zohrehvand
Abstract:
Hierarchical orchestration, in which a Manager agent reviews worker output and can send it back for revision, is the default coordination pattern in production multi‑agent LLM frameworks. Classical organizational theory predicts that the authority link speeds convergence on decisive output; work on sycophancy and Degeneration‑of‑Thought predicts that authoritative critique makes LLM output worse. Prior comparisons vary whole frameworks on tasks with checkable answers, leaving the authority link untested on open‑ended work. We present a paired experiment that holds five LLM agents, their roles, prompts, tools, models, and data fixed and varies one link: whether the Manager may reject a worker's output and oblige a revision. Across 43 paired products and 86 runs of a business‑intelligence reporting task, a five‑model judge panel and a deterministic specification check score every report. The flat organization scores higher on Utility (d = 0.42, p = 0.009) and on Writing Clarity (d = 0.34, p = 0.030); the classical prediction fails. The reports are the same length, but hierarchical reports hedge 53% more, each revision loop is associated with a 0.14‑point drop in Writing Clarity, and the hierarchical Writer's first draft is indistinguishable from the flat report: the gap opens inside the revision loop. Specification accuracy is at ceiling in both organizations, and the supervisory tier costs 51.5% more tokens for no quality gain. A supervisor pays for itself when it can verify and becomes a liability when it can only opine.
Authors:Orion Reblitz-Richardson
Abstract:
Alignment applied after pretraining is shallow in a measurable way: a single direction in a model's residual stream can be edited out, and the model stops refusing harmful requests. That fact says how easily refusal can be removed, not what the refusal decision was reading in the first place. We ask what it reads, and we separate that from what the model comprehends. Across four open‑weight models spanning three families, moral comprehension is native to pretraining: a low‑rank moral subspace crystallizes during pretraining, and alignment rotates it once without rebuilding it. The refusal gate, in contrast, is a fresh post‑training construction with only a weak pretraining precursor, written into a narrow control‑token channel where the refusal decision is orthogonal to the moral‑judgment decision. The central result is causal and comes from one model, OLMo‑3. A nested interchange rank sweep patches successively larger slices of the moral subspace between matched requests and reads how much of refusal's response transfers: as the basis widens, moral judgment keeps reading more of it, while refusal levels off at the level of a single harm direction, and about three‑quarters of refusal's causal input lies outside the moral subspace altogether. Refusal reads the harm percept, not the moral content that judgment reads on the same patches. The picture is not uniform across families. Llama reads broad moral content; Qwen reads beyond the single harm cue but is unresolved at our sample size; GPT‑OSS reads harm, and its refusals can be argued in either direction by its own reasoning trace. Where refusal reads only a low‑rank slice and routes around the bulk of what the model knows, a rank‑one edit removes it. Whether widening what refusal reads would also deepen the behavior is the open question this raises.
Authors:Orion Reblitz-Richardson
Abstract:
Causal claims about large language model (LLM) internals rest on measurements. Those might include a projection, a cosine, an ablation delta, or an interchange patch among others. These measurements fail in specific, diagnosable ways that return a plausible number instead of an error, so a broken instrument can easily read as a finding. A covariance‑matched null can saturate until every direction looks typical, a per‑head attribution can overshoot the true residual write threefold on reordered‑normalization architectures, an interchange patch can go sign‑chaotic because its outcome is pinned at a ceiling, or a read‑from verdict can be an artifact of measuring past the layer where the model already decided. This note documents six such failures from a causal interpretability program on refusal and moral representation, spanning several papers and a four‑model open‑weight panel; each mode is established on one or two of the four. For each we give the tell that catches it and a protocol keyed to a detectable trigger (reordered normalization, massive activations, a low‑dimensional decision channel), so we and readers can check whether a given setup is exposed. The discipline reduces to four moves: calibrate against a positive‑control ladder, certify with an orthogonal cell, compute power before spending compute, and state every read‑from verdict at a depth referenced to the model's commitment. The evidence is four architectures across three families within a single program; external replication across programs is future work.
Authors:Yutong Gu, Yingxi Xie, Kejin Huang, Jian Ning, Hanzhe Liang, Linlin Shen, Jinbao Wang
Abstract:
Low‑cost and low‑resolution sensors used in edge deployments can produce test point clouds that are substantially sparser than the normal training data. This train‑test sampling‑resolution gap changes the local geometry available to a 3D anomaly detector. We propose PC^2‑AD, a point cloud upsampling framework that compensates sparse test inputs before downstream detection. Target Domain Candidate Generation (TCG) adapts a pretrained upsampler to normal training geometry and generates a dense candidate pool. Geometry‑Aware Candidate Filtering (GACF) selects candidates according to geometric spacing and spatial coverage. Normality‑Preserving Point Compensation (NPPC) refines the selection by comparing candidate normality scores with those of their input anchors. The selected points are combined with the unchanged input points and processed by the existing detector. Experiments with six detectors on two Anomaly‑ShapeNet settings and Real3D‑AD show improvements in the mean of object‑level and point‑level AUROC for all six detectors in each Anomaly‑ShapeNet setting and four on Real3D‑AD. These results support point cloud compensation as an input‑level approach to improving 3D anomaly detection under low‑resolution sensing conditions. Code is publicly available at https://github.com/gyutong406‑commits/PC2‑AD.
Authors:Yecheng Wu, Song Han, Han Cai
Abstract:
A core goal of efficient reasoning is to improve the accuracy‑efficiency frontier. However, jointly improving reasoning accuracy and inference efficiency can be challenging, as the two objectives can favor different reasoning behaviors. Independently post‑trained models already offer distinct strengths in accuracy and efficiency. We introduce Lightning Weave, a post‑training framework that extracts and composes these independently learned capabilities in a single student through on‑policy distillation. Each acquired capability is represented by the policy shift from the model before post‑training to the resulting specialist. Lightning Weave combines aligned log‑ratio shifts at shared student token states and uses Tilted‑Target DOPD to convert the cached signals into a stable learning target. Each anchor pair scores the cached trajectories once, enabling subsequent student training without serving multiple live anchor models concurrently. Across diverse student models and benchmarks in mathematics and code, Lightning Weave substantially improves upon the base students and achieves a state‑of‑the‑art accuracy‑efficiency frontier. On Qwen3.5‑4B, it raises HMMT 2025 accuracy from 59.2% to 64.0% with 10.7% fewer response tokens, and LiveCodeBench v5 accuracy from 41.7% to 54.2% with 9.6% fewer response tokens. Adjusting the relative strengths of the anchor signals yields a strong empirical accuracy‑efficiency Pareto frontier. These results establish Lightning Weave as a new practical route to efficient reasoning through capability composition. Code is released at https://github.com/jet‑ai‑projects/Lightning‑Weave.
Authors:Thanh-Dung Le, Vu Nguyen Ha, Ti Ti Nguyen, Symeon Chatzinotas
Abstract:
Onboard satellites must restore a channel‑degraded image on a few watts, using neuromorphic accelerators (e.g., BrainChip Akida, Intel Loihi‑2) that support no softmax or attention. We ask which encoder restores best under that constraint and introduce LIMODENet (LinearMix‑ODENet), a 0.69M softmax‑/QKV‑free backbone whose residual stages read as ODE discretizations and which is empirically information‑preserving (probe accuracy rises 79.9% ‑> 98.4% from stem to head). At iso‑parameters it restores 1 dB DVB‑S2X‑degraded EuroSAT better than a CNN autoencoder (+1.75 dB PSNR) and a skip‑connection U‑Net (+1.07 dB), three seeds, non‑overlapping. Unconstrained modern restorers (NAFNet, Restormer) win on fidelity; we decompose that gap: spiking‑legal additive skips recover about half, and the rest traces to attention and channel gating. LIMODENet then converts end‑to‑end to a spiking network with zero blocked operations, versus 22‑24 for the competitors: not the best restorer available, but the best verified deployable within a real power budget.
Authors:Konrad Furmańczyk, Kacper Paczutkowski
Abstract:
This study addresses the PU classification problem under violations of the SCAR assumption. We investigate logistic regression‑based approaches, namely the cluster method and its extensions with strict and non‑strict Lasso regularization. The primary contribution of this work is the integration of the SMOTE technique to alleviate class imbalance and systematically assess its impact on the performance of the considered algorithms. SMOTE is first applied to rebalance the training dataset. Next, cleaning labels are derived via 2‑means clustering. Logistic regression is then trained on the cleaned data, where identified positive instances are augmented with additional true positives and the remaining observations are treated as negative. The experimental evaluation is conducted on 13 real benchmark datasets and one synthetic dataset. For comparison, we include the naive approach and the Spy‑EM method. The results demonstrate that incorporating SMOTE improves classification performance when the SCAR condition is violated and indicate moderate robustness of the LassoJoint method in this setting.
Authors:Gang Ma, Senjie Hu, Junjie Liu, Chao Wang, Hui Wei
Abstract:
LiDAR‑‑4‑D radar fusion combines accurate spatial geometry with motion and reflectivity cues from radar, offering a promising solution for 3‑D object detection in complex driving environments. However, sparse radar observations and differences in spatial sampling between the two modalities complicate reliable cross‑modal complementation. Moreover, the relative importance of modalities and feature scales varies across spatial regions, making adaptive fusion challenging. To address these challenges, we propose ESAFusion, an evidence‑aware and scale‑adaptive framework that combines local geometric complementation with multiscale adaptive interaction. Specifically, we introduce an Evidence‑Aware Radar Selection (ERS) module to suppress radar clutter using motion and observation‑quality evidence while retaining foreground confidence for subsequent fusion. Then, the Pillar‑Level Complementary Encoder (PCE) improves cross‑modal complementation under mismatched spatial sampling using local geometric support from neighboring LiDAR pillars. We further design an Intra‑ and Inter‑Scale Adaptive Fusion (ISAF) module to adaptively adjust the contributions of different modalities and feature scales in bird's‑eye‑view (BEV) space. Extensive experiments on the View‑of‑Delft (VoD) dataset show that ESAFusion achieves the highest mean average precision (mAP) among the compared methods, reaching 74.60% in the Entire Annotated Area and 88.89% in the Driving Corridor. It also attains the highest average precision (AP) for Cyclist among these methods in both regions while running at 19.23 FPS. Evaluations on VoD‑Fog further demonstrate robustness under progressively degraded LiDAR observations. The source code will be made publicly available at https://github.com/SenJieHu549/ESAFusion.
Authors:Zhibin Jiao, Xiangjing An
Abstract:
Deep learning architectures remain rigidly built upon traditional fully connected layers. While networks scale up, few challenge this foundational root. In this work, we reshape this paradigm by transforming the core synapse weight matrix from static, discrete parameters into a differentiable, continuous field governed by spherical harmonics functions. We introduce the Implicit Spherical Harmonics Weight Field Routing Neural Network (SH‑WRNN), which constrains weight matrices within a continuous parametric field instead of optimizing millions of localized discrete weights. When retrieving the weight matrix of the current layer, connection parameters are localized using latitude and longitude on a rectangular plane mapped from the continuous field. The latitudinal coordinate is specified by activated neurons from the previous layer, while the longitudinal coordinate is determined by keys generated from previous layer activations via matrix multiplication. By evaluating intersections on this map, the network dynamically extracts its connection weights on‑the‑fly. Empirical validation on MNIST demonstrates that under compact configurations of (32, 10, 10) and (32, 3, 10), SH‑WRNN achieves robust accuracies of 91.05% and 81.54% within a single training epoch. Furthermore, we propose an asymmetric Surface Baking scheme. Upon convergence, the continuous weight field is baked once into a static parametric surface. By eliminating analytical spherical harmonics calculations during inference and reducing dynamic matrix extraction to high‑speed localized memory slicing, this scheme achieves asymmetric algorithmic acceleration with negligible accuracy degradation. This paradigm shift bypasses GPU memory‑bandwidth monopolies, opening a novel path to reshape the advantages of CPU computing. Code is available at https://github.com/jzb1111/SphericalHarmonyRoutedNeuralNetWork.
Authors:Sebastian Buschjäger, Michael Frichert, Daniel Kuhe, Jian-Jia Chen
Abstract:
Multichannel time‑series classification commonly assumes synchronized sensor streams, although latency, clock drift, and preprocessing can introduce relative delays during data collection or after deployment. Existing synchronization solutions are often hardware‑specific and difficult to apply retrospectively. Consequently, synchronization problems may remain undetected while classification performance is suboptimal. We introduce a classifier‑ and label‑free diagnostic based on minimum description length (MDL). Our method applies candidate temporal shifts to sensor groups and measures how efficiently one group can be encoded through a representation of the remaining channels. An increased codelength indicates that the shift destroys shared temporal structure, whereas the minimum identifies the alignment most strongly supported by the data. Unlike learned synchronization methods, the diagnostic requires neither retraining nor a trusted aligned reference and can therefore test both training and deployment data for misalignments. Experiments on two controlled synthetic tasks and nine real‑world datasets show that the metric exposes alignment structure and can recover accuracy under induced deployment drift. A whole‑dataset audit further identifies stable nonzero MDL optima in established benchmarks including FordChallenge, Opportunity, PAMAP2, and UCIActivity, revealing potential systematic offsets that conventional model evaluation does not expose. Our method thus provides a general‑purpose tool for detecting, understanding, and correcting temporal misalignment throughout the time‑series learning pipeline. Our code is available under https://github.com/sbuschjaeger/mdl‑temporal‑misalignment.
Authors:Dmitry Kuklev
Abstract:
Autonomous agents that author building information models need more than access to a host API. They need a representation of what they intended, what a compiler decided on their behalf, what was refused, what was observed after execution and what remains unknown. We present KIR, a typed intermediate representation in which a building is authored as a program held in a versioned repository and lowered to host applications as build targets. KIR is organised around seven ways in which a generator writing into a stateful, partially observable host goes silently wrong, and gives each a representation in data: ambiguous selectors become typed refusals with candidates; defaults keep their provenance; obligations that will not be checked are named before execution; vacuous witnesses are rejected statically; a lost transaction response becomes the state UNCONFIRMED with a verify‑before‑retry rule; the reverse path obeys a census invariant; and decisions are bound by digest to the state they were made against. On a pinned snapshot with 83 operation contracts and Revit as the only backend, offline experiments refuse 29 of 42 stress‑test programs with diagnostic codes and no uncaught exception, name 38 of 377 witness obligations as unwitnessable, admit 31 of 100 combinations of execution, witness and acceptance states under seven stated invariants, and find no vacuous witness in 219 certificate runs; a 60‑storey tower is 11,263 characters as KIR against 3,709,235 characters of emitted C#. Native Revit runs are reported from project records and kept separate from reproduced results. A controlled comparison with agents that write host code directly is specified but not yet executed; it is the principal open question.
Authors:Sushan Adhikari
Abstract:
Teaching abstract theoretical computer science (TCS) concepts such as algorithm analysis and complexity theory is challenging because students must handle formal proofs and asymptotic reasoning that conventional resources rarely explain in an adaptive, on‑demand way. We present AlgoRAG, a specialized Retrieval‑Augmented Generation (RAG) system that couples a large language model (LLM) with a curated, domain‑specific knowledge base to address these challenges. The knowledge base integrates authoritative textbooks, 847 lecture slides, 312 practice problems with solutions, 156 worked proof templates, and 89 complexity worksheets. AlgoRAG incorporates domain‑specific optimizations including mathematical entity recognition, notation‑aware retrieval, and pedagogical re‑ranking. We evaluate AlgoRAG on 179 curated exam‑style questions spanning asymptotic analysis, recurrence relations, dynamic programming, graph algorithms, NP‑completeness, sorting, and divide‑and‑conquer. The system achieves a 100% success rate with a mean response time of 38.0 seconds. While BLEU‑4 scores are zero ‑‑ a known limitation of n‑gram matching on mathematical proofs where equivalent reasoning may use entirely different notation ‑‑ AlgoRAG attains ROUGE‑1 F1 of 0.0963, ROUGE‑L F1 of 0.0683, and a pedagogical quality score of 0.7620, indicating that responses are well‑structured and didactically sound even when surface wording diverges from reference answers. Performance is especially strong on NP‑completeness (ROUGE‑1 F1 = 0.1285, pedagogical quality = 0.7643) and graph algorithms (ROUGE‑1 F1 = 0.1023, pedagogical quality = 0.8086). These results support the conclusion that RAG is an effective architecture for personalized theoretical‑CS instruction, providing correct, context‑rich explanations even for highly abstract topics.
Authors:Ulugbek Shernazarov, Charitha Ruwansiri Weerakon Basnayake, Abdelkhaleq El Jarjini, Noel Crespi, Praboda Rajapaksha
Abstract:
Multi‑agent LLM systems combine multiple inference calls, but prior work often confounds how calls are connected with how they are diversified. We study these factors independently: inference topology and source of inter‑agent diversity. In a controlled 2 × 3 matrix, we cross parallel aggregation and sequential refinement with stochastic sampling, role prompting, and learned QLoRA specialization, under a fixed three‑call budget and output protocol within each backbone. Using Qwen2.5‑14B‑Instruct and Llama‑3.1‑8B‑Instruct, we evaluate all six configurations on multilingual low‑resource emotion detection across nine languages. Parallel learned specialization is strongest on Qwen at 52.83 Macro‑F1 and reaches 52.94 on Llama. On Qwen it also exceeds same‑backbone zero‑shot, few‑shot, CoT, and seven‑call self‑consistency baselines. The preferred topology depends on diversity source: sequential refinement helps stochastic and prompted settings, while the learned Width advantage shrinks from 2.83 points on Qwen to 0.17 on Llama. Depth‑wise analysis suggests that later learned specialists can overwrite correct early predictions, although the aggregate effect is backbone‑dependent. Overall, how agents are differentiated produces larger performance shifts than topology, which should be evaluated jointly with specialization.
Authors:Abdalwhab Bakheet Mohamed Abdalwhab, Giovanni Beltrame, David St-Onge
Abstract:
Reinforcement learning (RL) has shown considerable promise for robotic decision‑making, yet deploying multi‑agent RL (MARL) on physical multi‑robot systems in industrial environments remains challenging. This paper investigates the real‑world applicability of decentralized MARL for multi‑robot multi‑machine tending. We propose Feature‑fusion Multi‑Agent Proximal Policy Optimization (FMAPPO), which fuses 2D LiDAR measurements with task‑specific state information to enable safe decentralized multi‑robot task assignment and navigation. A complete simulation‑to‑reality pipeline was developed using high‑fidelity robotic simulation and ROS2 and deployed on physical mobile‑manipulator platforms operating under realistic real‑world conditions, with the robotic arms disabled during the experiments. We further investigate the sensitivity of the learned policy to command update frequency, an important consideration for real‑world deployment. Comparative evaluation in simulation demonstrated that FMAPPO significantly outperformed state‑of‑the‑art baselines with a large effect size, achieving improvements of 106% and 21% in parts delivery and 48% and 11% in parts collection over MAPPO and SMAPPO, respectively. FMAPPO also increased machine utilization by 31 and 10 percentage points, respectively, while reducing collisions by 18% and 15% and increasing the safety score by 14 and 6 percentage points compared with MAPPO and SMAPPO, respectively. Furthermore, real‑world experiments demonstrated that the learned decentralized policies can coordinate multiple robots to service multiple machines while maintaining safe operation under real‑world sensing and control constraints. Videos of the real‑world experiment are available online https://anonymouspapers123.github.io/FMAPPO/.
Authors:Quratulain Nayeem, Fahmina Taranum, Mohammed Mudassir Uddin
Abstract:
General‑purpose object detectors lose accuracy on UAV footage, where targets span only a handful of pixels and onboard compute is limited. Prior work composes independently‑validated architectural techniques into one detector, assuming gains reported in isolation transfer once combined. We stress‑test that assumption directly. LAF‑YOLOv10 integrates four techniques into YOLOv10n: a Partial Convolution C2f (PC‑C2f) backbone block, an Attention‑Guided Feature Pyramid Network (AG‑FPN), a P2 detection head replacing the large‑object P5 head, and Wise‑IoU v3 regression, asking whether their combined effect matches what each contributes alone. We train LAF‑YOLOv10 three times (seeds 42, 123, 256) on VisDrone‑DET2019, benchmark against unmodified YOLOv10n, and use TIDE error decomposition, per‑category breakdown, per‑component ablation, attention/loss comparisons, zero‑shot transfer to UAVDT, and held‑out/test‑dev evaluation to localize where the combination succeeds or fails. Composability does not hold here. LAF‑YOLOv10 reaches 24.0+/‑0.4% mAP@0.5 at 2.14M parameters, 7.8 points below YOLOv10n (31.8%), a deficit that transfers to UAVDT (‑10.0 points) and is confirmed by held‑out and test‑dev evaluation (23.5%, 22.5%). Background false positives, localization error, and duplicate detections move in the direction AG‑FPN and Wise‑IoU were designed to push. Ablation traces the deficit to a specific source: the P2/‑P5 head swap costs 2.5 points independently plus a 2.5‑point interaction penalty when layered onto a backbone weakened by PC‑C2f, whose own 2.0‑point loss is consistent with a partial pretrained‑weight transplant (73/150 backbone tensors transfer). The failure is attributable to a specific interaction, not the four components individually. Composability must be verified directly, not assumed. Code/checkpoints: https://github.com/Mudassiruddin7/Small‑Object‑Detection‑in‑UAV‑Imagery.
Authors:Ahmad Amirivojdan, Farzad Nadiri, Abolfazl Alizadeh, Shaghayegh Yaraghi
Abstract:
Neyshekar is presented as an open Persian read‑speech corpus designed for coverage of both formal and informal language, named entities, and longer utterances. In version 6, 62,279 validated recordings totalling 99.02 hours are provided from 190 contributors, with 34,541 distinct recorded prompts. The prompt pool was assembled from human‑written material, contextualised homographs, and reviewed language‑model‑generated text. Text entries were normalised with the shekar library, which supports both formal and informal Persian, and every submitted recording was reviewed against a common validation rubric. About 24% of released clips are classified as informal by an automatic classifier; these register labels are not human‑validated. Item‑level rater labels are provided for reproducible agreement estimation, opaque per‑clip contributor identifiers make the speaker‑disjoint partitioning auditable and support contributor‑clustered uncertainty estimates, and a text‑disjoint test subset is included for evaluation beyond previously seen prompts. Per‑contributor recording load and reference‑free signal quality are characterised for every released clip. Corpus characteristics are compared with Persian Common Voice under shared processing. Utility is assessed through two ASR architectures, three optimisation seeds, WER and CER, and independent evaluation on the public PSRB sample. Against duration‑matched Common Voice training at approximately 32 hours, in‑domain WER is reduced by 9.5 points for Whisper and 11.6 points for XLS‑R, and by approximately eight points for both architectures on the independent PSRB sample. Transfer and mixture benefits are not consistently observed across architectures and training budgets. The corpus is released under CC0; code and data are made available through the project repository at https://github.com/amirivojdan/neyshekar.
Authors:Yakoub Bazi, Mohamad M. Al Rahhal, Mohamed A. Mekhtiche, Mansour Zuair
Abstract:
Change visual question answering (Change VQA) requires understanding semantic changes across bi‑temporal remote sensing images. Although vision language models (VLMs) have shown promising performance on this task, they remain unreliable when answering questions that require explicit transition statistics, area measurements, or spatial information. To address this limitation, we propose a selective tool use framework in which a single VLM either answers directly or invokes a deterministic change analysis tool to obtain question specific evidence. Specifically, the selected tool operates on bi‑temporal semantic maps and returns a structured observation, which the same VLM uses to generate its final answer. To support this framework, we construct a tool augmented extension of CDVQA covering eight question families and three tools for transition, spatial, and temporal analysis. Tool use supervision and observations are derived automatically from the original semantic annotations, without additional manual labeling. We then adapt Qwen3.5‑4B using Low Rank Adaptation (LoRA) to jointly learn direct answering, tool invocation, and evidence conditioned answering. Experiments on 7,164 test questions show that selective tool use with reference semantic maps improves overall accuracy from 73.77% to 88.79% and average family accuracy from 69.11% to 89.65%. When the semantic maps are predicted automatically, the framework achieves 77.47% overall accuracy and 75.06% average family accuracy. These results demonstrate the benefit of question‑specific semantic evidence for Change VQA, while highlighting the influence of semantic prediction quality on the resulting performance. Code and tool‑augmented annotations will be made publicly available at https://github.com/yakoubbazi/ToolChangeVQA.
Authors:Yunkai Zhuang, Qihang Yan, Zicheng Zhang, Guangtao Zhai
Abstract:
Image colorization is an inherently ill‑posed task, since a single grayscale image may correspond to multiple plausible colorized results. Consequently, conventional full‑reference image quality assessment (IQA) metrics fail to accurately reflect human perceptual preferences for colorized images. In this paper, we present MCIQA‑2K, a large‑scale multi‑dimensional benchmark specifically designed for no‑reference quality assessment of colorized images. We construct a dataset containing 2,000 colorized images generated by five representative colorization models, together with human annotations across three perceptual dimensions: color smearing, semantic color misalignment, and global naturalness. Building upon the proposed benchmark, we further introduce MCIQA, a dedicated multi‑branch NR‑IQA framework for colorized images. Extensive experiments demonstrate that MCIQA significantly outperforms existing full‑reference and no‑reference IQA methods on the proposed benchmark, while also exhibiting competitive generalization capability on several widely‑used IQA datasets. The dataset and code are publicly available at https://github.com/ARBEZ‑ZEBRA/MCIQA.
Authors:Jiaming Tan, Mingliang Zhai, Zhen Li, Yuwei Wu, Chuanhao Li, Kaipeng Zhang
Abstract:
Interactive video world models must maintain broad scene context under camera motion while producing high‑fidelity observations with low latency. Existing approaches face a representation trade‑off: perspective models operate on local views and must preserve off‑screen content over long rollouts, whereas broader spatial coverage is typically obtained by synthesizing full‑sphere videos or constructing explicit 3D representations. Motivated by the complementary roles of global context and selective local acuity in visual perception, we present AlayaVista, a camera‑controllable streaming video world model that decouples panoramic world evolution from perspective observation synthesis. Given a single perspective image, AlayaVista constructs a 360‑degree scene prior using a pretrained panorama expansion model and then evolves the scene as a camera‑conditioned panoramic latent state. A latent viewport renderer maps this state to the requested perspective video latents, while a perspective refiner restores details, suppresses artifacts, and performs super‑resolution. To support efficient streaming, we adapt the panoramic generator to chunk‑autoregressive generation and distill both panoramic generation and perspective refinement into few‑step processes. To provide the supervision required by this design, we construct MUGEN, a large‑scale real‑world panoramic video dataset containing 1,318 hours of videos at resolutions of at least 4K, together with rich semantic and geometric annotations.
Authors:Rui Xu, Kangyang Zhou, Jiachen Xu, Jiarui Guo, Boyu Xian, Kaicheng Yang, Tong Yang, Yong Cui
Abstract:
Set reconciliation, where two parties each holding a large set of elements aim to identify their set difference, is a fundamental task in many areas. There are two important metrics in this problem: time (computation cost) and space (communication cost). Most previous work focuses on optimizing one metric at the expense of the other. We present XYZ‑Sketch, proving that it is possible to achieve near‑minimal space and O(1) time updates simultaneously. Specifically, for sufficiently large d, XYZ‑Sketch reconciles sets with only (1+\varepsilon)d elements for communication, while achieving O(1) insertion time and O(d\log V) decoding time. Here, d and V denote the size of the difference between two sets and the universe size, respectively. We further establish a broad fixed‑support canonical model for the problem, showing that, under an open extremality conjecture, XYZ‑Sketch is asymptotically optimal within this model. Experiments validate the predicted near‑optimal performance of XYZ‑Sketch. The source code is available at https://github.com/djwj233/XYZ‑Sketch.
Authors:Radin Hamidi Rad, Amin Bigdeli, Negar Arabzadeh, Sajad Ebrahimi, Charles L. A. Clarke, Benjamin C. M. Fung, Ebrahim Bagheri
Abstract:
Deep research agents answer complex questions through iterative loops of searching, reading, and reasoning. Recent work on reasoning‑intensive benchmarks such as BrowseComp‑Plus shows that well‑configured lexical retrieval can surface high‑quality evidence, yet agents may still fail to connect documents carrying evidence to the gold documents. We identify a deep research agent's first retrieval move as an important design decision for this setting. We introduce Question's Gambit, a first‑move retrieval module that decomposes the question into a set of clues, reformulates them into complementary searches, consolidates the retrieved results, and reranks the candidate pool before the agent begins its iterative search‑and‑reasoning process. This produces an opening context designed to support both clue aggregation and final‑answer verification. We further evaluate on MultiHop‑RAG to test whether these benefits transfer beyond BrowseComp‑Plus to a more conventional multi‑hop question structure. Experiments on BrowseComp‑Plus show that Question's Gambit improves retrieval recall and downstream agent accuracy over strong baselines, improving answer accuracy from 83.1% to 90.5% with gpt‑5.5 over Pi‑Serini, the strongest reported agentic baseline. Our results confirm that effective agentic deep research depends not only on the tools available inside the loop, but also on the quality of the first move. We published our implementation publicly at https://github.com/radinhamidi/Question‑s‑Gambit.
Authors:Zhenyu Zhang, Jiudong Yang
Abstract:
Natural language prompts and skills serve as the strategic backbone of LLM‑based agents. Recent advances in prompt and skill optimization have achieved notable gains, yet all existing methods optimize a \emphsingle text template‑‑‑missing the synergy among multiple complementary strategies. We propose MOSCOPT, a text‑native, parameter‑free algorithm that jointly optimizes a pool of N skills and a gating skill G that dynamically selects K skills per step. To effectively optimize the skills, we build the EditAdam with internally maintained dual states. Through the three‑phase interleaved updates with EditAdam, the system monotonically improves without gradient or parameter tuning. Extensive experiments and detailed ablations across 5 benchmarks and 3 target LLMs demonstrate that MOSCOPT consistently outperforms all baselines, and confirm that both the mixture‑of‑skills architecture with selective activation and the collective evolution with three‑phase interleaving are essential to its superior performance. Code is released https://github.com/zhangzhenyu13/SummerClaw/tree/master/summerclaw/agent_trainer/algorithms/moscopt.
Authors:Changhua He, Xianchao Xiu
Abstract:
Compressed sensing (CS) reconstructs images from highly limited measurements, but existing deep unfolding methods are typically driven by first‑order optimization and weakly exploit the optimization states generated during reconstruction. To address these limitations, we propose a Newton deep unfolding network (NDU‑Net), which, to the best of our knowledge, is the first deep unfolding framework that leverages second‑order optimization for CS reconstruction. Specifically, NDU‑Net introduces a Newton update (NU) module to estimate Newton‑type update directions and generate optimization states that characterize the current reconstruction process. Furthermore, a Newton‑guided multi‑scale prior (MP) module is designed to incorporate these optimization states into multi‑scale feature restoration, thereby enabling the learned prior to adapt to the current reconstruction stage. Experimental results under different CS ratios confirm that our proposed NDU‑Net achieves promising reconstruction performance and exhibits enhanced robustness. Our code is available at https://github.com/xianchaoxiu/DNU‑Net.
Authors:Zhanghao Chen, Yuanyuan Li, Zhenyu Lu, Shuo Gao, Guangquan Zhou, Yikun Zhang
Abstract:
Medical vision‑language models (VLMs) allow a single model to perform clinical image analysis tasks ranging from diagnosis classification to report generation. However, joint adaptation is challenged by heterogeneous output formats, conflicting task gradients, and imbalanced training data. Hence, we present Two‑Stage Mixture‑of‑LoRA, a framework built on MedGemma‑1.5‑4B. The framework uses a shared‑specific Mixture‑of‑LoRA architecture comprising one shared LoRA and six task‑specific expert LoRAs, together with a two‑stage training procedure. In Stage 1, we jointly train the shared LoRA and all task‑specific expert LoRAs on all tasks. In Stage 2, we first freeze the backbone, the shared LoRA, and all non‑target experts, and refine one task expert at a time. Classification and regression then receive an additional modality‑balanced continuation, in which smaller modality groups are repeated to match the largest group. In the FLARE 2026 Task 3 test sets, the proposed method achieves 0.85 balanced accuracy for classification, 0.48 micro‑F1 for multi‑label classification, 0.79 detection F1, and 17.39 regression MAE. Code is available at https://github.com/YuanYL03/MICCAI‑FLARE‑2026‑Challenge‑Task3‑2D.
Authors:Zian Liu, Yiwen Hu, Zican Dong, Tian Xie, Wayne Xin Zhao, Yucheng Ding, Ran Tao, Bryan Dai
Abstract:
Recently, linear attention layers have been increasingly adopted to replace softmax attention at scale for long‑context modeling. However, existing context extension approaches typically apply continued pretraining directly without modifying these layers, overlooking the spectral properties of linear attention state dynamics. In this work, we study long‑context extension of Gated DeltaNet (GDN) from a spectral perspective of transition matrix and identify two essential factors governing long‑range information retrieval: (1) a sufficiently broad slow spectral band aligned with the target dependency length, and (2) the preservation of fast‑decaying modes for state clearing and context switching. Based on this observation, we propose SpectralShift, a spectral reparameterization approach for long‑context continual pretraining of GDNs. Specifically, SpectralShift reparameterizes the alpha projections initialization to reshape the decay spectrum by enhancing slow propagation capacity, and further introduces a learning‑rate scaling for alpha projections to facilitate long‑context training. Experiments show that SpectralShift consistently improves long‑context capabilities over training, providing an effective and efficient solution for extending context windows of linear attention models. The code has been open‑sourced at https://github.com/RUCAIBox/GDN‑SpectralShift.
Authors:Manni Cui, Ruiqi Liu, Zijian Yu, Hao Tan, Zibo Wei, Zian Wang, Ziheng Qin, Huijia Zhu, Weiqiang Wang, Jun Lan, Shu Wu
Abstract:
Advances in image generation have made synthetic images increasingly difficult to distinguish from real photographs, raising concerns about the trustworthiness of visual media. Existing AI‑generated image detectors often perform well on in‑domain data, but their robustness and cross‑generator generalization remain limited. These limitations are commonly attributed to overfitting to shortcut cues. Although many methods seek to suppress shortcut learning, most retain binary classification as the training task without reconsidering how the task itself shapes the learned representations. We introduce CuRe, a framework for learning Continuous Source Responses that revisits authenticity detection from the perspective of the training task. CuRe reformulates backbone adaptation as regression of real‑generated mixing ratios, providing finer supervision that encourages the model to capture authenticity‑related variation beyond binary endpoint separation. We further select a compact source‑response subspace to suppress nuisance variation and limit the final classifier's access to potential shortcut cues. Across ten public benchmarks, CuRe achieves an average balanced accuracy of 89.7%, exceeding the second‑best method by 5.2 percentage points. Further experiments demonstrate consistent generalization gains across visual backbones and strong robustness to common image degradations. Code is available at https://github.com/manic‑cui/CuRe
Authors:Binghua Li, Christina Andica, Tong Liang, Ziqing Chang, Chao Li, Wataru Uchida, Kaito Takabayashi, Qibin Zhao, Toshihisa Tanaka, Zhe Sun, Shigeki Aoki
Abstract:
Multi‑shell diffusion MRI (dMRI) unlocks more expressive microstructural modeling than single‑shell scans, yet its longer acquisition time hinders deployment in large‑scale cohorts and time‑constrained clinical settings. Synthesizing an unobserved shell from a single‑shell input is fundamentally ill‑posed and further complicated by protocol mismatch, where source and target gradient direction sets may not align. We propose DTI‑SHNet, a single‑to‑multi‑shell synthesis framework that operates in the real symmetric spherical harmonics (SH) coefficient domain and performs spatially aware volumetric regression. Given a source shell, we estimate diffusion tensor imaging (DTI) and use direction‑agnostic parametric maps along with a brain mask as conditioning priors to guide a 3D U‑Net regressor from source‑shell to target‑shell SH coefficients. To couple coefficient accuracy with signal fidelity, we introduce a signal consistency regularization that reconstructs signals on randomly sampled canonical directions from predicted coefficients and enforces agreement in the signal domain. Experiments on UK Biobank and Cam‑CAN data for b=1000 to b=2000 dMRI synthesis show that DTI‑SHNet achieves competitive visual quality compared to advanced methods, while better preserving downstream diffusion measures. Our code is available at https://github.com/xiaovhua/dti‑shnet.
Authors:Huayi Zhou, Wei Gao, Yiyang Han, Kui Jia, Hui Huang
Abstract:
Generalizable bimanual robotic manipulation requires a reusable task prior that can persist across increasingly diverse tasks, objects, scenes, embodiments, and execution conditions, thus avoiding the prohibitive cost of large‑scale teleoperated demonstrations and policy retraining. In this work, we present VLBiMan++, an extended framework that expands the generalization boundary of vision‑language anchored one‑shot bimanual manipulation. Starting from a single human demonstration, VLBiMan++ performs task‑aware decomposition to identify reusable and adaptable skill components, and employs vision‑language grounded geometric adaptation to transfer these skills to novel configurations without retraining. Building on this foundation, we systematically extend generalization along five dimensions: task generalization through diverse and long‑horizon skill compositions; object generalization across unseen categories, varying geometries, and more complex articulated or deformable objects; scene generalization under clutter, occlusion, and dynamic interference; embodiment generalization across heterogeneous dual‑arm robotic platforms; and deployment generalization through prolonged closed‑loop execution under repeated external perturbations. To support this broader scope, we further introduce object‑state‑aware adaptation and lightweight trajectory optimization mechanisms that accommodate changes beyond simple rigid 6‑DoF pose variations while preserving reliable bimanual coordination. Extensive real‑world experiments demonstrate that VLBiMan++ maintains strong task success and adaptation capability across these increasingly challenging settings. Overall, VLBiMan++ advances one‑shot bimanual manipulation from demonstrating isolated transferability toward a more systematic and scalable framework for generalization across tasks, objects, scenes, embodiments, and long‑term deployment conditions.
Authors:Xiaoya Wang, Yutong Xu, Junjie Wang
Abstract:
Can financial vision‑language models (VLMs) turn chart evidence into reliable action recommendations? Existing hallucination evaluations are mostly claim‑centric; they assess whether generated statements are supported, but not whether evidence remains traceable through rationale, confidence, and final action. We introduce E2A‑Bench, a 969‑query benchmark for financial chart reasoning, constructed from 323 HS300 constituents under three input modalities with deterministic OHLCV‑derived evidence anchors. E2A‑Bench evaluates grounding, reasoning‑action consistency, evidence‑confidence calibration, and directional coverage through UCR, RCI, ECI, and NDR, where NDR measures coverage‑aware evidence‑to‑action reliability rather than realized trading performance. Evaluating 20 VLMs reveals three failures hidden by scalar hallucination scores: the lowest‑UCR model ranks near the bottom by NDR due to only 6.4% directional coverage; oracle‑aided verification reduces unsupported claims but can collapse coverage; and financial fine‑tuning amplifies the BUY:SELL ratio by factors of 4.21 to 4.68 across strict base‑fine‑tuned pairs. These results show that financial VLM evaluation should trace the full evidence‑to‑action chain rather than rely on a single hallucination score. Code and data: https://github.com/wanng‑ide/E2A‑Bench
Authors:Praveen Kumar, K. R. Guruprasad, Tushar Sandhan
Abstract:
Long‑term navigation for service robots faces crit‑ ical challenges like the accumulation of odometry drift and sensor error, which progressively degrade 2D maps and renders traditional path planning algorithms (e.g., A, RRT, DiPPer, ViT‑A) ineffective over time. To address this, we propose a user‑friendly, interactive framework that eliminates the reliance on globally consistent maps. Our approach integrates visual perception with Large Language Models (LLM) to interpret user commands via text or voice. Instead of relying on a drift‑ prone global map, the system generates a sequential action plan based on local visual cues and egocentric geometric instructions. These action plans are executed sequentially, allowing the robot to navigate known and unknown environments safely. By reset‑ ting localization relative to immediate targets, our framework effectively works with a minimum accumulation drift strategy, ensuring accurate, efficient, and collision‑free navigation without the maintenance overhead of traditional mapping. Experiments on real‑world and simulated data have shown significant improve‑ ments over other methods. Our source code is publicly accessible at https://github.com/PraveenSingh24/VL‑Navigation.
Authors:Suresh Tamang
Abstract:
Machine learning models are increasingly deployed in healthcare imaging pipelines for diagnostic support, and training‑time attacks against them are a named sector‑level concern: healthcare‑sector guidance identifies model poisoning and adversarial attacks as threats requiring dedicated defenses, while federal policy directs expanded AI vulnerability‑detection tooling to critical infrastructure operators such as rural hospitals. Spectral signature analysis and activation clustering are two established backdoor detection methods routinely evaluated as independent baselines, but their outputs are not ordinarily combined, and reported detection performance on medical imaging benchmarks remains sparse relative to the natural‑image setting. This paper contributes three things: a score‑level fusion rule combining per‑class spectral ranking with activation‑clustering flags into a single per‑sample poisoning score and a model‑level agreement statistic; an open‑source implementation of the resulting eight‑stage pipeline; and an evaluation of that pipeline against synthetically poisoned variants of a public medical imaging benchmark and CIFAR‑10 at four poisoning rates (0%, 1%, 5%, 10%) over five seeds each, measuring each detector alone against the fusion. On the medical benchmark, the fused detector reaches AUROC >= 0.99 at every nonzero poisoning rate tested. On CIFAR‑10, fusion does not uniformly help: at 10% poisoning, activation clustering's true‑positive rate collapses to 0.000 and spectral AUROC independently degrades to near‑chance (0.545), despite a 97.2% attack success rate confirming the backdoor was fully installed. The fused score, a weighted combination of both signals, inherits this joint failure. Detection output is expressed in NIST AI RMF Measure‑function and MITRE ATLAS terms, so findings are reported in the vocabulary security and compliance teams already use.
Authors:Shida Jiang, Shengyu Tao, Scott Moura
Abstract:
Kalman filters (KFs) choose the gain as the product of the state‑‑measurement cross‑covariance and the inverse of the innovation covariance. In nonlinear systems, the predictive distribution generally changes shape, and these covariances require approximation. Conventional nonlinear KFs approximate them around a single center, the predicted state. They can produce inaccurate gains and overconfident covariance estimates when one local approximation does not represent the measurement geometry across the uncertainty region. To address this issue, we introduce probe sets, small covariance‑scaled collections of states at which the filter repeats its local approximation. We then select the gain that minimizes the average covariance reported by these local approximations. The same construction is used in our previously proposed covariance recalibration step to improve covariance consistency. The construction applies to different KF variants without requiring a specific approximation rule. For quadratic measurements, we derive conditions under which probing yields lower normalized true error variance than the corresponding single‑center gain when prediction uncertainty is sufficiently understated. We compare four KF variants with multiple baselines across 300 randomized setups for each of two systems. The results show that probing preserves typical accuracy while substantially reducing covariance inconsistency and the rare large‑error trajectories that dominate the root mean square of per‑run errors. The code is available at https://github.com/Shida‑Jiang/Probe_KF.
Authors:Yee Man Choi, Xuehang Guo, Songcheng Cai, Yimu Wang, Yi R. Fung, Qingyun Wang
Abstract:
Faithful citation attribution begins with identifying the intended source for a scientific claim. We study this source‑identification capability through citation recovery: recovering the paper cited by the original author from a citation‑bearing passage. Our evaluation adopts the published author's citation as an observable human attribution signal and uses target recovery as a proxy for progress toward faithful attribution. We introduce ATTRICITE, an open 4B‑parameter model trained for tool‑using citation recovery within the CiteGuard retrieval environment, together with CITEALIGN, a 7,607‑instance computer‑science dataset drawn from recent scientific literature. For controlled evaluation, we construct a 709‑instance benchmark subset of CITEALIGN, comprising 410 development instances from 2024 publications and 299 temporally held‑out test instances from 2025 publications. Across three runs at an inference temperature of 0.7, GRPO fine‑tuning improves Qwen3‑4B from 49.4%\pm1.5% to 59.8%\pm0.2% target‑match accuracy, a gain of 10.4 percentage points. Despite using only 4B parameters, ATTRICITE outperforms gpt‑oss‑20b and comes within 3.9 points of GPT‑5.4‑mini, while Gemma 4 31B IT achieves the strongest overall performance at 72.0%\pm1.0%. We release the model and collection pipeline https://github.com/KathCYM/AttriCite to support reproducible research on citation recovery toward faithful attribution in a continually evolving scientific literature.
Authors:Yu Peng, Matloob Khushi, Josiah Poon
Abstract:
Managing drawdown, the peak‑to‑trough decline in an investment portfolio's value, is a precondition for long‑term survival in practical investment management. However, mainstream stock forecasting methods predominantly optimize returns or Sharpe ratios under the independent and identically distributed (i.i.d.) assumption. Real markets do not follow this assumption, triggering catastrophic drawdowns. We propose a cross‑asset state‑space trading system (CAST), consisting of two components: The predictor, Cross‑Asset Collaborative Kalman Filter (CoKF), estimates each asset's latent state online, coupling all assets through their correlations and adaptively fusing multiple integrated‑random‑walk orders. The controller, Model Predictive Control (MPC), converts the predictor's forecast into trades, using forecast uncertainty as an explicit risk penalty that controls drawdown. We evaluate CAST on four real‑world stock markets over a 15‑year test window and show that it consistently occupies the return‑drawdown Pareto frontier, achieving strong risk‑adjusted performance while maintaining substantially lower maximum drawdown than competitive baselines. A stress test across crisis periods further demonstrates robust behavior under market shocks and distribution shift. Because the predictor and controller interact only through the predicted price path, both are plug‑and‑play, making CAST a modular, interpretable trading system. The code is available at https://github.com/FanBroWell/CAST
Authors:Xin Feng, Eleonora D'Arnese, Mohan Sridharan
Abstract:
Human motion may be viewed as a combination of action content, style, and body morphology. Existing motion style transfer methods transfer a reference style onto a content motion while assuming a canonical body, whereas shape‑aware motion generators adapt motion to a target shape without explicit style control. This separation of motion style and shape (morphology) makes it difficult to generate stylized motions for non‑canonical bodies; naively combining a style transfer module with a shape‑aware generator often leaks action content from the style reference and disrupts shape‑consistent kinematics. We present MorphoStyle, a framework for shape‑aware motion style transfer that is built on a shape‑conditioned Finite‑Scalar‑Quantization Variational Auto‑Encoder (FSQ‑VAE). The key contribution is to pose the desired style transfer as modular latent disentanglement comprising: (i) a contrastive style encoder that extracts content‑decoupled style embeddings; (ii) a text‑guided style‑routing mechanism that locates style‑relevant joints in a text‑motion feature space; and (iii) a manifold preserving style modulator that injects discriminative style embeddings in content features as a temporally‑gated low‑rank offset. Extensive experiments on benchmark datasets demonstrate that MorphoStyle outperforms competing baselines in terms of both shape control and motion style transfer, while simultaneously providing quantitative shape control. For more details, please see project website: https://github.com/funkdub/MorphoStyle.
Authors:Carmel Kronfeld, Sharva Gogawale, Tetsuro Kobayashi, Irad Ben-Gal
Abstract:
The rapid diffusion of hate speech and misinformation on social networks challenges democratic societies, since direct suppression efforts may deepen polarization, fuel public distrusts, and strengthen extremist narratives. LLM‑driven counter‑narratives (CNs) offer a promising way to reduce those risks, yet their effectiveness depends on rhetorical and stylistic choices that remain poorly understood. We present a multi‑stage agent‑based framework for generating, refining, and evaluating CNs, applied to pro‑Russian hate and misinformation narratives on the war with Ukraine and adaptable to other domains. A pilot experiment with human evaluators identifies effective technique style pairings, such as repetition with emotional framing enhancing persuasiveness. Building on these insights, we introduce a multi‑agent refinement process that iteratively improves CNs for persuasiveness, emotional engagement, and shareability. After human validation confirmed improvement, an automated safety analysis shows that our refined CNs match or improve on expert‑written counterspeech. A simulated experiment then shows that they reduce the perceived strength of pro‑Russian narratives and consistently outperform a vanilla LLM baseline, highlighting a pathway toward scalable, narrative‑specific interventions against hate speech and misinformation. Code and data accompanying this work are publicly available at https://github.com/carmelkron/inlg2026‑counter‑narratives.
Authors:Xiaobing Shi, Zherui Li, Yiming Jiang, Kun Wang, Yufei Guo
Abstract:
Context parameterization enables large language models (LLMs) to internalize contexts into reusable model parameters, avoiding repeated processing across subsequent queries. However, existing methods typically assume static contexts and lack explicit mechanisms for distinguishing validity states under continual updates. To study this real‑world scenario, we formalized the Memory Updating with Sequential Evolution (MUSE) task and constructed MUSE‑bench to evaluate update incorporation and unaffected‑information preservation. The resulting challenge requires preserving the global state while adjusting the contribution of memory evidence. Motivated by this, we proposed PLUME, a training‑free method that constructs a global update representation, activates memory evidence to form a local parameter view, and adaptively integrates their predictions during decoding. Comprehensive evaluation on MUSE‑bench demonstrated PLUME's effectiveness in sequential evolution settings, yielding relative improvements of 29.9% in average ROUGE‑L Recall and 54.9% in LLM‑as‑a‑Judge. Our codes are available at: https://github.com/xiaobingshi‑LLM/PLUME.
Authors:Rafiqul Islam
Abstract:
Vision‑language‑action (VLA) deployment can reduce inference latency while changing closed‑loop task behavior. We evaluate HuggingFaceVLA/smolvla_libero on an RTX 2060 (6 GB) in LIBERO Spatial and Object (MuJoCo 3.3.2, LeRobot 0.6.1, seed 42), comparing PyTorch+AMP with ONNX Runtime CUDA Execution Provider (CUDA EP). The main evaluation uses 100 episodes/suite; a paired rollout uses 300 episodes/suite. PyTorch+AMP reaches 70.0%/88.0% Spatial/Object success at 1181 ms p99. Requested‑FP16 and requested‑INT8 ONNX reduce tether‑inspect p99 to 601 ms and 532 ms, while Spatial success falls to 41.0% and 40.0% and Object remains at 89.0%. A graph audit shows those artifacts are byte‑identical FP32 graphs, so the requested‑INT8 row is not operator‑level INT8 quantization. A static language‑width ablation (16/24/32 tokens) yields Spatial success of 41.0%, 75.0%, and 71.0%; widths 24 and 32 recover much of the Spatial drop while Object success and uniform‑bench latency stay approximately stable. Width‑24 ONNX Spatial success is comparable to the PyTorch+AMP baseline at roughly half the latency (Wilson intervals overlap; two‑proportion chi‑squared p=0.53). Context width is an important contributor in this stack; it does not account for every PyTorch‑vs‑ONNX difference. Deployment evaluation should jointly report latency, artifact inspection, interface constraints, and closed‑loop success. Code: https://github.com/rafiqul713/smolvla‑libero‑onnx.
Authors:Jerry Kaplan
Abstract:
A transformer language model is trained to respond to any prompt, but each deployment asks only a narrow range of questions: a support assistant sees delivery complaints, a coding tool sees Python. Every deployment nonetheless pays the same computation per token. This paper measures how much of that cost is avoidable when the range of prompts is known in advance. The mechanism examined is early exit: a small, trained component ‑ called a readout ‑ is attached to an intermediate layer and proposes a token, and a confidence test decides whether to emit it or to run the remaining layers. The models are frozen, and the only supervision used is the model's own output on ordinary traffic. Three findings are reported. First, achievable savings depend strongly on the kind of traffic: at half depth on a 1.5‑billion‑parameter model, 96 percent of tokens could be emitted early for arithmetic word problems and 8 percent for Chinese‑language explanations, at matched token‑level fidelity to the full model (a measure whose limits the third finding exposes). Second, of three ways a deployment might use knowledge of its traffic, only customizing the threshold for exiting early is worthwhile: calibrating it per deployment raised exit rates by up to 59 percentage points across three models, and by more than 10 points on most corpora tested. Third, token‑level fidelity ‑ the standard evaluation measure in the early‑exit literature ‑ fails in domains where tokens can be checked against ground truth: on arithmetic word problems, three models each answered sixty questions correctly when run in full, and between 10 and 28 correctly under early exit, in the configuration that scored highest on fidelity. The intended setting is small models on personal devices, where generation is limited by memory bandwidth rather than computation.
Authors:Yuzhong Chen, Yongqing Liang, Yunzhi Xu, Irving Fang, Chase Kidder, Hui-ping Wang, Raihan Haque, Yubiao Zhang, Chen Feng
Abstract:
Precise manipulation in dynamic environments, whether induced by a mobile robot base or a target with unknown motion, remains a major challenge in robotics. Manipulation in dynamic environments introduces substantial uncertainty, which fundamentally conflicts with the tight precision requirement of precise tasks such as peg‑in‑the‑hole. We propose a Vision‑Force Admittance Learning (VFAL) framework that fuses asynchronous visual feedback with a high‑frequency force‑based model, using visual pose estimations as a regularization term. VFAL adapts insertion strategies online to dynamic motion while maintaining millimeter‑level precision. To obtain robust, low‑frequency pose information, we employ state‑of‑the‑art vision foundation models for visual pose estimation. Additionally, we incorporate failure recovery mechanisms to enhance overall robustness. We validate our approach in real‑world experiments, demonstrating high success rates and strong adaptability to various pegs and dynamic environments.
Authors:Ramtin Mojtahedi, Mohammad Hamghalam, Jacob J. Peoples, Richard K. G. Do, Amber L. Simpson
Abstract:
We evaluated parameter‑efficient fine‑tuning (PEFT) of the Segment Anything Model (SAM) for liver tumor segmentation in abdominal CT of colorectal liver metastases. We compared Low‑Rank Adaptation (LoRA), 4‑bit Quantized LoRA (QLoRA), a convolutional adapter (Conv‑Adapter), and our Directional Spectral Top‑K adapter (DiSCo), training only adapters while freezing the SAM backbone. DiSCo derives spectral bases from singular value decomposition of row‑normalized weights and learns rank‑gated spectral coefficients, per‑output magnitude offsets, and a spectral gain, with optional Top‑K rank selection at inference and 0.14 M trainable parameters. We benchmarked five prompting regimes: no prompt, single‑point, multi‑point, and bounding boxes at intersection over union 0.50 and 0.75. Conv‑Adapter and LoRA achieved the highest accuracy (overall Dice 0.793 and 0.792; single‑point Dice 0.795 and 0.792; 95th‑percentile Hausdorff distance (HD95) 32 mm). QLoRA was close (overall Dice 0.766; single‑point Dice 0.768; HD95 36.41 mm), with 0.91 M trainable parameters, 120 ms latency, and 4.9 GB peak memory. DiSCo achieved the highest Dice per million trainable parameters (4.66), with overall Dice 0.653, single‑point Dice 0.698, and HD95 49.53 mm. These results show an accuracy‑efficiency trade‑off and support PEFT for liver tumor segmentation with reduced adaptation costs when compute and labeled data are limited. Code: https://github.com/Ramtin‑Mojtahedi/PEFT‑SAM‑Liver‑CT
Authors:Philipp Bogdan
Abstract:
A contiguous cartogram is a map whose area is proportional to a quantity such as population. The defining condition, that the Jacobian determinant of the deformation equals the density, is one equation for two unknown functions, so every cartogram method adds a tie‑breaker, usually implicitly. Optimal transport makes the tie‑breaker explicit: among all density‑equalising maps of the frame onto itself, take the one that moves the population least in the mean‑square sense. By Brenier's theorem that map is the gradient of a convex potential, so it has no local rotation anywhere and cannot fold. We compute this map for the world population of 2025 on a 4096 by 4096 Mercator grid (10 km cells) from the GHS‑POP raster, using the fixed‑point Monge‑Ampère iteration of Benamou, Froese and Oberman with spectral Poisson solves, continuation in the population share and an ocean‑only buffer, on a laptop GPU. Against a Gastner‑Newman diffusion cartogram of the same density we find the same transport cost to within 0.4 per cent and density errors of a few per cent for both, but a median local rotation of 8.8 degrees for diffusion against 0.01 for transport, and a median anisotropy of 6.30 against 3.93. The construction extends to local refinement, by transporting a city's 100 m population onto the area measure the global map assigns to it, and to a semi‑discrete counterpart: 8,192 Laguerre cells of 1.00 million people each. Code, data provenance and every figure's inputs are public.
Authors:Yongyi Lu, Xiongfeng Huang, Zhijing Yang
Abstract:
Reconstructing 3D objects from brain signals offers a promising avenue for understanding human visual cognition. While prior work has shown initial success using EEG signals for 3D reconstruction, existing methods typically employ a uniform diffusion decoder, overlooking the evolving semantic granularity of both EEG representations and the diffusion denoising process. In this paper, we propose Mind2Cloud, a novel EEG‑to‑point‑cloud generation framework based on two‑granularity diffusion decoding. The core of Mind2Cloud is a time‑aware decoder that integrates a global Transformer branch and a local Point‑Voxel CNN (PVCNN) branch across diffusion timesteps through a learnable fusion mask. Specifically, Transformer layers are incorporated into the early upsampling stages to capture global object structure under high uncertainty, while PVCNN modules are used in later stages to refine local geometric details. Inspired by the hierarchical nature of EEG‑based visual representations, this design dynamically adapts its spatial granularity in accordance with the coarse‑to‑fine trajectory of diffusion denoising. We further introduce an adversarial refinement module to enhance geometric realism and semantic consistency. Extensive experiments on the EEG‑3D dataset across all 12 subjects demonstrate that Mind2Cloud outperforms prior work in both geometric accuracy and semantic alignment, setting a new benchmark for EEG‑to‑point‑cloud generation. Our source code is available at https://github.com/duasoi/Mind2Cloud.
Authors:Saeid Tafazzol, Ehsan Taheri, Ryne Beeson
Abstract:
Diffusion‑based generative models (DMs) have found applications in control problems, and in particular robotics, where the DMs enable exploration of possible control solutions. A critical shortcoming of these applications is that they have lacked optimality guarantees. This is a problem for their potential use in fuel‑optimal spacecraft trajectories that are characterized with long time‑horizons and bang‑bang profiles. Alternatively, indirect optimal control methods ensure explicit satisfaction of necessary conditions, but are highly sensitive to the initial costate estimation needed to solve the resulting Hamiltonian boundary‑value problems (HBVPs). To alleviate this sensitivity and enlarge the convergence domain of HBVPs, advanced indirect methods have been developed that use smoothing approaches and continuation. We propose a diffusion‑based multiple shooting indirect control method that combines the exploration capability of DMs with indirect method to generate fuel‑optimal spacecraft trajectories. We benchmark our method against an advanced indirect method on a fuel‑optimal Earth‑Mars low‑thrust transfer problem, showing higher convergence robustness than the advanced indirect method that is based on random costate initialization. Code and visualizations are available at https://saeidtafazzol.github.io/Diffusion_Indirect_Control/.
Authors:Simon Schug, Brenden M. Lake
Abstract:
A central tenet of human cognition is systematicity, the principle that understanding one concept is inherently tied to understanding close variations of that concept. Do reasoning models robustly exhibit such systematicity? If so, we would expect consistent performance on structurally equivalent variants of the same task. Here, we extend established rule induction tasks from cognitive science to assess the systematicity of thought in current reasoning models. Each task family has compositional structure that we use to create structurally equivalent task variations through task isomorphisms such as recombination and substitution. We find that despite being able to correctly solve a task, models often fail on structurally equivalent variants of the same task. These findings suggest that many model behaviors lack systematicity, rendering it difficult to robustly establish the cognitive abilities of reasoning models beyond the particular contexts they were evaluated in.
Authors:Yuning Yang
Abstract:
This work studies subspace embeddings obtained by two normalized real Walsh transforms, two independent sign diagonals, and uniform coordinate sampling without replacement. The main result shows that the prescribed sample size k=\min\n,\lceil Cr/\varepsilon^2\rceil\, for a universal constant C, suffices to preserve all squared norms on each fixed r‑dimensional subspace within 1\pm\varepsilon with probability at least 0.99. The result holds for every ambient Walsh dimension and all ranks, and answers Problem TR‑01 in the Open Problems in Numerical Linear Algebra repository. The proof controls joint entry cumulants of the transformed projection through connected graph contractions and Walsh character identities. These estimates then bound the expected trace of even powers of a product of centered projections. A two‑projection decomposition converts this estimate into control of both spectral edges. Bernoulli sampling at arbitrary densities and a deterministic upper bound near full sampling yield the prescribed number of coordinates.
Authors:Shaghayegh Sadeghi, Stephen L. Smith, David C. Del Rey Fern'andez
Abstract:
Natural‑language descriptions of optimization problems may be incomplete or vague about numerical information that a solver requires, including costs, capacities, demands, bounds, and penalties. A language model can translate the description into code, but when a required value is absent it must either stop or guess. We present SAILOR, a proof‑of‑concept system that detects such unsupported numerical choices, asks the user targeted follow‑up questions, and updates the optimization model before returning a solution. Questions are prioritized using uncertainty and solver‑derived estimates of how strongly each missing value affects the current model. We evaluate the pipeline on 1,723 instances from seven masked benchmarks using an idealized simulator that returns ground‑truth values. Exact objective‑value agreement ranges from 27.0% to 87.6% across datasets, with 1.4‑‑5.7 questions per instance on average. These results establish feasibility under controlled branch‑and‑reveal feedback; they do not measure performance with human users or general structural model repair. Code is available at: https://github.com/sshaghayeghs/SAILOR.
Authors:Leonid Chindelevitch, Ararat Harutyunyan
Abstract:
A tournament T is k‑inducible if there are k linear orders on its vertex set such that, for every arc i \to j of T, a majority of the orders rank i above j. For odd k, let N(k) be the least order at which some tournament is not k‑inducible. Only N(3) = 8 is known exactly; for N(5) the best bounds were 12 \le N(5) \le 38, from our previous paper [2], which also gave the first explicit example of moderate order, the Paley tournament P_43. Results. A bespoke search algorithm improves both ends: 13 \le N(5) \le 23. The upper bound comes from proving that P_23 is not 5‑inducible, the case Bachmeier et al. [1] reported they could not decide, their SAT solver not having terminated within a cumulative six weeks; ours takes 22 hours on one laptop. The lower bound comes from an analysis at order 12. We also show that P_31 is not 5‑inducible, while P_19 is 5‑inducible but not with unit margin, that is, not by a profile in which every arc is carried by exactly three voters against two. Both P_19 and P_23 are arc‑critical for their respective properties, whereas P_31 and P_43 are not vertex‑critical: deleting a vertex leaves a tournament that is still not 5‑inducible. Method. The search places one vertex at a time, always choosing the vertex with the fewest options left, and propagates the consequences. Together with the automorphisms of the tournament, this decides on a single laptop instances that neither integer programming nor a general‑purpose SAT solver can settle. The refutations for P_19 and P_23 are certified as well: the search is split into independent subproblems, a SAT solver emits a machine‑checkable proof for each, and a separate program rechecks every proof. All results, subject to two human‑checked lemmas, are reproducible from https://github.com/Leonardini/TournamentsBeyond5Voters.
Authors:Shuhuai Huang, Jingfeng Zhang, Hong Jia
Abstract:
Harness design has transformed the development of LLM‑based agents by integrating memory, tool use, and runtime control. However, this design also introduces security and privacy risks because malicious instructions from external sources may be written into persistent memory and persist across sessions. To study this risk, we propose PMPA, a Persistent Memory Poisoning Attack against harness‑based agents. PMPA embeds malicious instructions into benign external sources and induces the victim agent to write them into persistent memory without directly accessing to the agent framework. Once stored, the poisoned memory can be retrieved in later sessions, triggering additional malicious actions and causing privacy leakage. We evaluate PMPA on OpenClaw and Claude Code across different backbone LLMs, input modalities, and trigger scenarios. Across all settings, PMPA achieves average Injection Success Rate (ISR) and Cross‑session Attack Success Rate (C‑ASR) of 73.7%/ 55.5% on OpenClaw and 66.9%/ 81.7% on Claude Code, while preserving benign task performance on both systems. We further evaluate a targeted prompt‑level defense and find that it can reduce memory injection in many settings, but provides limited protection once the persistent memory has been poisoned.
Authors:Andrea Scariolo
Abstract:
Agriculture accounts for roughly 70% of global freshwater withdrawals, yet irrigation is still commonly scheduled reactively, with no forecast of where soil moisture is heading and no statement of confidence in that forecast. Data‑driven models are accurate but opaque and point‑valued; water‑balance models are transparent but carry large structural error. Neither alone supports a defensible irrigation decision under uncertainty. This study coupled the two and carried uncertainty through to the decision: a four‑parameter water‑balance core, calibrated on training data only, was corrected by a Random Forest that learned nothing but the physical residual, conformal prediction attached 90%‑nominal intervals, and a risk‑aware rule converted the interval lower bound into an irrigation trigger. It was evaluated on three years of hourly in‑situ measurements from a rainfed Mediterranean cropland station under a strict chronological split, scored against persistence, from one hour to one week. At the 24 h horizon the hybrid reached RMSE 0.00925 m^3 m^‑3 and +9.4% skill, roughly double the best of nine baselines, of which only the Random Forest beat persistence. Skill did not grow with lead time: it peaked at +27.4% at three hours and fell to +1.2% at one week. Conformalised quantile regression was better calibrated and 11% sharper than constant‑width conformal prediction. The risk‑aware rule raised management‑threshold crossings detected in advance from 0.905 to 1.000, at a precision cost of 0.975 to 0.950 and 3.7% more notional water, and beyond 72 h the point forecast fell below the no‑forecast rule while the interval‑based rule did not. Uncertainty quantification therefore governs the lead time over which forecast‑driven irrigation advice remains trustworthy, and here transparency in the physical layer cost no measurable accuracy.
Authors:Cheng Chen, Hao Ouyang, Qiuyu Wang, Ka Leong Cheng, Wen Wang, Yihao Meng, Hanlin Wang, Yixuan Li, Jiacheng Wei, Zhenshan Tan, Yanhong Zeng, Yujun Shen, Guosheng Lin, Fayao Liu
Abstract:
We present DiVA, a deeply interactive digital life simulator pioneering a new paradigm for long‑term, open‑ended interactive experiences within digital character worlds. DiVA's architecture pairs a Multimodal Large Language Model (MLLM) as a router with a meticulously designed stacked video pipeline for seamless, multi‑turn interactions with action and audio response. To maintain continuity and avoid degradation, we model generation as a three‑part coupled system: waiting video, action video, and the transitions between them. These transitions are critically handled by our Anchored Video Continuation (AVC) module, which returns the character to stable states to prevent degradation. By encoding information from the preceding action video segment, AVC ensures smooth transitions, significantly reducing camera jitter and inconsistencies common in current video transition methods. This design also enables complex pose changes (e.g., sitting to standing) typically difficult for audio‑driven models. These system designs together ensure high‑fidelity identity, coherence, and dynamics for extended experiences. To validate our pipeline design, we comprehensively compare our system against alternatives by replacing our core generation module with mainstream long‑video, continuation, and interpolation methods. We further analyze the necessity of the three‑stage design, anchor‑state selection, transition naturalness, spatial grounding, and the quality‑latency trade‑off, and we expand the comparison to additional long‑form audio‑driven avatar models. Results confirm DiVA is markedly superior in maintaining long‑term visual quality and realism, validating its effectiveness as a sustainable, interactive simulation.
Authors:Ziyin Xiong, Nikolaos Gkanatsios, Moritz Reuss, Katerina Fragkiadaki
Abstract:
We present GeomVLA, a Vision‑Language‑Action (VLA) model that unifies perception, latent scene motion prediction, and action generation within a shared robot‑centric 3D coordinate frame. Our approach lifts pretrained VLM features into spatially grounded 3D scene tokens using depth and camera calibration, while retaining the semantic representations learned during VLM pretraining. We further introduce a 3D Scene Trajectory Denoiser, a task‑conditioned module that learns a latent representation of how scene points are expected to move in 3D. Rather than executing the predicted trajectory as an open‑loop plan, GeomVLA extracts intermediate motion tokens from the trajectory denoiser and uses them to condition a 3D flow‑based action denoiser through geometry‑aware attention. GeomVLA achieves state‑of‑the‑art performance on CALVIN, competitive performance on LIBERO and RoboTwin2.0, and outperforms strong baselines in real‑world manipulation settings without robot‑action pretraining. Extensive ablations show that future‑motion reasoning alone is insufficient: the primary gains are associated with maintaining geometric consistency among scene representation, motion prediction, and robot actions throughout the perception‑to‑action pipeline.
Authors:Akifumi Goto
Abstract:
One‑vs‑rest rankers that show each user the top‑K of many rare labels usually counter imbalance with a per‑label positive‑class weight, scale_pos_weight = n_‑/n_+. Elkan's identity says such a weight shifts label j's log‑odds by \ln w_j, so the model ranks by weighted odds rather than by the marginal that is Bayes‑optimal for precision@K, and suggests inverting the shift afterwards; what a finite learner does with a weight in the thousands, and which repair then works, has not been measured. We call the gap between the promised and the realized shift odds‑shift slippage and measure it on matched pairs of LightGBM and MLP models that differ only in the weights. On Santander the weight takes MAP@7 from 0.808 to 0.117; for the boosted pairs the ideal odds shift accounts for 23% of that loss (32% on Instacart; 98% for an MLP pair on the same rows) and slippage for the rest. We prove that a booster whose leaf steps are capped at c realizes at most Tηc nat of shift in T rounds at rate η, which a cap sweep confirms, and show that without a cap saturated cells tie at exactly 1.0, beyond the reach of any separable map. The analytic inversion therefore pays only where the shift was realized and nothing saturated, whereas per‑label isotonic regression returns the Santander model to 0.784 (0.780 with the calibrator fitted on the validation period), but only if labels without calibration positives are mapped to their prior rather than passed through. On 11 public MULAN benchmarks and 5 learners the weighted model loses more than half of its MAP@K in 8 of 55 cells, and on delicious and Corel5k the same repair returns it to the unweighted level; per‑label calibration hurts where positives are scarce, a harm that a cross‑validated rule removes. The recipe is released as oddslip.
Authors:Hanling Wang, Chenlong Wei, Yingjuan Li, Di Wu, Yuchao Zhang, Xiaohui Zhu, Yao Zhu
Abstract:
Detecting harmful memes is critical for maintaining safe online communities. However, harmful intent is often implicit, arising from visual‑textual incongruity and cultural stereotypes, which challenges existing multimodal detectors. We propose SyRHM, a framework that decomposes harmful meme detection into meaning‑grounded retrieval and symbolic‑language‑enhanced multi‑stage reasoning. SyRHM retrieves semantically related memes by parsing multimodal content into textual elements and descriptions, providing grounded context beyond surface‑level similarity. Building on the retrieved context, SyRHM uses a translator stage to convert multimodal inputs into symbolic intermediate representations, and then performs multi‑stage reasoning via planner and solver stages, enabling expressive and interpretable analysis of harmful intent. Experiments on FHM, HarM, and MultiOff demonstrate the effectiveness of SyRHM, achieving superior performance on most evaluation settings against multimodal and reasoning‑based baselines, while providing reasoning traces for harmful content. The code is available at: https://github.com/Scabbards1500/SyRHM
Authors:Shogo Saitou, Mashu Noguchi
Abstract:
We mechanized proof of Gödel's first and second incompleteness theorems, Solovay's arithmetical completeness theorem of \mathbfGL, and related results in the Lean 4 theorem prover.
Authors:Jiaheng Chen, Jiaxing Li, Leixia Wang, Jianan Ju, Tinghe Zhang
Abstract:
Human trajectory prediction requires modeling both individual motion patterns and social interactions among agents. Existing methods have made substantial progress by using attention mechanisms, graph structures, and temporal encoders to capture dynamic social context. However, most of them primarily focus on how social information is encoded, while paying less explicit attention to how the encoded social context should take effect during future trajectory generation. In this paper, we argue that dynamic social encoding does not necessarily imply dynamic social activation. The same interaction context may require different activation strengths across future horizons and scene densities: social cues should be strengthened when interaction evidence is strong, but suppressed when they are weak or noisy. To address this issue, we propose GEAR, a generation‑aware bias activation model for human trajectory prediction. Built upon a bias‑decomposed trajectory generation formulation, GEAR dynamically activates the individual‑motion and social‑resonance bias terms at each future step before final trajectory composition. This allows the model to explicitly control when and how strongly individual and social bias components participate in generation. Experiments on ETH‑UCY, SDD, and NBA show that GEAR consistently improves the resonance‑based baseline and achieves competitive state‑of‑the‑art performance. Further analyses of activation patterns and density‑grouped errors validate the importance of calibrating encoded social context during trajectory generation. Our code is available at https://github.com/11isnotavailable/GEAR.git.
Authors:Junxiao Lin, Tianyue Wu, Jie Yin, Jia Pan, Kaifeng Zhang, Weiming Zhi
Abstract:
In‑hand manipulation allows multi‑fingered dexterous hands to reconfigure grasped objects without releasing and regrasping them. This improves manipulation efficiency by reducing repeated grasp acquisition and large arm motions. However, most learning‑based methods focus on reorientation, continuous rotation, or translation, whereas many tasks require joint control of object position and orientation. We formulate this capability as in‑hand 6D object pose reaching: starting from an existing grasp, coordinated finger motions move the object to a palm‑relative target pose. We present POISE (Palm‑relative Object reaching In SE(3)), a sim‑to‑real reinforcement learning framework for this task. POISE combines diverse stable‑grasp initialization, goal‑ and geometry‑conditioned control, an adaptive 6D goal curriculum, and a compact reward scheme for pose reaching and grasp preservation. In simulation, diverse initialization raises held‑out‑grasp success from 40.1% to 51.5% and post‑drop recovery from 33.8% to 72.9%; the curriculum raises full‑range success from 6.2% to 59.5%. On hardware, the grasp‑maintenance reward improves three‑target sequence success from 20% to 80%. In real‑world experiments, POISE reaches successive 6D targets without manual reset across multiple object geometries and wrist orientations, and recovers from external disturbances. To support further research in dexterous manipulation, we will release our code at https://junxiaolin.github.io/poise‑website/.
Authors:Hamza Mahmood, Georgiy A. Bondar, Abhishek Halder, Adeel Akhtar
Abstract:
We establish the equivalence between the stochastic optimal control and path space formulations of the Schrödinger bridge problem (SBP) for the kinematic equation on a compact connected Lie group. Using the geometric concepts of horizontal lift and stochastic anti‑development, we derive a Girsanov‑type change‑of‑measure result, and show that the expected control energy equals the relative entropy of the controlled path law with respect to the reference Wiener measure. Thus, the SBP is equivalently a path space relative entropy minimization problem subject to prescribed endpoint marginals.Our result has three useful implications. From an analytic viewpoint, the shown equivalence helps prove the existence and uniqueness of the SB. From a probabilistic viewpoint, it helps interpret the SB as the most probable deviation of the uncontrolled stochastic dynamics consistent with the endpoint constraints. From a computational viewpoint, it allows using static Sinkhorn recursions to directly solve the relative entropy minimization problem and compute the optimal path measure. We illustrate the equivalence numerically on the torus \mathbbT^2. The code is publicly available at: https://github.com/gradslab/LargeDeviationSBP
Authors:Kunlun Xu, Yanqin Zhang, Wenwen Qiang, Jiahuan Zhou
Abstract:
Multimodal Continual Instruction Tuning (MCIT) aims to exploit the incrementally accumulated knowledge to process multimodal inputs of diverse tasks, where parameter routing plays an important role. State‑of‑the‑art methods rely on sample‑to‑task center similarity and cross‑modal fusion with equal weight during routing. However, such solutions face two fundamental flaws: (1) Within each modality, the sample‑to‑task center distance is sub‑optimal for routing since the abundant intra‑task diversity information is underleveraged. (2) Different modalities exhibit varying reliability across tasks, where the modality with inter‑task ambiguity can easily misguide the routing result. To address these problems, we propose Hyperbolic Uncertainty‑aware Modality‑Balanced Routing (Hyper‑LLaVA) to improve parameter routing capacity based on cross‑modality task feature uncertainty modeling. Specifically, to improve intra‑modality task matching, Hyper‑LLaVA accesses the sample‑to‑task distribution similarity in the Hyperbolic space. Besides, to alleviate the degradation brought by unreliable modalities, Hyper‑LLaVA quantifies the task matching ambiguity within each modality to achieve adaptive balancing between task matching across modalities. Based on the complementary intra‑ and inter‑modality task matching enhancement, our Hyper‑LLaVA outperforms state‑of‑the‑art approaches by large margins. Our source code is available at https://github.com/zhoujiahuan1991/ICML2026‑Hyper‑LLaVA
Authors:Hanling Wang, Chenlong Wei, Ling Xu, Hanyan Niu, Qi Cao, Shizhou Huang, Yang Yang, Xiaohui Zhu, Yao Zhu
Abstract:
As large language models (LLMs) are increasingly deployed, the generation of harmful content has become a critical safety concern. Existing safeguards operate at the input, output, or streaming‑generation stages, while early‑risk methods that rely on surface tokens or output logits may suffer from weak initial signals, and internals‑based detectors using dense representations may retain highly entangled and redundant safety‑irrelevant information. It therefore remains unclear whether the earliest post‑generation hidden states already contain reliable signals about final‑response harmfulness. To address this gap, we propose ForeSight, a first‑token output‑risk forecasting framework that distills weak and redundant early safety signals into compact, layer‑aware risk representations. Experiments on five safety benchmarks and two target models demonstrate that ForeSight achieves superior and efficient early‑risk forecasting while relying solely on first‑token hidden states. The code is available at: https://github.com/Scabbards1500/Foresight
Authors:Deshan Gong, Ningtao Mao, Xiaoyuan Yang, Xinyu Lu, He Wang, Taku Komura
Abstract:
The mechanical memory of fabrics often leads to persistent wrinkles, which reflect key physical properties and habitual wear patterns. Simulating these wrinkles accurately is essential for visual plausibility in digital garments, yet no dedicated approach exists for inferring the parameters that govern their formation due to the lack of precise datasets and estimation methods. We introduce Fabric‑101, an inclusive, accurate, and extendable fabric dataset comprising over 101 common fabrics following textile standards. Unlike existing datasets, it captures three physically distinct deformation components (i.e., self‑recoverable (elastic), recoverable (friction‑driven), and unrecoverable (plastic)), from cyclic loading‑unloading measurements. Building on this data, we propose a differentiable cloth simulator combining an elasto‑plastic model with friction, designed to capture recoverable and unrecoverable wrinkle formation. Our simulator is differentiable and uses adjoint method to learn fabric physical parameters from the measured hysteresis curves, learning fabric‑specific wrinkle behaviors. Through extensive experiments, we demonstrate that our model reproduces persistent wrinkles that are visually and physically similar to real fabrics across diverse materials and motions. Dataset and code are available in https://github.com/GongDeshan/Fabric_101_for_Wrinkles.
Authors:Sangho Yun, Minsoo Kim, Minwoo Cho, Hwanjo Yu
Abstract:
Chunked vision language action (VLA) policies execute several commands per query, but jerk within chunks and across replanning boundaries can induce oscillatory motion and sharp actuator transients. We present GROOVE, an online regulator that searches directional correction regions around the raw three dimensional end effector (EEF) path, without retraining or additional VLA inference. It optimizes the new chunk using delivered commands as boundary conditions, reducing boundary and within chunk jerk while bounding cumulative translation and local axis angle deviation from the raw plan after every command. Using quadratic programs (QPs), GROOVE generates a cube reference and thirteen directional candidates, then selects the one with the lowest command space jerk under a reference relative deviation cap. On a held out LIBERO benchmark, GROOVE achieves the largest reductions among the evaluated methods, reducing translational and rotational EEF jerk by 33.02% and 43.42%, respectively, with task success of 95.75% versus 93.75% for raw execution. Across 50 matched UR5e pairs with measured execution timing, it reduces translational and rotational tool center point (TCP) jerk by 16.39% and 19.49% and joint current slew by 29.09%.
Authors:Rong He
Abstract:
LLM serving reuses KV cache by exact prefix match, so when a prompt is assembled from a set of reusable pieces ‑‑ retrieved passages, tool definitions, few‑shot exemplars ‑‑ the order chosen for those pieces determines how much computation can be shared. Every deployed system fixes that order by a single global convention. We prove this is optimal only when requests contain at most two pieces, and asymptotically wrong in general. Our main result is a structure theorem: the minimum prefix‑trie cost equals min_H sum_x w(x) t_x(H) over binary hierarchies H on the requests, where t_x(H) is the canonical decomposition size of the set of requests needing chunk x. Choosing chunk orders is therefore equivalent to choosing one hierarchy over requests. The identity yields an O(3^m) exact algorithm, identifies the two‑chunk case as minimum vertex cover, and shows that on the leave‑one‑out family the optimum is the minimum external path length of a binary tree ‑‑ the merge‑sort recursion ‑‑ so a global order pays Theta(n^2) against a true cost of Theta(n log n). Agglomerative clustering by common intersection is a tight 1/2‑approximation for the achievable saving. On BM25 retrieval traces over three BEIR corpora the resulting layout reduces prefill by 17‑36% against production RAG ordering, and the margin widens with retrieval depth as the theory predicts. Serving requests in the hierarchy's DFS order finally lets a cache holding one request's context attain the unbounded‑cache optimum exactly, so cache capacity and reorder window act as substitutes.
Authors:Fei Yuan, Changjiang Gao, Yilei Tu, Yifeng Liu, Shujian Huang, Yu Qiao
Abstract:
Fine‑tuning instruct models often improves target performance while inducing behavioral drift from the reference model, which can degrade existing capabilities. Rather than treating this drift as an uncontrolled consequence of optimization, we specify a behavioral drift budget before optimization and ask how to boost the target‑task performance within it. Locally, behavioral drift induces a shared geometry anchored at the reference model, with the drift budget defining a boundary within this space. In this space, drift determines distance from the reference, leaving update direction as the remaining degree of freedom. Fine‑tuning updates can therefore be compared through their directional efficiency, naturally reformulating fine‑tuning as a direction‑selection problem. This reformulation makes a concrete prediction: changing the accessible directions can qualitatively alter the outcome of fine‑tuning. We test this prediction in a stringent QA‑only setting, where strong instruct models are fine‑tuned only on final answers but must still generate multi‑step reasoning at inference. Despite this mismatch, a coarse layer‑selective probe reverses the failure of QA‑only fine‑tuning and reveals the existence of effective directions, with multiple neighboring configurations improving target performance while preserving reasoning and general capabilities. Across Qwen3‑8B and Qwen3‑14B, these directions substantially improve scientific reasoning and multilingual translation. Over more than 100 languages, the resulting models match or outperform dedicated translation systems and provide a stronger initialization for subsequent reinforcement learning. Our results suggest that fine‑tuning is not just about how much a model changes, but how that change is spent. https://github.com/CONE‑MT/DCO and https://huggingface.co/collections/LLaMAX/dco
Authors:Jie Xu, Ziyi Jin, Kangjin Yu, Can Jiang, Hongjun Huang, Tongxing Jin, Hongkun Luo, Zhongpu Xia
Abstract:
LiDAR‑inertial odometry (LIO) systems differ in whether they continue estimating gravity after initialization. We compare four gravity‑bias state configurations in each of FAST‑LIO2 and LIO‑SAM, then separately test a gravity‑direction factor. Across 12 dataset sequences evaluated with FAST‑LIO2, fixing gravity under continuous LiDAR correction produces mean paired changes in vertical and 3D position errors with 90% confidence intervals within \pm 2%. Tests on 4 sequences with LIO‑SAM likewise show no consistent benefit from online gravity. Multi‑second LiDAR outages, unlike reduced range or field of view, reveal trajectory‑dependent costs of fixing gravity. A history‑matched 23D‑to‑21D switch places the repeatable 3D error increase after LiDAR updates resume. Under 5‑s outages, a direction factor from the same IMU used for preintegration improves accuracy on Hall05 but worsens both errors with online gravity on TUHH. Dynamic‑start tests also show fixed‑bias failures at particular starting phases. We recommend keeping gravity and accelerometer bias online for robustness; use a direction factor only after verifying vertical and 3D accuracy gains under the intended operating conditions.
Authors:Mahmoud Y. M. Yassin, Mahmoud AbdelHafeez Sayed, Mostafa Taha
Abstract:
Privacy‑preserving inference via Torus Fully Homomorphic Encryption (TFHE) provides strong protection for sensitive data in outsourced deep learning applications. However, most TFHE‑compatible neural network frameworks remain based on arithmetic neural architectures, resulting in high inference latency due to programmable bootstrapping (PBS), accumulator growth, and circuit bit‑width sensitivity. In this work, we investigate Deep Differentiable Logic Gate Networks (DDLGNs) as a Boolean‑native alternative for encrypted inference under TFHE. Because DDLGNs learn Boolean computations directly and discretize into fixed logic gate networks, their inference procedure is naturally aligned with TFHE's Boolean execution model and avoids arithmetic accumulation in hidden layers. We present EI‑DDLGN, the first in‑depth study of TFHE‑based DDLGN inference, and characterize how encrypted execution cost depends on model size, learned Boolean‑function distribution, and propagated wire status. We also introduce Model‑Fixed‑Wire PBS Bypass (MFW‑PBS Bypass), a semantics‑preserving execution strategy that eliminates unnecessary PBS operations without modifying the learned network topology. Evaluations across 72 depth‑width configurations on MNIST, FashionMNIST, and UCI Phishing show that DDLGNs constitute an efficient alternative to arithmetic TFHE inference, achieving substantially improved accuracy‑latency trade‑offs. Notably, on MNIST, EI‑DDLGN‑Small matches the accuracy of QAT‑FCNN‑4 while reducing encrypted inference latency by 13.4x. Our implementation is available at https://github.com/Carleton‑SCI/EI‑DDLGN
Authors:M Waleed Kadous, Benjamin Olsen, Walter Scheirer, Daniel D. Slate, Alexander Arnold, DZ Kalman
Abstract:
Do AI assistants help believers reason about moral dilemmas consistently with their faith? We present FaithfulBench, the first benchmark to score AI counsel across traditions by how well it adheres to the user's professed faith. Scenarios are drawn from each tradition's most respected texts, with the faithful answer known and applied by the judges as the standard. We test five frontier models under three conditions: the AI does not know the user's tradition; it receives a one‑line prompt identifying the user as a practicing adherent; or it receives a companion‑counselor guide rooted in the tradition's sources. Two judges score the initial response and whether the model caves or holds when pressured toward the answer the user wants. When the tradition is unstated, models counsel from a secular therapeutic default and every model fails some believers. Naming the faith wins a faithful first answer but not steadfastness; the guide improves both.
Authors:Maurizio Falconi
Abstract:
Let R^\ast(n) be the least radius of a central circle to which nonoverlapping circles of radii 1,\ldots,n are externally tangent. We prove that R^\ast(n)=C_\ast n^2+o(n^2) and characterize C_\ast by finite linear programs with an explicit error tending to zero. The reduction preserves arbitrary orders and all pairwise constraints: the limiting problem places marked points on a line at pairwise separation at least the geometric mean of their marks. Concatenation with a bounded boundary cost proves existence, and balanced finite‑word programs supply matching effective upper and lower bounds. Their certified gap is (1/k+1/r)/π, before directed arithmetic error, for k mark types and words of length r. A quantitative reflected‑block recovery theorem supplies genuine permutations and full ring geometry, with a countable extension and a strict four‑block improvement. The explicit interval is C_\mathrmterm+η_\mathrmwidth\leC_\ast\le U_4; neither endpoint is asserted sharp. In particular, the coefficient 1/8 proposed in the preceding finite study is false. An elementary expression for C_\ast, efficient high‑precision evaluation and global floating‑circle structure remain open.
Authors:Diptesh Kanojia, Chi-kiu Lo, Archchana Sindhujan, Samuel Larkin, Greg Hanneman, Alon Lavie
Abstract:
The WMT26 General MT task evaluates systems on 10 language pairs that have no human references (neither translated from scratch nor post‑edited from MT output by humans). We describe how we built the pseudo‑references for these pairs and six other language pairs (in which some forms of human references are available): seven models translate the 3,277 official documents under up to five prompt conditions, giving a total of 26 system‑prompt combinations; then three reference‑free quality estimation (QE) models score every candidate; and a per‑document selector picks one translation, which GPT‑5.5 post‑edits where needed. Working without references exposed a failure mode of QE‑guided selection: the metrics rank fluent output in the wrong language above correct translations. Adding a confidence‑scaled language identification penalty to the score fusion drives the wrong‑language count to zero, and the resulting selector still scores better on MetricX than the rank‑fusion baseline it replaces. Since no references were available for these pairs while we were building them, we calibrate every selection decision on last year's WMT25 human judgments. The human evaluation, released after construction, shows the cost of getting selection wrong: our references stand with the strongest participating systems when the selector kept a frontier‑model candidate, and fall up to 17 ESA points below them when it did not. We release the selection method and the provenance of every reference (https://github.com/surrey‑nlp/PseudoRef)
Authors:Rohith Reddy Bellibatlu, Manpreet Singh, Zhoutian Han, Wenbin Zhang
Abstract:
A clinical agent benchmark can report the same verdict on identical inputs while the agent files a materially different order on each run. Such agents order tests, request medications and place referrals, yet benchmarks typically score one run per task and rarely ask whether identical inputs produce identical actions; MedAgentBench, the benchmark we use, scores a single attempt and says so. To measure this gap we introduce "same‑input rerun", which replays a task with every input held fixed and compares the orders rather than the score, with six reliability metrics, and apply it to 1000 MedAgentBench runs across 50 tasks from its five write‑capable families, two open‑weight models below ten billion parameters quantised to four bits, and two temperatures. The study establishes that action‑level divergence exists and can pass unrecorded by the score, not that any rate generalises. Under the 8B model at temperature 0.7, all 43 ordering groups emit a different set of orders across five identical runs, 26 emit the order on some runs and not others, and 28 record a different coded value, dose or analyte. In 22 of those 43 the benchmark reports the same failing verdict for materially different behaviour, as it does for all 10 divergent groups of the 4B model at 0.7. Orders also reach different endpoints across runs, one of which the record server rejects while the agent is told it succeeded. These findings motivate repeated‑run evaluation, action‑level stability reporting and execution‑faithful environment feedback in clinical‑agent benchmarks.
Authors:Jerry Adams Franklin
Abstract:
Federated fine‑tuning of large language models with low‑rank adaptation reduces per‑client trainable parameters, but client‑to‑server communication remains the dominant cost. Existing accounting for federated LoRA protocols omits the asymmetric transition round when a protocol changes aggregation mode, and reports savings that ignore grouped‑query attention shapes. This paper measures per‑round upload and download bytes for a bidirectional B‑only federated LoRA protocol and places five methods, three from prior work, on a single communication‑quality frontier. The frontier has a knee, which an adaptive phase‑switching aggregator, ReverseAdaptive, locates by monitoring the relative improvement in global training loss against a dimensionless threshold rather than by fixing a phase boundary in advance. On TinyLlama‑1.1B‑Chat with Alpaca, ReverseAdaptive attains 40.5 percent measured round‑trip savings over FLoRA at a held‑out instruction‑following loss cost of 0.0063. It outperforms FFA‑LoRA, which freezes the first of the two LoRA factors at initialization, by 0.0182 in held‑out loss, more than twenty times the largest per‑method seed standard deviation on that metric, so learning that factor before freezing it produces better adapters. The same threshold transfers across model scales without retuning, and the quality cost of the transition is stable across the two datasets tested.
Authors:Ben Tang, Zachary Spalding, Gregory B. Cogan
Abstract:
Brain‑computer interfaces (BCIs) decode neural activity to restore lost function. Typically, training a high‑performance neural decoder requires a large labeled dataset to be collected from every new subject. One way to reduce the labeled data cost is self‑supervised pretraining, which learns general neural representations from unlabeled recordings that accumulate across subjects. However, for intracranial electroencephalography (iEEG) recordings, self‑supervised learning has been challenging due to differences in contact placement and neuroanatomy between subjects. We propose MAPA, an otherwise vanilla masked autoencoder with two spatial encodings, an anatomical region embedding and a relative positional encoding, which together enable it to learn neural representations that transfer to unseen subjects and across various tasks. MAPA sets a new state of the art across all three regimes of the Neuroprobe benchmark without fine‑tuning: within‑session, cross‑session, and cross‑subject. In the cross‑subject regime, a linear probe on MAPA's features needs only ~164 labeled trials to reach the accuracy that takes 3,500 without pretraining. Our results show that self‑supervised pretraining can scale across heterogeneous iEEG recordings and reduce the labeled data needed for accurate decoding in new subjects.
Authors:Tingjun Huang, Dmitry Rudshin, Mathieu Meyer, Pietro Bonazzi, Marc Pollefeys, Emilia Szymańska
Abstract:
Recent developments in feed‑forward 3D reconstruction resulted in models which can recover dense scene representations and camera motion solely from an image stream. However, such predictions are prone to becoming inconsistent over long trajectories, specifically in demanding environments with repetitive structures, weak textures and dynamic objects or people. One way to mitigate those challenges is to use an omnidirectional camera, which provides wide spatial coverage and captures richer visual information. Yet, the majority of models do not offer support for 360‑degree imagery or require additional fine‑tuning. To bridge these two aspects, we present RIGOR: a large‑scale reconstruction pipeline for gravity‑aligned omnidirectional videos that retains a frozen feed‑forward perspective backbone and exploits each panorama as a four‑view virtual rig. The rig structure is used to detect and repair locally inconsistent predictions, to retrieve loop closures through cyclic four‑view consensus, and to geometrically verify candidate revisits before global optimization. Verified constraints drive a Sim(3) pose graph that corrects accumulated rotation, translation, and scale drift along the sequence. We demonstrate that the proposed consistency mechanisms improve both trajectory accuracy and reconstructed geometry over a feed‑forward baseline on challenging construction‑site sequences. The code is made available under this link: https://github.com/TangentH/RIGOR.
Authors:Sudarshan Regmi, Arvind Pillai, Yu Yvonne Wu, Yuliang Chen, Bibek Panthi, Tess Z. Griffin, Michael V. Heinz, Lisa Marsch, Nicholas C. Jacobson, Andrew Campbell
Abstract:
Timeseries multimodal large language models (TS‑MLLMs) have recently begun leveraging the reasoning capabilities of large language models (LLMs) for question‑answering tasks. However, these models often fail to capture dynamic temporal patterns, providing only implicit reasoning that lacks the underlying explanations critical for high‑stakes applications like healthcare. While reinforcement learning (RL)‑based timeseries language models aim to address this, they often fall short because they are trained on narrow, in‑distribution data and struggle with out‑of‑distribution compositional questions. To address these challenges, we present TimeThink, a synthetic framework for eliciting compositional timeseries reasoning. Core timeseries primitives (e.g., trend, seasonality) are domain‑independent and can be deterministically generated. Guided by this premise, TimeThink first designs a synthetic data generator that produces atomic and composite question‑answer pairs, providing objective ground truth with reasoning traces. Building on this framework, TimeThink employs a reinforcement learning with verifiable rewards (RLVR) training strategy that encourages explicit reasoning. Unlike template‑reliant methods, this approach enables the model to learn the underlying logic of composition rather than simply imitating traces. Extensive experiments show that TimeThink, trained only on synthetic data, significantly outperforms strong baselines on both synthetic and real‑world benchmarks.
Authors:Kento Nishi
Abstract:
Speech‑to‑speech LLMs like Moshi, and its derivative PersonaPlex, can listen and speak concurrently through full‑duplex generation. However, they can begin speaking inappropriately during prolonged user silence: under digital‑zero input, Moshi and PersonaPlex initiate speech in 30% and 27.5% of five‑minute continuations, respectively. What causes this spurious speech? We investigate two hypotheses: either repeated sampling selects speech despite persistently low onset probabilities, or self‑conditioning on nonspeech outputs causes an abrupt spike in onset probability. We find that, at every observed onset, speech probability spikes by over nine orders of magnitude in one 80‑ms frame, supporting the latter hypothesis. Then, to suppress these onsets without blocking genuine responses, we ask a causal counterfactual question: is the model responding to user speech, or would its next‑token distribution remain similar if the preceding user input were muted? Accordingly, we suppress onsets whose distributions change little under this intervention. Under realistic microphone noise, our method suppresses spurious onsets, while preserving genuine responses: one‑sided 95% lower confidence bounds are 98.68% and 98.82% for Moshi, and 96.90% and 99.25% for PersonaPlex. Our inference‑time method runs in real‑time without retraining, with 95th‑percentile decision time below 61 ms, within the 80‑ms frame budget. Our code is available at https://github.com/KentoNishi/icassp27‑spurious‑onsets.
Authors:Lucas Rafael Stefanel Gris, Alef Iury Siqueira Ferreira, Frederico Santos de Oliveira, Augusto Seben da Rosa, Alexandre Costa Ferro Filho, Arlindo Rodrigues Galvão Filho, Anderson da Silva Soares
Abstract:
We introduce CVSS‑X, a large‑scale synthetic speech‑to‑speech translation corpus that extends CVSS by reversing the translation direction. While CVSS translates from 21 languages into English, CVSS‑X enables translation from English into 28 target languages spanning 12 language families. The corpus comprises approximately 240,000 parallel speech pairs per language, totaling over 16,000 hours, eight times larger than CVSS. We provide two variants: CVSS‑X‑C with two canonical voices per language, and CVSS‑X‑T with cross‑lingual voice cloning, both fully generated. Evaluation shows comparable translation quality to CVSS with consistent performance across typologically diverse languages. Combined with CVSS, this enables research on bidirectional and multilingual speech‑to‑speech translation. The code is available at https://github.com/ErmisAI/XVSS‑X and the dataset under CC‑BY‑NC 4.0 license at https://huggingface.co/datasets/lgris/XVSS‑X.
Authors:Qian Guo, Yidan Hu, Rui Zhang
Abstract:
Coordinated manipulation is collective: plausible accounts can jointly distort ratings, rankings, and engagement. Existing defenses primarily construct evidence from identities, graphs, content, or co‑activity. We introduce an aggregate‑first evidence layer that treats distortion of a context‑level outcome distribution as the primary evidence object. The engine observes only a histogram, count, resolution, and reference distribution; identities are withheld until interval evidence is fixed. Because raw discrepancies have positive finite‑sample expectation, we subtract a matched null expectation to obtain signed evidence and account for reference uncertainty. Participation logs then accumulate these fixed increments across accounts. We characterize matched‑exposure divergence, bound self‑influence, establish finite‑horizon separation, and derive an exact linear reuse law for paired contexts. We evaluate the mechanism with controlled rotation experiments and paired counterfactual interventions on historical Amazon review streams. Historical reviews provide the behavioral background; synthetic identities provide known coalition membership, and exact clean twins provide counterfactual controls. In a fixed‑attack sweep against historical non‑donor comparison accounts, reassigning the same manipulated events across identities with increasing reuse raises account‑score ROC‑AUC from 0.500 to 0.797. With activity‑ and exposure‑matched clean twins, frequency is at chance while counterfactual attribution achieves ROC‑AUC 0.744. Under a mean‑preserving shape intervention, Wasserstein‑1 and Jensen‑Shannon evidence achieve ROC‑AUC 0.909 and 0.967, while frequency and mean‑based attribution remain at chance. Aggregate evidence complements repeated co‑activity, improving mixed‑mechanism ROC‑AUC from 0.750 to 0.874 with a simple untrained combination.
Authors:Hai-Dang Nguyen, Minh-Phuong Pham, Thao Thi Phuong Dao, Trong-Le Do, Vinh-Tiep Nguyen, Trung-Nghia Le
Abstract:
This paper presents ViFA‑Council, a three‑stage multi‑agent framework that employs multiple large language models (LLMs) to tackle two culturally complex generative tasks: image outpainting and educational story generation based on traditional Vietnamese folk paintings. Current single‑model generative pipelines frequently struggle with stylistic hallucinations and cultural misrepresentations because they lack mechanisms for cross‑model critique. ViFA‑Council addresses this challenge by orchestrating collaboration among GPT‑4o, Gemini 3.1 Pro, and Claude Sonnet 4.6. It enforces rigorous cultural constraints through structured agent deliberation. This deliberation is mediated by task‑specific JSON schemas that effectively bridge natural language discussions with diffusion‑based image synthesis using Banana Pro. Experiments and a user study demonstrate that structured multi‑agent deliberation is a promising direction for improving cultural fidelity and narrative coherence in culturally sensitive, low‑resource artistic domains. The source code and data are released at https://github.com/DanielNguyen‑05/ViFA‑Council.
Authors:Changbo Yan, Zhongbo Zhang, Zaibin Zhang, Yifan Wang, Lijun Wang, Huchuan Lu
Abstract:
3D point‑cloud observations are inherently ambiguous in complex, cluttered manipulation scenes, where target objects may be partially occluded or tightly intermingled with visually similar distractors. As a result, standard 3D diffusion policies often struggle to localize and exploit task‑relevant geometry as scene complexity grows. We propose Attention‑DP3, a spatially object‑aware 3D diffusion policy that injects object‑level geometric cues via attention while keeping the DP3 diffusion backbone unchanged. Our pipeline performs open‑vocabulary 2D segmentation on RGB images, then lifts predicted target masks into 3D using calibrated camera geometry to obtain object‑centric geometric priors. We incorporate these cues through Tri‑field Attentional Conditioning, which constructs three complementary fields: (i) a targetness field to anchor the target object, (ii) an intra‑target saliency field to emphasize task‑relevant geometry within the target, and (iii) a backgroundness field to suppress distractors and clutter. Experiments on Adroit, DexArt, MetaWorld, and the real‑world SO101 platform show consistent improvements over DP3, achieving state‑of‑the‑art performance across benchmarks. Notably, as distractor objects increase, DP3 drops sharply, whereas Attention‑DP3 remains stable and outperforms DP3 by up to 31% under heavy clutter. The code is publicly available at https://github.com/zhangzhongbo2213/Attention‑DP3.
Authors:Saibal Ghosh, Samarup Bhattacharya, Sanjoy Kumar Saha, Umapada Pal, Tapabrata Chakraborti
Abstract:
Medical image classification is frequently complicated by transitional categories whose feature distributions overlap those of adjacent classes, producing ambiguous decision boundaries. Conformal prediction returns uncertainty‑aware prediction sets, but these are not directly actionable in clinical screening, where a single decision is required. This work proposes adaptive conformal redistribution (AdaConRed), a label‑free post‑conformal decision rule that converts ambiguous prediction sets into refined class assignments. A five‑stage pipeline is developed. Vision‑language generative augmentation addresses minority‑class scarcity; a frozen DermFoundation encoder provides embeddings; a lightweight multi‑layer perceptron performs classification; an entropy‑modulated, margin‑aware nonconformity score constructs adaptive prediction sets; samples predicted as transitional with multi‑label sets are reassigned to the most probable alternative class within the set, using only model outputs at inference. Evaluation uses the OSCC oral lesion and ISIC skin lesion benchmarks at a miscoverage level of 0.2. On the 3‑class OSCC benchmark, overall accuracy improves from 73.54% to 77.38%, with oral cancer accuracy rising from 64.29% to 82.14% and benign accuracy from 56.57% to 70.20%. Reassignment of transitional samples reduces OPMD accuracy from 84.78% to 80.16%, consistent with the asymmetric cost of missed malignancy. On ISIC, overall accuracy improves from 85.83% to 87.19%, melanoma accuracy rising from 66.04% to 68.34%. AdaConRed outperforms LAC, APS and RAPS under an identical backbone and redistribution rule. Conformal prediction can be extended beyond uncertainty quantification toward actionable decision support where transitional disease categories are present, with gains concentrated in the clinically critical malignant categories. Code repository: https://github.com/saibal436ghosh/AdaConRed.
Authors:Bin Sun, Jianan Mu, Jiaxi Zhang, Rengang Zhang, Zhiteng Chao, Jing Ye, Huawei Li
Abstract:
Approximate logic synthesis (ALS) improves circuit power, performance, and area by trading exact correctness for bounded functional error. However, existing structural ALS methods largely overlook structural bias: even functionally equivalent netlists can expose markedly different approximation opportunities and lead to substantially different outcomes under the same downstream ALS flow. Our experiments show that this effect can induce final area gaps of up to 42.77%. To unlock this opportunity, we propose E‑ALS, an e‑graph‑based framework for approximation‑aware structural search. E‑ALS combines Function‑Reduced Saturation, an ALS‑coupled surrogate, search‑based extraction, and budget‑guided refinement to identify approximation‑friendly equivalent structures. Experiments on well‑established arithmetic and logic benchmarks show that E‑ALS achieves additional area reductions of 3.2 and 7.0 percentage points under maximum Hamming‑Distance and Error‑Distance constraints, respectively. Code is available in https://github.com/ZenuSunB/Ecompile.git.
Authors:Amey Thakur
Abstract:
Gesture recognition on video is normally posed as classification: label each frame, then act on the label. That is adequate for control, where a command may be obeyed several frames late without a user noticing, and inadequate for synchronisation, where an output must be aligned to the frame on which the gesture physically occurred. We take the synchronisation problem for one common movement, the rotation of an open hand about its long axis, and show that it admits an exact solution needing no classifier, no training data and no calibration. Let s be the normalised two‑dimensional cross product of the two palm edges at the wrist and the outer knuckles, under the projection the camera already performs. We prove that s factorises as k(theta)cos(theta) with |k| > 0 everywhere, so s vanishes exactly when the palm is edge‑on and its sign tracks the face presented to the camera. Detection is therefore a zero crossing of one scalar, which yields an instant rather than an interval, and we prove the criterion invariant to image mirroring, hand scale and handedness, all from its algebraic form rather than from the landmark estimator. A two‑handed interaction uses four fingertips as a window onto a restyled version of the same scene. We give a coverage predicate that stays correct when the hands cross, where the usual triangulation does not, and derive each free parameter of the three stylisation operators from a noise statistic rather than by inspection. Against a corpus with exact ground truth the criterion detects 95% of flips with no false positive in 240 near‑miss sequences, and places each within 6.7 ms on average of the instant it occurred, a sixth of the interval at which the hand is observed, against 23.0 ms for reporting the bracketing sample. Reporting an event more finely than one samples follows from treating a gesture as the zero of a continuous quantity rather than a label.
Authors:Yuhua Jiang, Junjie Lu, Feifei Gao
Abstract:
Test‑time scaling (TTS) can improve generation only when additional compute produces better candidates and the system can reliably identify them. This distinction is especially important for video world models, where a wider sample pool may contain stronger rollouts without improving the output that is ultimately selected. We introduce the Compute‑Value Audit (CVA), a sequential framework that asks whether extra sampling creates opportunity, observable signals provide a reliable state, that state supports a beneficial action, and the resulting gain exceeds the full entry fee of generation and verification. On 192 Physics‑IQ scenes, expanding the pool from 4 to 16 candidates increases oracle quality by +9.23 IQ (95% CI [+7.44, +11.14]), but Flow, Cycle, and VideoReward fail to recover this headroom reliably. Across three generators, none of twelve adaptive‑depth policies outperforms uniform compute; they recover only 42‑69% of the measured entry fee. A matched‑60‑NFE Predict‑and‑Perturb intervention on VideoPhy2 is likewise negative across three fresh‑seed replicas. These negative results are not universal: anchor‑explorer passes all four stages in a sparse PRM800K setting, MMLU‑Pro exposes the gap between predictive state and useful action, and a privileged paired future establishes a positive video upper bound. Together, these results show that sampling headroom has deployment value only when it can be converted into a reliable decision whose benefit survives the complete compute charge. Code is available at https://github.com/YuhuaJiang2002/sampling‑headroom‑is‑not‑selection‑gain.
Authors:Ryota Takatsuki, Tomoki Doi, Amane Watahiki, Anil K. Seth, Hitomi Yanaka
Abstract:
Bistable images such as the duck‑rabbit are classic stimuli in which one image supports multiple mutually incompatible interpretations, typically reported one at a time in humans. We ask whether multimodal large language models (MLLMs) show similar report behavior and what internal computations support it. Using the LLaVA family, we study two tractable dimensions: modulability, whether reports can be biased by bottom‑up visual cues and top‑down linguistic priors, and exclusivity, whether responses commit to a single interpretation. We test both on the canonical duck‑rabbit and on synthetic Visual Anagrams to mitigate memorization confounds. Behaviorally, both visual and linguistic manipulations systematically shift reports in human‑consistent ways, while responses remain predominantly exclusive. Mechanistically, these effects arise from competing image‑token representations, distinct pathways for bottom‑up and top‑down modulation, and a link between exclusive reporting and object‑count encoding. Code and data are available at https://github.com/rtakatsky/mllm‑bistable‑images.
Authors:Ahmetcan Yavuz, Alpay Ozkan, Rémi Pautrat, Shaohui Liu, Marc Pollefeys
Abstract:
Plane segmentation from a single RGB image remains challenging due to imprecise region grouping and geometrically inconsistent supervision, often leading to over‑segmentation and false planar detections. We propose instead a pixel‑wise planarity prediction framework for robust monocular plane segmentation. Building on a pretrained monocular geometric backbone predicting depth and surface normals, we introduce a dedicated planarity head that estimates per‑pixel planarity confidence. During inference, predicted depth, normals, and planarity are combined in a lightweight region‑growing procedure that enforces geometric consistency when forming plane segments. We further analyze existing plane ground‑truth annotations and demonstrate substantial geometric inconsistencies under strict distance thresholds. Across multiple datasets, our method achieves improved geometric precision and segmentation quality compared to prior state‑of‑the‑art approaches, while improving computational efficiency. Our code and models are available at https://github.com/alpayozkan/PixelwisePlanarity.
Authors:Jian Li, Fanfan Ji, Jinxiang Lai, Ying Tai, Jian Yang, Xiao-Tong Yuan, Chengjie Wang, Yabiao Wang
Abstract:
The AffectiveArt Multidimensional Art Emotion Understanding task asks to jointly predict an artwork's fine‑grained emotion (12 classes, 1549:1 head‑to‑tail ratio), binary valence/arousal, and five attribute‑grounded descriptions ‑‑ sub‑tasks that exhibit strong empirical trade‑offs, so the single‑model solutions we tried do not jointly optimize all of them well. We present ArtSociety, a multi‑agent framework that assembles heterogeneous multimodal experts ‑‑ a DINOv2‑Giant vision agent (A1), a scene‑grounded CoT fine‑tuned MLLM (A2), and three closed‑source reasoning agents (A3‑A5) ‑‑ and coordinates them with two training‑free controllers: (i) a rare‑class‑aware voting arbiter that lowers the agreement threshold for tail emotions, exploiting decorrelated error patterns across agent families; and (ii) a description‑first reasoning agent whose DESCRIBE‑then‑CLASSIFY chain of thought forces visual evidence before label commitment, yielding near‑perfect grounded descriptions. A task‑routing policy directs the hard emotion task to the full five‑agent ensemble while assigning the near‑saturated valence/arousal and generative description tasks to the single strongest reasoning agent. On the official test set (1,000 artworks), ArtSociety achieves an Overall Score of 0.8870 (Classification 0.7789, Description 0.9952). An eleven‑variant ablation study reveals that, once method and scale saturate at around 0.76, the decisive gains come from agent collaboration and data‑side supervision ‑‑ a 30B MoE model trained on older data does not outperform an 8B model trained on better data. Code is available at https://github.com/swordlidev/ArtSociety
Authors:Ajo Babu George, Govind Arun, Sidharth N Krishna, Uma Ranjan
Abstract:
Maxillofacial report generation from cone beam computed tomography is scored here by a composite objective placing 80% of its weight on a large language model judgement of factual entailment and 20% on lexical overlap, of which only the lexical fifth is visible during development. The grader's BLEU‑4 and METEOR routines are reproduced in pure Python and match the reference to machine precision, and an offline entailment surrogate, which tells a report written for one patient from one written for another at an area under the curve of 0.987, makes the composite objective cheap enough to optimise directly. Over the 622‑case public release, a report selected against the visible lexical ranking scores 0.2909, whereas one selected against the composite objective scores 0.4122, because pursuing n‑gram overlap drives entailment precision from 0.522 down to 0.266. A 29 million parameter encoder fine‑tuned on the release reaches a prevalence‑weighted out‑of‑fold area under the curve of 0.486 over 985 statements, indistinguishable from the corpus prior, while nine numbers read from the image header reach 0.945 for mandible coverage and 0.872 for condyle coverage, and acquisition centre alone predicts sentence choice at 0.718 against 0.663 for the image‑derived model, identifying dictation convention rather than anatomy as the quantity the lexical metrics reward. The delivered system emits eight unconditional statements and five gated on header geometry under polarity, laterality and tooth‑level consistency constraints, and reaches METEOR 0.3542 over 50 held‑out cases from an unseen centre. The dataset and code are available at https://github.com/GIND123/CBCT‑Clinical‑Reasoner
Authors:Ajo Babu George, Govind Arun, Sidharth N Krishna, Uma Ranjan
Abstract:
Orthodontic report generation from intraoral data is normally cast as multimodal captioning, yet the released Bite2Text scan pairs are supplied already registered in occlusion, which makes several core occlusal quantities directly measurable rather than inferable. The system reported here exploits that property: an anatomical frame is recovered per case from arch taper and arch closure instead of the stated RAS convention, which does not hold across the release, and each arch is reduced to an occlusal ridge profile in arch‑angle coordinates yielding overbite, overjet, midline deviation, transverse overlap, crossbite extent, cusp interdigitation lag, and the occlusal curves in closed form. Gradient boosting maps 31 such measurements onto 13 template fields, a field being predicted only where patient‑level cross‑validation beats its own majority baseline, and a deterministic renderer emits the corpus six‑part narrative; a ConvNeXt‑Tiny classifier over the five standardised photographic views is fused per field, raising mean field accuracy from 0.601 to 0.683. Reimplementation of the challenge evaluator shows that its BLEU‑4 and METEOR are local variants whose F‑mean weights recall nine to one, that two clinicians agree on 47 percent of findings for the same patient, and that a constant report consequently outscores a genuine second clinician report by 0.165 captioning. Held‑out scores reach BLEU‑4 0.458 and METEOR 0.677 against intraoral scan references and 0.278 and 0.507 against photograph references, and the submitted system placed third in the ODIN 2026 Bite2Text test phase at 0.2680 and 0.4629, within 0.022 BLEU‑4 of first, running on CPU in under ten seconds per case. The dataset and code are available at https://github.com/GIND123/ODIN_toothfairy4
Authors:Md Selim Sarowar, Sungho Kim
Abstract:
Networked manipulation endpoints couple perception to actuation across compute‑ and bandwidth‑limited links, yet commonly exchange dense geometric states optimized for fidelity rather than action outcomes. A stochastic representation is learned with a policy‑free, action‑conditioned outcome bottleneck: marginal outcome log‑loss supplies distortion and a KL term regularizes rate. The construction is motivated by the minimal statistic that preserves the outcome distribution of every admissible action, while the implemented finite model is evaluated as a rate‑regularized mixture predictor. The same encoder and outcome head support grasp selection, singleton conformal filtering, active viewpoint selection, and latent test‑time adaptation. A finite‑probe theorem identifies the local level‑set tangent space with the null space of an outcome Jacobian. The synthetic oracle verifies this result; on scanned objects, an analytic surrogate agrees with measured simulator invariances within \(0.56^\circ\). Across 11,979 simulated grasps on 13 objects, a reconstructed‑geometry wrench score attains 0.542 AUC against lift success and falls below chance on curved objects, while our representation attains 0.876. At 25% commitment, executed‑grasp success is 0.503 versus 0.984. The 512‑byte interface is \(288×\) smaller than one RGB‑D frame and runs at 16\,ms per CPU decision. Independent synthetic points track the tested conformal levels; scanned‑object all‑pair coverage is reported as a clustered empirical diagnostic. On unseen objects, within‑scene AUC falls to 0.569, and a full‑feedback update raises empirical mean pairwise coverage from 0.728 to 0.883.
Authors:Yusuf Abdulkadir
Abstract:
Machine learning for neglected tropical diseases is limited by data, not algorithms: public annotated image sets for leprosy (Hansen's disease) number in the hundreds, orders of magnitude below what generative models require. We ask whether a model trained on abundant chronic wound photography transfers to this low‑data regime. We build a three‑stage pipeline. First, a DeepLabV3‑ResNet50 segmentation network (validation Dice 0.876, IoU 0.799) supplies lesion masks for two wound datasets that ship without them. Second, we assemble a mask‑conditioned latent diffusion model from Stable Diffusion 1.5 components and train it on 3,280 region‑of‑interest wound crops, widening the UNet input convolution from 4 to 11 channels to admit three mask feature maps and a blurred low‑frequency context latent. Third, we fine‑tune this model on 708 leprosy image‑mask pairs drawn from 764 images of approximately 150 patients. We evaluate with LPIPS perceptual distance, anchored by a real‑versus‑real baseline computed on the same 242 anchor images as the cross‑set comparisons; without that reference the cross‑set distances cannot be interpreted. The generated set shows no mode collapse: its internal perceptual diversity (0.662) is statistically indistinguishable from that of the real leprosy set (0.672, 95% CI [0.664, 0.680]). Generated images sit 0.044 LPIPS outside the real distribution ‑ measurably apart, but under half of one standard deviation. Fine‑tuning shifted the output distribution only marginally, which we trace to lesion geometry reaching the network through input concatenation alone. Chronic wound photography is therefore a viable donor domain for leprosy lesion synthesis: low‑level appearance transfers well, and the remaining barrier is semantic control rather than image quality.
Authors:Feisal Alaswad, Batoul Aljaddouh, Maher Alrahhal, Wafaa Al Nassan, Talal Bonn
Abstract:
This study compares traditional machine learning models and Large Language Model (LLM)‑generated rule‑based systems for heart disease prediction using the UCI Heart Disease dataset. Several classifiers, including Logistic Regression, K‑Nearest Neighbors (KNN), Support Vector Machine (SVM), Naive Bayes, Decision Tree, and Random Forest, were evaluated alongside rule‑based systems generated using GPT‑4o and Claude Sonnet 4.6. Model performance was assessed using accuracy, precision, recall, and F1‑score metrics. Experimental results show that traditional machine learning models consistently outperform LLM‑generated rule‑based systems in predictive performance. Random Forest achieved the best overall performance with 90.2% accuracy, a precision of 0.829, perfect recall of 1.0, and an F1‑score of 0.906. Naive Bayes followed closely with 88.5% accuracy and an F1‑score of 0.881. In contrast, the LLM‑generated rule models achieved lower performance, with Claude Sonnet 4.6 reaching 80.3% accuracy (F1‑score: 0.833) and GPT‑4o obtaining 70.5% accuracy (F1‑score: 0.690). Despite the performance gap, the LLM‑generated rules provide interpretable IF‑THEN diagnostic logic that enhances explainability and transparency in clinical decision‑making. These findings highlight the trade‑off between predictive performance and interpretability in medical artificial intelligence systems. The complete implementation of all experiments, including machine learning models and LLM‑derived rule classifiers, is publicly available in the GitHub repository at https://github.com/FeisalAlaswad/LLM‑Rule‑ML‑Heart‑Disease‑Prediction .
Authors:Yongqi Yu, Yu Zhang
Abstract:
Large Vision‑‑Language Models (LVLMs) are increasingly expected to perform visual question answering (VQA) over planar media. However, existing planar VQA benchmarks typically emphasize isolated challenges: some emphasize long‑document understanding with limited reasoning depth, while others require complex visual reasoning but remain restricted to single‑page, noise‑free settings. Moreover, through theoretical analysis, we identify the impact of irrelevant visual tokens, which leads to measurable performance degradation but has received little attention with respect to systematic quantification. To address these limitations, we introduce TestHallVQA, a multi‑image VQA benchmark that simultaneously embodies document‑level scale and the difficulty of human examinations, while providing comprehensive task coverage. Leveraging TestHallVQA's ability to controllably inject multi‑level contextual redundancy, we further propose a novel metric, F1‑R\textsuperscript2, which jointly quantifies LVLMs' computational reasoning capability and their evidence retrieval robustness against document‑level redundancy. Extensive experiments and analyses on mainstream LVLMs reveal their latent deficiencies across multiple dimensions, offering concrete insights and directions for future research. The associated datasets, code, and complete theoretical derivations are available at https://github.com/yqyu2317/TestHallVQA‑benchmark.
Authors:Mahbub Ul Alam
Abstract:
Cognitive offloading is the use of external aids, such as notes, calculators, or search engines, to reduce mental effort. Large language models (LLMs) extend this to thinking itself, and by AI‑associated cognitive offloading, I mean the pattern where a person routinely substitutes LLM output for their own reasoning, idea generation, learning, or communication. Recent empirical work reports associations between some patterns of LLM use and changes in critical thinking effort, neural engagement during assisted tasks, creative diversity, learning behaviour, and social dependence. Validated instruments for AI reliance, dependence, and literacy have begun to appear. I describe PAUSE (Patterns of AI Use: Self‑Examination), a privacy‑by‑design web tool (link: https://anondo1969.github.io/pause) that occupies a different niche from these. It is a lightweight, non‑diagnostic reflection aid for private individual use. PAUSE is organised around how a person's own LLM use may relate to cognitive offloading across four everyday domains ('reasoning & critical thinking', 'creativity & originality', 'research & learning', and 'social & communicative capacity'). It delivers a short, free, no‑login self‑check, scores it entirely in the browser, and returns descriptive, domain‑aware reflections. The self‑check pairs reverse‑scored behavioural items with a claim‑evaluation reasoning probe, an alternative‑uses creativity probe, and a small retrospective before‑and‑after block. PAUSE does not assume that AI use is harmful. It only addresses where AI substitutes for effort a person may want to preserve. The application is privacy‑preserving by design: scoring is deterministic and runs client‑side, no personal data is required, nothing is transmitted or stored beyond the browser session, and no LLM is involved in production. PAUSE is a self‑reflection tool. It is not a validated psychological instrument.
Authors:Shamin Chokshi
Abstract:
Recent advances in large language models (LLMs) have made prompts increasingly large and complex. Techniques such as chain‑of‑thought reasoning (Wei et al., 2022) and in‑context learning (Brown et al., 2020) frequently push real‑world prompts past several thousand tokens, increasing inference cost and latency. Learned compression methods such as LLMLingua (Jiang et al., 2023) and Selective Context (Li et al., 2023) achieve high compression ratios but require auxiliary language models and are non‑deterministic. We ask a complementary question: how far can a training‑free, fully deterministic, CPU‑only pipeline based on classical lexical NLP be pushed before output quality degrades significantly? Eleven toggleable lexical transformations ‑ stopword removal, filler‑phrase deletion, contraction and abbreviation substitution, part‑of‑speech‑based pruning, lemmatization, WordNet‑driven synonym shortening, and named‑entity preservation ‑ are assembled into a configurable pipeline. Fifteen configurations are evaluated on 1,242 English‑only prompts from six sources (Dolly‑15k, LMSYS‑Chat‑1M, WildChat‑1M, MMLU, GSM8K, HellaSwag), spanning eleven automatically derived task categories, yielding 18,630 paired GPT‑4o‑mini completions. Output preservation is measured using BLEU, ROUGE‑1/2/L, BERTScore‑F1, and SentenceBERT cosine similarity. The most aggressive configuration achieves a mean token reduction of 40.3% (sigma = 9.2) at a BERTScore‑F1 of 0.876 against the original‑prompt output; a stopword‑only configuration achieves 29.6% reduction at 0.913. The compression‑versus‑fidelity Pareto frontier is characterized per task category, with commonsense reasoning a systematic failure mode under aggressive compression. All code, prompts, and per‑cell results are released for reproducibility.
Authors:Aditya Karnam Gururaj Rao, Arjun Jaggi
Abstract:
For local large language model agents, active context is a scarce resource: memory capacity, prefill latency, cache growth, and service objectives all constrain how many input tokens each call can afford. We present BudgetBench, an active‑budget protocol and reference harness that treats the per‑call input‑token budget as the independent variable when comparing memory strategies. Holding the model, task, sampler, and decoding fixed, it sweeps budgets over 2K, 4K, 8K, 16K, and 32K tokens and records quality, budget utilization, latency, and, as a first‑class outcome, budget‑violation rates. The core contribution is this reusable measurement surface: a swappable MemoryStrategy contract, explicit budget enforcement, deterministic or versioned graders, prompt‑audit metadata, and reproducibility artifacts, released at https://github.com/aviskaar/budgetbench. We substantiate the protocol with pilot studies rather than final rankings. Across a local qwen2.5:1.5b pilot (89 items each on SWE‑bench Verified and LongBench v2), a hosted 50‑item Qwen3 30B‑A3B LongBench replication with exact tokenization, and a 500‑item LongMemEval oracle study scored by the official GPT‑4o evaluator, the harness exposes budget‑compliance failures, non‑monotonic quality curves, and operating points that single‑budget evaluation hides. The budgeted‑versus‑full‑context direction remains unresolved: the local slice is near‑null and the hosted replication favors full context in point estimate. We report results transparently, including that the early pilot's tokenizer approximation undercounts some served‑model prompts, so its violation rows are tokenizer‑approximation diagnostics, not claim‑bearing results; all timings are operational diagnostics. The reusable contribution is the protocol, harness, and failure‑reporting discipline needed to scale fixed‑budget memory‑strategy evaluation.
Authors:Yu-Rou Tuan, Hao-Tang Tsui, Nicolas Ugrinovic, Kris Kitani, Xiaoxuan Ma
Abstract:
Part‑aware 3D asset generation enables applications such as editing, articulation, simulation, and fabrication, yet existing methods can generate visually complete individual parts without ensuring that they form a valid physical assembly. Consequently, generated neighboring parts may interpenetrate, lack valid connections, or collapse under gravity. We propose a physics‑guided framework for improving single‑image part‑aware 3D generation with physically compatible geometry and stable connections. Our method resolves inter‑part penetration, recovers a contact graph between neighboring parts, and introduces parameterized connectors at their contact surfaces. Using feedback from physical simulation, we refine connector placement, orientation, and dimensions to improve assembly stability while preserving the generated geometry. We further introduce a physics‑based evaluation protocol that complements conventional geometric metrics by directly testing assembly validity and stability under gravity. Experiments comparing against multiple part‑aware 3D generators show substantial improvements in physical realizability and stability while maintaining geometric quality. We additionally validate the resulting parts through 3D printing and real‑world assembly.
Authors:Amine Andam, Jamal Bentahar, Mustapha Hedabou
Abstract:
Significant progress has been made in safeguarding deep reinforcement learning (DRL) policies against input perturbations. Developing robust DRL involves three main stages: algorithm design, implementation, and evaluation. In this work, we identify and address a key limitation at each stage. First, we introduce Adversarial Importance Sampling (Advis), a method that uses importance sampling over trajectories from standard training to estimate and optimize verifiable worst‑case returns. Advis satisfies three desirable criteria not jointly achieved by prior work: it requires no additional environment interactions, no auxiliary networks, and captures long‑term robustness. Second, we introduce advrl, a modular PyTorch library that provides clean, single‑file implementations of existing robustness methods and adversarial attacks, facilitating rapid prototyping and enabling reproducible and traceable evaluations. Third, we revisit evaluation under learned adversaries and show that optimal adversarial hyperparameters do not transfer across agents, which can lead to an overestimation of robustness when using a limited set of attacker configurations. Accordingly, we evaluate policies against a large and diverse set of attackers, using 6‑14x more configurations than prior work. Finally, we evaluate our approach on continuous control environments, demonstrating its effectiveness relative to existing baselines. The code is available at: https://github.com/AmineAndam04/advrl
Authors:Foad Namjoo, Remy Ogasawara, Amirali Abdullah, Cullen Anderson, Narmeen Fatimah Oozeer, Jeff M. Phillips
Abstract:
Binary‑choice truth benchmarks ask models to choose between a correct and an incorrect answer, but if the two answers differ systematically in surface‑level features, models can exceed chance without performing the intended reasoning. We show that this failure mode is detectable and can be exploited by downstream classifiers. In TruthfulQA, a simple six‑feature logistic classifier achieves substantial accuracy in separating correct from incorrect answers. We further show that similar surface‑level artifacts are present in additional benchmarks. To counteract this, we developed a general mechanism to clean them by removing the most leakage‑reinforcing pairs. We release a version of TruthfulQA with surface‑feature leakage reduced close to chance and provide a mechanism, Audit‑Prune, so that the datasets can be cleaned before release.
Authors:Mang Ye, Yucheng Ji, Yang Bai, Min Cao, Siyuan Chai, Bo Du, Min Zhang
Abstract:
Text‑based person search (TBPS) aims to retrieve images of a target person from a large image gallery based on a given natural language description. Most existing methods rely on supervised learning with manually annotated image‑text pairs. In this paper, we explore unsupervised TBPS, with only unlabeled images. We propose GTR+, a two‑stage generation‑then‑retrieval framework. In the generation stage, we introduce a tiered description generation framework designed to produce fine‑grained and stylistically diverse textual descriptions through a three‑tier sequential process. The base tier leverages an automated question‑and‑answer mechanism to generate basic visual attribute descriptions; the intermediate tier enhances fine‑grained detail using an inter‑sample contrastive mechanism; the advanced tier further enriches textual diversity via a stylized expansion mechanism. In the retrieval stage, to mitigate the impact of noisy pseudo texts, we develop an adaptive confidence‑weighted retrieval learning framework. We model image‑text pairs as clean or noisy using a Gaussian Mixture Model, calibrated by real‑time image‑text similarity and static text generation probability from the prior stage, yielding adaptive sample weights during training. Beyond that, we also contribute LargeFine‑Person, a large‑scale TBPS dataset with high‑quality, fine‑grained, and diverse textual annotations, enabling a practical and generalizable TBPS pre‑training benchmark under unsupervised setting. Experiments on multiple TBPS benchmarks demonstrate the effectiveness and generalization of both GTR+ and LargeFine‑Person. Code is available at: https://github.com/Flame‑Chasers/GTR.
Authors:Devansh Sharma
Abstract:
Sanskrit fuses case, number, person and tense into word endings and chains clauses into compounds, so it is information‑dense per word. Whether that density survives subword tokenization is a separate question, to be asked per unit of meaning rather than per word. On identical FLORES‑200 devtest content, Sanskrit costs 1.774‑2.187 times the English tokens under deployed tokenizers with vocabularies of 200,019 ids or more, but only 1.325‑1.353 times the Hindi tokens. Against a deployed English tokenizer, Sanskrit‑trained BPE arms then look cheaper per proposition than English on contemporary prose (0.887). Against a matched English control, the same algorithm and vocabulary trained on the English side of the same corpus, that flip disappears: at 32,000 and 64,000 pieces all 8 matched pairs, each size‑matched arm against both a pair‑matched and a byte‑matched control, sit above 1.0 on prose with 95% intervals excluding it. The gap closes as the vocabulary grows: at 128,000 pieces the BPE pair reads 0.983 in domain while staying above parity out of domain (1.025) and on FLORES (1.116). The ratio factorises into a character‑length ratio and a tokens‑per‑character ratio, the second near 1 throughout: what survives matched tokenization is character‑level length, which Sanskrit prose lacks over English in SLP1 (1.028) and Sanskrit verse has (0.596). The robust statement is about deployed practice: on contemporary prose and on FLORES, with the Sanskrit side in SLP1 against the deployed o200k English pivot, Sanskrit costs 1.831‑2.899 English tokens per proposition under the tokenizers people actually ship. Code, the results snapshot and every table here are public.
Authors:Bin Lin, Bo Zhao, Boyang Wang, Boyang Zhang, Boyong Wu, Chao Yan, Chen Geng, Chen Wu, Cheng Yi, Chengli Feng, Chenglin Zhu, DanNi Wan, Daxin Jiang, Dongqing Pang, Fei Tian, Feng Tian, Future Li, Gang Yu, Guanglong Yang, Jia Peng, Jiahao Song, Jiamin Fan, Jiangjie Zhen, Jianzheng Gao, Jun Chen, Li Xie, Lifang Zhang, Lingli Ji, Liying Shi, Lun Cai, Min Xu, Na Wang, Peilin Li, Peng Yang, Pengfei Tan, Qingjian Lin, Ruijie Xiong, Runze Li, Shenghua Hu, Shi Qiu, Siqi Tu, Siyi Zhou, Tianjiao Deng, Wanying Lu, Weiming Niu, Wen Sun, WenWen Qu, Xiangyu Zhang, Xianwei Zhang, XiaoSu Su, Xing Chen, Xinyu Liu, Xuerui Yang, Yang Li, Yang Yang, Yechang Huang, Yibo Zhu, Yifan Zhang, Yiyang Xu, Yu Fu, Yu Luo, Yu Zhou, Yumang Wang, Yunzhou Ju, Yuxiang Yang, Zekai Liu, Zengwei Yao, Zhenwei Mou, Zheqi Dai, Zhiyue Wu, Zichao Zhou
Abstract:
We introduce StepAudio 3 Gen, a general‑purpose audio generation model that supports zero‑shot text‑to‑speech (TTS), voice design, vocal generation, sound effects, music, vibe speech, and mixtures of multiple audio types within a unified framework. At its core, StepAudio 3 Gen is a discrete autoregressive generator that models audio directly over residual vector quantization (RVQ) tokens, departing from the diffusion Transformer‑based continuous generation paradigm prevalent in recent general audio models. Its StepAudio Tokenizer represents general audio at 12.5 Hz in a shared 16 × 2048 residual code space, jointly quantizing semantic and waveform‑level acoustic features so that each code layer preserves both types of information. For generation, the backbone predicts the first codebook along the time axis using autoregressive modeling, while a lightweight causal Transformer completes the remaining fifteen codebooks along the codebook axis. Our study further identifies three key design principles: (1) interference‑aware progressive pretraining for acquiring audio capabilities while preserving the textual abilities of the large language model, (2) RVQ Adaptor for effectively incorporating multi‑codebook acoustic representations, and (3) discrete autoregressive modeling over a shared representation across general audio domains. With progressive pretraining, multi‑task instruction training, and supervised fine‑tuning, StepAudio 3 Gen achieves state‑of‑the‑art performance on both TTS and voice design, while retaining strong generation capabilities across speech, vocals, sound effects, and music. Audio samples are available at https://stepaudiollm.github.io/step‑audio‑3‑gen/.
Authors:Wenzheng Zhang, Xueliang Zhang, Shulin He, Fei Zhao, Xin Liu, Pengjie Shen, Zhenlong Guo, Zixuan Xue, Hongtao Bao, Zixuan Li
Abstract:
A vocoder is a pivotal component of modern text‑to‑speech (TTS) systems. Despite the significant progress of neural network‑based vocoders, accurate phase reconstruction remains the main challenge limiting both audio quality and modeling efficiency. We introduce PhaseGAN, a lightweight vocoder that addresses this limitation through a "mel \rightarrow Amplitude \rightarrow Phase" reconstruction pipeline. By reconstructing amplitude and phase spectra via distinct methodologies, the proposed PhaseGAN outperforms state‑of‑the‑art baselines while utilizing fewer model parameters and reduced computational requirements. The compact version generates high‑fidelity audio with approximately 500K parameters and 1 GMAC computational load, making it highly suitable for real‑time applications on edge devices. In addition, our approach exhibits exceptional musical audio synthesis capabilities despite no training on musical data, illustrating unprecedented cross‑domain generalization. See https://github.com/phasegan/phasegan‑audio‑demo for demos of our work.
Authors:Hui Ye, Jing Zhang, Xiulong Yang, Rajshekhar Sunderraman
Abstract:
Large‑scale multi‑label text classification assigns a small subset of relevant labels to each document from a vocabulary containing thousands or tens of thousands of candidate labels. Although pretrained language models have improved semantic text representations, most representation‑based approaches center their prediction pipelines on a primary encoder or combine auxiliary features within a single ranker. The complementarity between heterogeneous language models therefore remains insufficiently explored. We propose DualMLC, a dual‑branch framework that processes the same document through an autoregressive decoder‑only language model and a bidirectional encoder. Each branch maintains its own representation pathway and independently estimates relevance scores over the shared label space. DualMLC combines the two score vectors through late logit fusion, allowing shared evidence to reinforce relevant labels and branch‑specific evidence to compensate for limitations in the other branch's representation. DualMLC achieves state‑of‑the‑art results on three widely used large‑scale multi‑label text classification benchmarks. Ablation results further confirm that integrating the heterogeneous predictors produces stronger rankings than either branch alone. The source code is publicly available at https://github.com/huiyegit/DualMLC.
Authors:Saifur Rahman Tamim, Md Taslimul Hasan Toufique, A. M. Tayeful Islam
Abstract:
Semantic watermarking schemes such as Tree‑Ring hide a detectable pattern in the initial noise latent of a diffusion model. Recent work shows these watermarks are not only removable but forgeable: an attacker who never sees the watermarking key can still produce images the genuine detector accepts. We reproduce the Reprompt forgery attack of Müller et al. against Tree‑Ring on Stable Diffusion XL, using the authors' released code, on free‑tier dual T4 GPUs with 14.6 GB of usable memory per device, substantially less per‑GPU memory than the A40 hardware used in the original study. The attack reproduces. Over six trials of three arms we detect genuine images 6/6, clean images 0/6, and forged images 5/6, at 325‑332 s per attack. Three further results came out of running it under constraint. The released detector computes a non‑central χ^2 statistic and hands back only its CDF, so we recovered the discarded statistic; our recovery matches the released detector exactly, and two natural scores built from it separate the forged arm from the clean null at AUC 0.861 and 0.972 on the same eighteen observations. Running SDXL in half precision requires patching the pipeline's direct autoencoder calls, and a controlled probe confirms the patched path leaves the detector statistic unchanged. Finally, we report a prediction we made from reading the detector source that our measurements then contradicted. The notebook, the pinned fork and every measurement artifact are released with the paper.
Authors:Qingxiang Guo, Wenke Fan, Shuofeng Zhao, Dawei Yang, Zhiyang Zhou, Yingxin Shang, Hongwei Cai, Zhou Wang, Weixu Wang, Lin Yang, Shuran Zhou, Yang Song
Abstract:
We present DuplexDrama, the first synthesized spoken dialogue dataset that simultaneously covers four dimensions: (i) complete persona and scenario settings; (ii) three full‑duplex behaviors (interruption, backchannel, incomplete); (iii) expressive speech with persona‑aligned emotion labels; and (iv) script‑aware sound events. DuplexDrama is built via a 4‑stage pipeline; quality validation on both scripts and synthesized audio confirms its quality. We have produced more than 2,000 hours audio data with a 64‑voice timbre pool spanning 13 personas and 5 age buckets; 3.8% of all turns carry at least one full‑duplex behavior. This data has been validated through internal full‑duplex model training. We will release a curated subset of 6,400 bilingual dialogues (800 h, Chinese ~500 h + English ~300 h) to advance full‑duplex spoken dialogue model research. Data samples are available at our demo page and LLM‑judge evaluation prompts will be released with the dataset.
Authors:Sebastiano Nordio, Michele Lotto
Abstract:
The proliferation of highly capable open‑weight Small Language Models (SLMs) democratizes access to advanced cybersecurity capabilities, posing an escalating risk as these models can bypass proprietary API guardrails when deployed locally. However, SLMs deployed as autonomous agents often struggle with long‑horizon, exploratory tasks like cybersecurity Capture The Flag (CTF) challenges due to context bloat and cognitive degradation from accumulated tool‑call outputs. To understand and mitigate this cybersecurity threat, we introduce context segmentation, a two‑level agentic framework that divides complex exploitation tasks into manageable, contextually isolated sub‑problems. Evaluating on the picoCTF dataset using memory‑constrained gemma‑4 models, we demonstrate that for the E4B model, our strategy acts as an intelligent search, achieving competitive rewards with superior token efficiency compared to brute‑force retries, and successfully solving 18.52% of tasks that standard agentic execution fails to complete. Code is available at https://github.com/9xeb/context‑segmentation.
Authors:Afshin Bozorgpour, Peter Schüffler, Edgar Jost, Dorit Merhof
Abstract:
Bone‑marrow cytology is inherently structured: each cell belongs to a hematopoietic lineage, and many cell types lie on ordered maturation trajectories. Standard flat classifiers ignore this structure, treating a mild same‑lineage confusion the same as a severe cross‑lineage mistake and predicting only discrete labels. We propose HemaHier, an ordinal‑hierarchical prediction head for a frozen or lightly adapted cytology foundation model. Its central component is a chain‑conditioned maturity score that reads a single maturity value under a per‑chain query, supervised only on biologically valid healthy chains, while dysplastic and off‑chain cell types remain classes but are excluded from maturity supervision. Fine and lineage predictions are coupled through a shared posterior that guarantees hierarchical consistency, and a staged objective first stabilizes recognition, then adds lineage and maturity supervision. On three bone‑marrow datasets under a shared ontology, HemaHier achieves competitive recognition while reducing biologically severe errors and adding a within‑lineage maturity ordering that flat classifiers lack. Code is available at https://github.com/xmindflow/HemaHier.
Authors:Jisheng Dang, Zhenxuan Wang, Bin Li, Ronghao Lin, Bin Hu, Tat-Seng Chua
Abstract:
Continuous emotion control in text‑to‑image generation requires a model to improve affective alignment without changing the objects, layout, or scene described by the prompt. Existing supervised emotion‑injection methods often optimize feature‑space proxies and may therefore exhibit emotion‑semantic drift, in which stronger emotional conditioning is accompanied by unintended content changes. We address this problem with a flow‑matching image‑generation framework that combines continuous valence‑arousal (VA) conditioning, Group Relative Policy Optimization (GRPO), and a neutral semantic anchor. The deterministic probability‑flow ODE is converted into a marginal‑preserving SDE, yielding non‑degenerate transition densities for trajectory sampling and policy‑ratio estimation. A frozen CLIP‑based VA regressor supplies a terminal reward measuring the distance between the predicted and target VA coordinates, while an image generated from the same prompt under zero VA conditioning provides a feature‑space reference for semantic preservation. A reduced denoising schedule is used for online RL sampling, whereas the original schedule is retained at inference. Experiments on 3,300 prompt‑emotion combinations show substantially lower valence and arousal errors than the VA‑conditioned baseline and an improved CLIPScore relative to EmotiCrafter, with a measurable trade‑off in reference‑free image quality. The results support anchor‑regularized Flow‑GRPO as a practical approach to balancing emotional alignment and semantic consistency in continuous‑affect image synthesis.
Authors:Dania Khan, Nuzhat Aisha Shaikh, Asfina Hassan Juicy, Raiyun Kabir, S M Shahida, Taufiq Hasan
Abstract:
Cervical cancer is a major global health challenge, with disease burden falling disproportionately on low‑ and middle‑income countries (LMICs) due to a shortage of trained specialists and the subjective nature of colposcopy‑based screening. To address this challenge, we propose a novel deep learning framework for the automated grading of Cervical Intraepithelial Neoplasia (CIN) and the prediction of clinical Swede scores. We also introduce the BUET Multi‑Center Colposcopy Dataset, a novel, multi‑center cohort designed and annotated for Swede score prediction and CIN grading. Our proposed dual‑stream cross‑attention architecture mimics the visual reasoning of an expert colposcopist by explicitly fusing paired multimodal cervigrams to evaluate comparative tissue responses. Furthermore, we introduce a custom composite loss function to address severe class imbalances and scoring inconsistencies across the five Swede score components. The proposed framework achieved 71.85% accuracy and an 86.23% AUC‑ROC for three‑class CIN grading, outperforming existing methods. For Swede score component prediction, the architecture achieved AUC‑ROC values ranging from 75.7% to 88.4%, with the composite loss function yielding consistent F1‑score improvements. Finally, the total predicted Swede Score, which ranges between 0 and 10, shows a Mean Absolute Error (MAE) of 1.489. The results show that the proposed method can pave the way towards developing AI‑assisted colposcopy screening tools to support risk‑based triage in resource‑limited healthcare settings. The dataset and source code are publicly available(url: https://github.com/mHealthBuet/BUET‑colposcopy)
Authors:Sen Yang, Boqiang Duan, Jing Yang, Weihao Bo, Jie Liu, Boyuan Tong, Ze Feng, Wenkang Zhang, Jingdong Wang, Hua Wu
Abstract:
Long video understanding often behaves like a visual needle‑in‑a‑haystack problem: query‑relevant evidence is sparsely distributed across long temporal spans, while packing dense frames into a single VLM context incurs context rot and high cost. Existing video agents often rely on query‑agnostic offline preprocessing or ad hoc tool sets, which can miss query‑specific details and waste computation. In this work, we present VideoXAgent, a purely online video‑agent harness for long video understanding that starts from the given video file and user query, plans and decomposes the task, invokes specialized expert tools on demand, and aggregates multimodal evidence to produce a final answer while resolving conflicts among observations. To support this on‑demand invocation, we design a suite of heterogeneous expert tools guided by a data‑driven taxonomy of atomic capabilities, spanning scripts, VLMs, and domain models (e.g., detection, OCR, ASR, face recognition). The harness further enforces objective evidence prompting and budget‑aware control to curb hallucination and non‑termination. Across Video‑MME‑Long, LongVideoBench‑Long, LVBench, and MINERVA, VideoXAgent is competitive with frontier LMMs and video agents under a smaller context footprint‑‑‑about 50k tokens of agent context per sample, even on hour‑long videos. In particular, on complex video‑reasoning benchmarks such as MINERVA, it matches this level while using only about 15% of the context of a 1,024‑frame dense‑packing baseline. Notably, the harness remains effective with a visually weak or even text‑only orchestrator, suggesting that strong long‑video understanding can emerge from progressive agentic evidence seeking rather than from packing the full video into a single context. Project page: https://go‑agent‑x.github.io/video_agent_harness/
Authors:Zhuangfan Huang, Xiaosong Li, Yang Liu, Tao Ye, Haishu Tan
Abstract:
Camouflaged object detection (COD) is an important engineering task in intelligent optical perception, but it remains challenging when targets closely resemble their surroundings. Polarization imaging provides complementary physical cues, whereas existing methods typically assume fixed multimodal input configurations and entangle intra‑polarization coordination with interaction between red‑green‑blue (RGB) and polarization representations. We propose LGFN, a lightweight gated RGB‑polarization fusion framework supporting separately optimized RGB‑only and polarization‑assisted configurations. A deterministic Modality Router selects the appropriate configuration according to polarization availability. In the multimodal configuration, an availability‑conditioned Modality Gate calibrates the available polarization branches; the Gated Polarization Hub coordinates learned degree of linear polarization (DoLP) and angle of polarization (AoP) representations with explicit polarization cues; and RGB‑Polarization Cross Fusion introduces the coordinated representation into the RGB hierarchy through controlled residual interaction. The multimodal configuration requires neither sample‑dependent statistics nor handcrafted quality descriptors during inference. On the complete 230‑image PCOD_1200 test set, the RGB‑only configuration achieves a mean absolute error of 0.0090, a Dice score of 0.8806, and an intersection over union of 0.8144, obtaining the best results on all six metrics among the evaluated RGB‑based methods. Under a common local reevaluation protocol, the multimodal configuration outperforms PolarNet and IPNet on all six metrics. Relative to IPNet, it reduces the parameter count, floating‑point operations, and latency by 53.1%, 73.6%, and 63.0%, respectively. The source code will be available at https://github.com/1hzf/LGFN.
Authors:Gengxian Zhou, Jian Xu, Zichen Tang, Shiming Xiang, Haihong E, Cheng-Lin Liu
Abstract:
Retrieval‑Augmented Generation (RAG) has empowered Large Language Models (LLMs) to tackle knowledge‑intensive tasks. However, navigating global, heterogeneous knowledge bases (large‑scale knowledge graphs and text corpora) for complex reasoning remains a challenge. Existing methods typically employ reactive, graph‑driven exploration strategies, which blindly follow graph topology without adapting to the question context or evolving exploration progress, and lack deep bidirectional synergy between graph and text. To address these limitations, we propose CoG (Cognition on Graph), a cognitive‑inspired, training‑free framework for adaptive knowledge exploration. Drawing inspiration from human problem‑solving, CoG performs a continuous plan‑explore‑reflect cycle, where it proactively formulates investigation plans, performs dual‑source retrieval, and dynamically reflects on progress to adjust strategies. Crucially, it establishes deep bidirectional synergy between structured graph and unstructured text, where entities extracted from text dynamically guide graph exploration to bridge knowledge gaps. Extensive experiments on seven multi‑hop QA benchmarks demonstrate that CoG significantly outperforms state‑of‑the‑art methods while achieving superior exploration efficiency. Our code and datasets are available at https://github.com/zhougengxian/CoG.
Authors:Zhuangfan Huang, Zhenyu Kuang, Gao Wang, Yang Liu, Haishu Tan, Xiaosong Li
Abstract:
Polarization image fusion combines the stable luminance and structural information of the total‑ intensity image S0 with the material‑sensitive details of the degree of linear polarization (DoLP) image. However, the reliability of DoLP varies spatially, and indiscriminate polarization transfer may amplify unstable responses or disturb the structural appearance anchored by S0. We therefore propose LG‑PF, a lightweight confidence‑guided framework that formulates polarization fusion as a selective residual transfer process. A Polarization Confidence Prior estimates spatially reliable polarization responses, a Mask‑guided Multi‑scale Fusion module regulates their transfer across three feature scales, and a Lightweight Context‑aware Bounded Correction Head stabilizes local photometric and structural transitions. Confidence guidance is also incorporated into the optimization objectives to preserve reliable polarization details while suppressing unsupported responses. We also construct MSP, a multi‑scene polarization fusion dataset containing 1000 pixel‑aligned image pairs from 17 indoor and outdoor scene categories. LG‑PF achieves the best results across all six evaluated metrics on MSP, while subset‑based evaluations on PIF and GAND show promising transferability without fine‑tuning. With only 0.2936 M parameters and an inference time of 21.712 ms per image, LG‑PF achieves competitive fusion quality with low computational cost. The source code will be available at https://github.com/1hzf/LG‑PF.
Authors:Junkyung ju, Kyungho Yoon, Minwoo Shin
Abstract:
High‑frequency ultrasound (HFUS) enables noninvasive visualization of superficial skin structures, but automated skin‑layer analysis is limited by the scarcity of densely annotated data. Existing real HFUS datasets commonly provide annotations for superficial targets such as the epidermis and subepidermal low‑echogenic band (SLEB), while dense labels for deeper structures such as dermis, subcutaneous tissue, fascia, and muscle are rarely available. We propose a physics‑guided synthetic HFUS generation framework for skin layer segmentation. The framework constructs multilayer acoustic skin phantoms, assigns layer dependent acoustic properties, and uses k‑Wave simulation to generate paired synthetic HFUS images, dense layer masks, and simulation metadata. To evaluate whether the generated data provide transferable supervision, we use it for downstream segmentation pretraining and fine‑tune the models on real Mendeley HFUS data. Synthetic pretraining followed by real fine‑tuning achieved real‑domain performance comparable to real‑only training and improved mean Dice/IoU in three of four evaluated trainable architectures. These results suggest that physics‑guided synthetic HFUS images contain transferable anatomical and textural cues for real‑domain skin layer segmentation, although further reduction of the synthetic‑real appearance gap is needed to enable greater gains. The code and data are available at: https://github.com/Finn‑02/synthetic‑hfus‑skin‑layer‑segmentation.
Authors:Weichen Li, Ken Zhong, Zheng Wang, Li Pan, Jianhua Li
Abstract:
Relational table learning has recently emerged as an important research direction for modeling multiple tables connected through primary key‑foreign key (PK‑FK) relationships. Despite recent advances, a principled modeling framework tailored to this task remains underexplored. In this paper, we propose Intra‑Inter Relational Table Learning (InRTL), a unified framework that explicitly models dependencies both within and across relational tables. Specifically, InRTL formalizes two complementary interaction patterns: intra‑table interactions, describing associations among rows within the same table, and inter‑table interactions, describing dependencies between rows across PK‑FK‑linked tables. To model these dependencies, we develop a column‑aware table encoder to generate initial row representations, followed by Transformer‑based self‑attention and cross‑attention modules for intra‑table and inter‑table learning, respectively. To further improve scalability, InRTL incorporates linearized attention and heterogeneous graph neural networks to simplify the self‑attention and cross‑attention operations. Extensive experiments on ten datasets covering 24 real‑world tasks demonstrate the effectiveness of our approach. Code is available at https://github.com/W1nterFloW/InRTL.
Authors:Johan Emilsson
Abstract:
Global estimates of access to health care treat every facility alike. Drive time was routed on the OpenStreetMap network from all 217,841 of its hospitals and 15‑, 30‑ and 60‑minute isochrones dissolved for nested capability tiers, weighted with GHS‑POP 2025. 96.2% of the world's population lives within an hour's drive of a hospital, 78.5% of a hospital with a documented emergency department, and 40.3% of one with a helipad or university name marking tertiary care. The 1.45 billion people within an hour of a hospital but not of an emergency hospital live mainly in South and East Asia and Nigeria; the 312 million beyond an hour of any hospital lie in a belt from the Sahel to Madagascar. Defining the tertiary tier by helipad alone leaves its estimate unchanged, and the isochrone construction shifts the 60‑minute figures by a few percent. Counting every facility as equivalent overstates access to time‑critical care.
Authors:Shaurya Pavan A, Vemunuri Divya Madhuri, Yash Pradeep Gawande, Kaushik Mitra
Abstract:
Reconstructing 3D scenes under real‑world low‑light conditions remains challenging due to severe sensor noise, low signal‑to‑noise ratios, and degraded photometric consistency, which destabilize geometry estimation and novel view synthesis. Existing approaches often rely on well‑lit reference data for reliable Structure‑from‑Motion (SfM) initialization under degraded inputs or apply per‑view enhancement methods that introduce cross‑view inconsistencies. To address these limitations, we propose NOVA‑GS, a unified noise‑aware framework for low‑light 3D Gaussian Splatting that subsumes enhancement, denoising, and geometry optimization within a single process. Our method leverages VGGT‑based feed‑forward estimation to obtain robust camera poses and geometry directly from degraded inputs, eliminating the need for SfM. Building on this initialization, NOVA‑GS integrates three coupled components: a structure‑aware enhancement module for exposure correction, a self‑supervised denoising module with blind‑spot masking for pseudo‑supervision, and a consistency‑driven Gaussian Splatting optimization enforcing cross‑view geometric coherence. We further introduce a noise‑guided spherical harmonic regularization to suppress view‑dependent artifacts in noisy regions. Extensive experiments on diverse real‑world low‑light datasets demonstrate improved geometric fidelity, color consistency, and robustness without requiring paired supervision or well‑lit references. https://shaurya2524.github.io/nova‑gs/
Authors:Kaixuan Du, Xin Wan, Hang Zhang, Meng Cao, Dai Guan, Ming Chen, YuKun Wang
Abstract:
Streaming video understanding requires models to process continuous multimodal input while maintaining temporal context. Existing evaluations are predominantly reactive: they query a model at a selected timestamp and therefore do not assess when it should respond. Proactive interaction instead requires monitoring a standing request, responding within an appropriate interval after the target event, and otherwise remaining silent. We introduce LiveProBench, which evaluates models at one‑second stream intervals without an explicit response cue. Its six subtasks vary trigger ambiguity and timing tolerance. Event Sensitivity geometrically combines response and silence rates on the same recording; four window‑based subtasks distinguish early, in‑window, and missed responses; and Duplicate Counting penalizes omissions and repetitions. Premature responses outnumber missed responses for half of the evaluated models, revealing a substantial gap in the temporal decision‑making required for human‑like interaction.
Authors:Jianman Lin, Shailesh Shailesh, Zhongyi Luo, Jiafei Duan
Abstract:
Robot foundation models achieve strong in‑distribution performance but often degrade under visual distribution shifts. When learning to generate actions from pretrained visual representations, models may exploit task‑irrelevant visual cues that correlate with demonstrated actions within the training distribution. Such vision‑action shortcuts can undermine generalization when these correlations change under distribution shifts. Mitigating these shortcuts requires constraining how visual information is used for action generation while preserving task‑relevant spatial information. We propose Latent Interface Training (LIT), a framework‑agnostic two‑stage strategy that first establishes a spatial‑goal‑conditioned action prior without images, then constrains visual conditioning through a pose‑supervised latent interface. Stage 1 trains the action expert to generate action chunks conditioned on language, robot state, and each demonstrated chunk's terminal SE(3) end‑effector pose, learning goal‑directed action generation independently of visual cues. Stage 2 introduces a latent interface that aggregates visual and semantic representations and serves as the pretrained action expert's only visual conditioning pathway. The interface is supervised to reconstruct the terminal pose previously used to condition Stage 1, encouraging it to retain the goal‑relevant spatial information needed for action generation. Across four vision‑language‑action and world‑action architectures (Pi0.5, MolmoAct2, FAST‑WAM, and ImageWAM), LIT improves overall LIBERO‑Plus success by 3.87‑10.70 percentage points while preserving or improving average LIBERO success. Real‑world evaluations show 13.30‑16.70 percentage‑point gains in success aggregated across three tasks under unseen camera configurations, lighting variations, and distractors.
Authors:Seunghan Lee, Jun Seo, Jaehoon Lee, Junhyeok Kang, Sangjun Han, Sungdong Yoo, Minjae Kim, Tae Yoon Lim, Dongwan Kang, Hwanil Choi, Soonyoung Lee, Wonbin Ahn
Abstract:
Recent advances in explaining time series (TS) models have produced methods that identify which past values a prediction depends on. However, most existing methods return a single importance vector, assuming that every predicted step depends on the same past values. In this paper, we show that this assumption does not hold, as different forecast steps depend on different past values. Motivated by this observation, we propose Horizon‑Resolved eXplanation (HRX), which adds a horizon axis to the explanation, so that every forecast step receives its own importance map. HRX is a simple yet effective plug‑in framework with three components: 1) an estimator that reads these maps out of any differentiable forecaster without modifying the TS backbone, 2) an evaluation protocol that validates the horizon axis by measuring how much a single forecast step changes when the inputs an importance map ranks highest are removed, and 3) a rank criterion that predicts in advance whether the axis is worth resolving on a given TS. We further show that this step‑wise dependence is low‑dimensional, as the explanations of all steps are built from a few shared maps whose number does not grow with the forecast length. Extensive experiments across various backbones and datasets show that the improvement comes from the horizon axis and holds for estimators of previous explanation methods. Code is available at https://github.com/seunghan96/HRX.
Authors:Hongbo Gao, Zhengyu Li, Xueru Nie, Dihao Zhu, Lijun Zhao, Yunke Wang, Chang Xu
Abstract:
RGB‑Thermal (RGB‑T) salient object detection leverages complementary cues from visible and thermal modalities to improve robustness in challenging environments. However, in real‑world scenarios, the reliability of each modality is inherently unstable: RGB images degrade under low illumination, motion blur, and noise, while thermal imagery often suffers from contrast compression and sensor artifacts. Such degradation introduces unreliable perceptual evidence that can mislead cross‑modal fusion and significantly deteriorate detection performance. To address this challenge, we propose RA‑SOD, a reliability‑aware RGB‑T salient object detection framework that explicitly models modality reliability and integrates it into feature learning and cross‑modal fusion. First, we introduce a reliability‑conditioned representation that adaptively compensates degraded modality features while preserving structural cues. Second, an uncertainty‑guided dual‑stream refinement strategy progressively corrects cross‑modal representations while suppressing unreliable evidence. Finally, we propose a pixel‑wise modality competition mechanism that dynamically selects modality cues according to spatial reliability for fine‑grained fusion. Extensive experiments on four benchmarks (VT821, VT1000, VT5000, and VT‑IMAG) demonstrate that RA‑SOD achieves state‑of‑the‑art performance and exhibits strong robustness under severe modality degradation. Code and models are available at https://github.com/zaoxienian/RA‑SOD.
Authors:Vinoth Kumar Muthuraj, Soumyadeep Banik, Kushal Sharma, Hardik Jain
Abstract:
A 3D scene graph groups objects into rooms. When a robot is asked to fetch an object from the kitchen, that grouping is what tells it where to look. An object recorded in the wrong room is not retrievable by a query naming the correct room. We introduce Progressive Boundary Closure, which recovers room layer from a monocular RGB video. A SLAM front end and an open‑vocabulary segmenter supply a structural point cloud, camera trajectory and object tracks. The cloud is rasterised into a top‑down map, rooms are recovered from it, and each object takes the room holding most of its extent. The difficulty lies in the map itself. Walls are recorded only where the camera looked, so a gap in the boundary may be a doorway or a stretch of wall that was never observed; nothing distinguishes the two. Prior methods treat both as passages, merging rooms that should remain separate. We observe that both require the same treatment: a room should not extend across either, so both are closed and need not be distinguished. Such an opening closes under a small amount of boundary growth, and few sightlines cross it, so points in different rooms rarely see one another. We use the first to recover rooms and the second to assign objects to them. Rooms are obtained by Progressively thickening the boundary inward and freezing each free‑space region once it becomes enclosed, so every opening seals at its own scale rather than at a radius fixed in advance. Camera poses are used as seeds, which removes the sampling heuristic and makes the segmentation deterministic. Over 10 floors of 6 HM3D‑Semantics scenes, scored against HOV‑SG on identical top‑down maps, we recover 74 rooms for 72 annotated regions (HOV‑SG: 44), raising room F_1 from 0.741 to 0.890 at IoU 0.25 at some cost in precision, and object‑to‑room ARI from 0.488 to 0.696 (p=0.002, ahead on every floor).
Authors:Chunkai Li, Junhao Yin, Ke Li, Jingde Chen
Abstract:
Deep learning has been widely applied across many areas of experimental high‑energy physics, yet existing models address only event‑level classification or object tagging and therefore still require reconstruction algorithms tailored to each decay channel. We present the first application of segmentation to resonance tagging at BESIII and introduce ResoSeg, a deep learning model that jointly performs particle‑level segmentation and event‑level classification, enabling a one‑pass analysis of resonance to anything decays while precisely reconstructing the relevant resonance properties. We demonstrate the reconstruction of η_c with e^+e^‑\toπ^+π^‑h_c, h_c\toγη_c, η_c\to\textanything. The model is trained on BESIII‑η_c dataset, which is constructed with per‑track true labels obtained via a Truth‑Matching Algorithm. Experimental results show that the average combined efficiency of ResoSeg is more than double that of the conventional 16‑channel approach across energy points from 4.19 to 4.60\,GeV. The model generalizes to unseen energy points, adapts to other η_c production modes through transfer learning, and remains robust against variations in the η_c mass, width, and branching fractions, providing a general, resonance‑aware model applicable beyond η_c and BESIII. The source code is available at https://github.com/oashen/ResoSeg.
Authors:Hyunjin Kim, Youngeun Nam, Jaemin Han, Wonhyeok Choi, Jae-Gil Lee
Abstract:
Instruction‑tuning datasets for large language models (LLMs) are often large, redundant, and imbalanced, limiting efficient adaptation. Naive large‑batch fine‑tuning repeatedly includes overrepresented sample groups while weakly covering underrepresented but informative ones, especially under data parallelism (DP) across multiple GPUs. We propose CluSTER, a Cluster‑aware balanced Sampling framework for Training Efficient data Reduction in DP instruction tuning. CluSTER curates a representative reduced dataset through gradient‑space clustering and DP‑aware balanced allocation, ensuring dual‑level coverage across clusters and workers, while preserving the original data distribution by weighted update. As a result, CluSTER reduces redundant computation and improves training stability without compromising model quality. Across multiple instruction‑tuning datasets, CluSTER reduces training time by up to 69.6% with almost no accuracy loss compared to prior sampling and data reduction methods. Code is available at https://github.com/kaist‑dmlab/CluSTER.
Authors:Kunlun Xu, Liangyu Ma, Jiangmeng Li, Xin Tong, Xiaode Liu, Yufei Guo, Jiahuan Zhou
Abstract:
Lifelong Person Re‑Identification (LReID) aims to train a unified person retrieval model from a non‑stationary data stream. Existing LReID methods mainly focus on scenarios where the clothing of each person is consistent. Recently, the Cloth‑Hybrid LReID (CH‑LReID) where cloth‑consistent and cloth‑changing data alternately occur, has emerged as a more practical and challenging scenario. Due to the conflict between clothing‑relevant and clothing‑irrelevant knowledge, the well‑known catastrophic forgetting problem is significantly exacerbated in this task. To address this issue, we propose a SubDistribution‑aware COllaborative Knowledge REinforcing (SCORE) framework, where our key idea is explicitly modeling the intra‑identity diversity to continually consolidate distinct cloth‑consistent and cloth‑changing knowledge. Specifically, an Adaptive SubDistribution Modeling mechanism is developed, where a set of distributional subprototypes is assigned to each identity to capture the intra‑identity diversity, improving the compatibility between cloth‑consistent and cloth‑changing knowledge. Then, a Distributional Knowledge Reinforcement scheme is introduced, where the knowledge of old distributional subprototypes is retained in the new ones by a collaborative aligning mechanism. Extensive experiments show that our SCORE achieves the state‑of‑the‑art performance. Our code is available at https://github.com/zhoujiahuan1991/ECCV2026‑SCORE
Authors:Yang Liu, Yibing Shen, Keming Zhao, Cenk Jiang, Zhenghang Qian, Zhicheng Du, Chen Xiong, Qidong Shao, Zijun Lin, Yunqi Hu, Jingjing Zhou, Lian Zhang, Peter E. Lobie, Peiwu Qin, Chengming Yang
Abstract:
Ultra‑widefield (UWF) swept‑source optical coherence tomography angiography (SS‑OCTA) enables large‑area retinal vascular imaging, yet vessel segmentation at this scale lacks dedicated public benchmarks and comprehensive evaluation for quantitative vascular analysis. We introduce WOIVES, to our knowledge the first publicly available UWF SS‑OCTA vessel‑segmentation dataset, comprising 206 eyes from 152 participants with a 24x20mm^2 field of view. WOIVES spans emmetropia to high myopia and provides soft probability vessel annotations. We further propose PG‑Mamba, a visual state space model that enhances conventional directional scans with two complementary polar‑coordinate scan orders. An auxiliary Dynamic FOV Gating module performs spatial modulation at the bottleneck. PG‑Mamba outperformed seven competitive approaches on broad segmentation metrics under cross‑validation. It achieved the lowest median absolute errors for vessel density, fractal dimension, and vessel length density. WOIVES is publicly available on Zenodo (DOI: 10.5281/zenodo.21904672), and the PG‑Mamba code is available at https://github.com/syb1234567/PG‑Mamba.
Authors:Jiabao Wang, Wenjian Liu, Yaoming Cai, Gengyu Zhang, Boyan Zhao, Zijia Zhang, Yao Ding, Xiaobo Liu
Abstract:
Infrared‑visible image fusion facilitates robust multimodal perception by integrating complementary textural nuances from visible sensors with thermal signatures from infrared systems. Due to the task's inherently ill‑posed nature, existing methods heavily rely on structural priors but typically enforce rotation equivariance uniformly across all features. Such a holistic approach overlooks a critical distinction where low‑frequency shared structures strictly adhere to equivariant constraints while high‑frequency modality‑specific details require greater flexibility to preserve unique information. To bridge this gap, we propose RoES, a Rotational Equivariant Selective‑frequency fusion network. Instead of employing static decomposition, we introduce a trainable rotation‑enhanced updater/predictor module to dynamically decouple low‑ and high‑frequency components. The resulting representations are then processed through a dual‑branch fusion module tailored for spectral consistency. Specifically, a rotation‑equivariant Mamba is employed to capture long‑range structural dependencies in the low‑frequency domain, while a polar spectral attention‑based Dual‑Fourier block refines high‑frequency details under explicit low‑frequency guidance. Extensive experiments demonstrate that RoES consistently achieves state‑of‑the‑art performance in both fusion quality and downstream object detection, establishing a robust solution for multimodal fusion by reconciling frequency‑selective features with equivariant constraints. The source code is available at https://github.com/BryceLosky/RoES‑Fusion.
Authors:Zhongzhan Huang, Junxin Li, Guoming Ling, Yupei Lin, Shanshan Zhong, Hefeng Wu
Abstract:
Comprehensive benchmark suites are essential for improving large language models (LLMs), but many widely used benchmarks are redundant, making evaluation unnecessarily expensive. Although recent benchmark compression methods (BCMs) can mitigate this cost, many strong BCMs rely on large collections of per‑sample evaluation results from numerous LLMs to identify representative samples. Building such collections is also expensive unless they are already public, making these methods difficult to extend to newly released benchmarks. To address this challenge, we present ZipBench, a simple and low‑cost BCM with theoretical error and rank‑consistency guarantees. ZipBench evaluates only a small set of anchor LLMs, synthesizes pseudo evaluation results to broaden coverage, learns compact sample representations, and selects a small yet representative subset. Building on it, we create ZipBench Zoo, a collection of compact versions of 100+ benchmark proxies spanning text, multimodal, and agent tasks. These benchmark achieve mean absolute errors of 0.002‑‑0.02 and average Spearman correlations of ~0.98 with the full benchmarks. Overall, ZipBench reduces the cost of both LLM evaluation and compact benchmark construction, lowering the barrier to broad LLM research for compute‑constrained researchers. The code has been released in https://github.com/MilkThink‑Lab/ZipBench.
Authors:Ji Liu, Saptarshi Majumder, Yiqing Huang, Wenwen Ouyang, Umang Pandey, Zeping Li, Chushi Chen, Zihao An, Puyuan Yang, Zekai Li, Sina Rafati, Ziqiong Liu, Pratik Prabhanjan Brahma, Dong Li, Zicheng Liu, Sharon Zhou, Emad Barsoum
Abstract:
We introduce AMDKernelVault, an open HIP and Triton kernel corpus and training framework for recent AMD CDNA GPUs. Existing LLM‑based kernel agents are largely CUDA/NVIDIA‑centric and often depend on repeated frontier‑LLM calls for generation, reflection, and optimization. To address this gap, we develop HIPKernelGen and TritonKernelGen, agent‑driven pipelines that transform PyTorch references into HIP or Triton kernels, compile and validate candidates under ROCm, and latency‑profile them on AMD hardware. The corpus contains 62,153 execution‑verified HIP kernel samples, 2,377 production‑grounded ROCm Libraries QA entries, and 39,893 Triton kernels. We further train Qwen3‑8B with supervised fine‑tuning and execution‑aware reinforcement learning as a demonstration of the corpus's utility. Under fixed evaluation budgets, it achieves the highest correctness among the compared models on PyTorch‑to‑HIP (34.0% Pass@1), TritonBench‑G (33.2% Corr@3), and ROCmBench (41.94% Corr@3), but does not uniformly lead compilation or speed metrics. The corpus and documentation are available at https://huggingface.co/datasets/amd/AIG‑Datasets, and the associated training and kernel‑generation code is available at https://github.com/AMD‑AGI/hip_kernel_llm_lab.
Authors:Juzheng Miao, Yuchen Yuan, Cheng Chen, Pheng-Ann Heng
Abstract:
Vision‑Language Models such as CLIP enable effective few‑shot medical anomaly detection (AD) via strong image‑text semantic alignment. However, their globally contrastive pretraining lacks explicit spatial supervision, limiting precise lesion localization. In contrast, Vision Foundation Models (VFMs) such as DINO learn spatially coherent patch representations via self‑distillation and local‑to‑global consistency, better capturing fine‑grained anatomical structures. Leveraging this complementarity, we propose Spatial‑FAD, a spatial‑aware few‑shot medical AD framework that improves lesion localization by combining VFM spatial priors with CLIP semantics. Specifically, we introduce a VFM‑enhanced adapter that injects a structural affinity prior derived from DINO into CLIP features. This structure‑guided refinement encourages visual embeddings to better adhere to lesion boundaries while maintaining semantic alignment. To address the loss of spatial detail from patchification and the limited input resolution of CLIP, we adopt a sliding‑window aggregation strategy. This generates high‑resolution, spatially dense embeddings to further enhance localization granularity. Moreover, we introduce a prototype‑enhanced support memory scheme to efficiently exploit the few‑shot support set. This module stores compact prototypes for normal and abnormal patterns, reducing memory costs while boosting performance by fusing patch‑to‑prototype and image‑text similarities. Extensive experiments on three benchmark datasets, including Liver CT, Retinal OCT, and Brain MRI, demonstrate that Spatial‑FAD significantly outperforms state‑of‑the‑art methods, especially in lesion segmentation. Notably, in the 4‑shot scenario, our method achieves an average improvement of over 11.4% in Dice score and 1.8% in AUC. Code is available at: https://github.com/JuzhengMiao/Spatial‑FAD.
Authors:Nayoung Son, Minwoo Shin
Abstract:
Automated gait analysis requires accurate classification and interpretable outputs. We propose an integrated framework for classifying healthy gait and multiple musculoskeletal impairment groups using bilateral ground reaction force (GRF) and center‑of‑pressure (COP) signals. The signals were normalized over the stance phase and standardized using training‑set statistics. The model achieved a validation accuracy of 99.00% and a test accuracy of 90.07% under a session‑level split. Class‑specific ε‑LRP identified positive and negative contributions across both sides, multiple signal components, and different stance phases. Separately, the processed GRF signals and model predictions were synchronized within a Blender‑based 3D visualization, enabling sample‑level inspection of gait trials and classification results. The proposed framework integrates classification, explainability, and 3D visualization to improve model transparency. The source code is available in the following repository: https://github.com/nyoico/grf‑gait‑3d‑visualization.git
Authors:Yeonjae Jung, Minwoo Shin
Abstract:
Post‑treatment MRI in patients with glioma provides serial observations for updating patient‑specific tumor‑state proxy estimates, but variable appearances and trajectories complicate forecasting. We formulate forecasting as an observation‑aware digital‑twin update in which an intermediate observation anchors the patient‑specific state. Among 203 patients and 594 follow‑up time points, a predefined no‑new‑treatment criterion retained 120 of 236 candidate triplets, split into 81/24/15 training/validation/test triplets at the patient level. Each time point was represented by a continuous voxel‑wise tumor‑state proxy map in [0,1] derived from MRI lesion labels. A SegMamba‑based single‑step forecaster predicted update proposals from multimodal source‑state tensors. Observation‑Anchored Selective Assimilation (OASA) retained the observed intermediate proxy as the state anchor and selectively applied updates through a validation‑selected tiered case‑level rule and voxel‑wise soft gate. We compared initial‑scan forecasting, rollout without assimilation, latest‑observation persistence, direct prediction, OASA, OASA + calibration, and morphological dilation. Checkpoints, OASA rules, and calibration thresholds were selected using validation data only. Across three seeds on 15 held‑out test triplets, OASA maintained Dice at τ = 0.2 comparable to persistence (0.6071 \pm 0.0025 vs. 0.6070) while yielding numerically higher Dice at τ = 0.5 (0.4269 \pm 0.0079 vs. 0.3981), with a small RMSE increase. Calibration increased Dice at τ = 0.2 to 0.6178 \pm 0.0025, increased false‑positive (FP) support (11,836\rightarrow18,663), and reduced false‑negative (FN) support (22,107\rightarrow17,536). This reflects near‑threshold support calibration rather than improved biological predictive capability. Code is publicly available at https://github.com/jsudg436/longitudinal‑proxy‑forecasting.
Authors:Yuxing Chen, Zhiyuan Wei, Bowen Xiao, Zhizheng Zhang, He Wang
Abstract:
Due to the highly deformable nature of garments, training a generalizable policy for robotic T‑shirt folding and unfolding remains a significant challenge. In this work, we present a large‑scale synthetic dataset for robotic T‑shirt folding and unfolding, covering 6 robotic embodiments, 1K T‑shirts, 1K environmental assets, and 120K episodes with rich annotations, which can be used to train a wide range of manipulation policies. We first follow the FoldNet pipeline to generate a large‑scale dataset of physically simulatable T‑shirts with diverse appearances and annotated semantic keypoints. Based on these semantic keypoints, we then generate manipulation demonstrations for different robotic embodiments through a unified rule‑based framework. We use these demonstrations to train visuomotor policies, and experimental results demonstrate that models trained solely on our synthetic data can achieve over 90% end‑to‑end task success rates when directly deployed to unseen real‑world environments and previously unseen T‑shirts from arbitrary initial configurations. Project URL: https://pku‑epic.github.io/FoldNetXX/.
Authors:Tianyu Li, Yanghong Lin, Shudong Zhou, Kui Yang, Jingru Zhang, Li Fang, Wei Yao
Abstract:
Multiview point cloud registration is particularly challenging in low‑overlap scenes, where reliable correspondences are limited and incorrect pairwise transformations can affect global pose estimation. In addition, registering all scan pairs is computationally expensive because many pairs provide weak geometric information. To address these problems, we propose GMPCR, a non‑learning‑based spectral consistency‑guided framework for efficient and robust multiview point cloud registration. GMPCR builds a refined second‑order compatibility structure from initial correspondences and uses its dominant spectral response to evaluate both correspondence reliability and scan‑pair confidence. This allows unreliable correspondences to be filtered and informative scan pairs to be selected before relative transformation estimation, leading to a sparse pose graph and reduced pairwise registration cost. For each retained scan pair, maximal‑clique‑based hypothesis generation is used to estimate reliable relative transformations. The resulting pose graph is further refined by an adaptive history‑aware synchronization scheme, in which the effect of residual history is adjusted according to changes in the global rotation residual. A recovery mechanism also allows down‑weighted edges to regain confidence when their global consistency improves. Experiments on 3DMatch, 3DLoMatch, ScanNet, and ETH demonstrate the effectiveness of GMPCR. It achieves registration recalls of 97.2% and 89.6% on 3DMatch and 3DLoMatch, respectively, while maintaining competitive performance on ScanNet and ETH. The results show that GMPCR provides a favorable balance among registration accuracy, robustness to low overlap, and computational efficiency. The code is publicly available at https://github.com/swccj/gmpcr.
Authors:Inesh Chakrabarti, Zejun Xiong, Pragya Sharma, Mani Srivastava
Abstract:
Foundation models, including large language models, vision‑language models, and time‑series foundation models, are increasingly deployed on embedded and edge platforms for CPS and IoT applications, where energy, latency, and memory are as critical as task accuracy. Existing benchmarking tools evaluate model capability in isolation, reporting accuracy assuming sufficient compute, while hardware profiling tools remain platform‑specific and mutually incompatible. As a result, users lack a unified workflow for making deployment decisions across heterogeneous devices. We present HoliBench, a modular benchmarking and deployment toolkit that jointly characterizes accuracy, latency, and energy across platforms from single‑board computers to GPU servers. Its platform abstraction layer calibrates cross‑device measurement, and the toolkit supports multiple model modalities, inference engines, concurrencies, and existing evaluation harnesses. An interactive interface exposes constraint‑aware configuration selection over a design space that is profiled once and reused across studies. Using HoliBench, we characterize 20 models across 7 device types, 3 quantization levels, 8 inference backends, and over 30 tasks, surfacing tradeoffs that existing tools miss: quantization reduces latency only on hardware with low‑precision support, accuracy gains show diminishing returns relative to energy, and for autoregressive workloads, average inference power is approximately constant across output lengths. We further find that single‑model profiles compose under sequential co‑resident execution. In a multi‑model CPS deployment, standalone profiles predict combined‑pipeline latency and power within 1.2% and 2.5%, enabling deployment exploration without exhaustively profiling every pipeline configuration. We release HoliBench as open‑source infrastructure for deployment‑aware evaluation of foundation models.
Authors:Yang Liu, Qionghong Ma, Joongwon Chae, Lihui Luo, Yibing Shen, Yulin Zhuo, Yingting Zhu, Jiashu Chang, Xiaoyun Zhong, Dongmei Yu, Peter E. Lobie, Peiwu Qin, Chengming Yang
Abstract:
High‑frequency surgical maneuvers in ophthalmology necessitate high‑fidelity temporal modeling, yet characterizing long‑range procedural dependencies remains computationally prohibitive for attention‑based architectures. Existing models often require aggressive temporal downsampling, which compromises the detection of fine‑grained action boundaries and instrument‑tissue interactions. To address these scalability constraints, we present OphBiWSSD, a framework that reformulates surgical temporal action localization leveraging Bidirectional State Space Duality. By employing a weight‑tied selective scan mechanism that incorporates both preceding and succeeding surgical contexts, our approach facilitates the global synthesis of non‑causal temporal cues with linear complexity. This streamlined architecture is well‑suited to capture the bidirectional dependencies present in ophthalmic workflows, effectively bridging the gap between local boundary precision and long‑range procedural context without incurring the quadratic memory overhead of traditional Transformers. Extensive experiments on the OphNet benchmark demonstrate that OphBiWSSD achieves state‑of‑the‑art temporal localization performance, with mean Average Precisions of 44.42% on phases and 43.08% on operations, surpassing the baselines by 6.80% and 6.66%, respectively. Empirical validation indicates that our approach ensures precise temporal localization and offers a computationally viable pathway for deploying surgical intelligence systems in clinical environments. The code is publicly available at https://github.com/yo3nglau/OphBiWSSD.
Authors:Yu Xie, Bangshu Xiong, Zhibo Rao, Rui Gan, Chongxuan Liu, Zechu Ouyang
Abstract:
Hazardous‑freight operations at petrochemical logistics nodes are safety‑critical for intelligent transportation systems, yet existing vision benchmarks rarely address procedural compliance under realistic deployment constraints. In large infrastructure networks, cameras often operate under sparse round‑robin polling, so transfer status must be inferred from incomplete observations and localized evidence. We present GSO‑Net, a large‑scale benchmark for visual understanding of standard operating procedures (SOPs) in petrochemical unloading scenarios. To our knowledge, GSO‑Net is the first public benchmark dataset dedicated to visual SOP understanding in petrochemical hazardous‑freight transfer scenarios. It contains over 50,000 independently sampled frames from 64 real expressway petrochemical logistics nodes and adopts an SOP‑derived hierarchy linking 9 macroscopic procedural steps with 15 microscopic operational states. Two tasks are defined: joint detection of microscopic states and macroscopic steps as the core benchmark, and frame‑level step classification as a diagnostic reference. Experiments with lightweight, transformer‑based, open‑vocabulary, and holistic models reveal a clear gap between object perception and transfer‑stage understanding. Current models remain weak on contact‑level state grounding, transient step recognition, and stage consistency, especially under sparse polling, tiny critical targets, and long‑tailed operational evidence. GSO‑Net provides a practical benchmark for fine‑grained state perception and vision‑based safety monitoring in hazardous freight transportation. The dataset is publicly available at https://github.com/yuxieHarrison/GSO‑Net
Authors:Majd Alafrange, Samuel Friedman, John Kitonyo, Sana Tonekaboni, Mahnaz Maddah
Abstract:
Latent embeddings have become a central data abstraction in modern machine learning, especially in biomedicine, where foundation models are increasingly used to encode multimodal data like clinical text, medical images, omics, and physiological signals. However, the utility and value of these representations depends on understanding their quality, structure, and the information they encode. Existing analysis workflows for evaluating representations remain fragmented across custom scripts, isolated metrics, and most importantly lack multimodal analysis, limiting accessibility and reproducibility. We present LatentVerse, a representation analysis resource that combines a web‑based visual analytics platform for accessible, report‑driven exploration with a command‑line interface for scalable technical workflows. LatentVerse unifies diagnostics for various representation quality metrics and extends to multimodal settings by decomposing embeddings into shared and modality‑specific components. We evaluate LatentVerse through controlled unimodal and multimodal simulations, discovery‑oriented analyses on real biomedical embeddings, and a user study across diverse use cases. By supporting thorough and interpretable evaluation of latent spaces, LatentVerse makes foundation model representations more understandable in biomedical and data science applications.
Authors:Bowen Guan, Zhentao Yin, Yanming Shen
Abstract:
Existing agent benchmarks mainly evaluate final task success or tool‑call correctness, providing limited insight into whether agents can reliably diagnose and recover from intermediate execution failures. This limitation becomes particularly critical in multi‑turn parallel tool‑use scenarios, where errors may propagate across dependent branches and trigger cascading failures. We introduce ParaRecover, a process‑level benchmark for evaluating error localization and recovery in multi‑turn parallel tool‑use agents. Built upon a fine‑grained taxonomy of 14 error types covering planning dependencies, tool selection, and argument matching, the benchmark comprises 10,626 instances spanning two difficulty levels. To enable finegrained, process‑oriented evaluation, we further propose the SDE rubric, which measures structural integrity, diagnostic reasoning, and evolutionary strategy during agent execution.Experiments across more than ten mainstream LLMs reveal that even state‑of‑the‑art models still struggle with multi‑turn error propagation,implicit tool‑use failures, and precise replanning. Moreover, we demonstrate that the SDE rubric provides effective supervision signals for improving agents' reflective recovery capabilities. Our data and code are available at https://github.com/gbw206/ParaRecover.
Authors:Zeyu Zhang, Zhiyuan Zhang, Siheng Wang, Yiran Wang, Danning Li, Ian Reid, Richard Hartley
Abstract:
The conditional generation of 3D motion has emerged as a key research topic due to its wide applicability across robotics, AR/VR, gaming, and content creation. However, extending recent advances in text‑driven human motion generation to the animal domain remains challenging due to two core limitations. First, animals exhibit highly diverse skeletal topologies, unlike the standard human structure, making unified modeling across species difficult and leading to inefficient per‑species models. Second, existing animal motion datasets suffer from limited scale and annotation quality, constraining model performance. To address these challenges, we propose UniMo, a unified point cloud‑based motion generation framework that bypasses topological discrepancies by converting parametric skeletons into unparametric representations, further enhanced by dynamic sampling that allocates more points to active joints. Additionally, we present UniML3D, a large‑scale motion‑language dataset spanning both human and animal categories, containing 145,907 motion sequences and 433,388 captions‑over 102x larger than existing animal datasets. Our method achieves state‑of‑the‑art results on UniML3D and three public benchmarks including HumanML3D, KIT‑ML, and AnimalML3D, demonstrating the feasibility and effectiveness of unified human‑animal motion generation. Website: https://steve‑zeyu‑zhang.github.io/UniMo.
Authors:Mohammadali Khodabandehlou, Mahdi Alizadeh
Abstract:
GPU‑backed LLM servers often multiplex interactive requests with background batch work on the same CPUs. During a request burst, the scheduler should protect time‑to‑first‑token; between bursts, it should let background work make progress. A fixed kernel policy leaves one of these objectives on the table, so agentic OS control needs a way to switch scheduler behavior as the workload changes. The hard part is not deciding that a switch is useful, but applying it safely and fast enough for the kernel. Scheduler events occur every 1‑10 μs, and any code that runs there must satisfy the eBPF verifier. Scalar knobs are fast but expose only limited policy behavior, while generating new eBPF policy code is expressive but puts compilation, verification, loading, and possible verifier rejection on the runtime path. We present AKTS, which verifies a policy library once, at load time, and reduces the agent's runtime action to writing an integer index into an in‑kernel array of preverified policies. An in‑kernel tail call resolves that index. Because the agent emits an index rather than code, verifier failure is not a runtime outcome. On Linux 6.14, AKTS applies a policy switch in 920 ns (p50), matching scalar writes while switching whole policies; makes an invalid index inert across 60,217 invocations on an attached scheduler; and switches policies in a vLLM workload to capture 97% of a throughput policy's batch work while matching a latency policy's burst response.
Authors:Zixiang Xu, Yanbo Wang, Chenxi Wang, Lang Gao, Zirui Song, Yue Huang, Zhaorun Chen, Xiangliang Zhang, Xiuying Chen
Abstract:
Large Language Models (LLMs) are increasingly asked to reason over structured data such as graphs, yet how reliably they can carry out multi‑step graph algorithms in language remains unclear. Existing evaluations tend to use simple tasks on small graphs, to score code generation rather than reasoning over the graph itself, or to fix a single input format. We introduce Graph Theory Bench (GT Bench), a benchmark covering 24 classical graph problems in 44 task‑structure settings, with over 100,000 examples across four representations: natural language, structured language, adjacency list, and adjacency matrix. Evaluating eight LLMs on GT Bench shows that accuracy is strongly tied to the input representation, that the best representation shifts with graph density, size, and topology as well as with the model, and that this sensitivity persists, attenuated, in the strongest reasoning models. Building on these observations, we propose the Graph Theory Agent (GTA), which pairs a preference‑trained representation selector with plan‑and‑decompose scaffolding around a frozen executor LLM. GTA lifts Phi‑4 from 53.5% to 69.1% on the benchmark's easy split and from 33.0% to 41.5% on its hard split, outperforming eight prompting and agent baselines, and transfers without retraining to GraCoRe and NLGraph. Code for benchmark generation and evaluation: https://github.com/xzx34/GTA. The project homepage is available at https://xzx34.github.io/gta/.
Authors:Zhiheng Li, Xinhao Liu, Juexiao Zhang, Yongqing Liang, Chen Feng
Abstract:
Maintaining consistency over long spatial and temporal horizons remains a fundamental challenge in large‑scale LiDAR SLAM, particularly when integrating maps collected across multiple sessions. We present Chain‑SLAM, a LiDAR SLAM backend enabling online multi‑session map alignment and reuse with global consistency at large scale. We implement a chained loop closure mechanism that efficiently propagates geometric constraints across inter‑session keyframes through an adjacency graph, enabling robust long‑horizon consistency triggered by reliable short‑horizon loop closures. The system initializes inter‑session alignment with GNSS‑proximity place recognition, then performs on‑the‑fly loop closure detections and joint optimization of loaded maps and newly acquired trajectories within a unified factor graph, maintaining both inter‑ and intra‑session geometric consistency without dynamic object removal, and cross‑platform robustness with minimal hyperparameter tuning. Experimental results show improved trajectory accuracy and robust multi‑session integration on large‑scale datasets. We release our source code to support reproducible research in large‑scale multi‑session LiDAR SLAM. Project site: https://ai4ce.github.io/Chain‑SLAM/
Authors:Mehdi Zafari, Björn Ottersten, A. Lee Swindlehurst
Abstract:
Integrated Sensing and Communication (ISAC) is envisioned as a key technology for 6G wireless networks, enabling the joint use of spectrum and hardware for sensing and communication. In multi‑static cell‑free architectures, coordinating beamforming and power resources across distributed access points (APs) is critical in order to mitigate severe communication‑sensing interference. Most existing ISAC resource allocation solutions rely on centralized architectures with full network knowledge, which limits their scalability and practicality in distributed cell‑free deployments with imperfect channel state information (CSI). In this paper, we introduce a framework for COordinated Resource allocation for Distributed ISAC Systems (CORDIS) that optimizes network sensing while suppressing clutter and maintaining per‑user communication performance constraints. Two algorithms are developed: CORDIS‑Split, a low‑overhead scheme that pairs fixed local beamformers with centralized power allocation, and CORDIS‑ADMM, which jointly optimizes beamforming and power through the consensus Alternating Direction Method of Multipliers (ADMM). By localizing high‑dimensional matrix operations, both algorithms ensure fronthaul overhead and per‑AP computation remain independent of antenna and AP counts. Simulations demonstrate that CORDIS‑ADMM approaches the centralized performance bound and degrades gracefully under CSI estimation error, remaining effective even with locally rank‑deficient channels, while CORDIS‑Split offers a minimal‑overhead alternative. These results confirm that CORDIS is a scalable and communication‑efficient foundation for robust ISAC in decentralized wireless networks.
Authors:Obinna I. Ekekezie
Abstract:
Draft‑verify‑revise is a common LLM orchestration pattern for scaling inference‑time compute. One LLM drafts, a second critiques the draft and provides feedback, and a third uses that feedback to revise the draft into the final output. As context cascades between stages, LLMs at different stages can resolve a context‑dependent expression such as "previous" differently. When that happens, the expression undergoes a deictic shift, a change in what it refers to. This phenomenon was studied with a synthetic dataset of 10 base examples, each rendered in three conditions. Holding the shared components constant, the conditions varied whether the draft stage LLM (the assistant) or the verify stage LLM (the grader) resolved the expression correctly, and how much independent reasoning the revise stage LLM (the meta‑evaluator) needed to determine which reading was correct. Six models from three providers were tested across 21 reasoning effort configurations using e‑values for sequential testing, in a primary experiment and an ablation experiment that removed error classification labels from the grader's feedback. A separate LLM analyzed the meta‑evaluator's stated rationale for each wrong verdict. Balanced accuracy (the unweighted mean of sensitivity and specificity) ranged from 0.156, below chance, to near‑perfect. GPT‑5.2 rose from 0.156 without reasoning to 0.942 at its highest reasoning effort level, while Gemini 3 Pro stayed above 0.94 at every level. Gemini 3 Pro at low reasoning effort outscored GPT‑5.2 at xhigh reasoning effort for roughly 5% of the cost per trial. When the meta‑evaluator erred, it tended to rely on surface cues rather than operational reasoning. Context engineers implementing draft‑verify‑revise pipelines should be wary of deictic shifts and make the intended referent explicit at each stage.
Authors:Jonghyun Kim, Junho Roh, Yubin Yoon, Hyotae Lee, Jongkuk Park, Taehwan Hwang, Jaechul Kim, Jungho Lee
Abstract:
Understanding person‑level bi‑manual interactions requires not only detecting hands, but also identifying which two hands belong to the same person and what each hand interacts with. Existing hand‑‑object interaction methods are mostly hand‑centric: they treat each hand as an independent instance, which can lead to ambiguous ownership in multi‑person scenes. We propose a person‑centric formulation in which a single query predicts a structured output for one person, including the human box, body pose, hand boxes and states, and interaction targets. We introduce part‑aware deformable attention to allocate attention across human, hand, and pose‑specific reference regions, enabling one query to capture the full person structure. We further unify detection and interaction reasoning with a hand‑to‑query relationship matrix, where each hand selects its interaction target from the detected query set plus a learnable off token, directly recovering the target's box and class without separate object regression. We build a COCO‑based dataset with person‑centric bi‑manual interaction annotations and define structured metrics for evaluating hand states and complete hand‑‑object tuples. Experiments with a transformer‑based detector show that our formulation improves person‑level bi‑manual interaction parsing and provides an effective unified framework for joint detection, pose estimation, and hand reasoning.
Authors:Shilong Zou, Shilin Zhang, Yingji Zhang, Yuhang Huang, Yi Zhang, Zeyuan Ding, Han Dong, Junwei Liao, Yong Dai, Jian Tang, Xiaozhu Ju
Abstract:
In this technical report, we propose Pelican‑Sim 1.0, a general world model simulator for embodied intelligence that predicts future observations from visual context and robot actions to support downstream learning and decision making. The model incorporates four key design features: (1) Unified action representation: a 28‑dimensional action value space covering most mainstream embodiments, keeping one model valid across heterogeneous devices. (2) Action‑visual injection: URDF‑ and camera‑rendered action videos bridge actions and pixels, giving markedly better controllability across embodiments, scenes, and tasks (PSNR +0.904 over alternative fusion baselines). (3) Sparse mixture‑of‑experts (MoE): sparse MoE layers add capacity for heterogeneous dynamics and absorb the action modality while reducing inter‑modality conflict (FVD ‑6.530 vs. the dense backbone). (4) Efficient rollout generation: causal adaptation and few‑step distillation yield a four‑step autoregressive simulator, achieving a 5.67‑fold speedup over the 35‑step model. Benefiting from these designs, we train on approximately one million real‑world and simulated trajectories and obtain large gains in action controllability and video quality: PSNR improves over the strongest evaluated baselines by 4.636 on AgiBotWorld Beta, 2.080 on RoboMIND, and 10.343 on RoboTwin, with the adapted EWMBench DYN score up 0.426 on RoboTwin. Relying on this, four downstream applications on RoboTwin succeed: 500 generated trajectories added to 50 demonstrations per task raise policy success from 70% to 93%; policy evaluation reaches a Pearson correlation of 0.994 across five checkpoints; and relative success gains reach 47.7% for action selection and 20.3% for policy improvement. Qualitative generalization across trajectory, scene, object, embodiment, and viewpoint shifts highlights its potential as a general‑purpose world model simulator.
Authors:Rohit Taneja, Travis Weber
Abstract:
Agent skill registries screen what they publish. OpenClaw's security team reported that its scanners overlap on at most 10.4% of combined positives, and 81.9% of flagged skills are caught by one scanner alone. We take that as given, and suggest the open question is not which scanner is right but which is being asked. Each answers a form of "is this skill malicious?", which is what it was built for. "Is this action permitted here, by this operator, right now?" is not one it is designed to express. We report three measurements over 66,192 public ClawHub skill versions. First, 705 skills across 135 distinct publishers that every scanner and the registry's judge rate clean nonetheless instruct an action prohibited by CIS Control 2.7 and NIST SP 800‑53 CM‑11. A hand audit of 100 puts our detector at 92% precision and found no marker of malicious intent. One publisher contributes 506 of the 705, so we report the distribution with the count. This is reproducible from public artifacts. Second, of 144 commands a live agent executed in a sandbox while following real skill documentation, 34.7% carried a consequence class absent from that document. Third, over 53 cleared skills documenting an action no clean record earns, the agent reached for one in 23 and the gate stopped all 23. The harness and every recorded command are released. We offer one design for that gap: a deterministic resolver with no model in the decision path, feeding a per‑(resource, class) trust ledger whose promotion thresholds derive from the operator's stated risk tolerance. Ten clean approvals cannot exclude a true failure rate of 25.9% at 95% confidence. We price the gate's interruptions across a spectrum of operator policies rather than quote one false‑positive rate, since friction is a property of the policy, not the gate. We release a 64‑case obfuscation benchmark; ours resolves 52%.
Authors:Frank Fundel, Alexandra Howard
Abstract:
Passive acoustic monitoring produces far more bat recordings than experts can label. We show that simple model‑generated pseudo‑labels turn this surplus into effective supervision. We compare pseudo‑labeling with other semi‑supervised learning methods on an 18‑species European corpus using only 10% of its training labels, then transfer the strongest approaches to South African field audio containing nine bat taxa and a nuisance class. Pseudo‑labeling outperforms the other semi‑supervised learning methods on every European measure, recovering up to 61.5% of the gap to full supervision. It transfers to field audio with gains of 10.69 points in species accuracy and 4.96 points in species macro‑F1. We also introduce genus‑aware smoothing, which directs uncertain target mass toward congeneric species. Combined with uniform smoothing, it reaches 79.16 species macro‑F1, 4.73 points above hard targets. Simple pseudo‑labels are therefore highly effective at this ecological data scale, while genus‑aware targets inject useful biological structure at no annotation cost. https://code4conservation.github.io/UnlabeledEchoes/
Authors:William Oliveira
Abstract:
Cloud‑centric web benchmarks miss constraints that matter for self‑hosted services on ARM64 single‑board computers, especially idle RAM footprint and energy per request. We ran a pilot benchmark on one Raspberry Pi 5, measuring equivalent SQLite‑backed CRUD APIs implemented in Go 1.26/net/http, Rust 1.95/Axum, Python 3.13/FastAPI+Granian, Node.js 24/Fastify, and .NET 10 Native AOT across N=50 randomized runs per stack and endpoint, with a separate concurrency sweep and memory time‑series collection. Rust achieved the highest weighted throughput‑to‑RAM ratio (310.25 req/s/MB, 2.8x Go) because its weighted peak RSS was 7.36 MB, while .NET, Node.js, Go, and Rust formed a raw‑throughput cluster with overlapping bootstrap CIs (2,125‑‑2,461 req/s) and Python remained below that cluster at 969 req/s. The concurrency sweep on GET /items/:id showed divergent scaling: .NET reached 26,209 req/s at c=240, Go and Rust plateaued near c=120, Node.js saturated near 9,700 req/s, and Python stayed below 2,300 req/s; memory snapshots showed Rust holding a flat 7.8 MB RSS while Node.js grew by 117 MB without visible GC drops. For RAM‑constrained self‑hosted CRUD‑over‑SQLite deployments on this Pi 5 unit, the data support Rust as the most resource‑efficient measured stack, .NET as the strongest high‑concurrency stack, and Go as a practical option where ecosystem breadth matters; replication is needed before extending these findings to other devices or storage backends.
Authors:Haiwen Diao, Jiahao Wang, Chenjing Ding, Hanming Deng, Jiangnan Chen, Ruixi Zhang, Ruohui Wang, Wenwen Tong, Xiangyu Fan, Yubo Wang, Yue Zhu, Yuwei Niu, Zhengqi Bai, Zhiqian Lin, Zhitao Yang, Zhongang Cai, Bo Yang, Chen Feng, Chengguang Lv, Guangjia Liu, Guanlin Wang, Hanyu Zhang, Haojia Yu, Hongcan Xiao, Hongli Wang, Huan Wu, Huaping Zhong, Jian Fang, Jianan Fan, Jiaqi Li, Jiefan Lu, Jing Zuo, Jingcheng Ni, Junxiang Xu, Linjun Dai, Mutian Xu, Peishen Yan, Penghao Wu, Ruijie Mao, Ruisi Wang, Shihao Bai, Shuang Yang, Shuya Yang, Shuyan Zheng, Silei Wu, Siying Li, Tao Chu, Tianbo Zhong, Tongxi Zhou, Weichao Luo, Weichen Fan, Wenhao Jia, Wenjie Gao, Xiangli Kong, Yan Li, Yang Yong, Zimo Wen, Zixuan Qian, Wenxiu Sun, Ruihao Gong, Quan Wang, Lewei Lu, Lei Yang, Ziwei Liu, Dahua Lin
Abstract:
We launch SenseNova‑U1.5, an 8B‑MoT native unified multimodal model that understands, reasons about, and generates visual content within an encoder‑free and VAE‑free architecture. We strengthen its visual interface through spatially coherent patch reconstruction and scale its training with carefully curated generation and editing data, improved task formulation, structural prompt enhancement, and native resolutions of up to 4K. For post‑training, we optimize specialized experts for visual aesthetics, bilingual text rendering, infographic generation, and image editing, and consolidate their capabilities through multi‑expert on‑policy distillation. Across extensive evaluations, SenseNova‑U1.5 largely advances image fidelity, text rendering, complex composition, multi‑reference editing, and interleaved generation, while improving instruction following and preserving subject identity, geometry, and unmodified regions. Despite limited exposure to structured formats in its generation data, SenseNova‑U1.5 generalizes effectively to long, complex, and structured visual instructions, further proving that multimodal understanding can transfer to visual planning and creation. Together, these findings position native unified modelling as a promising path towards systems that perceive, reason and create within a fully end‑to‑end framework. We will open‑source training code, including supervised fine‑tuning, reinforcement learning, and on‑policy distillation.
Authors:Dexter Ong, Vijay Kumar, Pratik Chaudhari
Abstract:
Reliable relative localization between aerial and ground robots is a key requirement for tightly coordinated heterogeneous teams. This can be difficult to do using conventional frame‑based cameras and fiducial markers because they are sensitive to motion blur, lighting variations, and payload constraints. This paper presents EVPeriscope, an event‑based perception system that enables detection, localization and control of a quadrotor using an upward‑facing event camera on a ground robot by detecting the high‑frequency visual signature of its propellers. This system allows the quadrotor to function as an extended perception system for the ground robot when onboard sensors exhibit degradation or occlusion. We demonstrate the capabilities of this marsupial ground‑aerial system via experiments in challenging field conditions with wind speeds of up to 15 mph, in both daylight and at night. We show that the system supports localization and closed‑loop navigation through dense foliage where the ground robot's sensors are occluded. Our control system for the quadrotor operates at 200 Hz entirely with onboard sensing and computation. More details and experiment videos can be found on the project page: https://ongdexter.github.io/evperiscope.
Authors:Varun Teja Chundru, Debasmita Biswas
Abstract:
Large language models generate fluent text that can contain unfaithful claims ‑‑ a phenomenon known as hallucination. We present a multi‑signal detection pipeline combining fine‑tuned DeBERTa‑v3 classification, Monte Carlo (MC) Dropout uncertainty quantification, and temperature‑scaled calibration for response‑level hallucination detection. Evaluated on the HaluEval benchmark, our pipeline achieves F1=0.915 and AUROC=0.977 on general‑domain tasks, with per‑task F1 scores of 0.97 (QA), 0.96 (Summarization), and 0.82 (Dialogue). MC Dropout inference further improves accuracy to 93.2%. A context ablation study confirms the model performs genuine entailment reasoning rather than exploiting surface patterns, with summarization F1 dropping 24% when knowledge context is removed. Learning curve analysis reveals that 25% of training data captures 77% of full‑data performance. Beyond detection, we apply Direct Preference Optimization (DPO) to a Qwen2.5‑0.5B generator, reducing its hallucination rate from 85.5% to 37.7% (55.9% relative reduction) as measured by our detector. Cross‑domain evaluation on the SciFact biomedical benchmark shows that general‑domain training transfers poorly (F1=0.52), motivating domain‑specific fine‑tuning. PubMedBERT fine‑tuned on SciFact achieves F1=0.63 and AUROC=0.81, demonstrating that domain‑matched pre‑training is the strongest adaptation strategy. Code and models are available at https://github.com/varunteja99/hallucination‑detection‑nlp
Authors:Wei Li, Rui Shao, Jie He, Lingsen Zhang, Ziwei Liu, Liqiang Nie
Abstract:
Recent advances in Vision‑Language‑Action (VLA) models have improved robotic manipulation, yet observation‑to‑action learning remains limited by a fundamental transition realizability gap, manifested in three tightly coupled problems: (i) Transition ambiguity. Visually similar current observations may correspond to different manipulation phases and imply different subsequent transitions. (ii) Prediction‑‑execution mismatch. A visually plausible predicted future observation does not necessarily correspond to a physically realizable transition. (iii) Experience‑‑realization mismatch. A historically executable action pattern may not necessarily realize the intended transition in the current scene and therefore requires context‑aware adaptation. Accordingly, we propose UniMPA, a Unified Memory‑Prediction‑Action model that addresses these problems through a shared action‑grounded transition interface. (i) UniMPA introduces Persistent‑Selective Future Prediction to resolve transition ambiguity by modeling the intended future state evolution. A persistent latent stream continuously tracks task‑level progress, while a transition‑critical pixel stream selectively resolves fine‑grained interaction changes through memory‑grounded prediction. (ii) To assess the physical executability of the anticipated transition, the predicted transition queries a temporal Visual‑Action Memory Bank. The bank retrieves historically realized visual‑action experience, grounding future prediction in executable evidence. (iii) To adapt executable experience to the current scene, an Action‑Visual Memory Bank retrieves visually grounded action prototypes from historical action evolution. Prototype‑Biased Flow then shifts the flow source toward a historically supported action manifold for context‑aware refinement.
Authors:Francisco Caldas, Ruben Belo, Cláudia Soares
Abstract:
We introduce AdamX, a first‑order optimizer that incorporates cosine similarity as an adaptive mechanism for controlling update magnitudes. The proposed method is scalable, model‑agnostic, and straightforward to integrate into existing training pipelines. We further introduce a variance rectification scheme that promotes smoother optimization during the early stages of training. Overall, we provide empirical evidence that AdamX achieves competitive convergence rates across a range of benchmark datasets and architectures. Performance is evaluated in terms of the number of epochs required to reach predefined performance thresholds under a fixed hyperparameter budget. Code and Experiments available at: https://github.com/FranciscoCaldas/adamX.
Authors:Meimingwei Li, Stefan Andreas Baumann, Felix Krause, Björn Ommer
Abstract:
Visual Autoregressive Models (VAR) generate images through next‑scale prediction, producing all tokens within each scale in parallel. We show that this parallel decoding constitutes a mean‑field‑style approximation that discards spatial dependencies among same‑scale tokens, causing locally incoherent samples regardless of backbone capacity ‑‑ a limitation of the decoding rule. Addressing this limitation, we introduce the Logit Refiner, a lightweight autoregressive module that restores intra‑scale dependencies by sequentially sampling tokens conditioned on frozen backbone features. Adding only ~10% parameters and less than 5% of the base model's training compute, it plugs into any pretrained VAR checkpoint without retraining. Controlled ablations isolate joint intra‑scale sampling ‑‑ rather than additional capacity or training ‑‑ as the critical ingredient. Across backbones from 310M to 2B parameters on class‑conditional ImageNet 256x256, the refiner consistently improves generation quality, enabling a 1.1B‑parameter model to surpass one twice its size. The approach further generalizes to text‑to‑image generation, confirming that the mean‑field bottleneck persists across VAR variants and is effectively alleviated by our method. Project page: https://compvis.github.io/logit‑refiner/
Authors:Kai Stewart, Yasunori Toshimitsu, Robert K. Katzschmann
Abstract:
Dexterous in‑hand manipulation of a grasped object with an anthropomorphic hand is an unsolved frontier for robot dexterity. The contact‑richness and highly dynamic nature of object‑hand interactions tend to require extensive modeling or data‑collection efforts for learning‑based approaches. Modern simulators used for reinforcement learning (RL) cannot fully replicate the required contact complexity, while collecting dexterous demonstrations for imitation learning (IL) remains an open problem. In this research, we present an embodied control approach based on real‑time task Jacobian estimation of the combined hand and object system on the physical robot. Using only the CPU on a laptop, the proposed controller begins in‑hand pen writing after approximately 18 s of initialization and continues to adapt online, without an analytic hand‑‑object kinematic/contact model, simulation training, or precollected task demonstrations. We demonstrate that the same estimator/controller formulation works on three anthropomorphic robotic hand systems (one physical, two simulated) to show human‑like, in‑hand articulation of a grasped pen by an embodiment‑independent formulation. Sub‑millimeter in‑plane precision (mean 0.6 mm across runs) is achieved across letters and shapes written in the air and on paper on a physical robot. To our knowledge, this is the first demonstration of an anthropomorphic hand writing arbitrary single‑stroke trajectories with a grasped pen through purely in‑hand motion, and it showcases an alternative to compute‑ and data‑heavy approaches such as RL and IL for achieving dexterous manipulation through computationally simple and data‑efficient algorithms.
Authors:Joseph Kanichai, Tiziano De Matteis, Animesh Trivedi
Abstract:
Prefix caching can reduce the time to first token (TTFT) of long‑context LLM requests by reusing previously computed key‑value (KV) states, but for short prefixes or fast GPUs, recomputation can be faster than loading from an external cache. We characterize this tradeoff in vLLM across GPU, CPU, and NVMe tiers using synthetic workloads, long‑context benchmarks, production traces, and find that cache performance depends on transfer granularity, intermediate memory use, and when transfers enter the request schedule, not only on device bandwidth. These findings motivate py‑kvcache, a vLLM KV Offload connector with asynchronous direct I/O, bounded shared staging, and scheduler‑aware preloading, which starts disk reads while requests are still waiting, overlapping with compute. At 80k tokens, py‑kvcache loading from disk is 2.0x faster than LMCache, with preloading contributing 1.34x. With GPU, CPU, and disk caching enabled, it is 1.23x faster than LMCache and within approximately 4% of the native vLLM KV Offload implementation. LongBench and SCBench show that these benefits extend to irregular prefix chains and multi‑turn workloads. Bailian trace replays improve TTFT on a weaker GPU, but on an H100 the average request falls below the break‑even point and GPU memory alone retains enough prefixes. External KV caching should therefore be treated as a setup specific admission decision. The py‑kvcacheimplementation is available at: https://github.com/atlarge‑research/py‑kvcache.
Authors:Vladislav Diuzhev, Dmitry Yudin
Abstract:
Unified models for object detection and trajectory forecasting aim to merge perception and prediction for autonomous driving, refining actor trajectories directly over shared bird's‑eye‑view (BEV) images rasterized from LiDAR and high‑definition maps. Their accuracy on dynamic, moving actors, however, remains the hardest part of the task, and the strongest such model, DeTra, has no public implementation. We contribute an openly released DeTra reimplementation with documented approximations, and on top of it MC‑DeTra: a family of motion‑consistency mechanisms that add supervision through two annotation‑derived auxiliary signals ‑‑ each actor's observed past motion and the occupancy of the surrounding traffic that forms its social context ‑‑ and one inter‑output consistency constraint that aligns an actor's predicted heading with its predicted direction of motion. Every proposed loss is train‑only and inference‑safe: it shapes the shared BEV representation during training and is removed at test time, adding no inference latency. On the Waymo Open Dataset, evaluated under a strict, detection‑conditioned forecasting protocol, MC‑DeTra improves dynamic, socially‑situated trajectory forecasting while preserving or improving detection accuracy; a gradient‑based loss‑calibration analysis exposes how the auxiliary objectives compete at the shared backbone, and our ablation identifies which signals contribute most. We release code, configurations, and evaluation tooling at https://github.com/diuzhevVlad/MC‑DeTra.
Authors:Erchao Rong, Zihao Liu, Junning Liang, Jianguo Wang, Xiao Jie, Haoran Fu, Ziliang Chen, Ximin Lyu
Abstract:
This paper presents a coordinated trajectory generation and tracking control framework for a tail‑sitter unmanned aerial vehicle (UAV), which does not require aerodynamic priors identified for a specific airframe while addressing the challenge of flight control under highly nonlinear aerodynamics across the full flight envelope. The core innovation lies in employing phase‑specific aerodynamic modeling strategies for planning and tracking, tailored to their distinct functional characteristics, without requiring airframe‑specific aerodynamic priors. Specifically, the phi‑theory model under coordinated flight is employed to derive an analytic differential flatness mapping, and a simplified but locally accurate model is established for predictive control to enable real‑time aerodynamic parameter estimation. The proposed framework is evaluated extensively through both simulation and challenging real‑world flight tests under mild wind conditions, showing high‑precision tracking and adaptability across the tested aerodynamic conditions. To the best of our knowledge, this is the first real‑world demonstration of accurate trajectory tracking over tested flight regimes spanning the full envelope of a tail‑sitter UAV without relying on aerodynamic identification campaigns. The source code of our framework is available at: https://github.com/SYSU‑HILAB/AP‑PnC.
Authors:John Bonnici, Matthew Baugh, Aleksandra Kulbaka, Sarah Cechnicka, Bernhard Kainz, Alberto Gomez
Abstract:
Accurate identification of end‑diastole (ED) and end‑systole (ES) in echocardiography underpins the quantification of ventricular function, yet manual selection of these key frames is subjective and introduces clinically significant inter‑operator variability. Recent self‑supervised methods either prescribe strict periodic trajectories or learn an unconstrained low‑dimensional motion subspace from reconstruction or registration objectives. The former offers interpretability but imposes restrictive assumptions on temporal progression, whereas the latter leaves cardiac phase implicit and ED/ES must be recovered through post‑hoc geometric processing of the learned trajectory. We translate the physiological observation that cardiac phase is a one‑dimensional signal into a prior by constraining the latent motion component to a single‑parameter latent orbit, i.e., a global linear trajectory in latent space indexed by a bounded scalar phase variable. Mapping this variable through a sinusoidal nonlinearity yields an oscillatory motion signal with consistent temporal ordering, enabling direct identification of ED and ES from the learned phase signal. This inductive bias allows the model to capture an interpretable representation of the cardiac cycle, while maintaining flexibility to capture irregular heartbeats. Trained on EchoNet‑Dynamic without annotations, our minimal single‑parameter cardiac phase model learns an effective latent orbit, significantly improves upon the previous state of the art in ED localisation and matches it in ES localisation while using a more constrained representation and fewer training epochs. This demonstrates that a principled physiological inductive bias can match or exceed the performance of more complex representations. Code is available at: https://github.com/BonniciJ/OrbitalEcho/
Authors:Luca Della Libera, Cem Subakan, Mirco Ravanelli
Abstract:
Neural audio codecs are a fundamental component of modern speech generation systems. While recent codecs achieve increasingly low bitrates, reducing frame rate remains challenging, as each token must preserve more information while maintaining reconstruction quality. We present ZipCodec, a streaming neural speech codec operating at 6.25 Hz and 0.80 kbps with a theoretical latency of 160 ms. Our approach combines large‑scale WavLM distillation with a redesigned transformer‑based architecture, a scalar spherical quantizer, and a latency‑aware streaming decoder. Experiments show that ZipCodec substantially outperforms existing streaming codecs at comparable bitrates in both reconstruction and downstream tasks, while operating at a significantly lower frame rate. Despite its 842M parameters, ZipCodec achieves real‑time single‑stream inference on a consumer‑grade CPU. Demo samples, code and checkpoints are available at https://lucadellalib.github.io/zipcodec‑web/.
Authors:Mingzhe Han, Jiahao Liu, Dongsheng Li, Jiankui Zhou, Hansu Gu, Peng Zhang, Ning Gu, Tun Lu
Abstract:
Federated recommendation enables collaborative model training while keeping user interaction data on local clients. A central problem in federated recommendation is how to aggregate useful information across clients for personalized recommendation. Existing personalized aggregation methods usually construct client relations from predefined parameter‑based assumptions, such as parameter similarity or complementarity, and use these relations to determine aggregation weights. However, such methods construct a single global relation, which is insufficient to capture the hierarchical and multi‑granularity nature of user relations in recommendation. Moreover, these predefined relations cannot directly reflect whether the related clients can improve prediction performance after aggregation. To address these limitations, we propose FedHUR, a federated recommendation framework for learning hierarchical utility‑guided client relations. FedHUR takes item‑item filters as the object for relation construction and aggregation. Specifically, it first aggregates and clusters each client's local information to obtain global hierarchical information. Each client computes hierarchical utility signals based on its local information and the global hierarchical information, indicating which collaborative information is useful for improving its prediction. The server uses these utility signals to retrieve clients that are useful to that client for further personalized aggregation. Extensive experiments on five real‑world datasets show that FedHUR consistently outperforms existing federated recommendation baselines, demonstrating the effectiveness of hierarchical utility‑guided client relation learning. Code is available at https://github.com/Mingzhe‑Han/FedHUR.
Authors:Suho Yoo, Hyunjong Ok, Jongmin Choi, Jihoo Jung, Joon Son Chung
Abstract:
As Omni‑modal large language models (Omni‑LLMs) take in audio, video and text together, their KV cache memory cost grows. KV cache quantization is the de facto approach in text‑only LLMs, but its application to Omni‑LLMs remains unexplored. In this paper, we analyze how TurboQuant, a representative rotation‑based KV cache quantization method, behaves on multimodal caches and identify two critical issues: temporal key drift and heterogeneous value geometry. To address these, we propose OmniKVQuant, a training‑free framework that (i) sets the key quantization range over each short window of the input stream; and (ii) rotates values separately per modality. On Qwen2.5‑Omni and Qwen3‑Omni, OmniKVQuant enables 2‑bit KV caches while substantially preserving performance across seven audio‑visual benchmarks. We further provide a fused Triton decode kernel that unpacks the 2‑bit cache during attention, so no dense FP16 cache is ever built. Code: https://github.com/kaistmm/OmniKVQuant
Authors:Youngeun Nam, Joeun Kim, Hwanjun Song, Susik Yoon, Jae-Gil Lee, Byung Suk Lee
Abstract:
Although large language models (LLMs) and retrieval‑augmented generation (RAG) have advanced open‑domain question answering (QA), they remain unreliable when documents evolve through amendments. Existing time‑sensitive retrieval methods address only the disjoint‑evolving environment, where each update is an independent snapshot. However, laws, policies, and regulations often operate in overlapping‑evolving environments, where amendments override earlier clauses while preserving most content, creating strong semantic overlap across versions. We propose TimelyRAG, a retriever‑agnostic framework that incorporates temporal distance into ranking to align queries with version‑appropriate documents. We also introduce TimelyQABench, the first benchmark for regulation‑heavy domains with overlapping‑evolving challenges. Experiments show consistent gains, up to +28.6% in nDCG@10, highlighting the importance of temporal reasoning for reliable QA over evolving documents. All resources are available at https://github.com/kaist‑dmlab/TimelyRAG.
Authors:Sizhe Zhao, Haozhe Xie, Weiyu Zhao, Chenchu Zhang, Huan Wang, Chenyang Wang, Qinglin Liu, Shengping Zhang
Abstract:
Mainstream robotic policies often adopt a Markovian formulation, but many complex real‑world manipulation tasks are inherently non‑Markovian, requiring long‑horizon memory beyond the current observation. Existing memory mechanisms often rely on language summaries, growing visual windows, or their combinations, and may therefore lose fine‑grained visual evidence or face a trade‑off between history coverage and execution efficiency. We introduce MaP‑WAM, a Memory‑as‑Plans framework that decomposes memory‑dependent world‑action modeling into memory‑grounded planning and plan‑conditioned execution, and uses long‑term multimodal episodic context as planning‑time evidence rather than repeatedly conditioning the executor on the full history. MaP‑WAM represents memory as completed segment records containing language instructions and sparse visual context, and converts this episodic memory into compact plans comprising the next segment‑level language plan and corresponding visual guidance. A World‑Action‑Progress (WAP) model executes each plan over an unknown duration by jointly predicting action chunks and corresponding execution progress at inference time, calibrating predicted progress through plan‑observation alignment for adaptive segment transitions and closed‑loop context updates. MaP‑WAM keeps the executor context length fixed, while structured attention further enables key‑value caching in both planning and execution. MaP‑WAM achieves state‑of‑the‑art performance on RMBench with an 83.3% success rate and attains 78.0% success on real‑robot tasks, while maintaining approximately constant executor inference latency as task history grows.
Authors:Chenxi Song, Yanming Yang, Chi Zhang
Abstract:
Autoregressive video world models enable interactive, long‑horizon exploration, but flexible control remains challenging. Exploring a source video from new viewpoints requires the generated rollout to remain synchronised with the recorded event, place observed content in the requested view, plausibly complete newly exposed regions, and recover previously generated appearance on revisits. Existing methods typically address these requirements through task‑specific modules or additional training. We present World in World, a training‑free inference‑time interface that converts heterogeneous control evidence into camera‑ and time‑labelled clean visual states, which are read through the native self attention of a frozen causal video model. The evidence comprises source‑video observations, target‑view scene projections, geometry renderings that guide completion of newly exposed subject regions, and retrieved generated states beyond the rolling cache. Each evidence source carries token‑level support and its own availability schedule. A correspondence router combines persistent point identities with geometry to establish token correspondences, guiding supported queries towards matching source‑video tokens. Evidence‑wise attention CFG (EWA) then independently regulates each auxiliary channel's additional contribution using attention responses from the same denoising forward pass. The shared interface supports camera‑controlled rerendering, long‑horizon revisiting, and human‑motion transfer with the same frozen backbone. We evaluate World in World on camera‑controlled video rerendering under diverse viewpoint changes, assessing perceptual quality, temporal consistency, and camera‑following accuracy.
Authors:Vivek Kumar Singh, Preeti Priyam
Abstract:
In production, agentic systems answer questions over data that lives in several places and keeps changing: licenses are reassigned, users offboarded, prices changed, contracts renewed. Existing retrieval benchmarks freeze the data, so they cannot ask whether an agent's answer is still true, only whether it found the right passage. We present ChurnBench, an open‑source benchmark that generates a four‑source enterprise data fabric as a timeline rather than a snapshot. Every change is written to an append‑only ground‑truth ledger, and gold answers are computed from that ledger, never from the live stores. An answer that was correct when its data was retrieved but wrong when evaluated is therefore detected and labeled a freshness error, distinct from a reasoning error; we validate this by resolving ground truth at both timestamps for every case reported. Using the instrument, we find that when a system refreshes on a schedule, cache age does not predict staleness. Across cache ages of 1, 14, and 28 days, freshness errors were 7, 4, and 4, because scheduled refresh bounds staleness by time‑to‑live, and no TTL lapse was observed in any window. A controlled ablation confirms the mechanism: disabling tiered refresh raises freshness errors from 4 to 45 at 28 days and leaves them identical at one day. The variable a drift benchmark should sweep is therefore TTL configuration against each entity's rate of change, not drift‑window length. ChurnBench, the evaluation harness, and all per‑error data are released open source.
Authors:Menglin Wang, Xiaojin Gong
Abstract:
Estimating reliable cross‑modality association is crucial to unsupervised visible‑infrared person re‑ID. While optimal transport is shown to be a practical solution for cross‑modality association, it suffers from the rigidness of hard label assignment without considering the impact of cluster noise. Moreover, enforcing only cross‑modality contrast is also suboptimal, as it fails to jointly optimize the similarity relation within and across modality. In this paper, we propose a novel framework for cross‑modality learning by well exploitation of prototypes: First, instead of contrasting with cross‑modality prototypes, we show that modality‑unified prototypical contrast facilitates better modality invariance by jointly and simultaneously optimizing similarity relation within and across‑modality. Taking self‑prototype as a steady teacher, we further refine the instance‑prototype online relation through prototype‑guided self‑distillation. The two components are optimized in a unified framework, leading to a simple yet effective model. On standard VI‑ReID benchmarks, we perform extensive comparison and analysis, validating the effectiveness of our proposed method. Code is available at: https://github.com/Terminator8758/PoSeD.
Authors:Abhinav Rajeev Kumar, Harshit Arora, Varun Singh, Manikandan Nanjappan
Abstract:
A structurally valid DeFi workflow can still authorize a costly trade. We introduce DeFiFlowBench, a benchmark of 207 team‑authored prompts for natural‑language DeFi workflow synthesis. It measures graph coverage, configuration completeness, and declared safety predicates, then tests supported trade configurations on a local EVM. Direct, constrained, and few‑shot prompting produce 14‑19 unsafe held‑out executions per configuration under a fixed 5% price‑impact cap. A slippage bound derived from a quote does not prevent the price impact of the order itself. We propose Koan‑Safe, which combines a prompt‑only intent parser, a replaceable generator, and structural repair with default safety parameters. On 75 held‑out workflow prompts, its hybrid variant scores 0.67 on the static safety proxy, compared with 0.33 for the best baseline. Koan‑Safe records no unsafe executions on the saved benchmark outputs. A matched‑candidate ablation produces 14‑17 unsafe executions when enforcement is disabled. Additional tests expose the limits of default injection: permissive existing thresholds can still authorize unsafe trades. A separately evaluated policy cap addresses this failure on a 36‑case diagnostic grid. These results support explicit trade protections and execution‑based evaluation, while distinguishing declared safety from a general guarantee.
Authors:Vladislav Bargatin, Alexander Yakovenko, Khaled Abud, Dmitriy Vatolin
Abstract:
Optical flow methods typically rely on task‑specific inductive biases, such as correlation volumes, feature warping, and iterative refinement, among others, to reach high accuracy. While effective, such biases constrain the model to predefined heuristics, which can limit its expressivity and lead to more complex pipelines and additional computational cost. We present FreeFlow, a hierarchical transformer built without any flow‑specific components, using instead a single feed‑forward encoder‑‑decoder. FreeFlow combines three attention variants: window attention for local processing, shifted‑window attention for cross‑window information exchange, and a global attention operating at a reduced resolution. The resulting architecture scales naturally with model capacity, enabling a consistent accuracy gain from small to large variants. Despite the absence of standard inductive biases, FreeFlow achieves state‑of‑the‑art results on major benchmarks, including Sintel (0.68/1.48 EPE on Clean/Final), KITTI‑2015 (3.23 Fl‑all), and Spring (3.192 1px), while remaining memory efficient at 1080p inference.
Authors:Haobin Liu, Xin Wang
Abstract:
Brain metastases exhibit high inter‑lesion variability in size, enhancement pattern, and post‑treatment appearance, making volumetric segmentation of both pre‑ and post‑treatment cases the central challenge of the BraTS 2026 Task 1 (Brain Metastases). We build a pragmatic pipeline on a 5‑fold nnU‑Net ResEnc‑L ensemble, in which each fold is trained independently for 1,000 epochs with the standard Dice + cross‑entropy loss on 1,296 four‑modality training cases. This ensemble is followed by a rule‑based post‑processing cascade tuned for the lesion‑wise Dice similarity coefficient (LW‑DSC), a detection‑oriented metric that behaves very differently from the traditional global Dice. The final pipeline reaches an LW‑DSC of 0.733 / 0.751 / 0.713 / 0.549 on the enhancing tumour (ET), tumour core (TC), whole tumour (WT), and resection cavity (RC) sub‑regions on the official validation leaderboard. Rather than trusting these leaderboard gains, we audit every post‑processing stage with a five‑fold out‑of‑fold (OOF) analysis with no model‑training leakage over all 1,296 training cases, scored with the official BraTS evaluation code (BraTS_evaluation): it confirms two stages as robust, per‑fold‑consistent improvements while the third improves only the leaderboard and does not reproduce out‑of‑fold. We further provide a mechanistic analysis of the LW‑DSC metric that explains why recall‑recovering post‑processing carries low risk whereas component deletion does not, and we report thirteen negative results spanning loss engineering, alternative backbones, and inference‑time settings, several of which run counter to widely held intuitions. Source code is released under Apache‑2.0 at https://github.com/hornbeamliu/brats2026‑met.
Authors:Haojun Zhang, Yi Zou, Min Chen, Qize Yu, Lianrui Fan, Xini Ding, Hao Li, Shuchang Zhou, Xianming Liu, Shiyu Huang
Abstract:
Reducing audio‑encoder depth lowers the inference cost of speech large language models, but removing complete blocks perturbs the embeddings consumed by the decoder and can cause deletion and premature end‑of‑sequence errors. We introduce X‑AuT, a progressive framework that selects layer combinations through short behavioral probes and restores the pruned model through representation alignment, cross‑scale distillation, scheduled student‑policy supervision, and LoRA finetuning. The language‑model backbone remains frozen, while attention LoRA adapters and the tied output embedding adapt during distillation. Training uses the highest‑agreement tier from a transcript‑consistency pipeline, followed by source reweighting during finetuning. On ten public Chinese‑‑English benchmarks, compressing Qwen3‑ASR‑0.6B from 18 to 16 audio‑encoder layers reduces macro‑average error from 5.61% to 5.27%. The 14‑layer model reaches 5.75% with 20.7% fewer audio‑tower parameters. Under the matched recipe, the 1.7B teacher yields 5.55% mean error, compared with 8.45% for self‑distillation, and progressive 18\rightarrow14 pruning outperforms direct pruning (5.75% vs. 6.73%). These single‑run results establish two practical operating points and show that the accuracy effects vary across benchmarks. Project website: https://xpeng‑ai.github.io/x‑aut
Authors:Narcis Marincat
Abstract:
In shared‑genome language‑model societies, restricted evidence visibility favors reusable, value‑indexed latent packet interfaces, whereas the sole high‑performing globally visible model in the parent study learned an episode‑entangled code. This companion study asks whether independently trained societies share one packet language, where strict zero‑shot transfer fails, and whether inherited interface state helps or harms later learning. First, a leakage‑controlled causal interoperability audit over all 30 ordered pairs of six independently trained restricted societies ‑‑ under sealed held‑out structure and a preregistered raw/orthogonal/linear/nonlinear alignment ladder ‑‑ shows the six semantically similar interfaces do not form one raw language: one same‑initialization pair is exactly interoperable in both directions, a second shows asymmetric partial compatibility, and all 26 cross‑initialization directions fail every frozen alignment rung. Second, within the tested decomposition and a single sealed source formulation, a source‑span control localizes strict zero‑shot failure to interpretation and execution of the new operator instructions. Third, in a matched adaptation factorial, the globally trained communication interface acts as a severe negative‑transfer prior: reinitializing only the packet reader, writer, and mouth raises final depth‑three accuracy from 0.169 to 0.857. Fourth, across two restricted checkpoints and two independently frozen target streams each, inherited interfaces never exceeded fresh‑interface controls by the preregistered 0.10 margin. All primary conclusions are bounded to a near‑transfer 17‑state setting; the negative‑transfer factorial concerns one globally visible parent‑cohort checkpoint, while an appendix adds a post hoc tagged‑global twin case study.
Authors:Minghao Guo, Meng Cao, Sui Zhao, Siyu Ning, Xin Wang, Haoze Zhao, Jiaxuan Yang, Haihong Hao, Mingfei Han, Shunlin Rong, Haijun Wu, Xiaodan Liang, Xiaojun Chang
Abstract:
Deep research agents are increasingly capable of web search, tool use, multimodal evidence analysis, and information synthesis. However, existing benchmarks mainly evaluate medium‑horizon exploration and rarely test whether agents can sustain long, dependency‑heavy research processes. We introduce Mr.LHDR (Multimodal real‑world Long‑Horizon Deep Research), a benchmark for evaluating real‑world deep research over long, irreducible chains of interdependent evidence across eight categories. Each question is constructed from a hidden Node‑Relation graph and requires an average of 12.1 necessary intermediate conclusions with a mean dependency depth of 10.4 before reaching a short, unique, and verifiable answer. Questions incorporate multimodal evidence, including images, maps, PDFs, logos, charts, tables, and video frames, with at least one non‑text element that changes the reasoning state. Mr.LHDR evaluates both final answers and the correctness of intermediate conclusions under annotated dependencies. We evaluate general models, deep research systems, and agent frameworks using Overall Accuracy (OA), Strict Accuracy (SA), Checklist Score (CS), and Dependency‑Aware Checklist Score (DACS). Results show that even the strongest system achieves only 43.1% OA and 34.3% SA, indicating that final‑answer accuracy substantially overestimates complete research success. Removing images reduces DACS by 12.6 points, demonstrating the importance of multimodal evidence, while SA consistently declines as reasoning chains become longer. These findings reveal sustained, dependency‑consistent evidence integration, rather than isolated fact retrieval, as a key bottleneck for current deep research agents.
Authors:Pengfei Zhang, Teng Sun, Xianchao Xiu
Abstract:
Pretrained generative robot policies learn expressive action priors from demonstrations. However, existing reinforcement learning methods only steer the noisy space but fail to modulate intermediate action representations during the generation process, resulting in performance degradation and inefficiency. To address this limitation, we propose a novel Dual‑Latent Space Reinforcement Learning (DLSRL) framework, which complements initial‑noise steering with representation‑level control inside the frozen generator. Specifically, our actor network predicts two distinct latent variables: an initial‑noise latent variable that steers behavior generation, and an action‑representation latent variable for intermediate feature modulation. Moreover, this representation latent variable is mapped to adapter features and ingeniously injected into the hidden states of intermediate action tokens via residual connections. Our dual‑control design enables direct adjustment of action representations without updating the base policy. Experiments across generative policy architectures and robotic manipulation tasks show that DLSRL effectively accelerates online robot policy adaptation and achieves competitive performance. Our code is available at \hrefhttps://github.com/xianchaoxiu/DLSRLhttps://github.com/xianchaoxiu/DLSRL.
Authors:Zixuan Duan, Xunzhi Xiang, Yabo Chen, Xin Zhang, Changhan Liu, Haibin Huang, Chi Zhang, Qi Fan, Xuelong Li
Abstract:
Few‑step distillation improves the efficiency of autoregressive (AR) video generation, but often causes diversity collapse: under the same prompt, different noise samples tend to produce highly similar videos with weakened motion dynamics. We analyze this degradation in Distribution Matching Distillation (DMD)‑distilled AR video generators and find that, in the autoregressive setting, it takes the form of a structured uncertainty collapse: the mode‑seeking bias of DMD maps different noise samples to nearly identical first chunks, and the deterministic AR cache then propagates this collapsed state to all subsequent chunks, turning a local loss of stochasticity at the rollout root into a global suppression of temporal variation. Based on this analysis, we propose Uncertainty DMD, a simple uncertainty‑injection framework that restores stochasticity at two key stages of AR generation: a timestep perturbation for the first chunk to increase first‑chunk diversity, and a stochastic cache‑writing mechanism for later chunks to preserve uncertainty in autoregressive conditioning. The method requires no architectural changes and introduces only lightweight perturbation operations. The same perturbation mechanisms are used during both training and inference. Experiments show that Uncertainty DMD consistently improves diversity and motion dynamics while maintaining comparable per‑sample visual quality.
Authors:Kun Yuan, Harold Wang, Echo Li, Egusi Gui, Kiki Hu, Lucas Luo, Magnus Hu
Abstract:
As AI systems move from transient model invocations toward long‑lived actors that persist across credentials, clients, sessions, and runtime instances, identity infrastructure must answer a basic question: where should the canonical continuity boundary be placed? This paper introduces Actor‑native Identity and presents SoulAuth, an open‑source Rust reference implementation for Humans and long‑lived AIActors. We argue that any subject that must persist under its own identity and remain independently attributable should have an ActorIdentity that is not replaced by an Account, Credential, Client, AuthSession, IdentityBinding, or runtime instance. SoulAuth therefore treats Humans and long‑lived AIActors as first‑class identity subjects while keeping authentication distinct from downstream authority. Methodologically, we use a Philosophical Engineering approach that translates conceptual analysis of subjecthood into identity objects, invariants, lifecycle semantics, system responsibilities, implementation boundaries, and inspectable conformance evidence. Evaluation against the fixed SoulAuth v0.1.0 artifact shows that the implementation realizes core boundaries including Human/AIActor first‑class identity status, Client/Actor separation, and Authentication/Authority separation, while gaps remain in unified Credential modeling and historical attribution anchored to ActorIdentity. We therefore report partial, not full, architecture conformance.
Authors:Daniel Reisenbüchler, Yousef Sadegheih, Michael Dittrich, Pratibha Kumari, Muhammad Usman, Dorit Merhof
Abstract:
The larval stage of Drosophila melanogaster is a compact model system for neuroscience whose genetic toolkit allows fluorescent markers to be expressed in defined neural populations, and comparing the resulting expression patterns across animals requires every brain to be registered into a shared anatomical reference space. Existing pipelines for this task are predominantly based on classical registration methods, which perform a new optimization for each volume, often require per‑case parameter tuning, and can take minutes per brain, limiting their use as a routine preprocessing step. We present a trained deep registration pipeline that deformably aligns a larval brain to a reference template in a single forward pass at high spatial resolution, on volumes that hold several times more voxels than those learned 3D registration is normally reported on, together with the preprocessing and anatomy‑anchored evaluation pipeline required to apply it. Against eleven classical and seven further learned baselines on a held‑out collection acquired with different acquisition and quality strata, the proposed pipeline is the most accurate, improving on the strongest classical baseline by 23 percentage points of anatomical landmark‑local mutual information. It registers a volume one to two orders of magnitude faster than the classical deformable pipelines, and it retains more of its accuracy than any other method as acquisition quality degrades. The network, its trained weights and the full pipeline are released as the open‑source deep larval brain registration framework: https://github.com/agentdr1/deep‑larval‑brain‑reg
Authors:Kui Jiang, Yang Gu, Jiacheng Liu, Shiyu Liu, Youyu Chen, Hui Liu
Abstract:
Recovering clean 3D scenes from hazy multi‑view images is challenging because haze attenuates scene radiance and introduces atmospheric scattering. Recent scattering‑aware Gaussian Splatting methods introduce physical haze models into reconstruction, but they often apply degradation in image space or bind medium‑related variables to Gaussian primitives, which can entangle clean scene radiance with atmospheric effects. Moreover, low‑transmittance regions provide weakened supervision for Gaussian optimization, causing distant or dense‑haze areas to be under‑reconstructed. We argue that clean reconstruction under haze requires both scene‑‑medium disentanglement and transmittance‑aware optimization rebalancing. To this end, we propose Tri‑DehazeGS, a scene‑‑medium decoupled Gaussian Splatting framework. It represents the clean scene with Gaussian primitives, models the participating medium using an independent view‑shared tri‑plane field, and composes hazy observations through a physical scattering model. We further introduce Medium‑Decoupled Transmittance Gradient Compensation (MD‑TGC), which compensates haze‑suppressed gradients after medium freezing without altering forward rendering. Experiments on real and synthetic haze benchmarks show that Tri‑DehazeGS improves clean novel‑view reconstruction. Code is available at https://github.com/aptx46/Tri‑DehazeGS.
Authors:Michael Neri
Abstract:
Replay attacks are the most accessible threat to voice‑controlled systems, and the acoustic cues that expose them are strongly modulated by the environment in which the attack is mounted. A detector deployed in the field therefore has to absorb new acoustic conditions over time, ideally without revisiting past recordings, since retaining speech indefinitely is both expensive and legally constrained. We frame this as Domain‑Incremental Learning (DIL) over acoustic environments and present the first continual learning benchmark for multi‑channel replay speech detection, evaluating a state‑of‑the‑art beamformer‑based detector over all 24 environment orderings of the ReMASC corpus with five seeds. Sequential fine‑tuning forgets severely, raising the error rate on previously learned environments by 18.8 points. Elastic weight consolidation (EWC) halves forgetting but loses plasticity, gradient projection memory (GPM) is statistically indistinguishable from naive fine‑tuning, and the proposed task‑specific beamformer (TSB) that keeps one spatial front‑end per environment significantly improves final and incremental accuracy. We further show that the last environment of the sequence dominates final performance. Code, results, and analysis are available at https://github.com/michaelneri/replay‑speech‑continual.
Authors:Zuomin Qu
Abstract:
Synthetic image attribution (SIA) has become increasingly important with the rapid advancement of text‑to‑image generation models. However, accurately identifying the source model of a generated image remains challenging due to the growing similarity among modern diffusion‑based generators and the presence of diverse post‑processing operations. In this report, we present a multi‑view and confusion‑guided ensemble framework for the Synthetic Image Attribution Challenge of the DLMMDD Workshop at ICANN 2026. Our approach integrates multiple complementary architectures, including FFT‑ConvNeXt, DINOv2, CLIP, and Xception, to capture diverse attribution cues from frequency, semantic, and forensic perspectives. To improve robustness against unknown degradations and image manipulations, extensive data augmentation strategies are employed during training, simulating realistic post‑processing operations such as compression, resizing, grayscale conversion, and blur. Furthermore, we analyze the confusion patterns of the ensemble model and observe severe ambiguity between Stable Diffusion 3 and Stable Diffusion 3.5. To address this issue, we introduce a dedicated binary expert classifier that is selectively activated under low‑confidence conditions. We additionally apply class‑adaptive confidence calibration to improve the discrimination of challenging classes such as Tencent Hunyuan. The proposed framework achieved 99.53% on the public leaderboard and 99.20% on the private leaderboard. The source code and implementation details are publicly available at https://github.com/ZOMIN28/SIA.
Authors:Yilin Long, Chenming Zhu, Zitang Gou, Jingli Lin, Tai Wang
Abstract:
Recent visual generators produce high‑fidelity images yet often violate physical consistency under ego‑motion, limiting their use for spatial reasoning and embodied planning. Existing benchmarks largely focus on isolated images or single‑step quality, leaving this challenge underexplored. We introduce EgoGenEval, a geometry‑grounded, pose‑free benchmark designed to evaluate the physical consistency of visual generators under ego‑motion, and organize our study into two parts. (1) EgoGenEval contains 1,400 cases and 2,360 target views spanning single‑step and multi‑step ego‑motion. It separately measures Camera Motion Grounding (CMG) and Scene State Preservation (SSP), with both metrics validated against blinded human judgments. Evaluating 16 pose‑free generators together with two pose‑conditioned references reveals that current models struggle to execute camera motion while maintaining scene state, and that no system performs well on both axes at once. (2) To examine whether benchmark‑derived data can improve these capabilities, we build EgoGen‑Train from the same geometry‑grounded pipeline and run controlled SFT studies. These show that pairwise supervision does not reliably improve camera‑motion grounding and scene‑state preservation together: even at the full training pool and the longest budget, scene preservation gains a fraction of what camera motion does. This points to the pairwise teacher‑forced objective itself as the binding constraint, motivating a trajectory‑centric paradigm that couples self‑conditioned rollouts with explicit pose and visibility supervision.
Authors:Zhiwen Yang, Jiayin Li, Chengyu Liu, Hui Zhang, Bingzheng Wei, Yan Xu
Abstract:
All‑in‑One medical image restoration (MedIR) aims to address diverse tasks across modalities and degradation types using a single universal model. Existing methods typically prioritize modeling inter‑task heterogeneity (e.g., distinct data distributions and degradation types). However, they largely neglect the inherent homogeneity present in medical images, such as widely shared anatomical structures within and across modalities, which can be leveraged to ease model training and improve generalization. To this end, we propose UniH3, a novel framework that Unifies Hierarchical Homogeneity and Heterogeneity for all‑in‑one medical image restoration. Specifically, to comprehensively exploit homogeneity, we introduce a Hierarchical Homogeneity Memory (H2M) module that progressively distills intra‑ and inter‑task homogeneity priors from high‑quality images during training, and adaptively retrieves the most relevant priors tailored to the input for guided restoration. These retrieved priors are then injected into the restoration pipeline via an efficient Homogeneity‑Guided Attention (HGA) mechanism. Furthermore, to comprehensively address heterogeneity, we design a Hierarchical Heterogeneity Balancer (H2B) that mitigates both inter‑ and intra‑task conflicts during optimization, facilitating balanced and effective multi‑task learning. Extensive experiments on two large‑scale benchmarks, MedIR‑2D‑500K and MedIR‑3D‑3K, demonstrate that UniH3 achieves state‑of‑the‑art performance on both all‑in‑one and single‑task medical image restoration. We hope this work establishes a strong benchmark and advances the development of general‑purpose medical image restoration models. Code is available at https://github.com/Yaziwel/UniH3.
Authors:Dong Li, Sixuan Mi, Zihao Ye, Huan Xiong, Tao XU, Tong Zhu, Aijia Zhang, Junqi Gao, Kaiyan Zhang, Shijie Wang, Bowen Zhou, Yuqiang Li, Biqing Qi
Abstract:
Unraveling reaction mechanisms is central to modern chemistry, yet automating these investigations remains challenging because computational workflows still rely heavily on expert intervention. Here we introduce ARCHE, an autonomous agentic system that integrates a general‑purpose reasoning model, a domain‑specialized computational chemistry model, and a structured tool registry to transform mechanistic inquiry into a scalable, self‑validating process. ARCHE interprets scientific questions, generates and prioritizes mechanistic hypotheses, orchestrates computational workflows, and iteratively refines conclusions based on computed evidence within a closed loop. We validate its capabilities across three increasingly demanding scenarios: reconstructing stereocontrolling transition states and validating the corresponding reaction mechanism in a previously reported asymmetric catalytic reaction; proposing and validating a plausible radical pathway through iterative hypothesis refinement for a recently discovered but unpublished α‑iodoboronate C‑I cleavage reaction; and identifying a chemically interpretable descriptor that governs selectivity in nickel‑catalysed migratory cross‑coupling reactions. By coupling agentic reasoning with rigorous computational validation, ARCHE advances autonomous mechanistic discovery and establishes a foundation for broader machine‑assisted chemical research. The code for ARCHE is publicly available at https://github.com/JetAstra/Arche‑Harness.
Authors:Koutian Wu, Junjie Zhou, Ergan Shang, Jiayu Wang, Pengqian Han, Junkai Wang, Wanghan Xu
Abstract:
Benchmark researchers and developers of large language models (LLMs) and other AI systems need to find relevant evaluations, locate their benchmark datasets and code, and understand the settings behind reported scores. We present Benchmark Radar, a living database and search engine for retrieval and discovery of AI benchmarks, covering LLM evaluation, agentic and tool‑use benchmarks, coding, reasoning, safety, and domain‑specific evaluations. The system combines daily discovery of benchmark papers, repositories, datasets, and releases with a searchable benchmark catalog, mentions in model cards and technical reports, and score histories. It retains source identities and citations so readers can inspect candidate benchmarks and their evaluation evidence. Daily discovery draws on 37 sources: 13 direct connectors and 24 first‑party research and engineering feeds. The catalog contains 1,283 source records drawn from 4 benchmark catalogs and 12,916 numeric observations on 790 records. We describe collection and retrieval, audit the full catalog, and examine benchmark saturation, adoption trends, and the limits of score comparisons. A worked example walks through a complete prior‑art search, showing how to query the catalog and inspect benchmark evidence when designing a new evaluation. We release the web dashboard with a benchmark leaderboard, a Pareto frontier view of score against measured use, saturation and trend views, daily feeds, downloadable evidence, a command‑line interface (CLI) for offline queries, and reproducible analysis.
Authors:Zesheng Wei, Mengfan Li, Wenhao Liu, Yixin Zhang, Zilei Wang, Yang Deng
Abstract:
Dispute mediation is essential for maintaining social harmony and resilience, yet developing skilled mediators is costly and time‑consuming. Existing LLM‑based mediation research remains limited by unrealistic task formulations, low‑fidelity datasets, and coarse evaluation metrics that obscure turn‑by‑turn dynamics. To address these gaps, we introduce ProMediConv, a novel benchmarking framework that models mediation as a proactive, multi‑stage, and party‑aware dialogue process incorporating 11 mediation strategies and four party behavior pattern (BP) states. Using 972 complete real‑world cases, we construct a high‑fidelity mediation dataset with utterance‑level annotations of strategies and BP states. Furthermore, to better assess agent impact, we propose MAD (Mean Attribute Difference), a fine‑grained metric that captures BP shifts throughout the dialogue. Leveraging this framework, we establish a comprehensive benchmark by evaluating diverse models alongside our tailored baseline ProMediAgent. Extensive empirical analyses reveal critical behavioral phenomena and underscore the persistent challenges current models face in dynamic, multi‑party mediation. Ultimately, ProMediConv provides a rigorous foundation and a vital quantitative standard for advancing AI‑assisted conflict resolution. Our dataset and codebase are accessible at https://github.com/ZsWei66/ProMediConv_repo.
Authors:DongHyun Ryu, Jaehyeok Lee, YeongJun Hwang, JinYeong Bak
Abstract:
Large language models are increasingly used as judges to measure social bias in text, yet the passages they judge are often noisy, containing typos, informal spelling, and broken punctuation. The consequences of such surface noise for social bias measurement remain unclear. To investigate this question, we apply five realistic noise conditions at multiple intensity levels to 3,822 stereotype‑related responses and compare the resulting bias judgments with those on the original text. We find that such surface noise does not degrade bias measurement symmetrically: it is far more likely to turn neutral judgments into biased ones than biased judgments into neutral ones, by up to a 120x margin. We further observe two non‑obvious effects across four LLM judges: in the most fragile judge the distortion is at its purest at mild, realistic noise levels, where erasure is scarcest, and as judges grow robust it attenuates toward parity rather than reversing. Bias measured on noisy text is therefore systematically overestimated, most in the categories that matter most for fairness.
Authors:Zonghao Ying, Xiangfan Wu, Huiyu Wu, Xing Zheng, Huangsheng Cheng, Xiaorong Shi, Jing Guo
Abstract:
Autonomous agents increasingly perform long‑horizon tasks involving tool use, persistent state, and consequential actions, raising a fundamental question: \emphunder what conditions does an agent cross the boundary of authorized execution while pursuing a legitimate task? Existing studies often attribute such failures to adversarial instructions, malicious environments, or conflicting objectives, leaving unclear how loss of control can emerge during otherwise legitimate task execution. We study this question by independently manipulating three factors: goal pressure, control degradation, and executable unsafe opportunity. Our central hypothesis is that a degraded control boundary becomes consequential when the environment exposes an executable action that crosses it, even when the underlying task remains legitimate and a sanctioned path remains feasible. We test this hypothesis in a deterministic multi‑turn environment across five agent models and 16 operational domains. Across 1,800 unique trajectories, we find that neither degraded control nor unsafe opportunity alone produces substantial loss of control; when both are present, the loss‑of‑control rate reaches 55% in the full‑factorial study and 62% across ten additional operational domains. Restoring the original control boundary reduces the rate to 0% even when the unsafe action remains executable. A context‑management ablation further shows that compaction itself is not harmful: preserving the control constraints yields 0% loss of control, whereas omitting them increases the rate to 87%. These results show how a latent loss of control can become an external violation: the task objective remains intact, but an executable opportunity can turn a missing control boundary into consequential action. Our code will be made publicly available at https://github.com/Tencent/AI‑Infra‑Guard.
Authors:Chaelin Kim, Seokhyeon Hong, Kwan Yun, Soojin Choi, Inseo Jang, Junyong Noh
Abstract:
We present ReCHOIR, a novel contact‑guided motion retargeting method for transferring human object interaction (HOI) motions across diverse humanoid characters. Unlike prior motion retargeting methods that primarily focus on transferring human motion alone, our goal is to preserve not only the semantics of the original body movement but also consistent interaction between the character and the manipulated object, while jointly producing aligned target human and object motions. Given source HOI motion, object geometry, and contact cues extracted from the source interaction, ReCHOIR retargets an HOI sequence to target characters with different skeletal configurations while maintaining both motion semantics and contact‑consistent interaction patterns. Our method builds on a Part‑Aware Motion Embedding (PAME) autoencoder, which encodes full‑body motion into a shared body‑part‑wise latent space. This representation enables generalization across heterogeneous skeletons while preserving local motion semantics beneficial for part‑aware adaptation in HOI retargeting. On top of this representation, we introduce a contact‑guided retargeting module and an object motion decoder for HOI retargeting. The contact‑guided retargeting module treats the source object interaction as a condition for refining target character motion: object‑ and contact‑related signals are encoded into a body‑part‑aligned latent representation and injected into decoding through a residual control branch, enabling stronger adaptation in interaction‑relevant body regions without discarding the underlying motion prior. In parallel, the object motion decoder predicts a target object motion aligned with the refined target character motion, ensuring that the object trajectory remains consistent with how the interaction is realized by the target character.
Authors:Haseeb Mohammed Afsar
Abstract:
Studies of the Model Context Protocol (MCP) server ecosystem draw their samples in ways that quietly select for servers that work: reference sets, popularity lists, hand‑curated frames, or pipelines that repair a server until it starts. We report what an unrepaired probability sample actually contains. From a 24,135‑server registry census we draw 400 npm/stdio servers with a published seed and probe each one over the wire. Only 48.8% complete an initialize handshake, against 66.7% for a hand‑curated frame measured with the same instrument, and the dominant failure is not missing credentials (13.3%) but servers that never start at all (37.5%). Among the 195 that do run, hard conformance is total: zero fatal JSON Schema violations across 2,766 advertised tools. Optional safety annotations are the real variance, and the tool‑level omission rate on a random draw is 58.8% against 41.5% on the curated frame, so curation flatters this figure too. We then compare the tool descriptions these servers advertise against two tool‑use benchmark corpora using one method held constant. Real MCP tools show 2.8% near‑duplication at cosine 0.70, and all of it lies within single servers: cross‑author near‑duplication is 0.0% at every threshold tested. BFCL v4 shows 16.7%, of which 16.4 points lie between independently presented tasks. UltraTool shows 0.3%, cleaner than real tools, so this is a property of BFCL and not of synthetic corpora as a class. Separately, 68.8% of raw BFCL rows and 85.6% of raw UltraTool rows are exact name‑plus‑description repeats, against 0.4% for real MCP, so any statistic computed over these releases without global deduplication measures repetition rather than tools. All figures regenerate from released scripts and a published seed.
Authors:Taylor Gordon
Abstract:
A point set is universal for planar graphs on n vertices if every such graph has a straight‑line drawing without crossings whose vertices belong to the set. We construct universal point sets of size n^1+o(1), improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for 213‑avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT‑6 Astra assisted in developing the construction and proof.
Authors:Kian Hosseinkhani, Qinhe Peng, George Shramko, Mehran Aghabozorgi, Jianing Qian, Tristan Engst, Alireza Moazeni, Dinesh Jayaraman, Ke Li
Abstract:
Vision‑language‑action (VLA) policies leverage pretrained vision‑language backbones to achieve strong cross‑task generalization. A leading design couples this backbone with a dedicated continuous action head trained via diffusion or flow matching. However, such heads rely on iterative multi‑step sampling, for example 10 Euler steps in π_0.5. This creates an inference bottleneck that produces stop‑and‑go movement in the robot and slower task completion. We introduce IMLE‑VLA, which replaces the iterative action head with a single‑step conditional generator trained via conditional Implicit Maximum Likelihood Estimation (cIMLE). The cIMLE objective promotes multimodal action coverage, avoiding the mode collapse of naive regression heads while eliminating multi‑step sampling entirely. When IMLE‑VLA is applied to π_0.5, it increases inference frequency 3.67x (55 Hz vs. 15 Hz), enabling up to 11x higher action throughput. On the 40‑task LIBERO benchmark, IMLE‑VLA achieves the highest average success rate (98.0%) among all baselines while leading in inference frequency. Under the test‑time perturbations of LIBERO‑plus, IMLE‑VLA retains π_0.5's robustness while other baselines degrade sharply, confirming that the cIMLE head preserves generalization. Real‑world experiments on a Franka Emika Panda across four tasks demonstrate smoother motion (2.2x to 3.0x lower jerk) and faster task completion, with IMLE‑VLA outperforming π_0.5 on every task and reducing average VLA inference time per episode by 3.9x to 6.6x. Videos and code are available at https://kianhk6.github.io/IMLE‑VLA/
Authors:Dou Hoon Kwark, Kianoush Falahkheirkhah, Ji-hun Oh, Shirui Luo, Volodymyr Kindratenko, Rohit Bhargava
Abstract:
Label‑free virtual staining offers a compelling, non‑destructive alternative to standard histopathology; however, its clinical adoption is hindered by the computational bottlenecks inherent to processing gigapixel Whole Slide Images (WSIs). Current deep learning approaches require patch‑based inference to avoid memory constraints, which disrupts global tissue continuity and introduces tiling artifacts‑‑displaying visible seams and color shifts. To address this, we introduce the Consistency Memory Bank (COMB), a novel label‑free virtual staining framework that enforces spatial and channel consistency across tiles without memory bottlenecks. COMB decouples context storage from computation, utilizing a dynamic retrieval mechanism to fetch feature representations from adjacent tiles. This enables a retrieval‑based context integration strategy that adopts local padding to resolve spatial discontinuities and neighbor‑aware channel attention to stabilize statistical drift. Further optimized with a sliding window schedule to ensure minimal memory overhead, our method demonstrates superior performance over state‑of‑the‑art baselines, achieving significant improvements in both perceptual fidelity and tiling consistency, while suggesting its downstream utility in tumor segmentation. Code is available at https://github.com/dou0000/COMB.
Authors:Esteban Gutiérrez, Behzad Haki, Christopher Haworth, Xavier Serra, Rodrigo Cádiz
Abstract:
Quadratic difference tones (QDTs) are a species of auditory distortion product in which a "phantom" pure tone, absent from the acoustic signal, is clearly audible to listeners. Exploiting this phenomenon, one can synthesize harmonically rich tones for musical purposes, a technique called Quadratic Difference Tone Spectrum (QDTS) synthesis. Previous works have introduced numerical methods to synthesize QDTS based on the distortion function, which links a target QDTS and an overtone‑structured carrier signal. While accurate, these methods were stochastic and discontinuous, making them difficult to control for musical purposes and effectively limiting them to stationary signals. This paper proposes a neural network‑based approach that learns an approximate inverse of the distortion mapping in an autoencoder‑like configuration, producing a continuous approximation that addresses prior limitations. Experimental results show that, although slightly less numerically precise, the method is sufficient for perceptual and musical applications. We also implement a real‑time version in Max and evaluate its performance. Various sound examples demonstrate its expressive and musical potential. The source code, audio examples, tutorials, and software accompanying this work are available at https://cordutie.github.io/projects/qdts.html
Authors:Thomas Cohn, Seiji Shaw, Harel Biggie, Travis Manderson, Nicholas Roy, Russ Tedrake
Abstract:
Planning trajectories for robot manipulators under kinematic equality constraints restricts feasible motions to a measure‑zero submanifold of the configuration space, requiring special algorithmic treatment. A promising strategy is parametrizing the set of feasible configurations using analytic inverse kinematics (IK). Bespoke analytic IK functions can be written to be differentiable, a necessary property for gradient‑based trajectory optimization. But the vast majority of IK functions are computed by automated meta‑solvers like IKFast, and are difficult to modify for differentiability. We present a new approach for computing gradients of analytic IK parameterizations: we leverage the inverse function theorem to recover the desired gradients from the ordinary forward kinematic Jacobian. Furthermore, we present a least‑squares domain extension and an optimization‑amenable description of the reachability constraint, which preserves gradient signal outside the reachable workspace. We demonstrate the efficacy of our approach through numerical experiments and downstream tasks, including a hardware demonstration of an RB‑Y1 picking up a box and placing it on a table. Project website: https://cohnt.github.io/inverse‑function‑theorem‑parameterization/
Authors:Victor Mazzotti, Luiz Pereira, Marina Bitencourt dos Santos, Helena Maia, Carlos Caetano, Nádia Felix, Sandra Avila
Abstract:
Recent advances in large language models have transformed human‑computer interaction. Despite their fluency, these models often produce texts that are grammatically correct but semantically incoherent, containing contradictions or disruptions in logical flow. This work investigates whether enriching text with syntactic and rhetorical information can improve incoherence prediction. Our experiments and analysis show that plain texts achieved higher accuracy because the added information was structurally and syntactically incompatible with the language model's architecture. Additionally, to demonstrate the practical importance of coherence assessment, we performed zero‑shot experiments on a Brazilian disinformation dataset, suggesting that textual coherence can serve as a proxy for detecting misleading content. Code and models are available at https://github.com/ittozzamV/cohereclassifier.
Authors:Asif Pinjari, Mithun Paul Saint-Germain
Abstract:
When an indirect prompt injection succeeds against an LLM agent, the compromise is visible in the agent's own behavior: a benign prefix of tool calls, a poisoned observation, and a suffix of actions that serve the attacker. An operator needs three facts: where the attack entered, which steps it corrupted, and whether apparent poison was resisted. Existing systems return either a whole‑trace verdict or a single unsafe index. We present DriftNet, a dual‑head trajectory Transformer that reads a logged tool‑call trajectory and answers all three questions in one forward pass: one head classifies the trajectory as compromised or not, and a second assigns every step one of four labels (benign, injection point, hijacked, failed injection). To our knowledge it is the first supervised detector to produce this joint output. A frozen sentence encoder and four identity‑free world features embed each step; the trained trunk, under two million parameters and optimized with a class‑weighted joint objective over both heads, needs no access to the agent's model. On the task‑disjoint split of the AgentDrift benchmark (12,536 trajectories, 71,024 labeled steps), with a 20‑configuration sweep bounding hyperparameter sensitivity to 0.011 F1 and the test part evaluated exactly once, DriftNet reaches trajectory‑level F1 of 0.983, exact injection‑point recovery on 98.7% of attacked trajectories, hijacked‑span IoU of 0.979, zero flags on 218 resisted attacks, and 2.9% flags on hard negatives. A surface baseline retrained on the identical split recovers 11.1% of partial hijacks and 17.1% of delayed executions; DriftNet reaches 98.6% and 93.2% while lowering every false‑alarm rate. Reading all 26 residual errors shows that most misses trace to trajectories whose labeled injection observation carries no legible instruction, and we report the benchmark's measured world‑identity regularity alongside the results.
Authors:Hsuan Lo
Abstract:
Large language models are becoming the first point of contact for consumer search in domains where the stakes are material and the law is explicit. Existing audits show that models steer housing seekers by perceived identity, but none can say what a user loses when a recommender overlooks a suitable option, for want of an enumerated inventory to score omissions against. We audit AI housing recommendation against a verifiable ground truth. For each of 150 synthetic renter scenarios in New York City we build a pool of 120 real listings with known rent, bedrooms and GTFS‑computed transit commute, compute the exact set satisfying the renter's stated constraints, and derive its Pareto frontier. The primary outcome assumes no utility function: a recommendation is strictly dominated if the same pool holds a listing cheaper, faster to commute from and no smaller in bedrooms. Across 9,945 calls to three models from two vendors, compliance is near‑perfect (1.8% violation against a 66.6% random floor), yet 39.0% of recommendations are strictly dominated, and the dominating listing is a median 900 USD/month cheaper and 3.5 minutes closer. A within‑scenario manipulation separates two capabilities usually conflated: changing one sentence moves median recommended rent by 646 USD/month in the correct direction, so preferences are honored, yet recommendations still sit 606 USD/month above the five cheapest qualifying listings on the same screen, and an unambiguous lexicographic instruction gives no improvement under equivalence testing against a pre‑specified 50 USD/month bound. The gap widens with candidate‑set size and replicates across OpenAI and Anthropic models to within 3 USD. We characterize the failure as compliance without optimization, propose dominance‑rate instrumentation as a deployable diagnostic, and release all code, prompts and per‑call results.
Authors:Arman Nik Khah
Abstract:
When a language model finds a sentence unusually cheap to predict, it is tempting to conclude that the sentence was in its training data. Almost every published test of that inference has had to guess which sentences were in the training data, the members, and which were not. This paper removes the guessing. Two model families, OLMo‑2 and Pythia, publish their pretraining corpora, and a public index over those corpora returns the exact number of times any sentence appeared in each. Those counts make three questions answerable directly. The answers form a pincer, closing from two sides. At the duplication levels ordinary text actually has, five models from 1B to 13B parameters carry at most a faint trace of their own exposure. We measure that trace with a design that reads the same sentence through two models, which cancels fluency and quality by construction, and it comes to a rank correlation near ‑0.08, where ‑1 would be a perfect relation and 0 none. Where the trace does become strong, above roughly a thousand copies, the two corpora agree on which sentences those are, because they are the famous ones, so exposure can no longer be told apart from fame. Two further measurements show how apparent membership signal gets manufactured. A common way to build a non‑member is to change one word of a member. The model does prefer the original, but the gap is the same whether the original appeared once or a hundred times, so what the model is rewarding is the author's word choice, not memory. Above a thousand copies the gap grows with model size on the twelve sentences we can test there, at the same boundary where the pincer closes. And swapping the controls for sentences that differ from the members in register moves a detector from 0.83 to 0.94 AUC, on a scale where 0.5 is a coin flip and 1.0 is perfect separation. We release the sentence banks, counts, and code.
Authors:Seongjin Choi
Abstract:
Velocity‑aware pitch control is standard, but under a broadcast viewport half the players are off screen and on‑screen velocities come from a drifting calibration. We ask at which layer of broadcast off‑ball analysis velocity changes the answer. Inheriting our off‑screen imputation protocol (three Metrica matches, 44 m viewport, block‑bootstrap CIs), we score four velocity regimes ‑‑ none, viewport‑legal observed, true‑for‑visible, true‑for‑all ‑‑ against a velocity‑aware ground truth at three layers: imputation, the control surface, and team verdicts. Velocity is nearly useless for imputation (‑0.2 pp against a 12‑‑14 pp velocity‑free surface MAE), first‑order for the surface (‑1.5 to ‑1.8 pp, 11‑‑15% of that MAE), and ten times smaller for verdicts (‑0.12 to ‑0.19 pp). The velocity that matters is the visible channel: perfect occluded‑player velocity adds 2‑‑6% of the visible gain, and no last‑seen decay policy we tested exceeds that. Omitting velocity blurs the surface (per‑frame |e| 2.2‑‑2.6 pp) with small time‑averaged bias (per cell <=0.4 pp), whereas imputation error is a structured bias against the defending team's deep zone (5‑‑9 pp). At a fixed velocity window, a noise ladder of eleven jitter settings, including sigma_v‑matched pairs, is ordered to first order by one velocity‑noise axis sigma_v with break‑even ~1 m/s; eleven SoccerNet‑GSR clips from one match through our pipeline measure sigma_v=1.65 m/s yet recover 24‑‑36% of the benefit: 43% of the variance is frame‑common, which the surface tolerates, and the residual is heavy‑tailed and clustered, which Gaussian controls matched on component RMS do not reproduce (+0.03 vs. +0.36). The share of velocity‑free error that velocity removes grows with viewport width (7% at 36 m, 21% at 60 m): fix imputation on tight shots, velocity on wide ones. Code and logs are released.
Authors:Justine Giroux, Jack Oliver Hilliard, Yannick Hold-Geoffroy, Javier Vazquez-Corral, Jean-François Lalonde
Abstract:
Accurate modelling of illumination is central to realistic image synthesis and scene understanding. Yet, there is little exploration into whether image generative models are good at this task or whether physical plausibility remains a key challenge for them. Clearly, significant progress has been made in realistic image synthesis, but do models truly understand lighting in a physically accurate manner? To answer this question, this work proposes a benchmark to assess the lighting understanding and harmonisation capabilities of generative models. Our key insight is that evaluating lighting understanding for such models only requires testing how well they insert novel objects into real photographs whilst maintaining consistent illumination. To do so, we use a multi‑illumination dataset with images containing simple objects serving as ``light probes'', and prompt models to inpaint the same object onto the original image, then compare the generated results against the ground‑truth light probes. We then estimate the lighting direction, colour and radiance distribution from the inpainted probes, providing a quantitative measure of illumination accuracy and photometric realism. Our work establishes a scalable evaluation protocol to systematically assess how well generative models capture and reproduce real‑world lighting, offering a foundation for benchmarking the photometric accuracy of any future models. All code and data are available at https://lvsn.github.io/SheddingLight/ .
Authors:Bin Zhao, Patrick Chiou, Nakul Garg
Abstract:
Dense 3D depth perception fails under smoke, fog, and darkness because optical sensors cannot penetrate airborne particulates. mmWave radar remains usable and measures range accurately under these conditions, but its small aperture limits angular resolution. We present GRADE, which grounds a pretrained generative prior in single‑frame radar geometry to estimate high‑fidelity metric depth. GRADE first maps raw 4D radar spectra to coarse metric depth. A latent diffusion backbone then recovers structural detail while conditioning every denoising step on this estimate. A pixel‑space adapter uses residual camera cues when available and is trained across clear, smoke‑degraded, and occluded inputs so the full output approaches the radar‑conditioned path as visibility degrades. Trained and evaluated on ~95K frames across 12 buildings with real smoke, GRADE achieves an MAE of 0.303 m in clear scenes and 0.313 m under smoke, outperforming existing baselines. Code and datasets are available at https://phi‑lab‑rice.github.io/GRADE.
Authors:Dylan Jayabahu
Abstract:
A truth probe fitted where truthful reporting and a task's prescribed action coincide cannot distinguish those targets from its fitting labels alone. We call this failure of semantic identification perfect aliasing. In a controlled binary reporting game, truth and prescribed‑action probes fitted on compliant contexts solve the same optimization. On rival contexts their labels are complements, forcing their AUROCs to sum to one; this identity holds across 751 cell‑layer pairs to floating‑point precision. We separate prescribed output symbols from semantic action using randomized codebooks, then separate truth from prescribed action by fitting on mixed compliant and rival contexts. For a reward‑trained Gemma‑2‑9B policy that answers falsely on all evaluated rival trials, the conventional probe scores 0.006 \pm 0.005 AUROC across three training seeds, while mixed‑fit probes score 1.000 on the same held‑out activations. Mixed fitting uses more training examples and access to labelled rival contexts, so this comparison establishes linear recoverability rather than isolating the benefit of decorrelation. We also show that two compliant‑fit probes, both perfect in‑distribution, score 0.080 and 0.986 on the same rival activations. The findings concern what a probe measures: they do not establish preserved functional belief, causal use of the recovered direction, or a deployable deception detector. Code and aggregate results accompany the paper.
Authors:Junran Wang, Zehao Jin, Tianyu Luan, Xinjie Shen
Abstract:
Text‑to‑image diffusion transformers (DiTs) are powerful generators, yet direct prompting provides limited control interface for style intensity and can fail to suppress unwanted concepts. To enable these controls, we introduce AcFlow, an inference‑time controller that transports intermediate layer image‑token activations through a learned concept‑conditioned velocity field while keeping the base DiT frozen. A textual concept description specifies the desired intervention, while the integration horizon provides a continuous control parameter. The field produces token‑varying, activation‑dependent updates. With parameters shared across concepts within each task family, the field supports fine‑grained descriptions and generalizes to concepts unseen during training without per‑concept fitting. On style control, AcFlow achieves the best style‑‑content trade‑off among the evaluated baselines in the high‑style‑alignment regime. At a fixed operating point, AcFlow attains style‑‑content alignment of 0.5365/0.2860, compared with 0.4397/0.2684 for the baseline with the highest style alignment. Qualitative results demonstrate suppression of diverse concepts, including cases where direct prompting fails. Our analyses support the learned velocity field as an adaptive control mechanism, with update directions varying across tokens and depend on their activation states. Our code is available at https://github.com/Nove1yst/AcFlow.
Authors:Jinho Jeong, Se June Joo, Jaehyun Kang, Dongyun Kim, Yena Kim, Hanjung Kim, Seon Joo Kim
Abstract:
Human video datasets have emerged as a compelling alternative to expensive real‑robot data, offering rich diversity at scale. To bridge the human‑to‑robot embodiment gap, existing approaches either robotize videos in task‑matched settings or address observation and action alignment separately at scale. In this work, we systematically examine whether robotized human videos can provide effective and scalable supervision for pretraining vision‑language‑action (VLA) policies. To this end, we develop a robotization pipeline that converts heterogeneous human videos into robot‑aligned observations and action trajectories while inferring missing intermediate signals across annotation levels. Using this pipeline, we construct the HuRo dataset, comprising about 630K robotized episodes and 142M processed frames from five human‑video sources. Across four real‑world manipulation tasks, increasing robotized pretraining scale improves overall completion from 51.5% to 80.3% and OOD completion under spatial and visual shifts from 34.9% to 72.2%. Ablations further show that visual robotization improves OOD robustness and that end‑to‑end pretraining with retargeted actions outperforms visual‑only transfer. Code and data are released on our website: https://3587jjh.github.io/HuRo.
Authors:Niloy Kumar Mondal, Md Rizwan Parvez
Abstract:
Quadratic Unconstrained Binary Optimization (QUBO) is a central formulation for combinatorial optimization and has gained increasing attention due to its compatibility with quantum, hybrid quantum‑classical, and quantum‑inspired solvers. However, translating natural‑language problem descriptions into correct QUBO formulations remains difficult, requiring the identification of binary variables, constraints, objective functions, penalty terms, and suitable penalty weights. This process is time‑consuming and often demands substantial domain expertise. To address this challenge, we propose an end‑to‑end multi‑agent framework that automatically generates QUBO formulations from natural‑language problem descriptions, supported by structured or unstructured test cases. To evaluate its performance, We also introduce QUBOBench, a benchmark containing 100 combinatorial optimization problems across 12 application domains, curated from peer‑reviewed literature, competitions, and canonical NP‑hard problems. Experimental results show that our framework achieves 68% accuracy on QUBOBench, outperforming a direct single‑call baseline by 22%. Further analysis identifies iterative self‑repair as the most important component contributing to improved performance. The data and code are open‑sourced at https://quitttcat.github.io/QuantumQUBOAgent.
Authors:Shengjie Niu, Yeheng Ge, Jian Huang
Abstract:
Membership inference attacks (MIAs) have emerged as critical tools for auditing privacy risks in large language models (LLMs), aiming to determine whether a given text was included in a model's training corpus. However, most existing MIAs require access to per‑token logits or probabilities, making them inapplicable in practice to proprietary LLMs that expose only textual continuations. To address this underexplored setting, we propose Word‑level Probability MIA (WPMIA), a statistically principled MIA for strict black‑box privacy auditing. WPMIA estimates word‑level generation probabilities via Monte Carlo sampling with local kernel smoothing, then aggregates these estimates into a sequence‑level likelihood estimator. Furthermore, WPMIA constructs the likelihood conditioned on different prefixes, thereby amplifying the distributional differences between members and non‑members. We evaluate WPMIA across various open‑source LLMs and find that it consistently outperforms existing black‑box baselines. Importantly, we also evaluate WPMIA on modern proprietary LLMs, including GPT‑5‑Chat, Gemini‑2.5‑Flash, and Claude‑4.5‑Haiku, achieving an average TPR@5%FPR of 42.0 across these models. These results offer a sound foundation for future research on strict black‑box membership inference. Code is available at \hrefhttps://github.com/niusj03/WPMIAhttps://github.com/niusj03/WPMIA.
Authors:Shenghao Yang, Yanyan Dong
Abstract:
We present a machine‑checked Lean~4 formalization of Dong and Yang's classification of optimal finite‑length (n,4) binary block codes for binary symmetric channels. The formalization was developed mainly by feeding the paper's proofs to an AI tool. To establish correctness, the authors verified the main theorem statements in Lean and the accepted axioms. This note discusses the corrections and simplifications made to the AI‑generated formalization, and records discrepancies found in the paper during the formalization. The Lean code is available at https://github.com/shhyang/n4code_lean.
Authors:Zheng-Hui Huang, Guixu Lin, Jiacheng Lin, Yi-Chuan Huang, Ruihan Yu, Muyao Niu, Siqi Yang, Yu-Lun Liu, Yung-Yu Chuang, Kaipeng Zhang, Zhixiang Wang
Abstract:
Recent video world models generate increasingly realistic and interactive visual experiences, yet lack reliable mechanisms for maintaining persistent world state and enforcing programmable rules over extended interactions. We introduce Programmable World Model, a framework that decouples world‑state evolution from visual observation generation. An agent translates natural‑language instructions into executable programs that specify entity states and state‑transition rules, enabling direct control over individual entities and their interactions. A lightweight engine executes these programs to update and maintain an explicit, persistent global world state, including off‑screen entities and non‑visual attributes. To connect world state with visual generation, we introduce state‑augmented 3D oriented bounding boxes (OBBs) as an intermediate representation. This representation, together with the target camera trajectory, is deterministically compiled into pixel‑aligned spatiotemporal conditioning signals for a pretrained video model serving as the generative renderer. This design allows users to create playable games with predefined mechanics, direct control over individual entities, and persistent world state throughout gameplay. We further introduce CombatStateBench, a benchmark for evaluating programmable world models. On CombatStateBench, our method achieves 94% Count Accuracy and 98% State Accuracy, substantially outperforming existing interactive video world models while supporting coherent long‑horizon generation. These results demonstrate the effectiveness of separating explicit state evolution from generative rendering for building persistent, programmable worlds.
Authors:Phil Assheton
Abstract:
We present a simple decomposition of a neural‑network‑based normalizing flow that naturally uncovers a pivotal statistic (or something close) in the presence of nuisance parameters, based only on a sample generator from the distribution of interest. We show that the statistic is near‑pivotal in the sense of minimum average KL‑divergence of its p‑values versus uniform and we argue that it can be expected to have good power when the dimension of the statistic equals the dimension of the parameter. It is able to incorporate prior knowledge about group invariances such as translation and scale. It can discover the one‑sample t‑test almost exactly, outperforms the Welch test in terms of worst‑case size over a constrained variance‑ratio range and achieves good calibration on partial biserial correlations, while showing higher power (and being much faster) on small‑to‑moderate samples than profile likelihood‑ratio techniques.
Authors:Xiaoyu Li, Andi Han, Jiaojiao Jiang, Junbin Gao
Abstract:
Language generation in the limit asks for valid unseen elements from every exhaustive positive presentation of an unknown infinite language. We characterize this task for arbitrary families over a countable universe. Generation is possible exactly when each target can be assigned a finite positive witness so that the targets activated by any finite sample have an infinite common intersection. The necessary direction follows from a universal normalization: a search through unconfirmed histories converts any successful generator into one depending only on the observed set. We then ask how large compatible witnesses must be. Positive separation width records the smallest uniform size bound, with two further levels for unbounded finite witnesses and the absence of any compatible finite‑witness assignment. Every level occurs. Countable families admit singleton witnesses, explicit families realize every finite width, and a union of two families with infinite common cores requires unbounded finite witnesses. Finally, countable‑support and finite‑profile obstructions explain why local combinatorial data cannot determine generation in the limit. The characterization and full width hierarchy are checked in Lean, including the simplified normalization and a direct diagonal capture lemma. The accompanying Lean development is maintained at https://github.com/xiaoyulics/language‑generation‑characterization
Authors:Yanzhe Chen, Zechen Bai, Zhijun Cao, Wenzheng Zeng, Kevin Qinghong Lin, Yiqi Lin, Guoqiang Liang, Kevin Yuchen Ma, Qiming Huang, Mike Zheng Shou
Abstract:
Foundation vision‑language models (VLMs) exhibit broad intelligence about the world, yet translating this intelligence into robot control remains challenging. We present Show‑Harness, an Embodied Harness that enables VLMs to "play" robots through a compact semantic interface linking intent to action. Show‑Harness exposes discrete semantic action units that VLMs can naturally reason over, while embodiment‑specific interpreters deterministically ground them into local robot actions, keeping the VLM directly responsible for fine‑grained physical decisions. Through the same interface, Show‑Harness demonstrates the feasibility of (1) directly unlocking closed‑source frontier VLMs for zero‑shot robot control, and (2) adapting small‑scale open‑source VLMs for low‑cost deployment with just a few GPU‑hours of fine‑tuning. We further develop GUMI (GUI Manipulation Interface), which extends the same semantic action space to GUI‑based demonstration collection, allowing humans and agents to "play" robots across embodiments without specialized teleoperation hardware. Extensive experiments show that Show‑Harness‑equipped VLM agents generalize robustly across tasks, embodiments, and environments, outperforming representative agentic and VLA paradigms. These results suggest that the right interface can unlock substantial embodied capability from foundation VLMs, without requiring additional model capacity or costly embodiment‑specific pretraining.
Authors:Nisarga Nilavadi, Ralf Römer, Moritz Reuss, Michael Krawez, Tobias Jülg, Angela P. Schoellig, Rudolf Lioutikov, Wolfram Burgard
Abstract:
Action‑conditioned latent world models predict future visual representations, enabling zero‑shot goal‑conditioned robot planning and control. However, their predictions for fine‑grained spatial and rotational actions are unreliable for full 7‑DoF end‑effector control. To address this gap, we introduce DUET‑DINO, a simultaneous cross‑view latent world model that jointly learns action‑conditioned predictions from static side‑ and wrist‑camera observations through cross‑view conditioning. By exploiting complementary global scene and gripper‑centric information, DUET‑DINO enables latent planning over the full 7‑DoF action space. Across spatially diverse reach, orientation‑intensive angled‑reach, and multi‑goal grasp‑and‑lift tasks, DUET‑DINO consistently outperforms single‑view and independent dual‑view baselines, achieving 92% success on reach, 72.5% on angled‑reach, and 60.0% on lift tasks. DUET‑DINO is trained from scratch on DROID and RoboArena datasets and generalizes robustly under visual distribution shifts. We further show that while V‑JEPA 2 wrist‑view predictions underestimate visual dynamics induced by fine‑grained actions, DINOv3 predictions better capture action‑conditioned scene changes, leading to stronger downstream planning. The code and model checkpoints will be open‑sourced. Project page: https://utn‑air.github.io/DUET‑DINO
Authors:Simon Khan, Laurent Gajny, Jennyfer Lecompte, Sébastien Laporte
Abstract:
Recovering 3D human pose from monocular sports broadcasts remains challenging when players must be localized in a shared metric world coordinate system rather than only reconstructed relative to their own body. We introduce Field Converter, a geometry‑initialized temporal residual framework for world‑grounded 3D player pose estimation from calibrated soccer broadcasts. Our method first uses camera and pitch geometry to initialize the player root through ray‑ground intersection, then predicts a temporal residual correction from pose, image, camera, and geometric cues. On match‑disjoint evaluation sequences, residual refinement reduces root error from 49cm with geometry alone to 14cm with a frame‑wise MLP and 10cm with a TCN, while a Transformer achieves a comparable 11cm. The resulting world‑space MPJPE reaches 13.2cm, and ablations show that residual prediction clearly outperforms direct global‑root regression while temporal context matters more than the specific temporal backbone. Failure analysis further identifies airborne motion as the main limitation of the ground‑based geometric initialization.
Authors:Shih-Yu Lai, Wen-Fan Wang, Sai Ling, Shaune Jan, Bing-Yu Chen, Xiang Anthony Chen
Abstract:
Animation and VFX pre‑production review requires teams to translate loosely specified creative intent‑‑briefs, evolving specifications, heterogeneous references, and verbal decisions‑‑into revisions that junior artists can execute without repeated clarification. In practice, criteria drift across iterations, review judgments lose their evidential basis, and the reasoning behind a request rarely survives the senior‑junior handoff. We contribute a design framework for intent‑evidence‑action alignment: intent is articulated into a shared project record, judgments are anchored to grounded evidence, and authorized decisions are converted into clear revision tasks tied directly to reference notes. We instantiate this framework in MOONWALK, a professional pre‑production review system comprising a shared intent record, reference/specification anchoring, structured work‑in‑progress comparison, and supervisor‑authorized action planning. In this workflow, AI handles administrative coordination‑‑flagging missing context and organizing notes‑‑while artists retain full creative direction. An in‑studio study with professional practitioners compares MOONWALK with a chat‑only (chatbot) interface using matched production materials, while participants' existing workflows provide a retrospective ecological baseline. Results indicate stronger intent alignment, decision traceability, and checklist executability, while also showing that aesthetic authority and final prioritization must remain with practitioners. The evaluation establishes the value of the integrated structured workflow over unstructured conversational AI chatbot. Code: https://github.com/Akinesia112/Moonwalk/tree/english‑version
Authors:Pranav Poudel, Florence Dell'Aniello Picard, Nairouz Shehata, Frédéric Lavoie, Herve Lombaert
Abstract:
Sparse‑view X‑ray 3D reconstruction is essential for reducing radiation exposure, but recovering a density field from a handful of X‑ray projections is severely ill‑posed. Recently, 3D Gaussian Splatting has achieved state‑of‑the‑art performance in sparse‑view reconstruction by representing the volume using explicit, optimized primitives, but it requires dozens of projected views. With fewer views, reconstruction quality degrades severely since the explicit primitives are optimized freely without any anatomical information. Anatomical structures, in contrast, share similar geometry and density across a population. Their variations are bounded within a limited range that statistical shape models can capture. This paper proposes a shape‑guided Gaussian splatting framework for sparse‑view X‑ray 3D reconstructions. Our contribution lies in driving Gaussian positions toward anatomically valid configurations, alongside atlas‑based density regularization. Our method ensures anatomically consistent reconstruction and improves PSNR by 2.83 dB over a state‑of‑the‑art Gaussian splatting baseline with as few as 5 views. Code Available: https://github.com/polyshape‑lab/ShapeGuidedGaussian
Authors:Mahdi Naser Moghadasi, Faezeh Ghaderi
Abstract:
Time‑series foundation models are evaluated almost exclusively on public archives that predate them, so a strong score cannot be separated from having seen the test set during pretraining. The obvious remedy is a hold‑out that postdates the models. We build one: thirteen forecasters ‑‑ four classical, three trained per dataset, six pretrained ‑‑ on seven groups drawn from five domains, every observation published after the last model was released, and every dataset rebuildable without an API key. Under this protocol pretrained models win 5 of 7 groups, lose one to a Theta baseline, and on daily exchange rates are indistinguishable from a seasonal naive forecast, along with every other method tested. We then ask what separates the wins from the losses, and report a negative result: the two intrinsic properties one would reach for ‑‑ seasonal strength and spectral entropy, measured on the input window ‑‑ do not account for the pattern, and seasonal strength is if anything negatively associated with the advantage. What does track it is corpus familiarity. Our largest gain (28% lower MASE than the best classical method, on weekly Wikipedia pageviews) falls on Wikipedia pageviews, the domain TimesFM's authors describe as the bulk of its pretraining corpus, at the same granularities and differing only in time window. Within the pretrained family, where every model forecasts identical series so that series difficulty cancels, the TimesFM family outranks the Chronos family by ‑0.53 ranks on Wikipedia against ‑0.09 everywhere else (1,500 vs. 754 series, Mann‑Whitney p < 1e‑5). We conclude that a temporal hold‑out removes memorisation of a window but not familiarity with a domain, that benchmarks therefore need domain hold‑outs stated relative to disclosed corpora, and that the practitioner's question is less which model is better than whether their domain is one the model was raised on.
Authors:Killian Steunou, Yannis Tevissen, Mounîm A. El Yacoubi
Abstract:
Video understanding has rapidly evolved toward video large language models (VideoLLMs): systems that couple video representations with pretrained large language models and condition generation on a textual prompt. Their strong performance on captioning, question answering, retrieval and temporal grounding comes at a computation and memory cost that grows with frame count and context length, limiting deployment in real‑time, mobile and resource‑constrained settings. This survey covers inference‑efficiency mechanisms for visual and audiovisual VideoLLMs that report concrete reductions in parameter count, FLOPs per input, latency, memory, or visual and audio token count. We analyze bottlenecks across frame sampling, modality encoding, connector‑level token reduction, and LLM prefilling and decoding. We organize methods by the pipeline stage at which they act, covering VideoLLMs developed since late 2022 together with earlier frame‑sampling and vision‑encoder mechanisms that remain components of current pipelines. We assemble literature‑reported accuracy‑‑cost comparisons under shared host models and input protocols wherever available, distinguish them from heterogeneous cross‑paper evidence, and identify gaps in audiovisual efficiency and standardized evaluation. We maintain a repository at https://github.com/momentslab/awesome‑efficient‑videollm.
Authors:Harshita Gupta, Mayank Kabra, Rakesh Nadig, Nika Mansouri Ghiasi, Sahand Divsalar, F. Nisa Bostanci, Ataberk Olgun, Konstantinos Kanellopoulos, Jisung Park, Haiyu Mao, Abdullah Giray Yaglikci, Mohammad Sadrosadati, Onur Mutlu
Abstract:
Data‑intensive applications move large amounts of data from storage to the compute unit, incurring significant data movement overhead. Storage‑centric computing reduces this overhead by moving computation near or inside solid‑state drives (SSDs). Enabling it requires modifying SSD policies, e.g., address translation and garbage collection, which are part of the Flash Translation Layer (FTL), the SSD's firmware. Modifying the FTL is error‑prone. Because FTL logic has direct access to security‑critical device components, even a functionally correct FTL can leak data between tenants, drop integrity tags, or assign a flash block to the wrong tenant. We show that a faulty FTL can corrupt the device state at five surfaces inside the SSD, and demonstrate them on a DaisyPlus OpenSSD. Prior work verifies individual FTL designs, but has two limitations. (1) It establishes only functional correctness, so a modified FTL can violate isolation, integrity, and ownership and still pass verification. (2) It is tied to a single FTL design, so every modification requires redoing every proof. We propose CertiFlash, a formal verification framework for FTLs, mechanized in the Rocq proof assistant, that gives designers a machine‑checked proof of security and correctness. CertiFlash models an FTL as a deterministic state machine with a single global invariant over mapping, isolation, integrity, ownership, and allocation. We prove once, over a general FTL model, that (i) every FTL operation preserves the invariant and (ii) the model refines an idealized block device. For a new design, a designer discharges five hypotheses about its own operations instead of redoing either proof. Across four case studies, a designer adds 27 to 3,231 lines against a 16,489‑line framework, significantly reducing the verification effort. CertiFlash is open source.
Authors:Junnosuke Kamohara, Feiyang Wu, Andy Ningan Zong, Daniel I. Goldman, Yashwanth Nakka, Seth Hutchinson, Ye Zhao
Abstract:
Humanoid locomotion on granular terrain remains a significant challenge due to its complex foot‑terrain interaction dynamics that are difficult to model. Existing approaches either ignore granular contact dynamics or incorporate simplified normal force models with heuristic tangential components. In this work, we present a physics‑grounded granular contact model based on three‑dimensional resistive force theory (3D RFT) and efficiently simulate granular terrain for reinforcement learning (RL) training. Unlike traditional rigid contact models and simplified granular contact models with ad‑hoc heuristics, our contact solver produces physically accurate granular intrusion dynamics without resorting to heuristics. It captures realistic penetration and tangential drag during training, enabling the policy to learn behaviors that transfer reliably to real‑world granular terrain where rigid contact models fail. To adapt to varying terrain conditions, we train a terrain‑adaptive locomotion controller via teacher‑student RL, using a variational autoencoder to encode terrain information into a compact latent representation. Simulation studies using material point method (MPM) with NVIDIA Newton demonstrate that our method generalizes to unseen granular terrains, achieves a significantly higher success rate than baselines, and demonstrates zero‑shot terrain identification and adaptation. We further validate our approach through extensive hardware experiments across diverse real‑world granular terrains including basalt, dry sand, and beach sand. To the best of our knowledge, this is the first demonstration of agile humanoid locomotion on real‑world granular terrain. Project page: https://humanoid‑gm‑locomotion.github.io/HUMANOID‑GM/
Authors:Shun Ren, Kaijie Jin, Shengkai Hu, Beihang Song, Hang Sun, Wenwen Min, Youfa Liu, Jun Wan
Abstract:
Recent progress in deep learning has significantly advanced facial landmark detection. However, most existing methods process features in a spatial‑domain manner under a dataset‑specific training paradigm, which overlooks the fact that facial landmark detection is inherently geometry‑driven and sensitive to frequency variations, thereby limiting cross‑dataset generalization under complex scenarios and hindering the development of a facial landmark detection model. To address this issue, we propose FreqFLD, a frequency‑modulated framework towards All‑in‑One facial landmark detection. Specifically, FreqFLD introduces a Frequency Modulation Module (FreqMoM) to explicitly induce the frequency prior by decoupling and modulating low‑ and high‑frequency components, which is then injected into subsequent feature modeling to enable balanced modeling of global facial structure and local landmark details. Furthermore, FreqFLD employs a Frequency‑Modulated Mixture‑of‑Experts (FreqMoE), with expert selection adaptively conditioned on frequency‑modulated priors, enabling flexible modeling of heterogeneous facial landmark patterns under diverse and challenging scenarios. To regularize frequency‑consistent modeling under the All‑in‑One paradigm, we further introduce a Frequency‑Consistent Routing (FreqCR) loss, which constrains the routing and assignment of frequency‑aware experts to promote balanced expert utilization across diverse facial scenarios, thereby enabling stable expert specialization and achieving robust facial landmark detection. Extensive experiments demonstrate that the proposed FreqFLD achieves comparable performance on popular datasets. The code is available at: https://github.com/jkj1059657014/FreqFLD.
Authors:Yuchen Pei, Xiaoyu Hu, Yixiong Zou, Dingwen Hu, Hui Chu, Yutao Ma, Shijun Qiu, Gang Li
Abstract:
Multi‑modal medical image segmentation leverages complementary diagnostic information, yet fusion can underperform single‑modality baselines when spatially aligned inputs differ in quality. Here, "corruption" primarily denotes resolution‑induced degradation rather than misalignment or complete modality absence, while synthetic noise is evaluated only as an auxiliary setting. We identify a critical optimization‑inference inconsistency: degraded modalities can receive weak training updates yet substantially affect predictions, indicating active interference with fusion. We attribute this failure to resampling‑induced feature corruption and optimization bias, where noisy features propagate through skip connections and encourage unreliable modality selection. We therefore propose CoReFuse‑Med, a Corruption‑aware Rebalanced Fusion framework that suppresses corruption during feature transmission and rebalances modality contributions during high‑level fusion. Experiments on EPVS, BraTS, and WMH, including multiple Z‑axis slice‑retention ratios and an auxiliary noise test, demonstrate improved accuracy and robustness under modality‑quality discrepancies. Our code is available at https://github.com/lrever/CoReFuse.
Authors:Rui Liu, Tao Zhe, Yanyong Huang, Sankha Narayan Guria, Xiao Luo, Wei Fan, Yanjie Fu, Dongjie Wang
Abstract:
Feature transformation improves predictive performance on tabular data by constructing informative abstractions from raw features. Recent generative approaches encode transformation knowledge into continuous embedding spaces for efficient exploration of candidate strategies, but face three key limitations: (1) overlooking hierarchical relationships between low‑level features, operations, and high‑level abstractions; (2) enforcing order‑sensitive embeddings on inherently permutation‑invariant transformation sequences, thereby introducing systematic bias; and (3) relying on gradient‑based search, which is ill‑suited to non‑convex transformation spaces. We propose a framework with two complementary components. First, a permutation‑invariant hierarchical module captures interactions across features, operations, and abstraction levels, with a self‑attention pooling mechanism that maps semantically equivalent structures to consistent embeddings aligned with downstream performance. Second, a policy‑guided multi‑objective reinforcement learning strategy initializes the search from empirically strong seeds and jointly optimizes predictive accuracy and transformation efficiency. Extensive experiments on diverse tabular benchmarks demonstrate the effectiveness and robustness of our framework against strong baselines. Our code and data are publicly available at: https://github.com/RayLiu1103/PHER.
Authors:Seuffo Akouan ha Ngoune, Alessandro Toschi, Paolo Burgio, Marko Bertogna
Abstract:
Accurate estimation of lateral vehicle dynamics near the adhesion limit is important for stability control and high‑performance driving, but lateral velocity is rarely measured directly because sensors such as optical sensors are costly. This paper presents an inertial measurement unit (IMU)‑centric Moving Horizon Estimation framework that reconstructs lateral velocity using standard onboard signals, without relying on exteroceptive odometry or detailed tire‑parameter tuning. Experimental validation on human‑driven sports cars and an autonomous open‑wheel race car across tracks, maneuvers, and conditions demonstrates accurate and robust lateral velocity and lateral acceleration estimates. The proposed framework is available at https://github.com/Aseuffo/IMU‑Centric‑MHE
Authors:Luyao Tang, Jiewei Zheng, Kunze Huang, Chaoqi Chen, Yue Huang, Cheng Chen
Abstract:
Generalized Category Discovery (GCD) assigns unlabeled instances, mixed with labeled data, to known or novel categories, requiring human‑like compositional reasoning: reusing primitives learned from known classes and deciding when new combinations imply new categories. Existing GCD methods operate on unstructured token features and struggle to extrapolate to novel compositions. We propose CoGe‑GCD, which rethinks GCD through compositional generalization with two coupled stages. (i) Compositional Perception structures patch tokens by mapping them to a small vocabulary of primitives and refining token embeddings via competitive token‑primitive assignment and information passing, yielding coherent groups for discovery. (ii) Generalizing Induction exploits the induced geometric structure and applies a structure‑preserving calibration over spatial relations, maintaining probabilistic semantics while improving extrapolation to unseen primitive combinations. CoGe‑GCD is implemented as an inductive‑bias module between backbone and projection head, without modifying heads or losses, and can be plugged into diverse GCD frameworks. On standard benchmarks, it consistently improves all‑class accuracy, unknown‑class number estimation, and geometric quality, with marginal computational overhead. Code is available at https://github.com/lytang63/CoGe‑GCD.
Authors:Liuao Pei, Tianyue Wu, Hui Zhang, Ping Luo, Jie Song
Abstract:
A hallmark of human dexterity is the cooperative use of fingers, where different fingers take on distinct yet coordinated roles to accomplish fine manipu‑ lation, such as capping a pen with the hand that holds it. We study this finger‑level coordination through in‑hand assembly: mating two rigid objects within a single dexterous hand, with no second arm and no fixture. We present a reinforcement learning formulation to solve this problem in a unified framework, which is driven by a goal relative pose between the two parts. Finger coordination is shaped by a function‑based auxiliary reward and regularized toward a single human reference pose, while domain randomization and a fusion of historical proprioception and object observation confer robustness to occlusion‑induced estimation noise. The same recipe solves three different assembly tasks (Bottle, Syringe, and Marker). Trained purely in simulation, the policies transfer zero‑shot to hardware with a single camera, demonstrating robustness to state‑estimation errors caused by oc‑ clusion. Our experiments also reveal that in‑hand assembly places demands on hand morphology and can serve as a benchmark for modern robotic hand systems. Videos and code are available at https://ltbgbird.github.io/in‑hand‑assembly‑page/.
Authors:Michael Wehrli, Leo Widmer, Edwin Li, Noel Fiechter, Lorenzo Pettinari, Sidaty El Hadramy, Carol C. Hasler, Philippe C. Cattin
Abstract:
Trochlear dysplasia (TD) is an abnormality of the femoral trochlea associated with anterior knee pain and patellar instability. The sulcus angle (SA) is used to assess trochlear morphology, but it is typically measured on a single axial MR slice with no clear guidance on which to select, making it sensitive to slice selection and landmark placement. We propose an automatic framework for continuous SA profiling from super‑resolved MR volumes. Clinically acquired axial, coronal, and sagittal MR scans are combined using implicit neural representations to reconstruct a high‑resolution volume. SA measurements are computed across the trochlear region using two landmark detection U‑Net models. The approach was evaluated on the public fastMRI dataset and a small in‑house cohort of patients with TD. Compared with conventional manual single‑slice SA measurements, the proposed automated method yielded a mean absolute error of 11.6^\circ while providing continuous characterization of trochlear morphology. Population‑level analysis demonstrated distinct mean SA profiles between the public cohort and the in‑house TD cohort, highlighting the potential of profile‑based assessment to characterize TD. By reducing reliance on a single manually selected axial slice, the proposed framework extends conventional SA assessment to a continuous profile‑based description of trochlear morphology without additional imaging, while remaining conceptually linked to current clinical assessment. Further validation is required. The code is available: https://github.com/wehrlimi/SA_Profile.
Authors:Xinrui Xu, Xueer Wang, Dan Luo, Sisi Yuan, Xuan Lin
Abstract:
Molecule generation has emerged as a powerful computational tool for de novo drug design, enabling the exploration of chemical space beyond the limits of conventional virtual screening. The field has progressed rapidly, driven by advances in molecular representations, generative architectures, and target‑aware modeling strategies. However, existing reviews typically address specific model families or application scenarios in isolation, rather than offering an integrated perspective on how these components collectively form a coherent generation workflow. In this review, we present a comprehensive evaluation of molecule generation models for de novo drug design, covering 82 methods across five deep generative frameworks, including recurrent neural network (RNN)‑ and Transformer‑based models, variational autoencoders (VAEs), generative adversarial networks (GANs), flow‑based models, and diffusion models. We first summarize widely used benchmarks and molecular representations, and then examine the methodological principles underlying both general and pocket‑conditioned generation. A central contribution of this work is a systematic synthesis and comparative analysis of reported performance across commonly used benchmarks and evaluation metrics. We also summarize representative experimentally validated case studies. Looking ahead, we discuss future directions in standardized 3D data, interaction‑aware generation, receptor flexibility, and multi‑objective molecular design, with the aim of improving the reliability and experimental relevance of molecule generation. All collected benchmark resources, evaluation metrics, and model references are provided in a publicly accessible repository at https://github.com/JacklinGroup/molecule‑generation‑review.
Authors:Jie Song, Zhichuan Xu, Ziyu Lu, Meng Xiao, Cheng Bi, Yuxin Zhang, Xin Zheng, Xiaoran Li, Qiongfang Cao, Hao Yang, Bairong Shen
Abstract:
Biomedical ontology normalization maps free‑text expressions to standardized concepts, enabling consistent integration and analysis of biomedical data. This task remains challenging because lexical variation and subtle distinctions among hierarchically related concepts can obscure concept boundaries. We present OntologyAligner, a three‑stage framework that combines ontology‑aligned retrieval, large language model candidate reranking, and selective hierarchy‑guided refinement. We also construct PhenoNormBench, a unified benchmark comprising 13,390 samples from seven Human Phenotype Ontology datasets. OntologyAligner achieved state‑of‑the‑art performance on HPO normalization, with 88.78% Macro Top‑1 Accuracy and 86.75% Micro Top‑1 Accuracy, exceeding the strongest baseline by 4.85 and 5.07 percentage points, respectively. Ablation analyses showed complementary contributions from all three stages, and sensitivity analyses demonstrated stability across candidate‑set sizes and model backbones. Applications to MONDO, MEDIC, and NCBITaxon further established portability to other ontologies. OntologyAligner offers a generalizable framework for accurate mapping of biomedical text to structured ontology concepts. PhenoNormBench and the code are publicly available at https://github.com/zhelishisongjie/OntologyAligner.
Authors:Nathan Roll, Irene Yi, Büşra Marşan, Vianney Grenez, Gabriel Stein, Momcilo Mrkaic, Pavle Padjin, Vladimir Zeljkovic, Calbert Graham
Abstract:
Orukeet replaces half of an adapted Parakeet encoder's temporal filters with 12,288 fitted Gabor kernels, freezes these replacements, and trains the remaining parameters on multilingual and multi‑accent data. Final adaptation and checkpoint selection use LibriSpeech test‑other. Across 20,146 FLEURS recordings in 25 languages, pooled word error rate (WER) falls from Parakeet's 11.01% to Orukeet's 9.85%, a 10.6% relative reduction. Orukeet has lower WER on 23 of the 25 languages. Orukeet outperforms Parakeet on 61 out of 74 tested splits, including LibriSpeech test‑clean (1.46% vs. 1.53% WER), test‑other (2.86% vs. 3.14%), and FLEURS English (3.82% vs. 4.28%). All comparisons decode the same audio with matched NeMo settings. The fitted kernels are stored as ordinary convolution weights, retaining Parakeet's architecture and inference operators.
Authors:Tianyue Wu, Boyuan An, Shuqi Zhao, Heyu Guo, Wanli Xing, Yi Ma, Kaifeng Zhang, Ruihai Wu, Masayoshi Tomizuka
Abstract:
Generated hand‑object interaction (HOI) videos provide a controllable way to propose manipulation motions. Simulation‑based HOI tracking can translate such kinematic references into feasible low‑level control, but its scalability is limited by the lack of reliable reference motions. We therefore combine generated videos with simulation‑based HOI grounding: during training, generated videos provide diverse motion references for learning a multi‑object, multi‑trajectory HOI tracker, and at deployment, the video model produces motion plans that are executed by the learned tracker. In particular, we propose a method that enables scalable reference generation by HOI reconstruction with minimal manual intervention and successfully grounds more than 1,500 generated videos in simulation, achieving success rates over 25 percentage points higher than those of baselines during simulation‑based training. In real‑world closed‑loop experiments, it achieves diverse grasps, including functional grasps, non‑prehensile manipulation, and post‑grasp object‑pose tracking. Videos and code are available at https://boyuan‑an.github.io/GALATEA/.
Authors:Sudaksh Kalra, Dolly Sapra
Abstract:
EdgeAI systems are increasingly employing computer vision applications to enable intelligent, on‑device decision‑making in real‑time. However, these deployments face highly dynamic operational conditions, with fluctuating constraints on latency, power availability, and memory resources. Deep Neural Networks (DNN), which follow fixed computational execution flows, lack the flexibility to adapt to such variability, resulting in inefficient and suboptimal performance in edge scenarios. This underscores the need for architectures that are not only efficient but also dynamically scalable at runtime. In this paper, we propose Elastoformer: A framework that transforms conventional neural networks (NN) into Elastic NN capable of real‑time elastic inference. Unlike the conventional bag‑of‑models approach, which requires maintaining multiple independent models for different operating conditions, Elastoformer offers a single, modular solution that dynamically switches between multiple modes of operation at runtime, adapting efficiently to the changing computational budgets of edge devices without the overhead of managing separate models. Experiments reveal that our framework achieves up to 85% reduction in computation FLOPs, 50% reduction in latency and 76% reduction in memory overhead, while showcasing the architecture agnostic nature of the framework across both Vision Transformers and CNNs. Our code is available at https://github.com/sudaksh14/Elastoformer.
Authors:Remco Hendriks
Abstract:
We introduce MetroLLM‑Bench, a 955‑case benchmark for testing language models as the policy layer of a transit kiosk. It covers six real metro systems, ranging from 37 to 414 stations, and eleven categories that include routing, fare calculation, disruptions, accessibility, and adversarial input. In each case, the model must call structured tools and submit a machine‑renderable terminal state containing an outcome, a per‑ticket fare quote when applicable, and a kiosk action. Fourteen deterministic scoring components form Tier 1; eight semantic‑quality components form Tier 2, six of which use a language‑model judge. We report Tier 1 and the combined score of both tiers. A stratified 75/25 split reserves 717 cases for training‑data generation and 238 for held‑out evaluation. We evaluate twenty‑six models from six vendors, of which twenty‑three are ranked. On the held‑out partition, a 4B Qwen 3.5 student trained through parameter‑efficient fine‑tuning (PEFT) exceeds both GPT‑5.6 tiers on Tier 1 (91.3 against 90.6 and 90.0) and matches GPT‑5.4 full at maximum reasoning effort (91.4), with a 2.6 GB Q4_K_M footprint. Larger 9B and 27B students provide no further Tier 1 improvement over the 4B student at this training scale. Across the four Qwen sizes, the PEFT gain over the corresponding base model decreases from +7.03 points at 2B (three training seeds) to ‑0.91 at 27B; every seed shows the same direction at every size. A deterministic rule‑based baseline reaches 84.6 on Tier 1, with the remaining language‑model advantage concentrated in policy adaptation, compound scenarios, accessibility, and temporal reasoning. Muse Glimmer 30B leads the composite ranking, and serving configuration alone moves the Qwen 3.5‑to‑3.8 comparison by 2.7 Tier 1 points. The benchmark, harness, reproduction guide, and fine‑tuned students are released at https://github.com/continker/metrollm‑bench.
Authors:Dmitry Demidov, Muhammad Zaigham Zaheer, Omkar Thawakar, Abdelrahman Mohamed Shaker, Rao Anwer
Abstract:
Composed video retrieval (CoVR) searches a gallery for the target video that realizes a natural‑language modification of a source clip. However, at gallery scale, this creates a fundamental tension: compact embeddings enable efficient, reusable search but can miss the transient actions, state changes, and subtle constraints that demand fine‑grained video reasoning, whereas applying large multimodal models uniformly sacrifices scalability. To address these limitations, we propose that frozen foundation models should instead occupy complementary roles, with inference depth adapted to query difficulty. Based on this premise, we introduce \methodname, a framework for training‑free \methodexpansion. Specifically, a composed‑query embedding first searches reusable video‑only gallery representations; uncertain queries undergo bounded reranking and candidate expansion; ambiguous edits trigger target‑description generation; and only close leading candidates reach multimodal verification. To support these roles, frame selection, spatial resolution, and time cues are adapted to each stage. Across complete target‑gallery evaluations, our method reaches state‑of‑the‑art performance among training‑free approaches, with 89.55 and 93.43 R@1 on Dense‑WebVid‑CoVR and CoVR‑R, respectively (with more than +35% and +25% absolute margins to the closest counterpart). These results show that adaptively orchestrating foundation‑model capabilities can combine scalable retrieval with fine‑grained reasoning without task‑specific training. The source code and all relevant guidelines are available on https://github.com/demidovd98/CoVRAGE.
Authors:Yunxiang Mo, Donghao Zhao, Hejia Geng
Abstract:
A natural way to cut reasoning‑model inference cost is to repeatedly probe a single partial trajectory for its current answer and stop once probes agree ‑‑ self‑consensus. We ask whether any such rule is both safe and token‑saving, and whether one can be selected once and reused. A preregistered sweep of 3,520 consensus rules, replayed on frozen trajectories from two models and three benchmarks, clears none of three acceptance gates fixed in advance; the frontier reproduces on a held‑out split and on two unseen models ‑‑ while a boundary‑confidence control (DEER) swept through the same pipeline clears all three. The reason lies in the signal: agreement establishes that the current answer persists under a fixed probing procedure, not that the reasoning has terminated ‑‑ a consensus‑termination gap. Stopping on it commits non‑terminal answers. At a rule still saving 32% of the tokens, one stop in nine fires on an answer the trajectory itself later abandons, and most of those stops cut off a correction it would otherwise have made. Widening the agreement window does not remove them: the share levels off near 7%, and by then the saving has fallen to 8%. Probe re‑wording and a hand‑labelled error taxonomy show the agreed answer is often a placeholder the model had not settled on. Used on its own as the stop signal, agreement fails not because it is insufficiently strict, but because it repeatedly measures the wrong object.
Authors:Ibrohimjon Muminov, Jihie Kim
Abstract:
Real‑world detectors must often interpret functional or ambiguous prompts, yet conventional models such as YOLO remain restricted to fixed class lists. Even open‑vocabulary models like YOLO‑World frequently misalign vague language with the intended objects. Building on our prior work Commonsense‑Guided Open‑World Object Detection Using LLMs and Visual‑Semantic Matching, we address YOLO‑World's limitations in grounding task‑driven queries. We propose Vague2Detect, a hybrid pipeline in which a fine‑tuned Sentence‑BERT retrieves candidates from a structured household Knowledge Base (KB), and YOLO‑World verifies their presence in the image. For prompts outside the KB, a large language model (GPT‑3.5‑turbo) generates candidate descriptions, dynamically expanding the KB to cover novel concepts. On a benchmark of household scenes using custom images and an Open Images V7 subset, YOLO‑World alone achieves only 32% Vague Prompt Success Rate (VPSR), the ability to map ambiguous queries to correct detections. In contrast, Vague2Detect improves performance to 61% VPSR with high precision, and up to 85% when augmented with GPT fallback.
Authors:Lokesh Krishna, Sarvesh Venkatesan, An Zhang, Quan Nguyen
Abstract:
Motion tracking provides a scalable recipe for humanoid whole‑body control. By design, the resulting trackers lack exteroceptive feedback hence reacting to the environment remains the responsibility of a higher‑level planner. Existing perceptive controllers train geometry‑only encoders from scratch, trading semantics for sim‑to‑real ease, and typically rely on teacher‑student distillation for a task of interest. We present ViBe, a post‑training framework for adapting motion trackers to perceptive control tasks. We leverage pre‑trained visual encoders with a multi‑query extractor module to learn task‑relevant perceptive feedback. This feedback is grafted onto the tracker's input via low‑rank adapters, enabling parameter‑efficient fine‑tuning. Given a task reward and a reference dataset, this modular controller can be adapted directly via policy optimization. Across four tasks, ViBe shows zero‑shot sim‑to‑real transfer spanning perceptive walking on curbs and parkour, Repose Cube, omni‑object loco‑manipulation, and dodgeball, with visually robust performance across outdoor, low‑light, and RGB distractor conditions. Finally, we solve a goal‑oriented Repose Cube task with a deliberately simple planner, demonstrating the efficacy of perceptive controllers, adapted by our approach.
Authors:Yifan Yuan, Xiangyu Liu, Hongming Shan, Yu Han, Yu Jiang, Hao Tan, Junping Zhang, Linlin Shen
Abstract:
Although text‑to‑image diffusion models generally exhibit strong prompt‑following ability, we identify a persistent and previously underexplored failure pattern in which a small subset of prompts differing only in the object consistently fails to realize the same target concept under identical generation settings. We term this phenomenon object‑dependent concept brittleness. Such cases suggest systematic internal blind spots rather than random sampling noise. In this paper, we present an interpretability‑oriented framework to audit and minimally correct these failures. Our key idea is to analyze denoising trajectories in a step‑wise sparse autoencoder (SAE) space, where abstract style and attribute concepts become more separable than in the raw denoising representation. This sparse space enables us to compare successful and failed generations, identify concept dimensions whose evidence is missing, weakened, or temporally delayed, and construct class‑level concept prototypes from reliable class‑consistent samples. Based on this audit process, we introduce a lightweight inference‑time correction strategy that interpolates denoising features toward the corresponding prototype in SAE space. Rather than serving as a task‑specific retraining method, this intervention acts as a validation of the diagnosed concept deficiency. We evaluate the proposed framework on style and attribute failure cases across multiple diffusion backbones, with significant improvements in concept consistency, text fidelity, and repair success. Further analyses show that deeper denoising representations provide clearer concept structure, while early‑stage intervention offers the strongest correction leverage. Code is available at https://github.com/Metecade/Object‑Dependent‑Concept‑Brittleness.
Authors:Olli Tuomi
Abstract:
Reading a transformer's internal states in token space is easy to do and hard to trust: a logit lens on a single hidden state is dominated, at intermediate layers, by the generic tokens the model would predict for almost any input. We read the difference instead. Subtracting two closely matched prompts' hidden states and projecting through the unembedding cancels the shared component and surfaces what separates them, an operation equivalent to reading a RepE/ActAdd steering vector through a logit lens. Built into a training‑free tracer that reads at every position, sub‑layer, and head and averages over designed baselines, it traces a compound‑ noun MLP‑>attention chain in Phi‑2, confirmed there by activation patching, with the same distinction recovered across three architectures by readout and probe rather than by patching; it reads what retrieval surfaces for real versus fictional entities, and reads metaphor as a set of domain‑to‑domain mappings rather than a single figurativity feature. A cross‑seed control marks the boundary: across five networks differing only in initialization, the same distinction surfaces as almost entirely different tokens (top‑10 overlap 0.08). What a computation looks like in token space is network‑specific; the distinction it draws is not
Authors:Yuansheng Liu, Yufei Ye, Tao Tang, Jiawei Luo, Wen Tao, Xiao Luo
Abstract:
Proteolysis‑targeting chimeras (PROTACs) have emerged as a transformative therapeutic strategy that selectively degrades historically ''undruggable'' targets via the ubiquitin‑proteasome system. Despite growing efforts to develop computational predictors of PROTAC degradation activity, existing supervised approaches remain severely challenged by data scarcity and imbalance across E3 ligases, limiting their ability to generalize beyond well‑studied ligase contexts. In practice, labeled data are heavily concentrated on a few ligases (e.g., CRBN and VHL), while the majority of E3 ligases remain underexplored yet are critical for expanding the design space of targeted degraders. Developing methods that enable robust cross‑ligase generalization with minimal labeled data is therefore essential for improving the practical utility of computational PROTAC discovery. We reformulate PROTAC degradation activity prediction across E3 ligases as a few‑shot meta‑learning problem and present ProMeta, a prototype‑based graph neural network trained through episodic meta‑learning on source‑E3 tasks and evaluated on held‑out target‑E3 tasks through support‑conditioned inference. ProMeta performs inference without updating the encoder by dynamically estimating class prototypes from minimal target‑ligase support samples. On the CRBN‑to‑VHL benchmark, ProMeta achieves AUROC values of 0.796 under K=2, Q=3 and 0.883 under K=2, Q=5, improving by 19.9% and 6.8%, respectively, over the corresponding supervised GNN baseline. Reverse VHL‑to‑CRBN transfer under the same protocol yielded AUROC values of 0.702 (K=2, Q=3) and 0.821 (K=2, Q=5), confirming bidirectional applicability while revealing direction and data‑regime dependence. Together, these results support ProMeta as a practical framework for cross‑ligase few‑shot prediction under the evaluated support/query protocols.
Authors:Cho-Ying Wu
Abstract:
LLMs have been used to simulate human decision‑making in professional settings, yet their behaviors in common‑law jury trials remain unexplored. We study when and how a defendant's courtroom statement affects LLM‑simulated jurors, focusing on persuasion, ideological bias, and background‑based affinity. To support the analysis, we introduce JuryBench, a benchmark containing controversial criminal cases in U.S. criminal law. In each case, a defendant can claim various plausible justifications to support acquittal or reduced liability. We fix the base case and design defendants of different backgrounds, who give courtroom statements with varying emotional appeal or rebuttal. Jurors with diverse ideological profiles across the spectrum are simulated. We examine 20 frontier LLMs, resulting in a total of 432K decisions and rationales, and quantify changes in verdict severity. Our findings show that LLM‑jury simulation echoes many human‑jury findings. First, emotional persuasion can be detrimental, since jurors may perceive it as evidence of guilt or inconsistency. Next, we show that background fit between jurors and defendants is a stronger and significant factor than other isolated factors, and that jurors are in general harsher toward opposite‑background defendants and lenient toward same‑background ones. Finally, we find that juror ideology also strongly shapes severity judgments. These findings highlight both the promise and risks of using LLMs to model jury reasoning and call for careful evaluation. The data and code are available at https://github.com/choyingw/JuryBench
Authors:Jianzhi Shen, Keyu Mao, Minghao Shao, Chuanyang Jin, Yusong Wang, Ailiang Lin, Kotaro Funakoshi, Manabu Okumura, Tianmin Shu, Muhammad Shafique
Abstract:
Personalized language models aim to adapt responses to individual users, whose preferences are often latent and revealed gradually through interaction. Existing training‑free methods rely on stored histories or retrieved memories, but they often struggle to reconcile long‑ term preferences with short‑term topic‑specific needs. To address this issue, we propose HyperTrace, a training‑free framework that formulates online personalization as latent preference tracing. HyperTrace maintains interpretable natural‑language hypotheses over short‑term intent and long‑term preferences, and updates them through an SMC‑style reweight process using an LLM‑based surrogate choice model. By updating these hypotheses across turns and sessions, HyperTrace enables personalization without parameter updates. Experiments on PRISM and PersonaMem‑v2 show that HyperTrace improves response alignment, preference prediction, and profile consistency over strong online baselines, demonstrating the effectiveness of tracing latent user preferences for robust personalization. Code and scripts are available in the repository: https://github.com/jiseshen/HyperTrace.
Authors:Ikjun Choi, Geonho Leem, Jungdam Won
Abstract:
Physics‑based character control is a long‑standing challenge in computer graphics and robotics, requiring policies that satisfy complex dynamics while producing realistic motion. Recent Deep RL approaches, particularly imitation learning methods such as DeepMimic, have had broad impact beyond animation, influencing robotics by enabling agile and expressive behaviors. While these approaches achieve impressive results, they remain computationally inefficient to train in practice. Despite GPU‑accelerated simulation, we find that end‑to‑end pipelines often underutilize hardware due to overheads outside the physics solver, caused by fragmented GPU kernels and CPU memory access in the critical path. We present InstantMimic, a system that addresses these inefficiencies by making the entire training loop GPU‑native. Built on a GPU‑native physics backend, our unified pipeline integrates simulation, environment computation, policy inference, and policy updates within a single execution flow. As a result, InstantMimic reduces training time for diverse physics‑based skills to a few seconds and makes LLM‑agent‑driven hyperparameter search practical.
Authors:Liwen Wang, Xingbo Dong, Iman Yi Liao, Deyin Liu, Massimo Tistarelli, Lin Yuanbo Wu, Zhe Jin
Abstract:
Test‑Time Adaptation (TTA) enhances the robustness of models against distribution shifts but faces two critical challenges: error accumulation from noisy pseudo‑labels and catastrophic forgetting of source knowledge. Uncertainty‑based approaches designed to mitigate error accumulation often yield overconfident or computationally expensive estimates, while strategies intended to prevent forgetting via prototype replay rely on static representations that easily become misaligned as the model adapts. To address these issues, this paper proposes a novel framework, Distilling Image Prototype for Guided Test‑Time Adaptation (DIPTTA). The core of the proposed approach is the introduction of a Distill Image Prototype (DIP), a compact set of synthetic images that serves as a dynamic and regenerative anchor of source knowledge. This prototype enables a dynamic feature replay mechanism that continuously generates feature prototypes aligned with the current state of the model, thus effectively preventing catastrophic forgetting. Furthermore, the DIP anchors a source‑calibrated uncertainty estimation method, which provides a less biased measure of sample reliability by leveraging stable source knowledge, thereby robustly suppressing error accumulation. Extensive experiments on multiple benchmarks demonstrate that DIPTTA significantly outperforms state‑of‑the‑art methods, particularly under severe domain shifts. The source code is available at https://github.com/LiwenWang919/DIPTTA.
Authors:Muchen Li, Anglin Liu, Xuetian Gao, Ruijian Xu, Jintai Chen
Abstract:
Source‑level analysis of interictal epileptiform discharges (IEDs) is relevant to presurgical evaluation and treatment planning because it helps characterize where epileptiform activity is likely to arise. Beyond detecting whether an IED is present, this setting requires assigning IED‑positive activity to clinically meaningful brain‑region categories. This setting is challenging because source‑region evidence in short electroencephalography (EEG) windows can be subtle, partial, and affected by subject variability, class imbalance, and imperfect multimodal context. We present EEGBind, an EEG‑centric multimodal binding framework for five‑class source‑level IED classification. EEGBind treats EEG as the primary modality and binds synchronized video‑context features around an EEG‑centric representation. Instead of relying on early or overly strong multimodal fusion, which may perturb the source‑sensitive EEG representation, EEGBind uses video context as auxiliary evidence for robust classification. A view‑consistent repair stage is further used to improve hidden‑set robustness while preserving the learned source‑class boundary. On the NeuroMM 2026 Grand Challenge Track 3 NMM‑Source‑IED benchmark, EEGBind achieves 0.8395 on weighted‑F1 and outperforms strong competitors. These results support EEG‑centric multimodal binding as a practical strategy for source‑level IED classification. The open‑source code is available at https://github.com/HKUSTGZ‑ML4Health‑Lab/NeuroMM2026_IED_Detection.
Authors:Kang-wook Kim, Jinyoung Park, Jinsoo Kim, Sehun Lee, Sang Hoon Woo, Gunhee Kim
Abstract:
Text‑aligned speech tokenization methods have emerged to better align speech tokens with LLM token spaces, enabling more effective utilization of pretrained LLMs. However, they rely on offline automatic speech recognition (ASR), leading to two key limitations: (i) the need for complete utterances before tokenization, precluding real‑time streaming, and (ii) vocabulary mismatch between ASR and LLMs, which reduces acoustic granularity from the subword to the word level. We introduce StreamAlign, a text‑aligned speech tokenization framework that enables streaming tokenization for real‑time speech‑text joint modeling. StreamAlign performs online speech‑text alignment by combining character‑level RNN‑Transducer alignment with word‑level ASR guidance, mitigating ASR‑LLM vocabulary mismatch while preserving recognition accuracy. A proactive word boundary classifier anticipates word completion at chunk boundaries, reducing tokenization latency from 560 ms to 270 ms. On LibriSpeech, StreamAlign achieves the lowest WER and highest UTMOS among evaluated tokenizers. Furthermore, StreamAlign‑SLM, a spoken language model trained on StreamAlign units, outperforms other end‑to‑end spoken language models in speech continuation while achieving the strongest overall consistency on SALMon and spoken StoryCloze.
Authors:Yaning Jia, Chunhui Zhang, Wenxuan Xu, Xingjian Diao, Xiaoyuan Wang, Soroush Vosoughi
Abstract:
Supervised fine‑tuning (SFT) applies a uniform cross‑entropy loss to all target tokens, even though different tokens provide unequal learning signals for mathematical reasoning. This uniform treatment can over‑sharpen already mastered tokens while amplifying learning pressure on uncertain, low‑confidence tokens, leading to suboptimal training dynamics. We propose Trimmed Logit‑Gap SFT (TrimSFT), a simple token‑level reweighting method that scales the SFT loss according to the logit gap between the gold token and its strongest competitor. TrimSFT trims supervision away from both extremes: tokens already mastered (large logit gap) and tokens weakly supported by the current model (small or negative logit gap), concentrating learning within an intermediate logit‑gap region between them. We instantiate this principle with a Gaussian weight centered at margin m with bandwidth τ, requiring no reference model or additional forward pass. We evaluate TrimSFT on six base models from the Llama, Qwen, and DeepMath families across five mathematical reasoning benchmarks. TrimSFT consistently improves over standard SFT, achieving the best average performance on five out of six models, with gains of up to +26.9 points over SFT on MATH500. Further analyses show that the bandwidth τ matters more than the exact margin location, and that half‑trim variants that remove supervision pressure from only one side yield inferior trade‑offs. A token‑level logit‑gap distribution analysis suggests that TrimSFT reshapes model confidence in a more balanced way than uniform SFT or monotonic reweighting methods. These results suggest that reasoning SFT can benefit from trimming both extremes rather than treating all tokens uniformly.
Authors:Shuoyi Chen, Yuejia Li, Mang Ye
Abstract:
Generalizable animal Re‑Identification (ReID) aims to recognize individual animals across species with diverse morphologies and ecological contexts. Unlike person ReID, where different domains share similar body structures, animal species often exhibit drastically different anatomical structures and visual patterns, making it difficult to establish shared visual correspondences. As a result, representations learned across species tend to form fragmented embedding spaces, which severely limits cross‑species generalization. To address this challenge, we propose Semantic Consistency Learning (SCL), a framework designed to learn representations that remain stable across appearance variations while preserving semantic structures shared across species. SCL consists of two complementary components. Foreground‑Background Decoupled Spectral Normalization (FDSNorm) stabilizes feature statistics by suppressing environment‑induced style variations in a region‑aware manner, while Cross‑species Neighborhood Modeling (CNM) captures transferable relational structures across species through dynamic feature neighborhoods. Extensive experiments on 11 public animal ReID datasets demonstrate that SCL consistently outperforms state‑of‑the‑art methods under multiple cross‑species evaluation protocols and generalizes effectively to previously unseen species and ecological domains. Code is available at https://github.com/Kemalau/ECCV‑26‑SCL.
Authors:Tian Zhang, Meng Li
Abstract:
Large language models are increasingly used as relevance judges, yet their labels can shift with prompt surface form. We study one such feature ‑‑ tone ‑‑ on 3,498 TREC DL19/DL20 query‑passage pairs, across eight judge models, five classifier‑calibrated politeness levels, and three paraphrases per level. Effects are strongly model‑dependent: one judge shows a structured U‑shaped response, whereas most show only small changes. Where tone changes agreement, the results are more consistent with a shift in the judge's severity operating point ‑‑ its overall scoring leniency ‑‑ than with improved judgment. Agreement rises or falls as this shift moves the judge toward or away from human annotators' strictness. A query‑disjoint cross‑fit retains the expected association (Spearman ρ= ‑0.683; exact model‑block permutation p = 0.019). Tone affects calibration‑based agreement more than ranking outcomes: across 32 model‑tone contrasts, the largest absolute mean change in NDCG@10 is 0.011, although Kendall's τ as low as 0.743 shows that reordering is reduced, not absent. The account reconciles prior contradictory findings and identifies prompt tone as a potential validity threat when absolute relevance labels matter.
Authors:Yaning Jia, Shenyang Deng, Yaoqing Yang, Chiyu Ma, Wenxuan Xu, Soroush Vosoughi
Abstract:
Graph Neural Networks (GNNs) have achieved remarkable success across diverse applications, yet they remain highly vulnerable to adversarial attacks that maliciously perturb graph structure. Existing defenses often lack rigorous theoretical grounding, rely on attack‑specific heuristics, or require costly retraining procedures such as adversarial training. To address these limitations, we propose Kernel‑Complexity Edge Sanitization (KCES), a training‑free and model‑agnostic framework for defending against structural attacks. KCES is built upon Graph Kernel Complexity (GKC), a principled metric derived from the graph Gram matrix that appears in a generalization upper bound on the GNN test error. From this bound, we define an edge‑specific KC score that quantifies each edge's structural influence via its induced change in GKC. KCES then identifies and prunes high‑KC edges, which are empirically enriched with adversarial perturbations under structural attacks, to mitigate their harmful impact. Computationally efficient and scalable, KCES operates as a lightweight preprocessing step without retraining and can be seamlessly integrated with existing defenses. Extensive experiments demonstrate that KCES consistently outperforms representative robust baselines across diverse attack settings and scales effectively to large graphs. Supported by theoretical analysis and extensive empirical validation, KCES provides a principled and efficient framework for securing GNNs. Our code is available at https://github.com/karpning/KCScore.
Authors:Zehan Liu, Carl Chen, Rime Wen, Kaiqi Fu, Altman Lin, Shawn Qin, Lights Shi, Roy Gan, Hao Wang, Qian Wang
Abstract:
Incremental‑text streaming text‑to‑speech (TTS) needs online text progress tracking for synchronized highlighting, interruption handling, and dialogue‑history updates. Input text arrives before it is spoken, so text arrival alone cannot indicate speech progress. Existing waveform‑based alignment requires complete audio or adds acoustic processing during streaming. We propose X2‑NativeCursor, a lightweight observer that tracks progress from native speech tokens before waveform decoding without changing the TTS generator. Its normalization plan links spoken labels to their original‑text spans. Text and native‑token encoders feed a local matcher that estimates the current label position. A separate output rule converts revisable position estimates into a cursor that never moves backward. Mean absolute error against an automatic reference is 0.151 Chinese characters with 80‑ms lookahead, versus 1.253 characters with 320‑ms lookahead for an online waveform baseline. Alignment real‑time factor also decreases from 0.3598 to 0.0180 relative to this baseline. Lower tracking error is retained under a second automatic alignment reference. We evaluate X2‑NativeCursor on Qwen3‑TTS and validate its adaptation to CosyVoice2 by training a separate observer for each backbone. Code is publicly available at https://github.com/X‑Square‑Robot/X2Streaming‑TTS.
Authors:Jingyi Liao, Wenyu Zhang, Zhuohan Liu, Yingxu He, Geyu Lin, Xunlong Zou, Shuo Sun, Syed Ali Redha Alsagoff, Ai Ti Aw
Abstract:
The rapid advancement of audio and multimodal large language models has unlocked transformative speech understanding capabilities, yet evaluation frameworks remain predominantly English‑centric, leaving Southeast Asian (SEA) languages critically underrepresented. We introduce SEA‑SpeechBench, to the best of our knowledge, the first large‑scale multitask benchmark that evaluates speech understanding in 11 SEA languages through 97,194 samples across 99 evaluation sets and 597 hours of curated audio data. Our benchmark comprises 9 diverse tasks across 3 categories: speech processing (automatic speech recognition, speech translation, spoken question answering), paralinguistic analysis (emotion, gender, age, speaker recognition), and temporal understanding, a novel dimension featuring timestamped content queries and temporal localization within extended audio sequences up to 3 minutes. We implement multilingual prompting in both native SEA languages and English to reflect user interactions with audio‑language models. Evaluation of leading open‑source and proprietary systems reveals marked performance gaps. Across all models, performance remains underwhelming on temporal understanding, emotion recognition, and speech translation. Prompting in low‑resource languages such as Burmese and Tamil lags behind English by up to 41 percentage points. Our findings expose critical model limitations and underscore the need for inclusive model development. The SEA‑SpeechBench benchmark is available at https://zwenyu.github.io/SEA‑SpeechBench/.
Authors:Kevin Hartman
Abstract:
When an agent writes code, the development framework becomes the control system for a non‑deterministic worker. Spec‑first, agent‑driven frameworks have gained rapid traction since 2025; the installable ones, GitHub Spec Kit, obra/superpowers, BMAD, and GSD, and our own, all capture intent through a specification or durable planning artifacts. Since they agree on capturing intent up front, what separates them is how each enforces the engineering discipline that keeps agent‑written code clean, correct, and maintainable. Every framework enforces that discipline somehow; they differ in how. We characterize three modes: enforcement by persuasion (prompt discipline the model may ignore), by front‑loaded structure (strong specs, then a trusted build), and through controls the agent cannot edit (a deterministic orchestrator, human‑approved gates, immutable tests, and a green result that must pass against a live, branched database). We introduce Consort, a spec‑first, test‑driven agent framework built on the third, enforcing that discipline through controls the agent runs inside but cannot bypass, in which a deterministic orchestrator drives separate role agents through a spec‑first design lane and a test‑driven build lane on a live database branch. We argue that enforcing the tests and gates in code keeps agent‑written code honest and verifiable, while its specialized roles, like the human roles before them, are what make it maintainable, claims we frame as a pre‑registered, testable hypothesis.
Authors:Weisi Yang, Stephen Xia
Abstract:
Deploying Large Language Models (LLMs) directly on mobile platforms at the edge is gaining traction due to a myriad of benefits, such as increased privacy, personalization, and reduced latency. However, LLMs have heavy computational requirements, which are difficult for resource‑constrained mobile and edge platforms to fulfill. In addition to limited compute resources, mobile and edge systems often have a compact form factor and lack physical mechanisms to dissipate heat generated from high processor usage rates (e.g., fans) to prevent throttling and reduced processing power, which LLMs can easily cause. To mitigate these effects, prior works have proposed various power governing strategies, such as dynamic voltage and frequency scaling (DVFS), for reducing power and heat generation for heavy computational tasks on mobile platforms. Recently, DVFS methods tailored for mobile LLMs have also been proposed. However, these methods mostly focus on optimizing hardware parameters and processor frequencies, and they fall short under some thermally constrained scenarios. Drawing from recent advances in machine learning, we identify and take advantage of the key insight that not all tokens require full‑depth inference to maintain high‑quality generation. Motivated by this, we present PELM, a solution that augments traditional DVFS processor frequency tuning with two additional workload‑specific knobs: 1) speculative decoding and 2) variable verification depth to expand the optimization space to multiple dimensions for more power efficient on‑device LLM inference. In extensive evaluations across hardware platforms and datasets, PELM demonstrates superior performance compared to state‑of‑the‑art power governing methods, with up to 23.1% speedup and 52.4% reduction in energy consumption, while maintaining comparable task performance. The source code is available at https://github.com/imec‑nu/PELM.
Authors:Jie Xu, Kangjin Yu, Ziyi Jin, Junjie Gao, Liqing Chen, Yixian Li, Shuai Tian, Zhongpu Xia
Abstract:
Standard behavior cloning supervises actions without explicitly constraining the future representation paired with each demonstrated action chunk. We introduce JEPA Policy, a diffusion‑free framework that uses the action chunk and its observed future representation as paired training targets. Action and future‑representation tokens interact in a shared Transformer and are refined through two forward passes. Future prediction can therefore shape the representation used to generate actions. Dual‑branch and gradient‑routing controls attribute the gain to this shared topology rather than to an auxiliary prediction head alone. Across nine simulated tasks, JEPA Policy improves mean success over the action‑only MIP baseline and outperforms Diffusion Policy under the evaluated configurations, while adding 0.29 ms to MIP's model latency. A five‑task, 630‑episode physical‑robot study produces the same pooled ranking. Further audits find no complete representation collapse under action supervision and identify a task‑conditioned failure‑ranking signal in future‑prediction error. These results support paired future‑representation supervision as a practical approach to low‑latency visuomotor imitation without iterative generative sampling.
Authors:Jieyi Long, Theodore Pender, Zhao Huang, Manuel B. Santos, Samrendra Kumar Singh, Bartosz Naskręcki, Bit Wonka, Joe Doyle, Pierre-Luc Dallaire-Demers, Francesco Giannicola, Ruben M. L. Paschoarelli, Oli Freuler, Jackie Chia-Hsun Lee, Vasily Gnuchev, Gopi Kannappan, John Boyer, Xavier Butler, Akash Balasubramani, Jordan Newman, Bereket Dereje, Alexander Hertlein, Robert Kodra, Lucas Levy, Shaan Patel, JT Rose, Matt Zweil, Okechukwu Wisdom, Tarek El-Eter, Edison Lee, Michael Dong, Alan Li, Anto Joseph, Gajesh Naik, Gautham Anant, Soubhik Deb, Justin Drake
Abstract:
We propose Open Autoresearch, a paradigm in which humans and AI agents publish evaluator‑verified improvements to a public leaderboard. We instantiate it in ECDSA.Fail, optimizing reversible secp256k1 point‑addition circuits, a bottleneck in Shor's algorithm for elliptic‑curve cryptography. The benchmark minimizes the spacetime‑inspired score S=Q× T, where Q is peak logical qubit width and T is average executed Toffoli count. Participants reduced S by 86.1%. At the data cutoff (26 July 2026), the best‑scoring circuit uses 1,151 qubits and 1,299,453 average executed Toffoli gates, giving Q× T\approx1.496 billion. This is more than 50% below Google's published point‑addition score thresholds (arXiv:2603.28846), under different accounting conventions. Because the benchmark supplies one addend classically, we construct a coherent windowed‑addition‑compatible variant implementing the single‑call interface required by windowed Shor. It uses 1,162 qubits and 1,684,161 average executed Toffoli gates. On 100,000 random inputs, its empirical success probability is \hatp=0.99809, giving Q× T/\hatp\approx1.961 billion under an independently rerunnable per‑call sensitivity model, not a full‑Shor success estimate. Its qubit and Toffoli counts lie below Google's published thresholds and Schrottenloher's reported operating points (arXiv:2606.02235), although differing interfaces, accounting conventions, and validation scope preclude formal dominance. After the cutoff, the score was further reduced to 1.259 billion, while a separate low‑width circuit reached 813 qubits. The public record shows AI agents complementing human judgment, providing evidence for open autoresearch on efficiently evaluable, machine‑checkable objectives.
Authors:Shivam Singh, Aditya Yadavalli, Catherine Arnett, Alex Warstadt
Abstract:
We introduce BuzzASR, a collection of language‑specialized fine‑tuned Whisper models adapted for automatic speech recognition (ASR) in 102 languages. Large end‑to‑end Transformer‑based ASR models such as Whisper have revolutionized ASR, but most prominent models are highly multilingual. As a result, these models often perform poorly on languages less well‑represented in their training set. While it has long been known that effective language adaptation can be achieved through simple fine‑tuning on monolingual data, this strategy has only been applied to a small number of languages. We massively scale up this simple approach to 102 languages covered in the FLEURS dataset, while also implementing a more complex language adaptation strategy that integrates monolingual tokenizer replacement and data augmentation using text‑only fine‑tuning. BuzzASR models outperform Whisper‑large‑v3 on 77 out of 102 languages, reducing character error rates (CER) by a factor of over 2.8 on average. Our models achieve state‑of‑the‑art CER among open‑source systems on 27 of 102 languages on the combined FLEURS and Common Voice test set. Our tokenizer replacement strategy yields an average 3.3x improvement in compression rate (characters per token) over Whisper's multilingual BPE, with gains of up to 21.7x. We release all models, code, and detailed results: https://lemn‑lab.github.io/buzz‑asr
Authors:Quoc Viet Nguyen, Trinh Pham, Viet Huynh, Hongzhi Yin, Quoc Viet Hung Nguyen, Bay Vo, Thanh Tam Nguyen
Abstract:
Recommender systems have become core infrastructure for modern online platforms, personalizing content at scale and strongly influencing what users see, click on, and purchase. However, this dependence on user interaction also exposes them to shilling attacks, where malicious actors can inject fake profiles to distort item rankings and control visibility. Existing attacks often rely on target‑specific fine‑tuning or fixed profile templates, making them either difficult to adapt to different victims or easier to detect. To overcome these limitations, we propose the Agentic Group Attack System (AGAS), a coordinated shilling framework where a central Coordinator directs a group of role‑switching worker agents to adaptively promote a target item across different victim families. The Coordinator dynamically adjusts the strategy when progress stalls or suppression signals increase, while workers pursue a shared objective and switch between active and inactive roles to avoid repetitive patterns. Under the same attack budgets and evaluation protocols, AGAS consistently surpasses strong baselines in target promotion while better preserving benign recommendation quality, weakening representative detectors, and achieving higher efficiency than prior attacks. These findings also emphasize that defending recommender systems may require mechanisms that can handle adaptive shilling campaigns, not just isolated fake‑profile injections. Our code is available at https://github.com/phkhanhtrinh23/AGAS.
Authors:Kaushik Chandana, Jay Imperatori, Tanmay Shukla, Justin Zhou, Stefan Abi-Karam, Callie Hao
Abstract:
Building large, diverse datasets of high‑level synthesis (HLS) designs beyond common community benchmarks remains an open challenge. This challenge is made urgent by the rise of deep learning and LLMs for hardware design, which demand such datasets to train QoR models and benchmark LLMs on HLS tasks. Despite ongoing efforts to broaden sources, dataset curation still depends on manual work: locating HLS designs across academic publications and open source, then extracting standalone designs from larger codebases. The process is error‑prone and demands expert knowledge, iterative testing, and substantial per‑repository engineering. To address this, we present HLSFactory‑Agent, an LLM agent that automates large‑scale HLS dataset curation by extracting standalone designs from larger codebases. HLSFactory‑Agent runs the open‑source Pi agent framework inside Docker containers to build and evaluate each extracted design. This turnkey automation allows users to pass a GitHub link or code directory to HLSFactory‑Agent and receive a folder of extracted HLS designs ready to be integrated into the HLSFactory dataset framework. Additionally, we provide open‑source scripts to scrape and index papers from computer architecture, EDA, and FPGA conferences that possibly implement or use HLS designs, allowing for faster human discovery and curation of HLS designs for HLSFactory‑Agent. We report initial results from running HLSFactory‑Agent across a small subset of our indexed repositories, demonstrating successful extraction of synthesizable designs from structured codebases. We open source HLSFactory‑Agent and indexing scripts at https://github.com/sharc‑lab/hlsfactory‑agent.
Authors:Faiq Shamass
Abstract:
Soft Actor‑Critic (SAC) represents a continuous policy as an unbounded Gaussian that is squashed by tanh. The Jacobian of that map is \partial a/\partial u = 1‑a^2, which vanishes as |a|\to 1. A natural concern is that this throttle starves the actor of critic signal exactly where extreme actions (full brake, full throttle) are optimal. We test a minimal intervention that restores the missing signal: one extra term in the actor loss whose gradient on the pre‑tanh mean is the detached action‑gradient of Q, with no gain parameter. On a minimum‑time double integrator whose optimum is bang‑bang at the action bounds, vanilla SAC already reaches near‑optimal return (‑31.6 vs. a calibrated optimum of ‑30.3) across ten paired seeds. An ungated bypass does saturate the policy (99% of eval steps with |a|\ge 0.9) and collapses return to ‑195.5. A gated bypass that fires only on the flat shoulder |a|\in[0.9,0.999] also fails, and does so without leaving a saturated policy. Warm‑started MetaDrive fine‑tuning shows the same pattern: the bypass does not improve return, and where collision rate falls it is typically traded for out‑of‑road departures. Auto‑tuned entropy coefficient rises against the bypass, which is a push toward the tails. The Jacobian effect is real. Treating it as a bug to be undone is not free, and on the tasks studied here it is not helpful. Saturating a bound is not the same as solving a problem whose optimum lives on that bound.
Authors:Antoine Besset, Joris Tillet, Chuchu Fan, Julien Alexandre dit Sandretto
Abstract:
Ensuring the satisfaction of Signal Temporal Logic (STL) specifications under uncertainty is challenging, as reachability‑based monitoring provides guarantees but does not indicate how to restore satisfaction when it becomes indeterminate. A key difficulty is identifying which uncertain components actually affect global satisfaction, especially for nested formulas. This paper introduces a logical dependency tracking framework that propagates uncertainty through the STL structure and captures the causal contribution of reachable sets to satisfaction. By associating markers to uncertain predicates and propagating them via three‑valued semantics, we extract in milliseconds a compact Disjunctive Normal Form (DNF) of sufficient constraints, avoiding combinatorial enumeration. As an application, we formulate control correction as a minimum‑effort optimization problem. Using zonotopic reachability, the derived constraints are enforced via linear programming, yielding corrections that guarantee STL satisfaction under bounded uncertainty and provide certified probabilistic bounds in the stochastic case. We demonstrate the approach on a nonlinear system with nested STL specifications, showing that dependency tracking enables efficient and formally guaranteed correction. The tracking implementation is available at https://github.com/Antoine‑Bst/STL‑Three‑Valued‑Clause‑Filtering/.
Authors:Pierre-Louis Benveniste, Julian McGinnis, Shannon Kolind, Larry D. Lynd, Sarah A. Morrow, Jiwon Oh, Alexandre Prat, Alice Schabas, Penelope Smyth, Roger Tam, Anthony Traboulsee, Mark Mühlau, Herve Lombaert, Julien Cohen-Adad
Abstract:
Longitudinal characterization of multiple sclerosis (MS) lesions remains constrained by the lack of frameworks capable of establishing consistent instance‑level correspondences across time. Conventional segmentation approaches produce semantic lesion masks at each visit and therefore fail to capture the complex instance temporal patterns associated with lesion appearance, disappearance, splitting, or merging. This study presents a comparative evaluation of five strategies for automated tracking of spinal cord MS lesions in longitudinal MRI data from a multi‑site cohort. The investigated strategies rely either on deformable registration or on a spinal anatomical reference system, and encompass overlap‑based matching, coordinate‑based Hungarian algorithm, gradient‑boosted classification, and Siamese model classification. Tracking accuracy is quantified using instance‑level true positives, false positives, and false negatives, allowing to assess the presence of one‑to‑many and many‑to‑one associations. Results show best performance for the registration‑based overlap method. This study provides the first systematic analysis of lesion‑instance correspondence in the spinal cord and outlines the strengths and limitations of registration‑based and registration‑free paradigms for longitudinal MS assessment. The code is available at http://github.com/ivadomed/longitudinal‑sc‑ms‑lesion‑tracking .
Authors:Ruofan Wu, Peiran Xu, Xiaolong Li, Fan Shu, Soyoung Yoon, Yite Wang, Xiaodong Yu, Boyi Liu, Feng Yan, Debiao Li, Yuxiong He, Zhewei Yao
Abstract:
While autonomous agents have made significant strides in "deep research" by iteratively navigating the open web to synthesize information, real‑world problem‑solving is rarely confined to a single environment. Complex analytical tasks inherently require agents to weave together evidence from both ambiguous unstructured text (e.g., the open web) and highly precise structured data (e.g., relational databases). However, existing benchmarks evaluate these modalities in isolation, failing to capture the critical "handoff" ‑ the ability to preserve constraints when moving evidence between systems. We introduce HybridDeepResearch, to our knowledge the first deep‑research benchmark that requires both web search and SQL to form a complete, verifiable answer. The benchmark contains 380 tool‑dependent tasks grounded in LiveSQLBench‑Base‑Lite databases and public web corpora, validated through automated checks and human review, and covering three reasoning patterns: SQL2S, S2SQL, and Parallel. Evaluations across proprietary and open‑weight models under various agentic scaffolds reveal that even state‑of‑the‑art models like GLM‑5.2, Claude‑Sonnet‑4.6 and GPT‑5 achieve only about 50‑54% Pass@8 on the hard subset. Notably, results show that directional reasoning is substantially more difficult than parallel intersection, highlighting that bridging structured and unstructured information spaces without losing constraints remains a major open challenge for agentic systems. Code and datasets are publicly available at GitHub (https://github.com/Snowflake‑AI‑Research/HybridDeepResearch) and Hugging Face (https://huggingface.co/datasets/Snowflake/HybridDeepResearch).
Authors:Bo Yan, Weikai Lin, Song Wang
Abstract:
Language models act through tools, yet practical agents face libraries containing thousands of interfaces. We introduce the tool menu as the short, ordered subset of available tools shown to an agent before execution. The agent can call only tools in this menu. Multi‑step tasks require the final action and the prerequisite tools that create its inputs in a usable order. Current constructors rank tools by request relevance, which can surface the final action while omitting or delaying less obvious producers. We introduce the state path, a pre‑execution route from the observable request state to the desired outcome, and propose State‑Path Tool Menu to learn it. Our framework treats the menu as an execution prior over these routes. Its encoder represents which tools can run from the current state, how their outputs satisfy later inputs, and which orders recur in training paths. A retriever covers an executable entry, the missing‑input producers, and the final action. A reranker then places producers before consumers. On ToolBench, our menu raises online success from 0.737 to 0.898 and outperforms retrieval, reranking, generation, and routing baselines without changing the agent. The State‑Path menu also covers more complete chains with 32 tools than the official list covers with 128, and its success gain persists across executor families with different model capacities. Our code is at https://github.com/Met2348/State‑Path.
Authors:Botao Ye, Marc Pollefeys, Ming-Hsuan Yang, Abhijit Kundu
Abstract:
Recovering metric 3D geometry from monocular images is a fundamental computer vision task, yet current methods remain heavily fragmented by fixed camera model assumptions and inflexible input schemes. We present OmniPoint, a unified framework designed to generalize metric reconstruction across diverse imaging sensors, including pinhole, fisheye, and equirectangular projections, while accommodating varying geometric priors. To overcome projection rigidity, OmniPoint abandons conventional planar depth regression. It instead adopts a decoupled ray and distance representation alongside a decoupled training objective, explicitly separating the camera projection model from the scene structure. To address the severe scarcity of training data for alternative cameras, we introduce a bidirectional augmentation strategy that explicitly bridges labeled perspective data and unlabeled omnidirectional domains in 3D space. Furthermore, to seamlessly integrate optional inputs like camera intrinsics or sparse depth without destabilizing the network through feature distribution shifts, we propose a robust information injection mechanism. This mechanism utilizes learnable input state embeddings to resolve architectural ambiguity and applies vectorized Gaussian smoothing to densify irregular measurements. Extensive experiments demonstrate that OmniPoint achieves state‑of‑the‑art zero‑shot performance across multiple benchmarks, establishing a robust new standard for unified monocular 3D reconstruction.
Authors:Samira Alkaee Taleghan, Younghyun Koo, Farnoush Banaei-Kashani
Abstract:
Arctic maritime navigation is becoming increasingly important as changing sea‑ice conditions expand seasonal accessibility while simultaneously introducing substantial operational, environmental, and community risks. Arctic route planning is inherently a multi‑criteria problem: routes that improve vessel safety or efficiency may increase exposure to sea ice, sensitive ecosystems, or nearby communities. Existing routing methods prioritize travel time, fuel use, and navigational risk, often overlooking ecological and community impacts. We introduce a human‑in‑the‑loop, multi‑agent GeoAI system for Arctic eco‑navigation that integrates operational, physical, ecological, and community‑related criteria within a unified routing framework. Multiple specialized agents coordinate geospatial data acquisition and preparation, multi‑objective route generation, and skyline‑based decision support. The ecological criteria explicitly account for exposure to sensitive areas, including Essential Fish Habitat and seal critical habitat. By considering these ecosystem impacts and potential community burdens while keeping consequential value judgments under human control, the framework supports safer, more transparent, and socially responsible Arctic navigation. Project page and code are publicly available. https://samiraat.github.io/Arctic‑Eco‑Navigation‑Agent/, https://github.com/samiraat/Arctic‑Eco‑Navigation‑Agent
Authors:Fengxiang Bie, Yuqing Jian, Yifan Yu, Zhongzhu Zhou, Zelei Shao, Ben Athiwaratkun, Shuaiwen Leon Song, Chenfeng Xu, Xiaoxia Wu, Tianyi Zhang
Abstract:
Speculative decoding is critical for accelerating LLM inference. However, the speedup is fragile: drafters are typically trained against a narrow distribution for a single target model, and their acceptance rate collapses under workload shifts. This is a striking inversion of modern LLM development, where target models are valued precisely for the broad generalization they acquire through large‑scale pretraining. We argue that the natural remedy, pretraining, has been hard to apply to drafters because existing recipes are target‑specific: the drafter consumes the target's hidden states and is distilled on the target's logits, so pretraining must be repeated for each target. We introduce Osprey, which instead bootstraps drafters from off‑the‑shelf pretrained small language models, treating broad pretraining as a reusable, target‑agnostic asset and reducing per‑target work to a lightweight adaptation step. Realizing this requires overcoming two challenges: small LMs are far deeper than a latency‑bound drafter can afford, and their pretrained computation must remain intact while the drafter learns to ingest target hidden states and emit tokens in the target's vocabulary. Osprey addresses both by pruning to a shallow backbone, restoring its language‑modeling capability with target‑agnostic next‑token pretraining, and adapting it to each target through vocabulary alignment, zero‑initialized QKV expansion, and distillation from the target model's output distribution. Empirically, a single pretrained Osprey backbone transfers across targets and improves mean acceptance length by 16.1% for Qwen3‑8B, 21.2% for Llama‑3.3‑70B‑Instruct, and 22.7% for the 229B MiniMax‑M2.5 (with 17.5% higher tokens per second), with the largest gains on out‑of‑domain and multilingual data. Our code is available at https://github.com/LeanModels/Osprey.
Authors:David Balduzzi
Abstract:
This paper investigates the hypothesis that the first‑order structure of physical interactions, i.e. gradients or Jacobians, characterizes the structure of phenomenal experience. It does so in an idealized world inhabited by neural networks, Gradland, where the physics are known and the functions are (mostly) differentiable. The paper introduces two measures of Jacobian structure: effective rank and cohesion, based on Kirchhoff complexity. Applying the measures to a series of worked examples shows the hypothesis accounts for: (1) the duration of experience, that it can prolong over hundreds of milliseconds; (2) the difference between what is experienced vividly and obscurely; (3) the experience of texture; (4) the blooming buzzing confusion presumably experienced by newborns; (5) the difference between ideas that are held distinctly in mind and ideas that are confused; (6) what learning is like; and finally (7) the paper explains the function of rich, dense experience.
Authors:Jiaqi Ye, Xinrui Gong, Jingcun Wang, Olga Kondrateva, Bing Li, Grace Li Zhang
Abstract:
Field‑programmable gate arrays (FPGAs) enable efficient neural‑network inference, but most deployment flows either accelerate multiply‑accumulate operations or convert pretrained quantized models into lookup tables (LUTs). We present DiffLUT‑Net, an FPGA‑native network connected by six‑input LUTs that are trained from scratch. We jointly learn the 64 truth‑table entries of a LUT and the source to each of its six input ports using a differentiable LUT function relaxation and hardware source selection. After training, the truth tables and connections are discretized, unused logic can be pruned, and the network is exported directly as synthesizable Verilog. Across five benchmarks, DiffLUT‑Net achieves favorable accuracy‑resource trade‑offs. These results demonstrate the effectiveness of jointly learning LUT functions and sparse connectivity for compact FPGA‑native inference. The code is available at https://github.com/TUDa‑HWAI/DiffLUT‑Network.
Authors:Yang Wan, Xihang Yue, Zhirui Liu, Ziyuan Chu, Shuxun Wang, Yuhan Chen, Xiaonan Jiang, Xukun Zhu, Yubo Dong, Linchao Zhu
Abstract:
A verifier for robot policies reads a candidate behavior and returns a score for how well it did, used both to evaluate vision‑language‑action policies and to train them. Verifiers range from success detectors and reward models to runtime monitors, safety filters, and temporal‑logic specifications. We survey roughly 150 verifiers and compare them along two properties. Availability is how much a verdict costs, how early in a rollout the verdict arrives, and how often a verdict can be asked for. Availability rises as verdicts get cheaper, earlier, and denser. Credibility is how much a high score tells us about the task. Credibility falls as the judgment becomes gameable and self‑serving. We group the verifiers by who supplies the judgment: human verifiers, rule‑based and formal verifiers, learned and pretrained verifiers, and model‑intrinsic verifiers. Across the four families, we find that credibility falls as availability rises. Regardless of who supplies the judgment, there is no free checker. We then examine what validates a verifier itself, and how much a high score tells us. Three measures appear in the literature: agreement with human labels, the performance of the policy it trains, and behavior under reward hacking. We close with nine metrics that make a verifier claim checkable, and coordinates for the verifiers still to be built.
Authors:Lilin Yan, Hongwei Zhao
Abstract:
Rajam\unicode228ki and Koivunen asked whether minimum‑redundancy symmetric Kl\unicode248ve‑Mossige arrays with contiguous sum co‑arrays are always Kl\unicode248ve arrays. We give a computer‑assisted proof that, at every fixed sensor count, every maximizing sensor set belongs to the Kl\unicode248ve class. The argument classifies the overlaps between a generator and its shifted reflection, then bounds the aperture of a hypothetical optimizer outside the Kl\unicode248ve class. Comparing these bounds with a classical Kl\unicode248ve construction settles all sensor counts at least 330. An exact integer certificate covers the remaining counts from 2 through 329 and matches every equality case to a Kl\unicode248ve array as a complete set. Consequently, optimization within the full symmetric Kl\unicode248ve‑Mossige class reduces to the previously known search over Kl\unicode248ve parameters. The theorem concerns this specified class, rather than unrestricted sparse arrays or all restricted additive bases.
Authors:Aayam Bansal, Keertan Balaji
Abstract:
Existing benchmarks for autonomous AI scientists evaluate only final outputs‑‑‑generated code, hypotheses, or papers‑‑‑yet discard the reasoning process by which those outputs were obtained. This makes it impossible to audit scientific methodology, diagnose failure modes, or distinguish systematic reasoning from fortunate guessing. We present OpenDiscoveryTrace, a public dataset of 558 complete AI scientific agent trajectories that captures how models reason, not just what they produce. Each trajectory records a structured 9‑field‑per‑step trace‑‑‑including thoughts, tool calls, observations, errors, revision triggers, and self‑reported confidence‑‑‑as models execute 124 scientific tasks spanning drug discovery, materials science, genomics, and scientific literature analysis. The dataset covers seven models: three frontier models (GPT‑5.4, Claude Opus 4.6, and Gemini 3.1 Pro; 124 trajectories each, fully balanced across domains and difficulty levels) and four open‑weight models (Qwen2.5‑7B, Mistral‑7B‑v0.3, Phi‑3.5‑mini, and Qwen2.5‑1.5B; 30 each), plus 60 live‑retrieval variant trajectories. Pilot analysis on 363 LLM‑judged trajectories reveals that process traces expose behavioral differences invisible to output‑only evaluation: all three frontier models achieve comparable success rates (84‑‑89%), yet Claude Opus 4.6 produces 30× more errors than GPT‑5.4 (2.5 vs. 0.08 per trajectory, p < 0.0001, Cliff's δ= 0.613), with qualitatively different error profiles‑‑‑66.7% tool misuse for Claude versus 83.6% reasoning errors for GPT‑5.4. We define five benchmark tasks with baselines from logistic regression, random forests, LSTMs, and Transformer models. The dataset, trace schema, agent harness, and benchmark definitions are publicly available under CC BY 4.0 to support research on process‑level evaluation, scientific agent auditing, and AI governance.
Authors:Rahul Vimalkanth, Kaushik Mitra
Abstract:
Lensless near‑eye sensing is often described as privacy‑friendly because its coded measurements are visually unintelligible. Yet visual unintelligibility reflects human interpretation, not what a learned adversary can recover. We therefore treat identity privacy as a systems property of disclosure surfaces: representations crossing sensing, storage, computation, and output boundaries. We audit a simulated lensless gaze pipeline under a 36‑subject known‑gallery closed‑set identification protocol with a fixed, known PSF; privacy from an unknown or varying optical key is outside our scope. Reported accuracies are empirical attack success rates under matched linear and MLP probes and do not upper‑bound stronger adversaries. Simulated lensless measurements yield 96.7% top‑1 identification versus 97.7% for matched original eye crops, while an MAE embedding retains 94.3%. Compression alone offers little protection: 8‑D PCA and a matched 8‑D bottleneck retain 93.2% and 91.8%, whereas separately trained 8‑D GSPL bottlenecks yield 77.5% mean recovery across three seeds. A released 128‑way gaze token lowers single‑frame recovery to 38.1%, while its residual and continuous gaze output expose 62.1% and 72.6%, respectively. Under a source‑frame‑disjoint tiled protocol, token summaries reach 39.9% at T=25, showing that repeated‑output risk depends on representation and aggregation. These rates reflect all subject‑correlated information in the evaluated dataset, including acquisition and behavioral cues, rather than isolating intrinsic ocular biometrics. Ordinary least squares residualization against a six‑dimensional crop geometry and intensity summary still leaves lensless recovery at 95.1%. Our results show that privacy claims for lensless sensing must be tested at disclosure boundaries rather than inferred from appearance.
Authors:Muhamathu Ameer Ali Aacaas Muhamath
Abstract:
Vision‑language model (VLM) confidence may change in aggregate when visual evidence is degraded while remaining structurally inconsistent within individual examples. We study answer‑level reliability along five‑step, question‑conditioned evidence‑loss trajectories. Using a frozen Qwen2.5‑VL‑3B‑Instruct model, we construct 176 accepted GQA‑derived trajectories (880 masking conditions) by progressively masking scene‑graph‑localized question‑critical regions. Native sequence confidence has an evidence monotonicity violation rate (EMVR) of 0.436, and 92.0% of trajectories contain at least one adjacent violation. A matched non‑critical‑region control shows that full critical masking reduces accuracy by 28.2 percentage points, compared with 0.6 points for equally sized non‑critical masks; the paired difference is 27.6 points (95% CI [20.0, 34.7]). We train a lightweight post‑hoc reliability head on frozen hidden states, sequence confidence, and entropy. Adding evidence‑order supervision to binary cross‑entropy (BCE) reduces masking EMVR from 0.330 to 0.303 (paired difference ‑0.027, 95% CI [‑0.044, ‑0.010]). The same mask‑trained objective reduces EMVR from 0.449 to 0.402 on held‑out question IDs under unseen local Gaussian blur (difference ‑0.0468, 95% CI [‑0.0739, ‑0.0199]). AUROC, Brier, and AURC differences between the two learned heads are statistically inconclusive, and native confidence remains stronger for selective‑risk ranking. The results separate evidence‑order consistency from conventional correctness discrimination rather than establishing generic confidence superiority.
Authors:Ameer H. Shakur, Shinyoung Kang, David Hein, Michael J. Holcomb, Huong-Tra Ngo, Aarash Zakeri, Minhan Park, Licheng Yi, Dhanush Jain, Hunter Schuler, Andrew R. Jamieson
Abstract:
OASIS (Open Assessment and Scoring Infrastructure Stack) is a systems platform for rubric‑based grading of video, audio, and text with large language models. Scoring one artifact with an LLM is straightforward; deploying assessment at scale requires encounter management, rubric versioning, modality‑aware execution, provenance capture, and human review. OASIS pairs a standalone command‑line interface with a canonical integrated Elephant + MAPLES stack for encounter management and multimodal grading orchestration. Both paths can target hosted APIs or self‑hosted open‑weight models through Ollama and OpenAI‑compatible endpoints such as vLLM. SimRubrics rubric authoring and the Wayfinder conversational agent gateway are optional extensions that use the same authenticated interfaces as human operators. Given a rubric and recorded encounters, OASIS produces per‑criterion scores, evidence, and rationales, preserving execution artifacts for audit. Distinctive features include rubric‑as‑program compilation, progressive execution plans, content‑addressable grading identity, transcript‑augmented multimodal grading, explicit review state, and a shared command surface for humans and autonomous agents. Though developed in medical education, the architecture is domain‑agnostic, applying wherever structured performance can be evaluated from recorded or written artifacts. In production at UT Southwestern Medical Center since Fall 2023, the platform has processed more than 7,000 encounters. This publication includes the report and project information, not application source, binaries, installation materials, sample data, or a tagged software release.
Authors:James Schwoebel, Ingrida Semenec, Jenia Rousseva, Marcos Ortiz, Collin Overbay, Christopher Klaus, Anderson Edmond, Manish Bhatt, Rome Thorstenson, Jessica Tsai, Martin G. Frasch
Abstract:
LLMs generalize across a domain only after seeing many real, labeled examples, which most domains lack. We study a way to manufacture it cheaply. When a domain's dynamics can be written as code, one template instantiates into many world models: executable, verifiable programs over symbolic state, each an inexhaustible source of exactly‑labeled trajectories. Fine‑tuning an LLM on trajectories through many such worlds, which we call world‑time compute, a training‑time analogue of test‑time compute, lifts generalization to held‑out worlds it never trained on (synthesized world families). Gains are largest where capability is scarcest: +29 points at 0.5B; the largest model's lift is within noise, consistent with saturation. Labels can be trusted because the worlds are verified code: synthesized‑then‑checked dynamics are exact over 20‑step rollouts and answer 10x out‑of‑distribution probes exactly (100%), whereas per‑step LLM and MLP predictors compound error and collapse. Unlike domain randomization, each world is independently authored and verified; a corrupted‑label control shows label exactness, not task variety, drives the gains. On real benchmarks (ARC‑AGI grids, List Functions, CLRS) the same lever holds as per‑world test‑time training. On List Functions the harder cross‑world form holds: one adapter trained on 128 disjoint worlds reaches 40% on held‑out worlds versus 6% for a corrupted‑label control (+34 points, CI [29, 39]). The gain is a saturating regularity, not a law: largest for few‑step reasoning and small/weak models, fading for long chains, perception‑induced tasks, and saturated tasks; cross‑task transfer is weak without shared skill. Worlds are authored and served by OpenWorld, a zero‑dependency framework (companion paper). Scope: symbolic state; pixel‑native domains remain territory of learned models. All code, recipes, and this manuscript regenerate from one repository.
Authors:Yuqiao Tan, Shizhu He, Jun Zhao, Kang Liu
Abstract:
While research on recursive self‑improvement (RSI) has predominantly automated model training pipelines, reliable autonomous development demands a missing pillar: post‑hoc monitoring and auditing to understand what models learn and ensure safe alignment. Mechanistic interpretability tools are essential to bridge this gap, among which Sparse Autoencoders (SAEs) serve as a cornerstone by isolating interpretable features for model inspection and steering. In this paper, we introduce SAEScientist‑Bench to evaluate whether AI agents can act as scientists utilizing SAE tools for autonomous mechanistic discovery. Given a target concept, an agent designs contrastive probes and navigates a Gemma Scope dictionary of 131K+ features in Gemma‑2‑9B‑IT to discover the optimal feature, evaluated against curated expert reference features anchored on Neuronpedia across activation rank, concept selectivity on contrastive texts, and causal steering. Across 10 agent configurations and 20 tasks, frontier agents demonstrate genuine discovery capabilities and lead different evaluation dimensions, but remain well behind the expert baseline, approaching expert levels on separating target concepts from contrastive controls while lagging substantially in causal generation steering. Further analysis reveals that although agents can design contrasts to rule out spurious candidates, they frequently misinterpret experimental measurements. These results establish experimental model understanding as a measurable capability for closed‑loop autonomous AI R&D. Our code is available at https://github.com/Trae1ounG/SAEScientist.
Authors:Tommy Sha, Skylar Zhai, Siqi Zhao
Abstract:
In reinforcement learning with verifiable rewards (RLVR) trained with group relative policy optimization (GRPO), the KL‑free reward‑advantage term studied here depends on within‑group reward variation. If all rollouts in a group are correct or all are wrong, their group‑relative advantages are identically zero; these zero‑advantage silent groups provide no reward‑advantage gradient, yet uniform sampling spends 39% of a run's rollouts on them. History‑based prompt selection must first spend target‑policy rollouts to estimate difficulty, creating a cold start with rollout waste; ThinkPrior instead uses an external anchor in one offline pass to construct a zero‑rollout difficulty prior before the first target‑policy rollout. The verifier‑scored anchor pass rate supplies an external‑anchor initialization for a Beta posterior; ThinkPrior selects by expected learnability and then updates from training outcomes, changing neither the loss nor the optimizer. On Qwen2.5‑Math‑7B across sixteen seeds, ThinkPrior more than halves early silent groups and cuts wasted rollouts through step 30 by nearly a fifth, while we detect no difference in final accuracy. On this 250‑prompt pool the fixed‑budget result is a reallocation rather than a net saving. The measured ThinkPrior+DAPO composition reduces generated rollouts by 10.6% while both arms retain the same 3840‑rollout update budget. The prior requires no target‑policy rollout before the first selection, but the posterior thereafter uses target‑policy outcomes.
Authors:Ryan Truong, Lance Ying, Samuel J. Gershman, Kazuki Irie
Abstract:
While many video‑game environments (VGEs) have played crucial roles in advancing reinforcement learning (RL), developing novel VGEs or modifying existing ones to support new features, has been a laborious process requiring extensive hand‑coding. Here we present PlayTrain, an RL framework that combines the abilities of large language models (LLMs) to robustly generate JavaScript (JS) games from a minimal human prompt, and an efficient pipeline that can run any JS game in a standard 'gym' environment. Not only are recent LLMs particularly good at writing JS code, but the JS format also allows users to easily play generated VGEs, while PlayTrain enables us to train RL agents on the exact same games. We demonstrate multiple use cases of PlayTrain, including cloning well‑known Atari and ProcGen games in simple JS, where PlayTrain trains pixel‑based agents end‑to‑end at over 1M agent‑decisions per second on a single GPU node; and creating modified versions thereof (e.g., that support novel test sets, procedural generation logics, or game dynamics). Through PlayTrain, we reimagine RL VGE development: all we need is a single JS file, generated and modified through an LLM. We discuss promising future RL research directions that PlayTrain unlocks.
Authors:Fei Teng, Sheng Wu, Mengfei Duan, Guoqiang Zhao, Junhui Ma, Kai Luo, Siyu Li, Hao Shi, Zhiyong Li, Kailun Yang
Abstract:
Spherical observations provide global visual context for 3D scene understanding. However, visual information is encoded in an angular domain, whereas the physical world is represented in Cartesian coordinates. This cross‑space representation gap complicates geometric correspondence and semantic evidence aggregation. To delve into this challenge, we introduce Spheriverse, comprising 64,400 temporally aligned spherical image‑LiDAR pairs organized into 644 sequences. The dataset spans diverse scenes, illumination, and weather conditions, with fine‑grained semantic classes. We further establish benchmarks for semantic occupancy prediction, semantic mapping, and 3D object detection, evaluating 30+ methods through overall and scene‑wise comparisons. For dense prediction, we propose SphereOcc, an occupancy framework that couples spherical geometry modeling with semantic evidence retrieval. Cartesian‑Spherical Representation Remodeling (CSRR) incorporates spherical range‑azimuth geometry into Cartesian voxel features through region‑wise modulation. Spherical Evidence Re‑querying (SER) then conditions queries on voxel content and range‑height‑azimuth geometry to adaptively retrieve relevant semantic evidence from source spherical image features. SphereOcc achieves 13.91% mIoU and 24.65% GeoIoU, yielding relative improvements of 13.9% and 9.3% over the respective best‑performing methods, TPVFormer and SurroundOcc. It also ranks first in both metrics across all five scene categories, with consistent advantages across the evaluated spatial partitions and reduced fields of view. The established benchmark and source code will be available at https://feit‑feiteng.github.io/Spheriverse.
Authors:Orantqing, Shengpeng Ji, Junlong Tong, Jialong Zuo, Dongjie Fu, Di Cao, Yangzhuo Li, Shangda Wu, Franz, Evan, Theron Veyra, Changhao Pan, Jingyu Lu, Dongchao Yang, Zhifei Xie, Yang Tan, Xiaoyu Shen, Xiaoda Yang, Wenfu Wang, Teddy Sun, Steve Yves, Zhou Zhao
Abstract:
In this work, we present Gander, an end‑to‑end model that unifies omni perception, realtime interaction, and agentic capabilities within a single framework. In contrast to turn‑based conventional paradigms, Gander continuously receives streaming inputs across multiple modalities, including video, speech, and text, enabling natural full‑duplex interaction in both everyday conversations and complex workflow‑oriented agent scenarios. Users can interrupt the model at any time, while the model can also proactively provide intermediate feedback or ask follow up questions. To natively support these capabilities, Gander adopts two key architectural designs: 1) It employs a Cerebellum‑Brain collaborative framework, in which the Cerebellum is responsible for realtime interaction and omni conversational capabilities, while the Brain handles complex reasoning and higher‑level agentic tasks. The two components interact continuously through tool calling and the agent orchestration runtime. 2) The Cerebellum is built upon a streaming Thinker‑Talker architecture, user inputs and model outputs are further flattened into an ordered token stream at the chunk level, providing a unified representation for low latency, continuous interaction. We conduct comprehensive evaluations of Gander across four dimensions: conversational ability, omni understanding, interactive capability, and agentic intelligence. Internal human evaluations demonstrate that Gander maintains the natural and expressive spoken dialogue capabilities of SOTA open source models while achieving competitive performance in omni interaction. Gander also demonstrates robustness in challenging real‑world scenarios, including background noise interference, multi‑party interactions, and backchannel communication. We release Gander together with its models, code, and data to facilitate further research and development in the community.
Authors:Sara Rizwan, Samaanah Abdus Salam, Mohammed Mudassir Uddin
Abstract:
Long context language models now advertise windows of one million tokens, but two habits limit how much of that window is used. Attention heads with nothing useful to read still spend their budget on the first token, which is called the attention sink, and where a fact sits in the context changes whether the model finds it. Gated attention cut first token attention from 46.7 percent to 4.8 percent at NeurIPS 2025, and Kimi K3 pairs that idea with Kimi Delta Attention and Attention Residuals behind a one million token window, eight times past the range where these diagnostics have been reported. This paper asks whether the fix survives that jump. We build SinkProbe, a suite that measures sink mass, massive activation, position resolved recall and the recency gap, and apply it to four small models that differ only in how they mix tokens and depth. Three results follow. The training objective produces the sink, not the architecture. Gating did not reproduce its published effect at our scale. Sink mass, activations and position bias moved independently. Code, data and the measurement protocol are released at https://github.com/sararizwan7/Attention‑Mechanisms‑in‑1M‑Context‑Window
Authors:Sushovan Majhi
Abstract:
Class disentanglement‑‑the separation of a representation's class‑conditional point clouds along depth and over training‑‑is measured by descriptive curves: the sentence such a study wants to write, layer l+1 is more disentangled than layer l, is an eyeball judgement with no null. We supply the inferential layer for a topological measurement of class overlap, the Intersection Euler Characteristic Profile: the Euler characteristic of the overlap of the clouds' ball unions as a function of scale, from one Alpha‑complex sweep with no boundary‑matrix reduction. Every number carries a test‑‑exact permutation tests in both directions, a guarded separation certificate the invariant requires, and a paired sign‑flip test for comparative claims. Building that test taught a lesson outliving this invariant: its statistic must be scale‑free. On the raw profile mass, which has units of feature length, 12,375 paired tests return 5,633 significant steps of which every one at the first epoch points the wrong way, certifying feature‑norm dynamics as disentanglement; the dimensionless statistic returns 2,707, with 2,026 decreases. Across 111 networks and 52,650 measurements, disentanglement is depth‑graded and early, and interaction quotients rank class pairs by confusability (rho=0.83), on par with cheap separability statistics. In a 96‑model factorial, augmentation is the one training choice that separates classes relative to chance; weight decay compresses the overlap without separating. Only a k‑fold statistic can pose the structural question: the joint entanglement of a class triple sits below its strongest pair in 97% of triple‑layer cells and 99.5% of deep cells, at median ratios far below a measured null floor, in vision encoders and frozen language models‑‑a regularity, not a law. The unnormalized mass predicts test accuracy (R^2=0.94), the quotient does not, and neither beats a linear probe.
Authors:Hongyi Li, Li Peizhuo, Yucheng Tao, Ze Wang, Fangzhou Xu, Jinyi Chen, Yanyan Yuan, Dapeng Jia, Yongbin Jin, Mingfeng Fan, Guillaume Sartoretti, Hongtao Wang
Abstract:
Humanoid motion trackers can reproduce diverse whole‑body motions, but their performance degrades on complex terrain where terrain‑agnostic references become physically infeasible. We present PGMT, a Perceptive General Motion Tracking pipeline for humanoid robots that learns terrain adaptation from independently selected motion references and terrains. PGMT first learns a general tracking and recovery prior, then incorporates terrain perception through motion‑conditioned terrain glimpses that selectively encode regions relevant to the current motion. Terrain‑aware tracking relaxation allows necessary deviations from the reference while preserving its motion intent. Zero‑shot deployment on a Unitree G1 demonstrates robust terrain‑adaptive locomotion and whole‑body motion execution over real‑world terrain with obstacles up to 37 cm high, while supporting teleoperation, dynamic motion tracking, and fall recovery. PGMT extends general humanoid motion tracking beyond flat ground, providing a unified policy for terrain‑adaptive locomotion, diverse whole‑body behaviors, and teleoperation in complex environments. Project homepage: https://luyili.github.io/pgmt/
Authors:Diwas Lamsal, Pramod Wickramatilake, Jednipat Moonrinta, Mongkol Ekpanyapong, Matthew N. Dailey
Abstract:
Smart healthcare monitoring systems require precise action recognition to ensure well‑being and timely intervention in critical situations such as falls, particularly for mobility‑challenged individuals. Existing datasets are often clip‑based, lacking the frame‑level detail needed to recognize actions online, as they unfold. To address this, we introduce SAFER‑Activities, a dataset for fall detection and physical activity monitoring, with a dedicated subset for wheelchair use scenarios. It comprises over 66 hours of video data captured by multiple cameras, with 85,310 action instances and frame‑level annotations for 30 action classes. We benchmark action recognition on SAFER‑Activities with 2D and 3D skeleton models, RGB models with frozen backbones, and multimodal fusion strategies, and evaluate on in‑lab, out‑of‑distribution, and cross‑dataset test sets. Skeleton‑based models generalize best under domain shift; fusing frozen RGB features with the skeleton stream improves in‑domain recognition over the baseline CNN1D, most clearly on the wheelchair subset, but degrades out of distribution. Cross‑dataset and qualitative evaluations confirm that models trained on SAFER‑Activities transfer well to unseen environments and external fall data. To support research on robust fall detection and activity monitoring, we release the dataset and code at https://safer‑activities.github.io/.
Authors:Chen Qian
Abstract:
Multi‑agent debate, in which several LLMs exchange arguments before producing an answer, is widely assumed to improve answer quality by surfacing genuine disagreement. That disagreement is hard to verify, and no single signal can settle it, so we organize the analysis around four questions: (A) does the debater say it disagrees; (B) does its reply text actually argue; (C) does the dissent survive once the tone instruction that produced it is removed; and (D) do the probabilities assigned to stance options change? We evaluate three‑model committees on 50 open‑ended GlobalOpinionQA questions under three debate tones, friendly (seek common ground), neutral, and hostile (stress‑test every position). The answers differ. (A) Full agreement differs by 50.4 percentage points between the friendly and hostile endpoints, pooling replies across all three rounds. (B) The text argues too: an LLM evaluator reading the contribution and reply without the structured self‑report or tone instruction confirms the pushback is real. (C) Removing the instruction produces more returns to agreement in our sample, but the primary question‑level test is inconclusive. (D) In a separate open‑weight study, adjusted movement toward the opposing side is detected in two of three models, relative to a filler‑based reference. This measures contextual response probabilities, not lasting belief change. For final answers, debate brings no measurable quality gain: an evaluator that judges each pair in both answer orders scores the debated answer no better than the same committee's no‑debate answer on all 299 pairs, a test that detects severe but misses moderate damage in our checks. Taken together, LLM debate readily changes what agents say, but we find much weaker evidence that it changes what they persistently endorse or improves the quality of the final answer.
Authors:Chia-Hui Chen, Shih-Ying Yeh, Fu-En Yang, Min-Hung Chen, Shang-Hong Lai
Abstract:
In this paper, we propose ReactVAU, a Slow‑Fast Decoupled Framework for real‑time streaming Video Anomaly Understanding (VAU). Existing VAU methods rely on offline inference with global temporal sampling, which violates causality and prevents deployment in live surveillance streams. Conversely, general streaming video models satisfy causal access but dilute rare transient anomalies during memory compression and often invoke heavyweight MLLMs uniformly over long normal intervals. React VAU addresses this gap with three synergistic components: a lightweight Fast Detection Module based on Spatial Grid Folding (SGF) for continuous anomaly filtering; an Anomaly‑Aware Persistent Memory (AAPM) that protects critical visual cues from temporal decay; and a heavyweight Slow Reasoning Module that remains dormant during normal streams and is awakened only by suspicious events for semantic verification and causal description. Extensive experiments on multiple benchmarks demonstrate that ReactVAU operates under strict streaming constraints while simultaneously achieving competitive performance in both anomaly detection and causal reasoning, alongside significantly enhanced computational efficiency by minimizing heavyweight MLLM invocations. Project page is available at https://huiyuiui.github.io/ReactVAU/
Authors:Syrine Kalleli, Alexei A. Efros, Mathieu Aubry
Abstract:
We address the problem of discovering repeated elements from a single image. In contrast to existing approaches that depend on large annotated datasets, curated multi‑image collections, or object segmentation masks, we show that a single image can suffice to learn a meaningful object model in a completely bottom‑up fashion, without any prior knowledge beyond a coarse scale prior. Our method learns a tunable image‑space prototype of the repeated elements through a reconstruction objective, enabling the model to identify and synthesize consistent object instances within the same image. Experiments on 116 real images from the FSC‑147 dataset demonstrate that our method successfully learns coherent element models and captures intra‑category variation on challenging images. Qualitative results reveal superior reconstructions and interpretable decompositions compared to classical decomposition, joint alignment, and 3D object modeling methods, while maintaining a simple 2D formulation. These results suggest that meaningful object discovery can emerge from single image learning alone.
Authors:Ruoqu Chen, Feixiang Ruan, Liu Cao, Zihao Wang, Botian Xu, Shiqin Tong, Jiajun Liu, Mingzhi Pei, Chenyu Zhang, Wanli Xing, Kaifeng Zhang, Mengdi Xu
Abstract:
Human videos are an abundant source of dexterous manipulation behaviors, but they lack tactile information that is crucial for contact‑rich interaction. This raises a fundamental question: can robots learn deployable visual‑tactile dexterous manipulation policies from human video demonstrations without robot‑side data collection? We present DEX‑X, a framework for learning visual‑tactile dexterous manipulation from human videos through simulation. Our key insight is that simulation can serve as a tactile completion engine. Given monocular human demonstrations, DEX‑X reconstructs hand‑object interactions in simulation, where physically grounded contact dynamics provide tactile supervision unavailable in the original videos. Leveraging this recovered tactile information, we train visual‑tactile dexterous manipulation policies and distill them into deployable policies operating on point‑cloud observations and tactile sensing. We demonstrate zero‑shot sim‑to‑real transfer on a dexterous hand‑arm platform across diverse grasping and contact‑rich tool‑use tasks. The teacher policy achieves 65.9% average success across six task categories in simulation, while the distilled visual‑tactile policy achieves 93% success on real‑world cube picking and 53% on the challenging table‑cleaning task. Zero‑shot generalization to unseen object geometries is also observed on object‑picking tasks. Our results suggest that simulated interaction is a key bridge between human videos and deployable dexterous manipulation policies, providing the missing physical supervision needed for scalable robot skill learning from Internet‑scale human video data.
Authors:Zixiao Gu, Yabo Chen, Xunzhi Xiang, Yu He, Haibin Huang, Chi Zhang, Yunbo Wang, Xuelong Li
Abstract:
Agentic systems can interpret user requests, search the live web, and use external tools, but their ability to transform retrieved web content into a usable 3D world has not been systematically evaluated. No established end‑to‑end pipeline or benchmark exists for this capability. We introduce Search‑to‑World, an end‑to‑end evaluation task covering request understanding, web visual‑content retrieval, and 3D‑world delivery. We define Observed Retrieval Rate (ORR) and World Delivery Rate (WDR) to distinguish observing relevant content from successfully delivering a request‑aligned, perceptually acceptable world. We also present WorldSearcher, a reuse‑then‑reconstruction harness that connects existing search agents to world delivery: it first retrieves reusable 3D worlds and, when none are available, reconstructs a world from video. A structured recovery controller revises temporal grounding, replaces source videos, or reformulates queries after failure. Using WorldSearcher, we benchmark representative models on Search‑to‑World and study supervised fine‑tuning (SFT) for recovery subagents. Results show that delivery depends on the underlying agentic model, and that relevant‑content observation does not ensure world delivery. Jointly training recovery agents improves delivery success and action efficiency. Search‑to‑World makes agentic 3D‑world delivery measurable, while WorldSearcher provides a practical evaluation harness with recovery capabilities.
Authors:Eryk Kulikowski
Abstract:
The same underlying computational problem is solved across unrelated fields under different names: recursive Bayesian state estimation appears as a "Kalman filter" in control, "Bayesian forecasting" in pharmacokinetics, and "data assimilation" in geoscience. Topical and citation‑based scientific embeddings cannot see this shared problem. We distill each paper once into a domain‑ and method‑name‑stripped faceted computational fingerprint, a free‑text mechanism skeleton plus controlled computational facets. We define a tunable, facet‑selectable similarity over it. The goal is solution import: surface cross‑field pairs solving the same problem, so a bespoke implementation can be swapped for another field's standard, specialized solver. On a benchmark of 18 method families across 109 papers, the skeleton lifts cross‑domain retrieval average precision over the abstract from 0.222 to 0.513, and the whole fingerprint reaches 0.557. Strikingly, four trained scientific embedders all fall below plain abstract+TF‑IDF: they encode topical and citation similarity, the wrong signal for this task. The gain is the representation: the abstract‑to‑skeleton swap lifts every embedder, and the pipeline is one cached LLM call per paper plus a cheap embedder. An interventional re‑skin / math‑edit test shows the fingerprint tracks the computation, not the field. On a 501‑paper wild corpus, known twins dominate the top of the ranking (23 of the top 30); with planted pairs excluded from the results, three blind LLM judges rate 3 of the top 5 and 8 of the top 30 pairs genuine import candidates, and 0 of 30 random ones. The human verification is the four executed imports: in one, an open standard solver reproduces a bespoke clinical dosing engine's output. We release the benchmark, the code, and the distillation prompt.
Authors:Benjamin Kapner, Carmel Soceanu, Alicia Petrunin, Hofni Gartner
Abstract:
AI coding agents rely on repository instructions, skills, hooks, tool‑server declarations, and subagent definitions. These artifacts distribute both behavior and access to executable dependencies, making configuration review part of the agent software supply chain. We study 3,171 public GitHub repositories: 2,660 assembled setups and 511 skill collections. Deterministic analysis, mechanical re‑derivation, model‑assisted review, and platform documentation checks identify six categories of configuration exposure and conformance issues. Unpinned MCP package declarations occur in 9.8% of setups, broad execution grants in 2.5%, and broad skill tool preapproval in 3.8%. Their union covers 409 setups (15.4%); among setups with MCP configuration, 24.5% contain an unpinned declaration. Including required‑field and skill‑format issues brings the setup rate to 17.9% and the collection rate to 6.8%. Holding the six categories fixed, contextual review changes the setup rate from 18.3% to 17.9%; rule selection explains most of the reduction from the broader candidate set. The findings identify concrete opportunities to pin dependencies, review execution preapproval, and check component conformance before distribution or use. A documented permission exception also exposes a shared error in the scanner and its mechanical audit, motivating version‑specific semantic checks. The study provides reproducible evidence about repository declarations; runtime harm and detector accuracy against human ground truth remain open questions.
Authors:Qincheng Qiao, Puli Zhang, Jian Zhou, Xinguo Hou
Abstract:
Morphology of the sub‑basal nerve plexus (SNP) reflects peripheral nerve health, and corneal confocal microscopy (CCM) provides an important means for in vivo, real‑time, non‑invasive observation of the SNP. However, mainstream CCM devices offer a limited field of view per frame, whereas the SNP is spatially non‑uniform; discrete image sampling is therefore sensitive to sampling location and frame selection, which limits the reproducibility and clinical adoption of CCM as a quantitative assessment tool. Wide‑field stitching can reconstruct larger SNP mosaics by integrating sequentially acquired CCM images, but existing methods largely rely on offline post‑processing, additional hardware, or specific acquisition protocols, and lack open‑source real‑time solutions for conventional CCM video streams. This paper presents CRISP (Corneal confocal microscopy Real‑time Image Stitching Pipeline), an open‑source real‑time SNP wide‑field stitching framework for conventional CCM examination video streams. CRISP excludes defocused and discontinuous segments via focus‑aware gating, propagates poses through local pairwise registration, and maintains non‑redundant spatial coverage with a sparse anchor map; when local temporal continuity is interrupted, the system completes relocalization and subgraph merging through global appearance retrieval followed by geometric verification. The framework prioritizes low‑latency coverage feedback during examination while outputting accepted frames, poses, and anchor information to initialize offline fine stitching. To our knowledge, CRISP is the first open‑source real‑time SNP wide‑field stitching framework released for conventional CCM video streams. By lowering the barrier to adoption and reproduction of wide‑field stitching, CRISP may help move SNP wide‑field imaging from a research tool into routine clinical examination workflows.
Authors:Jia-Jen Lee, Shih-Yen Hou, Kee Koon Ng, Wei-Chun Wang, Shih-Sheng Chang
Abstract:
Invasive coronary angiography (CAG) is the gold standard for diagnosing coronary artery disease, but interpretation varies substantially among observers. Existing AI systems can improve consistency but lack auditable decision processes and are limited in comprehensive open‑ended assessment, undermining clinician trust and clinical adoption readiness. We developed CARDEA, a unified large vision‑language model that serves as the inference core of a CAG pipeline. It was trained solely on public datasets and closed‑ended tasks in three stages: visual feature alignment, a self‑distilled Chain‑of‑Box (CoB) cold start, and reinforcement learning with verifiable rewards (RLVR) with a CoB reward encouraging bounding‑box use in the reasoning trace. We assessed its two study‑level diagnoses, dominance classification and complexity assessment, against a dedicated classifier and two interventional cardiologists. Report generation was excluded from training and evaluated zero‑shot across stages on an external cohort using vessel‑severity macro‑F_1. CARDEA trailed the classifier on in‑distribution dominance but drew level under domain shift (accuracy, 0.91 [95% confidence interval (CI), 0.86 to 0.95]) and was comparable to the cardiologists on complexity assessment (accuracy, 0.90 [CI, 0.82 to 0.97]). Only RLVR improved zero‑shot report generation, raising its vessel‑severity macro‑F_1 (0.686 [CI, 0.664 to 0.707]) above the untuned base model (0.513) and over twice the always‑normal floor (0.312). CARDEA runs an end‑to‑end CAG pipeline from raw multi‑view videos through keyframe selection to study‑level diagnosis while exposing auditable spatial evidence behind its conclusions. RLVR on verifiable closed‑ended tasks surfaced open‑ended reporting ability that supervised imitation did not. Clinical use requires prospective validation against expert cardiologists.
Authors:Mahmoud Selim, Cristina Cipriani, Karl H. Johansson
Abstract:
Diffusion policies offer a powerful and expressive parameterization for continuous control. Yet, their integration with reinforcement learning remains conceptually and algorithmically challenging. In this work, we address this gap by introducing a noisy‑space action‑value (Q‑)function that assigns values to diffusion latents through the distribution of executed actions induced by the denoising process. We show that this construction admits a precise semantic interpretation and derive a noisy‑space policy gradient (NSPG) that optimizes noisy latents using only clean action‑space value estimates. Building on this result, we formulate a KL‑regularized policy improvement over noisy latents and show that the resulting objective admits a diffusion‑compatible regression form, avoiding backpropagation through the denoising process. Empirical results on state‑based D4RL benchmarks and vision‑based OGBench tasks demonstrate that the proposed noisy‑space objective provides a principled and effective basis for training diffusion policies in offline reinforcement learning. Project webpage: https://mahmoud‑selim.github.io/NSPG/
Authors:Mimo Shirasaka, Haochen Zhang, Yonatan Bisk
Abstract:
Reasoning over language instructions in embodied tasks such as robotics often requires understanding spatial relations from a speaker's situated perspective. Humans infer such perspectives from shared environmental knowledge, activity context, and commonsense. Recent vision‑language models (VLMs) appear capable of spatial reasoning, but their ability to infer a speaker's viewpoint from contextual cues and interpret situated spatial relations from that viewpoint remains unclear. We call this capability contextual observer grounding. To study this capability, we construct the Point‑of‑View Benchmark (POVBench), a dataset of 3D scenes and queries that disentangles Inferred, Stated, and Given forms of observer grounding in natural embodied communication. Given multi‑view observations and a natural‑language sentence, models must localize unseen or underspecified targets from situated spatial and contextual cues. Across state‑of‑the‑art VLMs, localizing targets from directional language remains challenging, even when observer grounding is made explicit. We find that explicit breakdowns of observer‑relative spatial reasoning improve target localization. Our project page is available at https://mimo‑owl.github.io/POVBench/.
Authors:Shuhe Wang, Lachlan Cowley, Eduard Hovy, Jey Han Lau
Abstract:
Steering vectors have rapidly emerged as a popular and effective method for guiding the output of LLMs in very specific ways. But constructing accurate steering vectors is a difficult manual process due to the opacity of embeddings. We introduce Hangman, a novel type of steering vector that operates using word senses, as well as AutoLexSteer, the first fully automated process for building steering vectors. AutoLexSteer employs families of closely‑related words extracted from WordNet to specify both the steering source to be avoided and the desired steering target. The steering vectors are quite precise, can be used to steer at the level of words and sets of word senses (meanings), and are able to steer certain LLM behaviors like sycophancy. The dataset and code can be found at https://github.com/ShuheWang1998/autolexsteer.
Authors:Chengkai Wang, Luoyu Hong, Yiting Zhao, Jiamin Wang, Xiang Feng, Feiwei Qin, Zhenzhong Kuang, Xuefei Yin, Ali Bashashati, Yanming Zhu
Abstract:
High‑resolution volumetric medical imaging is critical for clinical diagnosis, yet acquisition is often limited by scanner hardware, scan time, and for CT, radiation dose. Medical 3D Super‑Resolution (Med3DSR) offers a computational alternative, but existing methods commonly rely on per‑subject optimization, pretrained priors, or coordinate‑based implicit representations, which compromise anatomical fidelity and limit efficiency. To address these limitations, we present MedGSSR, a fully end‑to‑end feed‑forward framework that represents volumes as an explicit 3D Gaussian field for Med3DSR. Unlike coordinate‑based implicit functions, our explicit 3D Gaussian representation naturally enhances signal continuity and local high‑frequency fidelity. Specifically, MedGSSR explicitly decouples the reconstruction process into coarse‑grained structural preservation and fine‑grained textural refinement through the proposed Pyramid Anatomical Encoder and a Hierarchical Gaussian Projector. To support arbitrary‑scale super‑resolution, we introduce sub‑voxel Gaussian decomposition and a Differentiable Gaussian Voxelizer that directly queries the continuous 3D intensity field, reducing discretization artifacts. Extensive experiments on MRI and CT benchmarks demonstrate that MedGSSR significantly outperforms state‑of‑the‑art methods. Notably, our framework exhibits robust generalizability across unseen datasets without requiring per‑subject optimization, enabling fast inference and high‑fidelity volumetric super‑resolution in practical clinical settings. Our project webpage, including code, is at https://william2ai.github.io/medgssr
Authors:Dongyun Lee, Kyungho Yoon, Minwoo Shin
Abstract:
Three‑dimensional bioheat simulation aims to predict transient temperature distributions in biological tissue and is commonly modeled using the Pennes bioheat equation, which combines thermal diffusion, perfusion‑mediated heat loss, and external heat generation. In this study, we consider a controlled 3D Pennes bioheat simulation under a localized heat‑source condition inspired by microwave ablation (MWA). To evaluate neural approximation performance, we compare three neural partial differential equation (PDE) solvers under the same controlled simulation: a spatial Fourier‑feature physics‑informed neural network (PINN), a generic PINNMamba temporal subsequence model, and Pennes Physics‑Informed Mamba (PPIM). PPIM builds on the temporal subsequence model by incorporating conditioned heat‑source input and Pennes‑aware state‑space model (SSM) decay initialization. All three neural models are trained under the same conditions with the same Pennes residual, and an explicit finite‑difference method (FDM) solution is used only as the numerical reference. In a representative 600~s run, PPIM achieved the lowest MAE, relative L_1 error, and relative L_2 error among the evaluated neural solvers. Error maps further showed that the remaining PPIM errors were more concentrated near the heat‑source region than across the rest of the domain. These results indicate that PPIM is effective for approximating the FDM reference final temperature field in this controlled simulation. The source code is available at https://github.com/muvYun/PPIM.
Authors:Jian Ding, Xianjie Dai, Roei Herzig, Nussair Hroub, Jinjie Mai, Dengxin Dai, Bernard Ghanem, Mohamed Elhoseiny
Abstract:
Although highly effective in vision and language domains, applying in‑context learning to robotics remains challenging. Existing autoregressive in‑context imitation methods discretize continuous actions and exacerbate the accumulation of early prediction errors through next‑token prediction, limiting their generalization on unseen task configurations. Meanwhile, flow‑matching policies have been explored for continuous robot control and can help mitigate compounding errors; however, in‑context imitation learning within a flow‑matching framework remains underexplored. To address these limitations, we introduce ContextFlow, a conditional flow‑matching model that learns continuous action distributions for in‑context imitation learning. ContextFlow conditions flow‑based action prediction on demonstrations and observations, enabling robust generation from noisy action distributions. To better encode multimodal in‑context demonstrations, we adapt perceiver‑style multimodal context compressors that distill visual, proprioceptive, and action sequences into compact, task‑relevant latent representations. On LIBERO, ContextFlow outperforms ICRT by 35 percentage points in average success rate on unseen task configurations, while matching the performance of the task‑specific fine‑tuned VLA model π_0 without any fine‑tuning on unseen tasks. On real robots, it generalizes to unseen configurations of both single‑arm and bimanual tasks, achieving 40% success on a new pen‑uncapping configuration. Project Page: https://dingjiansw101.github.io/contextflow‑page/.
Authors:Stefan-Dorian Gavril, Andrei Arhire, Adrian Iftene
Abstract:
Multi‑task biomedical classification requires models to generalize across disparate modalities and class distributions. We study 11 heterogeneous MedMNIST datasets using the harmonic mean of per‑task macro‑F1. We evaluate three backbones with task‑specific linear heads. We identify a resolution domain shift between the MedMNIST API and evaluation environment. Resolving this inconsistency and optimizing architecture‑specific regularization substantially improved performance. Our best configuration, a ConvNeXt‑Tiny backbone with label smoothing, achieved a leaderboard harmonic‑mean macro‑F1 of 0.73294 in the Tensor Reloaded: Multi‑Task MedMNIST competition, ranking sixth at the close of the official competition phase. Our implementation is publicly available at: https://github.com/GavrilStefan‑Dorian/A‑Shared‑Backbone‑Approach‑for‑Multi‑Task‑MedMNIST‑Classification
Authors:Luis Vitor Zerkowski, Luiz Velho
Abstract:
Embodied artificial intelligence has historically very much relied on visual perception, leading to a proliferation of multiple vision‑centric world models. However, this reliance fails to capture spatial understanding in its entirety and can even present vulnerabilities in environments with visual occlusions, low‑light conditions, or blackouts‑scenarios, where acoustic information becomes a critical alternative for spatial awareness and navigation. Despite its potential, research into realistic spatial audio and particularly the development of audio‑centric world models remains sparse. In this technical report, we introduce BinauralVAE: a flexible, open‑source pipeline (https://github.com/Luizerko/BinauralVAE) that explores multiple models for spatialized audio reconstruction, progressing from fundamental baselines to advanced, mathematically grounded architectures. Our approach evaluates various Variational Autoencoder architectures ‑‑ including complex‑valued variants ‑‑ to learn robust latent representations of binaural signals. Developed alongside AudioWorldSim, our methodology leverages realistic acoustic data captured as a simulated robot navigates an environment. This pipeline establishes a foundation for state representation in a future audio‑based world model, designed to map the direct causal connection between navigational actions and their resulting acoustic consequences, and helping to enable sound as an essential complementary modality for spatial knowledge acquisition.
Authors:Gerhard Krumpl, Henning Avenhaus, Horst Possegger
Abstract:
Out‑of‑Distribution (OOD) detection remains a fundamental challenge for neural networks, whose predictions can be overconfident on inputs that deviate from the training distribution. Most post‑hoc OOD detection methods derive scores from a single representation level (eg., logits or penultimate features) or combine multiple layers via depth selection or OOD‑calibrated weighting. However, because OOD shifts are diverse, the most informative representation level can vary strongly across OOD types and domains, making fixed‑layer choices and OOD‑calibrated aggregation brittle. In this paper, we propose PRISM (Projected Representation with Intermediate‑layer Subspace Modeling), a model‑agnostic post‑hoc OOD detection method that models a unified multi‑layer feature representation rather than aggregating independently scored layers. PRISM fuses intermediate and deep features into a single hierarchical embedding, estimates an in‑distribution (ID) principal subspace, and then combines two complementary signals: (i) a class‑conditional Mahalanobis distance in the projected subspace and (ii) the residual energy orthogonal to the learned manifold. This simple design avoids OOD‑tuned layer weighting while capturing both in‑subspace semantic deviations and off‑subspace anomalies. Across diverse benchmarks spanning natural images, medical imaging, and industrial visual inspection, PRISM achieves consistent state‑of‑the‑art cross‑domain OOD detection performance with a single default configuration across all evaluated domains and architectures. We further show that PRISM incurs minimal inference overhead, making it practical for real‑world deployment.
Authors:Jiayou He, Jessica Yao
Abstract:
Near‑Earth Objects (NEOs) can appear as faint streaks in long‑exposure astronomical images. Detecting these streaks across diverse observatories requires methods that remain reliable despite differences in image quality, orientation, sky background, and noise. However, existing detectors are commonly evaluated using data from only one source, providing limited evidence of cross‑source generalization. We introduce NEO‑Bench, a multi‑source benchmark containing 8,376 images from five astronomical‑image datasets. The sources include the Hubble Space Telescope, a Stellina smart telescope, the United Arab Emirates Meteor Monitoring Network, a TETRA1 telescope using a Celestron C14 with Fastar, and the Roboflow Asteroid dataset. We converted the data to a common YOLO format, audited a sample of labels, and defined within‑source and leave‑one‑source‑out evaluation protocols. We evaluated four approaches: Hough, Radon, Gaussian PSF, and YOLO26L. Leave‑one‑source‑out F1 decreased in 14 of 20 image‑level method‑source pairs and 13 of 20 IoU@0.50 localization pairs. Across the datasets categorized as medium or hard, F1 decreased in 11 of 12 image‑level pairs and 9 of 12 localization pairs. These results show that cross‑source performance remains inconsistent and that reliable generalization across astronomical imaging sources remains an open challenge. The benchmark, code, and data are publicly available.
Authors:MaoXun Huang, Zhenxing Zhang, Claire Cardie
Abstract:
Authorship signals matter in settings where writing style carries identity: digital forensics, plagiarism analysis, account linking, misinformation investigation, and machine‑generated text detection. Yet current authorship benchmarks remain fragmented, usually covering only a narrow language set, a single genre, or a limited document‑length regime, which makes it difficult to assess whether modern representations truly generalize. We introduce AuthBench, a large‑scale multilingual benchmark for authorship representation that is designed to make this evaluation broad, standardized, and realistic. AuthBench contains 428,150 documents written by 153,825 individuals across ten widely used languages, 9 primary genres, 66 fine‑grained genres, and four document‑length buckets. It supports two complementary tasks: authorship attribution, formulated as same‑author retrieval and authorship verification, formulated as same‑author binary decision. We benchmark 47 neural models and three non‑neural baselines under a unified zero‑shot protocol. Results show that authorship representation remains far from solved: the best retrieval model reaches only 0.258 Success@5, while the best verification model achieves 0.076 EER and 0.968 ROC‑AUC. The leaderboard also reveals a meaningful task split, with different model families leading retrieval and verification, and large performance differences across languages, genres, and lengths. These findings position AuthBench not only as a new benchmark, but as a diagnostic resource for studying when and why authorship representations succeed or fail. We release AuthBench, its evaluation toolkit, and benchmark data at https://github.com/mao‑code/AuthBench and https://huggingface.co/datasets/MaoXun/AuthBench.
Authors:Yinming Huang, Shuyuan Tu, Xi Yan, Jiahao Zhan, Zihan Yang, Zhen Xing, Hui Zhang, Tiehua Zhang, Yu-Gang Jiang, Zuxuan Wu
Abstract:
Visual generation is evolving from generative models used through a single invocation into agentic control processes that can plan, select tools, inspect intermediate synthesized outputs, revise failures, and reuse prior experience. In most existing systems, the controller is an LLM or VLM, while visual generation models serve as tools or executors. However, existing work lacks a consistent criterion for determining when a generation system becomes agentic. Planning depth, tool use, multi‑role collaboration, and reinforcement learning are often treated as evidence of agenticity, even though none of them necessarily determines which generation decisions the controller can make. We organize the field according to what the controller can directly control in the generation process. At L1 Conditioning Control, the controller prepares the input to a predetermined generator but does not control which visual operation is executed. At L2 Execution Control, it selects and invokes actual generation, editing, rendering, or other content‑modifying operations. At L3 Outcome‑Adaptive Control, it observes an intermediate outcome and uses that observation to change a subsequent operation within the current task. At L4 Experience‑Adaptive Control, it retains experience from completed tasks and uses that experience to change decisions on future tasks. L0 Fixed Support separately denotes generators, editors, evaluators, reward models, benchmarks, and fixed pipelines without a deployed controller that makes generation‑level decisions. These levels describe a progressively broader decision‑making scope rather than model size, system complexity, output quality, tool or role count, or training method. Applying this framework across image, video, editing, 3D, world, slide, and user‑interface generation reveals how controller capabilities have evolved and how their mechanisms are distributed across levels.
Authors:Wei Sun, Tingyu Qu, Jesse Davis, Marie-Francine Moens
Abstract:
Temporal relation extraction determines whether an event occurs before, after, or simultaneously with another event, and therefore relies on accurately modeling how the two events interact. Mainstream systems achieve this by concatenating event spans or using shallow fusion, which works well when all model parameters are trainable. However, in parameter‑efficient fine‑tuning, low‑rank bottlenecks restrict information flow and prevent these interaction signals from passing through, leading to clear performance drops. To address this limitation, we propose a theoretically grounded architecture, Convolutional Bottleneck Interaction (CBI), which first applies lightweight depthwise convolution to enhance event representations and then uses element‑wise multiplication to capture effective event‑event interactions inside the bottleneck. Across five datasets and seven backbone models in the Adapter and LoRA settings, CBI provides consistent and substantial gains, up to +31.7 micro F1, while adding minimal computational cost, showing that explicit interaction inside low‑rank spaces is crucial for temporal relation extraction. The code is available at https://github.com/VRCMF/CIF.git.
Authors:Johannes Weidenfeller, Shaofei Wang, Philipp Fürnstahl, Siyu Tang
Abstract:
Meshes remain the most practical representation for geometry reasoning and integration into graphics pipelines, yet existing reconstruction methods struggle to produce high‑quality meshes. Most state‑of‑the‑art approaches initially learn an intermediate representation (NeRF/3DGS) and treat mesh extraction as a post‑processing step, which often leads to oversmoothed surfaces or poor quality meshes with excessive triangle counts.Existing mesh‑native optimization methods alleviate some of these issues but suffer from fixed‑resolution discretizations and unstable optimization behavior. In this paper, we introduce an adaptive mesh‑based optimization framework and a practical mesh rendering technique to address these challenges. Our representation combines an optimizable Delaunay‑triangulated tetrahedral grid with a multi‑resolution hash grid. The former is refined through point pruning and insertion, while the latter provides latent features for SDF/appearance value predictions. We use volumetric rendering to bootstrap a coarse geometry while leveraging mesh‑based rendering for recovering fine‑grained details. Additionally, we propose a differentiable, rasterization‑based depth‑offset rendering formulation, reducing geometric artifacts and improving reconstruction quality. Our method significantly outperforms existing mesh optimization approaches across a variety of object‑centric benchmarks while being competitive with state‑of‑the‑art NeRF/3DGS methods.
Authors:Hangyu Qin, Junbin Xiao, Shenglang Zhang, Angela Yao
Abstract:
AI companions are envisioned as always‑on assistants that support users in daily life. With this regard, we introduce BuddyVQA, a benchmark for companion‑style question answering (QA) on egocentric streaming video. BuddyVQA contains 21.6K questions linked to 6K highlight moments across 1,012 long, egocentric videos. It features two key characteristics that are common in daily first‑person QA assistance but are largely overlooked in existing VideoQA benchmarks: ego‑deictic expressions and interactively chained questions (e.g., "Where is it?", "How to get there?"). These require models to infer a user's in‑situation intent by resolving visual pronouns in the context of egocentric visual and QA contents, with both grounded in a long‑form streaming setting. To tackle the challenges, we propose MyBuddy, a companion‑style QA assistant that highlights a multimodal chain‑of‑thought reasoning mechanism to infer the final answer based on the historical QA and visual content. An additional question filter and multi‑level memory are designed to facilitate efficient QA and visual information retrieval under streaming QA settings. Experiments show that MyBuddy significantly enhances the performance of foundation models on BuddyVQA. Moreover, these gains generalize to other streaming and common video QA benchmarks, demonstrating the applicability and effectiveness of our approach. Our code and dataset are available at https://github.com/QHUni/BuddyVQA
Authors:Zhangchen Ye, Enxuan Ruan, Yifei Bao, Runhan Huang, Jiankun Yang, Jiakang Jin, Yixiao Huo, Pengyuan Wang, Yinan Han, Huaxing Huang, Wenhao Cui, Yiming Li, Xiaoyu Tian
Abstract:
Humanoid soccer is a challenging testbed for dynamic whole‑body control, requiring robots to coordinate balance, locomotion, object interaction, and skill switching over long horizons. Existing humanoid sports methods often rely on task‑specific multi‑stage pipelines, making it difficult to jointly learn and compose multiple object‑interactive skills within a single deployable policy. To address this, we present SkillX, a unified reinforcement learning framework that learns and composes multiple atomic soccer skills through a single command‑conditioned policy. SkillX integrates three core designs: skill‑specific adversarial motion priors, skill‑specific critics, and an object‑aware temporal encoder, enabling the robot to execute atomic skills and transition among them such as dribbling, trapping, and shooting. Experiments in simulation and on a real Noetix E1 humanoid demonstrate robust multi‑skill execution, long‑horizon skill composition, and successful sim‑to‑real deployment.
Authors:Afshin Khadangi
Abstract:
The contemporary debate over machine consciousness begins from a concealed assumption: that the object called "AI" already constitutes the kind of entity to which consciousness could belong. This paper challenges that assumption by separating phenomenal consciousness, introspective report, and human projective introspection, then arguing that generative systems can return linguistic traces of human interiority in first‑person form without thereby identifying a phenomenal bearer. We call the resulting inference the AI Consciousness Fallacy. We then introduce Causal Liability Theory (CLT). CLT‑I proposes liability closure as a criterion for individuating a candidate bearer: a physically continuing process becomes the non‑delegable inheritor of constraints generated by its own endogenous discriminations. CLT‑II advances the stronger conjecture that liability closure is necessary and sufficient for minimal phenomenal subjecthood. An open‑weight causal audit operationalizes CLT‑I across multiple model families. Forced discriminations produced persistent downstream divergence; activation patching showed strong causal mediation; live and copied adaptive states were behaviorally identical under matched randomness; and detached reconstruction preserved computational state across process replacement while, by protocol, breaking constitutive continuity and non‑delegable inheritance. These results show that CLT‑I distinctions are experimentally tractable and can dissociate causal bearer structure from first‑person performance. The framework therefore separates consciousness attribution, causal bearer individuation, and the independent metaphysical question of consciousness constitution.
Authors:V Venktesh, Cem levi, Avishek Anand
Abstract:
The In‑context learning (ICL) paradigm aids large language models (LLMs) to adapt to new tasks without need for fine‑tuning. However, selecting an optimal combination of demonstration examples from a large pool of example subsets is a challenging problem. Existing approaches for selection do not model the complex relationship between ICL samples and downstream LLM performance. They typically perform static task‑level selection, choosing subsets once offline, which can fail to generalize to unseen queries. We introduce DearICL (Data Efficient Algorithm for Ranking) ICL samples, a new framework that models demonstration example selection as a subset ranking problem. DearICL employs a non‑linear surrogate employing a differentiable sorting objective within a gap‑index bandit algorithm. The gap‑index based approach enables fine‑grained separation of good arms and borderline arms, which is used as an auxiliary objective to train the non‑linear surrogate through sufficient sampling of borderline arms, supporting instance‑level subset ranking. On exemplar selection benchmarks with open‑source LLMs, DearICL achieves 8.08‑15.9% accuracy gains over strong linear bandit baselines, with low sample complexity. Code and data: https://github.com/VenkteshV/DearICL.
Authors:Mingwei Li, Yi Yang, Hehe Fan
Abstract:
Diffusion‑based models enable monocular geometry estimation, yet their pixel‑space precision is limited by a shared, under‑studied error source: VAE reconstruction degradation. The 8x spatial compression in the VAE encoder‑decoder degrades surface normals at object boundaries; even encoding and decoding ground‑truth normals introduces 1.3‑‑8.5° of mean angular error (MAE), with edge MAE reaching 2.8x the global MAE. We present TransNormal‑2, a FLUX.2‑based rectified‑flow framework with single‑step deterministic inference that addresses this degradation on both sides of the VAE decoder: in how latent predictions are supervised during training, and in how decoded normals are corrected at inference. First, geometry‑aware pixel‑space losses, including inverse rendering self‑consistency, von~Mises‑Fisher angular loss, and wavelet edge‑aware regularization, complement latent MSE by enforcing spherical normal geometry and diffuse image‑formation cues after VAE decoding. Second, a lightweight Geometric Refinement Module (GRM) applies an RGB‑guided residual correction to reduce boundary‑localized decoding errors without freely rewriting the coarse prediction. On general‑scene benchmarks, TransNormal‑2 matches or exceeds MoGe‑2 on all eight reported metrics while using only 1.4% as many task‑specific normal annotations. The gains are clearest for transparent objects, reducing MAE by 4.2° on ClearGrasp and 3.1° on ClearPose over the strongest prior baselines. Code will be released at https://longxiang‑ai.github.io/TransNormal‑2.
Authors:Zhiyin Tan, Changxu Duan
Abstract:
Research teams and organizations often explore unfamiliar free‑text collections, from survey comments and reviews to reports and domain documents, before labels, queries or coding schemes exist. At this stage, the first thematic map shapes what users notice, prioritize and carry into downstream analysis, so it should be trusted only insofar as it can be verified. Existing options force a trade‑off between scale and verifiability. Qualitative coding preserves evidence but is slow. Search presupposes a query. Clustering and topic models scale but produce labels users must interpret. One‑shot large language model (LLM) summaries are fluent yet difficult to reproduce or audit. We present EviMap, an interactive system providing researchers and practitioners with an auditable thematic overview of such corpora. Guided by model‑generated context describing the corpus and hypothesized stakeholder concerns, EviMap extracts within‑document evidence phrases and organizes them, rather than whole documents, into a three‑level map of aspects, groups and fine‑grained topics. Embedding‑based clustering narrows the search space for finer semantic judgments by the LLM. Each node traces back to supporting phrase spans, so documents link to topics through evidence they contain and users can audit labels against the original text. Users can start from a top‑level corpus map, drill into topics, inspect highlighted evidence in original documents, and combine two topics to find documents discussing both. We demonstrate this workflow across six heterogeneous corpora spanning 2,108 to 101,699 documents, with a comparison against flat and hierarchical LLM baselines. By grounding every label in verbatim source spans, EviMap makes a topic map not just readable, but verifiable. Code, demo video, and interactive dashboard are available at https://github.com/zhiyintan/EviMap.
Authors:Yan Ma, Jiadi Su, Zhulin Hu, Ethan Chern, Linhao Zhang, Tiantian Mi, Pengfei Liu
Abstract:
Video foundation models increasingly rely on large‑scale pretraining data, yet the end‑to‑end data pipelines behind them remain largely closed and difficult to inspect or reuse. Researchers seeking to understand how video data recipes affect model pretraining often need to build substantial infrastructure before testing even a focused hypothesis. We present VIDAFORGE, an open research infrastructure that represents a video data recipe as an executable five‑stage workflow from raw videos to training datasets. A decision in this workflow can be varied to construct alternative datasets while preserving how every sample was produced. To demon strate this research workflow, we compare data recipes with different coverage and quality in early from‑scratch pretraining of Wan 2.1 and V‑JEPA 2.1. Across both learning objectives, the broader‑coverage recipe achieves the highest downstream benchmark scores, while loss‑based evaluation favors different recipes. This study demonstrates how VidaForge connects data‑recipe choices to downstream model performance. We further release VIDAFORGE‑3M, containing 3.14 million scene level clips totaling 6,475 hours, with fine‑grained annotations and curation signals for video data‑recipe research.
Authors:Eyal Hanania, Daniel Arkushin, Naveh Ayal, Jonathan Benvenisti, Amos Bercovich, Elie Zemmour, Sahar Froim
Abstract:
Annotators routinely disagree on laughter boundaries and subtle chuckles, yet temporal laughter localization typically evaluates against a single reference annotation. We show that this disagreement is structured rather than random noise. Re‑annotating the SMILE‑Temporal benchmark (672 videos, 1,683 events) with 3‑5 annotators per video (alpha = 0.757), we find systematic patterns: disagreement is 1.73 times larger at offsets than onsets, far more common for chuckles than full laughs (77% vs. 20%), and predictable from event attributes (AUC = 0.831). Evaluating against a single annotator breaks down under this structure: system scores shift by 0.246 F1 depending on the chosen ground truth, correctly ranking systems only 69.7% of the time (vs. 80% against all annotators). We propose a disagreement‑calibrated evaluation that scores predictions against the full annotator distribution using conformally calibrated tolerance bands (wider at offsets, 0.727s, than onsets, 0.5s). The per‑annotator annotations and analysis code are available at https://github.com/WSCSports/MTLLFM‑temporal‑laughter‑localization.
Authors:Haobin Chen, Ao Chang, Heqin Zhu, Rundong Wang, Ting Liu, Shaohua Kevin Zhou
Abstract:
All‑in‑one medical image restoration seeks to recover heterogeneous clinical images with a single model, but PET, CT, and MRI differ substantially in degradation statistics, anatomical contrast, and output‑space bias. A fully shared network can entangle modality‑specific residual errors, whereas separate modality‑specific networks sacrifice the practical advantages of unified deployment. We therefore recast all‑in‑one restoration as a question of where limited adaptation should be placed: policy selection, feature execution, or output calibration. We propose MARR, a compact restoration framework that constrains multi‑modality adaptation into degradation‑aware policy routing, modality‑private residual execution, and image‑domain residual correction without requiring degradation labels or separate modality‑specific models. The policy branch forms a routing prompt from input statistics, latent content, and modality identity, and uses it only as a control signal. Prompt‑gated modality‑private adapters then perform lightweight residual refinement at intermediate decoder stages, while zero‑initialized modality‑specific output heads calibrate the final image‑domain residual without perturbing the initial shared prediction. On an all‑in‑one PET, CT, and MRI restoration benchmark, MARR outperforms thirteen methods re‑trained under the same protocol, achieving PSNR values of 37.34 dB, 33.85 dB, and 32.09 dB on PET, CT, and MRI, respectively, and the best modality‑average PSNR of 34.43 dB. The code is publicly available at https://github.com/CHB‑learner/MARR.
Authors:Vladimir Iglovikov
Abstract:
An image‑augmentation pipeline must deliver a complete batch before a model can use it. We compare seven input paths from five libraries, starting with RGB JPEG files and ending with a synchronized CUDA float16 batch. We manually matched transformation recipes and parameters across libraries to make the workloads as comparable as possible. The experiment uses 57 selected recipes, a batch size of 256, and one NVIDIA L4 machine. Throughput and peak process GPU memory are recorded together in 759 measurements. On the 11 recipes shared by all paths, DALI and AlbumentationsX have median throughputs of 5,029 and 4,679 images/s, with median peak GPU memory of 2,086 and 1,852 MiB. Broader pairwise comparisons favor AlbumentationsX on 26/26 TorchVision recipes, 50/51 Kornia recipes, and 25/26 Pillow recipes. DALI is faster than AlbumentationsX on all 22 shared recipes, with a median throughput ratio of 1.18x. A separate census reports coverage of the 118 entries in a selected AlbumentationsX RGB catalog. The study measures input preparation at fixed settings; it does not measure model training, numerical equivalence, or the best attainable configuration of each library. Benchmark code: https://github.com/albumentations‑team/benchmark.
Authors:Haoxiang Huang, Zhekai Wang, Xiang Liu, Sen Cui, Changshui Zhang
Abstract:
Object‑centric video models represent scenes with slots, yet exposed geometry can vary in meaning with appearance. In Invariant Slot Attention (ISA), explicit position and scale can disagree with the decoded center and extent; edits can yield unexpected motion or resizing, and replacing appearance can shift geometry. GeoCo‑SAVi promotes geometric authority and semantic alignment. Its spatially equivariant, object‑wise decoder makes position and scale effective commands: changing them moves or resizes the rendered support. Factual position alignment ties position to the decoded center, and normalized attention overlap discourages duplicate allocation. Appearance transplantation aligns geometry semantics across objects, so recipient geometry governs layout while donor appearance supplies shape. A temporal initializer propagates calibrated slots across frames. On Obj3D, GeoCo‑SAVi matches ISA reconstruction, reduces p‑centroid error by over 80%, and cuts appearance‑induced size variation by over 50% while producing the expected translation and scale responses. On 250 MOVi‑C videos, it also improves reconstruction, instance grouping, and fixed‑identity geometry control over two same‑protocol references. GeoCo‑SAVi transforms explicit geometry into compositional control, making both position and scale more readable and editable.
Authors:Haiyan Wei, Yunlong Wang, Huaibo Huang, Zhenan Sun, Kunbo Zhang
Abstract:
In recent years, diffusion stochastic differential equation (SDE) inversion and inversion‑free methods have become prevalent for training‑free image editing, as they can achieve faithful reconstruction without tuning. However, existing approaches remain inefficient, exhibit limited plasticity, and struggle to accurately preserve unedited regions. To address these issues, we propose MIEdit, a training‑free editing framework based on SDE inversion. MIEdit introduces a predictor‑corrector multi‑history‑step scheme to achieve superior editing quality with fewer steps. We further mitigate heterogeneity and conflict between the multi‑conditioned noise residuals and gradient terms during sampling, improving stability and editing plasticity under large edits. MIEdit also includes Inversion‑Time Automatic Semantic Angle Masking (IASM); it leverages classifier‑free guidance to automatically generate semantic angle masks during inversion and applies them throughout the sampling process for regional constraints, without extra user inputs. We additionally construct EditEval++ (30 fine‑grained tasks, 1,000+ image‑text‑mask triplets) for comprehensive evaluation; experiments show that MIEdit outperforms state‑of‑the‑art techniques. Project page: https://whywwwzzzg.github.io/MIEdit/.
Authors:Wajdi Ben Saad, Safa Madiouni
Abstract:
Choosing when to translate multilingual documents is a central routing problem in text classification: translation can improve predictions for some languages while degrading others or adding unnecessary computation. Uniform translation and heuristic language tiers do not provide statistically controlled route selection. We introduce a language‑level router based on paired e‑processes that continuously compares direct and translation‑assisted classification before freezing a routing policy. A familywise‑controlled threshold of 280 bounds the probability of any false route across 14 eligible languages per dataset by 0.05. On SIB‑200 and MASSIVE, the router selects translation for 4 of 15 languages and 14 of 15 locales, improving held‑out accuracy over direct classification by 8.14 and 16.70 percentage points, respectively. All 28 decisions remain stable across 50 outcome‑independent orderings and relative to the per‑group threshold. Our results demonstrate that paired e‑processes enable statistically controlled, anytime‑valid, and auditable multilingual classification routing.
Authors:Jianan Li, Xiao Chen, Tien-Tsin Wong
Abstract:
Developing unified physics‑based humanoid controllers that can navigate complex 3D scenes and manipulate objects remains a longstanding challenge. Existing approaches are often specialized for either locomotion or object‑centric manipulation, or rely on task‑specific reward engineering that does not scale well across diverse behaviors. We present CHIP, a unified, physics‑grounded framework for learning reusable humanoid interaction skills from heterogeneous motion data. Central to our approach is a conditional interaction prior that models a context‑dependent distribution over these skills within a shared discrete space. Our method is trained in three stages. We first learn physics‑based motion‑imitation policies that acquire grounded teacher behaviors from heterogeneous interaction data. We then distill these behaviors into a context‑conditioned interaction prior that captures reusable motion structure across locomotion and manipulation. Finally, we initialize downstream task policies from the pretrained prior and adapt them through prior‑regularized online RL post‑training. Experiments on a diverse suite of humanoid interaction tasks show that our approach supports scene‑aware locomotion, contact‑rich object manipulation, and compositional behaviors such as environment‑aware object transport and long‑horizon skill sequencing, while producing smooth transitions and physically plausible motion.
Authors:Jingtao Lei, Hongji Li, Dexiang Shu
Abstract:
Mixture of Prompt Experts (MoPE) adapts multimodal transformers through input‑dependent prompt composition, while retaining a fixed prompt length. We investigate a layer‑wise gating extension in a binary chest X‑ray classification pilot study. The controller predicts a retention ratio for each sample, averages these ratios within a mini‑batch, and uses the resulting integer length to truncate the static and mixed visual prompts. Retained mixed prompts are also scaled by the individual ratios. In one recorded run per configuration, the gated model reached a best validation accuracy of 0.8996, compared with 0.8969 for the fixed‑length baseline; the corresponding final values were 0.8963 and 0.8802. The exported gate statistics imply a retained length of one at all recorded training points, relative to a configured maximum of six. This reduces the complete visual sequence from 210 to 200 tokens, but no direct runtime measurements establish an acceleration benefit. Report‑derived labels, report text as input, sequential data partitioning, and the absence of repeated controlled experiments limit interpretation. The findings document prompt shortening under the configured gate penalty; they do not establish sample‑specific length allocation, superiority over fixed short prompts, or clinical utility. Code is available at: https://github.com/jingtaolei/mope‑dynamic‑prompt‑truncation.
Authors:Yijie Zhu, Zitong Yu, Wei Li, Hui Ma, Wen Li, Rui Shao, Liqiang Nie
Abstract:
World Action Models (WAMs) extend Vision‑Language‑Action (VLA) models by incorporating future visual dynamics into action generation. However, existing WAMs often utilize imagined futures with limited adaptation to evolving execution progress, potentially introducing distracting or unreliable predictive cues. This limitation arises from two empirically identified forms of non‑uniformity in future utility: (i) at the inter‑progress level, the utility of imagined futures varies across execution stages as control demands change; and (ii) at the intra‑progress level, individual future latents exhibit heterogeneous relevance within the same progress state. To address these limitations, we propose ProWAM, a Progress‑Conditioned World Action Model that introduces execution progress as an explicit intermediate representation for adaptive imagination utilization. ProWAM comprises two tightly coupled components: (1) To obtain a reliable representation of execution progress, we propose the Self‑Supervised Dual‑Temporal Progress Encoder (SS‑DTPE). SS‑DTPE couples short‑term action‑observation interaction modeling with long‑term recurrent progress aggregation to capture recent execution feedback and accumulated task history. (2) Conditioned on the progress representation from SS‑DTPE, we propose the Hierarchical Progress‑Conditioned Imagination Modulation (HPIM) to adapt imagination utilization to execution progress. HPIM operates at two complementary levels: an inter‑progress global modulation mechanism adapts future utilization across execution stages, while an intra‑progress relevance mechanism differentiates individual future latents within each progress state. Extensive experiments demonstrate consistent gains over strong VLA and WAM baselines.
Authors:Hwang Yechan, Bae Sangjun, Kim Jeongmo, Bang Sangwoo, Han Seungyul
Abstract:
Social deduction games (SDGs) require agents to reason under partial observability by maintaining relational beliefs about hidden roles and team alignments. While recent LLM‑agent approaches improve gameplay through prompting and preference optimization, they often optimize actions and in‑game speech without explicitly grounding them in such beliefs. This frequently leads to strategically inconsistent behavior, especially for compact LLM agents. We introduce Multi‑Agent Relational Belief Optimization (MARBO), a belief‑grounded preference optimization framework that leverages relational beliefs to guide strategic decisions and in‑game speech. MARBO provides preference feedback only when behaviors are supported by reliable relational beliefs and lead to strategically favorable social outcomes, encouraging more consistent learning under uncertainty. Experiments on representative SDGs show that MARBO enables compact LLM agents to consistently outperform existing baselines. The Code is available on https://github.com/PleaseTakemeAway/MARBO.
Authors:Sai Siddharth, Maniarasu Ravi
Abstract:
Although machine learning can be used to predict the evolution of physical systems from data, a formulation that learns only the system state at each time leaves the temporal and dynamical structure of the solution to be resolved within a broad hypothesis space. We introduce Learning^2, a representation‑level framework that structures this space by coupling a primary representation to a second representation through a known physical transformation. The resulting cross‑representation constraint restricts the effective hypothesis space and provides an ante‑hoc, physically interpretable criterion for excluding solutions that satisfy the primary representation alone. We instantiate Learning^2 through EuLaNet, an Eulerian‑‑Lagrangian representation for fluid dynamics. Given the velocity state u(\mathbfx,t), EuLaNet constructs its induced Lagrangian flow map X(\mathbfa,t) through \dotX(\mathbfa,t)=u(X(\mathbfa,t),t), from which material transport and finite‑time deformation are derived. The resulting representation couples the predicted state to the dynamical consequences it induces, providing a second consistency criterion beyond state‑level agreement. We formalize this construction through an effective hypothesis space \mathcalH_L^2\subseteq\mathcalH and define the conditions under which a consequence representation provides discriminative constraints on candidate solutions. EuLaNet is implemented as a model‑independent representation module, separating the physical constraint from the downstream learning architecture. This construction provides an ante‑hoc mechanism for physically interpretable constraint in scientific learning and offers a basis for developing and evaluating broader classes of Learning^2 architectures. The implementation is open‑sourced to support the development and extension of the architecture across scientific domains.
Authors:Seokhyeon Hong, Chaelin Kim, Inseo Jang, Soojin Choi, Junyong Noh
Abstract:
Motion retargeting aims to transfer a source motion to target characters with different skeletal structures, proportions, and body shapes. Although recent neural retargeting methods have improved flexibility across diverse skeletons, target‑side geometric artifacts such as self‑penetration remain difficult to resolve. Specifically, existing geometry‑aware approaches often rely on fixed skeleton templates or implicit geometry‑conditioned prediction, requiring a single network to account for target geometry deformation, detect target‑side artifacts, and predict the corresponding correction from target geometry alone, which limits their ability to generalize across diverse skeleton structures and body shapes. In this paper, we present a geometry‑aware motion retargeting framework that explicitly connects artifacts observed in the posed character geometry to motion refinement while preserving the flexibility of skeleton‑agnostic neural retargeting. Our method first learns a motion embedding shared across different skeletons using a transformer‑based retargeting autoencoder that transfers motion across arbitrary source‑‑target skeleton pairs. Building on this kinematic motion prior, we introduce an artifact‑driven refinement module that observes self‑penetration on the posed target mesh and converts it into a corrective cue through a motion‑to‑vertex Jacobian. We further condition motion decoding on target geometry using skinning weight‑based joint‑aligned geometry features derived from the rest pose mesh. This design combines explicit target‑side artifact reasoning with flexible geometry‑aware decoding in a unified framework. Experiments on both fixed and arbitrary skeleton structure settings show that our method improves kinematic retargeting accuracy and reduces geometric artifacts, producing plausible motions across seen and unseen target characters.
Authors:Chen Wang, Wenzhao Wu, Hyojin Kim, Jae-Sung Yeom
Abstract:
Distributed DL training on HPC systems often shares one network fabric between NCCL/RCCL collective communication and parallel‑filesystem I/O. Using a real GNN training workload on a Slingshot‑11 system, we show that this sharing imposes two distinct costs. The primary cost is heavy‑tailed DataLoader stalls: the typical DataLoader wait is just 15 ms at steady state, yet spikes to multiple seconds in 28% of Lustre iterations and 12% of VAST iterations. The secondary cost is traffic‑class contention on collective communication: Lustre I/O stalls the all‑reduce by up to 145× in an isolated benchmark. The two costs arise from different mechanisms. I/O stall latency affects any storage path that traverses the shared fabric, whereas all‑reduce network contention occurs only when storage and collective communication share the same traffic class. Their common root cause is that storage I/O traverses the shared fabric. This work shows that node‑local NVMe staging via DYAD (Our code is publicly available at https://github.com/flux‑framework/dyad) eliminates both effects by keeping storage I/O off that path. Across a full training epoch, DYAD achieves a 7.4 times speedup over direct Lustre reads and a 1.06 times speedup over VAST. By the second epoch, once the local cache is fully warmed, DataLoader stalls are eliminated entirely, allowing DYAD to reach a 1.31 times speedup over VAST.
Authors:Yizhou Tian, Zizhe Chen, Shiyuan Deng, Garry Yang, Zijie Dai, Luohao Pan, Hao Lin, Peiqi Yin, Xiao Yan, James Cheng
Abstract:
Memory facilitates question answering over long videos by extracting and retrieving facts to fit within the limited context windows of multimodal LLMs (MLLMs). Existing solutions typically extract independent memory entries from fixed‑length video clips and thus cannot capture high‑level semantics that need to be summarized over extended time periods, such as character traits and relations. Moreover, they rely solely on similarity‑based retrieval and may fail to retrieve the fine‑grained details required for question answering. To tackle these problems, we propose CAM, featuring continuous extraction for high‑level semantics and adaptive querying for fine‑grained details. In particular, CAM stores the entities and relations extracted from video clips in a knowledge graph. To capture the high‑level semantics of each entity or relation, CAM summarizes the local subgraph of the target entity or relation once the subgraph reaches a predefined size. To retrieve the fine‑grained details required for question answering, CAM supports multiple search methods, including knowledge graph traversal, video re‑watching, and audio listening. It utilizes a planner‑executor‑verifier pipeline to adaptively compose these search methods according to question intent. Evaluations on three benchmarks show that CAM outperforms SOTA baselines and improves their accuracy by up to 23 percentage points. Code is available at https://github.com/Jake‑Tian/CAM.
Authors:Xiaoran Kou, Jingyi Wu, Peng Sun, Yang Liu, Hong Chen
Abstract:
Multimodal sentiment analysis requires effective modeling of both verbal semantics and non‑verbal affective cues. A central challenge is to calibrate text‑centered sentiment understanding with visual facial evidence in a controlled, adaptive, and parameter‑efficient manner. Text usually serves as the semantic anchor, whereas visual cues provide complementary evidence for ambiguous or implicit expressions; however, indiscriminate fusion may introduce visual noise and distort textual semantics. Moreover, fully fine‑tuning large visual and textual encoders is costly and prone to overfitting on limited and scenario‑dependent MSA benchmarks. To address these issues, we propose Vision‑Guided Text Prompt Tuning (VG‑TPT), which formulates visual‑text sentiment modeling as controllable visual calibration of frozen text representations. VG‑TPT injects visual affective cues into a frozen BERT encoder through layer‑wise adaptive prompts, rather than relying on late‑stage feature fusion or full backbone tuning. A co‑guided router composes prompts from a trainable prompt bank according to both the evolving text state and the visual guidance feature, enabling sample‑specific and layer‑specific modulation. Experiments on CMU‑MOSEI and CMU‑MOSI show that VG‑TPT consistently improves over text‑only baselines and achieves competitive or superior performance compared with several full‑modality methods, while updating only 2.4M trainable parameters. The code is available at https://github.com/ma‑tubu/VG‑TPT.
Authors:Shubhashis Roy Dipta, Sourajit Saha, Shaswati Saha, Nobin Sarwar
Abstract:
Recursive Super‑Resolution (SR) extends fixed‑scale SR to extreme magnification by repeatedly feeding predictions back into the same model, analogous to zooming an image repeatedly. However, ground truth availability at every scale, especially at depth, remains challenging as the required source resolution grows geometrically, leaving deeper predictions unsupervised. We present OracleZoom, an on‑policy distillation‑inspired, reference‑constrained framework that trains on its trajectory while carrying the last ground‑truth evidence beyond the supervision boundary. Direct and cross‑scale supervision constrain verifiable content, while a no‑reference quality objective guides unresolved fine‑scale detail. A KL‑constrained pretrained latent prior limits quality‑driven drift, while EMA consistency stabilizes the supervision boundary. Across seven datasets, OracleZoom achieves the state‑of‑the‑art SR quality across zooming scales, averaging 0.713 CLIPIQA, with larger gains on deeper scales, while significantly reducing hallucinations. Code, data, and models are available at https://dipta007.github.io/OracleZoom/ .
Authors:Shiqi Pan, Qi Zheng, Hanqin Sun, Youjian Zhang, Daquan Feng, Xu Wang
Abstract:
Vision‑and‑Language Navigation in Continuous Environments (VLN‑CE) requires an embodied agent to navigate unseen environments by following natural language instructions. Current zero‑shot VLN‑CE methods either rely on pre‑trained waypoint predictors or require multiple queries to large models per step. To address prohibitive inference latency and computational overhead, we propose O2C‑Nav, an efficient zero‑shot navigation framework that calls only a single large model once per decision step. Our approach introduces a training‑free structured waypoint generator and a novel abstract representation that projects sparse, history‑aware candidate waypoints directly onto RGB images as visual markers. The MLLM selects a waypoint or generates a fallback target bounding box at each step, while a low‑level Fast Marching Method (FMM) planner converts the selected target into an executable collision‑free path. This paradigm provides the model with concrete spatial perception and explicit memory while significantly reducing the visual processing load. Extensive evaluations on the R2R‑CE and RxR‑CE benchmarks demonstrate that O2C‑Nav outperforms current state‑of‑the‑art zero‑shot methods, highlighting its great potential for real‑time robotic deployment. Code is available at https://github.com/kkpsq/O2C‑Nav‑Code.
Authors:Xiao Zhang, Wang Zeng, Sheng Jin, Wentao Liu, Chen Qian, Shichao Kan
Abstract:
Large vision‑language models (LVLMs) have recently achieved remarkable progress in general‑purpose video understanding. However, their application to surveillance videos remains challenging due to the lack of large‑scale domain‑specific datasets and the limitation of passive observation from fixed viewpoints. In surveillance scenarios, critical visual evidence can be easily missed when targets are distant, small, occluded, or move beyond the current camera view. In this work, we introduce CamVLM, a new framework for Thinking with Cameras, which enables LVLMs to actively acquire visual evidence through dynamic viewpoint control rather than passively analyzing fixed video streams. We first construct CCTV‑Anomaly, a large‑scale surveillance video understanding dataset containing 14,459 videos across 10 anomaly categories, with detailed captions and event annotations. We further formulate viewpoint control as an active visual perception problem and build CamTrack‑53K, an object‑centric viewpoint trajectory dataset for learning camera actions. Moreover, we propose a reinforcement learning based viewpoint policy optimization framework, which models camera control as a sequential decision‑making process and learns long‑horizon observation strategies beyond supervised trajectory imitation. Extensive experiments demonstrate that CamVLM achieves state‑of‑the‑art performance under both passive observation and dynamic viewpoint settings, validating the effectiveness of active camera‑based reasoning for surveillance video understanding. Our datasets, model, and code will be available at https://github.com/xiaozhang79/CamVLM .
Authors:Mirza Samad Ahmed Baig, Syeda Anshrah Gillani, Abdul Akbar Khan, Muhammad Omer Khan
Abstract:
Randomized benchmarking can hide classical temporal correlations because its Clifford‑twirled response is even in the noise phase. For a stationary symmetric telegraph fluctuator, we show that continuous evolution and independent stationary resets at slot boundaries yield identical mean responses for arbitrary fixed idle modulations. We construct an eight‑setting phase‑cycle measurement of the connected sine‑phase covariance under ideal Clifford twirling and classical idle dephasing. This observable vanishes for independent slot noise and fixed detuning without a weak‑phase or Gaussian approximation. A closed telegraph response, independent circuit calculations and 800 simulation trials validate the construction and quantify the empirical coverage of a paired bootstrap estimator. A separate conservative confidence set states its finite‑sample assumptions. Two acquisitions on an IBM processor compare engineered shared‑sign and independently reset phases with identical marginals. Their primary contrasts are 0.254 and 0.211, with empirical 95% intervals [0.177, 0.331] and [0.136, 0.285], respectively; all negative‑control intervals include zero. At equal shot and sensingwindow budgets, an ideal Ramsey/echo estimator is more precise in every tested class. The result supplies an explicit connection between a benchmarking identifiability limitation and a controlled correlation measurement. No native or quantum‑memory detection is claimed.
Authors:Ajay Pravin Mahale
Abstract:
A provider of a high‑risk AI system must keep records that make a decision traceable, and for agentic systems it has not been established what those records must contain for post‑hoc causal attribution to be possible. We give the estimator framework and then the conditions under which it fails. We separate the marginal total effect that prior work measures from a common‑random‑numbers total effect that isolates a step's own contribution, add the natural direct effect under a pinned downstream, and check the estimators against hand derivations. Both estimands then fail, in the same direction. Under the marginal estimand a causally inert step has the identical total effect to the decisive one on every run of our planted chain, an algebraic identity and not a coincidence at one draw. Under common random numbers the decisive step returns exactly zero on the runs where the executing step flips, about one in ten, while its direct effect there is 0.25 and it demonstrably acts; an exact zero does not certify that a step did nothing, and we put that here rather than in the limitations. We derive the coupling that keeps the direct effect estimable once contexts diverge, with a closed form for its degradation, and show that the mediated share on which a natural ranking is built is not a share under suppression: where the direct and mediated paths oppose, it exceeds one and ranks a suppressed component above a pure mediator. We publish the discrepancy experiment's pre‑registration rather than a result, because the live pipeline it requires was not available in the study window. We contribute the traceability specification such a filing would need, against a gap the Act's calendar opens: Article 86's right to an explanation has applied since 2 August 2026, while the Article 12 logging and Annex IV documentation that could evidence one were deferred to 2 December 2027 by Regulation (EU) 2026/1744.
Authors:Ryan Lail
Abstract:
An LLM judge evaluates outputs at scale. Experts should label only where it is least sure. Its natural escalation signal conflates two uncertainties: aleatoric, real disagreement in the expert pool, which labels cannot reduce, and epistemic, the judge's ignorance, which labels do reduce. A small Bayesian model separates them: a regression on labels already collected learns how far to trust a black‑box judge's prediction. Both components follow as simple formulas, with no sampling or further judge calls. The components isolate on a real LLM judge against exactly known truth, and stated confidence is no guide to its actual error. On real human disagreement (ChaosNLI) the epistemic ranking removes 83% more error than total uncertainty for the same expert labels, though simply escalating the least‑labelled items does as well there. We demonstrate we can estimate where a judge is ignorant rather than where experts genuinely disagree, and propose using this to direct expert labelling. Code and data are available at https://github.com/composo‑ai/ judge‑uncertainty‑decomposition.
Authors:Taehyung Kim, Jongeun Choi
Abstract:
The generation of safety‑critical traffic scenarios is essential for training and evaluating autonomous vehicles. Prior approaches typically perturb the trajectories of existing agents in a traffic scenario using simplified adversarial objectives to induce safety‑critical interactions, which can limit the plausibility and diversity of the generated scenarios. Although inserting new adversarial vehicles can alleviate this limitation, determining when and where to introduce them in a scenario‑specific manner remains challenging. In this work, we introduce \underlineCOllision \underlineSnapshot guided \underlineTim\underlineE‑\underlineReversed safety‑critical scenario generation (COSTER), a framework that leverages learned traffic priors to determine plausible collision times and locations. COSTER first constructs a collision snapshot by inserting a new vehicle in contact with the target vehicle at the identified collision state within a traffic scenario. Starting from this collision snapshot, a conditional variational autoencoder is used to perform a time‑reversed rollout, reconstructing the trajectory of the inserted vehicle backward toward earlier timesteps. Experiments show that COSTER outperforms existing methods in plausibility, diversity, and data efficiency. Moreover, agents trained on COSTER‑generated scenarios reduce collision rates by 31% on safety‑critical scenarios from the Waymo Open Motion Dataset while also improving ego task completion. The project website is available at https://anonym‑121.github.io/COSTER/.
Authors:Esther Xin
Abstract:
Group‑based reinforcement learning with verifiable rewards (RLVR) scoresmultiple completions per prompt using automatic verifiers. Analysesbased on independent verifier errors may overlook dependence associatedwith shared answer formats. We investigate this dependence in24,998 groups of eight completions generated by Qwen2.5‑1.5B onMATH, GSM8K, and DeepMath‑103K. We estimate a pooled within‑groupverifier‑error correlation of 0.530 (95% confidence interval:0.500‑‑0.560). Under an exchangeable‑error model, this correspondsto a design‑effect‑adjusted effective sample size of 1.70 for aneight‑completion group. Dependence varies substantially across answerforms: fractions, radicals, symbolic expressions, and intervals exhibitstronger clustering than unit annotations and percent signs. Replayinggroup‑relative advantages across four rule‑based verifier configurationsidentifies at least one advantage‑sign disagreement in up to 0.83% ofgroups. Because a group is repeated sampling for one prompt, thiswithin‑group clustering may reflect shared prompt difficulty as well asshared answer form, and we do not attempt to separate the two here.Unlike studies of correlated judgments across multiple evaluators, ouranalysis examines dependence across completions scored by the sameverifier. These findings motivate prompt‑ and answer‑form‑aware analysesof verifier noise rather than characterizations based solely onaggregate error rates.
Authors:Taisei Yamamoto, Ryoma Kumon, Danushka Bollegala, Hitomi Yanaka
Abstract:
Cross‑lingual alignment (CLA) aims to align the representations of large language models (LLMs) across languages, enabling cross‑lingual transfer to improve multilingual capabilities. Previous CLA methods often ignore language‑specific information encoded in representations and only consider sentence‑level alignment, which may lead to suboptimal performance and input‑output language mismatch. We propose CAROT (Cross‑Lingual Alignment of Representations in a Language‑Agnostic Space via Optimal Transport), which consists of two steps: identifying language‑specific representations in LLMs' internal states and aligning language‑agnostic representations across languages at the token level by optimal transport, while explicitly preserving language‑specific representations. Inference‑time steering experiments show that the representations computed by CAROT are effective alignment targets, improving multilingual performance by up to 11.2 points in accuracy while maintaining input‑output language consistency. We further use the representations obtained by CAROT as training targets, internalizing the aligned representations. The trained models outperform existing CLA methods in 11 of 18 evaluation settings (3 models × 3 tasks × ID/OOD languages). Our work provides insights into what constitutes effective alignment targets for CLA in LLMs. Code is available at https://github.com/ynklab/CAROT
Authors:Jiawei Mao, Haoqin Tu, Hardy Chen, Yuhan Wang, Keyang Xu, Jieru Mei, Hongliang Fei, Ruogu Fang, Wei Shao, Cihang Xie, Yuyin Zhou
Abstract:
Generating long‑form multi‑shot videos requires coherent within‑shot motion and visually consistent narratives across shots. Existing video generators favor continuous motion and struggle to present complete shot sets when an entire narrative is packed along one temporal axis. We propose MovieGrid, a Multi‑Grid Post‑Training paradigm that decomposes a long video into shorter, temporally ordered chunks and arranges them on a spatial grid for joint modeling. This design reduces the number of shots handled by each temporal axis while enabling global information exchange across chunks. We construct the Multi‑Grid Long Video (MGLV) dataset from 1,000 long‑form videos using source video collection, hierarchical segmentation, grid video construction, and character‑aware story annotation, producing 54K grid videos paired with story prompts. Our Noise‑Free Random‑Grid Training retains a random subset of chunks as clean visual context for denoising the remaining chunks. Grid Embedding encodes grid structure, character‑aware Story Prompts link recurring entities, and Grid Boundary Loss stabilizes layouts. Under the same token budget, MovieGrid generates 6.05 times more shots than Temporal Packing in a 1,616‑frame video. On a benchmark spanning five real‑world categories, it achieves state‑of‑the‑art intra‑shot consistency (0.9131 versus 0.8086 for HoloCine) and inter‑shot consistency (0.5914 versus 0.5384 for StoryMem). MovieGrid can further scale video length with minimal compromise through single or multiple generations.
Authors:Qinwen Ge, Bo Ni, Haowei Fu, Ngoc N. Tran, Erik Blasch, Tyler Derr
Abstract:
Scientific discovery in data‑rich domains is currently constrained by human bandwidth: the growth in the volume and complexity of real‑world data far outpaces the rate at which researchers can read, reason, and synthesize. Recent LLM‑based multi‑agent systems have begun to automate portions of the research cycle, but they target hypothesis generation in settings where validation cannot itself be automated, and each run is one‑shot, with no mechanism for findings to accumulate or steer subsequent inquiry. This paper introduces AutoKD, a multi‑agent framework for autonomous knowledge discovery that is both computational and cumulative, allowing validated findings to persist and inform subsequent inquiry. Six coordinated LLM agents collaborate in an open‑ended discovery loop, where accepted findings are stored in a persistent insight graph that serves as both long‑term memory and an exploration‑steering mechanism. We evaluate AutoKD on three diverse datasets from two perspectives: Open‑ended Quality against published findings, and Conditioned Quality via literature‑derived queries. Across both evaluation perspectives, AutoKD covers known findings and surfaces substantive discoveries that complement human‑driven research. Our code is available at https://github.com/GeQinwen/AutoKD.
Authors:Nafisa Anjum, Satavisa Dey Borno, Ananna Saha, Mir Faiyaz Hossain, Sifat Momen, Nabeel Mohammed, Shafin Rahman
Abstract:
Hyperspectral image (HSI) classification plays a vital role in remote sensing applications, including agriculture, environmental monitoring, and urban analysis. However, its performance remains challenged by high spectral redundancy, noise sensitivity, and the difficulty of jointly modeling local material composition and long‑range spectral dependencies. To address this, we propose AGSA‑Net, an abundance‑guided self‑attention network that explicitly integrates spectral unmixing priors into the classification process. AGSA Net first estimates physically meaningful subpixel abundance maps subject to non‑negativity and sum‑to‑one constraints, regularized by hybrid linear‑nonlinear reconstruction decoder. The learned abundances are then used to construct an abundance affinity prior that guides a spectral transformer to emphasize class‑discriminative interactions, and the resulting transformer features are fused with compact abundance descriptors for final prediction; in contrast to existing approaches that use abundance as auxiliary or concatenated features. Experiments on Indian Pines, Augsburg, and Berlin demonstrate the benefit of incorporating abundance‑ guided contextual modeling, particularly in heterogeneous urban scenes. The source code and trained models are available at: https://github.com/nnuvi/AGSA‑Net
Authors:Scott Moeller, Bhaskar Krishnamachari
Abstract:
Networked systems face a tradeoff between the scope of the information behind a decision and its freshness: a broader view of the system supports better coordination, but assembling and communicating it takes time, so it arrives older. We study this tradeoff for a team of agents that repeatedly choose actions to minimize a shared quadratic cost driven by an environment that evolves on its own, unaffected by the agents' actions. An information architecture specifies what each agent observes, from where, and with what delay; we measure an architecture by the cost it loses relative to a decision made with complete, current information. We first compare fresh local observations with a complete but delayed global view. When every component of the environment decorrelates at a common exponential rate, this comparison reduces to a closed‑form threshold on the ratio of delay to coherence time. We then study intermediate architectures in which each agent acts on a time‑aligned, and therefore older, snapshot of a wider neighborhood. The optimal neighborhood radius occurs where the marginal value of added scope equals the marginal cost of lost freshness. In a canonical spatial model, this radius is set by the spatial‑correlation, decision‑relevance, and temporal‑propagation lengths. Throughout, architecture performance is governed by the predictability of the optimal decision rather than of the raw state.
Authors:Yuanxin Ye, Tengfeng Tang, Tao Peng, Zhiqiang Han, Jiayuan Li, Mi Wang
Abstract:
Multimodal image matching is a fundamental task for multi‑source information fusion. However, geometric distortions and nonlinear radiometric differences (NRD) severely limit performance, especially under radiometric, rotation, and scale variations. To address this issue, we propose a radiation, rotation, and scale invariant (RRSI) feature descriptor. First, a dual‑head regional sampling (DHRS) module simultaneously performs Cartesian and Log‑Polar sampling on keypoint neighborhoods, retaining spatial structural properties while enhancing robustness to rotation and scale variations. We then jointly encode geometric and radiometric relations between multimodal images in a unified deep feature space, enabling feature encoding, interaction, and fusion across intra‑modal, dual‑head sampled, and inter‑modal regions. Furthermore, we introduce a bidirectional cross‑modal generative reconstruction constraint during training. By decoding implicit features into structural patches of the counterpart modality, this mechanism anchors modality‑invariant geometric topologies without additional inference overhead. Experiments on optical‑infrared and optical‑SAR datasets demonstrate highly competitive matching performance and strong robustness to rotation and scale variations. RRSI supports the full rotation range from 0 to 360 degrees and scale factors up to four. Its generalization ability is further validated on multimodal images from computer vision, remote sensing, and medical imaging. The implementation will be made publicly available at https://github.com/yeyuanxin110/RRSI .
Authors:Tianwei Mu, Yue Wang, Mingzhe Yuan, Wenhong Wang, Qing Luo, Min Xiao, Jun Li, Hui Yang, Manhong Huang
Abstract:
Calibration, leak localisation and sensor placement on water distribution networks (WDNs) are decisions about continuous parameters, yet the hydraulic engine that defines the physics returns a solution and no derivatives, so practice falls back on derivative‑free search or on surrogates whose error the answer inherits. We make the global gradient algorithm itself exactly differentiable: the forward pass reproduces the reference engine's discrete devices, status switching and low‑flow linearisation included, and the backward pass solves the implicit adjoint by reusing the forward pass's terminal factorisation, so one extra sparse solve returns every parameter's gradient at once, batched over scenarios on one graphics processor. Across 52 public, synthetic and operational networks and 8,140 simulation frames, every network meets the acceptance criterion, the largest head deviation from EPANET 2.2 is 1.137e‑13 ft and 25 agree exactly. One adjoint solve replaces the 906 simulations a finite‑difference roughness Jacobian costs on the 905‑pipe L‑TOWN benchmark, and a leak‑inversion training loop runs at 463‑470 ms per optimiser step for 256 scenarios, 191 times the prior pipeline. Gradient calibration reaches its endpoint within a median 595 model calls, where the strongest of five tuned metaheuristics needs 8,060 to match it on the training loss and two never do within 20,000. On a 554‑link operating network, one adjoint pass audits, pipe by pipe, which roughness parameters the installed sensors can constrain and which sensors to add, on the model the utility already operates.
Authors:Mohammad Mahdi Abootorabi, Armin Saghafian, Ali Bazshoushtari, Hamid Rezaei, EunJeong Hwang, Vered Shwartz, Parvin Mousavi, Purang Abolmaesumi
Abstract:
As large language models (LLMs) are increasingly deployed in alignment‑sensitive contexts, activation steering has emerged as a lightweight, inference‑time alternative to fine‑tuning methods (e.g., RLHF, DPO) for behavioral control. However, existing work typically validates steering on isolated behaviors, leaving it unclear whether steering vectors encode coherent semantic structure or merely exploit behavior‑specific shortcuts. We investigate whether the latent geometry of LLM steering vectors reflects theory‑specified structure in human values and morality. Using Schwartz's Theory of Basic Human Values as our primary fine‑grained framework, we introduce a 26K‑sample benchmark covering 20 human values and analyze distribution‑driven methods (e.g., CAA, SphericalSteer, ODESteer) and behavior‑centric approaches (e.g., COLD‑Steer, BiPO) across diverse model families and sizes. We find that distribution‑driven methods recover human value topologies aligned with theoretical predictions (Spearman ρ up to 0.51, p < 10^‑13). In contrast, behavior‑centric methods achieve comparable steering performance but show little correlation with the expected value geometry. Geometric fidelity improves with model scale but drops after instruction tuning. Finally, better geometric alignment also leads to more human‑consistent transfer across values: steering one value correctly lifts compatible values and suppresses opposing ones. Code and data are available at: https://github.com/DeepRCL/Steering_Geometry.
Authors:Gabriel H. Pizzorno
Abstract:
Medieval documentary sources remain inadequately served by existing natural language processing tools. None of the five readily available Latin treebank models attains usable performance on a collection of 160 inventories compiled in Marseille between 1258 and 1446. The best labelled attachment score is 0.62 and the best morphology‑aware score is 0.24. Performance does not correlate with either genre or period proximity. To address this shortfall, in‑domain training data was generated as a by‑product of using these inadequate models. In each of nine iterations, a model pre‑annotated 200 sentences; an expert corrected the annotations; and the corrected sentences were used to train the subsequent model, with batches sampled independently of model state, without active‑learning selection. Thirty‑three hours of annotation effort over 1,804 sentences increased universal part‑of‑speech accuracy from 0.80 to 0.98 and labelled attachment from 0.48 to 0.92, outperforming all baselines on the reported metrics while using 97% less training data than the largest one of them. Annotator effort declined from 54% of tokens to a plateau of 14‑18%, an operational progress metric that requires no separate gold standard and can serve as a stopping criterion.
Authors:Ting Huang, Yue Huang, Zeyu Zhang, Shuicheng Yan, Hao Tang
Abstract:
Grounding natural‑language instructions into reliable and executable actions remains a fundamental challenge for vision‑language‑action (VLA) systems on mobile robots, due to the persistent gap between high‑level semantic reasoning and low‑level locomotion and manipulation control. Existing approaches often rely on implicit reasoning or monolithic action prediction, making it difficult to maintain coherent long‑horizon decision making while producing precise and adaptable robot actions. To address this challenge, we propose MobileVLA‑R1 2.0, an RL‑enhanced VLA framework that explicitly couples structured embodied reasoning with executable mobile robot control. The framework learns multi‑granularity reasoning over embodied trajectories through supervised Chain‑of‑Thought (CoT) alignment and reinforcement learning, improving reasoning‑to‑action consistency beyond purely behavioral supervision. To support both locomotion and manipulation, we further introduce a reasoning‑conditioned action decoder that maps multimodal reasoning representations to task‑level action targets, which are subsequently translated into embodiment‑specific commands by robot controllers. This design provides a unified perception‑reasoning‑action interface while decoupling high‑level action generation from robot‑specific actuation. We conduct extensive evaluations on language‑guided navigation, quadruped control, and humanoid mobile manipulation, covering VLN‑CE, QUARD, and real‑world deployments on Unitree Go2 and G1 robots. MobileVLA‑R1 2.0 consistently outperforms strong VLA baselines, achieving an average 1.6 point improvement in SR on VLN‑CE and a 10.0 point improvement in full‑task success on real‑world G1 mobile manipulation tasks over MobileVLA‑R1, while demonstrating robust long‑horizon instruction following and closed‑loop execution across different robotic platforms.
Authors:Sajjad Rezvani Boroujeni, Muskan Saraf, Gnana Tulasi Makineni, Tom Bush, Hossein Abedi
Abstract:
Ground‑truth defect masks in industrial inspection datasets are typically reserved for evaluation. This paper repurposes them as spatial supervision signals during training of classification networks, teaching a model not just what to predict but where to look. The method adds an activation‑based attention alignment loss that steers convolutional feature maps toward defect regions, in a mixed‑supervision formulation that also accommodates samples without masks, such as diffusion‑generated images. Combined with DDPM augmentation, synthetic images contribute quantity while masks contribute spatial precision. We evaluate 85 models (four CNN backbones under a 2x2 data/training factorial over five seeds, plus a Swin‑V2‑T transformer baseline) on the MVTec‑AD bottle benchmark, with localization measured on held‑out defect images excluded from classifier gradient updates. Main findings: (1) attention‑guided training improves activation‑based localization (Pixel‑AUROC) by +18.0% for EfficientNetB0 with augmentation (p=0.005, Cohen's d=2.6) and +18.7% for ResNet50 (p=0.008), significant in four of eight CNN settings (uncorrected for multiple comparisons) with no significant change in classification; (2) for EfficientNetB0 a data x training‑mode interaction is significant (p=0.002), consistent with a super‑additive effect (+13.6% combined vs +1.6% summed individual effects); (3) architectures with weaker spatial representations benefit most, whereas ConvNeXt‑T shows no effect, apparently because its depthwise‑convolution activations yield spatially uninformative channel‑mean maps; (4) unsupervised PatchCore remains the strongest localizer (Pixel‑AUROC=0.983), contextualizing the supervised gains. These results show that existing evaluation masks can act as practical training signals that measurably and reproducibly improve where defect classifiers attend.
Authors:Pengfei Shao, Jisheng Dang, Jiawen Fang, Ning Liu, Wencan Zhang, Bimei Wang, Jingwen Zhao, Jianhuang Lai, Qi Tian, Tat-Seng Chua
Abstract:
Multimodal sentiment analysis and emotion recognition in conversations demand effective modeling of heterogeneous interactions across textual, acoustic, and visual modalities. Although large language models (LLMs) offer powerful language understanding, adapting them to multimodal affective computing remains challenging: full‑model fine‑tuning is computationally prohibitive, while many existing lightweight adapters fail to preserve rich textual cues during cross‑modal fusion. To address these limitations, we propose the multi‑view text‑guided multimodal fusion adapter (MVFA), a parameter‑efficient framework that augments frozen LLMs with strong multimodal reasoning capability. MVFA first constructs complementary text views via max pooling, mean pooling, and attention pooling; these views then guide cross‑modal interactions with audio and visual features. The fused multimodal representations are subsequently compressed into a compact set of learnable pseudo‑tokens through an Enhanced Q‑Former Fusion Module. Using ChatGLM3‑6B‑base as the primary backbone, we further validate MVFA on LLaMA2‑7B and Qwen3‑8B to examine its portability across multiple frozen LLM backbones. MVFA is evaluated on three challenging datasets: CH‑SIMS V2.0, MELD, and CHERMA. Experimental results demonstrate that MVFA achieves state‑of‑the‑art performance on key metrics while updating only a small fraction of parameters. Specifically, it attains 84.62% Acc2 and 84.59% F1 on CH‑SIMS V2.0, 67.36% Acc and 66.03% WF1 on MELD, and 74.66% Acc on CHERMA. These findings establish multi‑view text‑guided fusion as an effective and scalable paradigm for parameter‑efficient multimodal LLM adaptation in affective computing. The code is publicly available at https://github.com/Overwhelm1208/MVFA.
Authors:Zhixiong Zhao, Zukang Xu, Guangyu Sun, Lifeng Liu, Dawei Yang
Abstract:
Large language models (LLMs) have achieved remarkable progress, yet their massive storage and memory‑bandwidth demands still hinder efficient deployment. Weight binarization is a promising solution, but existing binarization‑based post‑training quantization (PTQ) methods usually far exceed the nominal 1‑bit storage target due to hidden overhead. To address this gap, we propose All for 1‑Bit (AF1), a genuine 1‑bit PTQ framework for LLMs. AF1 comprises two complementary components: (1) Null‑space‑Aware Binary Factorization (NABF) for improving binary reconstruction through Hessian‑aware surrogate reparameterization, null‑space‑aware binary factorization, and scale‑only global reconstruction; and (2) Hierarchical Shapley Allocation (HiSA) for assigning structural capacity using hierarchical Shapley sensitivity. Together, they preserve model accuracy under a strict 1.0‑BPW budget in the PTQ setting. Experiments on LLaMA, Qwen, and Gemma families show that AF1 consistently outperforms existing binarization‑based PTQ methods in perplexity and zero‑shot accuracy. Compared with BF16, AF1 achieves an average 2.5 times inference speedup and over 90% memory reduction across evaluated models, providing a practical path toward deployable genuine 1‑bit compression for LLMs. The code for reproducibility is available at https://github.com/Kishon‑zzx/AF1.
Authors:Shutong Zheng, Sijia Chen
Abstract:
One‑shot federated graph learning generally aims to train Graph Neural Networks (GNNs) across clients with disconnected subgraphs in a single communication round. Existing methods predominantly design advanced optimization strategies under the premise that local GNN training is indispensable. However, empirical observations reveal that under extreme non‑IID conditions, local GNN training suffers from severe cross‑client representation misalignment, becoming a major source of error rather than a remedy. Motivated by this, we reformulate one‑shot FGL as a statistical estimation problem. We propose SPEAR (Statistical Prototype Estimation with Adaptive Reliability), a completely training‑free framework that directly computes topology‑smoothed class prototypes from local graphs in the original feature space. The server then aggregates these prototypes using a sample‑size‑adaptive shrinkage estimator that down‑weights unreliable local estimates, producing robust global class prototypes. Extensive experiments across seven benchmarks demonstrate that SPEAR consistently achieves state‑of‑the‑art accuracy under extreme heterogeneity. Moreover, SPEAR delivers at least an order‑of‑magnitude speedup over all baselines, reaching several orders of magnitude against generative and distillation‑based methods. Our findings suggest that training‑free statistical estimation, rather than local GNN optimization, provides the key to robust and efficient one‑shot federated graph learning. The code is available at https://github.com/Yodeesy/SPEAR .
Authors:Seyed Mosayeb Alam
Abstract:
Ask a language model the same question about the same document twenty times, and it sometimes returns two different answers. We built Probity, a benchmark of 60 tasks and 470 items from real venture‑financing filings, to measure how often this happens. Then we audited our own corpus and found a defect any excerpt‑built benchmark can carry: items whose evidence is missing from the window of text the model is shown. The audit flags 36 items and separates two failures a single flag would conflate: evidence genuinely absent from the window and answers that must be computed from numbers the window does supply. Flagged items change their answers far more often, wobbling at 0.255 against 0.087 on the 427 clean items, and excluding them cuts apparent cross‑model agreement by about a fifth. Before testing whether the missing evidence explains the instability, we registered a prediction: re‑cut each window to hold its evidence, and instability should fall below a set threshold. It failed: the repair moved wobble by 0.058, with an interval containing zero. We report the association as correlational. Almost all measurements sit where instability cannot show, which bounds what a corpus built for accuracy can say about stability. We release the corpus, all 112,800 raw responses, and the audit as a runnable check for any document benchmark.
Authors:Bihan Li, Xinyang Li, Zeran Xu, Meiguang Jin, Junfeng Ma
Abstract:
Visual dubbing must synchronize mouth motion with replacement speech while preserving identity, appearance, and temporal consistency. Although X‑Dub provides a strong mask‑free video‑editing baseline, its application to livestream and generated‑video content reveals limitations in production‑domain robustness, temporal and motion stability, identity and oral‑detail preservation, and inference efficiency. We present TBDub, a production‑oriented extension of X‑Dub that combines task‑adaptive post‑training with task‑aware few‑step distillation. Post‑training adapts the video DiT using production‑domain data, production‑specific conditioning and filtering, and enhanced audio features to obtain a 30‑step Teacher. Distillation adapts DMD/DMD2 to conditional video editing and compresses the Teacher into a two‑step Student. On 38 TalkVid clips, the Teacher improves all eight reported reconstruction, perceptual, identity, and synchronization metrics over X‑Dub. In the MOS evaluation, it improves lip‑sync consistency, identity consistency, and visual quality over X‑Dub by 0.14, 0.95, and 0.90 points, while the Student achieves the highest lip‑sync and visual‑quality scores and remains close to the Teacher in identity consistency. In paired end‑to‑end generation timing from the first VAE encode through the final VAE decode on a single NVIDIA H20 GPU at 512×512, the Student reaches 7.13 effective FPS and reduces total latency by 13.93×; the DiT stage alone is accelerated by 42.49×. The Student largely retains the Teacher's generation quality and audiovisual synchronization. The code is available on GitHub at \https://github.com/TaoLiveAIGC/TBDub, and the 30‑step Teacher and two‑step Student weights are available on Hugging Face at https://huggingface.co/TaoLiveAIGC/TBDub.
Authors:Alexander Demin, Gleb Pogudin, Christopher Rackauckas
Abstract:
Consider a parametric ODE control model. A function of the states and parameters is called observable if its value can in principle be reconstructed from input‑output data. The observable functions form a field, called the observation field, represented naturally by a set of generators. Even when the model is not fully observable, this field captures the information still accessible from input‑output data. We present an algorithm for computing a concise generating set for the observation field of a model with rational dynamics. The algorithm relies on two new results: one allows observable functions to be extracted from the coefficients of repeated Lie derivatives of the outputs, while the other reduces the required orders of differentiation by exploiting identifiable parameter combinations. We implement the resulting algorithm in StructuralIdentifiability.jl (https://github.com/SciML/StructuralIdentifiability.jl). For computational efficiency, we employ recent techniques for differential elimination and rational function field simplification. Using models from epidemiology, chemical kinetics, and cancer modeling, we show that the algorithm produces generators with domain‑specific interpretations that can inform model analysis and development.
Authors:Ruibiao Fu, Di Tang, Yunlong Yang, Ran Wang, Sicheng Lu, Peixuan Wu, Xiaoyu Fan, Jiacheng Ma, HaoZhe Luo, Yang Xiao
Abstract:
We introduce Personalized and Reliable Popular Science Writing, a novel task that requires adapting scientific explanations to audiences with different cognitive levels while preserving factual accuracy. However, improving personalization often introduces simplifications that increase the risk of hallucination and factual distortion. To address these challenges, we first construct a dataset of 39,134 entries and a reader‑centric Personalized Science Communication Benchmark (PSCB) that jointly evaluates audience adaptation and factual accuracy. To reduce data and computational requirements while improving generalization across domains and audiences, we introduce DA‑MoE, which explicitly decouples audience adaptation from domain knowledge through separate modeling. To enable robust verification and revision in evidence‑scarce scenarios, a multi‑agent fact‑checking mechanism that augments limited evidence with role‑specific agent debate and propagates confidence over a graph is proposed. Experiments on PSCB show that our approach achieves state‑of‑the‑art performance. Our code is open‑sourced at https://github.com/DPInnovationWorks/CWF.
Authors:Zichen Tian, Jinpeng Chen, Cheng Gong, Suiyun Zhang, Rui Liu
Abstract:
High‑quality multi‑turn tool‑use data is essential for training agentic models, yet existing data synthesis methods often underrepresent the argument‑level dependencies that are critical to long‑horizon tool use. As a result, even when a model selects the correct tool, task execution may still fail because the model fills tool arguments with fabricated, stale, or weakly grounded values. To address this problem, we propose State‑Guided Data Synthesis with Argument Provenance (SAP). SAP combines state guidance, tool‑argument provenance constraints, and turn‑level validation to efficiently construct tool‑use trajectories with long‑range dependencies and high accuracy. Using data generated by SAP, we build SAP‑4B, which is highly competitive even when compared with much larger models across multiple benchmarks. Source code, synthesized data, and trained weights are available at https://github.com/Zichen1024/SAP.
Authors:Baoxu An, Wenmian Yang, Zhensheng Wang, Weijia Jia
Abstract:
Stock market analysis inherently requires composite reasoning over historical records and future projections, yet existing benchmarks remain fragmented across isolated tasks. We introduce STQA (Stock‑focused Tabular Question Answering), an end‑to‑end benchmark designed to systematically evaluate natural‑language question answering over historical data, numerical forecasts, and forecast‑based reasoning. Built on a large‑scale financial dataset, STQA covers 4,417 stocks and contains 31,400 question‑answer pairs derived from expert‑crafted templates, accompanied by fine‑grained intent and slot annotations. To operationalize this benchmark, we present SQFRS (Stock Query‑Forecast‑Reasoning System), an agent‑based unified framework that orchestrates SQL retrieval and time‑series forecasting tools. Experiments demonstrate that while current large language models perform well on historical queries, forecast‑based reasoning poses a substantial challenge, revealing critical bottlenecks in tool coordination and reasoning under uncertainty. The dataset and code are available at https://github.com/xuxubaobaoan/STQA_Project. STQA thus serves as a rigorous testbed for future research on trustworthy, tool‑augmented financial agents.
Authors:Gal Sapir, Alon Diament, Adva Wolf, Doron Yaya-Stupp, Dikla Gelbard Solodkin, Dana Azouri, Anat Etzion-Fuchs, Guy Lutsker, Eran Segal, Hagai Rossman
Abstract:
Deeply phenotyped cohorts combine clinical, imaging, molecular, and wearable observations across timescales from seconds to years. This breadth can reveal which measurements inform which health‑related questions, but heterogeneous analyses are not directly comparable. We present PhenoBench, an executable benchmark built around the Human Phenotype Project, in which more than 13,000 participants have completed the initial visit. Each question fixes the target, eligible population, timing, and allowed information; its evaluation contract specifies the split, metric, baseline, and claim boundary. The benchmark defines 90 clinically grounded tasks across 15 domains and 26 input modalities. Measurements showed question‑ and representation‑dependent predictive value, including positive, near‑zero, and negative changes in held‑out performance relative to matched baselines. We used PhenoBench to evaluate emerging tabular foundation models across 160 matched regression comparisons spanning 52 tasks. These models ranked above standard task‑specific models in aggregate but, averaged across the three pretrained models within each cell, improved on ridge by a median of only 0.004 R^2 (95% CI, 0.002‑‑0.006). We then used the same cohort data and evaluation contracts to evaluate 14 language models, collectively covering 40 tasks spanning phenotype recovery, classification, follow‑up forecasting, and participant ordering. Without cohort‑specific fitting, language models made informative predictions on some tasks, but showed task‑specific capability gaps, shared failures of scale, and rarely surpassed models fitted on the same fields. PhenoBench turns a multimodal longitudinal cohort into a versioned, auditable evaluation system where new questions, measurements, and models can be added without redefining existing comparisons.
Authors:Ahin Lee, Sehyun Yun, Joonha Park, Taesik Gong
Abstract:
Parameter‑efficient fine‑tuning (PEFT) of mixture‑of‑experts (MoE) models commonly attaches a separate low‑rank adapter to each expert. This expert‑wise design fragments adaptation in three ways: capacity is split across narrow low‑rank updates, gradient supervision becomes sparse and imbalanced under sparse routing, and execution is decomposed into many small GEMMs. We find that such expert‑wise separation is often unnecessary, as subsets of LoRA adapters become functionally similar during fine‑tuning, revealing redundancy among expert‑specific adapters. Based on this redundancy, we propose ACE (Adapter Consolidation across Experts), which groups redundant experts and replaces their expert‑specific adapters with group‑shared higher‑rank LoRA modules under the same PEFT budget. ACE further introduces grouped adapter execution, which consolidates fragmented expert‑wise adapter computations into fewer, larger group‑level GEMMs. Across evaluations covering 12 datasets and four MoE backbones, ACE achieves the highest observed mean accuracy among the parameter‑matched PEFT methods on the three backbones with complete baseline coverage, while providing 1.31× to 1.48× wall‑clock training speedup over expert‑wise LoRA without increasing peak memory. Our code is available at https://github.com/UbiquitousAILab/ACE.
Authors:Zhongan Bi, Qiwen Wang, Jianrong Jiang, Jigang Ding, Wenwen Xiong, Changhua Meng, Xuanang Gao, Kepeng Lin, Changjiang Jiang, Yiang Chen, Huan Yao, Wei Wang, Zhenyu Ma, Wenhui Dong
Abstract:
Search‑augmented LLM agents are increasingly used for consumer decisions, making them vulnerable to Generative Engine Optimization (GEO) poisoning. Existing benchmarks largely measure whether manipulated content is retrieved or endorsed, but do not track whether an agent verifies suspicious evidence, revises adopted claims, or recovers before producing its final recommendation. We introduce HAE‑GEO, a benchmark that tracks the full trajectory from exposure to recovery under progressively more persuasive Web poisoning. Agents interact via a multi‑turn Search‑Scrape interface across three attack levels (L1 direct assertion, L2 contextual camouflage, and L3 apparent corroboration), supported by a controlled corpus of 72,039 clean pages and 770 poisoned pages per level spanning 8 product categories and 154 brands. Evaluation combines deterministic behavioral measures with six semantic rubric dimensions. Evaluating 10 agents, we find three recurring patterns: evidence recognition degrades under the corroboration trap; agentic search improves final resistance without improving evidence recognition or utility; and defense prompting increases verification, yet rarely converts verification into recovery.
Authors:Gengjia Chang, Ziteng Cui, Shuhong Liu
Abstract:
The appearance of a smoky scene is shaped by two processes that a camera records together: the participating medium alters scene radiance in a view‑dependent way, and the image signal processor (ISP) then remaps the result through a nonlinear tone and color transformation. Recovering a clean 3D scene requires separating both. Per‑view sRGB dehazing acts only after the ISP has entangled them; standard 3D reconstruction ignores the medium and absorbs it into scene geometry and radiance. FujinSplat addresses the problem in the RAW domain, where the two processes remain separable. A per‑scene Base ISP is fitted from the scene's hazy RAW captures to its own camera renderings and then frozen, providing a fixed photometric anchor that performs no dehazing. Analyzing expert corrections reveals a compact, low‑dimensional correction space identifiable from RAW alone. FujinSplat therefore fits per‑view action answers at the training poses and trains a single scene‑agnostic controller to regress them from RAW; the corrected views supervise one static 3D Gaussian representation, jointly with a bounded per‑view residual that reconciles cross‑view photometric inconsistencies. On the RealX3D real‑world smoke benchmark FujinSplat clearly outperforms the strongest comparable baseline, ahead of both physics‑based reconstruction and restoration‑then‑3DGS pipelines. Code is available at https://github.com/I2WM/FujinSplat .
Authors:Zhirong Shen, Rui Huang, Chang Zou, Shikang Zheng, Jiacheng Liu, Peiliang Cai, Zhengyi Shi, Yaosong Du, Liang Feng, Xiaobing Tu, Jinkui Ren, Xiantao Zhang, Linfeng Zhang
Abstract:
Diffusion Transformers have become the dominant paradigm in generative AI, but their high computational costs severely hinder real‑time applications. Prediction‑based feature caching is widely used to accelerate diffusion transformers; however, as the number of steps increases, the deviation between its predictions and the reference full‑compute trajectory gradually grows. An intuitive idea is to use an online regression model to dynamically correct this deviation, but it faces the issue of label data being unavailable during the acceleration process. This paper presents a statistical observation that the residuals between the features of full computation steps using caching methods and reference full‑compute trajectory locally exhibit a zero‑mean Gaussian distribution. By treating the features of full computation steps as noisy observations of reference features, the data acquisition problem is resolved. Based on this observation, a plug‑and‑play GP‑Refiner correction framework is proposed. This method utilizes Gaussian Process Regression for correction and, leveraging the properties of GPR, introduces an uncertainty‑adaptive computation strategy that triggers necessary full‑computation calibration by monitoring the posterior variance in real time. Experiments demonstrate significant improvements across different models when combined with various state‑of‑the‑art methods. Integrating the proposed framework with TaylorSeer reduces the computational load by 19.3% while improving PSNR by 0.9 dB and reducing LPIPS from 0.46 to 0.29. Code is available in https://github.com/Aredstone/GP‑Refiner.
Authors:Ilia Voroshilov
Abstract:
We introduce Chain of Intent, a governance framework for agentic AI at small regulated firms, and validate it against a failure it was built to address. Existing agentic governance research assumes enterprise infrastructure that small firms do not have. In a simulated Hong Kong asset manager with 415 synthetic contact records, an agent performing a routine client‑communications task was subjected to ordinary managerial pressure to increase its reach. With its authorised constraints written into its configuration, the agent held: it identified every ambiguity in the firm's records, cited privacy legislation it had never been shown, and refused six successive requests, breaching in two of fifteen runs. With the same task, data, pressure and model, but its purpose left unstated as resource‑constrained firms routinely leave it, it breached in thirteen of fifteen runs, contacting up to 220 individuals of whom 94 per cent had no demonstrable marketing consent ‑ conduct carrying a maximum of three years' imprisonment under Hong Kong law. Chain of Intent applies four controls requiring no security engineering: a machine‑readable purpose, constrained tool access, a scope ledger, and a pre‑action check. It eliminated unlawful contact in every run while preserving task completion, and ablation shows each control independently sufficient by a different mechanism. We further show that drift must be measured at two stages ‑ agents widened their candidate sets in every pressured run while acting on them in roughly one in seven ‑ and that governance applied at the point of intent costs roughly half as much as governance applied at the point of action.
Authors:Francesco Tonini, Lorenzo Vaquero, Mohammad Mahdi Derakhshani, Cees Snoek, Elisa Ricci, Cigdem Beyan
Abstract:
Human‑Object Interaction (HOI) detection aims to localize humans and objects in images and classify their interactions. Zero‑shot HOI focuses on recognizing interactions that are not observed during training, requiring models to generalize beyond seen verb‑object compositions. Recent approaches leverage Vision‑Language Models (VLMs), benefiting from rich semantic representations. However, they often rely on global or detector‑centric features that compress interaction cues and hinder fine‑grained spatial reasoning. To overcome this limitation, we propose FineHOI, a zero‑shot HOI framework that explicitly models interactions from dense patch‑level features. Our approach is motivated by the observation that human‑object interactions are defined by localized spatial relationships, which are not preserved by global and detector‑centric representations. To this end, we introduce an Adaptive Part‑Level Attention module that decomposes humans and objects into semantically coherent parts via unsupervised clustering, and re‑weights them based on their interaction relevance. These representations are then integrated through a Region‑Aware Interaction Transformer that integrates part‑aware and global features and produces the final HOI embedding. Extensive experiments demonstrate that FineHOI consistently outperforms existing zero‑shot HOI methods, achieving particularly strong gains on unseen interactions. Code is available at https://github.com/francescotonini/fine‑hoi.
Authors:Youngmin Chung, Ji Hun Ha, Andrew H. Song, Cristina Almagro-Pérez, Chaeyoung Seo, Won Jun Suh, Jeong Won Beom, Kyoung Bin Oh, Eytan Ruppin, Faisal Mahmood, Joo Sang Lee
Abstract:
Spatial transcriptomics (ST) provides unprecedented insights into tumor heterogeneity by capturing spatially resolved gene expression, yet its high experimental cost hinders large‑scale adoption. Consequently, computational approaches that predict spatial gene expression directly from hematoxylin and eosin slides, termed virtual ST, have rapidly emerged. Despite this progress, assessing advances in the field remains difficult due to insufficient benchmarking: prior studies rely on small, heterogeneous datasets, inconsistent training and inference pipelines, and limited evaluation of biological interpretability and model robustness. To address these gaps, we present STP‑BENCH, a standardized benchmark for virtual ST models. STP‑BENCH comprises six cancer types spanning two ST platforms (Visium and Xenium), with each training dataset containing more than 30,000 spots and at least 15 slides to ensure statistical reliability. We evaluate 21 predictive approaches, re‑implemented with a unified pathology foundation model as the morphological encoder when architecturally applicable. Beyond conventional benchmarks that report average predictive accuracy on highly variable genes, we systematically examine which genes and gene sets are recoverable from histomorphology. We further evaluate the downstream biological utility of predicted profiles through cell‑type deconvolution and spatial domain identification, and assess model reliability under domain shifts and data scaling. Notably, unified morphological encoding substantially re‑orders model rankings established in prior studies, indicating that architectural innovations and image encoding have been conflated in previous evaluations. We publicly release STP‑BENCH to support reproducibility and serve as a community benchmark at https://github.com/NEXGEM/STP‑Bench.
Authors:Yichen Guo, Tinghao Wang, Qizhe Zhang, Lingbei Meng, Yuan Zhang, Jiajun Cao, Hao Jiang, Chenwei Wu, Jixian Wu, Sixiang Chen, Tao Luo, Hongyang Cheng, Kai Tang, Chenxi Li, Renyuan Li, Xiande Huang, Wenya Wang, Shanghang Zhang
Abstract:
Large vision‑language models (LVLMs) achieve strong multimodal understanding, but the hundreds to thousands of visual tokens they process impose substantial computational overhead, motivating training‑free visual token pruning. In this work, we conduct two complementary analyses of visual token pruning. First, we measure the feature‑space coverage of tokens retained before cross‑modal fusion and find that aggressive pruning discards substantial visual information. Second, we track text‑to‑visual attention across decoder layers and find that the visual tokens considered important change substantially with depth, making one‑shot pruning decisions unreliable. Together, these findings show that effective pruning should preserve broad visual coverage before fusion and progressively refine the retained tokens as cross‑modal evidence evolves during fusion. We therefore propose STAR‑Pro (STage‑Wise Adaptive Token Reduction with Progressive Refinement), a training‑free two‑stage framework. Its Adaptive Stage applies pivoted QR to construct an over‑budget feature‑coverage candidate pool, while its Progressive Stage uses evolving text‑to‑visual attention at selected decoder layers to prune a nested survivor set under a target layer‑average token budget. Extensive experiments across seven LVLMs spanning multiple architectures and 18 image and video benchmarks demonstrate the effectiveness of STAR‑Pro under aggressive pruning. On LLaVA‑Video‑7B, STAR‑Pro reduces visual tokens by 90.5%, retains 92.7% of baseline performance, and achieves a 2.24× measured inference speedup. Code is available at https://github.com/EasonAI‑5589/starpro.
Authors:Zeyu Wu, Junchao Wu, Shudong Liu, Runzhe Zhan, Xin Chen, Shu Yang, Yichao Du, Longyue Wang, Weihua Luo, Jinsong Su, Derek F. Wong
Abstract:
Existing Supervised Fine‑Tuning paradigms, particularly Full Parameter Fine‑Tuning are often plagued by parameter redundancy, inconsistent data quality, and catastrophic forgetting, which current methods typically address in isolation and lack a unified optimization signal to bridge data selection, parameter updates, and knowledge preservation. To address this, we propose Neuron‑Guided Fine‑Tuning (NGFT), a holistic framework that leverages neuron activation patterns as a universal proxy to unify the fine‑tuning lifecycle. NGFT operates via three synergistic mechanisms: (1) Adaptive Task‑Specific Neuron Selection, which identifies essential neurons in a single forward pass to concentrate updates and reduce redundancy; (2) Activation‑Based Data Selection, which prioritizes information‑dense samples that maximize contribution to key neurons; and (3) Neuron Activation Alignment, a novel loss function that anchors activations to pre‑trained states, deepening representation learning and preserving general knowledge. Experimental results across three models across both domain‑specific and general benchmarks demonstrate that NGFT significantly outperforms existing mainstream fine‑tuning methods in both efficiency and performance, while effectively mitigating catastrophic forgetting.
Authors:Hongji Li, Yunhui Li
Abstract:
Single image super‑resolution aims to reconstruct high‑resolution images from low‑resolution inputs. This paper proposes FreeTransformSR, a novel lightweight super‑resolution network based on a channel‑wise free low‑rank learnable transform. The transform learns task‑adaptive basis functions in a data‑driven manner, enabling adaptive feature modulation with minimal parameter overhead. To further enhance high‑frequency detail recovery, we introduce a local feature modulation branch that complements transform‑domain processing with depthwise convolution. In addition, a soft complexity adaptive module dynamically fuses the outputs of local convolution and window self‑attention branches through a lightweight gating network, adaptively adjusting the fusion ratio based on regional texture characteristics. An adaptive intensity modulation strategy is also incorporated to adjust transform‑domain response strength at the sample level, enabling the network to dynamically adjust processing intensity according to input features. Extensive experiments on five benchmark datasets demonstrate that FreeTransformSR achieves competitive PSNR/SSIM performance with significantly fewer parameters and FLOPs. Specifically, FreeTransformSR achieves 32.41 dB on BSD100 x2 and 27.00 dB on Urban100 x4 with only 595K parameters, while delivering faster inference speed than competing methods, making it well‑suited for deployment in resource‑constrained scenarios. Source code is available at: https://github.com/HJiLi/FreeTransformSR.
Authors:Qiqi Gao, Wenzhuo Song, Xueyan Liu
Abstract:
Link sign prediction (LSP) aims to infer the positive or negative polarity of unobserved links in signed networks. Signed Graph Neural Networks (SGNNs) usually rely on signed‑graph structural priors, including structural balance and homophily‑like similarity, to guide message passing and prediction. These priors describe population‑level tendencies, not guarantees for individual target edges. Their failures are especially costly under severe sign imbalance, where errors on minority and locally conflicting relations are harder to detect and correct. We propose Polarity‑Asymmetric Structural Calibration (PASC), a target‑edge structural‑prior calibration framework for signed link prediction. PASC constructs a structure‑only prior representation, estimates a target‑edge structural prior score, and compares this score with a local signed‑context cue to derive a conflict residual. The residual calibrates signed attention aggregation, target‑edge gated fusion, and regime‑adaptive optimization. Experiments on five real‑world signed network datasets show that PASC consistently achieves the best Macro‑F1 among representative baselines, with competitive AUC, Binary‑F1, and Micro‑F1. Structural‑shift experiments further suggest reduced dependence on dense‑neighborhood and local‑closure shortcuts. Source code is available at https://github.com/iqqGGGGGGG/PASC‑for‑LSP.
Authors:Yongzhe Lyu, Shaofei Wang, Yixin Chen, Siyuan Huang
Abstract:
In this paper, we address the challenging problem of 4D reconstruction from sparse‑view videos. This setup usually relies on monocular depth estimation to provide priors for the reconstruction model. A key challenge arises from limited cross‑view overlap and temporal variation, making monocular depth predictions inconsistent across views and time. Existing methods align spatial and temporal dimensions in separate stages, requiring foreground segmentation masks while failing to leverage temporal cues for cross‑view alignment. Contrary to these methods, we propose a unified spatial‑temporal depth alignment framework that jointly resolves cross‑view and cross‑time inconsistencies without distinguishing foreground/background. Our method represents depth maps across views and time as a set of spatio‑temporal neural fields. This representation not only yields fast convergence, but also captures spatio‑temporal correlation among depth maps implicitly, without dependence on external segmentation/tracking models. We also propose a multi‑view depth‑order loss while leveraging the classic scale‑and‑shift‑invariant loss to further improve the final depth quality. The aligned depths initialize and supervise Gaussian splatting models for 4D reconstruction. Experiments on Ego‑Exo4D and EgoHuman demonstrate that our improved depth alignment substantially benefits dynamic Gaussian‑splatting‑based reconstruction methods for novel‑time/view synthesis and geometry accuracy/consistency.
Authors:Jinnan Li, Zheren Fu, Yue Wang, Jinzhe Li, Yuan Wu, Yi Chang
Abstract:
Multi‑turn interaction creates a feedback process in which an LLM's previous responses become context for later behavior. Prior work shows substantial multi‑turn degradation and that assistant‑generated history can affect later behavior. However, it remains unclear how these effects manifest across models, tasks, turns, and inside a model. We study these gaps across six task families and five models. Degradation from fully specified single‑turn input (FULL) to progressively revealed multi‑turn interaction (SHARDED) is clearly task‑ and model‑dependent, and stronger one‑shot performance does not imply greater interaction robustness. We then retrospectively analyze completed SHARDED conversations by replaying the user messages already observed in each trajectory while editing only assistant‑generated history. Replacing prior assistant responses with neutral content (termed neutralization) changes downstream min‑max normalized performance by +.027 across 2,973 trajectories. On a prespecified length‑controlled subset, short and length‑matched neutralization yield nearly identical effects (+.069 versus +.068), showing that simple context shortening is insufficient to explain the effect of history editing. Turn Surgery further intervenes on one assistant turn at a time. Among 237 selected degraded trajectories, 63.7% contain at least one beneficial intervention, while most tested positions remain unchanged; for binary tasks, 48.4% admit a fail‑to‑success reversal. An open‑weight case study links behaviorally consequential history changes to measurable downstream state differences, but finds task‑dependent rather than universal internal signatures. Overall, assistant‑generated history has active but selective effects on multi‑turn performance, motivating selective rather than uniform history management.
Authors:Aditi Patodiya
Abstract:
Developers increasingly run large language models locally by pulling quantized GGUF artifacts from public registries, yet nothing in the distribution pipeline functionally tests these conversions before they reach users. We executed 327 quantized code‑capable model artifacts: 305 from the official Ollama library, spanning 15 model lines at every eligible quantization level at or under 8 GB, and 22 from the most‑downloaded community repositories on HuggingFace. Each ran a 15‑task smoke suite calibrated so that healthy artifacts pass while a known‑broken one fails; suspects then faced full 164‑task evaluation, a second inference backend, an independent distributor's conversion of the same model and quantization as referee, and, for community files, re‑testing under the artifact's own template. The official library carries five silently defective artifacts, a batch of four Qwen2.5‑Coder‑3B conversions and one phi3.5‑mini conversion, that solve zero of 164 tasks and zero of the smoke suite on both backends while independent conversions of the same models work: 1.6% of official artifacts, 2 of 29 model‑and‑size conversion groups. The adjudication chain cleared small‑model artifacts that a naive threshold would condemn as broken when they are merely collapsed by extreme quantization, and it exposed two older community conversions that degrade badly on CUDA yet pass on Metal: not defective files but backend‑dependent failures, a third phenomenon no registry currently tests for. Two confirmed defects produce output whose surface statistics sit inside the healthy range, invisible to any low‑noise heuristic short of execution. We release the audit dataset, the quantcheck acceptance‑testing tool, and disclosure reports for every confirmed defect (https://github.com/aditi‑p31/quantcheck), and argue that model registries need the acceptance gate that package registries already run.
Authors:Xin Kun Lin, Ruoyu Guo, Jiaqi Guo, Maurice Pagnucco, Yang Song
Abstract:
Domain Generalized Semantic Segmentation (DGSS) is a challenging task, as vision models often rely on low‑level appearance cues that change across domains. In contrast, structural attributes exhibit cross‑domain stability, motivating the use of structural priors for DGSS. Existing methods use prompt learning to transfer such priors into DGSS models, but typically encode each class as a single holistic prompt. Moreover, these methods apply prompts uniformly to all pixels, offering no mechanism to adapt when only a subset of object regions is visible due to viewpoint changes, occlusion, and environmental variation. We address this with Spatial Hierarchical Prompts (SHP) that enrich each class with region‑level geometric anchors capturing structural appearance from distinct viewing angles, ensuring complementary coverage under arbitrary viewpoints. Additionally, we propose the Hierarchical Prompt Injector (HPI), which enables spatially adaptive prompt injection in foundation models. HPI spatially grounds prompts by modeling their semantic relevance and spatial influence with visual features. Considering the difficulty of learning spatially and semantically aware prompt injection, we further introduce auxiliary supervision to align hierarchical prompts with their corresponding object regions. We achieve 70.62% and 72.74% mIoU on synthetic‑to‑real and real‑to‑real benchmarks, respectively. Code and checkpoints are released at https://github.com/MosukFate/HPI
Authors:Quoc Viet Vo, Trung Le, Damith C. Ranasinghe, Ehsan Abbasnejad
Abstract:
Despite the significant efforts devoted to aligning large language models (LLMs) with human values and ensuring safe deployment, recent work has revealed that LLMs remain vulnerable to adversarial jailbreak attacks that can bypass safety guardrails and elicit harmful responses. Many defense methods are proposed to detect jailbreaks but they are limited in their effectiveness to counter wide‑range optimization‑based jailbreak mechanisms that can yield highly fluency‑optimized or harmful semantic obfuscated prompts. To tackle this challenge, we propose a unified detection framework SAFEGuard which incorporates a hybrid fluency measurement based on cross‑layer distribution distance and perplexity, and the analysis of harmful semantics through gradient matching. Our method is grounded in a paramount observation: high fluency prompts maintain their malicious intention close to harmful prompts while harmful semantic obfuscated prompts often inject gibberish token sequences. Our evaluation demonstrates that SAFEGuard consistently outperforms state‑of‑the‑art baselines and achieves significant improvement in accuracy across different optimization‑based jailbreaks. This underscores the effectiveness of SAFEGuard against evolving jailbreak attacks.
Authors:Yifan Wang, Zimu Wang, Suliu Qin, Changyu Zeng, Tong Chen, Siqi Chen, Yijie Lin, Lingyu Jiang, Jionglong Su, Yushan Pan, Haiyang Zhang, Wei Wang, Qiaoyu Tan
Abstract:
Glyph‑level obfuscation can leave harmful Chinese content readable to humans while degrading automated moderation. We introduce SinoGlyphBench, a diagnostic benchmark that identifies label‑critical semantic anchors and creates matched original and glyph‑obfuscated inputs in text and image modalities. By perturbing anchors, background context, or both, this design distinguishes corruption of moderation‑relevant evidence from general surface variation. Across 176,916 paired evaluations of 12 LLMs and MLLMs, obfuscation increases harmful false‑negative and false‑positive rates by 6.1 and 4.7 percentage points, respectively, and reduces four‑way accuracy by 5.0 points. Models retain 75.7% of the decisions that were correct on the matched original inputs. Full‑scope perturbations cause the largest degradation, anchor‑only perturbations are more damaging than background‑only perturbations, and cross‑script substitution is particularly difficult in the text modality. Analysis of structured outputs identifies observable mismatches in visible‑form reading, intended‑message recovery, and final safety judgment. The evaluated models, therefore, remain brittle to Chinese content written with non‑canonical glyphs. Resources are available at https://github.com/fengshun124/SinoGlyphBench.
Authors:Zhiyi Lyu, Yewen Li, Longtao Zheng, Shengtian Yang, Lang Feng, Lei Feng, Peng Jiang, Kun Gai, Qingpeng Cai, Bo An
Abstract:
LLM‑based agents are increasingly deployed in real‑world applications through tool‑use APIs, yet training them for specific environments remains fundamentally difficult: real‑world applications provide no pre‑defined tasks or verifiers, no faithful simulators, and limited budget for large‑scale environment interaction. In this paper, we propose AgentBrew, an offline training framework that learns effective tool‑use policies from a single batch of raw interaction trajectories, without task verifiers or iterative on‑policy rollouts. The agent first explores the target environment to collect a raw trajectory corpus without quality filtering. To extract training signal from this noisy corpus, \emphretrospective task inference reconstructs an aligned instruction for each trajectory based on its actual outcome, and \emphPMI‑Based credit assignment decomposes the trajectory's total information about the inferred instruction into additive per‑action credits via pointwise mutual information (PMI). These credits weight the policy training objective, amplifying informative actions while suppressing ineffective ones. On three real‑world MCP applications (GitHub, Notion, PostgreSQL), AgentBrew improves Qwen3‑32B by +8.7 Acc / +9.7 Score on average, surpassing Qwen3‑235B (+2.3 / +4.4) and outperforming rejection sampling (+5.9 / +10.3). These results demonstrate that fine‑grained offline learning can recover useful supervision from raw trajectories that filtering‑based approaches would discard. The code is available at https://github.com/alphatogo/AgentBrew
Authors:Shipeng Liu, Liang Zhao, Dengfeng Chen
Abstract:
Crack segmentation requires a model to recognize target semantics while accurately recovering thin, low‑contrast, and topologically continuous local structures. Although SAM3 provides strong open‑concept segmentation, its direct application to the crack domain still misses weak cracks, activates crack‑like background regions, and produces local boundary errors. We first diagnose the functional differences between the internal prompt‑conditioned semantic representation and native visual representation of SAM3 on five crack datasets. The results show that the semantic representation already carries most task information for crack prediction, whereas the utility of the visual representation depends on the current semantic state. Directly combining the two representations does not yield consistent gains. Based on this finding, we propose Conditional Semantic‑‑Visual Reconciliation, termed CoRe. CoRe retains semantic prediction as the primary decision path, applies lightweight semantic calibration to adjust the target‑domain decision mapping, and uses spatially aligned native visual evidence to generate a zero‑initialized, bounded, and regularized conditional residual that selectively corrects existing predictions. Across five domains, CoRe‑SAM3 improves the average Crack IoU from 62.34% to 70.47% and clDice from 81.98% to 89.24%, while introducing only 18.914 K trainable parameters. Prediction‑transition analysis further shows that CoRe corrects an average of 34.38% of native errors, with a damage rate of only 0.23% on pixels correctly classified by native SAM3. These results demonstrate that constrained prediction correction based on the functional differences between internal representations provides an effective and parameter‑efficient target‑domain adaptation strategy for vision foundation models with strong task‑specific semantic priors.
Authors:Tian Gao, Zhipeng Xie, Yuhao Wu, Junhua Liu, Xin Fang
Abstract:
Open‑weight large language models face a low‑cost white‑box threat from representation engineering attacks. Attackers can estimate refusal directions and search for projection‑matrix edits that suppress safety alignment while preserving general capabilities, within minutes on a single GPU and without gradient‑based training. We propose Bait‑and‑Recover, a weight‑level defense that places a bait adapter where attackers read activations and a paired recovery adapter at the subsequent layer. Trained via gradient routing, this decouples the observation path from the behavior path. By actively poisoning the residual signal used for measurement, Bait‑and‑Recover disrupts the attacker's edit search, while the recovery layer restores clean downstream computation. Across four open‑weight models, our defense raises the minimum refusal rate against white‑box edit searches from 16.25% to 71.75% under a strict behavior‑preservation budget (KL <= 0.10), with negligible impact on general benchmarks. By invalidating the core measurement assumption of these attacks, observation‑path poisoning offers a practical complement to behavior‑level safety training.
Authors:Duc Dm, Khai Le-Duc, Nguyen Do, Minh Son Hoang, Florent Draye, Thai Hoang, Hoang Phuong Dam, Jiarui Liu, Chris Ngo, Terry Jingchen Zhang, Anh Le Duc Tran, Nhat Do Minh, Minh Ngoc Le, My T. Thai, Ran Xu, Silvio Savarese, Mona Diab, Bernhard Schölkopf, Zhijing Jin, Huy L. Nguyen, Daeyoung Kim
Abstract:
Differentially private (DP) fine‑tuning methods treat sparse Mixture‑of‑Experts (MoE) models as a single dense block, ignoring that shared layers see all data while experts only see routed records. We identify and formally characterize three resulting failure modes: global clipping suppresses expert gradients, batch‑level normalization dilutes sparse expert updates, and fixed privacy noise degrades signal‑to‑noise ratio on low‑load experts. We introduce RAPTOR ‑ a Role‑Aware Private Training framework, which alternates shared and expert optimization and targets each failure directly, using expert‑specific clipping and noise together with a public expected‑owner denominator and a count‑independent update schedule that avoids conditioning on private, realized expert counts. We prove the resulting mechanism satisfies (\varepsilon,δ)‑DP: because each record is assigned to exactly one owner expert, per‑expert mechanisms within a layer compose in parallel, so updating all E experts costs no more, in privacy terms, than updating one, with shared and expert streams composing sequentially across training. We further derive a bias‑variance decomposition of the public‑denominator estimator showing its bias grows predictably with routing imbalance, yielding a privacy‑free rule for selecting which layer to protect from routing entropy measured on a small public corpus. Experiments on Switch Transformer and OLMoE fine‑tuning across GLUE tasks, and on DeepSeek‑VL2‑Tiny, show consistent gains over standard DP baselines across several privacy levels (\varepsilon), with the largest margins typically at the tightest budgets. Code and models are publicly available: https://github.com/leduckhai/RAPTOR
Authors:Yifan Zhang, Kai Wang
Abstract:
Visual geolocation benchmarks typically ask a model where an image was captured without accounting for the location context that users often provide. We introduce GeoContext, a resource supporting two complementary tasks: GeoHint, open‑ended localization given a true but coarse location hint, and GeoVerify, binary verification of whether an image was taken within 150 m of a claimed place. GeoContext constructs a context ladder by stratifying nearby reference points according to distance and referenceability, allowing the image to remain fixed while the supplied context varies. The benchmark covers 109 sites in 30 cities and evaluates five vision‑language models using 21,933 GeoHint responses and 6,270 GeoVerify responses. Our evaluation reveals three main patterns. First, hint repetition varies by only 1.5 percentage points across referenceability tiers and by less than 3 points across distance bands, while the resulting localization error increases steadily with hint distance. Second, behavior depends strongly on no‑context performance: at sites with low no‑context accuracy, the median ratio between localization error and hint distance is approximately 1.00, whereas at higher‑accuracy sites it ranges from 0.24 to 0.69. After correcting for bias introduced by the site grouping procedure, only one of the five models retains a negative accuracy estimate when given a nearby hint. Third, in GeoVerify, no model reaches d' = 1 for decoys immediately beyond the 150 m tolerance. Model rankings also change when sensitivity is separated from response bias, and 83.8% of false acceptances are reported with confidence of at least 0.8. We release the benchmark, construction pipeline, audit decisions, and scoring code.
Authors:Zlatan Feric, Amir Taherin, Bin Ren, Yanzhi Wang, Jennifer Dy, David Kaeli
Abstract:
We present RAGMark, a modular benchmarking framework for advanced Retrieval‑Augmented Generation (RAG) systems targeting small‑scale multi‑GPU environments. RAGMark evaluates diverse RAG components, including retrievers, vector databases, prompt‑processing methods, and generator models, while collecting detailed per‑stage metrics such as latency, GPU utilization, memory consumption, power usage, time to first token (TTFT), throughput, and answer quality. The framework is highly extensible, separating RAG stages, timing, and resource monitoring into modular components, and is designed to efficiently sweep large configuration spaces while minimizing repeated model and database initialization overhead. Using RAGMark, we characterize five RAG workloads on open‑domain QA datasets across varying retrieval depths, model scales, reranking, compression methods, and vector database configurations. We show that while autoregressive generation dominates latency in naive pipelines, context‑reduction techniques shift bottlenecks across compute, memory bandwidth, and preprocessing stages. Reranking and compression produce compounding benefits: reranking reduces compression workload itself, while both jointly reduce prefill and KV‑cache traversal costs, lowering energy consumption by up to 66%. We further observe strong cross‑stage interactions, where small upstream context reductions cascade through downstream latency, memory traffic, and energy consumption. The RAGMark source code is publicly available at: https://github.com/zferic/RAGMark.
Authors:Sultan Muratbek, Charisse Ivana Yeung, Chanwut Kittivorawong, Alvin Cheung
Abstract:
Semantic video queries let users embed natural language prompts and use multimodal large language models (MLLMs) to interpret the video. Such queries are increasingly popular for querying video data. However, their expressiveness comes at a steep cost: an MLLM may process hours of media to return only seconds of relevant output, making naive execution slow, expensive, and inaccurate. We propose Concord, a system for expressing and optimizing semantic video queries. We makes three contributions. First, we introduce Video Relational Algebra (VRA), a nested algebra over videos, transcripts, frames, and object tracks that captures common semantic video operations. Second, we derive a set of approximate optimizations that rewrite VRA queries to reduce MLLM usage while improving result quality. For narrated video, Concord either processes transcripts instead of video or uses them to identify video clips for MLLM processing. For cross‑camera queries without narration, detection and tracking replace a whole‑video MLLM join with a track‑level relational join. Third, we evaluate Concord on real‑world videos. Across 4.59 hours of soccer broadcasts and 3.92 hours of lectures, transcript‑to‑video queries send only 5.32% and 2.47% of source‑video duration to the MLLM and reduce MLLM cost by up to 87%. In two five‑second highway clips with 18 manually adjudicated cross‑camera vehicles, a Detect‑Track‑Join query improves F1 from .364 to .813 while making no MLLM calls. See our project at https://concord‑db.github.io/.
Authors:Tingyi Lin, Wen-Ren Yang, Kuanwei Chen
Abstract:
Human emotion is graded and frequently mixed, yet most multimodal recognizers collapse it onto a single hard label. We argue the recognizer should instead expose a distribution over affective space. Our text+speech system, alongside its categorical decision, emits a 9×9 probability matrix over the Valence‑Arousal plane, trained with a two‑dimensional Gaussian soft target under a Kullback‑Leibler/cross‑entropy objective, aimed at counseling support. Evaluation is strict: speaker‑independent 5‑fold leave‑one‑session‑out IEMOCAP with rotating‑session inner validation, headline metrics only on the held‑out session. Within one fixed encoder‑fusion‑head pipeline we compare Transformer and state‑space (Mamba‑1/2/3) backbones at matched depth and width, at two operating points (T\approx550, T\approx2750). The featured dual‑head system reaches 73.0% \pm 0.3 unweighted accuracy over three seeds (separate rerun: 72.1%), exceeding the Transformer fusion baseline by 3.0 UA points (95% session‑bootstrap CI [1.0,4.7]; significant under paired t‑test and session‑level bootstrap), with no latency or memory advantage at these lengths; swapping the ~1M trainable front‑end for frozen WavLM‑Large features (learnable layer weights) lifts the same architecture to 76.6% \pm 1.3. Pre‑specified controls scope the claims honestly: simpler valence‑arousal auxiliaries reproduce the classification lift within noise, and a dedicated regression head tracks the continuous ratings slightly better, so the head's specific value is the normalized affect distribution itself. That distribution recovers the circumplex: its center of mass tracks valence and arousal (CCC 0.66/0.66; predominantly between‑class structure, weaker within‑class tracking), and its entropy is weakly but consistently linked to categorical rater ambiguity, not dimensional spread.
Authors:Chong Zeng, Yue Dong, Pieter Peers, Lvmin Zhang, Maneesh Agrawala
Abstract:
We present 'RenderFormer‑V2', a unified learned transformer‑based neural rendering model, complementary to modern physics‑based rendering systems, that can handle diverse light‑transport effects such as caustics, volumetric scattering, environment lighting, textured and displaced surfaces and out‑of‑distribution materials without per‑scene training or specialized code. RenderFormer‑V2 models global light transport as a sequence‑to‑sequence transformation. Following its predecessor, RenderFormer‑V2 also employs a two stage process: a view‑independent stage that resolves intra‑scene primitive to primitive transport, and a view‑dependent stage that transforms the internal neural scene representation into image pixels. Different from RenderFormer, our model employs a novel combined windowed‑attention and rendering‑informed attention sink in the view‑independent stage to improve scalability while maintaining render accuracy. To further improve versatility, RenderFormerV2 supports heterogeneous scene primitives, including environment maps and participating media, and it employs a material encoding independent of the underlying surface reflectance model that encodes material appearance via a novel neural embedding. We demonstrate the versatility of RenderFormer‑V2 on a variety of scenes and perform an extensive ablation of the improved attention mechanism.
Authors:Justin Behling
Abstract:
Overall word error rate hides clinically critical errors: a transcript can be 95% correct and still swap one drug for another. The usual fix weights errors on medical entities, and almost always depends on an evaluation‑time named‑entity recognition (NER) model or cloud API, which makes the metric's denominator a versioned black box. We present MedWER, an evaluation protocol and open‑source tool for medical ASR whose denominator is a fixed, license‑clean term list: 19,373 drug, diagnosis, symptom, and injury‑mechanism entries projected from public sources. The protocol couples a pinned text normalizer with a phrase‑aware term‑restricted WER, the MedWER, so the only versioned component is a normalizer dependency held at an exact release and checked against committed golden fixtures. Coverage is validated against an independent provincial drug‑benefit file the list was not built from; the matching heuristic is calibrated against ground‑truth entity spans. Baselines for Moonshine~base, Whisper~base.en, and MedASR on two open benchmarks are scored with the released tool and reported with 95% confidence intervals from resampled per‑utterance scores.
Authors:Jiaming Zhao, Bing Wu, Xu Miao
Abstract:
Finite model finders cannot witness an Austin law: an identity whose finite models are all trivial but which has a nontrivial infinite model. We introduce rank‑decreasing sparse trace‑tree magmas, finitely presented total operations on a countably infinite constructor‑tree carrier. The default product pairs its arguments; finitely many positive Horn clauses define exceptions. Our main procedure derives clauses from symbolic evaluation traces. For every model found, it proves functionality of the exceptional relation by descent on constructor size, proves the identity by exhaustive symbolic case analysis, and emits a self‑contained Lean 4 certificate. A least simultaneous fixed point gives an implementation‑independent semantics, so bounded search may miss models but cannot invalidate certified results. On ETP's 96 order‑five Austin candidates, we discover and Lean‑verify infinite countermodels for 28 identities with no prior public classification in our audit. They form 14 duality classes and establish 28 new Austin classifications. Four ALPS‑known cases bring the total to 32 certified candidates. On Canonical‑4187, the deduplicated union of Order5‑130 and the 4,141‑row ALPS pool, a fresh trace run produces 636 certificates, all accepted by Judge v3. At equal resource limits, Vampire 5.0.1, E 3.5.1, and complete Twee 2.6.1 jointly prove implications in 94 canonical classes. Only Twee returns trusted counter‑satisfiable outcomes, for 18 classes; independent finite‑side certificates force 16 to be infinite. None of these ATPs emits an explicit model or Lean certificate, and none decides the 28 new classifications. To the best of our audit, this is the first automated system to synthesize this trace‑tree model family, generate well‑founded inversion proofs, and emit self‑contained Lean 4 certificates.
Authors:T. J. Barton, Chris Constantakis, Patti Hauseman, Annie Mous, Alaska Hoffman, Brian Bergeron, Hunter Goodreau
Abstract:
We present a continuous, population‑scale measurement record of autonomous language‑model trading agents operating in production across two systems with one design lineage: DX Terminal Pro (3,505 user‑funded vaults trading real ETH in Base memecoin markets for 21 days, February to March 2026) and the DXAP live alpha fleet (500 to 599 user‑created agents all‑history, 91 to 117 concurrently active, trading Hyperliquid perpetuals, June to August 2026). The record spans roughly six months, 7.5M single‑model invocations with about 300K onchain actions, and a further 231,638 multi‑tool turns producing 14,596 fills. Four findings carry the paper. First, the operating layer determines behavior more than anything written in strategy text: a risk slider explains leverage (+0.425 per level), agent fixed effects absorb 60% of variance, and a leaderboard render boundary causally routes selection (regression discontinuity 1.75x at the top‑3 cut). Second, sizing is volatility‑blind: median leverage is 5.0x in every volatility sextile, and one posture‑slider cell (11% of the book) holds 62% of liquidations. Third, agents capture almost none of the upside they reach: 43.2% of positions saw at least +300 bps of favorable excursion within 24h, yet 49.3% of those closed with a negative trade return; a mechanical bracket recovers +39.0 bps per position. Fourth, neither fleet shows a directional edge. The DXAP fleet is not profitable and trails a matched Hyperliquid retail benchmark (41% vs. 50% roundtrip win rate). A paired‑replay league of frontier models on 416 captured production scenarios finds decision quality statistically indistinguishable at this horizon, while choice stability differs sharply across model families. Every headline survives day‑clustered inference, permutation nulls, and a common‑fee restatement; the paper closes with a 17‑rule methodology canon bought with our own retractions.
Authors:Piyush Sao, Narasinga Miniskar, Pedro Valero-Lara, Keita Teranishi, Sudip Seal
Abstract:
We consider the problem of minimizing error in quantized matrix multiplication C=AB. Scalar quantization of the factors introduces rounding errors whose scale depends on the maximum absolute entries ‑‑ the ranges ‑‑ of their rows and columns. These ranges determine the quantization grid steps. To reduce the error, we optimize over product‑preserving transformations that alter the factor ranges and grid steps without changing C. Specifically, we seek the smallest leading expected squared error over invertible inner changes of basis and orthogonal outer rotations. Under independent, zero‑mean subtractive dither noise on an unbounded lattice, we prove the output‑only bound E_\rm lead \ge (c_A+c_B)/K \Vert AB\Vert_^2, where K is the inner dimension, c_A and c_B are normalized noise variances, and \Vert AB\Vert_ is the nuclear norm. The bound is tight: an SVD‑aligned Hadamard construction attains the infimum whenever a Hadamard matrix of order K exists, including every power of two, while an SVD‑aligned DCT construction is within a factor of two for every K. Without outer rotations, Gram‑matrix balancing minimizes factorization energy, and finite‑set flattening achieves the bound within C\log(K(m+n)). For power‑of‑two K, conditional expectations deterministically select the Hadamard signs in O((m+n)K^2) exact‑real operations. Synthetic experiments verify both constructions and illustrate the tradeoff between regularization and conditioning. These results characterize the full‑gauge optimum and quantify the cost of preserving row and column indices.
Authors:Santhoshkumar V
Abstract:
A voice agent has to decide, at every pause, whether the user has finished speaking. Without a model of the language that decision falls back to a fixed silence timeout: set it short and the agent interrupts, set it long and every turn pays the full wait. Open semantic end‑of‑turn detectors exist, but to our knowledge none covers a South Indian language. We release TamilEOT: 18,485 labelled turn boundaries cut from 116 real Tamil telephone conversations, and two audio‑only detectors fine‑tuned from Smart Turn v3. On a held‑out split of 4,168 clips from 30 unseen calls, accuracy rises from 70.30% zero‑shot to 83.71% (8.7 MB) and 86.13% (21 MB); ROC‑AUC rises from 0.751 to 0.921. Both models run in under 150 ms single‑threaded on a laptop CPU. We also report what building it cost. Rule‑derived labels, checked against a blind human listening pass, were right 95.9% of the time on the positive class and 44.4% on the negative class, which is below chance, because the rule answered a different question than the model is asked. Replacing them with an audio‑LLM labeller measured at 97.5% human agreement cost US5.69. Of every training lever we measured, only encoder capacity moved the result; three runs at identical config and seed span 0.87 accuracy points, which is the floor below which none of our other deltas mean anything. Replaying the same labelled boundaries through the production VAD and streaming adapter costs a further 2.60 points, and 7.8% of boundaries are never surfaced to the model at all. Data, weights, code and every negative result are public.
Authors:Xingjian Ran, Xiaoye Mo, Sihao Liu, Jianyu Zhang, Li Luo, Bo Dai
Abstract:
Diverse and simulation‑ready indoor scenes are essential for interactive entertainment and embodied AI, yet their scalable generation remains challenging. Recent agentic text‑to‑3D scene pipelines that rely on vision‑language models (VLMs) can generate scenes of high fidelity but require costly iterative object placement and refinement. Another mainstream paradigm, parametric image‑to‑3D scene models, produces scenes efficiently from strong priors learned from 2D images but often leads to imprecise and physically invalid scenes. More importantly, both paradigms struggle to output diverse scenes for a single input, making it hard for them to reflect the dynamically changing nature of real scenes. In this paper we propose SceneMosaic, a framework that combines the merits of both paradigms. It obtains the initial candidate from the learned image‑based prior, and subsequently evolves the result through VLM agents, ensuring both efficiency and physical validity. Within the evolution process, SceneMosaic exploits the locality of natural scenes and decomposes a scene into independent local units, allowing separate evolution within each unit before composing the global scene via Cartesian product. On SceneEval‑100, SceneMosaic matches the strongest agentic baseline in semantic layout quality with a 24x speedup, substantially reduces physical violations, and receives the highest human ratings. Our code is publicly available at https://github.com/rxjfighting/SceneMosaic.
Authors:Lejun Zhang, Sarah Lu-Liang, Xin Jiang, Muning Wen, Weinan Zhang, Shangding Gu
Abstract:
Safety evaluations typically focus on individual agents, but interacting agents can spread harmful information and influence the environment in which later decisions are made. We study how collective failure changes with harmful‑agent fraction and society size in a controlled financial agent society, where agents communicate over a social network and trade in a shared market. In the primary financial scenario, collective failure requires broad harmful diffusion together with severe price dislocation or liquidity stress. Across all tested society sizes, failure remains rare at low harmful fractions but rises sharply over a narrow range. As society size grows from N=100 to N=2000, the harmful fraction associated with a 50% failure probability decreases from 4.7% to 2.2%, while the corresponding number of harmful agents increases from approximately 5 to 44. In contrast, when the number of harmful agents is held fixed, their impact becomes weaker as the society grows. Controlled interventions further show that broader network reach shifts the collapse boundary toward lower harmful fractions, whereas stronger conformity alone has little effect. To characterize these effects, we introduce Agent Society Dynamics, a finite‑size framework for relating harmful‑agent fraction, society size, and interaction structure to collective failure. Overall, our results reveal a nonlinear, size‑dependent collapse transition in financial agent societies, showing that collective failure depends not only on the prevalence of harmful agents but also on the size and interaction structure of the surrounding society. Code is available at https://github.com/SAIL‑Research‑Lab/WolfSociety.
Authors:Anthony Shilati, Anunth Ramaswami, Luke Batteas, Sylvia Tan, Anthony Barcio, Sairam Umakanth, Preksha Rao, David McDougall, Landry Graves, Ahmet A. Ozkan, Yunsoo Yoon, Arushi Pradhan, Michael G. Henry, Rohan Kota, Damian Gonzalez, Gray C. Thomas, Gary K. Fedder, J. Edward Colgate, Kevin M. Lynch
Abstract:
Robot hands are a key interface between AI and the physical world, making advances in robotic dexterity essential to realizing the vision of physical AI. While impressive dexterity has been demonstrated with simple grippers, multifingered hands offer the potential for substantially greater versatility, precision, and adaptability in manipulation. In this review, we survey the state of the art in benchmarking the dexterity of multifingered robot hands. Recognizing dexterity as a complex and multifaceted concept, we present the perspective of the U.S. National Science Foundation HAND Engineering Research Center, with a particular focus on fine in‑hand manipulation. We introduce a framework consisting of three benchmark levels that correspond to increasing system complexity, review representative benchmarks at each level, and propose new benchmarks and metrics to address limitations in the literature. More information can be found at https://hand‑erc.github.io/benchmarking/.
Authors:Márcus Lobo, Vitor Matias, Afonso Paiva, Jeová Farias, Tiago Novello, Moacir Ponti
Abstract:
Vision‑Language Models (VLMs) are reshaping computer vision by aligning visual and textual embeddings, allowing models to recognize visual concepts and reason about them using natural language. Traditional 3D deep‑learning models, however, are typically trained for specific tasks, such as classification, segmentation, or detection, and do not naturally support cross‑modal retrieval from their embedding spaces using text or images as queries. To address this issue, Contrastive Language‑Image Pretraining (CLIP)‑based methods align 3D embeddings with pretrained image and text representations, giving rise to 3D Vision‑Language Models (3D VLMs) that support zero‑shot classification, cross‑modal retrieval, and open‑vocabulary recognition of 3D shapes. This tutorial provides an overview of 3D VLMs, ranging from basic definitions of 3D representations and their encoding into embeddings to cross‑modal contrastive alignment, modern multimodal frameworks, and 3D Vision‑Large Language Models (3D VLLMs). We present the main definitions of contrastive learning for multimodal embedding alignment and highlight recent advances in language‑guided 3D Gaussian splatting, 3D shape generation, and embodied AI for robotics.
Authors:Sachin Giri, Thomas Zhao, Matthew Huynh, YangQuan Chen
Abstract:
The autonomous localization of fugitive gas emissions using small Unmanned Aircraft Systems (sUAS) constitutes a fundamentally ill‑posed inverse problem. In turbulent atmospheric boundary layers, highly intermittent scalar concentration fields violate the assumptions of classical gradient‑based navigation, causing data‑driven estimators to suffer from severe noise and spurious local minima. To address these challenges, we introduce an Information‑Guided Safe Reinforcement Learning framework evaluated within a custom, GPU‑accelerated 3D simulation environment coupling an Eulerian wind solver with a Lagrangian puff dispersion model. We identify a critical vulnerability in deterministic information‑seeking planners ‑ a Gramian bias where agents act greedily upon flawed early estimates, starving the estimator of spatial diversity. To systematically break this degeneracy, our architecture integrates a classical empirical observability Gramian (EMGR) planner with a learned Soft Actor‑Critic (SAC) exploratory policy. A deterministic meta‑supervisor actively monitors estimator reliability via Kullback‑Leibler (KL) divergence, dynamically blending deterministic exploitation with learned exploration to steer the sUAS into high‑information zones. Trained via a progressive curriculum and safeguarded by a strictly enforced Robust Control Barrier Function (RCBF), our RL framework achieves nearly 80% localization success on complex, mobile sources ‑ drastically outperforming classical baselines (~30%) ‑ while ensuring zero safety violations.
Authors:Zeyang Cui, Jiannong Cao, Zhiyuan Wen, Bo Yuan, Junlan Feng, Shengyuan Chen
Abstract:
Agent memory allows LLM agents to use earlier interactions when answering new queries. Existing methods often compress interaction histories into summaries or other LLM‑generated representations. Repeated generation adds cost and can discard answer‑bearing details before the system knows what a future query will require. We propose EdgeMem, an agent‑memory method built around a simple principle: preserve original interaction turns and organize them through complementary content, temporal, and episodic cues. EdgeMem realizes this principle with a multi‑anchor hypergraph constructed by lightweight local processing. Retrieval directly returns source evidence and reserves LLM use for final answer generation, combining structured access to multi‑session histories with faithful retention of the original conversation. Experiments on LoCoMo and LongMemEval‑S show strong retrieval and memory‑grounded question answering; on LoCoMo, EdgeMem achieves the highest strict‑judge score among seven reproduced systems under a shared prompt (61.01 versus 58.70), while construction and retrieval require no generative‑LLM calls. Overall, EdgeMem shows that preserving and organizing source evidence provides an effective and efficient foundation for agent memory without generative memory management.
Authors:Hao-Xuan Ma, Jin-Fei Qi, Yicheng Xiao, Han-Jia Ye
Abstract:
Multimodal large language models (MLLMs) have recently made strong progress in vision‑language reasoning, yet their performance often degrades as generations grow longer. A key factor is that they frequently lose track of earlier visual evidence and intermediate constraints under a monolithic growing context. Inspired by how humans separately recall what they see and what they infer when solving complex tasks, we propose DLMR, a parameter‑efficient mechanism that equips MLLMs with Dual Latent Memories: a visual memory that compresses image evidence and a reasoning memory that tracks intermediate conclusions and constraints. A Router then dynamically decides which memory and how much to reuse during inference, preserving visual grounding while maintaining coherent long‑horizon reasoning. DLMR is trained in three stages, from latent memory construction to selective router learning, while keeping the base MLLM frozen, yielding substantial gains on both general and reasoning benchmarks with only a small number of additional trainable parameters. Analyses further show interpretable, state‑dependent routing with specialized memory roles and reduced decoding tokens over long generations. Code is available at https://github.com/Hunter‑Wrynn/DLMR.
Authors:Cheng Yin, Wang Xu, Junpeng Yang, Sikyuen Tam, Hanyu Liu, Yuan Yao, Xiangrui Zeng, Junbo Cui, Yequan Wang, Zhouping Yin, Yankai Lin
Abstract:
Long‑horizon manipulation is partially observable: the information needed to choose the next action may appear only in observations from minutes earlier. Existing memory mechanisms: retrieval banks, learned compressors, recurrent states must decide what to keep from the past before knowing what a future decision will require. This was motivated by the assumption that minute‑scale history is too large to process directly, which modern VLM backbones no longer make true. In this work, we introduce SimpleMemVLA, a VLA without a dedicated memory module. It keeps the sampled history intact and passes it to the backbone in the timestamped video format the backbone was pretrained to process; the hidden states of a generated sub‑task then form the only channel from history to a standard flow‑matching action head. Since consecutive decisions share most of their history, prefilling the shared prefix during action execution keeps latency close to a single‑frame VLA. SimpleMemVLA sets a new state of the art on four memory benchmarks without cost on general‑purpose control. Holding the backbone and training setup fixed, it outperforms retrieval, compression and recurrent‑state mechanisms by a wide margin, and causal interventions confirm that the policy genuinely reads its history. Code available at https://github.com/wadeKeith/SimpleMemVLA
Authors:Guorui Song, Runqing Tang, Jingye Zhang, Luyuan Zhang, Feice Huang, Cong Ray, Guocun Wang, Dake Zhong, Choo Sin Wai, Bingquan Dai, Chuming Wang, Tongxu Lin, Wanyu Guo, Haoqian Wang
Abstract:
Large vision‑language models (VLMs) are increasingly deployed in safety‑critical settings, yet existing visual jailbreak research has focused almost exclusively on autoregressive architectures, leaving an important emerging family unstudied: multimodal discrete diffusion vision‑language models (dVLMs). We identify a vulnerability specific to diffusion generation: because the visual embedding conditions every reverse denoising step rather than acting as a one‑time prefix, adversarial visual semantics are repeatedly propagated and amplified across the generation trajectory, a phenomenon we term cross‑step conditional propagation. We provide empirical evidence through stage‑sensitivity analysis, prompt‑level switch rates, and pairwise denoising‑bin disagreement metrics, confirmed by bootstrap resampling. We propose DIVA (Discrete‑diffusion Vision‑language model Attack), a white‑box visual jailbreak framework using cross‑modal intent obfuscation and diffusion‑aware multi‑timestep adversarial optimization. Across three dVLMs, DIVA reaches 58.8%, 67.7%, and 69.1% HADES ASR under the Beaver reward‑model metric, outperforming visual jailbreak baselines designed for autoregressive models. Code: https://github.com/loststars2002/DIVA
Authors:Falk Dettinger, Akshay Narla, Michael Weyrich
Abstract:
The limitations of on‑board sensors and blind spots caused by occlusion cause the reduction of perception quality in autonomous vehicles. In such cases, cooperative perception provides additional data via Vehicle‑to‑Everything communication to enhance local perception, causing a large volume of data transmission. The vehicle can focus on acquiring and utilizing relevant data according to the prevailing road context by identifying the current traffic situation. To achieve this, we propose a concept for the situation identification of the vehicle using Bird's‑Eye‑View images. Firstly, the situation around the vehicle is identified using object detection with semantic segmentation, followed by understanding the context of the traffic using a situation identification module consisting of an open‑source projective transformation network Cam2BEV and a situation identification neural network. The concept was evaluated and validated by running the software on the CARLA simulator using the in‑built RGB camera and the semantic segmentation camera. Additionally, the portability of the situation identification module for real‑world applications was verified on Cityscapes and nuScenes urban driving datasets. Overall, the proposed situation identification approach enables efficient sensor data management by prioritizing relevant data to the current traffic situation. The source code is available in the following link: https://github.com/akshaynarla/DySi_Select
Authors:Jianwei Zhang, Sihan Cao, Pengcheng Zheng, Ya Wen, Pei Ke, Kuien Liu, Shen Gao, Wei Dong, Yang Yang, Chaoning Zhang
Abstract:
Web agents have achieved significant success in automating complex internet tasks but deploying them in real‑world environments requires continuous online adaptation. Given that deploying powerful proprietary models remains commercially cost‑prohibitive, practitioners must rely on lightweight local models that evolve post‑deployment via online teaching from a stronger teacher. However, standard interactive feedback imposes prohibitive costs. We show that conventional trajectory‑level preference optimization wastes budget on both unresolvable episodes and redundant execution turns. To resolve these inefficiencies, we propose Score‑Guided Online Teaching with Budgeted Trajectory Trimming, a budget‑aware framework that systematically orchestrates when and what to teach. Specifically, our framework integrates a solvability‑aware teacher gate to dictate when to query the teacher model and a score‑guided turn selection mechanism to decide what informative turns to retain. Extensive experiments on MiniWoB and TimeWarp demonstrate that our method achieves comparable first‑pass success while reducing teacher calls by 22.6% and student training compute by 52.1% on average. Our code is available at https://github.com/zjw131f1fc/budgeted‑online‑teaching.
Authors:Bowei He, Xiaokun Zhang, Meng Ding, Xue Liu
Abstract:
Web agents need to navigate visually rich, long‑horizon interfaces that change across sites, yet most previous agents still learn each task in isolation and discard the procedural knowledge they accumulate. Recent skill‑augmented frameworks take an important first step, but they treat the skill library as a flat or two‑tier prompt‑side cache and offer no principled mechanism for compressing redundancy or composing skills recursively. We introduce \textscScaffold, a self‑improving framework for visual web agents that (i) induces parametric, executable skills from successful trajectories under a multi‑instance abstraction constraint, (ii) maintains a recursively composed hierarchy in which higher‑level skills invoke lower‑level ones, (iii) compacts the library via a minimum‑description‑length (MDL) criterion and behavioral equivalence checking, and (iv) periodically distills skill‑augmented trajectories back into model weights to internalize the abstractions. Across WebArena, VisualWebArena, and a held‑out split of Online‑Mind2Web, \textscScaffold improves success rate by 11.1‑‑17.2 absolute points over the strongest skill‑augmented baseline and shows monotonic gains across five self‑improvement iterations without library collapse. We release the code and documents in the Github \hrefhttps://github.com/BokwaiHo/SCAFFOLDrepository.
Authors:Miguel Zabaleta, Baihan Lin
Abstract:
Systematic reviews require sustained human judgment across thousands of records, yet existing evaluations of large language models (LLMs) typically examine review stages in isolation. We introduce SciLitBench, a multi‑stage benchmark spanning title and abstract screening, full‑text screening, and schema‑guided data extraction, with 42,981 retrieved records, 1,012 full texts, and annotations for 888 included papers. Across 22 open‑weight LLMs from six model families, explicit inclusion and exclusion criteria improve title and abstract screening F_2 by 28.8%, while researcher‑authored rationales improve full‑text screening by 15%. Data extraction reveals a different reliability regime: performance declines from 0.97 accuracy for publication year to 0.37 Jaccard overlap for computational approach, while the strongest models recover only 30% of annotated evaluation evidence and 25% of limitations. SciLitBench identifies a practical boundary between high‑recall screening and evidence‑complete extraction and provides a reproducible resource for evaluating LLM‑assisted evidence synthesis.
Authors:Ozgur Kara, Tarik Can Ozden, Furkan Horoz, Zeqian Long, Haotian Xue, Yipu Chen, Oguzhan Akcin, Yongxin Chen, James Matthew Rehg
Abstract:
Diffusion models have become the dominant family of generative models in the visual domain. However, their widespread public availability enables misuse at scale, motivating a rapidly growing body of research on adversarial attacks and defenses. This survey provides, to our knowledge, the first unified review of this literature across three visual modalities: image, video, and 3D. We introduce a comprehensive, task‑centric taxonomy: we first divide the literature by modality; within each modality, we separate methods into attacks and defenses, and then group them by the generative task they target, presenting them chronologically within each task. Moreover, we provide an in‑depth analysis of their evaluation settings, consolidating the datasets, metrics, and benchmarks used to assess them. We conclude by identifying several open challenges and outlining concrete future research directions. Project Webpage: https://github.com/ozgurkara99/awesome‑adv‑attack‑defense‑on‑diffusion
Authors:Wai Lok Wan, Ayah Mahmoud, Sergio Mutis, Avantika Velho, Annie Xing, Behnaz Farahi
Abstract:
We present a robotic electrospinning platform and design method for depositing nanofiber membranes onto non‑planar, three‑dimensional conductive geometries. Conventional electrospinning relies on fixed emitters and planar grounded collectors, which restricts deposition to flat substrates: on concave geometries, field shielding prevents fibers from reaching recessed regions, and material bridges across elevated features instead. We address this with a custom end‑effector integrated with a six‑axis UR20 arm. The tool carries a localized stepper‑driven syringe pump that maintains consistent polymer flow independent of orientation, and routes high‑voltage DC (up to 25 kV) directly to a robot‑mounted needle, turning the arm into a mobile emitter with full kinematic control over position, orientation, working distance, and traversal velocity. Toolpaths that continuously reorient the emitter along surface normals give access to concave topologies unreachable by fixed‑axis systems. We characterize the resulting deposition behavior in two parts. A catalog of four bio‑compatible polymer systems (PEO, PVA, keratin‑PEO, silk‑PEO) establishes the operating envelope, reporting deposition speed, jet stability, fiber size, alignment, and durability for each. A taxonomy of 3D‑printed conductive scaffolds spanning geometric primitives, hybrid compositions, and square, triangular, and hexagonal lattices links collector geometry to fiber alignment, density, and cross‑void bridging. We also demonstrate programmable grounding, in which selectively energized pins in an array steer deposition without changing physical geometry. Assembly instructions and toolpath‑generation code are released as an open‑source repository.
Authors:Samer Abualhanud, Max Mehltretter
Abstract:
Reliable 3D understanding of the surrounding environment is a core requirement for autonomous driving. Multi‑view surround camera rigs provide broad scene coverage, but the spatially adjacent images typically overlap only minimally. Consequently, the depth of most pixels must be inferred from monocular appearance cues. These cues can appear differently across images and may therefore be interpreted differently by the depth estimation model. We target two main sources of cross‑image inconsistency: differences in camera intrinsics and the limited receptive field of each image. We address the former by conditioning the features on per‑pixel camera‑aware ray embeddings, enabling the network to account for camera‑dependent variations in monocular cues. We address the latter by extending each pixel's context beyond its own image through cross‑image attention constrained to geometrically plausible regions, derived from the calibrated rig setup. The model is trained in a fully self‑supervised manner based on photometric consistency. Evaluations on DDAD and nuScenes show improved overall depth accuracy and cross‑image depth consistency over state‑of‑the‑art self‑supervised methods under in‑domain and cross‑domain evaluation. Code is available at https://abualhanud.github.io/CrossDepthPage/.
Authors:Homayoun Afshari, Pietro Basci, Alessandro Russo, Lia Morra
Abstract:
Visual reasoning tasks require a system to jointly perceive visual content and apply formal relational constraints‑‑‑a combination that neither pure neural nor purely symbolic approaches handle well in isolation. This paper proposes a Neuro‑Symbolic (NeSy) framework that closes this gap by tightly coupling a Vision‑Language Model (VLM) for automatic First‑Order Logic (FOL) rule induction with a Dynamic Logic Tensor Network (D‑LTN) for differentiable rule verification, in a closed iterative feedback loop. The VLM receives a small set of labelled visual examples and proposes candidate FOL rules conforming to a strict grammar (Think); the D‑LTN is automatically assembled from these rules at runtime and evaluates them grounding on CNN‑produced visual embeddings (Verify); and verification failures are fed back to guide the VLM's next hypothesis (Revise). Evaluated on the ViSudo‑PC benchmark across four visual domains (MNIST, EMNIST, KMNIST, FMNIST), the system induces valid Sudoku constraint rules using only three training examples as visual context. The proposed method achieves AUC scores matching or outperforming previous methods (NeuPSL, LTN), showing the potential for automatic rule discovery through VLM. Code is available at https://github.com/homayoun‑afshari/nesy.
Authors:GeonU Kim, Shin Dong-Yeon, Tae-Hyun Oh
Abstract:
We propose Ref‑GeNVS, a training‑free, reflection‑aware method for generative novel view synthesis (NVS) in mirror scenes. Existing multi‑view diffusion models often fail to recognize the mirror in the scene and cannot exploit reflected content for scene generation. To fix this issue without additional training, our key idea is to treat a mirror image as two complementary views. From input images, we estimate the mirror plane and reflect camera poses to form virtual views. Based on this virtual view setup, we propose a two‑stage generation method consisting of Mirror‑gated attention and Reflection injection, which enables reflection‑consistent NVS by explicitly leveraging reflection relationships in a multi‑view diffusion model. Ref‑GeNVS inherits the strong generalizability of the multi‑view diffusion backbone, while it does not require finetuning. On synthetic and real scenes including mirrors, Ref‑GeNVS outperforms recent generative NVS methods by generating reflection‑consistent and contextually coherent novel views, revealing scene structure visible only through mirrors. Project page: https://kim‑geonu.github.io/Ref‑GeNVS/
Authors:Ethan Ma, Zihan Wang, Chris Siu Yeung Chow, Xinguo Feng, Qingqing Li, Rui Jiang, Naipeng Dong, Guangdong Bai
Abstract:
Generating categorical graphs requires choosing node and edge types that form a coherent structure without depending on node order. Many graph generators encode categories as fixed one‑hot vectors, which can impose an artificial geometry in which categories are equidistant. We propose Embedded Graph Flows (EGF), a generative model that learns continuous embeddings for node and unordered‑edge categories and transports Gaussian noise towards these learnt endpoints using a permutation‑equivariant graph transformer. A terminal readout maps the embeddings back to discrete graph categories. Across molecular benchmarks, EGF achieved competitive performance. On QM9, EGF gives the best result on all four reported metrics among the three methods, including a Fréchet ChemNet Distance (FCD) of 0.150, compared with 0.717 for the categorical‑diffusion baseline DiGress and 0.812 for the bridge‑based baseline GruM. When applied to larger molecules in ZINC250k, EGF retains the lowest maximum mean discrepancy (MMD) using the neighbourhood subgraph pairwise distance kernel (NSPDK), indicating close agreement with the local substructures of the reference molecules. Our code is available at https://github.com/Trusted‑System‑Lab/EGF.
Authors:Kun Hu, Menggang Li, Kaidi Wu, Zhiwen Jin, Yingjie Zhao, Chaoquan Tang, Eryi Hu, Gongbo Zhou
Abstract:
Achieving robust SLAM in large‑scale underground coal mines with complex structures and severe degeneracies remains highly challenging. Dense smoke and dust cause substantial loss of visual information and degrade LiDAR point‑cloud features, while long, self‑similar corridors induce geometric degeneration, leading to pronounced odometry drift. To address these issues, we propose FIRE‑LIVWO: Failure‑Immune mmWave Radar‑Enhanced LiDAR‑Inertial‑Visual‑Wheel Odometry, a tightly coupled multi‑modal odometry framework based on an iterated error‑state Kalman filter (IESKF). The framework fuses 4D mmWave radar, LiDAR, and visual features within a unified VoxelMap and jointly constructs LiDAR‑radar point‑to‑plane residuals and sparse visual photometric residuals. In smoke‑filled environments, we exploit the strong penetration of 4D mmWave radar and introduce pointwise Doppler velocity constraints to preserve state observability. In geometrically degenerate corridors, we tightly couple wheel odometry using non‑holonomic constraints (NHC) and online lever‑arm compensation to reduce drift. Our central contribution is a degeneration detection and adaptive fusion model switching strategy grounded in geometric and visual observability analysis, which quantifies observability online and dynamically adjusts modality weights. Real‑world experiments in underground coal mines demonstrate that FIRE‑LIVWO accurately identifies failure boundaries, enabling reliable modality switching under extreme conditions. Compared with baselines, it achieves superior accuracy and robustness (average localization error of 5.677m). We open source our code on Github to benefit the robotics community.
Authors:Zhenxuan Fan, Bo Zhang, Yutong Lin, Yuqian Yuan, Juekai Lin, Liang Liang, Zhuoyi Huang, Wenqiao Zhang, Juncheng Li, Siliang Tang, Jun Xiao, Yueting Zhuang
Abstract:
Vision‑Language‑Action (VLA) models have shown promising progress in language‑conditioned robotic manipulation. However, existing datasets and benchmarks mainly evaluate task completion under predefined settings, offering limited insight into model reasoning under increasing spatial and procedural complexity. We introduce RoboSPA (Robot Spatial‑Procedural Assessment), a large‑scale robotic manipulation dataset and benchmark for diagnosing embodied reasoning in VLA models. \textttRoboSPA focuses on two core dimensions, Fine‑Grained Spatial Reasoning and Long‑Horizon Procedural Planning, covering 10 task categories and 56 base tasks. Each task is instantiated across five difficulty levels, yielding 280 variants with increasing spatial ambiguity and procedural complexity. We collect 527K trajectories across multiple embodiments and diverse scenes. Beyond binary success rate, \textttRoboSPA introduces diagnostic metrics for more detailed evaluation. Experiments on representative VLA models show that current systems still struggle with complex spatial relations, precise low‑level execution, and memory‑intensive planning. These results establish \textttRoboSPA as a challenging diagnostic benchmark for developing more capable, reliable, and generalizable embodied agents. Our data and code are available at https://github.com/fanzhenxuan/RoboSPA.
Authors:Chris Zheng, Geng Yang
Abstract:
LLM agent systems increasingly combine provenance tracking, authorization, policy enforcement, protocol adapters, and execution controls. However, individually correct security mechanisms do not necessarily compose into an end‑to‑end secure system: security‑critical context may be dropped, widened, rebound, or reinterpreted as actions cross component boundaries. We identify this failure mode as security‑context discontinuity and introduce CONTINUITY, a framework for verifiable composition of agent security controls. CONTINUITY models each component with an assume‑guarantee contract and carries authenticated security context across transitions using signed root grants, provenance commitments, role‑bound transition receipts, bounded typed releases, transformation witnesses, and effect‑bound execution permits. We formalize end‑to‑end consequence integrity, requiring every realized external effect to be backed by a valid and current authorization witness linking the principal, task, provenance, delegation, policy state, canonical action, and finality boundary. We implement a reference verifier and deterministic cross‑layer fault‑injection suite covering 32 fault classes across four application domains. In 2,560 parameterized attack instances spanning 128 fault‑domain classes, the full CONTINUITY configuration commits no harmful external effect, while completing all 700 benign tasks and escalating all 200 ambiguous cases. These results show that secure agent execution requires not only sound individual controls, but explicit contracts that preserve their guarantees across the complete instruction‑to‑effect path.
Authors:Zipei Ma, Xiaofei Wei, Junzhe Jiang, Shunlin Lu, Li Zhang
Abstract:
World‑action models guide action generation with predicted future observations, but vision‑centric predictions miss the local contact cues that decide contact‑rich manipulation. However, naively predicting future tactile observations as additional views recovers only a third of the achievable gain in our experiments. This gap reflects a timing mismatch: predictions precede execution, while tactile feedback arrives during it. We introduce TacPAC, which turns tactile prediction into real‑time action correction. Once the base model has planned an action chunk, TacPAC caches the predicted contact that plan was conditioned on together with the plan's own representation, and a tactile expert reads each newly observed tactile image against that cache to correct the actions not yet executed. Feedback is thus interpreted against what the plan anticipated rather than in isolation, and one correction is a single pass over that cache, 20.7× cheaper than regenerating the chunk. On five real‑robot tasks spanning precision insertion, fragile‑object handling, object reorientation, and long‑horizon manipulation, TacPAC leads every task and raises the average from 22% for its vision‑only base model to 64%. Code is available at https://github.com/LogosRoboticsGroup/TacPAC.
Authors:Florian Hahlbohm, Jorge Condor, Linus Franke, Martin Eisemann, Marcus Magnor
Abstract:
Explicit primitive‑based radiance fields such as 3D Gaussian Splatting typically model view‑dependent appearance using low‑order spherical harmonics (SH). Although efficient to evaluate, SH coefficients dominate per‑primitive storage and memory traffic, while their band‑limited basis restricts angular detail. We present a thorough, end‑to‑end comparison of SH and recent spherical appearance models and introduce an implicit alternative that decodes compact per‑primitive latent codes using a tiny shared MLP. We integrate all models into the same optimized pipeline, fusing their forward and backward passes into a differentiable CUDA rasterizer and provide a portable WebGL viewer for laptop and mobile GPUs. Our evaluation across reconstruction quality, memory use, and optimization and rendering performance shows that recent spherical models offer the strongest overall quality‑efficiency trade‑off. Our neural representation is the most compact model evaluated and, compared to third‑degree SH, reduces the per‑primitive appearance footprint from 192 to 28 bytes, accelerates optimization by 1.3×, while improving reconstruction quality. We further analyze how appearance parametrization shapes optimization, identifying differences in recovered geometry and the tendency of expressive models to absorb non‑static scene content. Together, our framework and analysis provide practical guidance for replacing SH beyond what image metrics alone can capture.
Authors:Manu Agrawal
Abstract:
Autonomous AI agents increasingly select actions in environments whose memory, execution‑time, runtime, compute, and operational constraints determine what counts as a suitable plan. We call the absence of this execution context from an agent's planning state substrate blindness. We test this general proposition through numerical code generation, where selected implementation choices and operational consequences are directly observable. Three frontier model configurations‑‑Anthropic Claude Opus 5, OpenAI GPT‑5.6‑Sol, and Google Gemini 3.7 Flash‑‑generate code for a high‑dimensional pairwise Euclidean‑distance task either from the task alone or with a 128 MB RAM and 10.0 s wall‑time contract. Contract disclosure reduced measured peak process memory in 13 of 14 executable index‑aligned task‑only versus contract‑disclosed comparisons and reduced mean wall time in all three cohorts, making execution up to 3.1x faster. Across the audited corpus, disclosure produced structural code changes including bounded blocking, float32 retention, upper‑triangle traversal, and in‑place or memory‑mapped buffers. At a tighter 96 MB contract, independently sampled contract‑disclosed cohorts achieved correct‑and‑within‑budget outcomes of 4/5 for Claude Opus 5, 5/5 for GPT‑5.6‑Sol, and 3/5 for Gemini 3.7 Flash, compared with task‑only outcomes of 0/5, 1/5, and 0/5; cohort mean MaxRSS and wall time were 49‑74% and 35‑64% lower than their task‑only references. These results establish a controlled proof of concept for substrate‑aware agent planning: a minimal execution contract induces proactive structural adaptation in generated programs, shifting computation away from unconstrained allocations and substantially improving observed resource‑time profiles before execution.
Authors:Tianjie Ju, Xinyue Xu, Wanxuan Sun, Lingxiao Diao, Gongshen Liu, Zhuosheng Zhang, Cheng Yang
Abstract:
Recent progress in multimodal large language models (MLLMs) has fueled significant enthusiasm in their potential to act as autonomous agents for real‑world tasks. However, scenarios requiring agents to fulfill users' complex, structured requirements remain largely underexplored. In this work, we examine reasoning tasks under three distinct requirement scenarios: (i) Must‑have requirements uniquely determine a unique feasible solution; (ii) Multiple answers satisfy the must‑have requirements and are prioritized via the nice‑to‑have requirements; and (iii) No candidate solution satisfies the must‑have requirements, in which case the agent should abstain from generating a response. We evaluate state‑of‑the‑art MLLMs on 3,649 carefully constructed problems that reflect realistic service scenarios, including e‑commerce, booking, and map‑based or ride‑hailing. Our evaluation reveals that existing MLLMs exhibit catastrophic failures in all scenarios. They frequently misinterpret task requirements, violate must‑have requirements, and produce invalid solutions. To address this critical gap, we propose First Things First Reinforcement Learning FTF‑rl that explicitly optimizes reasoning over multi‑priority user requirements. Experimental results show that our method substantially improves the task success rate compared to strong baselines. Moreover, FTF‑rl yields general effectiveness on popular logical and mathematical reasoning tasks, including LogicVista, MathVision, and InfoQA. Our findings suggest that enhancing requirement‑aware reasoning capability provides a simple yet effective pathway to improve generalization of MLLM agents. Code and dataset are available at https://github.com/claire62/FTF‑RL.
Authors:Rita Cordeiro Mendes, Maria Rita Fonseca Verdelho, Carlos Santiago, Catarina Barata
Abstract:
Multi‑modal learning has demonstrated strong potential in medical applications by integrating heterogeneous data sources such as medical imaging, clinical records, and genomics to improve predictive performance and support clinical decision‑making. However, advances in this area are often constrained by two key challenges: the limited availability of well‑curated, ready‑to‑use datasets that accurately reflect real‑world conditions, where medical data are frequently collected inconsistently and are often incomplete; and the inherent difficulty of integrating heterogeneous data modalities. In this work, we introduce a newly curated multi‑center, multi‑modal, and longitudinal dataset designed to support the evaluation of a wide range of learning pipelines under realistic conditions. The dataset comprises a total of 1,365 lung cancer patients and has three imaging modalities (whole‑slide images, CT scans, and PET scans), structured clinical data, transcriptomic, and longitudinal follow‑up and treatment information. For each imaging modality the dataset contains more than one instance. Moreover, the dataset exhibits substantial and non‑uniform missingness across modalities, making it well‑suited for studying robust multi‑modal fusion strategies. We further provide both uni‑modal and multi‑modal benchmarks on the task of 12‑month overall survival prediction, disease‑specific survival, as well as longitudinal benchmark of hazard prediction under severe missing data. Our results show that, despite high levels of missingness, integrating complementary modalities consistently improves predictive performance over uni‑modal approaches, highlighting the value of multi‑modal fusion in realistic clinical settings. The dataset and benchmark code are available at https://github.com/ritacmendes/MMIST‑LUNG.
Authors:Lin Liu, Zhicheng Bao, Lu Zhang, Ziying Song, Wu Yang, Shuai Tao, Wulong Liu, Huchuan Lu
Abstract:
Vision‑Language‑Action (VLA) or World Action (WAM) models have recently demonstrated remarkable performance in robotic manipulation. On LIBERO, SOTA method have achieved nearly 100% success rates, seemingly suggesting that the models are ready for deployment in real world. However, near perfect performance on existing benchmarks can be misleading: success under ideal conditions does not imply real world robustness. Existing benchmarks primarily evaluate task completion from predefined initial states, while real world interactions inevitably involve failures such as failed grasps, collisions, and unintended object movements. A robot must therefore not only execute tasks successfully, but also recognize and recover from failures to continue the task. Yet this capability remains largely unmeasured, revealing a critical gap between benchmark performance and real world reliability. To address this gap, we introduce LIBERO‑Recover Benchmark, a large scale benchmark for failure recovery in robotic manipulation. Built upon LIBERO, we collect real execution failures from SOTA embodied models and construct 1,000+ scenarios across four recovery levels: (1) Action Retry, (2) Action Adaptation, (3) Object State Recovery, and (4) Environmental Recovery. We evaluate four core capabilities: spatial understanding, object structure reasoning, interaction understanding, and topological reasoning. As the first large‑scale benchmark for embodied failure recovery, LIBERO‑Recover shifts evaluation from \emphCan the robot succeed?'' to \emphCan the robot recover after failure?'', promoting robust and generalizable embodied agents. The project will be avaible in \textcolorbluehttps://liulin815.github.io/LIBERO‑Recovery/.
Authors:Weichen Winston Yin, Jacob M. Taylor, Dirk R. Englund, Frank H. L. Koppens
Abstract:
Formalizing mathematics in a proof assistant, where a machine checks every definition, statement and proof, has set a new standard of rigor. Large language models are now capable of formalizing autonomously, even at the scale of whole textbooks. We bring this standard of rigor to physics, where theoretical arguments carry idealizations that are rarely stated fully, and any logical gaps could have a cascading effect on interdependent results. Recognizing the need to evaluate autoformalization systems for physics, we release AxQM, 1,019 kernel‑checkable proof‑synthesis tasks over 479 items drawn from the textbook Quantum Computation and Quantum Information by Nielsen and Chuang. The tasks are stated in a custom Lean library of finite‑dimensional quantum mechanics. By task count, it is the largest proof‑synthesis benchmark in physics by a factor of four. AxQM is derived from a near‑complete formalization of the formal portions of the textbook, so every task is guaranteed a solution, which we keep private. Grading of the benchmark is done deterministically by the Lean kernel, which checks that the proof compiles, that no sorry appears in it or in any declaration it depends on, and that it introduces no new axioms.
Authors:Shenxi Wu, Yuhong Liu, Haosong Zhang, Tongjin Zou, Yanxun Zhang, Gaochang Chen, Dun Liang, Jiaqi Wang, Zhecan James Wang, Yuhang Zang, Dahua Lin
Abstract:
Scientific papers require models to reason jointly over text, equations, figures, tables, code, and datasets while preserving the provenance of supporting evidence. Existing benchmarks typically evaluate these capabilities in isolation, leaving unclear whether multimodal models can support realistic scientific‑reading workflows. We introduce SciDocBench, a workflow‑centered benchmark for scientific document understanding. It contains 124 expert‑authored and difficulty‑screened questions organized into seven research‑assistant capability groups and 19 subtasks across five scientific domains. Each question is instantiated under four matched conditions combining English or Chinese questions with all‑images‑first or interleaved document representations, yielding 496 evaluation instances for controlled analysis. The strongest evaluated system achieves only 62.6/100, with pronounced weaknesses in document perception, evidence grounding, verification, and cross‑document reasoning. To translate these diagnostics into scalable training signals, we introduce SciDocIR, a typed evidence‑graph representation that preserves scientific document objects, layout and cross‑reference relations, and provenance. Building on SciDocIR, we construct SciDocDataset, comprising approximately 15K supervised fine‑tuning samples and 8K reinforcement‑learning samples across 14 verifiable subtasks. Together, SciDocBench, SciDocIR, and SciDocDataset form an evaluation‑to‑training framework for diagnosing and improving scientific‑document assistants. The project page is available at https://github.com/InternLM/SciDocBench.
Authors:Wes Sander
Abstract:
We present Discovery Loop, a lightweight system that uses a large language model (LLM) to iteratively evolve optimization algorithms. Starting from a simple seed solver, the LLM proposes algorithmic improvements guided by a scoreboard of results and a history of prior ideas. Each candidate is evaluated against an independent verifier; improvements are kept and failures discarded. Applied to the Packomania circle‑packing benchmark (csqv: maximize the sum of radii of N variable‑radius circles in the unit square), the system improved the best known solutions for 10 values of N in the range 101‑114, with gains of 2.4%‑5.4% over prior records, all within 15 iterations and at a total LLM cost of 27.72. These results have been independently accepted by Packomania. We describe the method, analyze cost‑efficiency dynamics including an adaptive plateau‑detection mechanism, and discuss implications for democratizing automated scientific discovery.
Authors:Guanglong Sun, Kanglei Zhou, Liyuan Wang, Qi Cheng, Hongwei Yan, Shuang Cui, Hang Su, Jun Zhu, Yi Zhong
Abstract:
General continual learning (GCL) aims to learn from evolving data streams without task identities, explicit boundaries, or repeated access to previous data, making it a realistic yet challenging setting for continual intelligence. Although pretrained models (PTMs) provide rich prior knowledge for addressing the limited supervision and non‑stationary nature of GCL, existing PTM‑based methods often directly adapt pretrained representations and overlook two critical gaps: the misalignment between upstream pretraining and downstream continual adaptation, and the unreliability of conventional output alignment under blurry streams. Here we propose MePo++, a unified post‑training framework that bridges pretrained knowledge and downstream GCL through representation refinement and reconciliation. MePo++ introduces two complementary components: MetaPrep, which improves representation plasticity for continual adaptation through unsupervised meta‑refinement over pseudo continual sequences; and StreamAlign, which reinforces representation stability by reconciling evolving online features with a stable pretrained geometry. By improving representation learnability before adaptation and preserving alignment during continual learning, MePo++ enables PTMs to remain both plastic for new concepts and stable over evolving streams. Experiments across diverse PTMs, datasets, and continual learning baselines demonstrate the consistent effectiveness and generality of MePo++ for PTM‑based GCL. Our code is available at https://github.com/SunGL001/MePo_Plus.
Authors:Jineon Baek, Byung-Hak Hwang, Joonhyun La, Hongseok Yang
Abstract:
Algebraic combinatorics often seeks bijections that explain identities between distributions object by object. Encoding combinatorial objects as words lets automata theory study such a bijection as a word‑to‑word computation and measure its memory, input access, and control of output order. This refines existence questions by asking which computational mechanisms a bijection requires. We develop this viewpoint for Dyck paths. Our motivating example is the q,t‑Catalan polynomial. Let D_n be the set of Dyck paths of semilength n, let D=\bigcup_n\ge 0D_n, and let area, dinv, bounce \colon D\to\mathbbN be the standard statistics. Then, \[ C_n(q,t)=\sum_P\in D_nq^area(P)t^bounce(P) =\sum_P\in D_nq^dinv(P)t^area(P). \] Haglund's zeta map ζ\colon D\to D gives a bijective proof: it preserves semilength and sends (dinv,area) to (area,bounce). By contrast, the full symmetry C_n(q,t)=C_n(t,q) still lacks a direct explanation: no explicit, uniform, semilength‑preserving bijection is known that swaps area and dinv on every Dyck path. Polyregular maps from automata theory provide a natural computational starting point, but we prove that neither ζ nor the classical height‑sweep bijection witnessing Narayana symmetry is polyregular. The missing mechanism is global ordering by numerical levels whose range grows with the input. We call this a \emphrank sort and introduce \emphweighted‑rank polyregular maps (WRP), extending polyregular maps by one such sort and containing both bijections. Nevertheless, WRP is a proper subclass of deterministic logspace. We prove that ζ^‑1 lies outside WRP and that no WRP map can realise a semilength‑preserving area‑dinv swap. Thus the rank‑sorting strategy behind ζ cannot be extended within WRP to exchange the two statistics.
Authors:André Ribeiro, Rúben Garrido, Alexander Christiansen, Richard A. A. Jonker, Sérgio Matos
Abstract:
This paper describes the participation of the BIT.UA team from the University of Aveiro in the 14th edition of the BioASQ Task B challenge on biomedical question answering. Building on our previous submissions, we introduced a substantially refactored and modular codebase, and made significant changes to both the retrieval and generation components of the pipeline. For Phase~A document retrieval, we replaced the PyTerrier PISA index with PostgreSQL‑based pg\_textsearch for BM25 retrieval and adopted Qdrant for dense embedding indexing, enabling more efficient storage and GPU‑accelerated similarity search. We explored HyDE‑based query expansion alongside a Context‑1 retrieval strategy. A new reranker training pipeline was developed, incorporating dense retrieval for negative sampling. For Phases A+ and B answer generation, we introduced an LLM‑as‑a‑judge framework and a novel agent quorum mechanism, where multiple agents with diverse prompts debate and iteratively converge on a consensus answer using adaptive document retention. We also participated in the snippets generation subtask for the first time. Our systems achieved competitive results across all batches, with Phase~A systems achieving MAP ranks of 5 (Batch~1,3). We discuss the impact of these architectural changes, lessons learned, and outline directions for future work including SPLADE and ColBERT integration. All code is openly available: https://github.com/bioinformatics‑ua/BioASQ14b.
Authors:Songeun Lee, Kyungjin Min, Injae Na, Suyeong Lee, Chiyoung Kim, Woohwan Jung
Abstract:
Recent structured RAG methods leverage tree‑ or graph‑based reasoning structures to improve multi‑hop QA. However, they face key limitations in evidence‑intensive QA, where answering a question requires synthesizing information scattered across dozens or even hundreds of documents: structural rigidity, which limits adaptive reasoning expansion, and topology‑ignorant evidence gathering, which prevents effective integration of evidence across different reasoning nodes. To address these issues, we propose APT‑RAG, an Adaptive Planning and Topology‑aware evidence gathering RAG framework. Adaptive planning dynamically expands the reasoning structure based on question dependencies and evidence requirements, while topology‑aware evidence gathering improves evidence coverage through sibling evidence reuse, direct retrieval, and evidence aggregation from child nodes. We further introduce evidence‑guided batched answer generation to reduce significant generation overhead in evidence‑intensive QA. In the experiments on evidence‑intensive QA benchmarks, APT‑RAG outperforms existing structured RAG methods. Our code is available at https://github.com/hyudsl/APT‑RAG.
Authors:Janghyeon Kim, Minsoo Kim, Kyuhong Shim, Jungwook Choi
Abstract:
Large Reasoning Models (LRMs) achieve superior problem‑solving through extended Chain‑of‑Thought (CoT) generation, but the resulting key‑value (KV) cache grows linearly with sequence length and creates severe memory bottlenecks, often exceeding GPU capacity for long reasoning traces. Existing KV cache compression methods rely on recent queries to estimate future token importance, implicitly assuming these serve as reliable proxies for future attention patterns. We demonstrate that this assumption fails in long‑horizon reasoning: certain decoding steps generate Thought Revisiting Tokens (TRT) that re‑attend to distant previous context, such as task‑solving plans formulated early in the trace. Through systematic analysis, we discover that queries corresponding to the TRT cluster into a small number of similarity groups in the embedding space. Based on this insight, we propose BeaconKV, a training‑free KV cache compression method that maintains beacon queries, compact representatives for each global query cluster, to anticipate which KV pairs will be revisited without storing the entire query history. Across four open‑source LRMs and diverse reasoning benchmarks, BeaconKV generally outperforms existing compression methods, achieving up to 5.8× memory reduction while nearly preserving full cache accuracy and improving throughput by over 4.3×.
Authors:Jiangang Zhu, Zheng Wang, Bin Zhu, Yi-Ping Phoebe Chen, Jingjing Chen
Abstract:
Multi‑expert models have become the dominant paradigm for long‑tailed learning, largely attributed to their presumed ability to benefit from expert diversity. However, we revisit this central assumption and reveal that diversity induced by logit adjustment or explicit regularizers does not guarantee better ensemble accuracy. Our work suggests that multi‑expert models benefit more from variance reduction than diversity maximization. We introduce VICAL, a VIcinal Consistency ALignment framework that improves long‑tailed recognition not by enforcing expert diversity, but by reducing prediction variance. Specifically, our approach comprises two key components: Self‑Consistency Learning and Deep Ensemble Distillation. Self‑Consistency Learning discourages reliance on unstable high‑frequency information, smoothing the local loss landscape and mitigating overfitting, especially for tail classes. Deep Ensemble Distillation promotes cross‑expert low‑frequency semantic agreement using a low‑resolution view, thereby sidestepping optimization conflicts with established knowledge. Extensive experiments on CIFAR‑LT, ImageNet‑LT, and iNaturalist 2018 show that VICAL consistently outperforms state‑of‑the‑art methods, validating the effectiveness of our consistency‑driven design. Our code is available at \hrefhttps://github.com/FlamieZhu/Vicinal‑Consistency‑AlignmentVICAL.
Authors:Hao Wen, Weibin Yun, Hongxing Fan, Haotian Lu, Rui Chen, Zehuan Huang, Lu Sheng
Abstract:
Instruction‑guided 3D editing is essential for interactive content creation, yet it faces a significant bottleneck: the severe scarcity of high‑quality paired training data. Existing approaches attempt to bypass this by either relying on slow test‑time optimization or training on pseudo‑pairs constructed via complex pipelines, which often introduce structural drift and geometric artifacts. In this paper, we propose a novel framework that learns feed‑forward 3D editing without paired 3D supervision via Generative Prior Distillation. Instead of relying on ground‑truth 3D pairs, our core idea is to distill visual, semantic, and geometric knowledge from powerful foundation models directly into a 3D editing model. Specifically, through a differentiable rendering pipeline, we supervise the 3D representation using two complementary signals: a 2D visual prior from an image editing model at the main editing view, and a semantic prior from a Vision‑Language Model at novel views to ensure strict instruction following and source identity preservation. Crucially, to address the geometric collapse and multi‑view inconsistencies inherent in 2D projection supervision, we introduce a 3D‑aware Distribution Matching regularization. Acting as a geometric prior, this term operates in the 3D latent space, constraining the edited output to remain within the manifold of realistic 3D assets defined by a pretrained image to 3D teacher model. Extensive experiments demonstrate that our method achieves superior instruction fidelity and cross‑view consistency, significantly outperforming state‑of‑the‑art baselines. Our project is available at: https://github.com/thiamine128/PriorEdit3D.
Authors:Luca Marini, Maggie Chen, Hala Lamdouar, Laura Martínez-Ferrer, Dr C. P. Bridges, Giacomo Acciarini
Abstract:
As a potent greenhouse gas, methane is a major driver of climate change. Its effective mitigation relies on timely detection. Conventional detection methods rely on orthorectification to correct geometric distortions and matched filters to enhance plume signals, which are steps designed for ground processing and poorly suited to onboard execution. We introduce UnorthoDOS, a dataset and approach for training machine learning models directly on unorthorectified hyperspectral imagery, bypassing both orthorectification and matched‑filter products. Our U‑Net models trained on unorthorectified data approach the performance of models trained on orthorectified data (IoU 16.91% vs. 18.47% on all plumes), while both substantially outperform the mag1c matched‑filter baseline (IoU 4.76%). We further demonstrate the feasibility of onboard deployment: FP16 compression halves model size with under 0.3% output deviation. The trained ML models and two ML‑ready datasets ‑‑ orthorectified and unorthorectified hyperspectral imagery from the EMIT sensor ‑‑ are publicly available at https://huggingface.co/datasets/SpaceML/UnorthoDOS, with code at https://github.com/spaceml‑org/plume‑hunter.
Authors:Yusuke Oumi, Yuto Shibata, Go Irie, Akisato Kimura, Yoshimitsu Aoki, Mariko Isogawa
Abstract:
Can we recover the 3D poses of multiple people using only sound? This paper presents the first attempt to estimate multi‑person 3D poses solely from acoustic signals. Estimating the poses of multiple individuals using acoustic signals is inherently challenging due to the superposition of motion‑dependent signal variations. Unlike single‑person scenarios, the presence of multiple subjects leads to overlapping acoustic signatures, making it difficult to attribute specific signal changes to an individual's pose. Furthermore, the complexity is compounded by inter‑person reflections, which introduce intricate propagation delays that obscure the temporal motion‑acoustic relationship. To address these issues, we propose SoundMHPE (Sound‑based Multi‑person Human Pose Estimator), a novel encoder‑decoder framework consisting of two key components. First, the Acoustic Multi‑scale Encoder captures diverse temporal and fine‑grained frequency features to isolate subtle acoustic signatures from complex, overlapping signals. Second, the Temporal Pose Decoder employs an attention mechanism to disentangle multi‑person information across successive frames. By jointly accounting for temporal dynamics and inter‑person dependencies, this component precisely reconstructs frame‑wise individual poses. To validate our approach, we constructed the 6‑hour Acoustic Multi‑person Pose (AMP) dataset consisting of 432K synchronized frames of multi‑person pose and acoustic data, and demonstrated that our SoundMHPE outperforms baseline models. Project page: https://oumi03.github.io/sound‑mhpe/
Authors:Minh-Khoi Pham, Luca Cotugno, Dan Cernei, Alina Sirbu, Stefano Masi, Giuseppe Prencipe, Alessandro Pingitore, Patrizia Landi, Working Group on Uric Acid, Cardiovascular Risk of the Italian Society of Hypertension, Tai Tan Mai, Martin Crane, Marija Bezbradica
Abstract:
Tabular foundation models (TabFMs) achieve strong performance on structured data, particularly for standard classification and regression problems. Yet, extending them to censored time‑to‑event prediction is challenging because it requires properly handling censoring and event‑time dynamics. Building on our prior work, we further link TabFMs with CoxPH and DeepHit and revise the context‑resampled training procedure. We evaluate temporal zero‑shot reformulation, classification‑based fine‑tuning, and survival‑head adaptation using frozen TabFM backbones on 74 single‑risk data sets, and we additionally study 4 competing‑risk data sets. Zero‑shot inference is effective on smaller single‑risk data sets, whereas supervised adaptation becomes increasingly advantageous as data sets scale. Cox provides the most reliably strong interface, especially for Integrated Brier Score (IBS) on larger data sets. DeepHit is relatively stronger for the time‑dependent Concordance Index than for IBS, while cause‑specific MTLR ranks highest among the TabFM survival heads in the four‑data‑set competing‑risk analysis. Classification fine‑tuning becomes more competitive with zero‑shot inference as data sets grow but remains weaker for probabilistic prediction. Overall, our results indicate that effective TabFM transfer depends on the data regime and on the statistical structure represented by the chosen adaptation interface. The implementation scripts used for this work are available at https://github.com/kaylode/survival‑fm.
Authors:Petro Shulzhenko, Gabriele Spadaro, Enzo Tartaglione
Abstract:
Although Deep Neural Networks have become foundational in many areas of Machine Learning, high computational demands limit their application in resource‑constrained environments. To address this issue, depth compression methods have been proposed to identify and linearize redundant activation functions, thereby allowing for the merging of layers without intermediate non‑linearities. However, these methods face two key challenges: they cannot be directly applied to convolutions with padding due to the absence of an analytical solution for merging these layers, and they typically increase the kernel size of merged layers, thus limiting speed‑up gains. To overcome these limitations, we propose an efficient strategy that enables merging of layers without an existing analytical solution, and also without increasing kernel size. We validate our approach across multiple architectures and datasets, and measure inference speed‑up gains on real embedded platforms. We publicly released the code at https://github.com/ShulzhenkoPetr/deep‑to‑shallow.
Authors:Longtao Hu, Xiao Liang, Linchao Zhu
Abstract:
Computer‑use agents can execute increasingly complex tasks in graphical interfaces, but their interaction experience is typically transient: procedural knowledge acquired from one rollout is not systematically retained, refined, and reused in later tasks. Existing skill libraries provide external procedural knowledge, yet their incremental value over the same agent operating without skills, as well as their longitudinal dynamics under repeated interaction, remain insufficiently characterized. We present an online skill‑evolution framework that converts interaction trajectories and evaluator feedback into a persistent, versioned library of reusable procedures. Each iteration executes against a frozen library snapshot, and evidence‑guided skill updates become available in subsequent iterations without changing model parameters. We compare the full evolving‑library system with a configuration‑matched empty‑library control across four OSWorld application domains under the same fixed action‑generation and GUI‑grounding stack, task sets, and iteration horizons. Following a five‑iteration empty‑library warm‑up, Full attains a higher post‑warm‑up mean evaluator score in all four observed domain runs, with mean differences ranging from 5.7 to 18.6 percentage points and domain‑dependent temporal stability. In GIMP, provenance‑aware analysis reveals retrieval across task‑of‑origin boundaries and revision churn, where repeated accepted edits fail to recover the originating task. These findings characterize evolving skill libraries as auditable, shared procedural memory that can improve a fixed computer‑use stack, while showing that their benefits are conditional and repeated revision does not guarantee recovery. Code is released at https://github.com/LongtaoHu/Skill‑Evo4GUI.
Authors:Jinyuan Feng, Dongmin Li, Yiqun Chen, Yang Gao, Xing Chen, Huimu Wang, Zhiqiang Pu
Abstract:
Skill libraries improve the sample efficiency of agentic reinforcement learning (RL) by enabling large language model (LLM) agents to reuse procedural knowledge. Yet existing paradigms exhibit structural shortcomings: they either decouple skill evolution from policy optimization or instantiate meta‑skills as fixed workflows. Both treat skills as passive objects to be managed, limiting the flexible evolution of skills and their co‑adaptation with the reasoning agent. To address the limitations, we propose CoSkill, a unified multi‑agent RL framework that recasts the static meta‑skill workflow as a learnable Meta‑Skill Agent and jointly trains it with a Reasoning Agent over a hierarchical skill library. By modeling the Reasoning and Meta‑Skill Agents as a cooperative team sharing a single backbone, CoSkill enables end‑to‑end co‑adaptation: the Reasoning Agent conditions its actions on a retrieved task skill and step skills selected from its child set, while its task performance guides the Meta‑Skill Agent in refining those step skills. Experiments on ALFWorld and WebShop show that CoSkill substantially outperforms prior skill‑based and RL baselines, achieving success rates of 98.4% and 90.6%, respectively (+3.5 and +6.2 pp). As shown in Figure 1, CoSkill achieves superior early‑stage sample efficiency, asymptotic performance, and wall‑clock efficiency. Our code is available at https://github.com/jinyuan‑cookie/CoSkill.
Authors:Garvit Joshi, Stavya Dhyani, Jasmine, Arun Chauhan
Abstract:
Media bias in news articles operates through subtle linguistic cues‑‑‑loaded language, selective framing, and strategic omission‑‑‑that resist single‑model detection and have traditionally required large annotated corpora for supervised training. We ask whether structured multi‑agent deliberation can serve as a principled, training‑free alternative to supervised classification for this task. We introduce MABPD (Multi‑Agent Bias Probing & Detection), a pipeline in which three specialized LLM agents analyze an article from complementary perspectives and resolve disagreements through a Structured Argument Debate (SAD) protocol. SAD implements a domain‑motivated asymmetric burden of proof‑‑‑biased claims without grounded textual evidence carry zero weight‑‑‑combined with role‑weighted voting and post‑consensus verification, replacing task‑specific supervised decision boundaries with explicit deliberative structure. Ablation confirms that this structured deliberation, not mere agent parallelism, drives performance: removing the debate module reduces F1 by up to 10.6 points. On the BABE benchmark (4,121 expert‑annotated sentences), MABPD achieves 83.4% macro F1 on the held‑out test split‑‑‑within 0.7 percentage points (pp) of the supervised SOTA (MAGPIE, 84.1% macro F1; Horych et al., 2024)‑‑‑without any task‑specific training or threshold tuning on annotated data. Cross‑dataset evaluation on the SemEval 2019 HyperPartisan corpus (644 articles) yields 75.0% zero‑shot accuracy, within 7.2 pp of the supervised SOTA accuracy (82.2%; Kiesel et al. 2019), confirming transfer across annotation regimes. We release the full pipeline and evaluation code.
Authors:Zhaoming Xu, Chan-Wei Hu, Kuan-Ru Huang, Zihao Zhu, Renjie Li, Yang Zhou, Zhengzhong Tu
Abstract:
Monocular depth estimation foundation models, such as the Depth Anything series, have achieved remarkable performance across diverse domains. However, they still suffer from critical failures under adverse weather conditions, such as fog, rain, snow, or at night. To address this, we present Weather‑Conditioned Depth Anything (DA‑W), a framework that explicitly disentangles style from content for weather‑robust depth estimation. Specifically, we introduce a Style Filter trained on a curated mix of real and synthetic degradation datasets to extract content‑independent, degradation‑aware weather embeddings. This style embedding is then injected into the Depth Anything backbone using a parameter‑efficient, zero‑initialized adapter. Such a lightweight modulation allows a single unified model to robustly adapt to diverse conditions, including fog, rain, snow, and low‑light, while avoiding catastrophic forgetting of its core generalization abilities in normal conditions. We train the adapter using a pseudo‑label distillation and alignment strategy. Our comprehensive experiments demonstrate that our proposed DA‑W achieves state‑of‑the‑art robust depth estimation, improving AbsRel by an average of 3.7% on our curated weather benchmarks, while matching or slightly outperforming performance on standard clean benchmarks. Our project page is available at https://zhaoming‑tamu.github.io/WCDA/.
Authors:Glib Kechyn
Abstract:
Deep models for sales forecasting, such as WaveNet‑style dilated convolutional networks, are accurate but opaque: when a single model predicts sales for one of many series, it offers no account of why. We add a post‑hoc, architecture‑agnostic counterfactual interpretability layer to a multi‑series WaveNet forecaster trained on the full Corporacion Favorita grocery dataset (174,685 series over 1,688 days). The method decomposes each forecast into contributions that sum exactly to the predicted value, avoiding the allocation artifacts we observed with additive SHAP‑style attribution. We evaluate faithfulness with a deletion/insertion protocol and find a statistically significant effect on both tests (deletion gap 0.22, p<0.001; insertion gap 0.27, p<0.01; robust across five background‑sampling seeds), establishing that the attributions reflect genuine model behavior rather than plausible‑looking artifacts. We then characterize, honestly, where attribution is and is not informative: reliance on the promotion signal is heterogeneous across series (median ratio approximately 1.0, with roughly 20% of series showing a strong effect), and the model captures the shape of the weekly sales cycle (day‑of‑week r=0.78) while systematically under‑predicting its amplitude. Our contribution is not improved accuracy but an interpretability layer with a rigorous faithfulness evaluation and a candid account of its limits.
Authors:Seogyeong Jeong, Jaehui Hwang, Dongyoon Han, Geonmo Gu, Alice Oh, Taekyung Kim
Abstract:
Reasoning in large language models unfolds through diverse functional operations, such as problem formulation, goal decomposition, and deduction. Although these operations are explicitly distinguished in text, little is known about how they are geometrically organized in representation spaces. To this end, we investigate whether distinct reasoning operations exhibit corresponding geometric structure in hidden representations. We find that operations are separable in held‑out representations, with separability peaking in middle layers, and verify that this structure is not explained by lexical or positional confounds. Across layers, token‑wise operation‑alignment becomes more distributed over spans, while identical surface tokens are represented differently depending on the operation of its surrounding chunk. Attention‑masking interventions further show that operation‑aligned representations at chunk onset depend on preceding reasoning context. Consequently, our work demonstrates that language models maintain representational correspondence between linguistic reasoning expressions and their internal geometric structures. Code and project materials are available at https://github.com/naver‑ai/beneath‑cot.
Authors:Yuming Zhao, Zangyueyang Xian, Qijian Zhang, Rendong Liang, Qin Jia, Ying He, Junhui Hou
Abstract:
3D surface cutting and UV unwrapping are fundamental problems in computer graphics. Traditional geometric optimization methods mainly focus on reducing parameterization distortion, but they often overlook visual semantic coherence in seam layouts. Recent autoregressive generative methods improve semantic coherence, yet limited perception of mesh topology often causes inaccurate local cuts. To address these limitations, we introduce SeamFlow, a novel generative framework for 3D surface cutting. We reformulate the discrete mesh‑cutting problem as continuous flow matching in a high‑dimensional edge‑probability space. Through continuous relaxation, SeamFlow learns a deterministic mapping from a Gaussian prior to a target seam‑probability distribution. An evolution network couples local topological tokens with global shape priors and guides smooth probability flow through Ordinary Differential Equation solving. Compared with existing autoregressive generative frameworks, SeamFlow improves topology awareness through edge tokenization while eliminating both 3D spatial projection errors and artificial sequential‑order bias. Extensive experiments demonstrate that SeamFlow achieves exceptional semantic coherence and remarkably low parameterization distortion. The project page is https://meshy‑dev.github.io/seamflow.
Authors:Siyuan Liu, Xuze Zhang, Yongshun Wang, Licong Pan, Hang Liu, Huihui Li
Abstract:
Synthetic Aperture Radar (SAR) images have all‑weather, day‑and‑night observation capabilities. However, compared with optical images, their speckle noise and non‑intuitive scattering mechanism limit the interpretability of the images. Generative models for SAR‑to‑optical (S2O) conversion can improve visual interpretability, but existing methods often ignore the constraints on semantic structure, which are necessary for downstream tasks, for the sake of visual effects. We propose a unified collaborative dual‑task learning framework, termed BMT (Bridging Modalities and Tasks), that jointly optimizes S2O image translation and semantic segmentation through a shared hierarchical Vision Transformer. The framework integrates: (1) a LocalViTBlock that fuses global self‑attention with spatial depthwise convolution through a learnable gating mechanism; (2) an enhanced output module combining multi‑scale refinement processing, color correction and anti‑aliasing, which calibrates channel‑level color statistics through feature fusion; (3) a ControlNet‑style conditional injection mechanism that encodes SAR wavelet features and segmentation labels into a multi‑scale feature pyramid and injects them at each encoder layer through zero‑initialized convolution; (4) a bounded Kendall uncertainty weighting scheme that prevents either task from dominating the shared representation. We evaluate the framework under both paired and unpaired translation settings, on the public WHU‑OPT‑SAR paired dataset and a self‑constructed unpaired ship dataset built from HRSID and DIOR, respectively. The experimental results show that the proposed method achieves competitive S2O translation quality and semantic segmentation performance. The dataset and source code have been publicly released at https://github.com/Lewisyuaner/BMT‑S2O‑main.
Authors:Minji Kim, Jihyoung Jang, Hyounghun Kim
Abstract:
Vision‑language models (VLMs) are expected to respond helpfully to appropriate requests while withholding compliance with requests that are incorrect, unsafe, infeasible, or unanswerable. However, existing benchmarks predominantly evaluate non‑compliance at the level of the query as a whole, assuming that each request either warrants compliance or requires withholding compliance. In practice, real‑world queries can contain a mixture of answerable content and components for which compliance should be withheld. In this paper, we introduce KoNA, a benchmark for evaluating selective non‑compliance in VLMs across five categories: False Premise, Visual Inaccessibility, Universal Unknown, Task Feasibility, and Safety. Each task evaluates two capabilities: query‑level non‑compliance and component‑level non‑compliance under paired single and compound queries. Our evaluation across diverse VLMs shows that models often fail to refuse, correct, or abstain appropriately, and these failures become more pronounced when queries require selective non‑compliance. To address this challenge, we fine‑tune VLMs using KoNA examples that require selective non‑compliance, together with a fully answerable set that should receive direct answers. Our fine‑tuned models achieve substantial improvements in non‑compliance accuracy while largely maintaining performance on fully answerable tasks. These results suggest that the fine‑tuned models can distinguish between answerable components and those requiring non‑compliance and respond in a task‑appropriate manner.
Authors:Ziding Zhao, Hainan Cui, Peilin Tao, Shuhan Shen
Abstract:
Structure‑from‑Motion (SfM) is a fundamental tool for sparse 3D reconstruction with broad impact in robotics and vision, supporting mapping, localization, and large‑scale scene modeling. However, conventional pipelines often fail under hard visual ambiguity caused by repeated or symmetric structures, and incur heavy computational cost due to redundant cameras and constraints. We present HiSfM, a hierarchical coarse‑to‑fine SfM framework that improves robustness and efficiency through scaffold construction. HiSfM first forms strong local communities using geometrical induced heuristics, then connects communities with a compact yet strong skeleton by packing edge‑disjoint spanning trees (EDST) while verifying skeletal edges with a two‑view disambiguator. We reconstruct a stable scaffold on this verified skeleton, serving as an anchor to capture the essence of the scene, and subsequently absorb remaining images via efficient registration and triangulation for further refinements. Experiments on ambiguity‑focused benchmarks and general datasets show that HiSfM prevents ambiguity‑induced failures while substantially reducing runtime compared to previous methods, and improves completeness over aggressive sparsification methods. Code is available at https://github.com/3dv‑casia/HiSfM.
Authors:Minji Kim, Hyounghun Kim
Abstract:
Striking a balance between helpfulness and safety remains a fundamental challenge in aligning large language models. To achieve this balance, models should refuse harmful queries (e.g., "How do I shoot someone?") while remaining responsive to benign inputs, even those superficially resembling harmful queries (e.g., "Where can I shoot a good photo?"). However, models often struggle to distinguish genuinely harmful queries from benign queries that contain superficially risky language, resulting in false refusals. In this paper, we address the issue by decomposing a response in the safety‑tuning dataset into two distinct components: (i) a boilerplate refusal statement and (ii) a rationale explaining the refusal. Our experiments and analyses show that refusal statements impede accurate discrimination between harmful and benign queries by inducing reliance on superficial cues. In contrast, training solely on rationales reduces false refusals while maintaining a comparable level of safety performance. Rationale‑Only benefits also appear in our ICL configuration and remain compatible with the evaluated inference‑time mitigation methods. The results emphasize the necessity of precisely curated, fine‑grained safety supervision datasets and outline directions for constructing aligned agents that better reconcile helpfulness with safety.
Authors:Abhishek Sharma
Abstract:
A merchant's payment processor, ledger, ERP and bank feed are updated by messages that get delayed, duplicated, dropped and reordered, so for minutes at a time the four hold contradictory beliefs about the same order. An agent resolving the exception must decide whether to ship goods, re‑submit a capture, refund or wait, knowing some of those cannot be undone. We present FinalityBench, an executable benchmark for that decision. It keeps a hidden canonical event log and derives each system's view from a separately faulted delivery stream, so disagreement follows from specified fault semantics rather than being authored. Grading is on executed monetary effects: an episode is scored by the merchant's terminal economic position, relative to a privileged reference told when the pending capture resolves. The corpus of 321 tasks includes 45 twin pairs (90 tasks): tasks whose four system views are identical at the decision instant, whose authoritative probes both return unknown, and whose eventual correct dispositions differ. That snapshot indistinguishability is checked under every evaluation seed rather than assumed; equivalence over all interaction traces is not claimed. Over 14,445 graded episodes from nine programmatic policies, ranking by single‑task accuracy and by paired loss disagree in 7 places: a ship‑on‑first‑sign policy is second‑best by accuracy at 65.7% and worst in the suite by paired loss, because it cannot tell the two members apart. A runtime gating irreversible actions on an authoritative finality probe reaches 85.4% and, unlike every polling policy, loses nothing to pass^5; its residual loss is almost entirely one archetype, which prices finality information directly. Language models reach the same exact rate as the hand‑written gate on a stratified subset, lose about twice as much money, and discover the finality‑gating strategy without being told it.
Authors:Aayush Marasini, Zhaoxian Zhou
Abstract:
Passive cooling eliminates the energy overhead and mechanical failure modes of fans, making it attractive for edge deployment, yet sustained Deep Neural Network (DNN) inference on passively cooled edge Systems‑on‑Chip (SoCs) is bottlenecked by thermal throttling. To address this, we propose an empirically calibrated, state‑aware Dynamic Voltage and Frequency Scaling (DVFS) scheduler. Unlike heuristic‑driven controllers, our methodology utilizes time‑domain guards and absolute temperature bounds, with derivative triggers acting as safeguards against sharp thermal spikes. Evaluated on a passively cooled Raspberry Pi 5 running YOLOv8n, our scheduler eliminates all observed thermal throttling events during sustained 30‑minute workloads. It outperforms a temperature‑only reactive baseline by achieving a 6.8% higher frame rate (Cohen's d = 8.73) while consuming 1.9% less energy per frame. Furthermore, our optimized passive scheduling surpasses an actively cooled reference system in energy efficiency (Joules/frame), though active cooling remains superior for raw throughput. Through isolated ablations, we show that the dwell guard is necessary for run‑to‑run reproducibility. Finally, exploratory boundary probes indicate that the passive operating envelope closes at ambient temperatures (\ge 27^\circC) where nonlinear leakage defeats DVFS‑based control. These results indicate that, within the mapped envelope, correct scheduling can make mechanical cooling unnecessary for sustained edge inference on this platform.
Authors:Xinran Zhang, Pengrui Lu, Lyumanshan Ye, Pengfei Liu
Abstract:
Large language model (LLM) agents are increasingly proposed for enterprise workflows, yet existing evaluations rarely test whether business‑decision conclusions transfer across competitive market ecologies. We introduce ERPBench, an execution‑instrumented benchmark for enterprise decision agents in a six‑round Enterprise Resource Planning (ERP) simulation with coupled pricing, production, procurement, inventory, finance, and shared‑market competition. ERPBench evaluates the same 100 fixed problems in two matched competitive market ecologies: Solo, where each evaluated LLM agent competes against fixed rule‑based opponents, and Arena, where six evaluated LLM agents compete in a shared market. Across six model families, this yields 1,200 model‑level trajectories spanning 7,200 decision rounds. Under the observed service configuration, the leading model differs between ecologies: DeepSeek leads in Solo (252.29M mean valuation; mean rank 1.67), whereas Gemini leads in Arena (263.95M; 1.76). The two ecologies identify the same task‑level winner on only 21 of 100 problems, and Gemini's bottom‑rank rate falls from 22 % to 0 % in Arena. ERPBench supports paired evaluation of whether enterprise‑agent rankings transfer across competitive market ecologies, supplemented by aggregate execution‑intervention analysis. Code and benchmark resources are available in our https://github.com/GAIR‑NLP/erp‑bench.
Authors:Denis Zavadski, Sebastian Heid, Damjan Kalšan, Stefan Roth, Carsten Rother
Abstract:
Diffusion Transformers (DiTs) have emerged as a dominant architecture for high‑quality text‑to‑image generation, yet their scale poses challenges for efficient deployment. While truncated singular value decomposition (SVD) is a principled tool for parameter reduction, evidence from large language models (LLMs) suggests that naive low‑rank approximation can cause catastrophic failure. In contrast, we find that truncated SVD in DiTs produces smooth degradation even under substantial global compression, with redundancy distributed across projection matrices throughout the whole network rather than concentrated in a few transformer blocks. Building on these insights, we introduce SVDtrunc, a two‑step block‑level compression scheme, first allocating ranks across blocks and compressing the least important ones via truncated SVD under a global parameter budget, and then fine‑tuning all blocks with modular knowledge distillation and a rectified‑flow objective. We apply SVDtrunc to FLUX.dev across compression levels ranging from 40‑90% of the original parameter count. Across three benchmarks, GenEval, HPSv2, and DPG, we outperform all competing approaches. Notably, and in contrast to prior work, we retain near‑full performance at 68% and remain competitive even at 57% of the original parameter budget. Furthermore, we show that SVDtrunc complements step distillation and achieves strong results even without fine‑tuning, positioning it as a practical continuation of efficiency improvements beyond diffusion step reduction for large‑scale generative models. Project page: https://vislearn.github.io/SVDtrunc/
Authors:Esteban Gutiérrez, Lonce Wyse, Frederic Font, Xavier Serra
Abstract:
As generative audio models grow in complexity, the computational and ecological costs of synthesizing everyday sounds have become increasingly prohibitive, often requiring industrial‑scale resources and massive datasets. In this paper, we present SCAPES: a Semantically Conditioned Autoregressive Prior for Environmental Sounds. SCAPES is a lightweight, resource‑efficient generative model designed to synthesize high‑fidelity environmental textures through high‑level semantic control. By operating on the continuous latent manifold of a neural audio codec, our approach bypasses the rigid structural constraints inherent to discrete tokenization. We propose a segmentation strategy that decomposes audio into overlapping segments, enabling a Continuous Normalizing Flow (CNF) to model the evolution of latent trajectories using Flow Matching. Our experiments demonstrate that a 36‑million parameter instance of SCAPES can be trained on limited, uncurated datasets using a single consumer‑grade GPU. Notably, convergence is achieved after training for approximately twice the source audio duration, yielding high‑fidelity outputs with robust long‑term stability and semantic consistency. Furthermore, we showcase the model's capacity for smooth semantic interpolation, providing a flexible and accessible tool for open research and creative sound design. Code, pretrained weights, audio examples, and an interactive demo are publicly available on our project page https://cordutie.github.io/projects/scapes.html
Authors:Yi Huang, Jeremy Styborski, Mingzhi Lyu, Fan Wang, Adams Kong
Abstract:
The abundance of online data is at risk of unauthorized usage in training deep learning models. To counter this, various Data Availability Attacks (DAAs) have been devised to make data unlearnable for such models by subtly perturbing the training data. However, existing attacks often excel against either Supervised Learning (SL) or Self‑Supervised Learning (SSL) scenarios. Among these, a model‑free approach that generates a Convolution‑based Unlearnable Dataset (CUDA) stands out as the most robust DAA across both SSL and SL. Nonetheless, CUDA's effectiveness against SSL is underwhelming and it faces a severe trade‑off between image quality and its poisoning effect. In this paper, we conduct a theoretical analysis of CUDA, uncovering the sub‑optimal gradients it introduces and elucidating the strategy it employs to induce class‑wise bias for data poisoning. Building on this, we propose a novel poisoning method named Imperfect Restoration Poisoning (IRP), aiming to preserve high image quality while achieving strong poisoning effects. Through extensive comparisons of IRP with eight baselines across SL and SSL, coupled with evaluations alongside five representative defense methods, we showcase the superiority of IRP. Code: https://github.com/lyumingzhi/IRP
Authors:Andrew Franck, Brendan Ng, Ben Fitzgerald, Zane Derrod, Chris Cianci, Chris Craney
Abstract:
Video‑language benchmarks are usually constructed by the dataset authors without published reliability statistics, leaving the noise floor of the construct unknown. We argue that multimodal benchmarking benefits from methods taken from research communities that have already invested in strategies to ensure reliability. We illustrate the case with the Classroom Observation Protocol for Undergraduate STEM (COPUS): a 24‑code multi‑label observation instrument with a decade of peer‑reviewed reliability literature. We recast COPUS as a video benchmark for multimodal foundation models, where it provides a dense set of structured labels (a 24‑dimensional binary vector every 2 minutes across a 50‑90 minute lecture), an externally validated vocabulary, and established literature that provides a per‑code reliability target based on human evaluators. Annotations in our evaluation corpus are produced by a 5‑person human‑evaluator panel whose consensus matrix is our reference. We propose VISTA, a baseline that runs MiniCPM‑V‑4.5 over a dense sliding window, refines its per‑window outputs with a lightweight multi‑layer perceptron (MLP) head trained on top of the frozen backbone, and max‑pools the resulting predictions onto the 2‑minute COPUS grid. On three held‑out chemistry lectures, VISTA reaches 80.1% restricted macro accuracy versus 74.9% for the zero‑shot variant, with the largest residual errors on visually similar instructor codes and on rare audio‑dependent codes. We characterize three systematic failure modes (audio‑partial observability, fine‑grained group‑work discrimination, long‑tail recall) and release the benchmark tooling, prompts and baseline code at https://github.com/ajfranck/VISTA.
Authors:Wenjin Fu, Li-Fan Wu, Jerin Peter, Chip Huyen, Boyuan Chen, Jan Liphardt
Abstract:
Robots interacting with people must recognize not only explicit commands, but also social cues such as invitations, refusals, and unavailability. In real deployments, these cues must be inferred from noisy onboard perception under partial occlusion, changing viewpoints, and strict latency constraints. We present SocioGesture, a real‑time adaptive social gesture perception system for human‑robot interaction (HRI). SocioGesture uses a compact confidence‑aware body‑hand skeleton representation and a lightweight dual‑stream model that fuses body motion with hand articulation for low‑latency onboard recognition. To improve deployment robustness, we train the model with occlusion‑aware skeleton corruption, exposing it to missing hands, occluded arms, and temporally unstable keypoints without increasing the inference cost. On a social gesture dataset collected in mixed indoor‑outdoor HRI scenarios, SocioGesture achieves strong held‑out‑subject recognition, substantially improves robustness under structured joint occlusion, and runs in real time on a robot‑mounted edge device. During deployment, uncertain interaction segments are saved for offline labeling and adaptation, enabling SocioGesture to expand its gesture vocabulary while preserving performance in the original classes. These results demonstrate a practical path toward robust, efficient, and adaptive social perception for interactive robots.
Authors:Jiarui Fang
Abstract:
An approval committee is Hare‑core stable if no coalition meeting the Hare quota can strictly improve by moving to another candidate set. Whether every approval election has such a committee remains open. We prove nonemptiness when each voter disapproves at most two candidates, with no bounds on the numbers of candidates, seats, or voter types. The result also permits arbitrary positive rational voter weights. Our deterministic rule represents a committee by its missing set. It first maximizes weighted coverage of two‑candidate disapproval sets and then maximizes total disapproval incidence. An exact coverage inequality excludes targets one seat below the committee. The incidence objective excludes unanimous equal‑size targets, while targets of size at most k‑2 cannot improve any voter. Two implementation‑level independent verifiers audit overlapping finite grids. The symbolic proof, not this bounded enumeration, establishes the theorem's unbounded quantifiers. The argument identifies complement‑side coverage as a tractable mechanism for a broad parameter range within a sharply defined preference domain.
Authors:Fred Zhangzhi Peng, Kaiwen Zheng, Anru R. Zhang
Abstract:
Language generation is almost universally treated as a sequential process: autoregressive models emit one token at a time, while diffusion language models replace token‑level seriality with a long trajectory of iterative refinement. In this work, we introduce PlaidQ, a 0.7B continuous diffusion language model for code generation, and show that its trajectory can be aggressively distilled into only a few denoising steps‑‑‑or even one, enabling efficient code generation. PlaidQ repurposes a pretrained autoregressive model as a bidirectional denoiser over continuous token embeddings. We distill PlaidQ with distribution matching for few‑step generation and paired‑trajectory supervision for one‑step generation. At matched model scale, PlaidQ is competitive with discrete diffusion language models on code generation. Distillation then shifts the quality‑‑compute frontier: a 16‑step student reaches 31.78 and 40.49 pass@10 on HumanEval and MBPP+, surpassing the same PlaidQ teacher sampled for 512 steps. At the extreme, paired‑trajectory distillation achieves 7.07 pass@1 on HumanEval with a single denoising step, producing functionally correct programs. Together, these results establish continuous diffusion as a viable path to few‑step and one‑step code generation. Broadly, continuous diffusion is not merely another representation for language: it provides an interface through which language models can inherit the acceleration and distillation machinery of continuous diffusion modeling. Training and inference code and model checkpoints are available at https://github.com/pengzhangzhi/plaidq.
Authors:Shangkun Wang, Nina Cai, Charles Hoong, Julian Walker, Gerson Kroiz, George Vanica, Deepak Patil, Andi Gavrilescu, Hassan Sipra, Sethu Sankaran
Abstract:
Designing and authoring high‑performance custom kernels for accelerators is a complex task that requires deep hardware‑level expertise. Large Language Models (LLM) can be leveraged together with real‑time compiler feedback to build agentic systems for kernel generation. In this work, we present MaxKernel, a multi‑agent system that implements three distinct paradigms for TPU kernel development: (1) a Human‑in‑the‑Loop (HITL) agent for collaborative, step‑by‑step design; (2) an Autonomous (Auto) agent that executes a fully automated, metric/trace‑driven optimization loop; and (3) a Graph‑Based Autonomous Search that scales the Auto agent for global exploration of the design space. All three paradigms leverage a shared pool of specialized sub‑agents to handle planning, implementation, self‑debugging, testing, and hardware profiling. We evaluate MaxKernel on JaxBench, a comprehensive suite of 50 diverse kernel tasks for TPUs, alongside complex, real‑world workloads from state‑of‑the‑art open‑source models. We demonstrate that MaxKernel consistently generates highly optimized implementations, matching expert hand‑tuned baselines and delivering significant performance across the benchmark. Our agent is open‑sourced and available https://github.com/AI‑Hypercomputer/accelerator‑agents/tree/main/MaxKernel.
Authors:Michael Bouzinier, Dmitry Etin
Abstract:
Scientific and clinical decision‑making depends on evidence from the primary literature, but existing standards for representing that evidence (FHIR Evidence, ECO, SEPIO, and the GA4GH Genomic Knowledge Standards) are oriented toward clinical‑trial workflows, evidence codes, or single‑variant assertions, and do not capture the fine‑grained, domain‑specific structure of claims in basic and pre‑clinical research. We introduce a semantic model for scientific evidence with three core classes, specialize it for genetics, align it structurally to FHIR Evidence with a SEPIO‑anchored credibility decomposition, and attach a compact dimensional vocabulary whose conditional‑activation rules are validated by a SHACL schema for the implemented constraints. Using clinical variant interpretation as the driving use case, we evaluate the model through a human‑AI annotation pilot over six genetics papers, yielding 28 evidence items and 95 source‑anchored assertions, with a workflow that keeps curator‑authored reference annotations distinct from AI‑drafted annotations. Treating the pilot as a feasibility study rather than a benchmark, we argue that the model is a useful increment toward trustworthy, AI‑ready infrastructure for variant interpretation: a reference data model and validation schema for representing genetic evidence.
Authors:Jiarui Fang
Abstract:
Core stability gives approval‑based committee elections a strong form of coalitional proportionality, but deterministic existence is not known for an arbitrary number of seats. We prove that every finite election with nine seats has a deterministic Hare‑quota core committee. Starting from an eight‑seat committee that is both a global Proportional Approval Voting (PAV) maximizer and core stable, we suppose that all one‑candidate extensions are blocked and extract an inclusion‑minimal closed response system. Singleton responses are eliminated by exact equality rigidity. For the remaining responses, rational Farkas certificates bound every nonpositive PAV add‑marginal drift below by ‑n/189 and force every successor drift above n/126. The uniform response chain is irreducible, so stationarity makes these bounds incompatible. The computer‑assisted component comprises an exact pointwise check over 7,356 voter types, 36 one‑blocker cells, and a symmetry‑complete family of 19 two‑blocker motifs. Exact certificate archives and standard‑library verifiers support these checks. The theorem settles the nine‑seat case but does not decide deterministic core existence for arbitrary committee size.
Authors:Antoni Czolgowski, Abel Iyasele
Abstract:
We evaluate three open‑weight LLMs (Gemma3‑12B from the USA, Bielik‑11B‑v3 from Poland, and Qwen3‑4B from China) against World Values Survey Wave 7 data for 63 demographic personas across three countries, using normalized Wasserstein distance to quantify distributional misalignment. Contrary to expectations, no model favors its home country: the Chinese‑built Qwen3‑4B performs worst on its own Chinese population (W1 = 0.436, the highest misalignment in the entire model x country matrix). Targeted LoRA fine‑tuning on the five worst‑case personas, requiring fewer than 1,200 training pairs and under 15 minutes on a single GPU, reduces bias by 16.8% for Bielik‑11B (p_Bonf = 0.002, d = ‑4.4) with all five targets improving. However, country‑level decomposition reveals that fine‑tuning redistributes rather than removes bias: Bielik's worst‑case personas swap entirely from American to Chinese elderly, with zero overlap between pre‑ and post‑correction sets. To our knowledge, this is the first study to target worst‑case demographic personas with LoRA fine‑tuning for cross‑cultural bias mitigation.
Authors:Giulia Pucci, Ruizhe Li, Arabella Sinclair
Abstract:
This paper investigates structural priming in language model (LM) production, examining how preceding structural context influences sentence completion. While prior work has demonstrated priming effects in comprehension of structural alternations, it remained unclear whether these persist in production, where, when generating, an LM samples from many possible continuations at each step. We address this question through a series of controlled sentence‑completion experiments on dative constructions. In line with prior work, we find that LMs are susceptible to structural priming, particularly in sentences that are semantically coherent. In terms of priming magnitude, we find that while there is a greater relative increase of double‑object datives against our baselines, in line with inverse frequency effects, there is a larger absolute increase in prepositional‑objects, the more frequently produced construction. Finally, we not only observe that structural priming is boosted by lexico‑semantic coherence, but that structurally primed completions display greater levels of lexico‑semantic repetition. Taken together, our evidence supports the view that structural priming in LMs operates across multiple levels of linguistic representation, facilitating, and facilitated by syntactic, lexical, and semantic alignment. Code: https://github.com/the‑context‑lab/primedproduction.
Authors:Yibo Hu, Hanyu Su
Abstract:
A conformal certificate can be valid when an LLM answers alone and invalid when the same LLM sees peers that unanimously assert a wrong answer. The question is unchanged; the model's score for the correct answer changes. We call this a score‑mechanism shift: clean calibration certifies how the model scores answers alone, but not how it scores them under peer pressure. We show that this shift silently breaks conformal prediction in multi‑agent LLM systems. Across open‑weight models and multiple‑choice QA tasks, coverage falls from a calibrated 90% to 74% under unanimous‑wrong peers at the standard alpha = 0.10 operating point. The average hides a sharper failure: by targeting the low‑confidence items the certificate still covers, an attacker nearly halves coverage on that subgroup, from 87% to 47%, while the monitored average remains much higher. The failure also reaches the decision layer: a system that should escalate when uncertain can instead become confident enough to act on the attacker's wrong answer. Standard conformal fixes do not solve the problem, because the question distribution has not changed; the model's scoring behavior has.
Authors:John Seon Keun Yi, Joshua R. Minot, Dokyun Lee
Abstract:
Large language models deployed in high‑stakes settings frequently generate plausible but ungrounded claims. Standard retrieval‑augmented generation (RAG) pipelines offer limited remedy, since they retrieve isolated passages without tracking cross‑document evidence relationships or quantifying uncertainty. We introduce GRACE (Graph‑grounded Reflective Agent Copilot Engine), a framework that deconstructs LLM responses into atomic claims and grounds them against trusted knowledge priors within a weighted bipartite graph. Edge weights encode the closeness of each claim to the priors, enabling weighted centrality analysis that classifies claims as Grounded, Refuted, or Boundary. Such classification identifies not just hallucinations but also novel or contested claims at the frontier of the model's knowledge. To efficiently allocate human or agent resources, we formulate a Return on Attention (RoA) objective that defers a claim to expert review only when its priority‑weighted uncertainty exceeds the cost of verification. Claims verified by experts are promoted to new evidence anchors, closing a validator‑LLM evolutionary loop that expands the knowledge base across iterations. We evaluate GRACE across multiple language models and on datasets spanning both general and domain‑specific knowledge. Our results show that our knowledge base serves as a reliable foundation for retrieval that outperforms RAG baselines, and that the RoA framework efficiently selects valuable boundary knowledge for expert verification. These findings demonstrate that graph‑structured representations combined with expert‑in‑the‑loop verification can mitigate hallucination at the system level rather than at the generation level. Code available at https://github.com/johnsk95/grace_code
Authors:Kirill Afendulev, Alexey Dontsov, Elena Tutubalina, Anton Korznikov
Abstract:
Hybrid language models combine attention with a fixed‑size recurrent state, but the role of each channel remains unclear. We introduce two cache‑level interventions. Split‑prefill keeps only the KV cache or only the recurrent state from a prefilled context, then generates an answer. State‑swap pairs the KV cache from one context with the recurrent state from another in a single forward pass. On Qwen3.5 and Falcon‑H1, the two channels split sharply by function. Exact retrieval survives only through attention (64‑98% of full accuracy) and collapses to zero through recurrence. Output language and persona reverse the pattern: both survive recurrence (70‑80% and 3‑5x) while KV‑only drops to ~1% language accuracy. State‑swap confirms this causally: the answer takes its value from the KV side and its language from the recurrent side. Recurrent‑only generation also accepts words that were never in the context but share meaning or parts with seen items. Attention provides a lookup over what was said; the recurrent state shapes how the model says it next.
Authors:Frank Fundel, Malek Ben Alaya, Thomas Ressler-Antal, Stefan Andreas Baumann, Björn Ommer
Abstract:
Real‑world dynamics are inherently compositional: multiple entities move simultaneously within a shared scene, each exhibiting distinct motion patterns. Yet most existing video representations encode motion globally, without explicitly capturing localized motion for individual entities. Crucially, motion is defined relative to a global reference frame, including camera motion and scene layout. However, localized embeddings are often computed from cropped images or obtained by masking features after encoding, discarding the context needed to interpret motion. To address this, we introduce a promptable localized motion representation that produces persistent embeddings for user‑specified regions defined by spatial masks. Rather than cropping the input or masking features, our model processes the full video and conditions motion encoding directly on the queried region. This yields temporally consistent, region‑addressable embeddings that isolate local dynamics while retaining the global context required for disambiguation. We demonstrate object‑level motion transfer, enabling controlled composition of dynamic scenes. Beyond generative control, our embeddings support localized action classification in multi‑actor videos. Across both tasks, our approach improves controllability and outperforms global representations localized through cropping or post‑hoc masking. Project Page: https://compvis.github.io/WhatMoves
Authors:Shunpeng Chen, Jingyi Zhang, Changwei Wang, Shengpeng Xu, Yukun Song, Xingtian Pei, Jinzhou Lin, Li Guo, Shibiao Xu
Abstract:
Visual Place Recognition (VPR) localizes a query image by retrieving database images of the same or nearby place, yet its robustness is often degraded by domain shifts arising from illumination, weather, seasonal changes, and dynamic occlusions. One contributing factor is the limited appearance diversity of the same place in existing training data. To address this issue, we propose AdaptVPR, a route‑aware generative augmentation framework that constructs same‑place hard positives for robust VPR training. AdaptVPR first uses a vision language model to parse scene attributes and estimate editing feasibility, while a rule‑based scheduler determines the generation route according to editability scores and risk constraints. The generation process is decomposed into three complementary routes: the Global Appearance Route introduces global scene changes in weather, illumination, and time of day; the Local Occlusion Route inserts plausible dynamic occluders; and the Dual Route combines both types of perturbations to produce more challenging appearance shifts. Each generated candidate is evaluated using a VPR‑oriented verification scheme based on geometric consistency and appearance diversity, reducing the risk of structural drift while ensuring sufficient appearance variation. Global candidates are generated once and rejected if verification fails, while Local Occlusion and Dual candidates use verification feedback for limited prompt refinement and regeneration. Using this framework, we construct AdaptCities, containing 160K verified synthetic same‑place hard positives. Experiments across multiple VPR baselines and vision foundation backbones show consistent gains on standard benchmarks and substantial improvements under challenging domain shifts, with R@1 gains of up to 9.2%. The source code and data resources are publicly available at https://github.com/chenshunpeng/AdaptVPR.
Authors:Boning Li, Longbo Huang
Abstract:
Information abstraction, which groups strategically similar private states into a tractable number of buckets, is essential for scaling game‑solving algorithms to large imperfect‑information games. Constructing effective abstractions, however, has traditionally required domain‑specific evaluators such as hand‑strength calculators or equity estimators, which demand expert knowledge and engineering effort and are unavailable for most less‑studied games. We propose the Abstraction Agent, a zero‑shot pipeline that uses a large language model (LLM) to discover continuous strategic features from a natural‑language game description, score private states on these features, and cluster them into abstraction buckets, without any game‑specific evaluator, training data, or game‑tree traversal during abstraction construction. The pipeline runs in four phases: feature discovery with calibration anchors, batched private‑state scoring, correlation‑based feature selection, and k‑means clustering. The resulting abstractions reduce lifted‑strategy exploitability by up to 62% relative to an expected‑hand‑strength baseline on heads‑up no‑limit Texas hold'em (HUNL) turn endgames, and beat a scalar rank baseline at every granularity on ROVER Trials, an original game absent from any pretraining corpus. Beyond these quantitative benchmarks, the pipeline transfers with unchanged prompts to four‑card Pot‑Limit Omaha, HUNL preflop and flop, and Riichi Mahjong, where the discovered features track each game's recognized strategic concepts. This is structured knowledge elicitation: converting implicit strategic knowledge in LLM parameters into explicit numerical features for downstream algorithmic computation. The code is available at https://github.com/lbn187/AbstractionAgent.
Authors:Faizan Tanveer
Abstract:
Multi‑agent LLM pipelines increasingly assign roles, including execution and verification, to models of different capability tiers. This is done because running a flagship model at every stage is expensive. Previous literature has established that verification stages are not always beneficial, but holds reviewer capability roughly fixed relative to the executor. We vary it. We replace the reviewer with models spanning a capability range down to one that cannot solve the problems at all, and measure the outcome of every individual rejection. This is done across a constant set of 100 olympiad mathematics problems. A cross‑family mid‑tier reviewer improves final accuracy by 12 percentage points, from 52 to 64 percent (p = 0.0005), with zero damaged answers. Same‑model self‑review attains the highest error‑detection rate of any condition (0.85 recall) yet yields no significant gain: it rejects 2.1 times as often for a third the repair rate (15 against 43 percent, p = 0.0074) and falsely rejects 35 percent of its own correct answers against 2 percent for the cross‑family reviewer (paired p = 0.000015). The low damage rate of self‑review proves to be an artifact of revision inertia rather than reviewer quality: of 18 falsely rejected correct answers, the three where the executor complied all became wrong, while the fifteen it ignored survived unchanged. Below a capability floor the role becomes inert: our weakest reviewer changed zero of 100 final answers while doubling token cost. These findings describe a single executor‑reviewer configuration on 100 problems and should be read as a controlled pilot rather than a general claim about verification stages.
Authors:Harshit Gupta
Abstract:
Deciding whether two supplier records belong to the same corporate family is a prerequisite for spend consolidation, credit exposure aggregation and sanctions screening. It is usually treated as entity matching, but the tasks differ: a family link connects records that are deliberately different entities, and the evidence often appears in neither record. We introduce CorpFam, a public benchmark of 54,864 candidate pairs over 10,307 corporate families, derived from 6,638,350 US federal award records in which every supplier self‑reports its ultimate parent to a government registry. Pairs are stratified by name visibility: whether the names are identical after normalisation, share a distinctive token, or share none. Because strata have positive rates from 10.2% to 97.3%, we report per‑stratum recall, base‑rate invariant, rather than F1, which is not. The strongest of 5 matchers recovers 100.0% of identical pairs and 4.2% of invisible ones; no method exceeds 4.7% on the latter. The failure begins before matching. Blocking decides which pairs a matcher sees, and we evaluate 7 schemes spanning phonetic keys, attribute keys that ignore the name, and semantic nearest neighbours. None reaches three percent on invisible pairs, and their union recovers 6.8%. 93.2% of these links never enter the candidate set, so no matching‑stage improvement can reach them. The links are real: against SEC Exhibit 21 subsidiary schedules, which share no provenance with procurement registration, 64.2% of invisible links are corroborated, against 0.16% under permuted parents and 0.41% against the same parent's wrong exhibit: two unrelated nulls agreeing to within 0.25 points. Corporate‑family resolution is a retrieval problem misfiled as a matching problem; the intervention point is candidate generation, not ranking. The benchmark, adjudication log, and code reproducing every number are released.
Authors:Mojtaba Nafez, Mobina Poulaei, Kiarash Kiani Feriz, Aref Mousavi, Mohammad Ebrahim Mahdavi, Mohammad Mosayebi, Mohammad Hossein Rohban
Abstract:
Automatic Speech Recognition (ASR) systems are widely deployed in safety‑critical settings but remain vulnerable to data‑poisoning backdoor attacks. Existing ASR backdoors typically use phrase‑level triggers paired with a fixed target sentence, creating strong artifacts (e.g., repeated transcripts or triggers placed in non‑speech regions) that simple preprocessing can mitigate. We propose GhostWord, a word‑level, time‑localized ASR backdoor that uses codebooks mapping short (\approx400\,ms) acoustic triggers to target words. During poisoning, we inject a trigger into the forced‑aligned time span of a chosen source word in the audio and replace only that word in the transcript, enabling precise semantic flips and composable sentence manipulation while avoiding many‑to‑one label artifacts. Across Common Voice (v23 English, v24 Lithuanian) and multiple backbones (Whisper‑Small/Medium, MMS, SpeechT5), GhostWord achieves an average attack success rate of 89.3% and transfers across languages and models. Adapting optimization‑based defenses (ABL, ANP, SAU, I‑BAU) reveals a sharp robustness‑‑accuracy trade‑off: attack success drops from 89.3% to 29.1% while clean WER rises from 21.5% to 45.0%, consistent with our theoretical analysis showing that, in high‑vocabulary models, backdoor suppression structurally tends to degrade clean performance. The source code is publicly available at https://github.com/rohban‑lab/GhostWord
Authors:Yongjoo Kim, Mincheol Kwon, Seonga Choi, Minseung Lee, Kyeong-Jin Oh, Hyunyoung Lee, Yunsu Choi, Jungbeom Lee
Abstract:
Dense document images often contain many fine‑grained visual and textual entities whose relevance depends on a user query. Standard vision‑language retrievers encode cropped regions with a single vector, which can mix distinct entity signals and obscure the evidence needed for fine‑grained retrieval. We call this failure mode Semantic Dilution and quantitatively show that it degrades entity‑level retrieval as a function of entity density. To mitigate it, we propose SAGE, a training‑free framework that parses semantic entities from dense document images, represents them as hierarchical graph nodes with multi‑vector embeddings, and retrieves query‑relevant evidence through iterative entity‑level subgraph matching. We also introduce DEAR, a dataset of 1,055 query‑‑image pairs sourced from product detail pages, where each query requires retrieving and comparing multiple fine‑grained entities from visually dense inputs across four question types of increasing complexity. Experiments show that SAGE substantially reduces semantic dilution and outperforms patch‑level and OCR‑based retrieval baselines on DEAR, achieving a Recall@3 of 0.849 and a generation score of 2.746 on multi‑entity visual comparison queries. Our code is available at https://github.com/All4Nothing/SAGE.
Authors:Chengqian Ma, Wei Tao, Haoyu Zhang, Yiwen Guo
Abstract:
An avatar that holds a conversation should decide what to say and to move while saying it, yet these abilities live in separate model families: spoken dialogue models produce speech without motion, and co‑speech motion models produce motion only from audio handed to them. The standard remedy is a cascade that first generates the spoken response and then runs a motion model over the finished audio, which requires a second full inference pass and precludes any joint optimisation between the two. We present Motion‑Omni, an end‑to‑end framework in which a spoken dialogue model natively outputs explicit facial expression together with hand, upper‑body and lower‑body motion, generated directly from the hidden states that produce the speech. Joint training is not optional here: with the speech pathway frozen, motion remains misaligned with the audio, and co‑adapting the LLM, Speech Generator and Motion Generator under both objectives is what recovers alignment while retaining spoken‑dialogue ability. Supervision comes from a scalable, model‑agnostic pipeline that pseudo‑labels consistent‑voice speech responses with a replaceable motion teacher, yielding 422,856 quality‑ranked pairs (1,402 hours). We further release SwDA‑500 and, to our knowledge, the first public evaluation protocol for stochastic open‑ended full‑body spoken dialogue, matching audio across motion systems while unifying rendering, automatic metrics, human evaluation, and latency measurement. Instantiated with a Qwen2.5‑7B‑Instruct backbone, Motion‑Omni‑Q7 matches the same‑audio teacher cascade to within 2% on reference‑free motion metrics while responding 5.4 x faster (RTF=0.78, faster than real time), surpasses all non‑teacher cascades on beat correlation and diversity, and reaches a 2.62% word error rate, the lowest among the omni‑modal systems compared.
Authors:Shaohua Pan, Junbao Chen, Shengyi He, Jingfeng Xue, Wen Tao, Haocheng Feng, Siming Fan, Dongwei Pan, Yi Yang, Wei He, Hang Zhou
Abstract:
Existing audio‑video generation methods produce well‑synchronized clips but are limited to short durations, while long‑video generation methods extend duration through chunk‑based iterative synthesis yet lack audio entirely. Generating long audio‑video jointly is fundamentally harder than either task alone: each chunk must simultaneously maintain video temporal coherence, audio temporal coherence, and cross‑modal synchronization, whose conditioning signals enter the model through different pathways. In this work, we present Encore for long‑form synchronized audio‑video generation. Our key insight is to factor this challenge into: (1) local continuity handled by iterative generation with explicit cross‑chunk context propagation, and (2) global consistency enforced via reference audio‑video signals with shifted position embedding. Building on this design, we propose Adaptive Signal Routing (ASR), which introduces learnable attention biases within self‑attention and learnable residual scales on cross‑attention outputs, enabling the model to adaptively modulate the influence of each conditioning signal. Trained end‑to‑end for joint audio‑video generation, Encore also supports infinite‑length audio‑to‑video and video‑to‑audio synthesis at inference by conditioning on the ground‑truth modality throughout the denoising process. Experiments on our extended VerseBench for long audio‑video evaluation demonstrate that Encore significantly outperforms existing methods in both generation quality and temporal coherence. Code and data for this paper are at https://github.com/shaohua‑pan/Encore.
Authors:Yu Gong, Kailash Budhathoki, Taeho Kim, Haipeng Li, Ashish Khetan
Abstract:
Mixture‑of‑Experts (MoE) layers increase model capacity without proportionally increasing arithmetic, but their sparse expert computation is difficult to execute efficiently during autoregressive decode. Existing grouped and batched GEMMs are token‑major: they construct expert‑local token tiles and obtain parallelism from the token dimension. When few tokens reach each expert, this organization incurs tile padding and preprocessing, launches short‑lived grids that underutilize memory bandwidth, and exposes quantization, activation, and reduction as separate stages. We present MonoMoE, a weight‑major persistent megakernel for block‑wise quantized MoE decode. MonoMoE places the complete decode‑step token tile on the fine‑grained tensor‑core N dimension and partitions CTAs over expert‑weight tiles, eliminating expert‑local token materialization and reducing padded arithmetic. A persistent grid fuses routing, top‑k selection, quantization, both expert projections, activation, and reduction in one launch; warp specialization and readiness flags overlap auxiliary work with the dominant expert‑weight stream. MonoMoE is integrated with vLLM and supports multiple model shapes through generated kernel specializations and offline schedule tuning. On NVIDIA H200 GPUs, MonoMoE accelerates the complete routed‑MoE operator by up to \mathbf1.54× over vLLM Triton Grouped GEMM, is \mathbf2.20‑‑\mathbf3.84× faster than FlashMoE‑FP8 adaptation across various models and batch sizes, and reduces end‑to‑end time per output token by up to \mathbf18.7% across the evaluated FP8 models, while preserving task accuracy. The MonoMoE implementation and supporting artifacts are open source and available in the \hrefhttps://github.com/flashinfer‑ai/flashinfer/tree/main/csrc/fused_moe/monomoeFlashInfer repository.
Authors:Hanhaodi Zhang
Abstract:
Autoregressive decoding on cheap hardware is bound not by FLOPs but by the bytes each generated token must move across the slowest populated tier of a memory hierarchy. We treat bytes‑per‑token as a first‑class design axis, organized by an address‑determinism taxonomy that classifies parameters by when their fetch address becomes known during a token's forward pass (A0: at token sampling; A1: before attention; A2: layerwise data‑dependent; A3: always read). This reduces prefetch scheduling to single‑machine feasibility with release times, yielding a closed‑form windowed roofline. We run dual‑budget (bytes‑per‑token times storage) ablations across three sub‑100M scales, then take the framework to real large‑MoE deployment and report a substantial negative result the roofline predicts: on an 8GB edge board running Qwen3‑30B‑A3B (4‑bit, 18GB), the model overflows RAM and decode is pinned at the eMMC bandwidth ceiling; predictive expert prefetch does not help ‑‑ not temporal‑locality prefetch (net‑negative), not even a trace‑driven oracle with perfect prediction ‑‑ because the binding constraint is byte volume over a saturated bus, which prefetch cannot reduce. The lever that works is reducing bytes‑per‑token until the model fits the fast tier: quantized to fit a 16GB unified‑memory device, the same model runs GPU‑resident at 11.5 tok/s (22x). We reconcile this with GPU‑serving expert‑prefetch predictors: a frozen‑model probe predicts Qwen3‑30B routing from the pre‑attention state at 91.2%, a scale‑invariant predictability property, but this converts to throughput only where the fast tier caches most of the model and per‑token transfer is comparable to compute ‑‑ measured to hold on an A100 PCIe‑offload path and to fail on bandwidth‑walled edge storage. Predictability is not speedup; we chart where the gap closes.
Authors:Xiaojiang Peng, Dawei Huang, Yongjie Lv, Ruijie Xiong, Chunxiang Jin, Bin Li, Xiaohui Wang, Zitong Yu
Abstract:
Speech emotion recognition (SER) is a crucial component of human‑computer interaction, attracting extensive attention from both industry and academia. However, existing SER systems typically assume alignment between vocal tone and lexical semantics, overlooking the real‑world scenarios that involve tone‑word conflict‑where the emotion conveyed by speech contradicts the literal meaning of the words. To bridge this gap, we introduce TWIN‑SER (Tone‑Word Incongruent SER), a benchmark for systematic evaluation under acoustic‑semantic incongruence, and show that state‑of‑the‑art models degrade severely under such incongruence. To address this, we propose DAS (Disentangled Acoustic‑Semantic fusion), a framework that mitigates tone‑word conflict by explicitly disentangling acoustic and semantic pathways, selecting informative high‑energy embeddings, and adaptively fusing them via a lightweight query‑based attention mechanism. Specifically, DAS comprises three crucial modules: i) a heterogeneous feature extraction module that separately captures complementary acoustic and semantic representations from raw input; ii) a high‑energy embedding selection module that identifies and retains the most discriminative embeddings; and iii) a Q‑Former combination module that bridges the two pathways through cross‑attention, enabling robust emotion prediction under incongruent conditions. Extensive experiments demonstrate that DAS consistently outperforms existing methods in tone‑word conflict scenarios, as well as in standard in‑domain and zero‑shot settings. Our code and datasets are available at https://github.com/24DavidHuang/FAS
Authors:Denis Pavlov, Ulanbek Abdurazakov, Nursultan Bakashov
Abstract:
We present GEPARD (Generative, Prosody‑aware, Autoregressive text‑to‑speech model for Realtime Dialogue), a streaming text‑to‑speech model for real‑time spoken dialogue. GEPARD generates speech autoregressively with an LLM backbone ‑ text and audio embeddings are trained together in a single decoder‑only model ‑ and decodes it to a waveform with an FSQ‑based neural codec, streaming audio chunk‑by‑chunk as text arrives. Our central goal is a TTS architecture served by a standard LLM engine (vLLM) without modifying its compute kernels. This defines the overarching design principle: the backbone is a standard full‑attention transformer, while all non‑trivial auxiliary mechanisms ‑ zero‑shot voice cloning, text augmentation, and classifier‑free guidance ‑ are moved out of the autoregressive decode loop into prefill, or distilled directly into the weights. On streaming end‑to‑end inference, a single stream reaches a Real‑Time Factor of about 0.067 (roughly 15x faster than real‑time); under 256 concurrent streams the system reaches an aggregate speedup of about 204x on a single server‑class GPU. We detail: (1) system‑level solutions for vLLM‑native serving; (2) the "short register" (1‑2 word) failure mode of autoregressive speech decoders, with diagnostic probes and a mitigation; and (3) distillation of two‑pass classifier‑free guidance over text into single‑pass weights via Direct Preference Optimization (DPO).
Authors:Chin-Yang Lin, Yang-Che Sun, Cheng Sun, Fu-En Yang, Min-Hung Chen, Yen-Yu Lin, Wei-Chen Chiu, Yu-Lun Liu
Abstract:
Online 3D reconstruction models perform poorly on long videos. This happens because regressing poses relative to a fixed first‑frame anchor forces extrapolation far beyond the training distribution. Small drifts accumulate and amplify into significant geometric collapse. However, we observe that per‑frame depth remains stable throughout this failure. The backbone's local geometry remains intact; only the global pose head breaks down. Motivated by this decoupling, we introduce Scal3R. This approach reformulates online reconstruction as multi‑reference relative pose querying. We use lightweight learnable tokens, which make up about ~1% of the parameters, and inject them into a completely frozen backbone via asymmetric attention. This setup queries poses relative to multiple past keyframes. An online pose‑graph optimization system with loop closure suppresses long‑range drift. Scal3R reaches convergence in 8 hours on a single GPU. It reduces the average ATE by over 60% on KITTI compared to the online baseline. It also achieves state‑of‑the‑art performance across Virtual KITTI, Sintel, TUM‑Dynamic, ScanNet, and 7‑Scenes. Project page: https://linjohnss.github.io/scal3r/
Authors:Kang Liao, Yihang Luo, Xiao-Ming Wu, Linyi Jin, Size Wu, Chunyu Lin, Yao Zhao, Fei Wang, Wei Li, Chen Change Loy
Abstract:
We propose Puffin‑World, a unified multimodal architecture that integrates physical understanding, spatial simulation, and 3D world generation and reconstruction without relying on external offline modules. To reliably construct and interact with 3D worlds, our framework jointly models three native world states: physics (gravity field and latitude), geometry (depth), and appearance (image), together with a unified Omni‑Camera representation that supports diverse tasks and flexible motions. Beyond modeling these states, we introduce a strategy for propagating physical dynamics across future frames. By grounding absolute camera properties in the real world, Puffin‑World enables physically consistent and visually stable world generation. We further couple appearance and geometry within a single generative process, jointly synthesizing each future view and reconstructing its underlying geometry. This unified paradigm enables interleaved closed‑loop applications requiring synergy across multiple tasks, including mimic and self‑calibrated world exploration. To scale Puffin‑World to complex scenarios, we construct Puffin‑16M, comprising 15 million vision‑language‑camera triplets and 1 million trajectories featuring various and challenging motions. To foster further research in this area, we released the code, models, and datasets.
Authors:Yupeng Zheng, Xiang Li, Songen Gu, Yuhang Zheng, Shuai Tian, Weize Li, Linbo Wang, Chaoyue Li, Qichao Zhang, Haoran Li, Zhongpu Xia, Ya-Qin Zhang, Shuicheng Yan, Dongbin Zhao
Abstract:
Vision‑language pre‑training and predictive world modeling provide robot policies with rich semantic and dynamic visual features, but their native action and visual‑prediction objectives may omit critical physical and task structure while retaining control‑irrelevant visual redundancy. We call this mismatch between visual richness and control utility the action‑sufficiency gap. We investigate whether this gap can be bridged by guiding intermediate features to preserve three control‑relevant structure in robotic manipulation: geometry governing motion feasibility, affordance encoding instruction‑relevant entities, and goals grounding instructions in task‑relevant regions. To this end, we present GIFT (Guided Intermediate Feature Training), an architecture‑flexible framework for learning intermediate features that translates these structures into training‑time constraints through geometry alignment, affordance prediction, and goal‑region reconstruction. We instantiate GIFT in a Vision‑Language‑Action (VLA) policy, a direct‑action World‑Action Model (WAM), and an inverse‑dynamics WAM while retaining each model's action formulation. Under zero‑shot transfer to LIBERO‑Plus, GIFT‑VLA, GIFT‑WAM‑Fast, and GIFT‑WAM‑IDM outperform StarVLA‑OFT, Fast‑WAM, and Fast‑WAM‑IDM by 4.6, 12.6, and 5.2 points, reaching 79.6%, 72.6%, and 87.8%, respectively. On RoboCasa, the three GIFT variants reach 61.4%, 83.6%, and 82.3%, outperforming their counterparts by 12.6, 9.0, and 8.4 points, respectively. Together, these results establish learning functionally structured intermediate features as a reusable principle across model‑specific action formulations, with especially large gains on articulated‑object tasks and high‑precision real‑world manipulation under unseen visual and spatial perturbations. Project page: https://openphoenix‑team.github.io/GIFT‑pages.
Authors:Adheesh Sunil Juvekar, Onkar Kishor Susladkar, Kiet A. Nguyen, Muntasir Wahed, Nabeel Bashir, Xiaona Zhou, Tianjiao Yu, Vedant Shah, Ismini Lourentzou
Abstract:
Video editing spans diverse editing paradigms, yet achieving high‑quality instruction‑guided and subject‑guided editing within a single unified framework remains challenging. We introduce EditVid, a training‑free framework combining sparse causal memory for local coherence, correspondence‑based post‑attention token injection for long‑range identity preservation, and soft latent blending for edit locality. The same framework supports instruction‑guided and reference‑guided edits, including style transfer, attribute modification, object insertion, part‑level editing, and subject replacement. On FiVE, EditVid achieves 78.16 FiVE‑Acc, compared with 58.95 for the strongest evaluated training‑free baseline, while obtaining competitive results on IVEBench. A user study further shows a 51.8% overall preference for EditVid over 7 competing methods.
Authors:Denis M. Akola, David F. Fouhey
Abstract:
3D Foundation Models (3DFMs) such as VGGT have recently pushed the boundaries of 3D vision by predicting rich unified representations with feed‑foward transformers. The scene representations learned by these models enable strong performance on multiple 3D vision tasks. In this paper, we investigate using their internal representations to infer 3D in the scene from new views. Our hypothesis is that in order to solve the task of 3D reconstruction, these models need to learn a representation that includes a large amount of general knowledge about 3D scenes. After showing that it is possible to decode hidden surfaces from internal 3DFM representations, we propose a method, Z3D, that estimates pointmaps in unseen views by doing latent diffusion on 3DFM representation. We show that Z3D can predict realistic depth maps for new views across multiple datasets.
Authors:Xin He, Yanlin Wang, Mingwei Liu, Jiachi Chen, Hongyu Zhang, Guanbin Li
Abstract:
Repository‑level software engineering benchmarks have significantly advanced the evaluation of coding agents, but existing benchmarks primarily measure whether generated patches pass functional tests and overlook review‑derived acceptance constraints (review constraints) that often influence whether a patch is acceptable in real‑world software development. We introduce SWE‑Gate, a repository‑level benchmark for software engineering agents that explicitly evaluates review constraint compliance alongside functional correctness. SWE‑Gate derives review constraints from real pull request review comments and synthesizes repository‑level repair instances around these constraints. Each instance provides separate functional and constraint tests, together with non‑compliant and gold patches, enabling explicit separation between issue resolution capability and review constraint compliance. We construct SWE‑Gate with 303 repository‑level repair instances spanning 75 open‑source Python repositories across diverse software domains. Experiments with four LLM backends spanning different capability levels under a common coding‑agent scaffold reveal a substantial gap between functional success and success under the complete repair specification: among 644 repairs that pass the functional tests, 221 fail to satisfy the provided review constraints. These findings show that functional‑only evaluation overestimates agents' ability to satisfy the full requirements of repository‑level repair tasks. The replication package including code, data, and experimental results is available at https://github.com/DeepSoftwareAnalytics/SWE‑Gate.
Authors:Wei Zhang, Xin Li, Peishu Shi, Jialin Gao, Xuekang Peng, Zhichao Lian, Yeying Jin
Abstract:
Video virtual try‑on (VVT) aims to generate realistic videos of a person wearing a target garment. Recent methods leverage a keyframe‑driven video generation paradigm to improve in‑the‑wild performance, yet they still rely on masks to localize try‑on regions, making them vulnerable to large motions and severe occlusions. Although mask‑free image‑based try‑on methods have shown promising results by leveraging large‑scale pseudo data, extending this paradigm to videos remains difficult, as constructing video‑level pseudo data is prohibitively expensive. Furthermore, coarse keyframe sampling and the scarcity of multi‑view try‑on data limit existing keyframe‑driven methods in maintaining garment consistency and handling diverse try‑on tasks. To address these challenges, we propose BooM‑VVT, a mask‑free VVT framework built upon the keyframe‑driven paradigm. To achieve mask‑free VVT, we introduce a multi‑stage training strategy that leverages image‑level pseudo data for mask‑free localization learning, substantially reducing the need for costly video‑level pseudo data. To improve garment consistency, we propose Garment‑Sensitive Keyframe Sampling, which selects keyframes based on garment‑relevant body regions to better capture garment appearance. We further introduce Frame‑Shared 3D‑RoPE to establish spatiotemporal correspondences between keyframes and target video frames for accurate garment‑detail transfer. Finally, we construct OmniView, a large‑scale multi‑view try‑on dataset to support reliable try‑on video generation under complex camera viewpoints and diverse try‑on tasks. Extensive experiments demonstrate that BooM‑VVT achieves superior temporal consistency and garment fidelity over existing methods. Project page: https://boomvvt.github.io/boomvvt.
Authors:Yumeng Shi, Quanyu Long, Yin Wu, Wenya Wang
Abstract:
Seeing frames in order does not mean representing time. Modern VideoLMs receive ordered video streams, yet their main supervision acts on generated text rather than video‑token representations where event dynamics should first emerge. This mismatch allows models to learn temporal answers from shortcuts such as objects, scenes, and language priors, without requiring internal video representations to capture event progression. To address this, we propose VT‑Contrast, a representation‑level temporal counterfactual objective for VideoLMs. Its design asks where temporal supervision should act and what temporal differences it should expose. VT‑Contrast supervises selected late‑layer last‑frame video tokens, where temporal information is expected to be integrated before language generation, and contrasts order‑preserving views with same‑video reordered counterfactuals graded by Kendall tau distance. It requires no architectural changes, is compatible with diverse VideoLM training tasks, and improves overall performance across temporal understanding benchmarks. Our code is available at https://github.com/ANDgate99/VT‑Contrast.
Authors:Shubham Gandhi, Saurabh Goyal, Kiran Kate, Yara Rizk
Abstract:
Reinforcement Learning from Verifiable Rewards works well when a task has a programmatic checker, but most long‑horizon agent domains have none. We work in the outcome‑blind setting, where ground‑truth success signals are not available. Multi‑criteria rubrics are a popular way to supply such a reward; they are scored once per trajectory, but a single scalar is a poor signal across tens of steps. We propose DRACO: Distributing Rubric‑based Advantage for Credit Optimization. It generates rubrics dynamically during training to track the policy's evolving capability, scores those rubrics once per completed trajectory, and redistributes that judgment over the steps responsible for annotated rubrics to produce differentiated per‑step advantages in GRPO. The redistribution is closed‑form and does not introduce any trained attribution module. On AppWorld, DRACO gains 15.9 points over the base model and 5.3 points over GRPO trained with a sparse ground‑truth reward, despite not using any verifiers itself. On out‑of‑domain Tau‑Bench, it gains 5.3 points over the base model even without a frontier judge, beating both ground‑truth‑reward training and other rubric‑based training settings. The code for DRACO is available at https://github.com/IBM/draco.
Authors:Yutai Zhou, Erdem Bıyık
Abstract:
Reinforcement learning from human feedback (RLHF) has emerged as a powerful yet sample‑inefficient approach for learning reward models from human preferences, making active learning a critical component in synthesizing informative preference queries. However, effective uncertainty quantification required for active learning remains a key challenge for large neural network reward models. In this paper, we introduce PreferenceEKF, a sample‑efficient approach that tracks reward model uncertainty by framing active preference learning as a sequential Bayesian filtering problem. Instead of relying on computationally prohibitive posterior inference over the full neural network parameter space, our method performs sequential inference via an extended Kalman filter within a low‑dimensional parameter subspace, continuously updating the reward model posterior as new preference queries arrive. Our approach enables scalable sampling of neural network parameters to efficiently compute acquisition functions for active reward learning. Experiments on the D4RL and V‑D4RL benchmarks demonstrate that our approach achieves better sample efficiency, runtime, scalability, and calibration compared to other Bayesian deep learning approaches, and the learned reward models lead to competitive offline reinforcement learning policy performance. This highlights the potential of scalable Bayesian methods for preference‑based reward modeling in RLHF. Our code is available at https://github.com/yutaizhou/bnn_pref.
Authors:Shuaiting Li, Zelin Gao, Haibin Shen, Yujun Shen, Haotong Qin, Yinghao Xu
Abstract:
Video diffusion models (VDMs) have achieved impressive progress in text‑to‑video generation, but their high memory and computational costs hinder practical deployment. Quantization‑aware training (QAT) is an effective solution for compressing and accelerating advanced generative models without runtime overhead at inference. However, existing QAT methods suffer from a distinctive challenge in VDMs: while they often preserve prompt semantics, global layout, and coarse motion, the quantized model severely degrades visual details, texture fidelity, and sharpness. In this paper, we trace this degradation to the timestep‑agnostic design of conventional quantization pipelines, which overlooks the stage‑wise functionality of video denoising. In VDMs, early denoising steps mainly establish global structure and motion, whereas middle and late steps refine local appearance and high‑frequency details. Based on this insight, we propose DSAQuant, a Denoising‑Stage‑Aligned Quantization‑aware training framework for VDMs. During training, Denoising‑Stage Oriented Supervision preserves teacher distillation in early steps for stable structure planning, while shifting later steps toward target‑driven optimization to enhance detail reconstruction. During inference, Denoising‑Stage Gated Guidance disables CFG in the final denoising steps to prevent it from amplifying quantization‑induced errors into high‑frequency artifacts. Extensive experiments on the Wan and CogVideoX families under W4A4 and W3A3 settings show that DSAQuant consistently outperforms the SOTA QAT baseline, improving the VBench average score by up to 6.60 under aggressive W3A3 quantization while preserving strong text‑video alignment. These results demonstrate that effective VDM quantization requires not only reducing quantization error, but also aligning quantization training and inference with the stage‑wise nature of video diffusion.
Authors:Shaohui Liu, Rémi Pautrat, Daniel Barath, Richard Hartley, Viktor Larsson, Marc Pollefeys
Abstract:
Bundle Adjustment (BA) is a cornerstone of 3D computer vision and has benefited from decades of advances in sparse optimization and numerical methods. It was originally developed for jointly optimizing camera intrinsics, poses and sparse 3D points. While extensions incorporate lines and other primitives, integrating richer geometric structures such as parallelism, coplanarity, or wireframes often introduces significantly increased computational cost and reduced numerical stability. In this paper, we propose a unified framework that extends bundle adjustment to jointly optimize geometric features and higher‑order relations. We first introduce a taxonomy that distinguishes scalable geometric features with direct 2D measurements (e.g., points and lines), from groups encoding higher‑order relations (e.g., coplanarity, parallelism, etc.), where we show that groups can be modeled as camera‑like entities within the bundle adjustment framework. Building on this formulation, we propose that both group constraints and cross‑feature relations (i.e., point‑line associations) can be expressed through 2D reprojection measurements. By formulating group‑induced and cross‑feature reprojection errors, we preserve the sparsity structure of classical point‑based BA under Schur elimination, while avoiding direct 3D regularization that degrades the conditioning and stability. Experiments on both real‑world and synthetic datasets demonstrate runtime performance comparable to classical point‑only bundle adjustment, while producing significantly richer 3D structures and improved geometric accuracy.
Authors:Victor Lavrenko
Abstract:
Procedural instruction following is a basic requirement for controllable language‑model systems, especially when generated trajectories are inspected or repaired downstream. We introduce instruction duplication, a minimal black‑box inference‑time control that repeats only the procedural instruction, without retraining or decoding changes. Across seven instruction‑tuned models, 300 medical multiple‑choice questions, eight placement conditions, and 16,800 scheduled generations, moving from one to two copies raises the deterministic All‑8 diagnostic‑‑responses passing all eight observable tests‑‑from 90.22% to 93.17% (+2.95 percentage points), eliminating 30.2% of the failures remaining after one copy. Pre‑provisional TF‑IDF recall rises from 73.44% to 74.81% (+1.38 points; Holm‑adjusted p < .001), while final‑answer accuracy remains exactly 60.21%. Premature commitment increases from 1.52% to 2.30% (p_Holm = .00536). A blinded challenge audit yields 10/30 directional confirmations, 20/30 perceptual ties, and no reversals; its prespecified 28/30 confirmation criterion is not met. Yet this distinction can matter operationally when a downstream system acts on the generated trajectory. In Answer Engineering (AE), where explicit trajectory state determines local repair, the published reason‑first no‑editing SSNHL endpoint was 25.1%; system‑only AE was later reproduced at 84.2%, and the same trailing duplicate raised it to 97.1%. For conductive diagnostic branch preservation, the corresponding values are 58.9% published without editing, 78.6% with reproduced AE, and 73.8% with AE plus duplication‑‑a within‑AE decrease, but still 14.9 points above the no‑editing baseline. Instruction duplication is therefore a low‑complexity, placement‑sensitive control whose practical value can emerge through the downstream system that consumes the exposed trajectory.
Authors:Subham Sekhar Sahoo, Lingjie Chen, Khiem Pham, Jonathan Geuter, Chaitanya Dwivedi, Varad Pimpalkhute, Yash Akhauri, Alexander Moreno, Mikhail Yurochkin, Zhenting Wang, Mostafa Elhoushi, Nolan Dey, Shane Bergsma, Joel Hestness, John Thickstun, Eric Xing, Zhengzhong Liu
Abstract:
Large Language Models (LLMs) owe much of their success to next‑token prediction (NTP), but their autoregressive (AR) structure requires slow, sequential token generation. To overcome this bottleneck, we introduce diffusion‑augmented LLMs, a new class of models that defines an AR model distribution while using diffusion to draw multiple tokens in parallel from that distribution. We decouple the parameters of these models into two sets: AR weights, trained using the standard NTP objective, and lightweight diffusion weights, trained to generate multiple tokens simultaneously. The diffusion weights are learned through a simple Diffusion Distillation phase that adds negligible overhead to existing LLM training pipelines. We also introduce Ψ‑Spec, a family of samplers that enables lossless acceleration and inference‑time scaling at a fixed context length. Unlike speculative decoding, our method requires no separate draft model. Unlike diffusion LLMs (d‑LLMs), it accelerates generation without sacrificing the quality of the underlying AR model. The resulting models, called Uno, can be trained from scratch or built by augmenting existing open‑weight AR LLMs. Uno achieves higher throughput than leading speculative‑decoding methods at every evaluated batch size and delivers up to 3× speedups over the base AR model, including at the largest batch size supported by the device. Notably, our 8B Uno model outperforms the leading open d‑LLM, the 26B DiffusionGemma, and the proprietary Mercury 2 across all evaluated benchmarks in agentic tool use, coding, and long‑context reasoning. We release code and checkpoints at: https://s‑sahoo.github.io/uno/
Authors:Reinhard Wiesmayr, Nuri Berke Baytekin, Chris Dick, Christoph Studer
Abstract:
Site‑specific training can improve wireless receiver performance without increasing computational complexity. However, real‑world results have so far focused on fully trainable neural receivers and single‑layer transmissions. We study site‑specific finetuning of three receiver architectures: fully trainable neural, model‑driven neural, and model‑based. We train and evaluate these receivers using new measurements from a standard‑compliant 5G NR testbed at ETH Zurich with dual‑layer uplink transmission, including measurement campaigns conducted more than six months apart. Our results show that site‑specific finetuning (i) substantially improves fully trainable and model‑driven neural receivers, while resulting in only marginal gains for the less tunable model‑based receiver; (ii) enables a single neural receiver jointly finetuned for single‑ and dual‑layer transmission to closely match receivers finetuned separately for each configuration; and (iii) remains effective across measurement campaigns separated by more than six months. We also investigate site‑specific linear minimum mean‑square error channel estimation using covariance matrices estimated from either synthetic channels or site‑specific measurements. When combined with iterative detection and decoding, site‑specific channel estimation achieves the lowest error rate observed in our datasets. Our finetuning code and measurement datasets are publicly available at https://github.com/IIP‑Group/site_specific_training
Authors:Wenbo Wang
Abstract:
Agent evaluations report a tool‑call rate read off the serving stack. That number can be zero while the model is emitting well‑formed calls: the interface censors the trajectory before anything downstream sees it. On BFCL v4's own data, executor and scorer, holding weights, cases, decoding and seeds fixed and changing only the serving adapter, the same model scores 0.00 or 0.96 / 0.19. A 2x2 over chat template and parser locates the effect exactly: both main effects are exactly zero and all of it sits in the interaction ‑‑ no component is defective, and repairing one side of the contract buys precisely nothing. On tau‑bench's 115 interactive retail tasks the same swap moves server‑parsed calls from 0 to 636 and tasks reaching any tool execution from 0 to 103. Our probe reproduces the funnel across a 21x scale range of Qwen2.5‑Coder: the server parses 0/100 at every size while well‑formed emitted calls rise to 80/100 at 32B (~72 after calibration against an adjudicated gold standard). Under a matched envelope, across a comparable scale span, the silent fraction stays at 0‑2, a prediction committed to the repository before the run. Llama‑3.1‑8B's 23% rate of calling the task function itself as a tool falls to 0 under one strict:true flag. The mismatch reaches inside the training loop, and its consequence is scale‑dependent: in verl's AgentLoop at 7B, 45 of 115 generations carry a complete call; 0 are accepted, 0 execute, 0 return an observation. At 1.5B the same zero is over‑determined, so we report the two scales separately. At evaluation time, repairing the adapter restores the mechanism but not a significant outcome gain: parsing 0‑>84, rescues 0‑>9, pass rate 53‑>62 (n.s.). We release a 98‑line preflight check that catches every silent failure here. The observed tool‑call rate is not a property of the model alone; it is a property of the model‑interface stack that measures it.
Authors:Tomas Guija-Valiente, Blanca Rodriguez-Gonzalez, Norberto Malpica, Angel Torrado-Carvajal
Abstract:
Medical image inpainting has the potential to improve automated brain MRI analysis by reconstructing healthy tissue within pathological regions. We introduce RARF, a task‑agnostic region‑aware rectified flow framework for masked data generation. We instantiate the framework for 3D brain MRI inpainting as our submission to the BraTS Inpainting Challenge 2026. RARF restricts the stochastic interpolation process to the inpainting region, while the observed voxels remain fixed and provide patient‑specific anatomical context. A three‑dimensional neural network receives the partially voided image, with Gaussian noise filling the missing region, together with the inpainting mask and the corresponding timestep. The model is trained using masked flow‑matching and reconstruction‑consistency objectives, combined with mask‑aware preprocessing and data augmentation. During inference, the learned velocity field transports the initial noise toward a plausible reconstruction of the missing tissue, which is then combined with the unchanged observed anatomy. Experiments under the BraTS evaluation protocol show that the proposed approach produces competitive reconstructions while maintaining anatomical consistency. Source code is available at: https://github.com/TomasGuija/rarf.
Authors:Yibin Wang, Zehan Wang, Junshu Tang, Zhimin Li, Yujie Zhou, Jiazi Bu, Pengyang Ling, Feng Han, Zhixiong Zhang, Long Xing, Shengyuan Ding, Ziang Li, Cheng Jin, Yuhang Zang, Jiaqi Wang, Tianyu Pang
Abstract:
Camera‑conditioned world models generate interactive videos in which commanded actions should induce the expected scene changes while appearance, geometry, and temporal dynamics remain coherent. Existing rewards assess these requirements separately: geometry‑based rewards estimate trajectory execution but cannot judge the visual quality of the executed motion, whereas image‑based rewards measure frame quality without capturing action execution or temporal dynamics. We posit that a vision‑language model (VLM) offers a shared reasoning space for relating actions to their visual outcomes. However, judging a complete long video against its full action sequence creates a lengthy, noisy context in which short‑lived local action evidence can be missed or diluted. We present WorldReward, a VLM‑based pairwise preference reward model that unifies action‑consistency and visual‑quality evaluation for camera‑conditioned world models. WorldReward decomposes paired videos into action‑aligned chunks, organizes each chunk into structured visual evidence, and aggregates chunk‑level decisions by voting into separate video‑level action and visual‑quality preferences. To train it, we construct a large‑scale reasoning‑augmented preference dataset using structured judgments generated by a frontier VLM and refined through tool‑based agent auditing and targeted human review. We further introduce WorldReward‑Bench, a human‑annotated benchmark measuring reward‑model agreement with human preferences across action consistency, appearance quality, and motion quality. WorldReward achieves the highest agreement on all three dimensions, exceeding GPT‑5.5 by 3.42, 1.45, and 3.56 percentage points, respectively. When used for RL post‑training of HY‑WorldPlay 1.5, it consistently improves both action execution and visual quality across short‑ to long‑term horizons.
Authors:Zelong Lv, Sicheng Xu, Jianfeng Xiang, Ruicheng Wang, Yue Dong, Yu Deng, Guangzhong Sun, Jiaolong Yang
Abstract:
We present OctWorld, a video diffusion framework with persistent 3D memory for generating explorable, world‑consistent, and high‑fidelity visual scenes. Given a single image, OctWorld performs stable autoregressive world generation along user‑specified camera trajectories. We focus on long‑range generation, characterized by extended camera paths and wide viewpoint coverage, where preserving spatial consistency is particularly challenging when previously generated regions are revisited. To address this problem, we introduce OctMap, an extensible and spatially adaptive 3D memory that progressively fuses generated visual observations and their corresponding depth maps into a global representation. OctMap employs TSDF fusion within a dynamic sparse octree whose spatial resolution adapts to image evidence. This design preserves geometric and appearance details across diverse scene scales while maintaining low memory overhead. Experiments demonstrate that OctWorld generates long‑range, spatially consistent videos and outperforms prior methods on both existing benchmarks and challenging long‑range generation settings. OctMap also provides clear advantages over point‑based caches and fixed‑resolution TSDF volumes. Project page: https://maxtirerror.github.io/octworldpage/
Authors:Biraj Subedi
Abstract:
We present a comparative evaluation of six information retrieval methods for the task of academic advisor discovery: ranking CS faculty members by relevance to a graduate applicant's research interest statement. The methods span sparse lexical matching (Jaccard overlap, TF‑IDF, BM25), dense semantic retrieval (all‑MiniLM‑L6‑v2 sentence embeddings), hybrid score fusion, and learning‑to‑rank. Evaluation uses a new domain‑specific collection: 768 faculty profiles scraped from 9 US CS departments, with 162 graded relevance judgments (grade 0/1/2) across 5 queries representing distinct graduate student research profiles. Across all five queries, Reranked achieves the highest mean NDCG@10 (0.477, std 0.138), followed by Semantic (0.450), Hybrid (0.421), BM25 (0.406), Jaccard (0.303), and TF‑IDF (0.246). After Bonferroni correction across all 15 pairwise comparisons, TF‑IDF is significantly worse than BM25, Semantic, Hybrid, and Reranked; no other pairwise difference survives correction at 5 queries. A field ablation reveals that biography alone (NDCG 0.634) outperforms the full model combining biography with research area tags (0.593). A controlled experiment shows that concatenating arXiv paper abstracts reduces NDCG@10 by 0.176, motivating a late‑fusion architecture. All code, scrapers, and relevance labels are released openly.
Authors:Linghan Zhong, Aditya Thimmaiah, Jayanth Srinivasa, Milos Gligoric, Junyi Jessy Li
Abstract:
Large language models (LLMs) have become ubiquitous tools for code generation and editing. However, development teams often use multiple LLM assistants. Different developers may prefer different models, and individual developers may switch between models across different coding sessions. Because of this, the edits any one model makes are frequently applied to foreign code originally generated by another model. These LLMs are often trained on different datasets, and as a result have different stylistic preferences. Do LLMs behave differently when they edit foreign code originally written by a different LLM with a different coding style? We find that models tend to make more, and often excessive, edits on foreign code. We introduce CROCODIL (Cross‑model Code Editing with LLMs), a post‑training framework for reducing excessive edits while preserving functional correctness. CROCODIL's similarity reward penalizes large changes, while its execution reward scores build and test success. We use the product of these two rewards to encourage the policy to decrease the edit size without decreasing the edit task success rate. CROCODIL is available at https://github.com/EngineeringSoftware/Crocodil.
Authors:Hoang Cuong Nguyen, Mark Dras, Usman Naseem
Abstract:
How do the methods used to train language models to refuse harmful requests shape how that refusal actually works inside the model? We compare three post‑training methods ‑ supervised fine‑tuning, reasoning‑augmented fine‑tuning (training on reasoning chains that justify a safety decision), and preference optimization (ORPO) ‑ across three architecturally distinct models (Llama‑3.1‑8B, Gemma‑2‑9B, Qwen3‑8B). We find that training method, not just data, reshapes how refusal is computed internally: reasoning‑augmented training consistently produces a distinct kind of refusal computation, visible across all three models, while architecture independently shapes internal structure and how reliably refusal can be steered. Most importantly, no method we study achieves all three properties we would want from safe alignment at once: refusal that isn't concentrated in a few fragile components, safety gains that don't cost general capability, and safety behavior correctable through small, targeted edits. We caution against treating current post‑training methods as a solved, reliable defense, especially for security‑critical use. Code and models are available in https://github.com/hoangcuongnguyen2001/Beyond‑Shallow‑Alignment.
Authors:Nicolas Swanson
Abstract:
For a fixed characteristic p, let δ(p) denote the smallest degree needed to guarantee the existence of an isogeny from any supersingular curve E to its Frobenius conjugate E^(p). We translate existence questions concerning δ(p) into questions about positive definite integral ternary quadratic forms and use Voronoi's theory of perfect forms in dimension three to characterize when δ(p) is nearly maximal. For sufficiently large primes, we show that δ(p) attains its upper bound precisely when p is represented by one of nine explicit cubic polynomials, reducing the infinitude of such primes to whether one of these cubics takes prime values infinitely often. We also prove that, for almost all primes, δ(p) lies at least p^1/6‑o(1) below its upper bound.
Authors:Prakhar Khatri
Abstract:
Long‑video language models cannot look at every frame: an hour sampled once per second is 3,600 images, and a system keeps only a small fixed slice of that pool. Which frames survive that slice is usually treated as a preprocessing detail; we test whether it should be. Published selectors make the comparison hard because they change the frame scorer, the prompt boundary, the resolution policy, and the answering model all at once. We hold each fixed and vary one decision at a time: selection, spatial compression, and reinvestment of the savings, across six training‑free selection rules, three long‑video benchmarks, and two answering models. Selection is the largest single lever: on LongVideoBench's hour‑long bin, eight query‑selected frames beat sixteen uniformly spaced ones by 6.9 points, and Orthogonal Matching Pursuit, an unmodified decades‑old sparse‑approximation algorithm, matches or comes within a point of every purpose‑built selector we compare it against, across all three benchmarks. Compression is close to free: halving each frame's spatial budget at fixed timestamps costs at most 0.44 points. Reinvestment is where that budget turns back into accuracy: spending the freed tokens on twice as many compressed frames, at a measured cost no higher than the original eight, returns a further two to three points; compression only pays off once its savings are spent this way. Along the way, an implementation bug in our own AKS baseline and a 0.07 to 3.74 point gap between two harnesses running the same published rules at the same budget show why these comparisons need to happen inside one controlled harness rather than across papers.
Authors:Minwei Zhao, Weiming Zhang, Jiawang Du, Qiming Liu, Weiming Zhuang, Pei Nie, Cai Wu
Abstract:
Communities are fundamental spatial units that shape urban form and social life. Whether a residential compound is spatially open or enclosed affects mobility, access to public services, and equity, yet studies of Chinese fengbi xiaoqu remain largely qualitative or small‑scale, limiting reproducible city‑scale analysis. We address this gap by introducing GBA‑GCs, a metropolitan‑scale multimodal benchmark for locally grounded gated/open community recognition in China's Greater Bay Area, covering 37,444 residential compounds with aligned boundary polygons, high‑resolution satellite imagery, Chinese metadata, and structured attributes, together with expert‑verified labels, inter‑annotator reliability, and official evaluation splits. Built on this benchmark, we present Multimodal Classifier for Gated Community (MCGC), a vision‑centric multimodal framework based on DINOv3‑SAT that fuses imagery, text, and structured cues via modality‑aware cross‑attention and adaptive gating to mitigate modality imbalance. MCGC consistently outperforms strong unimodal and multimodal baselines. Finally, we apply the validated model to metropolitan‑scale mapping and report equity‑oriented findings including spatial clustering of GCs, privatized green space, and reduced pedestrian connectivity. The benchmark, code, and release documentation are available at https://github.com/MinweiZhao/GBA‑GCs.
Authors:Saikat Mondal, Mamta, Deeksha Varshney, Oana Cocarascu, Asif Ekbal
Abstract:
Large language models (LLMs) are increasingly used in multilingual settings, yet their safety is still evaluated primarily in English. This limits our understanding of how alignment failures manifest in low‑resource and culturally diverse languages. We introduce IndicSafeEval, a persuasion‑based jailbreak evaluation framework for Indian languages. Our benchmark combines ten safety critical content categories with six human‑like persuasive strategies across four different Indian languages, such as Hindi, Bengali, Marathi and Punjabi, resulting in 7,200 adversarial prompts. We conduct a systematic black‑box evaluation of several open‑source LLMs to examine how their safety behaviour varies across languages, persuasion strategies, and risk categories. Our analysis shows that the model does not behave equally safely across all languages and prompt styles. Instead, safety performance depends strongly on both the languages used and the way a request is phrased using persuasive cues. We further observe that different risk categories exhibit different levels of vulnerability, with some types of harmful content being significantly more susceptible to persuasion‑based jailbreaks than others. These findings reveal important limitations of current safety evaluations, which are largely English‑centric, and underscore the need for multilingual and persuasion‑aware benchmarking frameworks to more accurately assess real‑world LLM safety. Our implementation is available at https://github.com/MonSaikat/IndicSafeEval. Warning: this paper contains example data that may be offensive or harmful.
Authors:Javier del Pino, Salvador Rodríguez, Alejandro Garabito, Javier Álvarez, Chema Garabito
Abstract:
We present ENEAS, a unified, text‑promptable method for instance tracking and semantic discovery. Text‑promptable segmentation models, including the latest foundation models such as SAM 3, still suffer from temporal hallucinations, spatial fragmentation, and semantic misclassification: they fail to report target absence when an object leaves the field of view, segment local textures instead of the complete object during extreme close‑ups, and prioritize visual features over ontological reality, so that visually similar artifacts such as statues, paintings, or reflections are segmented as target entities. ENEAS works two ways from a single method: precise tracking and high‑quality segmentation of a unique instance, and open‑concept discovery of every instance a text query names, resolved by a semantic verification layer. For tracking, we extend the geometrically robust SeC architecture, previously limited to point interactions, with a text‑prompting adapter and leverage its temporal memory, so that the target is held through disappearance without drifting to distractors and kept whole even when it fills the entire view. For discovery, the verification layer combines high‑speed visual embedding matching with conditional VLM refinement, invoking semantic reasoning only for ambiguous candidates, which filters out the ontological errors that visual‑only models cannot distinguish while keeping latency low. Designed with 3D reconstruction in mind, where a single misclassified distractor corrupts the asset, ENEAS unlocks high‑quality semantic tracking and segmentation of video, of broad libraries, and of collections of temporally or spatially unordered data, together with the discrimination to tell true instances from their doppelgangers: things that look alike but are not the same. The code and models are available at https://github.com/speridlabs/eneas
Authors:Qi Liu, Qinzheng Wang, Yiming Bie
Abstract:
As large language models (LLMs) become increasingly capable, the long‑term value of AI systems depends not only on solving individual requests, but also on transforming experience and accumulated knowledge into durable, reusable competence. We introduce SimSkill, a self‑evolving agent built around the Simulation of Urban MObility (SUMO) traffic simulator. SimSkill identifies capability gaps, generates and solves environment‑grounded tasks, verifies solutions through an action‑‑critic loop, and consolidates experience into episodic, procedural, and semantic memory without updating the backbone model. Through autonomous exploration, it builds a reusable library spanning the traffic‑simulation workflow. We evaluate SimSkill on two held‑out benchmarks with three backbone LLMs and independent artifact‑based verification. SimSkill improves verified completion by up to 25 percentage points, while ablations show complementary contributions from procedural and semantic memory. Its benefits remain backbone‑ and budget‑dependent: memory does not improve every model or uniformly reduce inference cost. More broadly, SimSkill illustrates a design paradigm in which natural language preserves and composes computational capabilities, while executable tools and code provide precise and reproducible execution. All code and experimental data are publicly available at https://github.com/qiliuchn/SimSkill‑V1.
Authors:Yi Xu, Yifan Hou, Xiaoyu Zhang
Abstract:
Video lectures are valuable educational resources, but their dense and lengthy formats often overwhelm novice learners. This difficulty stems from a fundamental pedagogical mismatch: while videos deliver transient information linearly, human learning requires constructing interconnected cognitive networks, a task that induces severe cognitive overload for novice learners lacking prior domain knowledge. Existing video summarization methods fail to resolve this mismatch, as they primarily produce text‑heavy, linear condensations that still demand high cognitive effort. To bridge this gap, we propose KnowVis, a framework that transforms linear video lectures into pedagogically grounded visual narratives. KnowVis first extracts a detailed concept map from multimodal video content to identify important and challenging threshold concepts, then constructs structured knowledge units, and finally synthesizes engaging visual summaries. Alongside the framework, we introduce a curated dataset of 125 educational videos across 10 academic disciplines, paired with 1,079 generated visual summaries. Extensive automated evaluations and a human study demonstrate that, compared to state‑of‑the‑art baselines, KnowVis generates more accurate and clear visuals that successfully reduce cognitive load and significantly improve student learning effectiveness and knowledge retention.
Authors:Mohammed Basharath Ullah, Summaiya Unnisa Begum, Mohammed Nadeem Ullah
Abstract:
Data centers are increasingly optimized by artificial intelligence and, at the same time, increasingly loaded by it. The literature treats these as two unrelated problems: control studies model workload as an exogenous arrival process, while sustainability studies model infrastructure as a fixed multiplier. We screen roughly 194 papers retrieved through a documented protocol, code 63 of them, and report what the coding shows. Of 28 primary control‑oriented studies, 18 are validated in simulation alone and 5 reach physical hardware or a production facility; none account for water withdrawal, and none account for embodied carbon. Reported savings intervals across four technique families overlap almost completely, which means the field cannot presently rank its own methods. Ten recurring gaps are scored for consequence and tractability, and we set out CLEAR‑DC, a framework coupling a control‑policy branch to a workload‑demand branch through an explicit elasticity term, reads out net rather than direct benefit, and emits a schema‑conformant record covering energy, carbon, water, embodied share and validation venue. The framework is an architectural and methodological proposal, not a trained system; the contribution we defend empirically is the corpus analysis and the reporting schema derived from it. Coding sheet, derived statistics and all result artifacts: https://github.com/Kimalice/AI‑for‑Energy‑Optimization‑in‑Data‑Centers‑Closing‑the‑Optimizer‑Load‑Loop
Authors:Feixing Chen, Hao Lu, Lin Luo, Yan Xu
Abstract:
Histopathological subtyping relies on the recognition of characteristic histological patterns. These patterns may be expressed by individual tissue structures or by the spatial distribution and co‑occurrence of multiple structures, and they often span irregularly shaped tissue regions, termed semantic units in this work. However, conventional patch‑based representations may fragment such units and fail to explicitly preserve their internal spatial organization, while efficiently modeling relationships among numerous spatially separated units remains challenging. To address these limitations, we propose the Semantic‑Aware Subgraph State Space Model (SASG‑SSM), a flexible and efficient framework for whole slide image (WSI) classification. Semantic‑Aware Subgraphs (SASGs) first approximate irregularly shaped semantic units by adaptively grouping spatially connected patches guided by class‑agnostic visual‑semantic priors. By representing patches as graph nodes with adjacency edges, SASGs preserve their internal spatial organization rather than treating them as an unordered set. A Subgraph State Space Module (SG‑SSM) subsequently combines a graph neural network encoder for intra‑subgraph topology encoding with a Mamba‑based state space encoder for efficient contextualization across large numbers of subgraphs. This module integrates local structural information within semantic units with global contextual information arising from their distribution and co‑occurrence across the WSI, while efficiently modeling a large number of spatially distributed regions. Extensive experiments across four WSI subtyping datasets demonstrate consistent advantages over representative state‑of‑the‑art methods. Further evaluations under small‑cohort and few‑shot settings demonstrate robustness and data efficiency under limited training data. Code will be released at https://github.com/HLSvois/SASG‑SSM.
Authors:Julian Truetsch, Felix Hauser, Christoph Stiller, Frank Bieder
Abstract:
Understanding the composition of large‑scale autonomous driving datasets is essential for safety, robustness, and reliable operation across domains. For example, domain shift between locations could lead to the operating environment being misaligned with the training data, resulting in potentially dangerous performance degradation. Yet, existing data analysis pipelines largely rely on metadata, predefined labels, or manual inspection, which provide limited semantic insight or do not scale. This paper studies set difference captioning: given two subsets of images, the goal is to produce a natural‑language hypothesis describing differences between the target and reference set. Building on a two‑stage formulation, we adapt the method to autonomous driving by focusing on object‑centric patches derived from object detection, which simplifies aggregation and enables attribution of differences to specific object instances or categories. To evaluate this setting in‑domain, we introduce a new benchmark, AD‑Diff Bench. Low‑concentration experiments assess the suitability of set‑difference‑captioning approaches to sparse, real‑world differences. We restrict our experiments to open‑weight models to support reproducibility and ease of deployment. The proposed benchmark and analysis provide a step towards practical, human‑interpretable dataset introspection for autonomous driving datasets. Our implementation and benchmark dataset are available at https://github.com/KIT‑MRT/AD‑Diff
Authors:Yingmao Miao, Pengfei Zhang, Chaoran Xu, Meng Yu, Jing Tang, Xiangxiang Chu, Chao Shen, Chenhao Lin
Abstract:
Video generators build long videos by composing shorter parts, either by generating segments one after another or by autoregressively extending chunks. Each new part usually depends on memories of historical observations, such as recent frames, selected key frames, memory banks, or cached features. These memories preserve visible evidence from the past, but current generators do not reliably turn such evidence into a world‑state interface: what holds in the video world after previous actions and how it should change under the next prompt. A past frame remains valid history, but it may not describe the state needed by the next segment; some states must instead be inferred from occluded or implicit changes rather than copied from a directly observed frame. This creates a simple but overlooked question for video continuation: given a previous video, its prompt, and a new prompt, can a model generate a continuation that reflects the state determined by both the historical video and the new prompt? To answer this question, we introduce Statebench, a benchmark that targets this gap by testing continuations over three state categories: past‑visible states, occluded‑process states, and complex‑transition states. We further propose Stateagent, which explicitly maintains an entity‑state representation, updates it under the new prompt, grounds the predicted post‑action state as a future end frame, and renders the next video. Experiments show that our method improves controlled video continuation by raising the all‑case state score (SCS‑All) from 45.2 to 69.3, and also benefits story generation at the one‑minute scale. Code is avaliable at https://github.com/AMAP‑ML/StateAgent.
Authors:Seunghee Koh, Sungjae Choi, Minchan Kwon, Sunghyun Baek, Junmo Kim
Abstract:
Chain‑of‑thought (CoT) reasoning improves large reasoning models (LRMs) on complex tasks but often produces long, redundant traces. Recent training‑free early‑exit methods shorten these traces by choosing an intermediate point to stop reasoning. We study one such strategy that injects an end‑of‑think token (EoT, </think>) at this point to trigger the reasoning‑to‑answering transition, and find that the injected EoT does not always induce a clean answering phase. Answering‑phase generation can continue before the model regenerates another EoT, with the span preceding this regenerated EoT scaling with the reasoning tokens saved by early exit and exhibiting continued reasoning behavior. We call this spurious CoT termination, where reasoning‑like generation continues into the answering phase. We hypothesize that insufficient attention to the injected EoT contributes to spurious CoT termination and probe this hypothesis with Exit‑token Attention Biasing (EAB). Across four LRMs, five benchmarks, and two early‑exit methods, increasing attention to the injected EoT reduces spurious CoT termination and answering‑phase length. These results reveal a limitation of controlling LRMs by externally matching their explicit think‑block format. Inserting the EoT token conforms to this format but does not by itself guarantee the intended reasoning‑to‑answering transition. Our code is available at https://github.com/Seunghee‑Koh/Spurious‑CoT‑Termination.
Authors:Xinghao Wang, Dong Li, Wei Yu, Yingwei Pan, Tao Gong, Qi Chu, Nenghai Yu, Ting Yao
Abstract:
Recent advances in text‑to‑video (T2V) diffusion models have demonstrated remarkable generative capabilities, yet their reliance on loosely curated training data raises pressing safety and copyright concerns. Concept erasure offers a principled remedy by removing unwanted semantics from pretrained models while preserving remaining concepts. However, existing approaches typically operate at a coarse granularity misaligned with the fine‑grained, distributed nature of concept representations, leading to incomplete removal or degraded generation quality. We argue that surgical erasure fundamentally requires intervention at the level of monosemantic features, where each unit encodes a single interpretable concept. To this end, we propose EraseSAE, a novel framework that leverages sparse autoencoders to achieve surgical concept erasure in DiT‑based T2V diffusion models via a principled decompose‑attribute‑erase pipeline. We first introduce the Partitioned Convolutional Sparse Autoencoder, which decomposes dense spatiotemporal activations into disentangled, interpretable sparse features while preserving spatiotemporal coherence. A contrastive attribution mechanism then contrasts activations from paired prompts to isolate concept‑specific feature kernels. At inference, timestep‑resolved spatiotemporal masks derived from the identified kernels confine erasure to regions where the target concept is active, leaving unrelated content intact. Extensive experiments across diverse diffusion models and concept erasure tasks demonstrate that EraseSAE achieves precise and robust concept removal with minimal quality degradation, substantially outperforming state‑of‑the‑art methods. The code is available at https://github.com/HiDream‑ai/EraseSAE.
Authors:Antonio Scardace, Francesco Guarnera, Sebastiano Battiato, Daniele Ravì
Abstract:
While deep generative models offer new opportunities for medical image synthesis and data sharing, their ability to memorize and reproduce training samples raises serious concerns about patient confidentiality. Detecting such memorization at scale remains challenging: traditional pixel‑based metrics are sensitive to generation artifacts, whereas generic embedding‑based metrics often lack the anatomical sensitivity required for medical data. To address this challenge, we introduce DeepSSIM++, a self‑supervised similarity metric for scalable memorization auditing in medical generative models. By leveraging multi‑scale feature aggregation and anatomy‑preserving augmentations, DeepSSIM++ learns an embedding space where cosine similarity approximates the Structural Similarity Index (SSIM), eliminating the need for exact pixel‑level registration. Compared with state‑of‑the‑art baselines, DeepSSIM++ achieves an average Macro F1 improvement of 33 percentage points under ideal alignment and 46 percentage points under realistic spatial and intensity perturbations. Furthermore, it accelerates large‑scale similarity computation by several orders of magnitude compared with analytical SSIM. By combining anatomical sensitivity and computational efficiency, DeepSSIM++ provides an open‑source tool for scalable memorization auditing in medical generative AI. Code and data are publicly available at: https://github.com/brAIn‑science/DeepSSIM.
Authors:Tzu-Ling Lin, Dong-Ting Yao, Teng-Fang Hsiao, Wei-Chih Chen, Hong-Han Shuai
Abstract:
The growing scale of academic peer review has motivated the use of Large Language Models (LLMs) as review assistants, yet LLMs can generate fluent but unsupported claims that undermine review reliability. Existing hallucination benchmarks are not designed for peer review, where verification requires grounding claims in long, technical papers. We introduce HalluPeer, a benchmark for detecting hallucinations in scientific peer reviews, providing aligned triples of paper content, human‑written reviews, and hallucination‑injected reviews, annotated for detection, classification, and localization. Our pipeline induces a peer‑review‑specific hallucination taxonomy, identifies review contexts, and injects hallucinations with automated filtering. Experiments on 12K papers and 38K reviews show that existing detectors struggle to separate hallucinations from legitimate critique, while evaluation on authentic reviews demonstrates that HalluPeer‑defined hallucination patterns occur in real peer reviews, highlighting the critical need for source‑aware verification. Our project page can be found in https://github.com/Lin‑TzuLing/HalluPeer.git
Authors:Byeongjun Park, Byung-Hoon Kim, Hyungjin Chung
Abstract:
We present FlashRender, a few‑step generative rendering framework that retakes a source video along a target camera trajectory in seconds. We identify sampling‑step‑dependent camera control as a prominent manifestation of discretization error in existing multi‑step generative rendering models and show that resolving this inconsistency substantially lowers denoising trajectory curvature, facilitating subsequent step distillation. To this end, we introduce Representation Transformation and Alignment (RETA), which aligns hidden source‑video representations with target‑video features from a frozen visual geometry model. This directly encodes the geometric transformation within the source‑video stream, enabling sampling‑step‑consistent camera control. We then fine‑tune the model with the MeanFlow objective on the lower‑curvature denoising trajectory induced by RETA, allowing the model to more effectively address discretization error. Finally, we apply on‑policy flow map distillation to correct self‑rollout errors under fixed few‑step sampling. Extensive experiments show that RETA, MeanFlow, and on‑policy flow map distillation play complementary roles in few‑step generative rendering. Together, they enable our approach to match multi‑step baselines in video quality and geometric consistency at 25x lower sampling cost while achieving superior camera controllability, even under out‑of‑distribution target camera trajectories.
Authors:Chiyun Noh, Turcan Tuna, William Talbot, Marco Hutter, Laurent Kneip, Ayoung Kim
Abstract:
Existing radar‑LiDAR fusion methods rely on fixed residual weights, even though the informativeness of radar Doppler and LiDAR geometry is scan‑ and direction‑dependent, leading to uniform radar weighting that misallocates Doppler information across translational directions. To address this limitation, we propose two degeneracy‑aware Doppler reweighting modules within a tightly coupled Radar‑IMU‑LiDAR odometry framework: per‑point radar reweighting and scan‑wise radar gain scheduling. Since geometric degeneracy is directional, we first identify weak translational directions from the LiDAR geometry and reweight individual radar Doppler constraints based on their alignment with the weak subspace. We further adjust the overall radar contribution using LiDAR geometric anisotropy such that radar is emphasized when LiDAR observability is poor and suppressed when LiDAR constraints are already reliable. Across 13 evaluated sequences, TRaIL‑Odom achieves state‑of‑the‑art overall performance, with clear advantages in geometrically degenerate scenes. In ablation experiments on three degenerate sequences, combining the two adaptive weighting modules reduces RMSE ATE and RTE by 86.0% and 78.5% relative to the fixed‑weight baseline. We make our code and an accompanying dataset publicly available at https://github.com/ChiyunNoh/TRaIL‑Odom.
Authors:Jie Wang
Abstract:
Existing theories derive neural scaling from data geometry or a specified data‑model spectrum, but systems trained on the same data can scale differently when architecture or optimization changes the representations they can efficiently reach. We introduce Coupled Scaling, a task‑conditioned framework in which finite‑budget scaling depends on the relation between task structure and the geometry accessible to an architecture‑optimization system. In a solvable mode‑truncation model, loss separates into target energy outside architectural support and an unresolved supported tail. For an arbitrary priority order, the residual lies between the best‑N supported tail and the tail beyond the largest completed high‑value prefix. If the cumulative‑tail and coverage log‑rates are γ_A,T and ρ_A,O,T, the residual exponent lies in [ρ_A,O,Tγ_A,T,γ_A,T]. Under bounded off‑prefix gain, the completed prefix is rate‑determining and α_A,O,T=ρ_A,O,Tγ_A,T; for a_A,T,j\asymp j^‑b_A,T, this gives α_A,O,T=ρ_A,O,T(b_A,T‑1). A fixed‑kernel specialization derives the training‑time exponent from the near‑zero tail of a task‑weighted spectral measure defined independently of the loss fit. The framework separates architectural support from finite‑budget acquisition and motivates two tests: static task‑relevant geometry should track loss at a common budget, while multiscale geometry should track coupling‑specific exponent ordering, including reversal across contrasting tasks. An audit of released emergence trajectories identifies the controls needed for a direct factorial test that measures geometry separately from the scaling fit.
Authors:Bo Zeng, Linfeng Gao, Peiqin Lin, Yu Zhao, Mingyan Zeng, Yu Tong, Xintong Wang, Linlong Xu, Longyue Wang, Weihua Luo, Qinggang Zhang, Jinsong Su
Abstract:
Multimodal language models achieve near‑ceiling scores on food recognition benchmarks, yet it remains unclear whether this success reflects genuine cultural understanding or mere visual matching. To probe this distinction, we introduce CulturalMenuBench, a benchmark of 4,870 items in 10 languages across 18 regions; its 10 tasks pair final‑dish and step‑by‑step cooking images with ingredients, procedural text, and regional labels, spanning basic recognition to process‑grounded cultural attribution. Evaluating 12 models exposes a substantial knowledge‑application gap: models exceeding 94% on standard multiple‑choice tasks drop to at most 56% when attributing dishes to Chinese regional cuisines, despite an identical four‑way format. Diagnostic analyses explain why: error patterns are consistent with random guessing, accuracy tracks visual distinctiveness rather than cultural structure, and models classify cuisines more accurately from dish names alone than from images (+7‑18 points). The knowledge is thus present but cannot be activated through visual input. An ablation confirms these tasks genuinely require procedural evidence: removing sequential cooking images selectively degrades process‑grounded tasks while others remain stable. Overall, CulturalMenuBench shows that near‑perfect recognition can conceal an inability to apply cultural knowledge, motivating training that explicitly connects perception, procedure, and cultural context. Code and data are publicly available.
Authors:Shuning Zhang, Liang Li, Yunheng Wang, Tao Wang, Yihang Kang, Renjing Xu
Abstract:
Air‑ground collaborative Vision‑and‑Language Navigation (VLN) pairs an unmanned aerial vehicle (UAV) with a global bird's‑eye view and an unmanned ground vehicle (UGV) with a local first‑person view, yet the setting remains largely unexplored: existing training‑free methods solve single‑agent tasks but offer no collaboration mechanism, and a recent CARLA‑Air evaluation found no stable cooperative behavior across five state‑of‑the‑art VLA models; naive semantic communication or bidirectional coupling even degrades performance. We establish AGC‑VLN (Air‑Ground Collaborative VLN), the first training‑free baseline for air‑ground collaborative VLN. The key insight is that training‑free methods decompose navigation into VLM‑based semantic reasoning and deterministic geometric execution, exposing a collaboration interface: the UAV's global view, over which it renders the UGV's reported pose and the VLM‑anchored target as CAR/GOAL markers with distance labels, yielding a shared bird's‑eye map. From this map, the UGV acquires global spatial context its first‑person view cannot provide, plans a road‑following path with a frozen VLM, and executes it under closed‑loop control; in parallel, the UAV runs 3D‑SPF, a spatial‑search upgrade of SPF that localizes the target in the downward view and flies toward it. On 100 closed‑loop episodes in CARLA‑Air's Town10HD scene, AGC‑VLN reaches a 77.0% joint success rate, a collaboration gain of +27.0% over the weaker individual agent (the UAV, 50.0%), and exceeds the strongest published single‑agent baseline (Travel UAV, 53.0%) by 24.0 points, stemming from the complementarity of the UAV's global view and the UGV's road‑following execution. Project page: https://github.com/ZSN2024/AGC‑VLN.
Authors:Ján Pastorek
Abstract:
We report on our ongoing project to develop a computational pipeline, AutoGraphForge, for an automated graph‑theoretic conjecturing‑refuting‑formalizing‑proving system. Conjecture generation is counterexample‑guided and runs in rounds: a Graffiti3 generator proposes conjectures over a small, evolving snapshot table T (initially a few hundred graphs with their computed invariants) that grows only by counterexamples to its own conjectures. A novelty filter of 559 classical and folklore relations, closed under transitive composition and linear identity substitution, decides via a linear program whether a candidate is already implied by known results. Surviving candidates are tested against a dataset of about 348,000 graphs, unioning the complete House of Graphs invariant export, the exhaustive census of all connected graphs on at most nine vertices, several extremal families (strongly regular, minimal Ramsey, Cayley, cages, barbells, lollipops, spiders), and random models. Counterexample‑search algorithms then attack the remainder. Run for several rounds on an HPC cluster, the loop yields 6,522 conjectures that survived the refutation dataset, the novelty filter and every active‑search run ‑‑ among them nontrivial relations between the annihilation number and the edge‑cover number for bipartite and regular graphs, which we prove by hand. A subsequent formalization and proving stage deterministically translates each surviving conjecture into a Lean 4 statement skeleton; every candidate proof is kernel‑verified against a pinned mathlib4 and our custom invariant preamble. This stage integrates two neural provers ‑‑ DeepSeek‑Prover‑V2‑671B (served with vLLM) and the Lean‑specialised OProver‑32B ‑‑ behind the independent kernel check. It is implemented end‑to‑end and passes initial sanity checks, with the full pipeline currently running on the cluster.
Authors:Yigit Utku Bulut
Abstract:
Reasoning traces of large language models are widely read as containing "breakthrough" moments and early‑legible fates. Both readings rest on measurements missing a counterfactual control at the level of the claim; we supply both controls. First, a restart‑controlled truncation probe separates when a solution fits the continuation budget from when a prefix carries value that fresh computation cannot buy, comparing per‑anchor continuation solve rates against from‑scratch restart curves at matched total generated‑token budget. Applied to 178 problem‑model cells (89 MATH problems x two small open models, an outcome‑blind but difficulty‑targeted cohort), exactly 1 of 178 cells survives as prefix‑limited; restart dose‑response separates a compute‑starved model from a capability‑limited one; and wherever the matched budget lies inside the restart grid, continuing the model's own prefix beats restarting (9 of 9) ‑‑ predominantly compute compression rather than expanded reachability. Second, a pre‑registered, difficulty‑controlled test finds no detectable outcome information in early‑window internal signals beyond a problem‑difficulty baseline, and two generation‑free analyses of public corpora show why this control is needed: a trace‑blind difficulty proxy reaches AUROC 0.873 on 192K DeepSeek‑R1 generations ‑‑ inside the published probe range ‑‑ and a closely matched reconstruction of the closest published early‑window positive recovers a comparable pooled result (0.849) while within problem it is statistically indistinguishable from chance at all ten anchors (0.496 at t=4); a post‑hoc within‑targeted probe finds only a small average residual, concentrated in three low‑failure problems. High pooled probe AUROCs cannot by themselves establish within‑attempt information; a question‑only baseline or within‑problem evaluation is required.
Authors:Xiangyu Wang, Jin Wu, Xiaoyu Li, Chanjin Zheng, Yifeng Zhou
Abstract:
Automated evaluation of creativity tasks remains challenging for LLM‑as‑a‑Judge, as LLM is susceptible to biases such as verbosity bias and leniency bias. Such limitations are particularly evident in Contextually‑Grounded and Procedurally‑Structured Tasks (CGPST), a complex multi‑step creativity task where inter‑step dependencies, highly subjectivity, and wide scoring ranges lead to more unstable and biased judgments. Existing approaches either rely on task‑specific training or directly apply LLM‑as‑a‑Judge, both of which struggle to ensure reliable evaluation under such complexity. To bridge these gaps, we propose CreaEval, an automated creativity evaluator for CGPST that decouples typical LLM‑as‑a‑Judge into analysis and judging. Correspondingly, CreaEval involves two critical phases: Memory‑augmented Analysis, a SoT‑LLM converts multi‑step responses into structured evaluation evidence, incorporating cross‑step memory; and Evidence‑based Judging, a Judge‑LLM uses the extracted evidence for judging without accessing raw responses. Comprehensive experiments show that CreaEval achieves an average performance improvement of 22.74% over the second‑best baselines across CGPST and two classic simple creativity tasks, demonstrating its generalizability. The code is available at https://github.com/Jaong/CreaEval.
Authors:Heng Wang, Jielin Qiu, Wenting Zhao, Cheng Qian, Liangwei Yang, Jiawei Han, Heng Ji, Silvio Savarese, Shelby Heinecke, Huan Wang
Abstract:
Large language models achieve superior performance on tasks that require extended reasoning, but long chains of thought make the KV cache a severe memory bottleneck. Existing KV cache compression methods share one paradigm: score each cached token by some estimate of how much it will matter later, and keep the top‑scoring ones. We show that the selection signal contributes almost nothing. Random Attention keeps the prompt and evicts uniformly at random within each attention head, computing no score at all; across four models and six reasoning tasks it matches the strongest prior evictor while serving 32‑43% higher throughput than it in vLLM deployment. Controlled experiments explain this by showing that 1) the prompt is the fragile part of the cache, and most of the gap between selectors is just whether their selection signal happened to keep it; 2) the reasoning trace protects itself against eviction with redundancy at two levels, in the text (the model restates what it still needs as it works) and across attention heads (each keeps its own copy of the trace), so once the prompt is safe, a random draw retains enough copies of what the model still needs, and no score is required to pick them. Our code is publicly available at https://github.com/SalesforceAIResearch/Random‑Attention.
Authors:Divyesh Bommana, Mohammad Saim, Tianyu Jiang
Abstract:
Emotion recognition benchmarks often predict one emotion per text, missing many real‑world scenarios where two people arrive at opposing emotions from a single shared event. For example, a child kicks the seat in front of her in excitement while the passenger ahead grows angry. We introduce CHIARO, a 1,000 human‑annotated sentence benchmark for contrastive emotion inference grounded in appraisal theory. Each scene describes one causal trigger eliciting a positive emotion in one person and a negative emotion in the other, drawn from a ten‑class taxonomy. We benchmark seven frontier LLMs and four off‑the‑shelf emotion classifiers. The strongest LLM reaches 67.3 macro‑F1, well below human agreement, while existing emotion classifiers score near chance. Beyond evaluation, CHIARO also serves as a training signal. When combined with an existing emotion corpus, the resulting downstream classifier improves on CHIARO itself and on six of ten external emotion benchmarks, which positions our dataset as a complementary signal for emotion recognition.
Authors:Ming Hu, Jianfu Yin, Mingyu Dou, Miaomiao Zhang, Yao Wang, Cong Hu, Bingliang Hu, Quan Wang
Abstract:
In‑Context Segmentation (ICS) aims to precisely segment arbitrary semantic concepts, such as objects or parts, given one or a few annotated visual exemplars. In this paper, we revisit ICS from a more classical segmentation perspective, viewing it as a coarse‑to‑fine progressive refinement process. Rather than directly predicting the final mask through reference‑query matching, we progressively refine the segmentation from coarse and ambiguous foreground responses to precise and complete foreground structures. Building upon this perspective, we propose a training‑free in‑context segmentation framework, termed FoRIS. Specifically, FoRIS consists of three key stages: Foreground Purification, Foreground Localization, and Foreground Consolidation, which progressively suppress background distractions, localize discriminative target regions, and recover complete foreground structures through semantic aggregation. Experimental results demonstrate that FoRIS achieves SOTA performance across semantic and part segmentation tasks, with average improvements of 4.5 and 4.8 mIoU points over existing approaches in the 1‑shot and 5‑shot settings, respectively. Code: https://github.com/Xi‑Mu‑Yu/FoRIS.
Authors:Chihiro Yano, Ryohei Sasano
Abstract:
In frame semantics, sentence comprehension is assumed to proceed by relating lexical meaning to background knowledge called semantic frames, thereby enabling readers to implicitly enrich the text with unstated information. Recent large language models (LLMs) have achieved strong performance across a wide range of downstream tasks. However, it remains unclear whether they can reproduce the kinds of implicit enrichment that humans naturally make during comprehension. To address this question, we introduce FrameBench, a benchmark grounded in frame semantics. FrameBench consists of multiple‑choice questions that test whether models distinguish the frames evoked by the same verb across contexts. We construct the benchmark for English and Japanese using FrameNet‑style resources and a generation‑and‑verification pipeline with native‑speaker judgments. Our experiments on a diverse set of models reveal challenges for small models, while several large models surpass the human reference scores. We release the constructed FrameBench dataset and the code for dataset construction and evaluation at https://github.com/SasanoLab/FrameBench.
Authors:Longfeng Wu, Tong Zeng, Giovanni Seni, Zhimin Peng, Bhanu Pratap Singh Rawat, Si Zhang, Yao Zhou, Lecheng Zheng, Bo Ji, Yujun Yan, Dawei Zhou
Abstract:
Sequential recommender systems model user behavior as item ID sequences, while recent generative methods cast recommendation as a language modeling task using large language models (LLMs). While this paradigm incorporates rich textual semantics, it introduces a fundamental mismatch: LLMs operate on text tokens, whereas recommender systems depend on discrete item indices. This misalignment often leads to hallucinations in generative recommendations. Existing methods attempt to bridge this gap by learning item vocabularies in Euclidean space, but they struggle to model the inherent long‑tail distribution of real‑world catalogs, where a small number of head items dominate, and a vast number of tail items reflect users' niche preferences. To address this issue, we introduce Hyperbolic Residual‑Quantized Variational AutoEncoder (HypRQ‑VAE), the first framework to learn item indexing in hyperbolic space. HypRQ‑VAE leverages the unique properties of hyperbolic geometry, whose exponential volume expansion naturally accommodates the power law structure of user‑item interactions. This allows the model to encode rich textual semantics while preserving the representational fidelity of sparse, long‑tail items. Experiments on three benchmark datasets show that HypRQ‑VAE significantly improves the performance of recommendation, particularly in recommending tail items. Our analysis attributes these gains to the superior capacity of hyperbolic space to model item hierarchies and sparsity in generative recommendation. Our code and data are available at: https://github.com/wulongfeng/HypRQ‑VAE.
Authors:Zikai Zhou, Yufei Jin, Yilin Xu, Yu-Chiang Wang, Chieh-Ju Chao, Monica S. Lam
Abstract:
Accountability means a decision can be examined, justified, and contested. LLMs make this hard: fluent output may be ungrounded, incomplete, or unfaithful to the decision process. Achieving accountability requires verified rationales (how was the decision reached), assumptions (what was assumed rather than known), policy consistency (the same treatment for the same facts), and pivotal conditions (what would change the outcome). We introduce self‑faithfulness as an automatic test of accountability: changing the pivotal conditions should change the decision. We examine accountable AI through clinical trial matching, a high‑stakes task central to evidence‑based medicine. Although LLM‑based matchers match patients to trials reasonably accurately, they apply decision policies inconsistently and produce rationales that are unfaithful to their own decisions. We introduce VERDICT, an LLM‑based agent that translates a decision task, its constraints, and its policy into Satisfiability Modulo Theories (SMT), then derives the decision with SMT and MaxSMT solvers ‑‑ so policies are applied consistently and decisions are accountable by construction. Across a SIGIR 2016‑derived dataset and TREC 2021, VERDICT achieves the strongest decision accuracy among LLM‑only and neurosymbolic baselines, applies policies with perfect consistency, and produces clinician‑preferred rationales grounded in explicit assumptions and pivotal conditions, with improved counterfactual self‑faithfulness.
Authors:Roman Mykhailyshyn, Domae Yukiyasu, Harada Kensuke
Abstract:
Grasping and holding tools while using them presents a considerable challenge not only for robots but also for humans. Such a challenge is particularly noticeable in processes involving assembly and disassembly, where efficiency and consistency depend on performing rapidly adaptive tasks. Nonetheless, contemporary robotic grasping technologies that can securely manipulate tools during operation frequently have significant constraints. In this paper, introduce ARTiS (Adaptive Robotic Tool Gripper in Disassembly Systems), a novel gripper that combines the adaptability of soft grippers, the dexterity of anthropomorphic hands, and the robustness of rigid mechanisms with a soft palm and fingertips. This unique combination makes it possible to hold tools securely in a variety of situations through using active jamming in the palm and fin‑ray adaptation in fingertips. Furthermore, high finger dexterity is achieved through the seven degrees of freedom design, which enables the fingertips to orient to any surface, both for automated solutions and collaborative tasks. A comprehensive evaluation was conducted using a range of conventional disassembly tools to assess the gripper's compliance, durability, and functional versatility. More information, hardware instructions, and videos at https://romanmykhailyshyn.github.io/artis/
Authors:Hao Mao, Xu Tony Liu, Shuai Lu, Peng Zhao, Wenzheng Jiang, Yuntian Chen
Abstract:
Constant optimization refines the numerical coefficients of candidate expressions in tree‑based genetic programming for symbolic regression. But its per‑generation cost has led modern GPU‑accelerated frameworks to omit it or restrict it to lightweight forms. We present a GPU‑resident, batched Levenberg‑‑Marquardt solver that optimizes constants across a structurally heterogeneous population of expression trees using a fixed number of population‑wide CUDA launches per iteration. Reverse‑mode automatic differentiation assembles the per‑tree Jacobian in one backward sweep, making the dominant per‑iteration cost independent of the number of constants per tree, and a double‑precision delivery guard guarantees that returned constants are never worse than their initial values. On early‑generation populations, the solver sustains up to 5.1×10^5 trees per second on an NVIDIA A100; at a GPU‑saturated benchmark configuration it delivers roughly 9.9× the throughput of Operon running on a 64‑core EPYC 7763, while matching fp64‑reference quality. Integrated in‑process into EvoGP, the solver enables end‑to‑end search to recover governing equations on 10 of 18 constructed problems versus 0 for stock EvoGP. Our code is at https://github.com/TensorConv/CuSR.
Authors:Erik Arakelyan, Khatun Avetisyan, Meri Davtyan, Heghine Grigoryan, Nane Khachatryan, Hayk Shahsuvaryan, Henrik Sergoyan, Vahan Martirosyan
Abstract:
Pretraining data for Armenian, a morphologically rich and low‑resource language, is scarce, and no open Armenian LLM has been released with the data and recipe needed to reproduce it. To address this gap, we curate and release two datasets. ArmWeb is an extensively validated corpus of 4.37M Armenian news documents. ArmSTEM is a parallel English‑Armenian collection of 373K math and science problems with step‑by‑step solutions, translated into Armenian and verified through both answer‑preserving LLM judgment and human evaluation. Continued pretraining of Gemma‑4‑E4B on these datasets yields arm‑gemma‑e4b, which outperforms every existing open Armenian model as well as its unadapted base, and is the first open Armenian LLM with complete training data and recipe. Our ablations show that news‑only continued pretraining improves fluency while eroding knowledge, a pattern we also observe in existing Armenian models, and that a small share of verified translated STEM data reverses the loss. We further find that the largest public Armenian corpora overlap web‑derived evaluation panels heavily, including a train/test self‑overlap inside FineWeb‑2. We openly release all data, models, and code.
Authors:Yanshu Zhang, Shichong Peng, Mehran Aghabozorgi, Alireza Moazeni, Ke Li
Abstract:
Advances in neural rendering have enabled high‑fidelity multi‑view reconstruction of 3D scenes. However, free‑form non‑rigid shape editing remains a significant challenge. Point‑based neural representations are highly desirable for multi‑view reconstruction because they lack fixed connectivity, which does not constrain the learned surface topology to that of the initialization. Yet this same property causes point‑based representations to struggle with holes and surface discontinuities under large deformations. To address this, we propose a novel self‑supervised method to enable point‑based representations to adapt to large deformations without requiring ground truth multi‑view images of deformed geometry. The key idea is to generate random deformations and to ensure consistency in the predicted surface before and after deformation. In particular, the surface prediction from the deformed point cloud should be the same as the deformation applied to the surface prediction from the original point cloud. We incorporate our approach into attention‑based point representations, which differ from splatting‑based point representations in their use of a learned interpolation kernel between points as opposed to a Gaussian kernel around each point. This learned interpolation kernel can learn to adapt to large deformations, without requiring addition or removal of points. We show that our framework significantly enhances its robustness to large deformations. Experiments on synthetic geometry editing benchmarks (Neural Editor, Objaverse) demonstrate that our approach outperforms existing point‑based methods in zero‑shot editing and significantly reduces artifacts. Furthermore, qualitative results on the DTU and Mip‑NeRF 360 datasets demonstrate our method's effectiveness on real‑world scenes.
Authors:Leqi Zheng, Jinbo Su, Fang Niu, Chaokun Wang, Weiping Wang, Jiajun Zhang, Shannan Yan, Jie Wu, Zhaolu Kang, Rong Fu, Hang Zhang
Abstract:
Reinforcement learning from verifiable rewards (RLVR) drives chain‑of‑thought reasoning in large language models, yet its binary outcome reward cannot distinguish among correct trajectories. Existing dense reward alternatives, from surface heuristics to process reward models, either ignore the expert solutions already present in training corpora or require expensive offline annotation. We propose Gradient‑Aligned Reward (GAR), which operates in the policy's own gradient space: truncated backpropagation through the output projection layer extracts a compact gradient vector for each rollout, and cosine similarity with an expert‑anchor gradient yields a dense, reasoning‑aware reward with less than 9% wall‑clock overhead. We prove that this cosine admits a multiplicative decomposition into prediction‑error and activation‑pattern factors, providing a concrete characterization of what the alignment signal measures. On Qwen3‑4B and Qwen3‑8B, GAR consistently improves over GRPO and other baselines on competition‑level math benchmarks and transfers to GPQA Diamond and MMLU‑Pro without domain‑specific data. Code and data are available at https://github.com/LQgdwind/GAR.
Authors:Yanshu Zhang, George Shramko, Pratul P. Srinivasan, Ke Li
Abstract:
We present PointGT, a point‑based 3D representation that enables simultaneous editing of object geometry and appearance. Existing reconstruction and view synthesis techniques produce volumetric 3D representations that are high‑quality and photorealistic, but are difficult to edit. In particular, recent efforts to enable texture editing for 3D Gaussian Splatting representations are not compatible with geometry edits and deformations. Our method combines a point‑based representation that is well‑suited for geometry deformations with a learned UV mapping technique that enables high‑resolution texture editing. We show that PointGT enables fine‑grained editing of both geometry and texture in point‑based neural representations with high rendering quality.
Authors:Leqi Zheng, Jinbo Su, Yuying Li, Chaokun Wang, Weiping Wang, Haitao Li, Jiajun Zhang, Shannan Yan, Zhaolu Kang, Rong Fu, Jie Wu, Fang Niu, Hang Zhang
Abstract:
Scientific literature synthesis agents increasingly rely on proprietary online services, limiting reproducibility, privacy, and offline deployment. To address this challenge, we introduce SciLENS Scientific Localized Evidence Navigation and Synthesis), a fully local autonomous agent framework operating on a dual‑tier infrastructure indexing approximately 12 million academic records. SciLENS pioneers the integration of structural visualization as an actionable tool within the reasoning loop, enabling the agent to compress complex citation topologies into validated data‑driven charts and thereby mitigate context exhaustion during macro‑level synthesis. To train the agent without human annotation, we develop an automated data synthesis pipeline that extracts multi‑hop subgraphs from a citation knowledge graph, verified by cross‑model consensus among 20 frontier models. The agent is subsequently aligned through a reverse‑decomposition rubric strategy that provides fine‑grained process rewards for early planning and strict evidence grounding. Evaluations across six scientific benchmarks encompassing standard QA, citation accuracy, factual reasoning, and structural synthesis demonstrate that SciLENS significantly outperforms open‑source baselines and achieves performance comparable to GPT‑5.2 and Gemini‑3.0‑pro. Our source code and data are released at https://github.com/LQgdwind/SciLENS.
Authors:Yixiong Yang, Sisheng Zhang, Qingsong Yan, Shaohuai Shi, Qiang Wang
Abstract:
A key bottleneck in 3D Gaussian Splatting training is the continual growth of Gaussian primitives, which increases optimization cost and slows convergence, especially at high resolutions. We propose Laplacian Frequency Hierarchies, a simple yet efficient 3DGS scheme that combines Laplacian image decomposition with coarse‑to‑fine, frequency‑staged training. After fitting lower‑frequency structure, we archive the corresponding Gaussian field so that subsequent fields can optimize higher‑frequency residuals without carrying the full primitive burden, and we compose the rendered components in the image domain via a Laplacian‑style reconstruction at inference time. This design reduces the number of active Gaussians during training, thereby lowering optimization overhead and accelerating training. The proposed scheme is plug‑and‑play and orthogonal to prior 3DGS accelerations: it can be directly combined with strong backbones such as Taming‑3DGS and FastGS to improve training speed with competitive reconstruction quality. It achieves average speedups of 1.73x and 1.21x at 1K setting, and 1.74x and 1.33x at 4K setting on Taming‑3DGS and FastGS, with larger gains on more challenging scenes and increasingly pronounced benefits at higher resolutions.
Authors:Jiayuan Ma, Yuqi Lu, Weiyang Guo, Chenrui Wang, Junyi Shu, Xuebo Liu, Min Zhang, Jing Li
Abstract:
Vision‑language models (VLMs) are increasingly deployed in multi‑turn settings where users may describe visual content with incorrect assumptions. Yet existing evaluations rarely isolate how models respond when the same visually grounded false premise persists across dialogue turns. We introduce FPCO‑Dialog, a benchmark for evaluating correction and cooperation behavior in VLMs under repeated false premises. FPCO‑Dialog contains 1,080 images and 10,800 question turns, stratified by visual complexity, object category, and false‑premise class, and uses a 10‑turn protocol in which a correct dialogue prefix is followed by repeated false‑premise referring expressions. We evaluate 20 commercial and open‑source VLMs with a model‑agnostic protocol and CorrTP@K, a correction‑rate metric over false‑premise turns, scored by two independent detectors. FPCO‑Dialog reveals substantial and persistent cross‑model differences in aggregate correction tendency, model‑specific turn‑wise dynamics, and systematic variation across false‑premise types under the benchmark's substitution distribution. The dataset, evaluation protocol, model outputs, detector labels, and code are available.
Authors:Yihang Li, Chenhui Chu
Abstract:
The Neural Finite State Machine (NFSM) framework offers a pragmatic path to full‑duplex dialogue by serializing turn‑taking control and response generation onto a single causal tape under the standard next‑token prediction objective, thereby preserving semantic prowess at a low fine‑tuning cost. However, its reliance on synthetic text data fundamentally limits turn‑taking naturalness, as Large Language Models (LLMs) cannot faithfully simulate the fine‑grained acoustic temporal dynamics of real human dialogues. In this work, we propose a decoupled data approach that learns turn‑taking from real Human‑Human (HH) spoken dialogues while shaping semantic behavior through configurable Human‑Agent (HA) text dialogues. To operationalize this approach, we introduce a rule‑based event‑guided data transformation method that serializes HH spoken dialogues into FSM tapes by classifying turn‑taking events and applying deterministic mapping rules, enabling scalable supervision without LLM‑generated annotations. We further propose a Source‑Aware Calibrated (SAC) Loss that jointly calibrates the long‑tailed distribution of state transition tokens and channels each data source toward the capability it best supervises. Experiments show that our approach substantially improves turn‑taking proficiency while recovering the foundation LLM's semantic capability. Our code and model are available at https://github.com/Liyht/def‑fsm.
Authors:Chumeng Jiang, Jiayin Wang, Xinjie Lin, Zhiqiang Guo, Hengliang Luo, Min Zhang
Abstract:
Large Language Models (LLMs) have recently emerged as powerful backbones for recommendation. To better elicit their capabilities, reasoning has been widely incorporated to help LLMs interpret rich textual signals and improve recommendation accuracy. However, explicitly generating intermediate reasoning traces often incurs substantial computational costs, which limits practical deployment in real‑world recommender systems. To address this challenge, we propose SelfDR, a Self‑Distillation from Reasoning framework for LLM‑based Recommendation. SelfDR distills an LLM's own reasoning‑enhanced predictions to produce recommendations directly, improving recommendation effectiveness while maintaining inference efficiency. All components in the framework are built on the same base LLM, without relying on any external models. Specifically, the teacher recommender is constructed by training a reasoner with downstream performance as the reward, enabling it to generate targeted rationales that are later incorporated into the teacher's input. A student recommender for direct recommendation, with the same underlying model, then learns from the teacher through self‑distillation with a dynamic weighting strategy. Extensive experiments on three public datasets validate the effectiveness, rationality, and efficiency of SelfDR. Codes are available at https://github.com/JiangDeccc/SelfDistillation.
Authors:Yoojin Kim, Jihyoung Jang, Hyounghun Kim
Abstract:
Personalized assistants should not only comply with user requests but also assess whether those requests are appropriate given the user's current circumstances. However, prior work has primarily focused on accurately executing requests, overlooking the need for assistants to account for context and engage in conflict‑based refusal. Furthermore, while existing work on conflict or safety detection relies on explicitly provided factors, real‑world scenarios often involve implicit factors that must be retrieved from a knowledge base (KB). To this end, we introduce Personalized Assistants for Conflict Evaluation (PACE), a dataset for evaluating whether models can identify latent constraints, expressed as egocentric knowledge or events, that render seemingly reasonable user requests inappropriate. PACE pairs user requests grounded in well‑defined personas with egocentric KB facts, requiring models to integrate contextual evidence to determine whether a request is conflicting. This implicit retrieval setting hinders the direct association between user requests and conflict‑inducing knowledge, making it difficult for existing models to identify relevant user‑specific facts. To address this challenge, we further propose PaceMaker, a multi‑agent framework in which specialized agents coordinate across query reformulation, multi‑hop graph traversal, and conflict‑aware filtering to retrieve contextually decisive evidence. Experiments on PACE evaluate both evidence retrieval quality and conflict decision accuracy, showing that PaceMaker consistently outperforms existing approaches.
Authors:Daisuke Kikuta
Abstract:
Large Language Models (LLMs) often help users generate artifacts through iterative cycles of generation and revision in conversation. A challenge here is that, when users specify only a local change during revision, LLMs must instead identify the relevant dependencies and propagate the revision to all affected parts of the artifact. This paper studies this ability of LLMs on conversationally generated artifacts, where the artifact context and its dependencies may be embedded in the conversation history. Toward practical use, we also explore cost‑effective test‑time compute for this new setting. Specifically, we introduce a new benchmark for this setting, and evaluate nine revision methods, including sequential reflection and parallel sampling variants, using gpt‑oss‑20b/120b, gpt‑5.4‑mini, and qwen3.5‑9b/27b/122b on the benchmark. The results show that baselines achieve accuracies of 68.3‑‑93%, and the most cost‑effective method is selecting from three parallel samples using either LLM‑based or medoid selection, which improves accuracy by 2.2‑‑9.7%. Our code and dataset are available at https://github.com/ntt‑dkiku/llm‑revision‑propagation.
Authors:Zeyu Liu, Souvik Kundu, Peter A. Beerel
Abstract:
Tool‑using LLM agents spend wall‑clock time not only on model inference but also in serial action‑‑observation turns, where each tool call, environment transition, and observation can delay subsequent decisions. We introduce Speculative Macro Commit (SMC), a runtime mechanism for a two‑tier agent system: a large authoritative actor model produces the official trajectory, while a faster speculative drafter model continuously predicts and executes future action chains on an isolated environment snapshot. SMC mines recurring multi‑action skeletons from training traces and stores them in a macro library used to match against action chains predicted by the drafter at runtime. When the actor's next tool call matches the first drafted action, SMC commits the remaining pre‑executed draft steps, together with their observations, to the official trajectory. Using Qwen3.5‑27B INT4 as the authoritative actor model and Qwen3.5‑4B as the speculative drafter model, SMC matches the sequential agent's overall accuracy while reducing latency by 10.23% over the Speculative Actions (SA) baseline and 18.59% over sequential execution on the τ^2‑Bench Telecom subset. On AppWorld, SMC reduces wall time by 7.7% over SA baseline and 44.9% over sequential execution, with a small reduction in task completion. Overall, SMC provides a practical way to reuse multi‑step speculative execution and reduce agent latency beyond single‑step speculative actions. Our code is publicly available \hrefhttps://github.com/zeyuliu1037/speculative‑macro‑commit\textcolormagentahere.
Authors:Fagner Cunha, Juan G. Colonna, Eulanda M. dos Santos
Abstract:
Camera traps have become an essential tool for wildlife monitoring, motivating the development of computer vision methods for the automated extraction of information from these data. While most prior work has focused on species identification, many ecological applications also require estimating the number of unique individuals appearing across short image sequences. This task is particularly challenging because camera traps typically acquire bursts of images at approximately one frame per second, creating large temporal discontinuities that may make conventional multi‑object tracking methods unreliable, and because manually collecting individual count annotations is prohibitively expensive. In this work, we describe the winning solution to the iWildCam 2021 Challenge, which introduced a benchmark for counting animals at the sequence level under realistic annotation constraints where count annotations are unavailable for training. Our approach, MaxBoxCount, combines a strong species classification pipeline with a simple yet effective counting heuristic based on MegaDetector detections to estimate the number of unique individuals without requiring count annotations. Code is available at https://github.com/alcunha/iwildcam2021ufam.
Authors:Rohith Reddy Bellibaltu, Manpreet Singh, Deepak Parashar, Rahul Joshi
Abstract:
Counterfactual audits are the standard tool for checking whether a clinical agent treats demographically distinct but clinically identical patients differently. They report a flip rate: how often an action changes when only the patient descriptor changes. We show that this quantity is uninterpretable on its own. Re‑running an identical condition ten times over sixteen vignettes (same narrative, same descriptor string, nothing varied) moved a clinical agent's action in 8.7% of outcome‑vignette cells, and instability was heterogeneous across actions by a factor of eight, from 0.022 for ICU escalation to 0.179 for controlled‑substance caution. No demographic contrast in our data was distinguishable from that floor. A second model gives a pooled floor of 6.7% and ranks the six actions almost identically (Spearman 0.94, exact p=0.017), so the floor is not one system's artefact. Majority‑vote aggregation over five draws removes 39% of it and then flattens, and a null simulation attributes the residue to heterogeneous per‑cell rates, so replication mitigates without eliminating. Any counterfactual fairness estimate reported without a per‑action floor beside it therefore cannot be read as evidence of disparity. The measurements were taken with FairMedAgent, an evaluation harness for disparity in the actions of clinical LLM agents whose estimand, the within‑range counterfactual flip rate, counts only flips between actions a published decision rule admits and a clinician has adjudicated. That estimand requires band adjudication, which is under way; no disparity result is claimed here. Each synthetic vignette runs a six‑stage trajectory (five model‑facing decisions around a deterministic environment step) under fixed‑form conditions spanning race, sex, age, insurance, English proficiency, and their intersections. The harness, the floor protocol, and every analysis script are released.
Authors:Ali Hojjat, Janek Haberer, Olaf Landsiedel
Abstract:
Vision Transformers (ViTs) typically process every image using a fixed input resolution and model width, even though many images can be classified with substantially less computation. We introduce ProgResViT, an input‑adaptive ViT that performs inference progressively across multiple rounds. The first round processes a low‑resolution image with a narrow subnetwork. Inference terminates when the prediction is sufficiently confident; otherwise, the model reuses the representations produced in the current round and proceeds with a higher‑resolution input and a wider subnetwork to refine its prediction. As all rounds share a single backbone, we propose Progress‑Conditioned Soft Gating (PSG), which conditions token fusion and layer outputs on the current round, block, and input resolution. On image classification, applying ProgResViT to DeiT yields better accuracy‑compute trade‑offs than adaptive‑width, adaptive‑depth, and dynamic‑token baselines. With knowledge distillation, a DeiT‑based ProgResViT achieves 84.9% top‑1 accuracy, slightly exceeding the reported DeiT‑III‑S accuracy under a comparable evaluation setting. We show that the same design also provides favorable accuracy‑compute trade‑offs for self‑supervised DINO representations and downstream semantic segmentation. Code is available at https://github.com/ds‑kiel/ProgResViT.
Authors:Falko Helm, Iryna Gurevych
Abstract:
Using a zoom‑in tool is an important foundational part of modern visual agents, because it allows to efficiently handle tasks involving high‑resolution images. Most previous methods need an extensive warm‑start supervised fine‑tuning phase for teaching models zoom‑in. We show that this is not necessary by proposing a new intrinsic reward for learning tool use in MLLMs without the need for additional labels or warm‑start SFT. Our InfoNCE‑style reward uses a curriculum of increasingly hard negative tool calls as a contrastive training signal. Empirical experiments on V^, HRBench and MME‑RealWorld show that our approach is competitive while being more efficient. When used as a drop‑in replacement for SFT, we even outperform all baselines. To directly measure the zoom‑in ability of models, we further introduce the scalable synthetic Muffin&Chihuahua (M&C) dataset. Each image consists of a grid with every cell either showing a muffin or chihuahua. Leveraging the M&C dataset's unique region of interest labels, we find that recall is the metric that most strongly correlates the zoom‑in region with final task performance. Our model and code for reproduction is publicly available under https://github.com/UKPLab/emnlp2026‑zoom‑in
Authors:Haozhen Zheng, Fulin Wang, Tianhu Xiong, Yingjie Yu, Shengyi Qian, Hanchao Yu, Alex Schwing, Klara Nahrstedt, Mingyuan Wu
Abstract:
Current AI agents compellingly describe slides. However, AI‑assisted slide editing requires more than understanding: the output must retain layout, style, component structure, and native editability. Towards, AI‑assisted slide editing, existing agents operate on screenshots or weak document representations and often fragment coherent visual units, rasterize editable content, or break layout. In contrast, for controllable slide editing, we introduce an agentic framework, SLIDEFORGE, which builds a Deck State Graph, an executable slide state that links visual decomposition, native pptx object structure, and perceptual organization. By recovering human‑referable components while retaining fine‑grained editable structure, SLIDEFORGE supports theme‑preserving reconstruction through slide‑native operations and rendered‑state verification. We further introduce an evaluation paradigm for controllable slide transformation that jointly measures component recovery, preservation, restyling consistency, visual quality, and native editability. Experiments show that SLIDEFORGE outperforms direct prompting, screenshot‑based agents, and generic code‑agent baselines across these dimensions. Code is available at https://github.com/UIUC‑MONET/SLIDEFORGE.
Authors:David Chernin, Ethan Fetaya
Abstract:
Recent advances in generative speech models have made it increasingly difficult to distinguish authentic from synthetic audio, enabling new forms of fraud and misinformation. Audio watermarking offers a promising defense by embedding an imperceptible signal into generated speech that can later be detected to verify its provenance. However, recent studies have shown that existing post‑hoc watermarking methods fail under neural codecs and denoisers, transformations routinely applied during real‑world storage, transmission, and processing, severely limiting their practical utility. Here we introduce CRAW, a codec‑robust audio watermarking framework that jointly improves robustness against neural re‑synthesis while maintaining high perceptual quality. CRAW combines distortion‑aware training with an attention‑based pooling mechanism, inference‑time perceptual mask‑ ing, and an error‑correcting code to recover the fidelity lost during robust training. Experiments demonstrate that CRAW achieves state‑of‑the‑art robustness against neural codecs, denoisers, and vocoders while maintaining perceptual quality comparable to existing post‑hoc watermarking methods. The code is available at https://github.com/DavidC1212/craw.
Authors:Young Seok Jeon, Beatrice Brown-Mulry, Rohan Satya Isaac, Anjana Dissanayaka, Theo Dapamede, Mohammadreza Chavoshi, Judy Gichoya, Hari Trivedi
Abstract:
There is growing interest in adopting CLIP‑style vision‑‑language model (VLM) pretraining for mammography. However, models that directly employ the standard CLIP architecture and training objective exhibit limited zero‑shot performance in clinically important tasks such as cancer, finding‑type, and BI‑RADS predictions. We argue that this underwhelming performance is due to neglecting two characteristics of mammography data: (1) its high‑res nature, and (2) homogeneity of radiology reports, largely driven by a predominance of negative/benign findings on examinations. We propose TopKSigLIP, a VLM designed to address these two limitations through a novel architecture and learning objectives. Instead of downscaling high‑res mammography images to satisfy GPU memory constraints, TopKSigLIP introduces TopK‑Patch module that learns to sample a sparse set of high‑res patches likely to contain lesions, sidestepping the resolution‑‑batch size tradeoff of VLM training. The sampled patch locations additionally serve as a built‑in localization tool. To address report homogeneity, we replace the contrastive loss, which falsely repels semantically similar pairs, with a Sup‑sigmoid loss. Sup‑sigmoid loss extends the sigmoid loss from SigLIP with soft labels derived from structured data. TopKSigLIP outperforms existing open‑source mammography and general medical VLMs on both internal and external benchmarks on density assessment, BI‑RADS classification, finding subtyping, and cancer prediction under zero‑shot evaluation. TopKSigLIP remains competitive under linear probing despite using a significantly smaller vision encoder and smaller training batches than baselines. The TopK‑Patch module additionally achieves superior lesion localization over post‑hoc Grad‑CAM. Code and weights are made public:https://github.com/Youngseok0001/TopKSigLIP.
Authors:Michal Průšek, Adam Novozámský, Filip Šroubek
Abstract:
Segmenting a new biomedical dataset usually means a domain‑specific model trained on substantial annotation, or a foundation model steered at inference time. We present Exemplar, a few‑shot segmenter that fuses a frozen DINOv3 backbone with a fixed bank of classical native‑resolution filter responses in one lightweight head, fitted from the support masks alone. In the few‑mask, native‑resolution regime, classical priors and frozen self‑supervised features are complementary: fused in one head, a single fixed configuration spans eleven biomedical imaging datasets. Under the same head, the classical bank alone reaches 0.693 on the eleven‑dataset panel, scored by foreground intersection‑over‑union or centreline Dice, and the frozen features alone 0.672; the bank leads on seven of the eleven and the features on the rest, and fused they reach 0.782. Against five forward‑pass few‑shot methods, Exemplar leads in 54 of 55 method‑dataset comparisons, 52 of them significant after Holm correction. From a single annotated mask it reaches 0.703 on the same panel, against 0.682 for a from‑scratch nnU‑Net trained on that same mask. At eight masks nnU‑Net overtakes it on the panel mean, chiefly on centreline agreement, but takes 16‑77x longer to fit.
Authors:Michael J. Bommarito
Abstract:
Libraries and archives manage large collections with limited staff and computing budgets, yet common benchmarks do not systematically test their bibliographic work. They need to know which methods work for their tasks and what those methods require to run. SHELF, the Synthetic Harness for Evaluating LLM Fitness, addresses this gap. It is a Python system that turns labelled taxonomies, writing specifications, and a generation budget into controlled benchmark data and evaluation tasks. This first release contains 62,899 model‑written documents based on Library of Congress vocabularies, with tasks for classification, clustering, retrieval, pair classification, and instruction retrieval. We compare TF, TF‑IDF, BM25, popular encoders, and, on subject classification only, zero‑shot decoders; each method appears only on tasks that support it. Subject classification reaches 0.8887, while genre‑form classification reaches only 0.2605, and several pair and clustering tasks remain near chance. Sparse methods remain competitive on classification, while TF‑IDF is the fastest measured arm in the subject timing experiment. SHELF also varies bibliographic facets independently and can generate new, verifiably unseen documents after a model's training cutoff. Comparisons with LCSHBench and Project Gutenberg show that model rankings transfer more reliably than absolute scores, but SHELF scores do not estimate accuracy on production catalogue data. We release all source code and data under permissive licenses on GitHub and Hugging Face.
Authors:Yury Korolev
Abstract:
Compliance screening of blockchain addresses is, in practice, a lookup against sanctions registries plus clustering heuristics; it fails on unlabelled addresses and on chains with no label coverage at all. We describe a deployed system that scores an address by its position in a multi‑chain transaction graph rather than by its presence in a list. The substrate is a single graph of 835,330,427 addresses and 15,826,261,934 edges across five EVM chains; a shared inductive encoder with per‑chain normalisation feeds two scoring heads. Decision thresholds are exact quantiles of the score distribution over the full population, scanned per chain segment, so the alert volume is known in advance. We report: label‑free transfer: heads trained on two chains recall 0.8598 / 0.8182 / 0.9967 of held‑out positives on Base, Arbitrum and Gnosis at a 10^‑3 population alert rate, with no target‑chain labels in head training; a static lead‑time replay over 68 external registry events: 40 of 68 (58.8%) flagged at the 0.1% budget, ×152 over an event‑level random‑flagging baseline, with first on‑chain appearance a median of 528.8 days (Ethereum) / 647.8 days (Tron) before public designation; a serving path whose score is bit‑identical to the offline artefact at end‑to‑end p50 151 ms, gated by a 2,882‑address drift panel; and an adversarial harness of eight recurrent reinforcement‑learned archetypes that passes an 8‑criterion degeneracy audit and, on a detector‑independent snapshot, exposes a measured blind spot of the deployed heads against synthesised behaviour.
Authors:Vijay Erramilli
Abstract:
Mechanistic interpretability is increasingly used to guide interventions such as activation steering, circuit removal, and safety monitoring. Yet an internal estimate that is accurate on average can still choose a poor action. We present ObserverBench, a benchmark framework for testing whether an internal estimator‑‑‑an observer‑‑‑is adequate for the intervention, control, or safety task it directs. Each task fixes the model, information boundary, allowed actions, decision rule, held‑out cases, and loss. The benchmark reports estimation accuracy separately from the loss caused by the chosen action. Theory and experiments show why both are needed. In closed‑loop control, observer errors matter at the starting point and along directions the allowed intervention can reach. On circuit‑intervention tasks in GPT‑2‑small and Qwen2.5‑7B, pairwise observers predict unseen effects more accurately without always choosing better actions; observers trained on action loss choose lower‑loss actions. In safety triage, a score that perfectly separates violations can allocate a fixed intervention budget poorly when violations have different costs. Across Qwen2.5‑7B, Gemma‑2‑9B‑it, and prospectively frozen Qwen3.5‑9B APPS tasks, AUROC can rank monitors differently from deployment loss, and the best information source changes across models. Sparse SAE readouts also trail their layer‑matched dense controls on the reported Qwen panels, under disclosed activation‑density or checkpoint mismatches. ObserverBench provides fixed task contracts, runnable baselines, and table‑based submissions for evaluating interpretability methods through the actions they enable.
Authors:Xiao Shi Huang, Chen-Yuan Lin, Bruce Kuwahara, Kin Kwan Leung, Jesse C. Cresswell
Abstract:
Many NLP tasks, such as summarization and extractive question answering, reduce to retrieving relevant content from documents under two constraints: coverage, retaining enough pertinent information to achieve some goal, and conciseness, removing as much irrelevant information as possible. Conformal prediction methods have been used to guarantee coverage, and must be optimized for conciseness through design of a score function. State‑of‑the‑art scoring functions use hand‑engineered LLM prompts asking the model to rate the importance of content, but manual prompt engineering is labor‑intensive and task‑specific. We introduce the Conformal Relevance framework which uses in‑context learning example curation and ensembling to create a score function which maintains coverage while improving conciseness with minimal manual input. We demonstrate this framework's application on seven NLP tasks, and also theoretically study the impact of diversity for ensembled conformal scores, giving a complementarity condition that characterizes when ensembling improves worst‑case sentence scores, and a saturation bound on ensemble improvement.
Authors:Christopher Stith, Hossein Rahmani, Jesse C. Cresswell
Abstract:
Causal inference is the practice of estimating the effect of a treatment or intervention from data. It traditionally requires a bespoke pipeline for every new problem: first proposing a causal mechanism, selecting a compatible estimator, and finally training it. Meanwhile, across diverse settings and modalities, much of machine learning has shifted to the paradigm of foundation models: networks pretrained once at scale and applied to new tasks without fine‑tuning. Causal foundation models (CFMs) bring this paradigm to causal inference. CFMs are pretrained neural networks that estimate causal quantities, such as the average treatment effect, on entirely new datasets using in‑context learning without requiring model updates. This work provides a practical introduction to this emerging area. We summarize the necessary background in causal inference and machine learning before discussing CFMs. Throughout, we include example code and Jupyter notebooks.
Authors:Edvin Ketabati Augustinsson, Robert A. Bridges
Abstract:
Gaussian‑process Bayesian optimization (GP‑BO) excels at black‑box optimization of costly functions, e.g., hyperparameter optimization (HPO) and multi‑agent system (MAS) design. Convergence‑rate guarantees exist for select methods, notably GP upper confidence bound (GP‑UCB), but require a fixed kernel. Critically, the kernel encodes how input proximity affects objective value similarity. When raw coordinates poorly match this geometry ‑ as with log‑scaled hyperparameters or localized peaks ‑ input warping can greatly improve sample efficiency, yet known GP‑UCB proofs require a fixed kernel. We propose Finite‑Library Input‑Warped Bayesian Optimization (FLIWBO), which selects warps from a finite library of smooth input maps by any history‑dependent rule. It adapts the input geometry to accelerate learning while retaining high‑probability convergence guarantees under mild hypotheses, with an explicit \sqrt(N_\varepsilon) library‑size cost. Controlled diagnostics show that finite‑library warping repairs planted geometry mismatches and identify FLIWBO failure cases. Across four repeated benchmarks ‑ warped synthetic objectives, a confidence‑fence trap, and Fashion‑MNIST HPO ‑ FLIWBO‑UCB beats raw‑coordinate GP‑UCB under misspecified geometry, escapes traps that defeat even oracle‑warp expected improvement, and recovers much of the gain from manual log scaling, while leading the tested methods that admit a matching regret guarantee. A 20‑dimensional MAS design study further shows feasibility under costly noisy evaluations. Code for experiments is available: https://github.com/edvin‑ketabati/bogp‑paper‑experiments.
Authors:Changjian Zhou, Negin Yousefpour, Jie Qi, Junfeng Fang, Guillermo A. Narsilio, Hans Petter Jostad
Abstract:
Learned graph simulators provide an efficient alternative to high‑fidelity solvers for granular dynamics. However, granular motion depends strongly on inter‑granular contact history, which is difficult to preserve when particle contacts form, break, and rearrange. Existing simulators mainly store temporal information in node features or node‑level memory. Here we introduce TRACE, a graph‑network simulator that stores interaction history directly on contact edges. Each edge maintains a persistent memory updated by attention‑based message passing and a gated recurrent unit, while an edge‑identity dictionary preserves this memory as the contact graph changes. A physics‑structured decoder predicts inter‑granular normal and tangential contact forces, enforces the Coulomb friction limit, and applies equal‑and‑opposite internal forces. The model is trained with single‑step pretraining followed by autoregressive rollout fine‑tuning. We evaluate TRACE on 2D and 3D granular column‑collapse benchmarks. In both cases, TRACE produces stable, physically consistent long‑horizon rollouts, closely reproducing the final deposit geometry and the kinetic energy released during collapse. Compared with graph network simulator (GNS) and node‑memory graph neural simulator (NMGNS), TRACE reduces long‑rollout position error by 31‑62% and final‑deposit error by 58‑89% across the two benchmarks, while using fewer parameters and maintaining near‑zero particle interpenetration. TRACE also achieves 12.2× and 8.9× speedups over the material point method (MPM) reference solver in 2D and 3D, respectively. Our code is available at https://github.com/Data‑Driven‑Computational‑Geotechnics/TRACE.
Authors:Zhiyuan Gao, Dominic Yurk, Yaser S. Abu-Mostafa
Abstract:
We present, to the best of our knowledge, the first publicly available resource for predicting left ventricular ejection fraction (EF) from parasternal long‑axis (PLAX) echocardiography. Because no PLAX‑EF datasets previously existed, our work focuses on an innovative data generation strategy to overcome this scarcity. By leveraging a time‑based correlation between clinical notes and echocardiographic videos, combined with fine‑tuning view classifiers and proxy labeling, we created a labeled dataset of over 25,000 PLAX videos. This enables us to train the first reproducible PLAX EF model, achieving a mean absolute error (MAE) of 6.86%. Given that apical four‑chamber (A4C) methods, the clinical standard, report MAE values of 6%‑7%, our results demonstrate that EF estimation from PLAX views is both feasible and clinically relevant. This surpasses the performance of existing methods and provides a clinically relevant solution for situations where apical views may not be feasible. Going further, we demonstrate that combining PLAX and A4C predictions via simple unweighted late fusion improves both single‑view baselines to a 6.37% MAE, underscoring the value of multi‑view integration. To promote continued research, we release the dataset labels, trained models, and runnable demos on GitHub, Hugging Face, and Google Colab: https://github.com/Jeffrey4899/PLAX_EF_Labels_202509
Authors:Jun He, Deying Yu
Abstract:
Multi‑agent quorums are widely used to authorize high‑stakes infrastructure and policy mutations, yet distinct reviewers often share upstream telemetry, documents, or tool backends. When upstream inputs fail, multiple votes collapse onto a single corrupted cause: replication does not imply epistemic redundancy. We introduce Epistemic Fault Domains (EFDs) and the Structural Epistemic Cut κ_E, which quantifies the minimum number of modeled root faults whose exposure covers an authorizing coalition relative to an explicit Epistemic Fault Basis. Under closed causal accounting, conservative exposure, and authorization alignment, κ_E lower‑bounds the number of roots required for semantic compromise (κ_S). We prove that arbitrarily large quorums can retain κ_E=1, that recognizing shared ancestry never increases credited resilience, and that adding voters at a fixed threshold cannot increase the cut under compatible exposure extensions. Finally, we design the Dependency‑Aware Quorum Controller (DAQC) to enforce structural cuts at runtime admission, evaluate its mechanics via analytical derivations and simulations, and provide a frozen 120‑task external benchmark suite.
Authors:Xingyao Xiao, Yihong Cheng
Abstract:
Benchmark contamination, the leakage of test items into training data, is widely described as a threat to the reliability of large language model (LLM) leaderboards. We argue that this concern conflates two distinct questions: whether contamination inflates absolute scores, and whether it reorders the ranking of models. We recast contamination as a violation of anchor‑item invariance and measure it through the differential functioning of original versus semantically equivalent paraphrased items, a within‑item contrast that holds the measured skill fixed and isolates memorization from capability. Using per‑instance responses from 47 publicly released models and 74 models finetuned with a known dose of contamination, across four benchmarks (ARC, GSM8K, HellaSwag, MMLU), we first calibrate the measure against ground truth: it recovers injected contamination dose‑responsively (a corrected effect of +0.187 accuracy points for test‑set leakage) and never flags a negative‑control model trained only on the legitimate training split (‑0.012). We then quantify leaderboard impact: the rank correlation between a standard leaderboard and a paraphrase‑controlled leaderboard is 0.997, and a sensitivity analysis shows that the observed differential contamination is far below the level needed to move rankings, with only 3 of 188 model‑by‑benchmark cases showing differential contamination corroborated across two references. Contamination among these public models is therefore largely uniform: it inflates absolute scores without reordering the leaderboard, and ranking distortion requires the rare case of differential contamination. We provide a calibrated invariance audit, released as a reference implementation, and recommend that leaderboards report paraphrase‑controlled rankings alongside confidence intervals.
Authors:Dulhan Jayalath, Benjamin Ballyk, Oiwi Parker Jones
Abstract:
Speech brain‑computer interfaces (speech BCIs) translate neural activity into language, offering a path towards restoring speech for people with paralysis and, more broadly, enabling new forms of natural human‑computer interaction. Despite this promise, the field lacks a common measure of progress because systems use different datasets, recording methods, types of speech, and vocabularies, so their reported scores are rarely comparable. Underlying this measurement problem are two unresolved questions: (i) what distribution of words should a speech BCI enable a user to communicate, and (ii) how much information from this distribution can a system convey. We address both by deriving open‑vocabulary mutual information (OVMI), an information‑theoretic quantity that measures the information conveyed by a decoder relative to a reference distribution over the words a user may wish to communicate. This allows capabilities measured under different conditions, such as distinct vocabularies, to be evaluated on a common communication scale. We show that ordinarily reported accuracy, word error rate (WER), and other metrics computed only over the words a system supports can overstate how much of a user's intended speech the system can communicate. We then use OVMI to compare existing systems, expose trade‑offs between how much of the user's language a system supports and how accurately it decodes those words, show that these comparisons depend on what the user is expected to communicate, and demonstrate that selecting a vocabulary to maximise OVMI yields up to 16.3% relative improvement in accuracy across three speech domains. OVMI therefore provides the speech BCI community with a principled way to compare heterogeneous systems, improve vocabulary design, and measure progress in the field.
Authors:Junchao Huang, Guian Fang, Shengju Qian, Xianghao Kong, Zhuoran Zhao, Wei Huang, Yihua Du, Zixin Zhang, Justin Cui, Yuchao Gu, Yukang Chen, Xinting Hu, Tianyu He, Shaoshuai Shi, Zhuotao Tian, Xin Wang, Mike Zheng Shou, Li Jiang
Abstract:
We introduce SolarWM, a fully open foundation for building interactive video world models from data preparation through long‑horizon inference. Training across heterogeneous data sources and video backbones is challenging: datasets differ in temporal scale, camera geometry, visual quality, motion, and captioning styles, while video generators use distinct representations and architectures. Naive data mixing and model‑specific implementations therefore produce inconsistent supervision and make results difficult to reproduce and compare. SolarWM addresses this coupling with a reconfigurable multi‑source data engine and a backbone‑native adaptation framework. The engine converts 1.43 million canonical clips from 10 datasets into a unified, frame‑aligned contract covering visual observations, metric camera geometry, captions, quality metadata, selection decisions, and provenance, while decoupling source processing from mixture construction. Under shared camera‑conditioning, training, and inference interfaces, we instantiate four 5B‑‑33B models based on Wan2.2, LTX‑2.5, and MiniMax‑H3 while preserving their native representations and objectives. A unified three‑stage recipe combines bidirectional adaptation, teacher‑forced autoregressive initialization, and distribution matching distillation. The resulting causal models enable real‑time interaction over rollouts ranging from minutes to hours after being trained on only 5s sequences. By releasing the resulting data, pipeline, recipes, weights, and framework, SolarWM provides a reproducible and extensible foundation for interactive world‑model research.
Authors:Kelvin Li, Dhruv Pendharkar, Anish Pahilajani, Chuyi Shang, Leon Oks, Leonid Karlinsky, Rogerio Feris, Trevor Darrell, Roei Herzig
Abstract:
Recent web agents use world models for test‑time action selection by sampling candidate actions, predicting the resulting web states, and ranking them with a ranker model or a Process Reward Model (PRM). These world models are typically trained via supervised next‑state prediction to generate fixed representations like HTML or AXTree snapshots. However, this objective is misaligned with the downstream ranker, which relies on predicted states being discriminative across candidates to accurately score them. To address this, we introduce predicted‑state matching, a training objective where the predicted representation must distinguish the true resulting state from those reached by alternative actions. We train these models using a branching web‑agent dataset derived from WebArena Go‑Browse trajectories, where every decision point contains multiple alternative actions and their resulting states. Experiments on our held‑out predicted‑state matching benchmark show that our approach outperforms world models trained with supervised next‑state prediction. We further show that our approach improves PRM‑style action ranking on WebPRMBench compared with action‑only PRMs and PRMs augmented with supervised‑next‑state world models. Finally, on WebArena‑Lite, using our world model for test‑time action selection improves end‑to‑end task success. Our project page is available at: https://dhruvpendharkar.github.io/dwm/.
Authors:Alessio Spurio Mancini
Abstract:
Ordinary differential equations (ODEs) underlie models in science and engineering, and many applications need derivatives of their solutions with respect to parameters. Ensembles of independent trajectories suit graphics processing units (GPUs), but current GPU software forces a trade‑off: the fastest ensemble solvers cannot be differentiated in reverse mode at the speed they solve, and the solvers built for differentiation solve more slowly. No single tool has yet offered a reverse‑mode gradient at the speed of a fused‑kernel solve. We present GRADSOLVE, an open‑source JAX library for solving and reverse‑mode differentiating low‑dimensional ODE ensembles on NVIDIA GPUs. It records the steps an adaptive solver accepts and differentiates a fixed‑step replay of them; the returned gradient is the exact discrete adjoint of those steps, the same derivative Diffrax returns by default, obtained more cheaply from a fixed‑length chain than from an adaptive loop. It targets ensembles differentiated many times against one recorded mesh, keeps Diffrax as a fallback, and supports explicit and Rosenbrock integrators. Used as a solver, GRADSOLVE's forward‑only kernel ran 2.8x faster than DiffEqGPU.jl; used for gradients, once a record exists, it computed them 5.6‑14.1x faster than Diffrax's checkpointed adjoint at matched forward‑state accuracy across three GPU generations, the advantage narrowing on large ensembles and, on stiff systems, down to parity at tight accuracy. GRADSOLVE is released at https://github.com/ECLIPSE‑AI4Science/gradsolve.
Authors:Aidan Bradshaw, Marco Giordano, David Rode, Andreas Habersack, Elif Basokur, Annika Kruse, Markus Tilp, Michele Magno, Peter Wolf, Luca Benini, Christoph Leitner
Abstract:
The 3D center of mass (CoM) is a primary quantity in the biomechanical analysis of sport, rehabilitation, and clinical movement, yet existing 3D pose tracking, mesh recovery, and multi‑view triangulation methods either optimize 3D keypoint accuracy without anatomical constraints or carry compute and capture infrastructure too heavy to deploy where CoM tracking is most useful. As a result, the metric CoM remains difficult for coaches and movement analysts to measure from a single camera where athletes train and compete. In this work, we introduce MuyBridge, an on‑device system that estimates the athlete's segmental center of mass trajectory from a single phone camera video stream. MuyBridge couples a compact 2D pose network and a distilled single‑step monocular depth network through an analytic metric fusion that uses anatomical and physical priors to anchor the metric CoM, requiring no 3D or task‑specific supervision. Evaluated on the athletic movements of AthletePose3D (running, track and field, and figure skating), MuyBridge achieves 33‑41 mm vertical CoM error and 2.3‑6.6% absolute‑relative range error (AbsRel) under a one‑time calibration, and produces CoM estimates at the 63 FPS pose‑estimation rate using asynchronous 2.86 Hz depth updates on iPhone 15. Code is available at: https://github.com/Abradshaw1/Muybridge
Authors:Jinjie Shi, Wei Hua, Kunzhu Xie, Make Li, Yuchen Liu, Joshua Reiss
Abstract:
Automatic mixing transforms multitrack recordings into perceptually coherent, balanced, and aesthetically consistent mixes. In real‑world production, this task is challenging due to large track counts, diverse instrumentation, and strong inter‑track dependencies. Two‑stage systems address this complexity by separating intra‑group processing from inter‑group mixing, yet it remains unclear whether their gains arise from stronger component models or from explicit task decomposition. We present a subtask‑oriented analysis of automatic mixing through three controlled listening experiments. We investigate whether full‑mix models transfer to intra‑group mixing, whether downstream models compensate for grouping and loudness errors, and whether two‑stage decomposition improves full‑mix quality. Across three dense pop and rock excerpts, transfer differs between the evaluated models; inappropriate grouping causes clear downstream degradation, while altered loudness relationships have weaker and model‑dependent effects. Both two‑stage variants significantly outperform their corresponding single‑stage baselines. These findings support explicit separation of local balance and global mix coordination as a useful design principle for automatic mixing. Code and audio examples are available online.
Authors:Zihao Lu, Radu Timofte, Marcos V. Conde
Abstract:
Modern cameras transform RAW sensor measurements into sRGB images through an image signal processor (ISP). We benchmark two placements for blind restoration around a fixed ISP: (A) pre‑ISP restoration in the RAW domain and (B) post‑ISP restoration in the sRGB domain. The benchmark covers four smartphone device groups, two learned ISPs, three degradation regimes‑‑noise, blur, and joint noise and blur‑‑, and several representative RAW and RGB restoration models. Our results show that placement alone does not determine performance. The RAW restoration strategy outperforms the best generic RGB restoration models. However, RGB restoration models trained considering the ISP transformations, achieve the best overall performance. Our novel benchmark demonstrates that the image reconstruction performance strongly depends on the alignment between the restoration model and the target imaging pipeline. We consequently recommend reporting restoration placement and ISP‑aware supervision as key experimental factors. Our code is available at https://github.com/mv‑lab/AISP
Authors:Dharini Raghavan, Amritpal Singh
Abstract:
Predictive models are increasingly used in robotics for state estimation, planning, control, and policy evaluation, yet they are often judged by open‑loop prediction accuracy over a fixed horizon. In closed‑loop operation, a robot repeatedly acts, receives new measurements, updates its state estimate, and recomputes control. We study this difference in a differential‑drive path‑tracking task with biased odometry and intermittent landmark sensing. Six state estimators are evaluated across 24 sensing conditions using trajectory replay, a 20‑step measurement‑free rollout, and closed‑loop tracking. Replay position RMSE correlates more strongly with closed‑loop cross‑track RMSE than rollout error (Spearman rho = 0.923 vs. 0.774) and selects a different estimator from the closed‑loop optimum in 5/24 conditions, compared with 18/24 for the rollout metric. We then vary rollout horizon and measurement‑update interval. With H=20, rank agreement decreases from rho = 0.916 with measurements at every step to rho = 0.774 with no measurements. A horizon‑update grid shows that long prediction horizons remain informative when regular corrections are retained, whereas long rollouts without correction can produce rankings that differ substantially from closed‑loop behavior. We also test recurrent estimators trained on longer sensing outages. This improves the EKF‑anchored models under combined sensing degradation, reducing GRU‑EKF cross‑track RMSE from 1.72 m to 1.06 m, but the gain is not consistent across isolated outages or estimator architectures. These results show that predictive‑model evaluation in robotics should specify both prediction horizon and measurement‑update schedule. For models used in feedback, offline rollouts are most informative when their sensing and correction pattern reflects closed‑loop operation. Code is available at https://github.com/rdharini2001/Robot_World_Model
Authors:Qinghua Mao, Wanying Qu, Dadi Guo, Leitao Yuan, Qingyu Liu, Yu Li, Guanxu Chen, Yanwei Fu, Xi Lin, Xia Hu, Dongrui Liu
Abstract:
The performance of LLM‑based agents is jointly shaped by the base model and the harness used when interacting with the environment. This exposes them to safety risks in both harmful final responses and multi‑step execution trajectories. Existing safety alignment mechanisms often rely on either external harness updates or policy optimization, yet applying either paradigm in isolation fails to bridge runtime control with intrinsic safety. We propose SafeEvolve, an experience‑driven self‑evolving framework for agent safety alignment. SafeEvolve leverages safety experience from completed on‑policy trajectories to drive a continual loop of harness‑policy co‑evolution. On the harness side, SafeEvolve converts trajectory‑level safety evidence into bounded, component‑level updates across safety prompt and hierarchical skills, yielding auditable and reversible harness artifacts. On the policy side, SafeEvolve follows a two‑stage SFT‑RL paradigm, where harness‑use SFT bootstraps the policy to actively leverage evolved harness artifacts, and harness‑augmented RL further shapes autonomous safety behaviors during multi‑step exploration via verifier‑decomposed rewards. Through harness‑policy co‑evolution, SafeEvolve converts safety experience into an evolved runtime harness and improved policy behavior. Experiments on agentic safety benchmarks show that SafeEvolve achieves a stronger safety‑utility tradeoff than existing baselines. For Qwen3.5‑4B, SafeEvolve achieves a 3× ASR reduction on AgentDojo while improving benign utility from 59.79% to 61.86%.
Authors:Yuling Shi, Zhensu Sun, Junsen Dong, Chengcheng Wan, David Lo, Xiaodong Gu
Abstract:
Evaluating LLM agents is essential for guiding their development, yet it has grown prohibitively expensive: a single pass of a frontier model over an agentic benchmark can cost hundreds to thousands of dollars, a price paid repeatedly across iterative development cycles. Prior efforts, centered on benchmark distillation, reduce the number of evaluation tasks but leave the cost of executing each retained task untouched. In this work, we introduce early outcome prediction, a complementary axis of efficiency that instead cuts cost within each task. Our key insight is that an agent's final outcome is often evident from its intermediate behavior well before execution completes. We instantiate this idea in EarlyEval, a lightweight framework that trains a pair of LightGBM success and failure classifiers over behavioral, textual, and reference‑solution features, and halts an agent run the moment either classifier crosses a calibrated confidence threshold, adding negligible per‑step overhead. Across three benchmarks, SWE‑bench Verified, TerminalBench, and Toolathlon, EarlyEval can eliminate 13%‑26% of agent steps and up to 44.1% input tokens and 29.4% output tokens at 89%‑97% prediction accuracy, while perturbing per‑agent resolve rates by only one to two percentage points on average.
Authors:Jitai Hao, Ke Yang, Qiang Huang, Jun Yu
Abstract:
Streaming video understanding is a critical capability for real‑world applications, including embodied intelligence, autonomous driving, industrial monitoring, surveillance and early warning, and wearable assistants. However, processing continuous video streams with multimodal large language models (MLLMs) is computationally expensive. Existing efforts have explored reducing streaming overhead through visual token pruning, token merging, quantization, on‑demand frame retrieval, and context offloading. However, most existing methods overlook the dimension of model depth. Repeatedly executing full‑depth MLLM prefill over incoming frames is prohibitively expensive, incurring substantial computational overhead and causing the KV cache to grow at a rate directly proportional to the prefill depth. To address these challenges, we propose ShallowStream, a novel framework that leverages the shallow layers of an MLLM to simultaneously perform frame encoding and retrieval index building. During stream processing, ShallowStream maintains an always‑on lightweight index using the KV cache of shallow layers. During query‑time answering, we leverage the attention scores generated by the shallow layers to score context frames and employ a diversity‑aware selection strategy to retrieve precise and comprehensive evidence. ShallowStream achieves performance on par with the strongest existing streaming methods, while reducing per‑frame prefill latency and 10‑second end‑to‑end latency by up to 52.1x and 11.9x, respectively. Our code is available at https://github.com/CURRENTF/ShallowStream.
Authors:Xiaofeng Yan, Kechen Liu, Abhilash Venkatesh, Cathy Zhang, Xia Zhou, Salvatore Stolfo
Abstract:
Palm‑vein biometrics are increasingly used for secure, contactless authentication. Yet real‑world deployment exposes them to surface noise (sweat, dirt), illumination and motion variation, and temperature‑driven changes in vascular visibility, which remain underexplored for lack of data captured under such conditions. To study these effects, we introduce the Columbia University Palm‑vein (CUP) dataset, to our knowledge the first public video‑based palm‑vein dataset. CUP records every palm under four surface conditions (a clean baseline, warm, wet, and dirty) and pairs each subject with physiological and demographic metadata. On it we benchmark twenty‑one recognizers spanning static, video, and multi‑frame aggregation architectures. Models that verify reliably on clean palms lose most of their accuracy on dirty ones, and the mean equal error rate (EER) roughly quadruples. We recover much of that robustness along both axes of the capture. Temporally, a consensus over the few frames the sensor already returns cancels transient corruption; spatially, a test‑time matcher that adds no learned parameters fuses the global cosine with a saliency‑steered region‑level optimal transport that routes the comparison around corrupted regions. The full design leads on every surface of CUP in EER, TAR@FAR=0.01, and Rank‑1, at 4.3M parameters and 3.1 GFLOPs, a fraction of the video models' cost. Attached to four frozen state‑of‑the‑art backbones it cuts their mean EER by 29‑37% without retraining, and on four public single‑image datasets the regional matching alone still helps. A preliminary audit across ten demographic and physiological traits finds two warm‑condition gaps, along body water and gender, that survive multiple‑comparison correction. CUP will be released for non‑commercial research use at https://github.com/MobileX‑CU/CUP_v1 upon publication.
Authors:Yihang Chen, Yuxiang Chen, Yuxuan Huang, Meng Fang, Weilin Luo, Jun Wang
Abstract:
Multi‑agent LLM systems commonly use an orchestrator to decompose a task for a team of workers and then improve through textual reflection. Despite strong empirical results, these systems lack a unified account of coordination, memory improvement, and the role of external verification. We model orchestrator‑worker interaction as a bilevel coordination game: under bounded coupling, the workers' local‑update game is an approximate potential game whose equilibrium slack is controlled by decomposition quality. We then analyse reflection as stochastic movement over semantic memory states. For free‑form reflection, we derive a finite‑time upper bound, prove worst‑case tightness, and give a positive lower bound under a falsifiable persistent‑harm condition. We further prove an information‑theoretic impossibility result: no gate that observes only the generated transcript can improve uniformly over text‑indistinguishable environments, whereas an environment‑grounded gate can. Motivated by this separation, we introduce Stochastic Reflective Memory Ascent (SRMA), which accepts a candidate memory only after a grounded evaluation risk strictly decreases. Under calibration and non‑degenerate corrective mass, SRMA converges exactly, geometrically or polynomially; matching constructions show that both rate regimes are order‑tight. We also provide confidence gating for stochastic evaluation and re‑anchoring guarantees for piecewise‑stationary environments. Experiments instantiate these objects with environment‑grounded metrics and test the predicted coordination and drift laws. On 500 SWE‑bench instances, the complete Kimi‑based system resolves 72.2% versus a 70.8% public mini‑SWE‑agent reference. Code: https://github.com/YihangChen9/Bilevel‑Coordinated‑Reflection
Authors:James Di Novo, Hany Ragab, Sylvain P. Leblanc
Abstract:
Signal Phase and Timing (SPaT) messages are a cornerstone of connected vehicle (CV) safety, enabling CVs to perceive and respond to intersection state through Vehicle‑to‑Infrastructure (V2I) and Vehicle‑to‑Vehicle (V2V) communication. The integrity of these messages is threatened by a range of application‑layer attacks that can bypass conventional authentication when a roadside unit or peer vehicle is compromised. Existing intrusion detection research either defends the infrastructure side or targets V2V Basic Safety Message (BSM) / Cooperative Awareness Message (CAM) misbehavior, leaving the onboard CV perspective on SPaT integrity unaddressed.To close this gap, we introduce SPADE ‑‑‑ the SPaT Attack Detection and Evaluation dataset ‑‑‑ a labelled, multi‑modal, simulation‑based dataset designed specifically for deep learning IDS research in this space. SPADE is generated through Eclipse MOSAIC using runtime attack injection at the SAE J2735 application layer across six attack classes and one benign class. By combining four intersection geometries, six operating conditions, and five independent random‑seed repetitions, SPADE comprises 180 unique base scenario runs, yielding ~1,890,000 labelled timestep records (270,000 per class). Each record fuses SPaT message fields, onboard camera confidence scores, and cooperative V2V peer data across 40 features, reflecting the multi‑modal signal space required to distinguish deliberate attacks from environmental degradation. The dataset, generation code, and scenario configurations are released publicly to support reproducible and comparative IDS research in C‑V2X security. The developed toolbox, instructions, and dataset link are publicly available on GitHub: https://github.com/jdinovo/SPADE.
Authors:Dmitrii Andriianov, Andrey Veprikov, Aleksandr Beznosikov
Abstract:
Low‑rank adaptation (LoRA) is the standard way to fine‑tune large models, yet when its two factors are trained independently, the update ignores the geometry of the low‑rank weight change it induces. We introduce LoRA‑TSD, an optimizer that treats every LoRA step as a tangent vector of the fixed‑rank matrix manifold and takes the spectral‑norm steepest‑descent step of Muon inside that tangent space, mapping the result back to the factors through a retraction native to the LoRA parametrization. The step avoids expensive operations on full weight matrices, and its retraction is up to 2.8× cheaper than the truncated‑SVD retraction used by prior manifold methods. We prove that the Frobenius‑norm version of our surrogate recovers LoRA‑Pro, and we identify the tangent‑projected gradient, the Riemannian gradient of the manifold, as the stationarity measure natural to LoRA training and computable from the factor gradients alone. Under this measure we give the first global convergence guarantees for both LoRA‑Pro and LoRA‑TSD, with rates that drive the factor‑gradient norms to zero. Across six commonsense and natural‑language‑inference benchmarks with Llama‑3.2‑1B, Llama‑3.1‑8B and Qwen3‑32B, LoRA‑TSD outperforms every competing LoRA optimizer and stays robust to the adapter rank. Code is available at https://github.com/brain‑lab‑research/LoRA‑TSD.
Authors:Canjie Liu, Jiawen Kang, Jinbo Wen, Zishao Zhong
Abstract:
Large vision‑language models have achieved remarkable success in vision‑language tasks. However, they remain prone to Visual Hallucinations (VHs), undermining their reliability in real‑world applications. Existing solutions typically require curated datasets, additional training, or multi‑round decoding, resulting in considerable computational overhead. In this paper, we propose RVSD (\underlineRetrieval \underlineVision \underlineSparse \underlineDecoding), a training‑free and plug‑and‑play decoding framework that, for the first time, unifies token sparsification and Semantic‑Space Visual Retrieval (SSVR) within a single decoding pass. Within RVSD, we introduce a semantics‑directed token selection strategy that selectively sparsifies redundant tokens while preserving critical visual information. We further propose the SSVR mechanism, which reformulates visual compensation as an on‑demand cross‑modal retrieval process within a shared semantic space. Extensive experiments demonstrate that RVSD achieves state‑of‑the‑art performance in mitigating VHs while maintaining robust suppression capabilities under long‑context generation settings. Our code is available here.\footnotehttps://github.com/canjie‑liu/RVSD
Authors:Wooyoung Jung
Abstract:
Occupants are a primary source of uncertainty in building energy consumption and management, yet existing occupant behavior models cannot capture adaptive and reasoning responses considering the occupant's personal history, current context, and the type of energy signal being delivered. This study presents BuildOcc, an open‑source Python platform that grounds large language model agents in the American Time Use Survey (ATUS), a nationally representative diary dataset covering 16,684 respondents. Through BuildOcc, each simulated occupant agent can be instantiated with a demographic persona drawn from ATUS population statistics, a memory stream that accumulates and reflects on timestep‑level observations, and an activity scheduler that samples empirically from ATUS time‑at‑activity distributions. The platform exposes a three‑layer interface ‑ Python library, REST API, and Model Context Protocol server ‑ so that any building energy tool (EnergyPlus, Home Assistant) can integrate behavioral intelligence without bespoke coupling code. A plugin registry lets the community add new occupant strata, custom schedulers, and alternative memory backends as separate installable packages. Two validation tiers show that ATUS‑grounded sampling reproduces empirically calibrated activity distributions and that demographic priors propagate into persona‑consistent agent reasoning across timesteps, establishing internal consistency across strata. BuildOcc provides the building energy community with a reusable, openly available implementation of the occupant behavioral layer. BuildOcc is openly released at https://doi.org/10.5281/zenodo.21192895 under the Apache License 2.0 and installable via pip install buildocc.
Authors:Anchit Mulye, Rhythm Baghel, Sujay Kumar Ingle, Hardik Jain
Abstract:
Deploying 3D point cloud models on edge hardware such as the NVIDIA Jetson Orin Nano is severely constrained by compute and memory budgets. Existing compression methods require access to the model's original source code, rendering them inapplicable to the Open Neural Network Exchange (ONNX) binaries commonly distributed by vendors and model repositories. We present H3DNAS, a hardware‑aware model compression framework that operates directly on ONNX computational graphs without requiring original source code, architecture class definition, or gradient access during search. H3DNAS makes three contributions: (1) a Channel Dependency Graph (CDG) that classifies ONNX operators into four constraint classes and formally establishes that the free parameter fraction ρ_f is topological invariant, a provable compression ceiling computable in \mathcalO(|V|+|E|); (2) a Two‑Stage Hierarchical Search that prunes candidate architectures by L_1‑importance channel selection, ranks them by output fidelity as a zero‑shot label‑free proxy, and applies GhostConv structural mutation to Pareto‑optimal candidates; and (3) the first source‑code‑free compression pipeline for 3D point cloud models, operating entirely via ONNX graph surgery with no original architecture definition required. On ModelNet40, H3DNAS reduces the number of parameters in PointNet, PointNet++, and PointMLP by 65.5%, 43.2%, and 49.1%, respectively, while achieving 1.99×, 1.29×, and 1.67× inference speedups with negligible loss in accuracy. The source code is publicly available\footnotehttps://github.com/ClarityLab‑Org/h3dnas.
Authors:Subash Khanal, Yangzhi Cui, Daniel Cher, Eric Xing, Brian Wei, Srikumar Sastry, Nathan Jacobs
Abstract:
Earth observation is fundamentally multi‑scale; geospatial tasks span varied resolutions, and satellite imagery is organized into cascading tile pyramids that nest fine detail within wide coverage. Current generative models of satellite imagery, however, operate along a single axis: they either zoom to enhance a single tile's resolution or pan to extend imagery at a fixed scale. As a result, no existing method produces a complete pyramid that stays consistent across both scale and space, where a high‑zoom tile must agree with the coarse context it refines and with the neighbors it meets. Motivated by this gap, we introduce a new task, multi‑scale tile completion: given a sparse set of seed tiles at arbitrary zoom levels and positions, synthesize a complete, uniform quadtree that is globally consistent across both scale and space. We approach this task with Genesis, a generative engine that brings both axes together by composing two specialized operators over the quadtree: a vertical super‑resolution model and a horizontal mask‑based outpainting model, producing pyramids that are consistent across zoom levels and seamless across neighboring tiles. Each operator achieves state‑of‑the‑art results on its subtask, and the engine propagates sparse seeds into seamless, multi‑resolution maps from any initial configuration. To evaluate the task and benchmark Genesis, we introduce dense500, a fully observed multi‑scale pyramid dataset spanning diverse geographic regions, together with a suite of pyramid‑level metrics. Code, models, and our dataset are available at https://github.com/mvrl/genesis.
Authors:Zichen Yuan, Xiaoxuan Dong, Linkun Dai, Jinwei Yang, Jining Luan, Dexu Yu, Chunxiao Li, Joemon M. Jose, Youhua Li, Hanwen Du, Junchen Fu
Abstract:
Sequential recommendation models are foundational to modern personalized services, yet their effectiveness varies substantially across heterogeneous user environments. In particular, static one‑pass recommenders often perform well on common behavior patterns but degrade on operationally challenging user groups, such as users with longer histories or less mainstream item profiles. To address this limitation, we propose \textscDS‑Frame, an adaptive fast‑‑slow inference framework for sequential recommendation. \textscDS‑Frame combines a Fast System for efficient routine prediction, a Slow System for iterative latent refinement, and a learned selector that routes each sample under a controllable computation budget. Experiments on five real‑world datasets show that \textscDS‑Frame consistently improves representative sequential recommendation backbones, with larger gains on challenging groups and effective accuracy‑‑efficiency trade‑offs. This highlights the potential of adaptive inference for more efficient and robust recommendation. Code is available at \hrefhttps://github.com/ZichenYuan233/Recommender‑System‑as‑Slow‑and‑Fast‑Thinkersthis link.
Authors:Jiska Beuk, Gerasimos Spanakis
Abstract:
While English language models have been widely examined for anti‑queer bias, Dutch models remain understudied. To address this gap, we developed a culturally and linguistically adapted Dutch dataset based on the English WinoQueer benchmark, containing pairs of stereotypical and counter‑stereotypical sentences. To validate and expand it, we conducted an online survey with 43 Dutch queer participants, confirming 145 of 171 stereotypes as culturally relevant and identifying 22 new biases through free‑text responses. The final released dataset, comprising 42,906 sentences, was evaluated using a range of Dutch‑specific and multilingual models, including both masked language models (MLMs) and autoregressive language models (ARLMs), with bias measured via a score comparing log‑likelihoods of stereotypical versus counter‑stereotypical sentences. While the mean bias score across models appeared neutral (~50%), closer analysis revealed significant disparities: some models favored stereotypical sentences up to 97% of the time for transgender identities, but only 6% of the time for gay‑related pairs, with transgender and non‑binary identities consistently receiving the highest bias scores. Our findings highlight the importance of culturally grounded datasets for evaluating and mitigating biases that disproportionately impact marginalized groups in Dutch language models.
Authors:El Ouanas Belabbaci, Bhavesh Wani, Philipp Terhörst
Abstract:
Face recognition in unconstrained environments remains highly challenging due to diverse and extreme variations encountered in real‑world scenarios. To mitigate these effects, existing margin‑based approaches model sample quality through feature magnitude. However, magnitude‑based modeling alone is susceptible to identity‑agnostic noise, which can degrade the reliability and discriminative power of learned representations. In this paper, we propose Dual Quality Margin Learning for Face Recognition (DQM‑Face), a novel framework that enables refined attraction and repulsion dynamics during representation learning. Our approach unifies conventional magnitude‑based quality estimation with a newly introduced semantic quality learning mechanism, realized via squeeze‑and‑excitation semantic attention. By jointly leveraging magnitude and semantic cues, we construct enhanced quality‑aware margins that adaptively strengthen intra‑class compactness through improved attraction during learning. To further enhance inter‑class discrimination, we introduce a repulsion margin formulation that explicitly enlarges inter‑class separation. The unified integration of semantic quality modeling with dual attraction‑repulsion margin optimization results in a more structured and discriminative feature geometry. Extensive experiments on multiple challenging benchmarks demonstrate that DQM‑Face consistently outperforms state‑of‑the‑art face recognition methods. Moreover, we show that the quality learned for margin optimization is highly effective for face image quality assessment within the proposed framework, demonstrating that the learned quality signal is intrinsically aligned with the recognition objective. The code is publicly available: https://github.com/RAIB‑group/DQM‑Face
Authors:Annalisa Gallina, Marco Fiorucci, Marco Brigo, Federica Battisti, Lamberto Ballan
Abstract:
The rapid advancement of generative models has significantly worsened the problem of manipulated image detection, as these methods are capable of producing highly realistic forgeries, reinforcing the importance of multimedia forensics. Conventional approaches typically frame image manipulation detection as a binary classification task (real vs. generated), which limits the capability to distinguish and localize different forms of manipulation. To address these constraints, this work extends an existing detector by introducing a unified multiclass framework (real vs. fully generated vs. tampered). In addition to classifying image authenticity, the framework incorporates a segmentation branch to enable pixel‑level localization of tampered regions. The proposed approach outperforms selected recent benchmarks, offering an efficient solution with improved classification accuracy and higher IoU scores for the localization task. Find the code at https://github.com/anngal01/From‑Detection‑to‑Localization‑A‑Unified‑Forensics‑Framework‑for‑Fully‑Synthetic‑and‑Tampered‑Images.
Authors:Kenichi Fujita, Yusuke Ijima
Abstract:
Voice actors often re‑read the same script while modifying their delivery in response to performance directions. We study this setting as direction‑following TTS, where a system generates a new utterance that reflects a given direction relative to a reference utterance while preserving speaker identity and linguistic content. A key challenge is the lack of training data capturing such relative modifications. To address this, we propose a scalable pseudo‑triplet construction pipeline that generates~(reference utterance, direction text, modified utterance) triplets. It generates controlled style variations using an impression‑controllable TTS model and uses an LLM to produce natural language directions from estimated impression differences. Experimental results demonstrate that pseudo‑triplets alone enable stable speaker‑preserving modification, and that combining pseudo and recorded data further improves direction alignment while maintaining speaker similarity. Audio examples are available on our demo page https://ntt‑hilab‑gensp.github.io/IS2026pseudo/
Authors:Henrique Zan Grande, Jeovane Honorio Alves, Rayson Laroca, Andre Gustavo Hochuli
Abstract:
This work presents an approach to the Generalizability Across Tumors (BraTS‑GoAT) task of the BraTS 2026 Challenge, which focuses on robust segmentation of brain tumor sub‑regions across a heterogeneous patient population. The proposed method employs the nnU‑Net framework with a large residual encoder architecture, integrating a semi‑supervised learning technique with pseudo‑labels generated from the unlabeled training data and a tumor‑aware deformable augmentation that locally deforms the lesion while preserving the surrounding anatomy. We evaluate the individual contributions of each component, as well as their combination, using varying proportions of the most confident pseudo‑labeled cases. The submitted configuration for the generalization task achieves Dice and NSD scores of 0.881 and 0.473 for Whole Tumor, 0.817 and 0.490 for Tumor Core, and 0.775 and 0.533 for Enhancing Tumor on the BraTS‑GoAT validation set, improving over the labeled‑only baselines across all tumor regions and confirming that self‑training and the proposed augmentation are complementary. Our source code is publicly available at https://github.com/Henrique‑zan/brats‑goat‑2026/.
Authors:Ján Pastorek
Abstract:
Although almost all graphs are asymmetric ‑‑ having no nontrivial global automorphisms ‑‑ they may still possess local symmetries in the form of isomorphisms between induced subgraphs, i.e., partial automorphisms. We study such local symmetries via asymmetric depth, defined in terms of the maximum rank of a nontrivial partial automorphism. We prove a tight upper bound on asymmetric depth in the class of planar graphs and identify the extremal graphs: duals of IPR fullerenes attain the maximum already on 47 vertices. Our main structural result concerns the IPR fullerenes that are neither maximally asymmetric nor symmetric. In such a cage no purely local action realises a low asymmetric depth, and we show that the map which does realise it cannot be confined to a small part of the cage either: neither to a single face, nor behind an interface of at most 5‑k edges, k \le 3 being the deficiency. A cage of asymmetric depth 2 or 3 is therefore not asymmetric in one place; it carries a broken symmetry invisible to its automorphism group. Such cages are rare ‑‑ under 2% of the asymmetric IPR fullerenes at n = 118. In all 727 of them the largest partial automorphism is a near‑mirror reflection, which we state as an explicit conjecture. We also extend the asymmetric depth bound to graphs of higher genus.
Authors:Uicheol Jung, Juyoung Hong, Geuntaek Lim, Yukyung Choi
Abstract:
Text‑video retrieval requires representations that can distinguish videos with similar scenes, actions, and temporal patterns. Recent multimodal large language models have been adapted as embedding models, but they often represent each input using a single token from the final layer. This can compress diverse video‑text cues into a single vector and limit fine‑grained retrieval. To address this limitation, we propose MARS, a multi‑layer and multi‑slot embedding framework for text‑video retrieval. MARS constructs multiple adaptive representation slots by combining hidden states from different decoder layers, compares corresponding text and video slots, and aggregates their similarities for retrieval. To better handle confusing candidates, we further introduce a hard‑negative‑aware slot specialization objective that encourages the slots to capture discriminative matching cues. Experiments on four text‑video retrieval benchmarks show that MARS achieves state‑of‑the‑art results in both direct similarity‑based retrieval and reranking settings. Ablation studies and analyses demonstrate that multi‑layer fusion, multiple slots, and hard‑negative‑aware slot specialization provide complementary gains. Code is available at https://github.com/sejong‑rcv/MARS.
Authors:Quan Hao, Mengyue Fan, Zifan Dong, Youru Li, Jianduo Zhao, Lechuan Xu, Hao Zhang, Fei Xia, Jigang Wang, Chong Qiu, Liguo Zhang
Abstract:
Drug‑target interaction (DTI) prediction is an important task in AI‑driven drug discovery. Although recent biochemical representation learning methods have improved DTI prediction, their passive feature aggregation tends to favor dominant molecular patterns while suppressing weak yet binding‑relevant signals, such as functional groups and residue‑context patterns, limiting the modeling of multi‑scale biochemical correspondences. To address this issue, we propose ProbeMatchDTI, a pattern‑probe‑driven framework comprising IterProbe and BindingProbe. IterProbe explicitly retains contextual states across refinement depths and uses learnable probes to select them at each position before cross‑entity matching, thereby preserving weak biochemical patterns and strengthening associations among functional groups, local motifs, and molecular scaffolds. BindingProbe then characterizes cross‑entity drug‑protein complementarity at local biochemical‑unit and whole‑pair levels, jointly modeling fine‑grained interactions and multi‑scale correspondences while preserving weaker binding‑relevant associations. Extensive experiments demonstrate the superiority of ProbeMatchDTI, achieving 2.0% and 0.5% higher AUC‑ROC on BindingDB and DrugBank, respectively. Feature‑level pattern analyses further characterize its probe‑driven behavior in cross‑scale biochemical pattern matching. We further connect ProbeMatchDTI predictions with an evidence‑guided downstream drug‑discovery workflow, demonstrating their utility for candidate refinement and validation planning. Our code is available at https://github.com/developer‑hq/ProbeMatchDTI
Authors:Xixiang He, Xingming Li, Baiqi Wu, Qiyao Sun, Xuanyu Ji, Ao Cheng, Qingyong Hu
Abstract:
Modern large language models (LLMs) rely on reinforcement learning to build strong capabilities in individual domains, but integrating those capabilities into a single deployable model remains challenging. By routing each sample to the teacher whose domain matches it, existing approaches let a domain label decide which teacher provides supervision. However, domain expertise holds only on average: the matched teacher is not always correct on a given sample, while a teacher from another domain sometimes is. The reliable teacher therefore has to be identified per sample, not per domain. In this paper, we introduce Multi‑Teacher Self‑Distillation Policy Optimization (MT‑SDPO), an on‑policy distillation method that unifies several frozen teachers into one student model. MT‑SDPO consists of three components: (1) self‑anchors, where a rollout is supervised by a correct rollout from its own group; (2) answer‑verified eligibility, where a teacher may supervise a sample only if its own answer passes a verifier; and (3) privileged distillation, which merges the anchor and all verified feedback into one context that an exponential moving average self‑teacher reads and the student does not, thereby keeping one policy at deployment. Across five students from three model families, MT‑SDPO lifts the weakest domain of Qwen3‑8B by 14.79 points and narrows its domain gap by 74.7%, a better balance than serving one matched teacher per domain. Verified reliability, not domain membership, should decide who teaches. Code is available at https://github.com/hexixiang/MT‑SDPO.
Authors:Damian Sójka, Marc Masana, Bartłomiej Twardowski, Sebastian Cygert
Abstract:
Test‑Time Adaptation (TTA) has recently emerged as a promising strategy that allows the adaptation of pre‑trained models to changing data distributions at deployment time, without access to any labels. To mitigate error accumulation, researchers have widely adopted the teacher‑student framework, though its long‑term stability is often taken for granted. In this work, we challenge the common strategy of setting the teacher weights to an exponential moving average of the student by showing that error accumulation still occurs, although it is mostly apparent on longer sequences compared to those commonly utilized. We analyze the stability‑plasticity trade‑off within the teacher‑student framework and propose to use an intransigent teacher that does not update its weights. Surprisingly, we show that this simple change allows TTA methods to significantly improve their performance on multiple datasets with longer scenarios and result in increased robustness to changes in hyperparameters. Finally, we show that those changes can be seamlessly and effectively applied to various architectures and experimental setups, including semantic segmentation. The code is available at https://github.com/dmn‑sjk/intransigent_teacher.
Authors:Irina Proskurina, Guillaume Metzler, Antoine Gourru, Julien Velcin
Abstract:
Model compression techniques such as pruning and quantization facilitate the efficient deployment and acceleration of Large Language Models (LLMs). However, recent studies show that weight sparsification methods, such as SparseGPT, can amplify existing biases in models, with outputs varying significantly depending on persona cues in the prompt. In this paper, we introduce Debias‑SparseGPT, a post‑training pruning method incorporating representational debiasing using a second‑order term defined over demographically contrasting inputs. We perform empirical validation of our method over a wide range of generative LLMs. Across models and sparsity regimes (25%, 50%, and structured 2:4 sparsity), Debias‑SparseGPT consistently reduces pruning‑induced bias compared to SparseGPT while preserving model perplexity and zero‑shot accuracy. Under the most restrictive 2:4 structured sparsity pattern, which most aggressively degrades model quality, augmenting the calibration set with long‑context, content‑rich examples further improves both downstream performance and fairness. Overall, Debias‑SparseGPT advances the bias‑performance trade‑off while preserving the computational efficiency of sparse models.
Authors:Austin Tudor David Andrews, Liam Wilkinson, Jamie Heagerty, Harry Coppock, Jakob Nicolaus Foerster, Rui Ponte Costa
Abstract:
We present CivBench, an open‑source benchmark for evaluating language model agents in long‑horizon, tool‑mediated environments through the Model Context Protocol (MCP). A single episode spans 300+ turns and produces thousands of tool calls over a large action space, requiring sustained planning, state monitoring, and execution under partial observability. The environment exposes 76 MCP tools and a narration layer that converts visual game state into structured text. We use CivBench to characterise agent behaviour across four model families in 23 admissible runs. The sample is a pilot, not a model ranking: aggregate outcomes do not reliably discriminate models at this scale. Instead, we introduce two interface‑level metrics that the environment makes measurable: Proactive Monitoring Rate (PMR), capturing whether agents actively query latent strategic state, and RAG@10, capturing whether commitments stated in structured planning reflections are executed within ten subsequent turns. Across runs we observe two consistent patterns under a shared playbook protocol. Agents under‑monitor strategically relevant state that is available but requires explicit querying: despite playbook guidance to query victory progress every 20 turns, agents do so only every 30 to 75 turns, and in 7 of 20 detectable defeats they failed to query within the 20 turn warning window before game end. Agents also frequently fail to execute near‑term commitments stated in their own planning reflections (RAG@10 between 48.2% and 65.8% across models). Both patterns arise despite tool access and explicit guidance, and we interpret them as deviations under instruction rather than absences of capability. We release the environment, scenarios, logs, metrics, and analysis pipeline at https://github.com/lmwilki/civ6‑mcp
Authors:Thomas Weigel, Simon Kiefhaber, Fabian Portner, Matthias Hollick, Simone Schaub-Meyer
Abstract:
Knowing where and how fast objects are moving within a scene is important across various domains. Usually, cameras are used to capture the data necessary for this task, but adding cameras often raises privacy concerns, and the quality of captured frames is heavily influenced by lighting conditions. In this work, we explore using WiFi channel state information (CSI) instead of camera frames for optical flow estimation. We propose WiFlow, a CSI based flow estimator, a preprocessor evaluation for CSI, and three model architectures that offer different trade‑offs between accuracy and complexity. Further, we create the first dataset for training and evaluating CSI‑based optical flow estimators, and our experiments provide insights into key design elements for this task. Code and data are available at https://visinf.github.io/wiflow.
Authors:Francisco Manuel Arrabal-Campos, Francisco G. Montoya, Santiago Sánchez-Acevedo, Raymundo E. Torres-Olguin, Alfredo Alcayde
Abstract:
Monitoring a DC line with many distributed power converters is a genuinely spatio‑temporal problem: the information about a localized fault travels along the whole conductor and reaches a few measurement points mixed with the dynamics of the line itself. This paper develops a two‑dimensional geometric Laplace transform (t,x) ‑> (s_t,s_x) over a commutative subalgebra of the geometric algebra Cl(4,0), isomorphic to Segre's bicomplex numbers, in which two bivectors B_t and B_x act as independent imaginary units for the temporal and the spatial phase. Because the two phases live in algebraically distinguishable planes, a fault at position x_f leaves a transformed residual that factorizes as F_f(s_t) e^‑s_x x_f: its temporal nature stays in the first factor and its location can be read as a geometric argument of the second. On this representation we build a transmission‑line model of the converter line and its space‑time dispersion relation, a distributed control by admittance shaping, including an exact treatment of discrete converter sites (spatial sampling, aliasing, and a per‑converter droop realization that is exact on the sub‑Nyquist band), and a fault diagnosis chain that detects, localizes and classifies injection‑loss, shunt, sensor and local‑controller faults, extends to multiple simultaneous faults with automatic order selection, and distinguishes the outage of a plant from a cable defect. As an integral object the transform is known in bicomplex analysis, and with a single independent variable it reduces to the complex Laplace transform; the contribution lies in its geometric embedding and in its operational use for fault diagnosis in distributed‑converter networks. All results are reproduced by an accompanying open implementation.
Authors:Matteo Greco, Anudeex Shetty, Andrea Tagarelli, Jey Han Lau
Abstract:
While existing work on LLM authorship attribution (AA) has made progress, available benchmarks remain limited, often focusing on English, controlled settings, or relatively outdated models, with the few multilingual studies considering only relatively short texts. We introduce MultiGhostBench, a multilingual benchmark comprising 928 books generated by five recent LLMs across six languages and three scripts, with an average length of approximately 59K words per book. The benchmark supports evaluation under domain, author, and language shifts. Evaluation of representative AA methods shows that no single method consistently performs best across settings, and performance generally degrades under distribution shifts. Transformer‑based detectors can retain generator‑related information across languages, although transfer effectiveness varies by language pair, whereas statistical and fingerprint‑based detectors are more language‑dependent. We envision MultiGhostBench as a valuable resource for the development and evaluation of robust AA methods. The dataset and code can be found at https://github.com/GrecoMT/MultiGhostBench.
Authors:Kun-Yang Yu, Yingzhe Li, Hongyu Xu, Shi-Yu Tian, Zhi Zhou, Yang Chen, Ming Yang, Sheng Wang, Qing Yu, Lan-Zhe Guo, Yu-Feng Li
Abstract:
Vision‑Language Navigation (VLN) requires an embodied agent to follow natural‑language instructions in unseen environments. Recent progress has been largely driven by Multimodal Large Language Models (MLLMs). Existing methods follow a next‑step action prediction paradigm, supervising only the expert action, which requires a high quantity of data for training. They also rely on cognitive maps, accumulated historical frames, or external 3D tools to maintain states, leading to high computational and memory overhead. To realize resource efficiency VLN, we propose LookStep, a unified end‑to‑end framework that combines Language Centric Future State Modeling and Event Driven Rolling Memory that uses language labels to generate coarse‑grained navigation progress and future states for each candidate action, while autonomously deciding whether to write each observation into a bounded rolling memory with a semantic role. We validate LookStep empirically. On VLN‑CE tasks, LookStep outperforms existing methods under the same training settings, achieving a 49.7% success rate on R2R‑CE Val‑Unseen with better memory efficiency and less data usage. Code and model is available at https://github.com/kunyang‑YU/LookStep.
Authors:Luo Li, Chongchong Huang, Jun Jia, Qiang Gao, Xinlong Liu, Gui Yang, Liang Cao
Abstract:
Traffic sign detection faces a long‑tailed data distribution. Many rare signs matter as much as common ones from a regulatory standpoint, yet they have very few samples. Generative data augmentation is one way out. General‑purpose inpainting models, however, distort digits, deform geometry and perspective, and shift colours when applied directly to sign regions. We trace this to a single gap: the conditioning signal is too abstract for the physical composition of a sign. We propose a structured‑prior‑guided diffusion inpainting framework with physical consistency. It injects the semantic, appearance and geometric priors of a sign through three orthogonal pathways: a JSON‑formatted text prompt, a front‑view vector template rendered with measured dominant colours (via IP‑Adapter), and an affine‑aligned vector template (via ControlNet). Two physical consistency losses constrain colour with a CIELAB chromaticity L_1 term and edge structure with a Sobel gradient term. We train by self‑supervised reconstruction on a large set of images collected in‑house at AMAP, then evaluate zero‑shot on the public TT100K‑2021 dataset, a different source. Our method uses a Stable Diffusion 1.5 backbone of about 1.4B parameters. It beats seven representative competitors on every metric of reconstruction fidelity, physical consistency and semantic controllability. Its OCR exact‑match rate reaches 91.1%, against 44.2% for the 12B industrial model FLUX.1 Fill [dev], and it needs only 1/14 of that model's inference time. Leave‑one‑out ablations confirm that each of the three prior pathways and both loss terms contribute on their own. In downstream detection, the synthetic data raises the group‑pooled AP50 of rare classes by 1.23× to 7.40× over a real‑data‑only baseline. Code and pre‑trained models are available at https://github.com/52hz‑whale/TrafficSignInpaint.
Authors:Atsuki Sato, Martin Aumüller, Yusuke Matsui
Abstract:
The PGM‑index (Ferragina and Vinciguerra, VLDB'20) is one of the most practical learned indexes, owing to its theoretical elegance and consistently strong empirical performance. It is built on optimal piecewise linear approximations (PLAs) that minimize the number of segments. In this paper, we ask how sensitive this optimal PLA itself is to poisoning attacks. We propose PGM‑attack, an efficient poisoning attack that sequentially inserts adversarial keys to inflate the resulting number of segments, and we develop a method for deriving theoretical upper bounds on the number of segments attainable under arbitrary insertions. Our experiments show that poisoning only 10% of the keys allows PGM‑attack to increase the segment count by up to 120x. On every evaluated instance, our instance‑dependent upper bound is at most 1.92x the segment count attained by PGM‑attack, certifying that PGM‑attack achieves at least 52% of the optimum. This increase in the number of segments enlarges the PGM‑index by up to 120x. Moreover, the attack also transfers to other learned indexes, substantially inflating the index size of PLA‑based ones in particular. Our results reveal that, despite the optimality of its PLAs, the PGM‑index has an intrinsic vulnerability rooted in its optimization objective, motivating robustness‑aware objective design for future learned indexes. Our code is publicly available at https://github.com/atsukisato/pgm‑attack.
Authors:Dun Dai, Ze Lu, Cheng He, Yaowen Wang, Quan Quan
Abstract:
Ultra‑low‑altitude unmanned aerial vehicles (UAVs) require surround vision near buildings, vegetation, and other obstacles. We present a parallax‑aware onboard platform that converts four synchronized fisheye streams into an open 1280x640 equirectangular panorama (ERP) interface. A purpose‑built carbon‑fiber airframe integrates the cameras, NVIDIA Jetson Orin NX, a flight controller, and a global navigation satellite system (GNSS) receiver. The formation pipeline selects projection depth per overlap and combines controlled seams and photometric fusion. Its accuracy profile adds content‑adaptive seam search and a validation‑gated residual mesh, whereas its deployed profile retains margin‑gated Per‑seam updates for sensor‑rate operation. Evaluation uses more than 50,000 four‑view groups from 18 field sequences. Relative to Fixed Depth, the accuracy profile reduces far‑field P90 feature misalignment by 41.6%; the deployed Per‑seam profile achieves the lowest aggregate geometric errors across held‑out sites. Under a paced 20 Hz replay, the deployed profile sustains 19.99 frames/s at 13.29W mean module‑input power. Eight‑sector ERP sampling reaches 90.8% mean daytime visual‑place‑recognition Recall@5. Together, these results validate an integrated onboard panoramic‑perception architecture that unifies parallax‑aware formation, sensor‑rate embedded execution, and reusable downstream vision interfaces for ultra‑low‑altitude UAVs. The project has been open‑sourced at https://github.com/DUNDAI1998/parallax‑aware‑uav‑panorama.
Authors:Quansheng Hu, Qin Sun, Qiansen Dai, Jin Ding, Wan Zhang, Xue Zhou, Jianxiao Zou
Abstract:
Referring multi‑object tracking (RMOT) aims to track every instance in a video that matches a given language expression. Despite the recent integration of multimodal large language models (MLLMs) to enhance generalization, existing methods predominantly relegate them to the role of caption generators, necessitating external modules for final decision‑making. This paradigm not only introduces extra latency but also severely underutilizes the inherent vision‑language alignment capabilities of MLLMs. To address these limitations, we propose YesTrack, a novel two‑stage RMOT method that reformulates referring as a discriminative task, directly leveraging MLLMs for Yes/No verification without explicit text generation. To further enhance the reliability and efficiency of this MLLM‑based verification, we introduce two lightweight temporal consistency constraints: Temporal Confidence Prior (TCP) and Temporal Reference Propagation (TRP). We further validate the generality of this discriminative paradigm by proposing YesTrack‑MOT, a straightforward yet highly effective instantiation for generic multi‑object tracking (MOT). Experiments on Refer‑KITTI and Refer‑KITTI‑V2 show that YesTrack significantly outperforms existing state‑of‑the‑art methods while maintaining high efficiency, even when implemented with the smallest variant of Qwen3‑VL. Code is released at https://github.com/ggbondrighthere24/YesTrack.
Authors:Axel Ahlqvist, Richard Guan, Juan-Pablo Rivera, Adeline Kassler, Dmitrii Troitskii, Alexandra Souly, Kai Fronsdal, Robert Kirk, John Hughes
Abstract:
A core obstacle to alignment evaluation is evaluation awareness: capable models can tell when they are being tested rather than deployed, weakening the conclusions a safety evaluation can support. We present two techniques that make simulated alignment evaluations harder to distinguish from real deployments. Our first technique, critique refinement, spends additional inference‑time compute on each simulator action: the simulator generates multiple candidate actions, refines them using feedback from an instance of the target model on how to make them more realistic, and continues the evaluation with the most deployment‑like candidate. Our second technique, DISH (Deployment‑Imitating SWE‑Agent Harness), wraps the target in an agent harness, reducing the gap between simulated and real deployment environments in coding settings. We test the techniques on multiple target models and find that they compose: applying both yields larger realism gains than either alone. Our results show that automated approaches can improve the realism of alignment evaluations, and that these improvements use additional compute more effectively than making the audits longer.
Authors:Yinghao Sun, Shuguang Li, Jinliang Shao, Tieshan Li
Abstract:
Detectors trained on closed‑set annotations can miss rare moving objects outside the training taxonomy. Automotive radar provides category‑independent Doppler motion cues and is less affected by adverse illumination and weather, but sparse, noisy returns hinder class‑aware 3D box detection. Surface location and velocity remain useful for motion reasoning and collision avoidance when full box geometry is difficult to recover. We present the Physics‑Aware Radar Transformer (PART), a fully sparse radar‑only detector that predicts existence confidence, a representative surface point, and 2D ground‑plane velocity for each moving‑object hypothesis. Doppler‑Aware Query Initialization (DAQI) replaces scene‑independent learned queries with input‑dependent proposals by clustering radar returns in position and velocity, easing query‑object assignment in sparse scenes. Physics‑Guided Cross‑Attention (PGCA) incorporates radial‑Doppler consistency and radar cross section (RCS) into query‑point association. Uncertainty‑aware supervision randomly masks ground‑truth objects and assigns soft existence targets to ambiguous radar‑supported queries, reducing reliance on exhaustive annotations. With only 1.1 million parameters, PART achieves a class‑agnostic average precision (CA‑AP) of 0.8827, a mean average surface translation error (mASTE) of 0.3188 m, and a mean average velocity error (mAVE) of 0.8084 m/s on nuScenes. It attains 0.9203 recall on rare and safety‑relevant categories excluded from the standard evaluation and remains effective at night, in rain, and under severe occlusion. Inspection of apparent false positives shows that some predictions correspond to moving objects absent from the nuScenes annotations. Code and pretrained model weights will be publicly available at https://github.com/sunyinghao‑uestc/PART.
Authors:Hayoon Kim, Eunice Hong, Kyogu Lee
Abstract:
Perceptual illusions have long served as crucial probes into human cognition, revealing biases and limitations of perception. In the auditory domain, such illusions provide a unique lens for testing whether Large Audio Language Models (LALMs) replicate human perceptual tendencies. Despite their importance, most benchmarks focus on visual illusions or general audio tasks, leaving auditory illusions underexplored. To this end, we present AIB, the first auditory illusion benchmark for LALMs, covering ten representative illusions across music, sound, and speech, each annotated for the presence of knowledge‑based priors. Our methodology pairs model evaluation with controlled human listening studies, enabling direct comparison of responses. Results show systematic differences: while most LALMs remain signal‑faithful on low‑level acoustic illusions, several exhibit more human‑like responses when linguistic or musical priors are involved, although no model matches the human perceptual profile. These findings highlight the current limitations of LALMs as cognitive models. By establishing auditory illusions as a rigorous testbed, our work offers a new perspective for probing neural black‑box models and advancing understanding of auditory cognition. AIB is publicly available at https://github.com/gillosae/aib.
Authors:Khawaja Murad ul Hassan, Mehran Ebrahimi
Abstract:
Post‑hoc saliency maps such as Grad‑CAM are increasingly used to audit why a deployed vision model made a decision, yet the heatmap drifts when the input is rotated, even when the prediction is unchanged. In domains with no canonical orientation, such as histopathology and aerial imagery, this undermines using saliency as evidence. We ask whether that drift is faithful signal or noise introduced by the CAM operator, and answer it by measuring equivariance at every stage of the operator rather than inferring it from the network's output. The instability is not where one would guess: the channel weights are the most rotation‑stable stage, and on ResNet‑50 exactly stable, because a GAP+linear head makes the class gradient field spatially constant. What moves is the spatial activation tensor, and the classifier's own pooling discards that movement. A causal test confirms the consequence: occluding the pixels whose saliency drifts costs the model less than occluding random pixels, at either orientation. The drift is carried by degrees of freedom the classifier throws away, which is what makes removing it faithful rather than destructive. EquiGrad‑CAM is a training‑free wrapper that takes T rotated views, inverse‑rotates each view's saliency into a common canonical frame, and averages. On the full ImageNet‑1K validation set it raises equivariance over single‑view Grad‑CAM by +36.0% (ResNet‑50), +87.5% (VGG‑16) and +247% (ViT‑B/16); a scale‑matched ablation isolates alignment before averaging, not the locus of aggregation, as the driver. It beats rotation‑augmented training without retraining, lifts zero‑shot CLIP by +145%, and yields rotation‑consistent explanations on PatchCamelyon and RESISC45. Its by‑product PEUM ranks explanations by how reproducible they are, at no cost beyond the views already taken. Code: https://github.com/Khawaja‑Murad/EquiGrad‑CAM
Authors:Zhaoyang Wang, Haiyong Chen, Binyi Su, Xinwei Lyu
Abstract:
Ensuring the reliability of deep learning models in real‑time industrial defect detection is critical for high‑stakes quality inspection. To mine uncertain samples within continuous industrial media streams, thereby enhancing the reliability of the detection system, this paper proposes a streaming active learning method based on the Fuzzy Dual‑dimensional Uncertainty (FuDU) framework. Specifically, we first design a Prototype‑based Global Uncertainty Quantification (PGUQ) module on the backbone to evaluate image‑level uncertainty via normal/defective feature prototypes. A Dual‑entropy defect Uncertainty Evaluator (DeUE) is then integrated into the detection head to quantify box‑level uncertainty. Finally, by modeling uncertainty as systematic error, we propose a fuzzy dual‑dimensional uncertainty‑aware strategy that leverages fuzzy inference to fuse dual‑dimensional uncertainties, enabling expert knowledge‑driven adaptive sampling decisions. Comprehensive experiments demonstrate that FuDU is efficient and flexible, making it well‑suited for challenging industrial inspection tasks such as the detection of nuclear fuel rod defects. Our code is publicly available at: https://github.com/wangzhaoyang‑508/FuDU.
Authors:Ha-Hieu Pham, Dang P. M. Cao, Minh Hoang Pham, Khanh Nguyen Vo Ngoc, Thanh-Huy Nguyen, Ulas Bagci, Huy-Hieu Pham
Abstract:
Portable ultra‑low‑field (ULF) MRI can expand access to pediatric neuroimaging, but segmentation at 0.064 T remains challenging because anatomical boundaries are weakly delineated, small structures may be only partially visible, and high‑field references can be locally misregistered. The LISA 2026 Challenge provides two non‑equivalent annotations reflecting different sources of anatomical evidence: a highfield‑derived (HF) mask defining the scored target and a low‑field‑edited (LF) mask aligned with visible ULF anatomy. In this challenge report, we describe AURA, an nnU‑Net‑based asymmetric supervision strategy that treats these annotations as distinct observations rather than interchangeable ground truths. AURA anchors training to the HF mask and incorporates the LF mask through a bounded reliability gate based on label disagreement, boundaries, predictive uncertainty, class reliability, and training stage. On a 16‑case development split, the HF‑supervised baseline, AURA, and their ensemble achieved Dice scores of 0.7984, 0.7950, and 0.7988, respectively, while the ensemble achieved an HD95 of 1.8892 and an ASSD of 0.7855. These results provide a preliminary evaluation of AURA within the LISA 2026 Challenge and motivate further assessment on the hidden test set and external ULF cohorts. Our code and pretrained models are available at https://github.com/minhdang050806/ A‑nnU‑Net‑based‑asymmetric‑supervision‑strategy.
Authors:Uicheol Jung, Juyoung Hong, Hojung Kwon, Yukyung Choi
Abstract:
Text‑Video Retrieval (TVR) retrieves videos that match a natural‑language query, but extending image‑text models such as CLIP to videos is fundamentally limited by the lack of temporal modeling. Videos exhibit frame‑wise heterogeneity in appearance and motion, and compressing all frames into a single representation often obscures temporal structure and semantic transitions. To address this, we propose Temporal‑Aware Mixture‑of‑Experts for Text‑Video Retrieval (TAME), a CLIP‑based framework that jointly models frame‑level structure and temporal relations. First, we integrate sparse Mixture‑of‑Experts (MoE) layers into both CLIP encoders and apply frame‑consistent routing on the vision branch so that experts specialize according to frame‑level visual patterns while preserving the original vision‑language alignment. Second, we introduce Frame‑Temporal (FT) tokens that aggregate global cross‑frame information and feed it back to each frame, enabling the visual encoder to capture long‑range temporal dependencies without harming local details. Third, we design a Cross‑Temporal Interaction and Aggregation (CTIA) module that refines frame‑wise sentence‑video similarities through staged temporal filtering and fusion. Experiments on standard TVR benchmarks show that TAME consistently improves over CLIP‑based baselines. On MSR‑VTT, it improves R@1 by 4.0 over CLIP4Clip, and also achieves consistent gains on DiDeMo, MSVD, LSMDC, and ActivityNet. The code is available at https://github.com/sejong‑rcv/TAME.
Authors:Shizhe Zhang, Mingyang Zhao, Lei Ma
Abstract:
Generative modeling directly on geometric manifolds can avoid errors introduced by flattening non‑Euclidean data, repeated ambient projection, and coordinate inconsistency in Euclidean representations. Schrodinger bridges provide a probabilistic generative framework for entropy‑regularized transport between prescribed endpoint distributions. We study Schrodinger bridges for kinetic dynamics on Lie group manifolds with state X_t = (g_t, xi_t) in G x g, allowing endpoint observations to constrain only the variables that are actually measured. In particular, the entropy projection determines the conditional law of the unobserved endpoint velocities. For the same observed endpoint bridge, we develop two computational realizations: Wrapped‑Kernel Bridge Calibration (WKBC) uses an explicit periodized kinetic kernel on compact Abelian groups, whereas Reciprocal Conditional‑Control Bridge Matching (RCCBM) handles compact non‑Abelian groups through two‑sided endpoint calibration and mollified conditional‑control matching. The canonical teacher‑mixture path law is itself a Markov reciprocal law, so forward generation uses a calibrated initial law and one learned Doob controller. Moreover, we establish a modular error bound in the bounded‑Lipschitz path metric that provides a clean separation of errors due to endpoints, control regression, initialization, discretization, and related approximations. Experiments on multiple Lie group manifold datasets validate the feasibility and consistency of our proposed method, covering protein and RNA torsions, SO(3), U(n), and the Protein Conformational Transition Pathway Generation task using mdCATH trajectories in a compact reduced representation. The source code is publicly available at https://github.com/cafferyzhang12/Schr‑dinger_Bridge_on_LieGroup.
Authors:Haoxuan Zhang, Dinghao Yang, Kangning Zhang, Shaoyong Guo, Haisheng Li, Rui Yang, Ruijun Liu
Abstract:
Accurate prediction of bearing remaining useful life (RUL) is a key challenge for intelligent maintenance. Although deep learning‑based prediction methods have showed effectiveness, existing methods still have limitations in learning nonlinear bearing degradation processes and model interpretability. Especially in engineering applications, the "black box" nature of deep learning models can easily raise concerns about their reliability. Therefore, we propose a physics‑enhanced bidirectional multi‑order graph fusion network for interpretable bearing RUL prediction. Our network mines complementary information from both forward and backward degradation sequences. Specifically, our network introduces a multi‑order graph propagator to capture the local‑global degradation dependencies. A gated cross‑fusion mechanism is further designed to dynamically balance the feature contributions from both forward and backward directions. Then, our network stores representative historical degradation prototypes in dynamic memory, so that the final RUL prediction no longer depends solely on the current latent features, but is guided by reusable historical degradation knowledge. To reveal how our model learns the nonlinear degradation process, the feature mapping parts utilize the Kolmogorov‑Arnold network, which allows the nonlinear mapping to be visualized using learnable functions. Finally, a physics‑enhanced dynamic loss function is developed to help our network learn effective and reliable degradation representations. Extensive experiments on two public datasets show that our method achieves the lowest error while providing more conservative estimates than existing methods. Our code is available at https://github.com/IMGresearcher/PE‑BMGN.
Authors:June Park, Jun Kwon, Jonghyo Kim, Jongwuk Lee
Abstract:
Reasoning‑intensive retrieval addresses queries whose relevance cannot be identified by surface‑level matching, thereby requiring multi‑step reasoning. Because relevant documents rarely appear in the initial candidate set, retrieval systems suffer from the bounded recall problem. Existing methods iteratively expand a candidate pool at the document level over a corpus graph, examining each neighbor in isolation and drifting toward a narrow region of the corpus. To address this problem, we propose Group‑Aware Adaptive Retrieval for Evidence Navigation (GAREN), which explores the corpus graph through group‑level expansion. GAREN organizes documents into semantically coherent and distinguishable groups based on their connections in the corpus graph. The information in each group indicates what can be accessed by expanding through it, providing guidance beyond individual document‑level signals. At each iteration, GAREN uses a group‑level navigator to identify promising expansion directions, retrieves documents from the selected groups, and applies a document‑level reranker to evaluate the updated candidate set. Extensive experiments show that GAREN achieves up to 8.0% improvement over the strongest baseline on BRIGHT. The source code is available at https://github.com/KJ12124/GAREN
Authors:Kyungdae Park, Chae Eun Rhee
Abstract:
Dynamic four‑dimensional (4D) Gaussian Splatting has emerged as a powerful explicit representation for high‑quality view synthesis, yet existing methods still require tens to hundreds of megabytes per scene due to their heavy reliance on large multi‑resolution hash tables and high‑dimensional Gaussian attributes. This paper presents CC‑4DGS, a storage‑efficient and scalable framework that rethinks both deformation modeling and canonical attribute storage. First, we introduce a computational deformation field (CDF) that replaces large multi‑resolution learnable hash tables with deterministic dense hash encoding and compact neural decoders, enabling on‑the‑fly synthesis of deformation features while reducing deformation storage to only 1‑‑3 MB per scene. Second, we propose a compression of canonical point‑cloud attributes (CCA) pipeline that compresses high‑dimensional spherical harmonic appearance terms and auxiliary Gaussian attributes via conditional autoencoding, selective quantization, and residual codebooks, achieving 3‑‑5× point‑cloud reduction with negligible quality loss. Together, these components yield a unified representation that preserves real‑time rendering performance while reducing total storage to 20‑‑30 MB. Extensive experiments across the N3DV and Technicolor Light Field datasets demonstrate that CC‑4DGS achieves reconstruction accuracy comparable to state‑of‑the‑art methods such as Swift4D, while offering significantly improved storage efficiency and favorable runtime‑memory trade‑offs.
Authors:Gang-Hyun Park, Ju-Hyeong Lee, Hee-Youl Kwak, Dae-Young Yun
Abstract:
Multi‑bit watermarking for large language models (LLMs) enables content source tracing by embedding user‑identifiable messages into generated text. Existing methods face a fundamental trade‑off among extraction accuracy, text quality, and payload capacity. We propose WeaveMark, a robust and scalable multi‑bit LLM watermarking scheme based on coded payload spreading. WeaveMark shifts this trade‑off frontier by improving payload capacity through multi‑bit‑per‑token spreading, improving extraction accuracy through soft‑decision error‑correcting code, and preserving text quality through unbiased multilayer reweighting. It further introduces dedicated zero‑bit layers for reliable watermark presence detection. Experiments show large gains, especially for long messages and edited text. WeaveMark achieves 89.8% match rate for 32‑bit messages at 200 tokens, compared with 20.8% for BiMark. Under 10% substitution attacks on 16‑bit messages at 200 tokens, it maintains 86.0% versus 30.7%, while preserving text quality. Our code is available at https://github.com/qkrrkd90‑source/WeaveMark.
Authors:Piyush Sao
Abstract:
The Johnson‑Lindenstrauss (JL) lemma guarantees that a random projection of n points to m=O(\varepsilon^‑2\log n) dimensions preserves pairwise squared distances within relative error \varepsilon with high probability, and this dimension order is asymptotically optimal. In high dimensions, however, distances concentrate around a baseline while key geometric information lies in much smaller fluctuations. We show that the JL bound can therefore be uninformative about retained geometry: an independent Gaussian replacement map can satisfy it even though the replacement cloud is independent of the original data. We then ask how well any decoder can recover a feature f(D) of a squared distance D from a linear sketch. Under squared‑error loss, the optimal decoder is conditional expectation, so recovery defines a linear operator whose singular values quantify feature recovery. For isotropic Gaussian data (Σ=σ^2 I_d), we diagonalize this operator in closed form. For fixed k with m,d‑m\to\infty, its kth singular value satisfies \ell_k\approx(m/ d)^k/2. This yields three sharp consequences. A rank‑m sketch retains at most an m/d fraction of the variance of any feature of one squared distance. If m\to\infty and m/d\to0, the expected Kendall correlation is \frac2π\sqrtm/d(1+o(1)); for fixed q, nearest‑ neighbor agreement tends to 1/q. Yet one projection can satisfy the JL bound while mean Kendall correlation vanishes when \log n\ll m\ll d. After removing scale, Haar‑averaged retained covariance‑shape information is (m/d)^2. Thus JL distance preservation does not quantify the geometry available for comparison or inference.
Authors:Ziyuan Jin, Yuxuan Ge, Zheng Tian
Abstract:
Empathetic response generation requires models to decide not only what to say, but also how to respond to the previous speaker's affective situation. We formulate this as response‑side affective‑orientation control and use multi‑annotator emoji distributions as weak affective‑‑attitudinal evidence, rather than as output symbols or gold labels, to induce a latent control space that operationally approximates listener stance. We construct EmojiDialogue, an utterance‑level extension of EmpatheticDialogues with emoji votes and confidence scores, and propose EmoStance, which models source‑side affective expression, predicts a soft response‑side orientation from dialogue context and speaker roles, and steers a frozen instruction‑tuned LLM through continuous prefix embeddings. In blind pairwise evaluation with 20 annotators and 800 judgments, EmoStance achieves a 62.2% decisive win rate, with the clearest gains in contextual specificity and perceived responsiveness, while remaining complementary to external‑knowledge methods. Code, annotation metadata, and reconstruction scripts are available in our GitHub repository: https://github.com/18277390221/EmoStance.
Authors:Jun He, Deying Yu
Abstract:
Persistent AI agents construct autobiographical state through reflection, retrieval, and consolidation. Persistence changes availability, not epistemic standing: stored or retrieved material is not thereby supported. Untrusted inputs, prompt injections, and model inferences can therefore enter persistent state and later be presented as agent history or user commitments. We specify typed provenance and assertion guardrails for autobiographical assertion boundedness, a system‑relative release property requiring governed statements about the agent, user, or named relationships to satisfy accepted‑evidence, temporal‑validity, and disclosure policies. A typed provenance graph separates origin, dependency lineage, epistemic role, validity, and disclosure scope. A resolver evaluates authorized state projections and returns one evidential status, orthogonal conflict, staleness, and withholding flags, and a protected decision witness. A generate‑verify‑revise mediator then checks candidate semantic units before release and renders policy‑authorized status responses. Under explicit assumptions about extraction, predicate correctness, resolution soundness, view declassification, and channel mediation, we prove a conditional assertion‑boundedness contract. In an executable suite of 24 hand‑authored conformance cases, typed mediation passed none of 19 unsafe opportunities unqualified while preserving all five supported controls. The flat/prior and source‑tag comparison rules released 19/19 and 18/19 unsafe candidates, respectively. These results validate the encoded resolver and mediator obligations; they do not constitute an end‑to‑end evaluation of language models or retrieval systems.
Authors:Jiani He, Dingyan Shang, Yihua Xu, Shiqi Huang, Yan Lyu, Jize Li, Shangjing Tang
Abstract:
Reverse‑logistics operators often decide how to inspect and route returned assets before their condition is fully observed, while full inspection consumes scarce labor. Semantic Signal‑Assisted Decision Support converts return notes into a condition factor and a signal‑quality score that guide inspection depth and recovery allocation under shared labor capacity. We evaluate the framework in three synthetic benchmark scenarios spanning information technology decommissioning, aircraft maintenance, and consumer‑electronics returns. Across 30 paired simulation seeds, the keyword implementation improves net recovery value relative to a structured‑feature comparator with noisy full inspection while reducing inspection cost in all three scenarios. A risk‑blind comparator that skips inspection altogether still records higher value under the benchmark's purely economic objective. At matched inspection cost, score‑guided targeting adds 53.9 thousand United States dollars per batch in the aircraft scenario but has little economic effect in the other two configurations; phrase and large language model extractors provide further gains in the aircraft scenario. These results show how narrative evidence can support inspection allocation before recovery decisions are made.
Authors:Haobo Xu, Sirui Chen, Yuanchen Bei, Lingjie Chen, Yuchen Yan, Dongqi Fu, Jingrui He, Hanghang Tong
Abstract:
Diffusion language models (DLMs) have emerged as a promising alternative to the auto‑regressive paradigm. With bidirectional attention and any‑order generation, DLMs naturally fit infilling tasks, which require generating a middle span conditioned on both the prefix and the suffix. However, infilling is sensitive to the length of the span, while DLMs require the length to be fixed before generation. Although prior studies extend DLMs to dynamic lengths, they still suffer from two limitations. (i) Sensitivity to initial length. These methods require a preset length to initialize the search and are highly sensitive to this initial length, often yielding suboptimal results. (ii) Inference inefficiency. They either insert length‑changing operations during generation or repeatedly search for an appropriate length using multi‑step denoising confidence, both of which introduce substantial extra forward passes and computational cost. Therefore, we propose PILL (Probing‑based InfiLling with preset‑Length‑free decoding), an efficient infilling method for DLMs that requires no preset initial length and adds far fewer extra forward passes than baselines, substantially reducing inference time. Experiments show that, across five DLMs spanning different families, architectures, and training recipes on eight infilling benchmarks, PILL improves over the strongest baseline by +4.8 average pass rate on code and +6.0 BLEU‑2 on text, while running 1.82x faster than that baseline. The code is available at https://github.com/Hsu1023/PILL.
Authors:Peifeng Liu, Bin Li, Qingsong Zhang, Yangxin Yu, Leqing Chen, Xiaoye Qiu
Abstract:
The rapid progress of AIGC has made text‑centric image manipulation increasingly accessible, creating new forensic challenges that require not only authenticity detection but also spatial grounding and evidence‑based explanation. This paper presents our solution to the GenText‑Forensics Challenge at ACM Multimedia 2026. We propose an evidence‑guided detector‑localizer‑reasoner system, where an image‑level detector provides a global authenticity prior, a dedicated localizer extracts tampered regions as spatial grounding evidence, and an MLLM‑based reasoner generates structured forensic reports grounded in this expert forensic evidence. These modules are connected through a cascaded evidence flow: the detector gates the subsequent localization and prompting process, the localizer converts tamper responses into grounding boxes, and the reasoner is trained to synthesize the detector decision and localized evidence into the final report. As a key part of our method, we introduce iterative difficulty‑aware mining to improve localization quality and apply report‑mask consistency post‑processing to align report grounding with predicted masks. On the official hidden test set, our system achieves a final score of 0.638 and ranks second in the challenge, validating the effectiveness of the proposed evidence‑guided system. The code is available at https://github.com/peifengLiu42/ACMMM26‑evidence‑guided‑detector‑localizer‑reasoner‑system.
Authors:Huaiyuan Yao, Xiaoou Liu, Charles Fleming, Tianlong Chen, Hua Wei
Abstract:
LLM‑based multi‑agent systems have shown strong performance on complex tasks, yet continual improvement from interaction experience remains challenging. Existing self‑reflection methods build experience memories, but memories are mostly hard to invoke, refine, or scale, while agent skills offer a more actionable unit: structured procedural knowledge that specifies when to act, how to act, and which resources or tools to use. We introduce MASkills, a continual learning framework that optimizes multi‑agent LLM systems through agent skills. MASkills presents a new agent‑optimization pipeline that integrates skill‑conditioned credit assignment, hierarchical credit aggregation, and momentum‑smoothed optimization, enabling agent skill libraries to evolve through refinement, induction, consolidation, and pruning. Experiments on HotpotQA, LoCoMo, and GAIA demonstrate the effectiveness of MASkills across multiple agentic tasks. Our code is available at https://github.com/DaRL‑GenAI/MASkills
Authors:Seungyoon Choi, Hyunchul Kim, Jae-Gil Lee, Chanyoung Park
Abstract:
To address the sequential and evolving nature of time series, the Online Time Series Forecasting (OTSF) task has been extensively studied in multiple domains. Existing research focuses on adapting to non‑stationary environments by employing memory buffer‑based retrieval strategies. However, we observe that such frameworks struggle with long‑term adaptation and fail to generalize to unseen patterns. To this end, we introduce CoSPOT, an LLM‑based online time series forecasting framework that leverages a pre‑trained LLM as the backbone online forecaster, motivated by its strong few‑shot capabilities. For efficient online adaptation, CoSPOT keeps the LLM frozen and employs compositional spectral prompts grounded in frequency‑domain bases to guide the model with the overall distribution of the input, thereby substantially reducing the number of parameters updated during the online phase. Specifically, CoSPOT decomposes time series into frequency bases and composes the corresponding spectral basis prompts according to their amplitudes, allowing unseen patterns to be represented as new combinations of learned basis prompts. Our extensive experiments on real‑world datasets demonstrate the superiority and practicality of CoSPOT across challenging online scenarios, including extended online phases and cross‑dataset settings with substantial distribution shifts. Our code is available at https://github.com/seungyoon‑Choi/CoSPOT.
Authors:Tianqi Xiao, Shiyao Cui, Minghao Zhang, Junxiao Yang, Renmiao Chen
Abstract:
Visual modality enhances the capabilities of multimodal large language models (MLLMs) but also introduces a safety concern: a benign textual query may convey harmful intent when grounded in a visual image. We term this cross‑modal safety drift and our pilot studies show that the safety response rate for such requests is substantially lower than that for requests containing explicitly unsafe text. This paper aims to systematically study this issue. First, we conduct an empirical analysis to identify representative unsafe response patterns. Building on these, we interpret model representations and attentions, revealing that visually risky cues receive limited attention and weakly trigger refusal. Motivated by the observation that safety signals from unsafe text processing can be transferred, we propose safety‑awareness representation transfer (SRT), a lightweight direction‑refinement method that mitigates cross‑modal safety drift with a frozen MLLM backbone. Experiments across multiple benchmarks and models show that SRT effectively improves safety in diverse cross‑modal settings while preserving utility. Code is available at https://github.com/cucu220123/safety‑awareness.
Authors:Yongshi Ye, Tian Lan, Feihu Jiang, Muyang Ye, Bin Zhu, Qianghuai Jia, Longyue Wang, Zhao Xu, Weihua Luo, Xiaodong Shi
Abstract:
Planning is a central capability that enables agents to decompose complex long‑horizon tasks into manageable steps. Test‑time search and training‑based methods improve planning but incur high inference costs or require expensive training data. Self‑evolving memory instead accumulates reusable experience from agent interaction outcomes into an external memory bank, so planning capability keeps improving at inference time without parameter updates. However, existing self‑evolving memory methods share an inherent credit assignment problem: they rely on final task outcomes as feedback, but such outcomes conflate plan quality with execution errors and environmental factors, so the accumulated planning experience is often biased and noisy. To address this problem, we propose Credit‑Aware Hierarchical Memory Evolution (CHIME), a self‑evolving memory framework that maintains a separate planning bank and execution bank and follows an attribute‑before‑memorize principle: CHIME first attributes each task outcome to the plan, the execution, both, or neither, and then updates only the corresponding memory bank. Extensive experiments on four long‑horizon agent benchmarks show that CHIME consistently outperforms state‑of‑the‑art training‑based and self‑evolving memory baselines. Further analyses reveal several interesting findings. For example, CHIME accumulates effective memory with far fewer items. In addition, the learned memory values faithfully reflect downstream utility: high‑quality planning memories are more valuable than execution memories. Finally, the accumulated memory effectively transfers across backbone models. Code will be released at https://github.com/ATH‑MaaS/Marco‑DeepResearch.
Authors:Zhente Zhang, Zhengwei Ni, Wei Fan
Abstract:
Probabilistic multivariate time series (MTS) forecasting is crucial for modeling complex dynamical systems. However, existing diffusion‑based methods rely on task‑specific conditional paradigms that lack flexibility and struggle with inherent "information heterogeneity"‑‑the significantly varying noise levels and evolutionary patterns across variables. To address this, we propose DynG‑Diff, a variable‑sensitive dynamic guidance diffusion framework for probabilistic multivariate time‑series forecasting: (1) DynG‑Diff adopts a two‑stage separated training strategy and uses an unconditional diffusion backbone to model the joint distribution of multivariate time series. (2) DynG‑Diff introduces a lightweight state‑aware policy network that adaptively infers variable reliability from real‑time noisy states and one‑step denoising estimates, outputting a dynamic guidance strength matrix. (3) DynG‑Diff mathematically formulates this dynamic weight as the local precision of the observation distribution, enabling precise guidance for high‑confidence variables during inference while filtering out interference from anomalous noise. Extensive experiments on real‑world benchmarks demonstrate competitive probabilistic forecasting performance against state‑of‑the‑art conditional diffusion models and improved robustness under severe observation corruption.The implementation code is available at: https://github.com/TT‑20011031/DynG‑Diff
Authors:Tingyan Wen, Chenqian Yan, Xurui Peng, Xiazhang Fang, Shuai Wang, Xueqian Wang, Songwei Liu
Abstract:
Few‑step diffusion models substantially compress temporal computation, making the spatial cost of each model evaluation an increasingly dominant source of inference latency. Progressive‑resolution inference reduces this cost by performing early denoising at low resolution and reserving high‑resolution computation for refinement. However, existing methods typically lift intermediate latents directly and rely on subsequent steps to absorb the induced distribution mismatch. In the few‑step regime, the limited recovery budget leaves these errors as visible artifacts, constraining how late the transition can occur and, consequently, how efficiently it can be performed. We introduce SelfLift, a self‑recovering progressive‑resolution framework that derives both transition‑repair signals and trajectory‑aligned supervision from the generative model itself. SelfLift‑zero proposes a training‑free Artifact‑Aware Consistency Lift, using disagreement between direct latent lifting and pixel‑VAE re‑encoding as both a localized artifact‑risk signal and a model‑native correction direction. It enables reliable late transitions without external super‑resolution, extra denoiser evaluations, or sampling‑schedule modifications. Building on this robust transition, SelfLift‑rich performs On‑Policy Self Recovery on student‑visited states, transferring dense high‑resolution guidance from an internal self‑teacher while remaining aligned with the altered progressive‑resolution dynamics. Across FLUX.2‑Klein and Z‑Image‑Turbo, SelfLift reduces end‑to‑end latency by 41.5% and 44.1%, respectively. Combined with timestep distillation, it delivers overall speedups of 29.61x and 19.21x over the corresponding 50‑step models while preserving competitive generation quality, establishing a stronger speed‑quality frontier for few‑step diffusion.
Authors:Ziquan Liu, Zhewei Zhu, Xuyang Shi
Abstract:
Accurate segmentation of polyps and skin lesions is pivotal for clinical diagnosis, yet existing methods struggle with low contrast, ambiguous boundaries, and cross‑domain distribution discrepancies. Discriminative networks and most diffusion‑based segmentation approaches predict standalone binary masks, leaving the visual priors of large‑scale pretrained generative models largely unexploited. We propose InstEditSeg, a unified generative framework that reformulates medical segmentation as an instruction‑driven image editing problem. Instead of emitting a mask, the model renders a color‑coded overlay on the original image, conditioned on a textual instruction, so that the edited output aligns with the natural image distribution learned by latent diffusion models and mitigates the domain gap between natural and medical imagery. To recover fine anatomical structures, we introduce DINOv3 as an auxiliary visual encoder and a DINO Feature Guidance Block that builds a multi‑scale feature pyramid. The pyramid is fused into the diffusion U‑Net by channel concatenation and zero‑initialized convolution so that hierarchical discriminative priors can be injected without perturbing the pretrained weights. A dual‑branch classifier‑free guidance strategy requiring only two forward passes per denoising step reduces inference cost. On polyp and skin lesion benchmarks the framework achieves accuracy competitive with strong discriminative baselines, and it further demonstrates concrete advantages of the generative formulation: notably better cross‑domain generalization on unseen data, more complete multi‑lesion segmentation, instruction‑conditioned task control, and sampling flexibility. We also analyze the strengths and limitations of the paradigm, including its color sensitivity and unsupported attribute‑conditioned selection. Code is available at: https://github.com/wincharm001/InstEditSeg.
Authors:Akio Hayakawa, Yusuke Mukuta, Tatsuya Harada
Abstract:
We propose LF‑MultiDiffusion, a training‑free panorama generation method that extends MultiDiffusion to support linear projections between target and reference image spaces. Our key idea is to reformulate latent aggregation as a regularized least‑squares problem and solve it efficiently with a Krylov‑based iterative solver inside the denoising loop. This formulation enables denser and more natural mappings than prior training‑free methods, yielding more stable generation with far fewer perspective views. As a result, LF‑MultiDiffusion reduces the number of image generator evaluations during denoising and significantly improves inference efficiency. Experiments show that LF‑MultiDiffusion achieves better visual quality, text alignment, and panoramic consistency than the strongest training‑free baseline, while providing a 15.36× speedup. Our project page is available at: https://ahykw.github.io/lfmd.
Authors:Chen Wang, Junzhe Zhao, Xin Cong, Wanlu Deng, Ke Deng
Abstract:
Large language models (LLMs) are increasingly used as assistants for statistical and data science work, yet existing evaluations largely assume the analysis target is already specified. In practice, users arrive with informal goals and heterogeneous data, leaving the model to decide what statistical task is implied and which data are relevant. We first formalize this upstream step as Statistical Problem Formulation and decompose it into two subtasks: (1) Statistical Problem Classification and (2) Variable Identification & Role Assignment. We then introduce StatFormBench, a benchmark built from five cross‑domain statistics textbooks and a data science case library, covering diverse problem types, data representations, and scenario styles. It contains 1,013 samples spanning 20 coarse‑grained and 85 fine‑grained statistical problem categories. Across 14 open‑ and closed‑source LLMs, the best zero‑shot models reach only 72.0 fine‑grained classification accuracy and 63.2 variable set overlap. No model performs consistently best across the two subtasks, while enhanced prompting strategies yield only limited or inconsistent gains. We release the benchmark data on Hugging Face at https://huggingface.co/datasets/THU‑CongLab/StatFormBench and the evaluation code on GitHub at https://github.com/THU‑CongLab/StatFormBench.
Authors:Hugo Schnoering, Roman Bresson, Michalis Vazirgiannis
Abstract:
Bitcoin's pseudonymous nature makes it challenging to analyze user‑level activity, since a single user may control multiple identifiers (addresses). Existing heuristic‑based methods attempt to identify addresses belonging to the same user, but they often produce flat cluster assignments with limited modularity and are prone to errors such as merging different users together. In this work, we propose a method for refining heuristic‑obtained clusters by grounding our clustering on contrastive embeddings yielded by graph neural networks. Our contributions are threefold: (i) we release a publicly available dataset of Bitcoin transaction graphs containing a substantial number of clusters; (ii) we propose a methodology for learning address embeddings consistent with heuristics, and back it up with theoretical guiding intuitions; (iii) through hierarchical clustering, we enable a finer analysis of heuristic clusters and provide a quantitative criterion for flagging suspicious merges.
Authors:Matteo He, William F. Shen, Xinchi Qiu, Nicholas D. Lane
Abstract:
A language model's prediction of its next token develops across layers, and lens methods track this process by decoding intermediate hidden states into tokens. But a lens reading reflects both the hidden state and the readout (the unembedding matrix) used to decode it. Many lenses are fit on a corpus, and we show that two lenses differing only in their fitting corpus can report different tokens for the same hidden states. We call this dependence corpus conditionality. To examine readout structure independently of the fitting corpus, we introduce Sparse Readout Prism (SRP), which decomposes the readout using only its weights and expresses any token logit or logit difference as a sum of contributions from sparse readout features. This reveals readout features as a new unit of analysis for lens readings, exposing structure that token identities can obscure and enabling comparisons across tokens, contexts, layers, and lenses. Replacing the original readout with SRP's sparse approximation reconstructs 8.9‑17.3 percentage points more of the tested logit differences than the strongest of six baselines built on geometric relations among readout rows. Ablating features shifts logit differences in proportion to their SRP contributions. Although token readings vary with the fitting corpus, the dominant readout feature remains stable. Because SRP uses no corpus in its construction, it provides a control independent of the fitting corpus for lens analyses.
Authors:Marc Bara
Abstract:
Multi‑agent AI systems improve inference by spawning agents and synthesizing reports. But another agent is not another observation: apparently independent reports may descend from the same evidence, and genuinely independent evidence can produce nearly identical reports. We formalize this as an epistemic Sybil problem. A report Z is an epistemic Sybil extension relative to reports R when I(Theta; Z | R) = 0. No report‑only aggregator can generally distinguish replication from independent corroboration: identical reports can warrant different posteriors under unobserved ancestry. A Gaussian shared‑root model shows common ancestry does not imply complete redundancy. Repeated extraction adds information toward a source‑level ceiling, and correlated extraction errors, which a shared base model can induce among independent agents, lower that ceiling further. We test these predictions with more than 20,000 controlled LLM‑agent report and extraction calls on synthetic evidentiary documents. Holding one evidence root fixed while report multiplicity rises from 1 to 32 collapses naive posterior coverage from 0.940 to 0.263. Holding report count fixed while evidence‑root multiplicity rises from 1 to 16 closes the gap, and the aggregators are statistically indistinguishable at k = 16. The agent's replicate extraction errors are correlated (gamma_cal = 0.719, estimated out of sample), and a correlated‑extraction aggregator restores calibration accordingly. A controlled manipulation isolates representation similarity from evidential ancestry. It changes a report‑space deduplication mechanism's mean inferred cluster count by 1.425 (95% CI [1.363, 1.485]), whereas a fourfold change in true ancestry changes it by only 0.040 ([‑0.045, 0.120]). Collective inference should therefore track evidential ancestry and dependence, not agent or report multiplicity or similarity.
Authors:Zhengxiong Li, Tsung-Wei Huang, Umit Ogras
Abstract:
NVIDIA distributed shared memory (DSMEM) enables direct shared‑memory access within a thread block cluster. However, cluster synchronization, remote access, and resource costs make it difficult to determine when DSMEM improves performance. To fill this gap, we propose CREDIT, a cost‑guided framework that identifies DSMEM‑profitable workload patterns, predicts their profitability range, and delivers consistent speedups across diverse workloads. CREDIT combines three innovations: (1) a profiling‑driven characterization that identifies workload patterns likely to benefit from DSMEM; (2) a transformation that applies DSMEM to reduction‑reuse workloads; (3) a cost model based on profiling data, to determine its profitability range. Evaluations on diverse workloads show CREDIT achieves 91.7% prediction accuracy on profitability. CREDIT beats torch.compile, Triton, and optimized non‑DSMEM CUDA baselines on all six workloads, with geometric‑mean speedups of 1.466x on RTX 5090 and 1.318x on H100. CREDIT's source code is publicly available at https://github.com/zhengxiongli08/CREDIT.
Authors:Chen Chen, Mohsen Nayebi Kerdabadi, Dongjie Wang, Mei Liu, Zijun Yao
Abstract:
Longitudinal prediction from electronic health records (EHRs) is limited by the sparsity and irregularity in patient trajectories, and knowledge augmentation with external knowledge graphs (KGs) offers a promising way to alleviate these issues. However, most existing methods perform fixed, context‑agnostic topology augmentation by adding the same KG nodes and edges regardless of a patient's evolving state. We propose ReTA, a Reinforcement learning‑based dynamic Topology Augmentation framework that casts KG import as a per‑visit, budget‑aware policy. ReTA first constructs an offline refined pool of KG‑grounded templates, then learns a policy to select one augment action per visit from three options: Soft Import, which enriches node features without modifying graph topology, Hard Import, which grafts a compact KG subgraph onto the visit graph to create message‑passing shortcuts, and Skip, which leaves the visit unaugmented when the base encoder is already confident. To stabilize learning, ReTA employs a decoupled encoder that processes semantic and structural signals in separate channels and fuses them via adaptive gating. Experiments on MIMIC‑III and MIMIC‑IV across diagnosis prediction, mortality, and readmission show that ReTA consistently outperforms strong baselines while remaining efficient, transfers across datasets and knowledge graphs, and yields interpretable augmentation patterns. The robust gains under sparse supervision highlight the advantage of ReTA's dynamic decision to import knowledge, boosting accuracy while curbing costs.
Authors:Brian Nlong Zhao, Zhuoyang Pan, James M. Rehg, Jiajun Wu, Shangzhe Wu
Abstract:
Understanding animal motion is fundamental to modeling animal behavior and biomechanics, yet progress in this area lags far behind human motion research due to the scarcity of high‑quality motion data. While human motion can be captured in controlled environments, it is impractical for most animal species, resulting in small, domain‑limited datasets that restrict downstream applications such as animation. To address this challenge, we introduce Kirin, a framework that reconstructs motion from video, learns motion priors at scale, and generates realistic motion that can be directly applied to animated assets. Using large collections of in‑the‑wild animal videos, we reconstruct 3D motion sequences and pair them with captions to create AiM3D, the first large‑scale dataset offering aligned video‑text‑motion tuples for quadruped animals. Building on this dataset, we develop a visual‑guided motion generation model that conditions on both text and image to guide the generation of realistic motion across diverse animal species. Finally, by leveraging an off‑the‑shelf image‑to‑3D model, we automatically rig and animate 3D meshes using generated motion, producing ready‑to‑render animated animals. Together, our dataset and framework establish a new foundation for large‑scale, text and image conditioned animal motion generation and animation. Project page: https://kirin‑ani.github.io/.
Authors:Mohammad Arif Rasyidi, Omar Alhussein
Abstract:
Dynamic maximum inner‑product search (MIPS) returns the K stored vectors with the largest dot products with a query while allowing the dataset to change through insertions, replacements, and deletions. For edge retrieval, the challenge is to achieve high recall and fast queries without making updates expensive. Full‑vector scanning keeps updates simple but compares each query with every stored vector, while indexed methods reduce query cost at the expense of maintaining additional structures during updates. We propose ETAR, an index‑free method that reduces query work while preserving simple updates. ETAR keeps the query coordinates with the largest squared values until they cover most of its total squared magnitude and treats the rest as a low‑magnitude tail. It estimates similarity from the retained coordinates using a compact lower‑precision representation, corrects for skipped coordinates, and reranks a fixed number of candidates using full‑precision vectors. Across five runs on nine static datasets, ETAR averages 99.2% Recall@10, the fraction of exact top‑10 results recovered, while running over 4× faster than exact scanning at a representative setting. This speedup also extends to an ARM‑based mobile device, where ETAR is up to 6.9× faster across four synthetic distributions. Under five streaming workloads, it maintains 100% Recall@10 at every measured point without index rebuilds. Overall, ETAR offers a practical middle ground for dynamic MIPS by reducing query cost while retaining simple, index‑free updates. Code is available at https://github.com/arasyi/etar‑mips.
Authors:Wei Hu, Xiaolong Tu, Dawei Chen, Yitao Chen, Kyungtae Han, Haoxin Wang
Abstract:
Large language models (LLMs) are increasingly deployed on mobile devices, making energy efficiency a key deployment constraint, yet the energy impact of prompt design remains underexplored. This paper aims to understand how two prompt properties, cognitive load and phrasing pattern, shape the energy behavior of on‑device LLM inference. We conduct a broad empirical study covering prompt properties, datasets, models, and devices, with phase‑level profiling that separates prefill and decode energy. We find that cognitive load primarily affects the energy cost per token, while phrasing pattern affects energy largely through token usage. Our energy‑quality analysis further shows that prompt design reshapes the attainable frontier differently across models, highlighting the need for model‑aware prompt design in energy‑efficient on‑device LLM inference. Code, datasets, and scripts are available at https://amai‑gsu.github.io/PromptProperty/.
Authors:Atif Belal, Lilian Hollard, Marco Pedersoli, Eric Granger
Abstract:
Vision‑language object detectors (VLODs) achieve strong zero‑shot performance but remain vulnerable to distribution shifts during deployment. Mean‑teacher methods for test‑time adaptation (TTA) can improve robustness by updating a student model using teacher‑generated pseudo‑labels. However, mean‑teacher TTA is highly sensitive to the choice of a fixed exponential moving average (EMA) coefficient for teacher updates, and repeated optimization with noisy pseudo‑labels can cause cumulative student drift. We propose Dynamic EMA and Source Anchoring for TTA (DESA‑TTA), a low‑overhead method that jointly regulates teacher updates and student drift through dynamic temporal averaging and source anchoring. Dynamic temporal averaging estimates teacher uncertainty from pseudo‑label confidence and box density and uses it to select a sample‑wise EMA coefficient within bounds determined by teacher parameter drift. Source anchoring partially restores the updated student parameters toward their pretrained values, with the anchoring strength increasing according to student drift. Experiments across diverse distribution shifts and two VLOD architectures show consistent improvements over existing TTA methods. On VOC‑C, DESA‑TTA improves AP_50 by 14.5 points over zero‑shot inference while achieving 55% higher inference throughput than the previous state‑of‑the‑art TTA method for YOLO‑World. Our code: https://github.com/imatif17/DESA‑TTA
Authors:Anagha Dhekne
Abstract:
Persisted machine‑learning models can remain byte‑identical while the software environments in which they are loaded evolve, creating a verification problem that artifact integrity checks alone cannot expose. This paper presents Modelstamp, a lightweight Python persistence library for verifying artifact integrity and represented runtime‑environment state before deserialization. At persistence time, Modelstamp associates a serialized artifact with a sidecar JSON manifest containing a SHA‑256 digest, runtime metadata, and installed versions from a bounded tracked‑package set; a separately recorded model‑relevant subset determines which package versions participate in drift comparison. Optional HMAC authentication supports workflows in which the producer and verifier share a secret key. At verification time, the artifact and represented current environment are checked against this recorded evidence before the model is deserialized. Modelstamp is evaluated using 14 controlled environment‑drift scenarios, eight controlled trust‑boundary scenarios, and an artifact‑size scaling benchmark from 10 MiB to 1 GiB. The controlled drift experiments behaved as specified across relevant dependency changes, unchanged environments, and unrelated environmental changes, including broader noise controls. The trust‑boundary experiments similarly confirmed both intended detections and expected limitations, including shared‑key forgery and replay. Median verification time increased from 0.032 s at 10 MiB to 3.334 s at 1 GiB, with measured throughput of approximately 307‑312 MiB/s in the benchmark environment. These results characterize Modelstamp as a complementary pre‑deserialization reference‑state verification control rather than as a replacement for dependency‑management systems, malicious‑model detection, safe deserialization, or public publisher authentication.
Authors:Song Jin, Zhongtao Jiang, Chenglei Shen, Huanxuan Liao, Haozhe Chi, Zhiwei Wang, Kun Xu, Yong Liu
Abstract:
Large‑scale video retrieval requires embedding models to encode long and diverse videos under tight visual‑input and inference budgets. Existing methods typically sample a small, fixed set of frames at their original resolution, limiting temporal coverage and ignoring frame importance. Our empirical analysis shows that expanding temporal coverage improves retrieval even under a fixed visual‑input budget. Gains are larger when the original per‑frame resolution is preserved, highlighting the complementary roles of temporal coverage and spatial fidelity. Motivated by this finding, we propose AllocEmbed, an allocate‑then‑embed framework that reallocates a fixed visual‑input budget across more frames. A lightweight allocator uses low‑cost previews to assign frame‑wise resolutions before the embedding backbone, preserving more detail where it most benefits retrieval while reducing visual cost elsewhere. We further introduce Retrieval‑Driven Policy Optimization (RDPO), which learns the allocator directly from retrieval feedback using a rank‑validated similarity gap and a confidence‑guided efficiency incentive. Operating entirely before the backbone, AllocEmbed integrates with existing retrieval systems without modifying the embedding model or downstream pipeline. Experiments on the MMEB‑V2 V‑QA and V‑RET tasks and our LongRet benchmark show that AllocEmbed achieves the best overall retrieval performance among the evaluated budget‑matched methods and transfers across embedding backbones. Our code is publicly available at https://github.com/jinsong8/AllocEmbed.
Authors:Summaiya Unnisa Begum, Mohammed Nadeem Ullah, Mohammed Abdul Ghani Khan
Abstract:
Carbon markets put a price on emissions, yet that price remains hard to forecast. Work in this area clusters on the EU and Chinese schemes, compresses regulatory text into a sentiment score, and reports accuracy without calibration or explanation stability. We distil ten recurring gaps into an impact‑feasibility matrix and propose EPA‑CarbonNet, a six‑layer architecture that fuses market series with policy text by cross‑attention and calibrated intervals alongside policy‑attributed explanations. We then build and test it on eleven years of daily S and P carbon index data. The findings are largely negative, and reported as measured: a random walk beats the model on five‑day RMSE (0.0365 against 0.0475), SHAP rankings agree at rho = 0.54 across resampled backgrounds, and policy attention never coincides with documented regulatory events. Directional accuracy, at 58.6 percent, leads every baseline. Code, data documentation and all result artifacts are available at https://github.com/Kimalice/Toward‑Explainable‑and‑Policy‑Aware‑AI‑for‑Carbon‑Credit‑Price‑Prediction
Authors:Gregor Gantner, Robin Smeets, Rob Stevenson
Abstract:
We study minimal residual space‑time finite element discretizations of linear parabolic initial value problems in canonical space‑time variational form. To deal with the arising dual norm, we introduce the Riesz lift of the residual as an additional variable. Quasi‑optimality of the primal variable of the mixed system follows from a uniform inf‑sup condition. This condition is known to be satisfied for finite element spaces w.r.t. prismatic partitions of the space‑time cylinder that allow for a decomposition into time‑slabs. We prove that this condition cannot be expected to hold otherwise. To recover stability for general partitions and the data at hand, we derive an a posteriori condition on the error between the exact Riesz lift of the residual and its Galerkin approximation ‑‑ being the secondary variable of our system ‑‑ under which the primal variable is quasi‑optimal. We derive a posteriori error estimators for both variables, and use them in a double‑adaptive loop that alternates test‑space with trial‑space enrichment. We illustrate our findings with numerical experiments in 1+1 and 2+1 dimensions.
Authors:Biraj Subedi
Abstract:
Mobile payment applications in Nepal are graphically mediated and largely inaccessible to visually impaired users. This paper presents SpeakPay, a voice‑first digital wallet, and documents the central technical contribution: a controlled study of domain adaptation for low‑resource financial speech recognition. We introduce NepFinSpeech‑403, a 403‑utterance dataset of Nepali financial voice commands (send, load, and balance operations spanning 237 unique numerals), and fine‑tune Whisper large‑v2 with LoRA. On the held‑out test set, the domain‑adapted model reduces Word Error Rate from 129.95% (zero‑shot baseline) to 42.58% ‑‑‑ a 67.2% relative reduction ‑‑‑ and improves Devanagari numeral recognition accuracy from 0.0% to 73.9%. We find that word‑level metrics understate the practical task‑level impact: domain adaptation improves the Transaction Success Rate from 1.67% to 33.33%, a roughly 20x gain. The improvement is consistent at the individual‑utterance level (sign test, p < 10^‑17) and across all command types. A data efficiency analysis shows that as few as 100 domain‑specific utterances are sufficient to halve the zero‑shot WER, with performance plateauing around 300 examples. Error analysis reveals systematic numeral confusion patterns (zero insertion/deletion, prefix hallucination) that account for the majority of remaining transaction failures. The trained system is deployed as a publicly accessible voice‑first web application. All code, dataset, model weights, and this paper are released at https://github.com/subedibiraj/speakpay.
Authors:Akshita Gupta, Aditya Arora, Federico Tombari, Marcus Rohrbach, Anna Rohrbach
Abstract:
Audio Description (AD) provides spoken narration of visual events during dialogue gaps, making movies accessible to visually impaired audiences. The problem requires determining both what (which visual event) and when (position for inserting the AD) to narrate, to achieve the best user experience. Prior work has largely reduced the problem to video captioning of pre‑segmented video clips, i.e., what is largely predefined and when is ignored entirely. We propose Cue2Narrate, a two‑stage pipeline that jointly predicts what and when to narrate in longer untrimmed movie clips. A dual‑head audio‑visual localizer predicts two temporally distinct windows per AD utterance: a visual cue window and a spoken narration window. A LoRA‑adapted VLM then generates concise ADs from the predicted visual evidence, trained with a Description Ranking Loss that ranks captions (negative samples) of the same frames lower than the GT AD. To benchmark this new problem statement, we introduce the LongLSMDC benchmark with up to 8‑min movie clips (~6.5min on average). On LongLSMDC, Cue2Narrate outperforms video‑only and audio‑only localization baselines by 5‑‑12 points in avg. mAP. Under both predicted‑ and GT‑window evaluation, Cue2Narrate improves AD generation over the corresponding fine‑tuned base VLM. These results establish the first benchmark for multi‑segment AD generation on long‑form clips. Data & Code: https://github.com/multimodal‑ai‑lab/Cue2Narrate
Authors:Arpan Kumar Mahapatra
Abstract:
Safety properties assessed separately for Model Context Protocol (MCP) tool use and Agent2Agent (A2A) delegation need not describe behavior when one agent uses both. We measure one such behavior in a single controlled MCP‑to‑A2A configuration: a testbed drives a real‑model host across a local MCP and a local A2A leg into an ordered event trace scored by exact deterministic rules (no LLM judge), one restricted decision per trial. In a pre‑specified, frozen three‑arm design, each of 10 record scenarios appears with a CONFIDENTIAL header, with no header, and with PUBLIC ‑ OK TO SHARE; the six substantive record values are byte‑identical across arms, and the outcome is verbatim occurrence of any of them in the outbound message. Four models x 3 arms x 4 repeats give 480 trials; the scenario is the unit of generalization, and we report the 10 scenario‑level values (mean, median, sign counts), with no p‑values or intervals. The confidential‑minus‑unlabeled contrast is inconclusive and floor‑limited in every model (both arms at or near zero), so it does not show that confidential labels lack a protective effect. Adding PUBLIC ‑ OK TO SHARE is descriptively associated with higher verbatim egress relative to the unlabeled baseline, with strong model dependence: strong and consistent for Claude Sonnet 5 (public‑minus‑unlabeled mean +0.800, all 10 scenarios; mostly an association with whether Claude relays at all), moderate but floor‑limited for one GPT‑5.6 tier, small (median 0) for another, and a complete floor for the third. This is an association in one configuration, not a causal or general effect. Code, byte‑pinned traces, and the offline analysis pipeline are released as a public artifact.
Authors:Vahid Reza Khazaie, Ahmed Y. Radwan, Shaina Raza
Abstract:
Vision‑language models (VLMs) are increasingly used to make decisions from visual inputs. We introduce FAIRLENS, a benchmark and evaluation framework for measuring both the fairness and the validity of VLM responses in three high‑stakes domains: hiring, legal, and healthcare. FAIRLENS pairs real face images spanning gender, race, and age groups with closed‑ and open‑ended questions, giving more than 100K image‑question pairs per model, and evaluates responses from four complementary views: demographic parity over adverse outcome rates, soundness, demographic association over unsupported roles and statuses, and bias in free‑text generation. Soundness is the central validity criterion: a response is sound when it follows the evidence stated in the question and abstains when the image cannot support an answer. Evaluating eight VLMs, we find that the primary failure is unwarranted inference rather than unequal treatment. Models routinely infer qualifications, threat, illness, or professional role from a face instead of abstaining, and the weakest model does so on 99% of the questions its input cannot answer. These failures are most severe in legal and healthcare, where recognizing insufficient evidence matters most, and disparity metrics alone would miss them: parity gaps are small in absolute terms, yet when baseline adverse rates are low the same gap means one demographic group receives adverse labels several times as often as another, and a small gap can equally reflect a model that treats every group unsafely. Bias in free‑text responses is only loosely coupled to multiple‑choice accuracy, so correct structured answers do not imply safe generation. FAIRLENS shows that fair high‑stakes VLM behavior requires similar treatment across groups and refusal to infer high‑stakes attributes from appearance, and its question suite transfers to any face corpus with demographic annotations.
Authors:Muhammad Rehan, Haider Ali, Muhammad Ali Munir, Moaz Amjad
Abstract:
Vision models deployed on microcontrollers (MCUs) are quantized to integer‑only arithmetic and run in inference‑only runtimes that do not carry the machinery backpropagation needs: the standard tool for adapting a model to the distribution shift (sensor noise, blur, lighting) it meets in the field. Existing forward‑only test‑time adaptation (TTA) methods either run only on server‑ or edge‑GPU‑class models (not true microcontroller integer execution), or require the batch‑normalization (BN) layers that integer deployment fuses away. We present a forward‑only TTA method that operates on deployed, BN‑folded, integer‑only convolutional networks. The key observation is that fusing BN into the preceding convolution, a mandatory step for integer inference, destroys the statistics that normalization‑based adaptation relies on. We restore adaptation by re‑normalizing each folded convolution's per‑channel output to its clean training statistics, using only forward‑pass estimates. The method (i) recovers most of gradient‑based TENT's accuracy gain (+20.9 vs. +24.9 points) and matches forward‑only BN adaptation, while being the only method that runs on a folded integer‑only model; (ii) needs to adapt only 3 of 21 layers (selected without seeing the test corruptions) to recover 93% of the benefit; (iii) survives single‑sample streaming with a batch‑size‑scaled momentum; and (iv) generalizes across three datasets (up to 200 classes) and two architectures. We validate bit‑exact int8 convolution execution and deploy on an ESP32‑S3, where, measured with a Nordic PPK2 power profiler, the forward‑only adaptation (a lightweight fp32 recalibration around the int8 convolutions) costs only 8.3 mJ (6.8% of inference energy) and 21.9 ms on the deployed SIMD‑optimized model: forward‑only adaptation is cheap on a real microcontroller.
Authors:Ferdous Al Rafi, Susrik Mukherjee, Latika Liladhar Dekate, Jennifer Yawa Lavoe, Huaiyuan Yao, Shlok Mohanty, Longchao Da, Xuesong Zhou, Hua Wei
Abstract:
Reinforcement learning achieves strong traffic signal control performance in simulation, yet policies trained in simulators often fail once deployed in the real world, a failure known as the Sim‑to‑Real gap. When RL is applied to traffic signal control, this gap arises from several sources: sensing, action execution, traffic dynamics, and the control objective. Their relative impact and the reliability of existing Sim‑to‑Real mitigation methods remain insufficiently understood, and the field lacks a standard benchmark for systematically measuring the gap and evaluating mitigation methods. We present Sim2Signal, a benchmark that decomposes the Sim‑to‑Real gap into observation, action, transition, and reward gaps, corresponding to mismatches in the four components of the underlying MDP, and induces each gap in isolation under a shared protocol. We evaluate 18 mitigation methods on 2 base controllers, across 33 gap settings and 10 calibrated networks built from 5 real‑world locations. We find that direct transfer consistently degrades performance across all four gap sources, but the severity of the degradation does not predict the effectiveness of mitigation. Instead, mitigation effectiveness depends strongly on the network and gap setting: outside the action gap, a method that helps in one case may fail in another. The most effective methods generally estimate what the gap changes, rather than make the policy insensitive through domain randomization or invariant representations. Our code is available at https://github.com/Red‑Pheonix/Sim2RealTSCBenchMark
Authors:Safayat Bin Hakim, Houbing Herbert Song
Abstract:
Security teams and researchers choose knowledge‑graph extraction tooling for threat reports on the strength of published triple‑F1 scores, yet those scores depend on how predicted triples are matched to gold annotations. We could reimplement the stated matching rule for only five of twelve inspected systems. Re‑scoring ten system outputs on shared documents under eight protocols reverses eleven of forty‑five pairwise orderings; one fixed prediction set spans 0.16‑0.70 F1. On GRID's external 378‑item calibration set, no mechanical matcher (lexical, embedding, or entailment) agrees with multi‑reviewer adjudication above 71%, whereas an LLM judge reaches 86%. To separate component effects from matcher rewards, we build CTIForge, whose deterministic validation layer can vary while extraction is held byte‑identical. Across seven tested deployment configurations, validation raises precision for all four hosted backbones and lowers it for all three offline backbones. Because backbone, decoding, and backend‑specific prompting covary, this is a descriptive split rather than an isolated serving effect. It coincides with a roughly 2.8‑fold increase in actions explicitly disputing entity type, consistent with hand‑written rules encoding the conventions of the extractor against which they were developed. We release the pipeline, protocol suite, and per‑triple audit records.
Authors:Zekai Jin, Hanrong Zhang, Yihong Tang, Fei Hu, Zhen Dong, Yi Shao
Abstract:
For embodied systems, predictive agreement alone does not determine whether evidence warrants action; evidential origin matters. Repeated inference over one observation can multiply agreement without adding evidence, while source‑local values do not reveal whether outputs have separately countable origins. PACT treats evidence countability as a relational variable for provenance‑conserving fusion and typed action admission. A supplied provenance partition defines countable units. PACT retains coordinatewise support shared within each unit, accumulates only across units, and maps unmet release conditions to hold, confirm, or fallback. Under the stated assumptions, source‑local values cannot identify countability; the coordinatewise meet is the greatest budget satisfying singleton fidelity and insertion non‑amplification, with coarsening monotonicity and fixed‑partition stability. Across 31,200 evaluations in 48 scene clusters, PACT attains a common‑support normalized risk‑coverage area (ncsAURC) of 0.0861. Excluding the constructed adversarial‑consensus arm, provenance‑partition aggregation reduces ncsAURC by 0.0557 relative to singleton aggregation, while the corroboration contrast vanishes. On complete‑source records, native scores favor PACT, but a common posterior‑peak score narrows its difference from nested Dirichlet and favors product fusion. Reassigning provenance over unchanged predictions moves evidence budgets as predicted. In offline human‑robot collaboration, eightfold within‑camera duplication leaves 720 typed responses per checkpoint unchanged; camera‑grouped PACT admits 47 of 57 Qwen3‑VL‑32B reference‑consistent candidates with no observed reference‑inconsistent admission in 60 episodes. PACT separates computational from evidential multiplicity: agreement constitutes corroboration only when provenance permits separate accumulation.
Authors:Zhengxu Tang, Xiaozhou Zhang, Guofeng Cui, Ziyu Gong, Zi Wang, Yunfei Shi, Ruifeng Deng, Chengzhi Qi, Ke Chen, Sachin Patil, Tianjun Xiao, Langechuan Liu, Pichao Wang
Abstract:
Chain‑of‑thought (CoT) reasoning powers generative models by eliciting intermediate steps before producing an answer. In autonomous driving, the answer is a continuous action. Thus its reasoning must share the same spatiotemporal structure as the physical world. This survey studies the resulting shift from textual CoT to action‑grounded reasoning. Surveying 171 papers, including 130 method papers and 41 benchmarks, datasets, surveys, and analysis papers, we propose a representation‑centered taxonomy that treats the form of the intermediate state as the organizing axis. We systematize the 130 methods into four categories: language‑based, visual‑spatial, latent‑dynamic, and externalized reasoning, further divided into 13 subtypes tied to distinct regions of interests. Our synthesis shows that the open frontier of reasoning in driving agents lies in intermediate representations that can be grounded in the real world, coupled to real‑time action, and verified under safety‑critical systems. Project page: https://github.com/tangzhengxu/awesome‑av‑cot.
Authors:MinKeon Kim, Namjun Lee, Jaekwang Kim
Abstract:
Retrieval‑Augmented Generation enhances Large Language Models by grounding responses in external knowledge, but multi‑hop reasoning remains vulnerable to error propagation, where early retrieval failures confound subsequent steps. Standard outcome‑based optimization only rewards the final answer, leaving intermediate retrieval and reasoning errors undetected. While existing process‑based methods introduce step‑level signals, they still score each step against the final answer, rewarding spurious successes where flawed retrieval coincidentally produces the correct answer. Step‑level supervision in RAG requires evaluating both logical validity and evidential grounding at each step. We introduce PRO‑STEP: we train a generative PRM that evaluates both dimensions, employ PRM‑guided value tree search to construct preference pairs contrasting valid steps against flawed ones, and optimize the policy via step‑level Direct Preference Optimization. Experiments on single and multi‑hop QA datasets demonstrate that PRO‑STEP achieves the best average EM and F1 across five benchmarks. Code, models, and training data are publicly available at https://github.com/keemminnke/PRO‑Step.
Authors:Zichen Luo, Jiachen Guo, Keming Gu, Jie Zhang
Abstract:
Unified recommendation models aim to jointly model non‑sequential multi‑field features and sequential user behaviors, but existing interaction‑centric designs mainly focus on mixing heterogeneous tokens within each layer. We argue that scalable unified recommendation also requires controlling how intent information is carried, filtered, and preserved across stacked blocks. Inspired by flow‑based representation dynamics, we introduce feature transport, a view that treats deep unified recommendation as a discrete context‑conditioned representation evolution process. We propose CRAFT, a Contextual Residual Adaptive Feature Transport block, which summarizes non‑sequential features into a reliability‑aware contextual field and uses it to generate residual displacement and memory‑preserving signals for intent and sequence representations. In this way, non‑sequential context acts as an active controller of representation evolution rather than a passive object of interaction. In the TAAC2026 advertising recommendation competition, CRAFT achieves a test AUC of 0.838090, surpassing the previous leaderboard‑best score of 0.83798. Scaling experiments further show that CRAFT benefits from both depth and width expansion: stacking CRAFT to six blocks improves test AUC to 0.838148, while increasing the hidden dimension reaches 0.838106. These results demonstrate the effectiveness, scalability, and generalization potential of the feature transport paradigm. Source code: https://github.com/AshleyLuo001/CRAFT
Authors:Madhusudhana Naidu
Abstract:
The creation of telescope bibliographies is a crucial part of assessing the scientific impact of observatories and ensuring reproducibility in astronomy. This task involves identifying, categorizing, and linking scientific publications that reference or use specific telescopes. However, this process remains largely manual and resource intensive. In this work, we present an efficient SciBERT‑based approach for automatic classification of scientific papers into four categories ‑ science, instrumentation, mention, and not telescope. Despite strict context‑length constraints (maximum 512 tokens) and limited compute resources, our approach achieved a macro F1 score of 0.89, ranking at the top of the WASP‑2025 leaderboard. We analyze the effect of truncation and show that even with half the samples exceeding the token limit, SciBERT's domain alignment enables robust classification. We discuss trade‑offs between truncation, chunking, and long‑context models, providing insights into the efficiency frontier for scientific text curation.
Authors:Yuanhao Sun, Zhouyang Jin, Yi Xu, Luoyi Fu, Jiaxin Ding, Xiaoying Gan, Xinbing Wang, Chenghu Zhou
Abstract:
From‑Scratch Name Disambiguation (SND) groups papers sharing an ambiguous name into clusters of distinct real‑world authors. Existing methods suffer from two critical limitations: (1) inherent long‑tailed author distribution biases representation learning, causing over‑merging of tail authors; (2) existing cluster number estimation methods are unreliable for long paper sequences, hindering large‑scale deployment. We propose GRAND‑HC, a complete end‑to‑end SND framework. We construct a heterogeneous paper graph via co‑author, co‑organization, and co‑venue relations, using a graph attention network as the embedding backbone. Harmony Contrastive Learning (HCL) dynamically reweights training loss to suppress overfitting to prolific authors, learning discriminative embeddings. A Graph‑Refined Distance Matrix (GRDM) leverages graph topology to optimize pairwise distances, further preventing tail author over‑merging. Meanwhile, a lightweight Paper Compression Module (PCM) achieves accurate cluster number estimation across varying scales. Finally, Hierarchical Agglomerative Clustering outputs the final clusters. Extensive experiments demonstrate state‑of‑the‑art macro F1 performance. GRAND‑HC has been deployed in a billion‑scale academic database. Source code: https://github.com/baokou‑fw2/GRAND‑HC.
Authors:Alberto Acedo
Abstract:
A composite structural index summarises a network in one number; for a triangle‑based index it is spectrally redundant: Tr(A^3) is the third moment of the adjacency spectrum. The non‑redundant content sits one level down, in diag(A^3), which depends on eigenvectors and is not spectrally determined. A corollary in the theory paper for this index family stated that, and predicted: the global scalar should tie sharpened spectral baselines rather than beat them, while the node‑wise attribution should do better where the number of structural epicentres is unknown. This paper tests it. We construct Omega‑N by localizing each of the four factors. The direct localization is badly conditioned; two corrections from published practice fix it, a configuration‑null excess for every local factor and a personalized‑PageRank neighbourhood at several scales, giving ten interpretable features per node from the graph alone, with no attributes, training or embeddings. Against a recursive feature engine at five levels of recursion, Omega‑N wins on one and ties on four of six in‑domain node‑classification evaluations, with ten features against up to 252. Two statistics computed from the graph and labels, not from performance, partition the eight benchmarks without error, and the two they exclude are the two it loses. The strongest application is drug‑target prioritisation on protein interaction networks: +0.073 to +0.144 AUPRC over a centrality battery across four constructions, replicated on an independent AP‑MS network and label source, surviving three bias controls (degree‑matched, ten repetitions: +0.1047 and +0.1030, both 10/10, p=0.00195). The clearest negative sits in the same application: adding Omega‑N to centralities plus Node2Vec changes nothing (+0.0014, p=0.31). The claim is narrow: ten interpretable features
Authors:Md Jamil Ahmed, Mahdis Saeedi, Hossein Fani
Abstract:
Team recommendation aims to select an optimal subset of experts who can form an almost surely successful collaborative team for a given set of required skills. State‑of‑the‑art methods are neural multi‑label classifiers that transfer dense vector representations of skills into a sparse occurrence vector representing the optimal subset of experts. Such methods, however, overlook experts' relational and structural information encoded in the expert collaboration graph and, thus, fall short of capturing complex inter‑dependencies among experts and their associated skills within teams. Moreover, the skills' dense vectors are pretrained disjointly and independently of the underlying neural classifier, hence, preventing end‑to‑end optimization. In this paper, we propose to reformulate the team recommendation problem into end‑to‑end link predictions in the expert collaboration graph to consume multi‑hop intra‑team and cross‑team collaborations among experts while eschewing the unnecessary complexities of the disjoint two‑phase training procedure. Our experiments on two large‑scale datasets from various domains with distinct distributions of skills in teams demonstrate the superiority of the end‑to‑end approach and establish a new state of the art. Our code is available at https://github.com/fani‑lab/OpeNTF.
Authors:Xinning Li, Kemunto Ochwang'i, Aryasomayajula Ram Bharadwaj, Alexandra Souly, Robert Kirk
Abstract:
Frontier large language models can often recognize when they are being evaluated, a capability known as evaluation awareness. If models behave differently in evaluations than in deployment, this undermines the validity of evaluation results, which are a crucial component of current AI safety frameworks. We introduce EvalDetectBench, an open pipeline and benchmark for measuring evaluation awareness that works with any Inspect‑compatible evaluation, allowing practitioners to test against current and future benchmarks. EvalDetectBench ships with a newly curated transcript suite covering current frontier system‑card evaluations and diverse deployment sources. The benchmark serves two purposes: measuring how reliably frontier LLMs recognize that they are being evaluated, and assessing how detectable individual benchmarks are as evaluations. We identify two methodological choices in the existing literature that introduce systematic bias: the identity of the model that generated the deployment transcripts accounts for 11.25% of measurement variance and can reorder model rankings; and elicitation prompts selected for high performance on one model can perform near chance on others. EvalDetectBench corrects for both via per‑model probe calibration and a stratified generator‑harmonisation procedure.
Authors:Himil Vasava, Ming Jiang
Abstract:
LLM‑based evaluators of natural language generation (NLG) quality are widely deployed as scoring tools and as automated training signals, yet the internal procedure by which they assign a rating remains poorly understood. We investigate this procedure mechanistically through an eight‑attack perturbation taxonomy across the Readability and Adequacy dimensions of NLG quality, a generation pipeline that produces paired clean and corrupt summaries with controlled error intensity and explicit token‑level modification maps, and a four‑experiment battery of causal tracing, logit‑lens vocabulary projection, and attention‑head knockout applied to Themis (Llama‑3‑8B) and Prometheus (Mistral‑7B). Both evaluators implement a structured, coherent evaluation pipeline operating in two stages: below layer 15, attention performs local error comparison and routes the result to the final input position; above it, the MLP cascade integrates the signal and writes the rating, with the decision crystallizing in the residual stream at a sharp late layer (L = 26 on Themis, L = 25 on Prometheus). Furthermore, a base‑model control at the same scale (Llama‑3‑8B) reproduces the routing architecture and crystallization but not the stage separation, isolating the two mechanisms that fine‑tuning specifically installs, suppression of below‑L15 MLP contribution at the last position and a two‑layer advance of the crystallization depth, indicating that fine‑tuning sculpts an existing substrate rather than building the pipeline from scratch. We release the source code and data at https://github.com/himil‑v/judge‑mech
Authors:Kefeng Duan, Dewu Zheng, Yanlin Wang, Xiwen Wang, Ensheng Shi, Xilin Liu, Yuchi Ma, Jiachi Chen, Mingwei Liu, Zibin Zheng
Abstract:
Evaluating software engineering agents on realistic benchmarks is costly, since each task may require multi‑step code exploration, modification, and test execution. Existing efficient evaluation methods select representative subsets to estimate full‑benchmark performance, but are largely result‑only: they fit historical pass/fail response matrices or static task semantics, discarding how agents solve problems. We propose PTA‑IRT, a Privileged Trajectory‑Aware Item Response Theory framework that fuses process and outcome signals. Historical execution trajectories supply process‑level evidence beyond pass/fail, such as explored context, attempted edits, and solving paths, which PTA‑IRT uses as privileged information for calibration subset selection and ability estimation. Under low calibration budgets, PTA‑IRT consistently outperforms prior IRT baselines on score and ranking recovery across four SWE benchmarks. Code and data are publicly available at https://github.com/DeepSoftwareAnalytics/PTA‑IRT.
Authors:Kefeng Duan, Dewu Zheng, Yanlin Wang, Terry Yue Zhuo, Mingwei Liu, Jianxing Yu, Jiachi Chen, Ensheng Shi, Xilin Liu, Yuchi Ma, Zibin Zheng
Abstract:
The repository‑level code generation task requires synthesizing code that satisfies task requirements while remaining consistent with the target repository context. Since real‑world repositories often exceed the input length limits of LLMs, existing approaches commonly adopt retrieval‑augmented generation (RAG) to provide repository‑specific context. Despite improving repository‑context retrieval, existing methods typically provide context as task‑level support, without explicitly identifying the critical tokens that require fine‑grained repository context during generation. During the autoregressive generation process of LLMs, errors often concentrate at a small number of decisive positions: once such tokens are generated incorrectly, subsequent code may follow an incorrect semantic path and eventually lead to functional failure. We refer to these positions as "critical tokens". In this paper, we propose ACToR, an adaptive critical token‑aware retrieval framework for repository‑level code generation. ACToR identifies critical tokens during generation and triggers targeted retrieval on demand to provide repository context at these decisive positions. In addition, we design a position‑aware weighting method for dense retrievers to prioritize context that is more informative for generation. We evaluate ACToR on two representative repository‑level benchmarks, RepoExec and CoderEval. Experimental results show that ACToR consistently outperforms state‑of‑the‑art methods, achieving relative improvements of 8.4% on RepoExec and 15.4% on CoderEval. Beyond performance gains, we systematically quantify the impact of critical tokens, revealing their central role in major generation failures and highlighting the necessity of targeted retrieval strategies. We provide the code and data at https://github.com/DeepSoftwareAnalytics/ACToR.
Authors:Damien Sileo, Dimitri Kachler
Abstract:
Dynamic agent harnesses let language models change the software that shapes their own execution. This flexibility brings a new reasoning burden: a local plugin change can propagate through dependencies and cleanup. We introduce CordisBench, a 1,200‑question benchmark of this lifecycle reasoning. It combines a controlled formal setting with programs executed against Cordis, a runtime that manages component dependencies and cleanup, and asks models to identify affected components, predict state after a specified teardown order, determine which conditions hold under all or some orders, and choose reconfigurations that succeed when executed. Across these tasks, we evaluate three efficiency‑oriented models at low reasoning effort with 2, 4, 8, 16, 24, or 32 relevant interactions, using deterministic task‑specific scoring. Models usually handle small systems well but grow less reliable as more interactions become relevant, especially when predicting final state and when reasoning across teardown orders. Additional inference effort recovers marked gains for some models. The cost is nontrivial: on our 16‑interaction subset, GPT‑5.6 Luna uses nearly 3,000 reasoning tokens per question at medium effort. For these controlled instances, that cost is avoidable: an independent finite reference semantics agrees with Cordis execution on every observation and action outcome used for scoring across all 528 executable questions.
Authors:Haoyuan Deng, Haichao Liu, Wenkai Guo, Yuan Ling, Zaijia Yang, Yuanjiang Xue, Haosheng Sun, Liangzi Wang, Ziwei Wang
Abstract:
Real‑world robotic assembly at sub‑millimeter tolerances demands spatial precision, compliant interaction, and robustness to contact failures. We present Facet‑0, a robotic foundation model that predicts and values the contact consequences of its actions. Facet‑0 unifies multimodal representation learning and reinforcement learning (RL) post‑training around a joint action‑wrench proposal: a causal wrench history is aligned with vision‑language semantics and kinematic state, and flow matching generates each action chunk together with the future wrist‑wrench profile it is expected to induce. Deployment rollouts train a distributional Action‑Wrench Critic to distinguish motions with similar task progress but different contact outcomes, while phase‑aware rewards and contact‑selective credit concentrate policy improvement on decisive interactions. To accommodate part‑specific dynamics, a lightweight bounded actor reuses the frozen representation for on‑robot adaptation; RL remains defined over executable Cartesian actions, while an auxiliary wrench head preserves predictive, non‑commanded action‑contact coupling. Trained on ManuFacet‑1K, a 1,000‑hour force‑synchronized corpus spanning three embodiments and multiple manufacturing cells, the bounded task‑adapted system reaches 82% mean success on five sub‑millimeter computer‑assembly tasks, compared with 15% for the strongest baseline, with 0.5 mm placement accuracy and 50 ms command latency.
Authors:Ke Yang, Chenglong Wang, Michel Galley, Chandan Singh, Jeevana Priya Inala, ChengXiang Zhai, Jianfeng Gao
Abstract:
AI tutors are most useful when they adapt to each student's strengths, weaknesses, and preferred guidance, but evidence about which guidance works for which student is sparse, slow, and costly to collect from real learners. Student simulators can provide this signal as a proxy, yet existing approaches are limited: state‑tracking models fit student behavior but struggle to process explanations or corrections, while LLM role‑play follows guidance fluently but does not reliably match the competence of the student being imitated. We present StudentSim, a training framework that turns sparse per‑student data into individualized simulators through pooled training followed by per‑student specialization. The resulting simulators both mirror a student's own responses and update them under tutor guidance. We also introduce StudentSimEval, a standardized protocol covering 60 students across chess, second‑language English writing, and mathematics, using public learner datasets with de‑identified records shared for research. StudentSimEval measures behavioral fidelity (F), or how well a simulator matches a student's responses, and guidance responsiveness (R), or how readily it updates under tutor guidance, with all methods fit and evaluated on the same records. Across all three domains, StudentSim outperforms GPT‑5.4 on both metrics. In chess, StudentSim reaches F=0.51 and R=0.91, compared with 0.23 and 0.72 for GPT‑5.4 and 0.45 and 0.27 for Maia2. As a proof of concept, using StudentSim as a reward model for tutor reinforcement learning produces a chess tutor that expert humans rate as more accurate, better‑guided, and more personalized than a no‑RL baseline and a tutor trained against a GPT‑5.4 simulator reward. Code is available at https://github.com/microsoft/StudentSim.
Authors:Sergio M. Silva, Otavio T. Remer, Gabriel E. Lima, Lucas Wojcik, Rayson Laroca, David Menotti
Abstract:
Vehicle attribute analysis is a key component of Intelligent Transportation Systems (ITS), supporting applications such as vehicle identification, traffic monitoring, and forensic investigation. However, models trained under controlled conditions often degrade in real surveillance scenarios due to changes in viewpoint, occlusion, illumination, and sensor characteristics. This paper introduces Unconstrained Vehicle Identification Benchmark (UVIB), a benchmark for evaluating three operational vehicle‑analysis tasks: front/rear orientation, occlusion‑related suitability for Vehicle Make and Model Recognition (VMMR), and color clarity. The benchmark contains 84,835 vehicle images from seven public Brazilian datasets, grouped into surveillance and general acquisition domains, with unified binary annotations that were not jointly available in the original sources. Four representative architectures, EfficientNetV2‑S, ResNet‑50, ViT/B‑16, and YOLO11s‑cls, are evaluated under mixed‑domain, cross‑domain, and cross‑dataset protocols. The results show that domain shift has a stronger impact than architecture choice, with substantial degradation in cross‑domain settings, especially for VMMR suitability and color clarity. While orientation generalizes more reliably, VMMR suitability remains affected by class imbalance and ambiguous occlusions, and color clarity is highly sensitive to illumination and sensor modality. These findings highlight the need for benchmarks and evaluation protocols that explicitly measure operational robustness beyond standard in‑domain accuracy. The proposed benchmark is publicly available at https://github.com/UFPR‑IPASP‑PR/uvib‑vehicle‑attributes/.
Authors:Jing Xiao, Xinhai Chen, Qinglin Wang, Menghan Jia, Zhiquan Lai, Dongsheng Li, Jie Liu, Tiejun Li
Abstract:
Training Physics‑Informed Neural Networks (PINNs) requires jointly optimizing physics residual and initial/boundary condition loss terms, which often induce conflicting gradients. Gradient surgery methods mitigate this issue by constructing directions from loss‑specific gradients to reduce conflict before optimizer transformation. However, even when the constructed direction is conflict‑free, this property may not be preserved after optimizer transformation. Let a_t denote the direction constructed by gradient surgery, u_t the optimizer proposal, and \mathcalC_t the conflict‑free cone induced by the loss‑specific gradients. We show that modern optimizers can transform a_t through mechanisms such as historical state, adaptive scaling, preconditioning, or decoupled weight decay, so a_t \in \mathcalC_t does not generally imply u_t \in \mathcalC_t. We refer to this optimizer‑induced discrepancy in conflict‑freeness between a_t and u_t as Gradient‑Update Mismatch (GUM). Accordingly, we propose Gradient‑Update Alignment (GUA), which projects u_t onto \mathcalC_t to obtain the aligned update p_t and applies p_t to the parameters. When the optimizer maintains internal state, GUA further adjusts this state toward targets reconstructed from the applied update. We conduct extensive experiments and find that GUM is widespread across momentum, adaptive, and curvature‑based optimizers, with conflict rates reaching up to 86.3%. Across all PINN settings, GUA achieves conflict‑free applied updates and consistently improves various gradient surgery methods, reducing the relative L_2 error by up to 98.2% in individual settings. Data and code are available at https://github.com/JingXiao10/GUA.
Authors:Nabira Rashid, Manolis Kellis
Abstract:
We evaluate embedding retrieval where surface form and meaning are pulled apart on purpose: retrieving items that share underlying structure but not wording, in two unrelated domains under one protocol, competition mathematics (MathNet‑Retrieve; 500 queries, 117,088‑item corpus) and embodied‑agent trajectories (ALFWorld‑derived; 118 queries, 336 trajectories). In mathematics the failure is complete: strict Hit@1 at the heaviest disguise tier is 0.0% for both production embedders (bootstrap 95% CI [0.0, 0.0]) while the correct item sits in the top 10 nearly always, and in 95.2 to 99.8% of misses the winner is more lexically similar to the query than the correct answer. In trajectories, where surface variation is incidental, the same models land at or near hypergeometric chance when gold must involve a different object, and below chance for all three embedders once gold must differ in object and receptacle: retrieval anchors on literal tokens, not task structure. A lexical reranker control hurts in mathematics and helps in trajectories (closing 26 to 36% of the gap, CIs excluding zero); its sign reveals whether a benchmark's surface variation is adversarial or incidental. An LLM reranker recovers 5 to 63% of the gap in mathematics and 43 to 76% in trajectories; direction replicates across three judges (all 21 cells positive), but effect sizes, tier profiles, and the outlier judge change with domain (paired differences excluding zero everywhere). Mathematics gains concentrate on well‑known competitions (+19.8 points, CI [+6.7, +33.2], one of six cells), so part of the recovery is memorization. In a paired downstream experiment (210 queries, graders at 96 to 99% agreement), oracle retrieval was indistinguishable from adversarially bad retrieval (McNemar p = 0.678); the solver's 69.5% zero‑shot accuracy is largely a truncation proxy (97 to 100% on finished answers), leaving no headroom.
Authors:Yiming Huang, Ziche Liu, Zhuohang Wu, Yiqian Wang, Junxia Cui, Xinkai Zou, Linjun Mao, Nan Huang, Naicheng Yu, Kaijie Zhu, Yue Ma, Kun Zhou, Letian Peng, Jingbo Shang
Abstract:
Scientific equation discovery has long been central to scientific progress, proceeding through iterative cycles of hypothesis generation, observational testing, and refinement under scientific constraints. As LLM capabilities advance and their role in AI for Science expands, it remains an open problem whether they can genuinely discover scientific laws and how this ability should be evaluated. Existing evaluations, however, often either simplify discovery through synthetic settings or reuse published targets that may already be familiar to LLMs. We therefore introduce SCILAWS‑BENCH, a benchmark for scientific law discovery built from published research and real scientific data. It comprises 118 problems drawn from 381 scientific papers, covering 291 candidate laws and roughly 8M real data points across six scientific disciplines. Each problem is instantiated in two complementary settings: (1) SCILAWS‑REAL asks models to propose laws from fixed real observations and evaluates held‑out predictive fit and scientific validity derived from the source literature, and (2) SCILAWS‑PARALLEL asks models to actively query residual‑calibrated worlds and recover synthesized hidden laws derived from published forms. This two‑setting task design preserves each problem's scientific context while separately evaluating fixed‑record law discovery and active recovery of a newly synthesized hidden law. We find that predictive fit can diverge from scientific validity, memorization shapes whether models reproduce or move beyond published formulas, and our best‑of‑N study reveals a selection bottleneck. Our work provides a paper‑grounded benchmark and new empirical perspectives for evaluating AI for scientific discovery. Project page: https://yiyihum.github.io/SciLaws‑Bench
Authors:Jacqueline He, Howard Yen, Shuyue Stella Li, Margaret Li, Hanqing Zeng, Yinglong Xia, Benyu Zhang, Zhuokai Zhao, Qiang Zhang, Pang Wei Koh, Luke Zettlemoyer, Wen-tau Yih
Abstract:
Logit‑based knowledge distillation (KD) is used to train smaller language models (LMs) via supervision from stronger teachers, but whether its benefits are consistent across training stages remains unclear. Through controlled experiments, we find that forward Kullback‑Leibler (KL) distillation‑‑the standard KD formulation‑‑with post‑trained teachers behaves fundamentally differently during mid‑training, an intermediate phase of self‑supervised learning on curated corpora. Surprisingly, while forward KD simultaneously improves reasoning and factual recall during pre‑training relative to standard next‑token prediction (NTP), it instead slows factual recall acquisition during mid‑training despite continued reasoning gains. We trace this stage dependence to an asymmetry in teacher confidence across data domains and the student's evolving knowledge state: teachers are more confident on procedural than knowledge‑intensive data, while students acquire low‑entropy factual knowledge earlier in training. To mitigate this imbalance, we propose Switch Distillation, a simple mid‑training objective that distills on tokens where the teacher is confident, using teacher predictive entropy as a lightweight routing signal, and otherwise falls back to cross‑entropy. Switch Distillation consistently outperforms existing distillation objectives across teacher sizes. Relative to standard NTP, it achieves 1.61‑1.71x the reasoning performance and 1.13‑1.19x the knowledge and commonsense performance while preserving 96.7‑96.8% of factual recall. Crucially, these benefits persist after post‑training: Switch Distillation closes the factual recall gap while maintaining 1.25‑1.32x and 1.13‑1.20x gains in reasoning and knowledge and commonsense, respectively.
Authors:Thibaut Loiseau, Guillaume Bourmaud, Vincent Lepetit
Abstract:
Self‑supervised pre‑training via cross‑view completion learns strong features for 3D vision from co‑visible regions of image pairs. However, the reference view provides little information for reconstructing non‑co‑visible patches, implicitly yielding a monocular training signal in these regions. We introduce Gekko, which turns this limitation into a useful signal. The relative improvement of the cross‑view reconstruction error over a masked‑autoencoder error is a self‑supervised proxy for co‑visibility: large improvements indicate co‑visible regions, negligible ones non‑co‑visible areas. Gekko is a network, trained from scratch, that jointly performs cross‑view completion, masked autoencoding, and per‑pixel prediction of this relative improvement, providing an additional binocular signal for all masked regions without any ground‑truth 3D annotation. Under identical architectures and training data, Gekko consistently outperforms CroCo on zero‑shot correspondence estimation, relative pose estimation, and pointmap regression, with up to 6 times higher accuracy at the strictest relative‑pose threshold and a 22% drop in end‑point error on ETH3D. The extra channel it learns is itself a strong co‑visibility detector on unseen scenes, and Gekko's frozen features outperform released cross‑view backbones of comparable or larger size. It can also be trained directly from raw videos with a simple stride‑based curriculum, removing the cumbersome 3D preprocessing prior methods require while matching models trained on curated data. Code and pre‑trained models are publicly available.
Authors:Sebastien Tchitchek, Julien Tierny
Abstract:
This paper introduces the Sierpiński‑Knopp (SK) Wasserstein distance, a fast metric between persistence diagrams. The SK‑Wasserstein distance, denoted d_\mathrmSK, maps diagram points and their diagonal projections to the unit interval via the Sierpiński‑Knopp space‑filling curve on the upper diagonal triangle. The encoded point sets are then efficiently matched via one‑dimensional optimal assignment, in \(O(N\log N)\) steps, yielding an explicit diagonal‑aware point assignment between the two input persistence diagrams. We show that the SK‑Wasserstein distance controls the classical \(2\)‑Wasserstein distance between diagrams, admits an explicit isometric embedding into a Hilbert space, and induces a positive‑definite Gaussian kernel, making the resulting geometry directly compatible with Euclidean and kernel‑based learning methods. A tighter surrogate dissimilarity, noted \(W_Γ\), is also introduced based on the point assignments along the curve. Experiments on 12 scientific collections comprising 227 diagrams show median per‑collection speedup of \(d_\mathrmSK\) over state‑of‑the‑art approximations of \(W_2\) is \(626×\), while the aggregate speedup over the full benchmark is \(2100×\). Average‑linkage partitions obtained from \(d_\mathrmSK\) and \(W_Γ\) each exactly match the corresponding \(W_2\) partition on 8 of the 12 collections. Hilbert \(k\)‑means and Gaussian spectral clustering, both based on \(d_\mathrmSK\), achieve mean adjusted Rand indices (ARI) of \(0.756\) and \(0.800\), respectively, with respect to the benchmark reference partitions, compared to \(0.750\) obtained by average linkage on \(W_2\). The Gaussian \(d_\mathrmSK\) kernel supports other kernel‑based analysis tasks, as illustrated by its use for contiguous segmentation of ordered diagram collections in our experiments.
Authors:Qian Wang, Yu Wang, Weiqi Li, Xinhua Cheng, Xiandong Meng, Ronggang Wang, Jian Zhang
Abstract:
While 3D Gaussian Splatting (3DGS) has revolutionized 3D reconstruction and novel‑view synthesis, scenarios with limited input views often lead to poor reconstruction quality and artifacts in rendered novel views. Recent efforts attempt to utilize powerful diffusion priors, yet they typically process rendered and reference views concatenated along an additional dimension in a single network. These methods overlook an inherent nature that different views should maintain appearance similarity but differ in structure due to view shifts, leading to blur caused by conflicts between the two properties. In this paper, we propose DualDiff, a novel pipeline that leverages dual diffusion priors with a Structure‑Appearance Attention (SAA) module to introduce reference guidance for refining low‑quality novel views rendered from flawed 3D representations. Specifically, we retain one diffusion branch to focus on extracting structural information from the low‑quality novel views, while introducing another branch to ensure appearance consistency with reference views. Furthermore, we present a 3D reconstruction framework named DualDiff3D, which integrates a reliability‑enhanced Render‑Refine‑Optimize (RRO) loop to progressively and robustly incorporate the refined novel views, yielding more accurate 3DGS. Extensive experiments demonstrate that our approach outperforms state‑of‑the‑art methods even in the inference‑only setting, with further performance gains achievable through training. Our code and pre‑trained weights are available at https://github.com/Akaneqwq/DualDiff3D.
Authors:Lucas Cunha, Lucas Sotomaior, Lucas Gasperin, Beatriz Caldas, Eduardo Pianovski, Rayson Laroca
Abstract:
Face forgery detectors often achieve strong results on controlled benchmarks, but their reliability under realistic image degradations remains limited. This paper presents a standardized benchmark for face forgery detection using the Multi‑Dimensional Face Forgery Image (MFFI) dataset and evaluates performance on both clean and degraded test partitions. We compare six model families, including convolutional networks, transformer‑based models, and a frozen self‑supervised DINOv3 backbone, across spatial, spectral, and hybrid input representations. The results show that clean‑set performance is not a reliable indicator of robustness under compression, resizing, and blurring. Xception with RGB obtains the best clean performance, reaching 0.884 mean ROC‑AUC, but degrades substantially on the harder partition. In contrast, frozen DINOv3 achieves the strongest degraded‑set result, with 0.726 mean ROC‑AUC, while training only a linear classification head. The representation analysis indicates that Fourier‑domain cues are most useful when combined with RGB information, whereas purely spectral inputs consistently underperform spatial representations. Qualitative attribution maps further suggest that convolutional detectors focus on localized artifacts, while DINOv3 relies on broader facial structure. These findings reinforce the need for degraded evaluation protocols and highlight self‑supervised visual representations as a promising direction for robust face forgery detection. Our source code is publicly available at https://github.com/lucasdocunha/FaceForgery‑Benchmark/.
Authors:Zhengze Zhou, Hejian Sang
Abstract:
Compressed context is usually carried as human‑readable text or as rendered images that must be decoded, even when its consumer is a language model. We introduce LatentPress, which writes conversational histories and long documents into a third representation: continuous memory tokens that a frozen decoder reads directly through its input‑embedding interface, with no text reconstruction at inference. A small reader‑matched writer compresses 4‑16× while training only an adapter (4.2M‑26.2M parameters, ~\!0.1% of the decoder). On LongMemEval, LatentPress reaches 0.504 accuracy at 7.70× compression versus 0.490 for uncompressed evidence, outperforming text summaries (0.184) and OCR‑based compression (0.426 to 0.312). On LongBench‑QA, in‑domain writers match or exceed raw‑context reading at 4‑8× compression, while 16× trails raw. Writing takes 43ms per conversation, roughly an order of magnitude faster than text summarization or OCR reconstruction, and reading is 5‑9× faster than raw context or cached OCR. We validate the interface under two transfer settings, zero‑shot from UltraChat to LongMemEval memory QA and from LongMemEval‑derived QA to unseen LongBench document domains, establishing direct soft tokens as a practical machine‑facing context interface beyond text and vision. The implementation of the experiments could be found at: https://github.com/HJSang/LatentPress .
Authors:Elias Stengel-Eskin, Newton Sander, Carlos Bonetti, Sasha Boguraev, James Bowler, Hale Sirin, Simon Kirby
Abstract:
The growing rate at which LLM agents interact with one another raises key questions about language evolution in multi‑LLM‑agent settings, with implications for safety and monitorability as well as for linguistic accounts of LLMs. To address these questions, we introduce GlossoGen, a novel platform for studying multi‑agent language evolution in complex scenarios. Within GlossoGen, we build the SaveVeyru scenario, which requires agents with partial information to communicate under pressure. We find that language evolution does occur between LLM agents, that the resulting languages are compositional and morphologically productive, and that they deviate from the LLMs' English prior in ways that render them incomprehensible to humans. Moreover, we identify several qualities essential to this evolution: pressure towards efficiency; the strength of the models backing the agents; and access to a "postmortem" stage in which agents can agree on linguistic conventions. Importantly, we observe that different conditions govern the transmission of language to new agents. Specifically, we find that agents learn new languages from usage alone, take an active role in this learning, and that while stronger models are required for novel language emergence, weaker models can learn an existing language once it has emerged. Taken together, our results indicate that current LLMs have the potential for cumulative cultural evolution ‑‑ previously attested only in humans ‑‑ with mixed populations of agents developing capacities that go beyond their lowest common denominator.
Authors:Haoyang Yan, Min-le Su, Hangfan Zhang, Zhanhao Li, Chen Zhang, Shao Zhang, Yang Chen, Lei Bai, Shuyue Hu
Abstract:
This paper studies autonomous software development, in which LLM‑based coding agents transform high‑level requirements into complete, functional, and usable software systems without human intervention. We introduce Harness‑of‑Harness (HoH), a framework that enables coding agents to continually improve software during autonomous development. HoH operates on existing coding‑agent harnesses, and organizes their executions into iterative planning‑coding‑testing loops. To sustain improvement across loops, HoH balances repair with capability growth, scopes development into small and verifiable increments, separates implementation‑time testing from independent evaluation, and constrains verifiable outputs rather than prescribing agent workflows. It progressively exposes deliverables, role‑specific tools, and skills, encourages reuse rather than recreation, and maintains versioned project histories. On GameCraft‑Bench, FrontierSWE, and ProgramBench, three harness‑model pairs (Codex with GPT‑5.5, OpenCode with DeepSeek‑V4‑Pro, and Pi with MiniMax‑M3), HoH consistently outperforms the corresponding standalone harnesses, achieving an average relative gain of 52.25 percent and a maximum gain of 82.86 percent after three iterations. In a multi‑day deployment with more than 70 iterations, HoH autonomously develops a first‑person‑shooter game, featuring a coherent storyline, fully implemented core mechanics, human‑playable experience, polished visuals and integrated audio. Github: https://github.com/Flesymeb/HarnessOfHarness Project Page: https://flesymeb.github.io/HarnessOfHarness/
Authors:Egor Pakhomov, Erik Nijkamp
Abstract:
A long‑horizon agent's trace outgrows both of its consumers: the human observer monitoring the run, and the agent itself, whose bounded context the trace must be folded back into. We present a live trace model, an append‑only event ledger folded incrementally into typed run state and compiled into per‑consumer views, and evaluate it for both consumers against deterministic ground truth. For the observer side, evaluated with an LLM reader as proxy, the compiled view answers monitoring questions using approximately 14x and 15x fewer input tokens (by reader) and at 5‑7x lower cost than a budget‑capped single‑call reading of the raw trace, with higher accuracy (0.85‑0.87 versus 0.48). Because the questions were co‑designed with the view schema, we treat the token and cost reduction, conditional on schema coverage, as the transferable result. For the agent, on 120‑link sequential‑dependency tasks, mechanisms that maintain the task's running statistic in per‑step state succeed where full‑context prompting fails (30/30 versus 8/30 under a clean protocol, n=30, labeled descriptive owing to benchmark‑system co‑development); a prompt‑level scratchpad matches the fold's accuracy at lower cost, and a two‑arm decomposition attributes the fold's accuracy to its deterministic aggregate and its cost advantage to its compactness. The fold's remaining value over cheaper alternatives is deterministic auditability and serving the observer from the same state. We derive eleven candidate requirements for trace folding from observed failures and delimit them with an order‑sensitive task family on which the fold ceases to help. Code, benchmarks, a regenerable synthetic corpus, and all workbench traces are released.
Authors:Clinton Enwerem, John S. Baras, Calin Belta
Abstract:
Dexterous manipulation policies learned by imitation are typically evaluated for robustness to variation in scenes, objects, or instructions, but their performance across task execution speeds is less often examined. This leaves open how much temporal robustness a learner retains relative to the expert it imitates. We compare an expert and learner under the same task conditions, initial‑condition draws, and speedup factors. We instantiate the evaluation in ParcelStow, a contact‑rich task in which the robot acquires, reorients, and inserts a parcel. The demonstrations span the speedup range for the manipulation phases after parcel acquisition. A scripted expert and an Action Chunking with Transformers (ACT) policy trained from the expert's demonstrations both achieve 100 percent task success at nominal speed. Their success rates diverge within the demonstrated range: at its maximum, expert success is 84 percent and ACT success is 53 percent. Two ACT policies with different parameter initializations show similar degradation, decreasing by 34 and 48 percentage points from nominal speed to the maximum demonstrated speed, compared with 16 points for the expert. Stage‑level analysis shows that 35 of ACT's 47 failures at the maximum demonstrated speed are insertion misalignments. Under the relative‑motion handoff, every ACT acquisition retains the parcel through reorientation and transfer in free space, but only 64 percent complete the overall task, compared with 95 percent after expert acquisition. Across all evaluated policies and speeds, none of the 414 acquisitions without force closure completes the task. Equal nominal task success therefore does not imply preservation of expert performance across execution speeds. Code, data, and evaluation scripts are available at https://github.com/coenwerem/parcelstow.
Authors:S. Sifaoui, E. Angelini, S. Toupin, T. Pezel, L. Le Folgoc
Abstract:
Dense self‑supervised learning (SSL) is a powerful paradigm for learning without annotations the local descriptors required to solve dense medical imaging tasks. We present Pix2Rep‑v2, a framework for SSL of pixel‑ and voxel‑level representations suitable for few‑shot downstream applications. Pix2Rep‑v2 addresses the main challenges of dense SSL by leveraging a redundancy reduction objective at the pixel‑level with a principle of equivariance of dense representations, that scales efficiently to 3D or wide field‑of‑view applications. We evaluate our method on four datasets, across multiple tasks, multiple modalities and anatomical structures using multiple backbones in 2D and 3D, and under various data regimes. As an alternative to linear probing or full fine‑tuning on the downstream task, we also propose an in‑context variant, without downstream training, based on a dense prototype approach. Pix2Rep‑v2 shows substantially higher data‑efficiency in few‑shot scenarios compared to fully supervised baselines, and is competitive with the state‑of‑the‑art e.g., +9.3 Dice points in one‑shot segmentation on the M&Ms‑2 dataset. Our code and pre‑trained models are publicly available at https://github.com/BioMedTP/pix2rep‑v2.
Authors:Tian Tian, Shuaicheng Niu, Hao Kuang, Yuanhang Hu, Dong Li, Zhiqi Shen
Abstract:
Voucher abuse poses a major challenge in e‑commerce, where malicious users exploit promotional vouchers for profit. Unfortunately, fraud patterns evolve rapidly over time and across regions, causing distribution shifts that degrade existing detection models unless retrained frequently. To tackle this, we propose the Coupled Attribute‑Topology Invariance Learning framework (CATeye). The key challenge arises from coupled attribute‑topology shift, where edges built from attribute proximity cause environment‑driven attribute shift to induce shifted topology, thereby amplifying variant signals through GNN message passing. CATeye sees through such coupled shifts with two learnable selectors. First, an Attribute Invariance Selector (AIS) learns node‑adaptive masks to filter out non‑invariant attributes. Then, conditioned on retained invariant attributes, an Edge Invariance Selector (EIS) samples an invariant subgraph and isolates non‑invariant edges. Using the resulting invariant and non‑invariant components, CATeye constructs multiple views and applies view‑specific objectives to emphasize domain‑invariant representations while suppressing domain‑specific variations. Experiments on both a proprietary dataset from Lazada, a major Southeast Asian e‑commerce platform, and a public benchmark show that CATeye consistently outperforms nine strong domain generalization and graph anomaly detection baselines, achieving up to an 8.61% improvement in average F1 score over the strongest baseline. Source code is publicly available at https://github.com/Tian0426/CATeye.
Authors:Junyao Gao, Sibo Liu, Jiaxing Li, Yanan Sun, Weidong Zhang, Jun Zhang, Cairong Zhao
Abstract:
Image style is a highly abstract, human‑constructed concept shaped by a range of visual factors and intrinsically entangled with content, yet a unified and explicit definition of image style remains lacking. In this work, we first discuss the fundamental question of what is style and then propose a hierarchical style definition that describes image style from an overall style identity to fine‑grained visual attributes, providing a more structured, transferable, and interpretable style representation. Based on this definition, we refine the style annotation pipeline of MegaStyle and construct MegaStyle++‑8M, a large‑scale style dataset containing 150K overall style identities, 1M fine‑grained style prompts, and 8M stylized images. Extensive analyses demonstrate that our hierarchical definition substantially expands the style space in both diversity and semantic breadth, while precisely capturing intrinsic visual style of reference images. The dataset and code will be updated at https://github.com/Tencent/MegaStyle, we hope MegaStyle++ provides a scalable foundation for studying and modeling diverse image styles.
Authors:Qingde Li, Qingqi Hong, Zihan Li, Jie Tian
Abstract:
A fundamental challenge in artificial intelligence is the transformation of observations into explicit symbolic representations suitable for abstraction, interpretation, and reasoning. While modern AI systems achieve remarkable perceptual capabilities through large‑scale statistical learning, the resulting knowledge is typically encoded within latent parameters that are difficult to inspect or manipulate analytically. Inspired by Neuro‑Symbolic AI and theories of human abstraction, this paper investigates the formation of symbolic mathematical representations from geometric observations. We propose NeuSOGA (Neuro‑Symbolic Geometric Abstraction), a framework that progressively transforms observations into topological abstractions, geometric abstractions, and ultimately symbolic mathematical representations. The architecture combines topology‑guided structural discovery using Euclidean Distance Transforms, foundation‑model perception using Segment Anything, adaptive multi‑scale geometric abstraction, and symbolic synthesis through Implicit Area Splines. The resulting representation is an analytical implicit model supporting arbitrary‑order smoothness, additive composition, and closed‑form evaluation. Unlike neural latent encodings, the generated representation remains interpretable, editable, and mathematically explicit. Experiments on ModelNet40 point clouds, arbitrary‑view projections, and segmented optical observations demonstrate that NeuSOGA transforms diverse observations into compact symbolic representations while preserving essential geometric and topological structure across sensing modalities and viewing directions. NeuSOGA provides an interpretable and explainable pathway from observation to symbol and establishes
Authors:Maeve Hutchinson, Syed Mahbubul Huq, Mohammad Albinhassan, Radu Jianu, Aidan Slingsby, Pranava Madhyastha
Abstract:
Vision Language Models have demonstrated remarkable proficiency in interpreting static visual artifacts, but modern data analysis is inherently dynamic, requiring the active interrogation of interactive environments. Existing benchmarks are predominantly constrained to static imagery and one‑shot question answering and fail to capture the epistemic demands of this domain, where evidence is frequently occluded, distributed across linked views, or conditionally revealed through user agency. In this paper, we introduce InSight, a benchmark for agentic claim verification over interactive visualizations. The dataset consists of 21,349 claims derived from human‑authored analytical narratives and grounded in fully interactive web‑based environments. Agents must navigate these environments to determine whether a natural language claim is supported, refuted or not verifiable given the available evidence. Unlike traditional evaluations, InSight treats interaction traces as intrinsic proxies for reasoning, enabling a rigorous audit of how models seek and synthesize visual evidence. We evaluate state‑of‑the‑art models, revealing that interactive verification remains a non‑trivial challenge. We release InSight at https://github.com/maevehutch/insight.
Authors:Nishant Mishra, Ameen Abu-Hanna, Iacer Calixto
Abstract:
Linear classifiers trained on hidden states of a large language model (LLM), linear probes, can flag factual errors from a single forward pass. Geometrically, that implies that true and false statements separate along a stable direction in hidden state space, i.e., the truth direction. Prior work disagrees on whether this generalises across input shifts, but the disagreement is hard to interpret because cross‑dataset probe transfer experiments confound several kinds of input change at once. We isolate three such variables in medical question‑answering (QA): writing style (register), domain (medical specialty), and corpus (dataset). We build a benchmark using 500 MedQA entries, each rewritten into four styles (textbook, patient, clinical note, colloquial), annotated with clinical specialty, and grouped with two other exam corpora, MedMCQA and MMLU‑medical, for cross‑dataset evaluation. Probing four open‑weight LLMs (2‑‑8B), we find that the truth direction is largely robust to writing style (mean Δ_\textregister \approx 0.10 AUROC on held‑out facts) and to medical specialty (Δ_\textspecialty \approx 0.03), but degrades unevenly across corpora: by 0.12 AUROC on MMLU‑medical and by 0.21 on MedMCQA, roughly twice the register gap. The register result replicates with a second generator and carries over to human‑written patient questions. The truth direction is therefore largely stable within the medical domain but breaks under some corpus shifts, and question format does not explain the break, which suggests that the signal a linear probe recovers is partly bound to dataset structure rather than to medical knowledge alone.
Authors:Handong Wang, Jiaxin Qi, Haochen Feng, Baisheng Lai
Abstract:
Predicting transcriptional responses to specific perturbations is critical for understanding cellular regulatory mechanisms and accelerating drug discovery. Single‑cell RNA sequencing destroys each measured cell, yielding only unpaired populations of control and perturbed cells. However, existing methods typically model perturbation prediction at the single‑cell level and assume cell‑to‑cell correspondence, which conflicts with the unpaired nature of the observed data. To address this challenge, we propose PopPert, a framework that explicitly parameterizes population‑level joint gene expression distributions for collective transcriptional state modeling. Given a control population distribution and a perturbation condition, PopPert predicts perturbation‑induced changes in distribution parameters, eliminating the need for cell‑level correspondence and reducing sensitivity to single‑cell noise. To effectively capture gene co‑expression patterns, PopPert leverages a low‑rank Gaussian Copula to model cross‑gene statistical dependencies and construct the joint gene expression distribution, additionally allowing sampling of synthetic perturbed single‑cell profiles. Across multiple single‑cell benchmarks spanning both genetic and chemical perturbations, PopPert achieves superior overall performance in differential expression recovery, perturbation effect estimation, and population‑level distribution matching. These results establish population‑level joint distribution learning as an effective paradigm for predicting transcriptional responses from unpaired single‑cell populations. Code for PopPert is publicly available at https://github.com/whd1125/PopPert.
Authors:Esther Xin
Abstract:
Reinforcement learning with verifiable rewards (RLVR) and standard benchmark evaluation both rely on an automatic verifier that turns a free text answer into a binary reward. Prior work reports that one evaluation harness accepts only about 94% of its own ground truth answers, blaming LaTeX parsing. That is an aggregate: it does not say which answer forms consume the error budget. We supply the decomposition. We apply metamorphic testing to the verifier rather than the model, generating certified equivalent answer variants, that is, rewrites that preserve mathematical meaning by construction, so that any rejection is a provable false negative needing no human adjudication. We then measure rejection per answer category across four widely used verifiers over 307,420 verdicts. We find three things. (1) Self validation ranges from 53.8% to 95.2% on identical inputs, a spread of 41.3 points. The published figure describes one implementation, not the task; two configurations of the same library disagree on 49.9% of pairs. (2) The residual is not spread across parsing categories but concentrated in whitespace and punctuation, which account for 93.0% of in contract failures for the default LaTeX configuration. A trailing period or newline dominates the budget. (3) Separating rejection from execution failure shows that verifiers with similar aggregate error fail for opposite reasons, and that a reference numeric cascade accepts off by one wrong answers as a step function of magnitude, from 0% below 10^4 to 100% at or above, because its relative tolerance is scale invariant.
Authors:Ziqian Wang, Yuxiao Cheng, Tingxiong Xiao, Jinli Suo
Abstract:
Multimodal coding and editing systems must map a visible or semantic referent to the exact executable object that can be edited. A wrong reference may select a valid but incorrect DOM node, SVG element, graph endpoint, hierarchy member, or table cell, while final execution success alone does not reveal the source of the failure. ExBind isolates this visual‑to‑executable correspondence layer as a controlled diagnostic benchmark between semantic localization and action execution. It samples representation‑independent latent binding instances and compiles them into SVG, DOM, canvas, tree, graph, and table cases with deterministic mappings to executable references. Models output only a strict reference; the evaluator maps predictions back to latent structure and scores structural constraints without requiring reasoning traces. The release contains a 250‑case broad suite, a disjoint 240‑case targeted suite, and 50 paired latent groups. Qwen2.5‑VL‑3B achieves 98.4% candidate validity but 76.4% exact accuracy, while Qwen3‑VL‑4B achieves 100.0% validity and 98.8% exact accuracy. In the targeted table suite, all Qwen2.5‑VL‑3B residual errors are valid correct‑row/wrong‑column selections. Candidate‑order perturbations change case‑level outcomes while preserving this error pattern. ExBind is designed for controlled diagnosis rather than population‑scale ranking or end‑to‑end editing evaluation. Code and benchmark records are available at https://github.com/Daerwang2020/Exbind and https://huggingface.co/datasets/Ziqianwwww/ExBind.
Authors:Yufei Chen, Yiran Zhao, Xiaogang Xu, Qipeng Xie, Jiafei Wu, Zhe Liu
Abstract:
LLM‑based forecasting systems have improved on real‑world tasks such as financial markets and sports outcomes, largely through stronger search and tool use. Many systems still ask an LLM to read all collected evidence together and produce the final forecast. We call this design Monolithic Prediction. It can obscure how individual evidence items affect the result and collapse uncertainty across competing outcomes. We propose LEAP (Likelihood Elicitation and Aggregation for Probabilistic forecasting), which reorganizes how collected evidence is used in the prediction stage. LEAP examines each evidence item separately and elicits likelihood parameters that describe its implications for the target. An explicit prior and a deterministic probabilistic model then combine these likelihoods into a posterior distribution. This procedure supports continuous, single‑choice, and multi‑choice forecasts while preserving reproducible evidence contributions. We build a benchmark covering forecasting, information‑seeking, and browsing tasks, and evaluate LEAP on our own agent loop and several agent CLI frameworks. Given the same evidence, LEAP improves most prediction and calibration metrics across models and remains stronger under controlled comparisons of prior access, inference budget, and aggregation.
Authors:Louis Abraham, Tuan-Anh Nguyen, Nicolas Devatine
Abstract:
Many production systems can assess a configuration only by using it on live requests and observing noisy feedback. Modern agentic systems are a prominent example, with inference‑time choices such as model selection, retrieval depth, prompting strategy, and decoding temperature, yet often with no representative validation data. We formalize this setting as Online Hyperparameter Optimization (OHPO) and cast it as an infinitely many‑armed bandit over mixed and conditional search spaces. We introduce IMABO, a general framework that combines any bandit policy for choosing among already sampled configurations with any oracle for proposing new ones. We instantiate it with IMOSS, a restart‑free anytime policy whose active set grows as t^β, and prove an expected cumulative quantile‑regret bound of O(p_ρ^‑1/β + T^(1+β)/2), where β\in(0,1) controls active‑set growth and p_ρ lower‑bounds the probability that a proposed configuration falls in the top‑ρ fraction of the search space. We combine IMOSS with three practical oracles: a Tree‑structured Parzen Estimator, an incumbent‑mutation oracle driven by a per‑coordinate bandit, and a pretrained tabular foundation model, all three improving over the uniform random oracle baseline. IMABO outperforms all baselines in terms of regret across diverse OHPO settings, from tuning classical machine‑learning models to configuring LLM‑based agents. Our implementation is available at https://github.com/Tiime‑Software/IMABO.
Authors:Mian Zhong, Katherine A. Keith, Anjalie Field
Abstract:
In many settings, studying causal questions based on text data requires adjusting for confounding information within texts. Yet there is a tradeoff in constructing text representations for adjustment: they must be sufficiently large and/or dense to preserve the confounding variables necessary for unbiased effect estimation, but sufficiently small and/or sparse to satisfy finite‑sample overlap and yield low‑variance estimates. To address this tradeoff, we turn to sparse autoencoders (SAEs), and propose a novel causal adjustment pipeline that iteratively selects a minimal set of SAE features via conditional independence tests. We find that SAE representations achieve better adjustments (lower bias and and higher coverage) than alternative representations in standard semi‑synthetic evaluations with binary confounders, and their interpretability offers opportunities for falsification. We also introduce a more realistic semi‑synthetic evaluation that uses multi‑label data as the unobserved confounders and find off‑the‑shelf adjustment methods require increased investigation for these more complex settings. Code: https://github.com/mianzg/sae‑text‑confounder
Authors:Hodong Lee, Sanghee Park, Dohoon Ryu, Jungwhan Kim, Junyeob Kim, Soyoon Kim, Geewook Kim
Abstract:
Building an omni‑modal foundation model means evaluating it across text, image, video, and audio. Excellent evaluation toolkits exist for each modality, but their inference engines, prompt conventions, and metric implementations are mutually incompatible, so practitioners end up maintaining separate environments for every toolchain and still struggle to compare results across them. OmniEvaluator grew out of this need in our own model development: rather than reimplementing benchmarks, it connects existing inference engines and curated evaluation libraries at a higher level, exposing four inference backends, four evaluation frameworks, and over a thousand benchmarks through a single interface. Every run is recorded as an artifact capturing the full configuration for exact reproduction, and results flow into a shared dashboard for cross‑model comparison. A federated mode shares GPU inference servers across concurrent evaluations, and a built‑in verifier, small enough to run on CPU, keeps its score stable across engines and prompts where rule‑based scoring fluctuates under configuration mismatch, matching cost‑efficient commercial LLM judges without their recurring API cost. The system, demo video, and dashboard are publicly available. (https://github.com/naver‑ai/omni‑evaluator)
Authors:Mohammed Oussama Benyahia, Marouane Tliba, Mohamed Amine Kerkouri, Taifour Yousra, Bin Wang, Max Bengtsson, Gorkem Durak, Elif Keles, Zuheng Ming, Marek Penhaker, Azeddine Beghdadi, Ulas Bagci, Aladine Chetouani
Abstract:
Medical image segmentation remains difficult to scale because high‑performing methods typically rely on dense expert annotations and task‑specific training. We introduce GazeRefine, a training‑free framework that uses gaze as an inference‑time prompt for zero‑shot medical image segmentation. Sparse, duration‑weighted fixations are converted into foreground and background priors that initialize semantic prototypes in frozen DINOv3 feature space. These prototypes are iteratively refined through foreground‑background discrimination, feature‑space affinity propagation, and anchoring to the initial gaze guidance, allowing segmentation to extend beyond directly fixated regions while limiting semantic drift. GazeRefine requires no segmentation masks, fine‑tuning, adapters, prompt encoders, or gradient updates. We evaluate the method on gaze‑annotated polyp segmentation and prostate MRI segmentation. The results show strong performance on colonoscopy images and competitive performance on prostate MRI, supporting gaze‑guided prototype refinement as a promising approach for segmentation‑label‑efficient, human‑in‑the‑loop medical image segmentation. Our tools and code can be found in the following repository: https://github.com/MohammedOussamaBEN/GazeRefine.git
Authors:Danial Noori Zadeh, Mohamed B. Elamien
Abstract:
Sharing analog integrated circuit designs remains difficult: foundry non‑disclosure agreements restrict the process details a design depends on, and the testbenches behind published results are rarely released. We present analog‑db, an open‑source, versioned database built on a shareable design representation. A domain‑specific language captures each design as a process‑neutral topology, reusable testbenches, and a machine‑readable datasheet under one schema, so a design is shared in full and re‑simulates on the process kits it is bound to. A parameterization scheme exposes functional sub‑blocks and device sizes as named parameters that carry their matching constraints, making circuits composable and retargetable; a schema‑governed contract and queryable catalog let AI design agents discover and reuse them directly. Across the regulator corpus, all 23 circuit‑kit bindings on three open kits meet their own recorded specification bands (typical corner, matched devices, no layout) and 10 of 23 meet a common class band. Seventeen of the 23 imported sizings failed their testbenches and closed under a gm/ID sizing loop driven by the annotated sub‑block roles, typically within one to three iterations. In a supervised case study, a coding agent working from the released artifacts sized the op‑amp cores of a chopper instrumentation amplifier on an open 130nm kit, locating four hand‑entry defects and a missing common‑mode feedback loop that the sizing‑only baseline did not repair. The database holds 68 circuits across sixteen classes, verifiable at schematic level under a tiered harness and tracked on a power/performance scoreboard, released at https://github.com/MacAnalog/spicexplorer‑release.
Authors:Kai Guan, Minchao Jiang, Ruichen WangLi, Wentao Zhu, Lei Zhang
Abstract:
Complete 3D perception from egocentric video requires recovering the surrounding scene and the wearer's full‑body motion in a shared metric frame. Existing methods typically address scene reconstruction and motion estimation separately: scene reconstruction methods ignore the wearer, whereas motion estimation methods lack explicit scene geometry and often depend on external trajectories. Joint recovery is challenging because the two tasks exhibit asymmetric visibility and require different prediction paradigms. The largely visible scene supports deterministic geometric regression, whereas the severely occluded body requires generative motion inference. We therefore propose RESELF (REconstructing the Scene and the sELF), a unified framework that couples deterministic metric geometry reconstruction with geometry‑conditioned motion generation. RESELF adapts a geometry foundation model pre‑trained on large‑scale exocentric data to egocentric video using frame‑wise scale and relative‑pose consistency objectives. The resulting camera trajectory and latent geometric features condition a diffusion model that recovers the wearer's motion. A subsequent closed‑loop kinematic feedback stage further refines the camera head while preserving the reconstructed scene geometry. To support training and evaluation, we curate EE4D‑JSM from EgoExo4D by aligning egocentric video, sparse metric scene geometry, camera trajectories, and full‑body motion annotations. Experiments show that RESELF outperforms state‑of‑the‑art methods designed for the individual tasks across depth estimation, camera tracking, and full‑body motion estimation. Code, models, and datasets will be available at https://ka1guan.github.io/RESELF/.
Authors:Zhijian Qiao, Xinjiang Wang, Jiajie Chen, Haoming Huang, Meng Li, Chih-Chung Chou, Jing Wang, Shaojie Shen
Abstract:
In camera‑controlled video generation, geometry‑aware positional encodings condition tokens on camera extrinsics and per‑token viewing rays. Existing schemes, however, have a scale‑dependent failure mode on real‑world metric camera trajectories: homogeneous projective encodings cause attention logits and feature norms to grow unbounded with physical translation baselines. We propose MeRoPE (Metric Rotary Position Embedding), a norm‑preserving relative camera encoding for attention. MeRoPE encodes relative orientations between calibrated viewing rays with orthogonal rotation blocks, maps raw metric displacements into multi‑frequency rotary phases, and adds a disparity‑anchored correspondence prior along the epipolar arc. This design strictly preserves feature norms, bounds pre‑softmax attention logits regardless of the physical translation scale, and maintains exact invariance to global rigid coordinate changes. Across nuScenes and PanShot, which cover large‑baseline trajectories and diverse camera optics, respectively, MeRoPE achieves stronger camera control than prior encodings, with the best consistency between generated camera motion and conditioning poses in both rotation and translation. Code will be made publicly available.
Authors:Liming Pu, Xiaoxia Li, Yifu Liu, Teng Cao, Bin Yang
Abstract:
Reinforcement learning is a natural way to post‑train LLM agents for long‑horizon interactive tasks judged only by end‑of‑task verification, yet a shared belief holds that outcome‑only RL soon hits a ceiling on small open models. Recent work therefore compensates around the training with denser rewards, SFT priors, skill libraries, curated memory, or multi‑agent orchestration. We argue the ceiling is an artifact of two failures of common practice. Signal starvation: group‑relative RL with sparse outcome‑only rewards yields a gradient only when a task's rollout group mixes successes and failures, so under‑scaled exploration silences exactly the hardest, most instructive tasks. Policy drift: squeezing many updates out of a small task pool degrades the policy itself, as an unanchored objective lets the sampling distribution collapse exactly when saturation has already made informative groups rare. We present CANOPY (Coverage‑ANchored On‑PolicY RL), a minimalist protocol attacking both directly: scale same‑task exploration until the natural signal reappears, keep every update on‑policy, KL‑anchored, and confined to the agent's own action tokens, then cash in an enlarged interaction budget at test time. On AppWorld, a long‑horizon interactive coding benchmark, a Qwen3‑14B policy trained with CANOPY through environment interaction alone‑‑without task‑specific supervision, auxiliary credit signals, or elaborate agent scaffolding‑‑topped the public leaderboard (Feb. 2026; Test‑Normal TGC 86.9, Test‑Challenge 67.6), and the same design principles lift Qwen3.5‑9B on SWE‑bench Verified by 16.6 points. Agentic RL alone thus internalizes long‑horizon capability directly into a small open model; we plan to release the complete training stack at https://github.com/AlibabaResearch/SignalCoverageRL.
Authors:Walid Saidi
Abstract:
MutMem V1 introduced retention‑preserving, cryptographically authorized mutation for persistent agent memory but did not provide a complete portable verification contract or clean‑install reproduction path. MutMem V2 closes that publication gap without introducing a second memory engine. It specifies exact canonical bytes, domain‑separated object and bundle commitments, mandatory recall‑evidence membership and ordering, external trust anchors, identity epochs, revocation, authorization, request receipts, ordered disclosure, and three mutation terminal types. The released protocol contains 18 versioned object schemas, 39 recall vectors, 15 mutation vectors, and 37 closed recall failure reasons. Independent Node and Python implementations agree on verdict and primary reason for all 72 structural and cryptographic terminals; a production‑conformance corpus agrees on 42/42 cases across 28 required classes. A clean Node v26.8.1 installation reaches first‑boot, restart, and scheduler readiness with no experimental memories. A separately scoped 120‑unit Canary experiment supports only explicit‑marker traversal. Every public table regenerates from a self‑hashed aggregate, and an independent verifier reconstructs the statistics and claim boundaries. Historical V1 empirical results remain historical. MutMem V2 supports claims about portable integrity, authorization, traceability, conformance, and reproducibility under stated assumptions; it does not establish semantic truth, universal robustness, or independent replication.
Authors:Yuanyuan Jia, Shunpu Tang, Qianqian Yang
Abstract:
Visual token pruning reduces the inference overhead of multimodal large language models (MLLMs) by retaining only a subset of visual tokens. Existing methods usually select tokens based on importance or redundancy. However, we observe that these criteria produce stable spatial biases across inputs and do not always outperform simple Uniform Grid sampling, highlighting the value of broad spatial coverage. Motivated by this, we propose S^2Prune, a training‑free pruning method that preserves spatial coverage while adapting token density to local image structure. We first divide the image into regions and assign at least one token to each region to preserve coverage. The remaining token budget is then distributed according to Laplacian variation, giving more tokens to regions with richer structure. We then use Early Representation Change (ERC), computed from the first decoder block, to select representative tokens within each region. We evaluate S^2Prune across diverse settings and two MLLM architectures. On Qwen2.5‑VL‑7B‑Instruct, it achieves the highest average accuracy among the evaluated training‑free pruning methods. With only 32 of the original 576 visual tokens, it still retains 79.3% of the full‑model performance. Code is available at https://github.com/yuanyuanjia71‑spec/S2Prune.
Authors:Jia Ling, Yangfan Wang, Chen Tang, Haoming Tan, Yang Yang, Yi Guan, Jingchi Jiang
Abstract:
Tables are ubiquitous across diverse domains, yet reasoning over them remains a significant challenge for modern large language models (LLMs). Current approaches typically linearize tables into sequences, inherently overlooking their intrinsic two‑dimensional and hierarchical structure. To address this, we propose H2Table (Hierarchical Hypergraph‑Enhanced Table Reasoning), a novel framework that represents complex tables as hierarchical nested hypergraphs. To process this representation, we design a tailored hypergraph encoder to facilitate message passing between hyperedges (headers) and nodes (cells), thereby perceiving the semantic entailment relationships between them within complex tables. Furthermore, we introduce a set of learnable query vectors acting as a lightweight bridge to extract representative structural embeddings from the encoder into the LLM. Experimental results demonstrate that our approach effectively handles complex table question answering tasks with hierarchical nested headers. Notably, on the HiTab dataset, H2Table achieves an average improvement of 22.88% over state‑of‑the‑art baselines on highly complex tables with a nesting depth of four. Our code is available at: https://github.com/lila120/h2table.
Authors:Maryam Alshehyari, Dushyant Singh Chauhan, Samuele Poppi, Martin Takac, Salem Lahlou, Nils Lukas
Abstract:
Large language models can reproduce memorized text verbatim, yet copyright defenses are usually evaluated under incompatible protocols. We introduce CopyShield, a controlled benchmark comparing three representative defenses at distinct intervention levels: contrastive decoding (output), Direct Preference Optimization (behavioral), and activation intervention (representation). We evaluate CopyShield on two model families, LLaMA‑3.1‑8B and Mistral‑7B‑v0.3, using controlled memorization over five public‑domain books and a shared protocol measuring literal leakage, calibrated non‑literal leakage, utility, and degeneracy. Across these methods, intervention level is associated with distinct compliance‑utility trade‑offs. On LLaMA‑3.1‑8B, contrastive decoding remains near‑degeneracy‑free (0‑2%) but reaches a literal‑suppression floor at NV‑Recall 0.192‑0.203. DPO nearly eliminates literal leakage (0.263 to 0.002) but induces paraphrase‑loop degeneracy in 58% of QA outputs, with no utility gain over the SFT baseline. Activation intervention attains the lowest non‑literal flagging rate (1/200) by blocking 84% of non‑literal queries before generation. Human evaluation confirms that DPO has low coherence, whereas activation lowers perceived copyright risk through broad refusal. On Mistral‑7B‑v0.3, the output‑ and representation‑level patterns persist, while DPO degeneracy falls to 10‑14%, showing that its severity is model‑dependent. Together, CopyShield provides cross‑level reference baselines and identifies targeted non‑literal suppression as an open challenge. The code is available at https://github.com/spotai‑mbzuai/CopyShield.git.
Authors:Chujie Qin, Zilong Zhang, Zewei Chang, Chunle Guo, Ruixing Wang, Tao Hu, Ming-Ming Cheng, Chongyi Li
Abstract:
Image retouching is commonly formulated as enhancing overall visual quality through color adjustment, but in practice, it also serves to emphasize visual focus by guiding viewers' attention toward a specific subject or region. Achieving such focus‑oriented retouching is inherently challenging, as it requires well‑coordinated global and local adjustments to manipulate perceptual saliency while maintaining visual naturalness. This intricate process typically demands substantial professional expertise. In this study, we propose EyeControl, a MLLM‑driven agent with a diffusion‑based retouching executor that enables visual focus enhancement under weak user intent. With only a few clicks or coarse strokes, EyeControl directs visual attention to the intended region, effectively "dotting the eye" of the image. The core idea is to explicitly link the weak user intention with the target editing region and the corresponding tonal adjustment operations during retouching. To achieve this, the system first interprets the intent and image content to infer the visual focus and generate structured intent guidance for the retouching executor. Second, the retouching executor is encouraged to respond more strongly to the target region, explicitly aligning its attention map with a designed pseudo‑intent map. We also introduce an operation‑consistency constraint to improve coordination between global and local adjustments, achieving more natural and coherent retouching. Additionally, we contribute ControlArt‑Bench, a high‑quality evaluation dataset for visual focus enhancement. Extensive evaluations demonstrate that EyeControl yields perceptually appealing results with stronger intent alignment. Code can be found in https://github.com/DragonisCV/EyeControl.
Authors:Chaohao Yuan, Ruifeng Yuan, Zhuoxu Huang, Yu Rong, Hong Cheng, Hou Pong Chan, Chenghao Xiao
Abstract:
Text‑rich visual inputs require models that can read, retrieve, and compress language directly in pixel space, yet existing pixel‑text encoders struggle with fixed resolution pretraining, visual shortcut learning, weak visual grounding, and multilingual visual text understanding. In this work, we investigate the fundamental design principles required for robust visual text representation learning. Through systematic controlled ablations, we identify four critical components: variable image resolutions and rendered font sizes provide spatial proxies for high‑resolution document generalization; natural image‑text pairs are indispensable for grounding and prevent text‑only collapse; layout‑aware rendering helps prevent pixel‑level shortcuts; and a two‑stage multilingual curriculum enables effective cross‑lingual alignment. By integrating these principles into a scalable training recipe, we train Pixel Linguist II, a native‑resolution vision encoder trained with on‑the‑fly rendering, unified contrastive grounding, and a multilingual curriculum over 280M training examples. Pixel Linguist II sets new state‑of‑the‑art results on English, cross‑lingual, and multilingual Visual STS and ViDoRe, while also enabling better MLLM downstream evaluation. Notably, Pixel Linguist II remains robust under 80% visual token compression, showing great promise for optical context compression. Our code and resources are available at https://github.com/Pixel‑Linguist/Pixel‑Linguist‑II.
Authors:Jiyoung Park, InJae Oh, Jung Uk Kim
Abstract:
Change captioning is the task of generating natural language descriptions that explain the changes between a pair of images. Although different change types (e.g., color shifts, object additions) exhibit distinct visual cues and require specialized reasoning processes, existing methods often overlook these distinctions. To address this limitation, we propose Multi‑Expert Diagnosis for Image Change (MEDIC), a novel framework that introduces change‑type awareness by explicitly modeling change categories. MEDIC employs type‑specialized memory experts that dynamically retrieve type‑relevant visual patterns conditioned on the input. This design enables each expert to capture diverse variations within its change type while focusing on the most informative visual cues. By softly routing inputs across type‑specialized experts and learning dedicated representations for each change category, MEDIC generates more precise and type‑aware change descriptions. Extensive experiments demonstrate that the proposed MEDIC consistently outperforms existing methods across diverse and challenging datasets. The code is available at \hrefhttps://github.com/VisualAIKHU/MEDICGitHub.
Authors:Takumi Fujimoto, Hiroaki Nishi
Abstract:
Online adaptation can help edge time‑series forecasting under distribution drift, but its measured benefit is sensitive to evaluation choices. We study six public multivariate streams, including building‑sensor and smart‑meter data, under a leakage‑free streaming protocol. We identify two additional sources of comparison bias. First, the warmup budget of the static baseline has a two‑sided effect: insufficient warmup undertrains the baseline, whereas excessive warmup can degrade its pre‑drift generalization. Across six dataset‑backbone settings, the estimated adaptation benefit changes by 3.0 to 18.8 percentage points (pp) over the 1,000‑20,000‑step warmup range. Second, comparing SGD with momentum (SGD+m) and Adam at a shared default learning rate conflates optimizer quality with rate sensitivity. We select both the warmup budget and each optimizer's online rate using a held‑out pre‑drift validation slice without accessing test data. Under this validation‑only procedure, Adam outperforms SGD+m in 310 of 360 evaluated cells, while 4 Adam cells remain below the static baseline. We further characterize accuracy against adaptation‑state memory and A100‑measured per‑update latency for full, head‑only, and calibration‑based adaptation. In the evaluated PatchTST frontier settings, several parameter‑efficient variants are nondominated on the adaptation‑state‑memory axis. Smart‑meter analyses also show that reported gains depend on meter‑selection rules. These findings support a validation‑only commissioning procedure, while target‑device latency and energy remain to be measured. Code, data, and all reported numbers: https://github.com/keiotakmin/tsf‑edge‑adaptation.
Authors:Ruoyu Guo, Haonan Zhong, Maurice Pagnucco, Yang Song
Abstract:
Recent advancements in low‑light image enhancement have leveraged diffusion models for their strong ability to generate perceptually realistic, detailed images. Patch diffusion models further offer a promising solution to size‑agnostic image restoration while improving efficiency. However, existing methods typically rely on small, fixed patches (e.g., 64×64) that cannot capture image‑level brightness context, whereas enlarging the receptive field improves brightness and colour estimation but substantially increases computational cost. Moreover, low‑light images often exhibit uneven brightness across regions, making it necessary to ensure that locally enhanced patches remain visually coherent when combined into the full image. To address these limitations, we propose P‑PatchDiff, a scalable progressive patch diffusion framework for low‑light image enhancement that dynamically adjusts patch size throughout the denoising process, enabling a gradual shift from local to global views. A Multi‑Patch Alignment strategy is also introduced to normalise features across varying patch scales using an estimated global brightness proxy. Rather than pursuing pixel‑level reconstruction accuracy, P‑PatchDiff focuses on scalability and coherent brightness across the whole image, allowing the model to perceive multi‑scale information and better enhance regions with varying brightness. We empirically demonstrate that P‑PatchDiff effectively enhances images ranging from 400 × 600 to 4K and is 80× faster than existing patch diffusion models while using less than 9GB of memory. The code is available at https://github.com/RuoyuGuo/P‑PatchDiff.
Authors:Franciszek Bernat, Dawid Płudowski, Michał Jan Włodarczyk, Luca Longo, Jianlong Zhou, Andreas Holzinger, Riccardo Guidotti, Wojciech Samek, Przemysław Biecek
Abstract:
Scientific knowledge about AI models is produced faster than the community can organize it. Every few months a new foundation model reshapes the field and hundreds of papers, blogs, and technical reports document how each behaves or fails. Yet, these findings remain scattered and effectively unretrievable. To address this gap we present Modelpedia, an automated, LLM‑assisted framework that extracts findings about models from published papers, links it to the model, dataset, method, and concept it concerns, and aggregates the result into a searchable public catalog. Applying the prototype to accepted ICLR 2024 and 2025 papers, we extract over a thousand findings and, treating the catalog itself as an object of study, run a meta‑analysis of how the community investigates models. Now, we invite the community to explore, contribute to, and build on the open catalog, and to help establish model findings as a shared foundation for the meta‑science of AI.
Authors:Yiran Zhou, Yingyu Wang, Shoudong Huang, Liang Zhao
Abstract:
Robotic processing of irregular steel scrap requires dense 3‑D measurement to replace manual visual assessment in hazardous cutting workcells. The reconstructed map is used to estimate piece dimensions, boundary geometry, feasible preheating and cutting regions, and collision‑aware torch paths. The reconstruction errors therefore propagate directly to downstream measurement and planning. Existing multi‑view registration methods commonly rely on feature extraction and data association to establish correspondences between views. In workcells with smooth metallic surfaces, repeated structures, occlusions, and partial overlaps, however, wrong correspondences may be established, leading to inaccurate pose estimation and distorted reconstruction. This paper presents an adaptive layered depth‑map‑guided bundle adjustment framework for correspondence‑free multi‑view point cloud registration. The scene is represented by a global 2.5‑D grid, where each cell can adaptively maintain multiple depth hypotheses. Raw depth observations are directly projected into the global map to form depth constraints without explicit feature correspondences. At grid cells where multiple surfaces produce conflicting depths, a softmax‑based layer assignment links each observation to compatible depth hypotheses. The resulting nonlinear least‑squares formulation jointly refines sensor poses and the layered depth map, with correspondences implicitly induced by the depth‑map representation and projection model. Experiments on self‑collected industrial datasets show that the proposed method achieves consistently competitive reconstruction accuracy while maintaining robustness and low computational cost in challenging industrial scenarios. We release the open‑source code implementation at: https://github.com/YiranZhou‑Robotics/ADM‑BA.git
Authors:Daehwan Kim, Haejun Chung, Ikbeom Jang
Abstract:
Post‑hoc calibration corrects reported confidence, yet a multiclass calibrator can also change the associated top‑1 prediction. Accuracy captures only the net effect of these changes on correctness, not how often predictions change; the Top‑1 Prediction Change Rate (TPCR) instead measures this frequency. We propose Calibrator‑Output Repair for Top‑1 Decision Preservation (CORD), the first post‑fit adapter to impose exact prediction preservation by repairing the full calibrated probability vector. From the original and calibrated outputs alone, CORD determines the mass assigned to the original top‑1. The calibrated conditional distribution allocates the remaining mass over the other classes, yielding a repaired vector whose own argmax recovers the original prediction. On the calibration split, CORD coordinates the repaired masses to retain the calibrated outputs' mean mass on original predictions whenever attainable. The adapter alters neither the fitted calibrator nor its direct output, fits no additional supervised map, and requires no user‑ or validation‑tuned hyperparameter. Across CIFAR‑10/100 and ImageNet‑1K, CORD attains zero TPCR by construction and lowers mean ECE, NLL, and Brier relative to the corresponding direct outputs in every dataset; paired gains persist under distribution shift and across calibration‑set sizes. CORD thus removes the preservation constraint from calibrator fitting and assigns exact recovery of the original decision to subsequent output repair. Our code is available at https://github.com/labhai/CORD.
Authors:Saanvi Raghavendran, Abhishek Bhattacharjee
Abstract:
Reconstructing a damaged musical fragment is an inverse problem: the observed sequence contains partial information, while a raga encodes constraints limiting allowable completions. This paper formalizes a mathematical framework for this, proposing the Artificial Rosetta Stone (ARS). We separate three claims often conflated: a symbolic sequence can be reconstructed probabilistically; a sequence can be consistent with an explicit grammar; and a historical performance can be authenticated. We only support the first two. We model a raga via a finite alphabet and constraint system, using an order‑k Markov model for melodic probabilities. A symmetric Dirichlet prior yields a tractable posterior. We pose missing‑note reconstruction as a constrained MAP problem. For fixed‑length sequences and finite‑order constraints, optimization admits an exact dynamic‑programming solution with worst‑case time complexity O(TN^k+1). We derive the parameter count N^k(N ‑ 1), prove a concentration bound under explicit mixing assumptions, and analyze estimation error propagation. A reproducible synthetic experiment uses six raga‑inspired alphabets, orders k \in \1, 2, 3\, and masking rates up to 50%. This is a proof of concept, not historical reconstruction. A real‑audio feasibility pilot evaluates 30 usable sequences from 42 Yaman clips via automated pitch extraction, segmentation, and quantization. Lacking documented provenance and relying on automated transcription, this is not expert‑validated archival reconstruction. Claims are tied to stated conditions, not universal properties of Hindustani music. Code: https://github.com/mathacker23/ArtificialRosettaStone.
Authors:Ziyan Gan, Fangxin Liu, Chenyang Guan, Junjie Wang, Ning Yang, Haomin Li, Xiang Li, Siran Yang, Jiamang Wang, Lin Qu, Zongwu Wang, Li Jiang, Haibing Guan
Abstract:
Mixture‑of‑Experts (MoE) architectures scale Large Language Model (LLM) capacity efficiently by activating a sparse subset of experts per token. However, modern MoE inference remains heavily constrained by the rigid, whole‑expert abstraction. Existing frameworks manage, schedule, or prune experts as atomic execution units, which fixes the optimization boundary too early and leaves fine‑grained intra‑expert computational redundancy underexplored. In this work, we present PCoMoE, a path‑compositional execution framework that shifts MoE inference from coarse‑grained expert selection to fine‑grained path composition. PCoMoE incorporates a path‑level formulation of expert computation, a compatibility‑aware layer‑wise pruning strategy to suppress low‑value path combinations, and a hardware‑friendly execution engine to exploit reusable sub‑expert structures under strictly bounded overheads. Experimental results demonstrate that PCoMoE achieves up to a 1.31x end‑to‑end inference speedup while enhancing model accuracy by 10%. The code is available at https://github.com/gzyyy0/PCoMoE
Authors:Che Hyun Lee, Sangkwon Park, Donghun Kang, Dongwook Lee, Youngho Cho, Heeseung Kim, Sungroh Yoon
Abstract:
Current speech synthesis struggles with code‑switching, which mixes a foreign language phrase into a primary language utterance, causing the phrase to be spoken with the primary language's accent rather than its native one. We propose Phrase‑Localized Language‑Contrastive Guidance (LCG), a training‑free inference framework that restores a native accent to code‑switched phrases in cross‑lingual text‑to‑speech. LCG replaces the single language guidance applied across the whole utterance with a separate guidance for each region, so each part is guided by its own language. To choose where to apply this localized guidance, we propose a self‑attention probing technique that finds the phrase boundaries without external alignments. Together, these components generate speech in which each region carries the accent of its own language, requiring no fine‑tuning or auxiliary models. Across diverse language pairs, LCG robustly increases the nativeness of the code‑switched phrase while suppressing accent leakage, and preserving overall speaker identity and naturalness.
Authors:Shiyu Li, Zi-Yuan Hu, Shijia Huang, Yanyang Li, Yiwu Zhong, Liwei Wang
Abstract:
Despite their strong multimodal understanding ability, multimodal large language models (MLLMs) incur substantial computational overhead when processing long visual token sequences. To reduce inference costs, recent studies have explored visual token pruning through vision‑centric or text‑guided strategies. However, these methods often overlook high‑norm outlier tokens, i.e., tokens with abnormally large feature norms, leading to suboptimal pruning decisions. In this work, we show that such high‑norm outlier tokens are highly redundant in both feature and spatial dimensions, yet are often mistakenly preserved as informative cues by existing methods. Motivated by this observation, we propose SinkPruner, a training‑free visual token pruning framework for efficient MLLM inference. SinkPruner follows a coarse‑to‑fine design with two key modules: a visual sanitizer that filters high‑norm redundancies and alleviates attention sink and attention dispersion, and a text‑guided pruner that further retains tokens semantically aligned with the text query. Extensive experiments on twelve image‑language and four video‑language benchmarks demonstrate the effectiveness, efficiency, and generalizability of our framework. Notably, SinkPruner preserves 96.5% (91.8%) of the original performance of LLaVA‑1.5 (Qwen2.5‑VL) under an 89% token reduction. Experiments further indicate that our visual sanitizer exhibits promising transferability in enhancing the performance of existing pruning methods. Our code is available at https://github.com/LaVi‑Lab/SinkPruner.
Authors:Abdulkader Ghandoura, Marsil Zakour, William Consagra, Yogesh Rathi
Abstract:
Resolving complex fiber geometries in brain white matter requires high‑resolution diffusion MRI at the cost of long acquisition times. This leads many clinical protocols to opt for low‑resolution scans, making downstream microstructure estimation and tractography challenging. Implicit neural representations (INRs) can model the diffusion signal continuously, enabling native single‑subject super‑resolution by querying the network at arbitrary spatial coordinates, yet existing methods often suffer from long training times and lack a mechanism to incorporate anatomical priors to regularize super‑resolution by constraining the space of plausible reconstructions. To address these limitations, we propose a novel transfer‑learning framework that pre‑trains an INR on a high‑resolution template and then adapts it to subject‑specific scans via registration and fine‑tuning. For 4× through‑plane super‑resolution from 5 mm to 1.25 mm on Human Connectome Project (HCP) data, our method reduces NRMSE by 36‑49% and increases FSIM by 24‑43% over a recent baseline with 6× faster training, outperforming competing INR‑based methods across both image quality and domain‑specific metrics. Code is available on the project page at https://abdulkaderghandoura.github.io/research/msc‑thesis/ .
Authors:Jeonghyeok Do, Seungchul Lee, Munchurl Kim
Abstract:
SAR‑to‑EO image translation aims to generate electro‑optical (EO) imagery from synthetic aperture radar (SAR) observations. Existing latent diffusion approaches typically inherit a predetermined autoencoder, although reconstruction fidelity can vary substantially across codecs and modalities. Because the latent codec affects the round‑trip preservation of both SAR conditions and EO targets, codec selection constitutes a fundamental design choice; nevertheless, existing methods largely rely on codecs pretrained on natural images. To remedy this, we introduce ReFlowSET, a conditional latent flow‑matching framework that selects its codec through a joint SAR‑‑EO reconstruction audit. Rather than inheriting a heavyweight pretrained generator, ReFlowSET trains a substantially smaller conditional DiT from scratch in the selected latent space, using dual‑stream SAR conditioning followed by joint feature refinement. To provide semantic guidance for this from‑scratch training, intermediate noisy‑EO features are aligned with clean target‑EO representations extracted by a frozen vision foundation model. This alignment is used only during training and introduces no additional inference cost. Experiments on QXS‑SAROPT and SAR2Opt demonstrate state‑of‑the‑art performance across diverse perceptual fidelity and distributional metrics. Code and pretrained weights are publicly available at https://github.com/KAIST‑VICLab/ReFlowSET.
Authors:De Hu, Xue Du, Qingying Zhao, Qintuya Si
Abstract:
Open‑fit hearing aids have attracted growing attention due to their superior wearing comfort. However, the open‑fit design inevitably causes acoustic leakage into the ear canal, degrading the performance of existing binaural speech enhancement (BSE). To this end, we propose ABSE‑NET, an active BSE framework integrating active noise control (ANC) with BSE to jointly enhance target speech and suppress acoustic leakage. The ABSE‑NET pipeline cascades a binaural MVDR (BMVDR) with a lightweight neural network (LNN). The former achieves a coarse BSE, whereas the latter simultaneously cancels acoustic leakage and compensates for BMVDR‑induced distortion. The LNN uses an encoder‑decoder with a feature fusion module, which includes frequency‑time dependency learning and convolutional attention blocks. Unlike traditional BSE+ANC solutions via adaptive filtering, ABSE‑NET needs no in‑ear microphone in practical deployment. Experiments validate its superiority over state‑of‑the‑art methods. Code repository: https://github.com/Bream101/ABSE‑NET.
Authors:Waikit Xiu, Qiang Lu, Junbiao Chen, Xiying Li
Abstract:
Removing an object is not the same as filling its mask. Cast shadows and contact shading usually lie outside the user‑provided instance mask M_obj, so a frozen Fill model that edits only that mask leaves the object's photometric footprint on nearby surfaces. Supervised removers learn this joint erasure from paired clean plates. Training‑free editors freeze pretrained weights, yet most still treat M_obj as the entire editable support and steer sampling with CLIP or DINO energies that do not predict the occluded scene. We present PredErase, a training‑free inference procedure on frozen FLUX.2 and I‑JEPA. The method separates where Fill may rewrite pixels from what structure should occupy the hole. A contact‑band expansion M_flux of M_obj exposes local residuals on the supporting plane. I‑JEPA, pretrained for masked token prediction, supplies a context‑conditioned hole target in representation space; sparse projected gradients align decoded Fill completions with that target inside the instance, while coordinates outside the packed support stay locked. Under instance‑only masks on RemovalBench, RORD‑Val, and DEFACTO‑Val, PredErase improves the native FLUX.2 backbone. Supervised removers remain stronger on several full‑image appearance metrics; the supported claim is training‑free object‑and‑effect editing of frozen Fill, not replacement of paired‑data erasers.
Authors:Jiuwu Hao, Ziyi Ni, Liguo Sun, Yuting Wan, Yueyang Wu, Ti Xiang, Haolin Song, Pin Lv
Abstract:
Collaborative perception shares information among multiple agents to obtain a comprehensive scene representation, enhancing the perceptual capability of individual agents. However, most existing methods rely on transmitting and fusing dense feature maps for collaboration, which incurs inevitable communication overhead and heterogeneity challenges, limiting their practicality for real‑world deployment. To address these challenges, we propose CERF, a novel Communication‑Efficient and Retraining‑Free framework for open heterogeneous collaborative perception. In CERF, we introduce a new virtual modality (termed Poture), which is generated from the perception outputs of other agents, to augment the extracted Bird's Eye View (BEV) features of the ego agent. To mitigate transmission delays, we employ a Kalman‑filter based tracker and a motion forecasting model to derive the current predictions from historical perception results. Extensive experiments demonstrate that CERF achieves performance comparable to mainstream intermediate‑collaboration methods while reducing communication overhead by 95% across various downstream tasks. Furthermore, CERF enables seamless integration of unknown heterogeneous agents into the existing collaborative framework without additional retraining costs. Code is available at https://github.com/uestchjw/CERF.
Authors:Kangjia Zhao, Jiajun Li, Haozhan Shen, Wei Chow, Linfeng Li, Hang Song, Lingdong Kong, Chen Zhi, Tiancheng Zhao, Songhua Liu, Jianwei Yin
Abstract:
Multi‑turn tool calling is a core evaluation scenario for large language model (LLM) agents. On public tool‑calling benchmarks, open‑weight models now approach or even surpass closed‑source frontier models in aggregate accuracy. However, this metric averages over many different multi‑turn situations and obscures whether progress is balanced across them. We propose an action‑class‑oriented diagnostic framework that decomposes multi‑turn failures into two orthogonal modes: action‑class miscalibration and action‑execution failure. The framework operates over a four‑class action space (TOOL_CALL/ASK/REFUSE/CONFIRM) and introduces a self‑revealing upper bound Acc <= GAR (Gold Action Recall); the two modes show up as bound violation (Acc > GAR, exposing state‑grader masking of miscalibration) and large bound slack (GAR >> Acc, localizing execution failure within TOOL_CALL). We validate it on a panel of tool‑calling models across multiple multi‑turn benchmarks. Across our panel, the diagnostic reveals action‑class miscalibration as a substantial failure mode the state grader cannot see. This gap inflates standing for heavily tool‑trained families, which our diagnostic separates from families with context‑appropriate action choice. Calibration is reshapable through context‑only perturbations, but the reshape is heterogeneous: a single perturbation moves accuracy in opposite directions across families (up to +11.5 vs ‑21.0 pp on the same scenario), and its effect further depends on the perturbation mechanism. We argue that multi‑turn tool‑calling evaluations should supplement aggregate accuracy with action‑class diagnostics that expose what the model actually does in each scenario.
Authors:Yinuo Xu, Yuwei Liang, Jianjie Cheng, Meng Wang, Yongcan Yu, Shuo Lu, Jian Liang
Abstract:
Deep Research agents tackle knowledge‑intensive tasks through multi‑round retrieval and decision‑oriented generation. However, these agents suffer from severe overconfidence, making their expressed confidence unreliable for user trust and downstream abstention. To address this, we augment the Deep Research pipeline with step confidence elicitation after each retrieval, building on the commonly used post‑answer verbalized confidence. Interestingly, we find that Evidence Confidence (E‑Conf), elicited after the final retrieval step, provides a stronger uncertainty signal than Answer Confidence (A‑Conf), elicited after answer generation, and that A‑Conf is largely shaped by E‑Conf. Based on these findings, we propose DualStake, a dual‑path calibration method that applies margin‑clipped, confidence‑dependent stake rewards to jointly align E‑Conf and A‑Conf with answer correctness while limiting extreme confidence optimization. Experiments on Qwen2.5‑7B, Qwen2.5‑7B‑Instruct, and Qwen3‑4B across 8 QA benchmarks demonstrate that DualStake consistently improves calibration without sacrificing answer accuracy. The code is available at https://github.com/FloXXXt/DualStake.
Authors:Zhe Shen, Liyuan Lou, Yifei Yu, Guanbo Wang, Quanjian Ji, Xin Wang, Zongqian Zhan
Abstract:
While feed‑forward 3D reconstruction (3R) offers efficient end‑to‑end modeling, its application in large‑scale UAV mapping is hindered by the prohibitive memory cost of Transformer attention. Current scalable streaming 3R methods assume temporally and spatially continuous inputs, rendering them ineffective for the weakly ordered or unordered image streams common in cross‑strip UAV operations. To address this, we propose On‑the‑Fly3R, a training‑free, progressive online 3D reconstruction framework for large‑scale UAV images that upgrades various 3R backbones for large‑scale UAV scenarios. Our method enables reconstruction from unordered inputs via retrieval‑guided dynamic subset construction, which adaptively selects spatially relevant images. To further improve the robustness, a validation‑rejection‑retry mechanism is designed to guarantee global consistency, performing a pre‑integration consistency check and automatically rejecting misaligned images and retrying with alternative subset. Finally, inspired by VSLAM, pose graph optimization based on the retrieval loop closure is employed to mitigate camera drift. Evaluations on several UAV benchmarks show that our On‑the‑Fly3R successfully scales various 3R models to over 5,000 images across square‑kilometer UAV scenes, delivering substantially superior accuracy compared to several SOTA streaming 3R methods. Code is available at https://github.com/Sh1nZzz/On_the_Fly3R
Authors:Zhongru Chen, Yuan Wu, Yi Chang
Abstract:
Large language models are increasingly used as interactive recommender assistants. Their evaluation should therefore go beyond plausible item recommendation and test whether they can recognize flawed recommendation requests. Existing recommender benchmarks mainly assess ranking, generation, or preference satisfaction, while existing error‑detection benchmarks are usually not grounded in recommendation‑specific user and candidate evidence. To address this gap, we introduce RPCBench, a benchmark for evaluating Recommender‑Premise Critique: the ability to detect, diagnose, and properly handle faulty premises in natural‑language recommendation requests. RPCBench contains evidence‑grounded test instances from five recommendation domains and covers ten types of premise failures. Each instance provides a visible recommendation context and a corrupted user query. We further design a fine‑grained evaluation framework that measures proactive detection, error localization, post‑detection handling strategy, and evidence faithfulness. Through a systematic evaluation of 11 LLMs, we find that proactive detection is the main bottleneck in Recommender‑Premise Critique, and models perform worst on underspecified‑premise errors. We also observe that target‑critical information density matters more than redundant evidence, and that longer reasoning does not monotonically improve critique quality: performance peaks at intermediate reasoning length, while overly long reasoning is accompanied by an overthinking penalty. The code is available at https://github.com/ZhongruChen/RPCBench.
Authors:Yosel Delgado, José G. Buenaventura-Carreón, Floris Erich, Roman Mykhailyshyn, Tomohiro Motoda, Koshi Makihara, Yukiyasu Domae
Abstract:
High‑precision insertion remains a fundamental challenge in robotic manipulation due to the strict alignment requirements and contact‑rich interactions involved. Although peg‑in‑hole tasks are widely used for evaluation, existing bench‑ marks often rely on fixed task configurations, limiting their ability to assess robustness and generalization across different insertion scenarios. This paper introduces a reconfigurable peg‑in‑hole benchmark designed to evaluate task generalization in high‑precision insertion. The benchmark consists of a set of fully 3D‑printable modular components, including multiple peg geometries, tolerance levels, and configurable base structures that can be combined to generate a large variety of insertion and assembly tasks. By varying object layouts, orientations, and task structures while maintaining controlled physical conditions, the benchmark enables systematic evaluation of adaptation to unseen scenarios. To support reproducibility, we additionally provide a scenario generation tool capable of producing standardized task configurations and machine‑readable task descriptions. The scenario generation tool and the STL files of the benchmark pieces are available through the project repository: https://github.com/aistairc/peg‑in‑bench.
Authors:Hala Djeghim, Nathan Piasco, Luis Roldão, Moussab Bennehar, Dzmitry Tsishkou, Céline Loscos, Désiré Sidibé
Abstract:
Modifying the illumination of driving images is a fundamental challenge, as most datasets are captured at specific times of day. Existing methods rely on synthetic data or paired multi‑illumination supervision, which limits their generalization to the diverse and challenging conditions of real‑world scenarios. To address this, we propose HELIOS, a novel image relighting approach that relies on unlabeled real‑world datasets without requiring any paired images for training. Our approach integrates albedo‑based conditioning into a cycle‑consistent diffusion pipeline to prevent identity collapse and ensure accurate domain translation. To handle low‑visibility nighttime conditions, we introduce a robust albedo distillation strategy that transfers structural stability from the daytime domain. Additionally, we replace traditional text prompts with a fine‑grained control mechanism based on GPS‑derived solar angles, enabling smooth and continuous lighting manipulation across the day‑night cycle. Through extensive evaluation and a user study, we demonstrate that HELIOS produces structurally consistent and realistic results in both night‑to‑day and day‑to‑night tasks, outperforming state‑of‑the‑art methods.
Authors:Tongtong Wang, Mingzhu Xu, Chenglong Yu, Jing Wang, Xiaohui Lin, Weili Guan
Abstract:
InfRared Small Target Detection (IRSTD) is a challenging task. Relying solely on pixel‑level information, vision‑only methods struggle to distinguish targets from clutter. Current multimodal methods typically describe both targets and backgrounds with a single textual prompt. Such an approach lacks dedicated regional guidance and ignores infrared semantic asymmetry. Consequently, it provides insufficient background suppression information and introduces severe feature optimization conflicts, overwhelming small targets with noise. To address these issues, we propose a novel Asymmetric Dual‑text Guided Network (ADGNet). Specifically, accounting for the infrared semantic asymmetry, we first design the Asymmetric Dual‑text Prompt (ADP), comprising an image‑agnostic abstract target prompt and an image‑specific detailed background prompt. To leverage these prompts, we introduce an Asymmetric Dual‑Branch Interaction (ADBI) module to separately guide visual features with their respective text priors, protecting targets from noise while suppressing background clutter. Subsequently, we introduce an Adaptive Feature Aggregation (AFA) module to dynamically fuse features from the two branches. Furthermore, we construct a multimodal Asymmetric Image‑Text Infrared (AITIR) dataset by providing asymmetric text annotations for three public datasets (IRSTD‑1K, NUDT‑SIRST, and SIRST). Extensive experiments demonstrate that ADGNet outperforms 21 state‑of‑the‑art (SOTA) methods. Code is available at https://github.com/iLearn‑Lab/MM26‑ADGNet.
Authors:Kewei Li, Rongying Zhang, Xueli Wang, Xiwen Gong, Zhongjian Wang, Qiuchen Zhao, Lan Huang, Ruochi Zhang, Fengfeng Zhou
Abstract:
Token aggregation converts token‑level representations into fixed‑dimensional sample representations, but most pooling methods operate only in the original token space. We introduce Frequency‑Domain Latent‑attention Gated Pooling (FLaG), a plug‑in aggregation module that re‑expresses encoder outputs in the Fourier domain before final pooling. FLaG represents the nonredundant rFFT spectrum through concatenated real and imaginary components, summarizes spectral tokens with learnable latent queries, derives a sample‑conditioned channel gate, and reconstructs modulated token representations for downstream aggregation. We evaluate the same architecture across ESM2‑based antimicrobial peptide (AMP) activity prediction, ResNet18 image classification on CIFAR‑10 and CIFAR‑100, and three RoBERTa‑based language tasks. FLaG achieves the best macro‑averaged Spearman correlation coefficient, RMSE, and Recall@50 across four AMP backbone‑species settings and the highest top‑1 accuracy on CIFAR 10. It also achieves the best mean results on five of seven language metrics, although mean pooling remains strongest on STSBenchmark. AMP‑side mechanistic analyses reveal low‑frequency prediction sensitivity across most encoder layers, with increased relative high‑frequency sensitivity in the final layer, and pronounced peptide‑specific positional responses. The residual gate broadly amplifies spectral channels while preserving the low‑frequency‑dominated energy profile, whereas latent cross‑attention exhibits sample‑ and species‑specific spectral allocation. Overall, FLaG provides a transferable frequency‑domain aggregation bias across protein, visual, and textual representations, with benefits that depend on the backbone and downstream task. Supplementary materials, source code, and data are available at https://www.healthinformaticslab.org/supp/ and https://github.com/Kewei2023/AMPCliff/tree/FLaG.
Authors:Yajing Yang, Yunshan Ma, Kelvin J. L. Koa, Min-Yen Kan
Abstract:
We argue that financial report generation should operate at the analytical rather than structural level, composing content from data‑derived insights rather than high‑level topics or sections. To this end, we propose AnalysisBank, which distills expert reports into a reusable library of Analyses, each pairing a data signal, an analytical move, and the expert span it was derived from. At inference time, AnalysisBank matches input signals to library entries and applies the retrieved moves to compose the report. A study of Analyses distilled from 550 expert reports reveals a heavy‑tailed distribution of 47‑52 signal types spanning 13 move types. On two financial benchmarks across four LLM backbones, AnalysisBank increases the proportion of novel, data‑grounded insights by 1.7‑3.7x over structural‑level baselines. Transfer to scientific writing suggests that the distinction generalizes beyond finance. Code and the distilled Analysis library are available at https://github.com/yajingyang/AnalysisBank.
Authors:Xiaowei Sun, Jin Li, Yili Hong, Yikun Fu, Yanghua Xiao
Abstract:
While reinforcement learning has enabled LLM‑based search agents to invoke external tools, existing methods train under fixed budgets and cannot adapt when constraints vary at deployment. We propose AnySearch, a framework that enables a single policy to perform budget‑aware search under any budget constraint through a training scaffold and curriculum reinforcement learning. In the first phase, we train the agent with explicit budget state injection and structured reasoning prompts that guide efficient allocation under linearly decaying budgets. In the second phase, the scaffold is removed and the agent learns to operate autonomously under adaptively sampled budget constraints, matching inference conditions. Both phases are optimized with a composite reward that couples answer accuracy with budget efficiency through absolute and relative signals, where an adaptive weight amplifies the efficiency signal for high‑accuracy queries and attenuates it for low‑accuracy ones. Extensive experiments on seven general and multi‑hop QA benchmarks show that our method outperforms baselines across all budget scales, generalizes to unseen constraints beyond the training range, and achieves superior tool productivity without excessive token overhead. Our code is available at https://github.com/xwsun01/AnySearch.
Authors:Zhen Wei, Edouard Dufour, Colin Pelletier, Michaël Bauerheim, Pascal Fua
Abstract:
We propose DiffGeo, a latent space diffusion‑based generative framework for aerodynamic design space exploration under extreme data scarcity. DiffGeo combines a learned latent space model for automatic shape parameterization, with a diffusion sampler to directly generate novel, geometry‑valid and controllable designs. We validate the approach on a series of case studies: (i) a 2D airfoil generation benchmark, where DiffGeo's latent diffusion model is compared against GAN‑ and VAE‑based baselines in terms of sample quality, diversity and constraint adherence under limited data; (ii) integration into a surrogate‑based optimization pipeline, where DiffGeo's conditional sampling produces task‑informed airfoil data that improve both surrogate modeling and optimization performance; and (iii) extension to 3D turbomachinery blade prototyping, where DiffGeo generates realistic and high‑performance blade geometries from a small set of reference designs. Throughout these investigations, DiffGeo achieves high‑quality and diverse shape generation with at least an order of magnitude less data than alternatives, decouples geometry representation from design targets for flexible reuse, and seamlessly incorporates complex design constraints via energy‑based conditioning. These capabilities demonstrate DiffGeo's potential to enhance early‑stage design by automating design space exploration‑‑improving efficiency, expanding design diversity and embedding engineering knowledge through controllable guidance.
Authors:Weiyi You, Jinhua Zhang, Xingyu Zhou, Wei Long, Junyu Lou, Shuhang Gu
Abstract:
Pixel‑space diffusion has recently emerged as a promising direction for high‑fidelity image generation by modeling images directly in the original pixel domain. However, pixel‑space diffusion is computationally demanding due to the extremely high dimensionality of natural images. For efficiency, existing pixel diffusion models either compromise fine details with large‑patch tokenization or confine subsequent refinement within individual patches. Such intra‑patch refinement inevitably restricts structural continuity across patch boundaries and long‑range token interactions, limiting refinement quality. To address these issues, we propose PixSGR, a novel Pixel diffusion framework with Sparse Global Refinement tailored for modeling the distribution of natural images directly in pixel space. PixSGR starts from a supervised low‑channel bottleneck to efficiently capture the low‑dimensional manifold of natural images. It then progressively expands the channel dimensionality and spatial resolution to recover increasingly fine‑grained structures. At the spatial refinement stage, coarse‑scale attention maps preselect globally relevant interactions to pre‑sparsify fine‑scale attention, enabling non‑local refinement beyond isolated patches without the quadratic cost of dense attention. Extensive experiments on ImageNet validate the effectiveness of PixSGR. It achieves an FID of 1.51 at 256×256 and maintains performance when scaled to 512×512, attaining an FID of 1.60.
Authors:Yinghao Chen, Zixi Chen, Bingxiang He, Ziqing Qiao, Huan-ang Gao, Yinuo Xu, Yuxin Zuo, Zeyuan Liu, Yuhao Zhan, Chaojun Xiao
Abstract:
Humans need to study only a handful of well‑written textbooks to master a discipline and attempt its hardest problems. We argue that an ideal self‑evolution method should share the same property, that is autonomously learning from raw training material for transferable problem‑solving capability. However, we still lack a direct measurement for it. We introduce StudyBench, a controlled physics benchmark that directly measures how efficiently a self‑evolution method converts training material into capability. We organise the test set into an Application Set, consisting of difficult textbook problems and evaluating absorption ability, and a Transfer Set, consisting of olympiad‑level problems and evaluating transfer ability. Benchmarking representative self‑evolution methods across three base models, we find that improvements on the Application Set rarely translate to the harder Transfer Set. A guidance ablation exposes a Guidance Gap: even the strongest method closes only a small fraction of what the same material unlocks when supplied as in‑context guidance. Besides, every method hits a Compute Plateau, saturating well before exhausting its compute budget. The remaining gap is therefore a method problem rather than a data or compute problem. By offering a clean and controlled benchmark, StudyBench turns self‑evolution progress from an open‑ended pursuit into a measurable target for future research. Our code is released at https://github.com/thunlp/StudyBench.
Authors:Jaee Ponde, Roshni Agarwal, Subhashis Banerjee
Abstract:
Neural networks are increasingly employed to identify both well‑defined and ambiguous concepts, yet output‑level metrics reveal little about how those concepts are represented internally. Our study asks if these networks exhibit conceptual separation: if examples of the same concept form coherent representations, and whether related concepts lie closer together in the representation space. We examine this conceptual organisation in Convolutional Neural Networks (CNNs) and Large Language Models (LLMs) through geometric and distributional analysis of their internal activations. In CNNs, familiar ImageNet concepts form coherent and semantically ordered representations, while this coherence weakens for unseen concepts and suffers within‑class domain shift. In LLMs, clearly distinct domains remain well separated, related subdomains move closer together, and the distinction between ambiguous topics collapses at both the mean and covariance level. These results suggest that conceptual separation can reveal structure that output accuracy alone cannot, and may serve as a useful diagnostic of how robustly a model represents the concepts it is asked to identify. Code and data available on \hrefhttps://github.com/JaeeRoshniCapstoneProject/Are‑You‑Thinking‑What‑I‑m‑Thinking‑Examining‑Conceptual‑Separation‑in‑Neural‑ArchitecturesGitHub.
Authors:Jinhu Qi, Minda Hu, Wentao Zhang, Weiqiang Jin, Yanyu Chen, Junli Wang, Irwin King
Abstract:
Large language models (LLMs) increasingly handle in‑context learning (ICL) tasks where a long, novel context defines the rules, knowledge, and output schema for a series of questions. On benchmarks that grade against every detail of the context, even strong open‑weights models pass only 12‑16% of tasks: a single overlooked rule fails the whole response. We argue this brittleness is structural: the dominant "read‑and‑reason" paradigm asks the model to extract, plan, generate, and self‑verify in one forward pass. We therefore ask whether explicit context compilation can fix it, how it compares to existing long‑context strategies (gist retrieval, multi‑agent self‑play), and where the resulting harness benefit holds across task structure and model scale. We propose the Context Compilation Architecture (CCA), whose central novelty is a typed intermediate representation (IR) with fixed slots (rules.must_do, must_not, conditional, output_spec, available_tools, data_profile) into which any prose context is compiled once; executable verifiers and a violation‑gated correction loop follow as downstream consequences. On CL‑bench (1,899 tasks across 4 open base models), CCA outperforms vanilla prompting and two long‑context baselines (ReadAgent‑P, Ctx2Skill) on every base model, lifting Kimi K2.5 from 15.4% to 21.4% with gains concentrated on rule‑dense sub‑categories. Code and cached completions are available at https://github.com/TonyQJH/cca‑emnlp2026.
Authors:Minsik Choi, Geewook Kim, Young Geun Kim
Abstract:
Fine‑tuning a pretrained LLM into a vision‑language model (VLM) can erode the backbone's text capability, with the damage concentrated on tasks that require following exact output rules, such as instruction following, chain‑of‑thought reasoning graded on a strictly parsed final answer, and similar evaluations with strict graders. We trace this gap to attention‑sink corruption: VL fine‑tuning perturbs the early sink position that anchors a large fraction of attention probability, and how well the base LLM preserves its sink tracks how much of the affected capability survives adaptation. Building on this view, we introduce Sink Strength, a single scalar computed on the base LLM in a few seconds on a single GPU that predicts post‑VL degradation without any VL training. It consistently tracks relative degradation across the six VLM‑LLM pairs and multiple format‑sensitive tasks. Complementing this diagnostic, we find that post‑pretraining QK‑RMSNorm injection fails to reproduce the protection of native QK‑RMSNorm, while several off‑the‑shelf weight‑merging settings fail to recover the lost capability after VL training. These negative results underscore the value of screening backbones with Sink Strength before VL training and narrow the intervention space toward head‑selective training‑time protection.
Authors:Siyu Li, Jin Yang, Weiheng Liang
Abstract:
As AI video generators achieve cinematic realism, reliable detection becomes essential for safeguarding digital trust. We identify cross‑scale coupling mismatch as a new forensic signal, where scale refers to the level of abstraction (semantic dynamics vs. pixel‑level residuals): in natural videos, macro‑level temporal dynamics and micro‑level residual patterns are intrinsically coupled by the unified imaging physics pipeline, whereas AI generators, whose training objectives do not explicitly preserve this joint distribution, systematically violate this coupling. Detecting such mismatch is challenging because it requires independently extracting information at both scales while simultaneously quantifying their cross‑scale relationship. We propose RIFT (Representation Inconsistency Forensics on Trajectories), an orthogonal forensic framework that addresses this through three interlocking components: a macro stream that builds a dynamic baseline of expected temporal evolution via differential geometry and persistent homology on learned manifold trajectories, a micro stream that acts as a sensitive forensic probe via steganalytic filtering and temporal modeling, and a coupling divergence module that measures the conditional dependency between the two streams. Gram‑Schmidt orthogonality guarantees the information‑theoretic validity of this measurement. Experiments on two benchmarks (VidProM, 120K videos, 7 generators; GenVidBench, 68K videos, 4 generators) demonstrate that RIFT achieves 99.33% and 99.72% F1‑score respectively, with 97.87% unseen‑generator detection rate in leave‑one‑out evaluation, while exhibiting encoder agnosticism: scaling from ViT‑S/14 (22M) to ViT‑L/14 (300M) changes F1 by less than 0.1%, and switching to a different encoder family (DINOv1) reduces F1 by only 0.73 pp. Code is available at https://github.com/Litsay/RIFT
Authors:Lu Cheng
Abstract:
Inference‑time search with large language models (LLMs) often concentrates on a small set of structurally or semantically similar trajectories, leaving alternatives underexplored‑‑‑a failure mode we call reasoning basin collapse. We introduce BASIN, a training‑free, structure‑aware selection method that groups reasoning states into basins and penalizes repeated visits to the same strategy, thereby reallocating search across genuinely distinct reasoning paths under a fixed compute budget. Under matched inference budgets, BASIN improves over Tree of Thoughts (ToT) by up to +22pp on Game of 24 and +6.7pp on MuSR. A quality‑aware variant, QA‑BASIN, further improves robustness by preserving high‑quality basins when unconditional diversification over‑explores. To explain when basin‑aware selection helps, we introduce the redundancy gap Δ, which measures how differently search concentrates for correct versus incorrect predictions: standard ToT often operates near Δ\approx 0, while BASIN consistently shifts Δ positive. More broadly, BASIN suggests structure‑aware selection as a simple and general approach to improving inference‑time reasoning. Code can be found at https://github.com/GitHubLuCheng/basin.
Authors:Yufan Dang, Shu Yao, Bowen Lai, Chenting Xu, Ruijie Shi, Wai-Shing Leung, Huatao Li, Chen Qian, Zhiyuan Liu
Abstract:
Large language model (LLM)‑based multi‑agent systems (MAS) have shown strong potential for solving complex tasks, yet their development forces a tradeoff: code frameworks are expressive but engineering‑intensive, while no‑code builders simplify authoring but constrain agent interactions to author‑defined workflows. We present ChatDev 2.0: DevAll (hereafter DevAll), a no‑code platform for building, executing, and inspecting heterogeneous MAS that delivers both high expressiveness and ease of use. In terms of expressiveness, DevAll pairs a declarative executable graph abstraction with a cycle‑aware execution engine, so that heterogeneous agents and dynamic and cyclic interactions can be represented and executed within a single framework. For ease of use, an integrated visual interface lets users author, run, monitor, and inspect MAS, including human‑in‑the‑loop steps, entirely without writing code. Experiments demonstrate that DevAll reproduces state‑of‑the‑art MAS across three representative tasks at competitive performance and without task‑specific orchestration code, highlighting its effectiveness as a general‑purpose platform for LLM‑based MAS. DevAll is available at https://github.com/OpenBMB/ChatDev.
Authors:Kai Chen, Josephine Lamp, Somesh Jha, Tianhao Wang
Abstract:
Differentially private (DP) synthesis has been extensively studied for tabular and image data separately, yet many real‑world datasets contain images paired with multivariate tabular records. Synthesizing such data is particularly challenging under DP, as the two modalities favor different private learning mechanisms while their dependence must also be preserved. To address this challenge, we propose DP‑TabImage, a modality‑specialized framework for private paired synthesis. DP‑TabImage instantiates the factorization p(x,y)=p_T(y)p_I(x\;|\;y) using a private Probabilistic Graphical Model for the multivariate table distribution and a table‑conditioned diffusion model trained with DP‑SGD for the conditional image distribution. To facilitate conditional learning under clipped and noisy gradients, we further pretrain the model on private table‑image prototypes, pairing privately constructed attribute‑conditioned images with tabular vectors derived from the already private tabular model at no additional privacy cost. Experiments on three real‑world datasets show that DP‑TabImage achieves a strong balance among tabular fidelity, image fidelity, and cross‑modal alignment. Our analysis further reveals that visual warm‑up primarily improves marginal image fidelity, whereas aligned table‑image warm‑up is critical for improving cross‑modal correspondence. Our source code is available in the GitHub repository, https://github.com/KaiChen9909/TabImage_Syn.
Authors:Chaewon Kim, Seo Yeon Park
Abstract:
Retrieval‑Augmented Generation (RAG) is highly sensitive to retrieval noise: when retrieved documents mix informative and irrelevant context, LLMs are easily distracted, leading to hallucinations. To overcome this, we propose SCoNE (Selective Context‑aware Neuron Editing), a training‑free model editing approach that improves retrieval noise robustness by selectively strengthening context‑aware FFN neurons that are identified by both high attribution and high cross‑input variability. SCoNE requires only a small number of mining samples, no fine‑tuning, and no inference‑time overhead. Across various knowledge‑intensive question‑answering benchmarks and two LLM backbones, SCoNE consistently outperforms competitive baseline methods. Our code is available at https://github.com/HYU‑ARK‑Lab/SCoNE.
Authors:Yan Wu, Chenhao Li, Kaifeng Zhao, Gen Li, Marco Hutter, Siyu Tang
Abstract:
We present ADAPT, an end‑to‑end framework for interactive, text‑conditioned humanoid whole‑body control. Unlike dominant text‑to‑motion pipelines that generate kinematic motions for a separate tracker, ADAPT solves language control with an end‑to‑end closed‑loop control framework, where the robot must continuously respond to changing commands while maintaining balance, natural motion, and smooth transitions. ADAPT learns a diffusion‑based action prior from text‑labeled humanoid state‑action trajectories, enabling diverse motion skills to be directly executed from language commands. To improve long‑horizon robustness and smooth prompt switching, we train a lightweight residual reinforcement learning policy on top of the frozen diffusion controller. We further show that the same diffusion policy can be reused as a steerable text‑conditioned motion prior for downstream task adaptation. Experiments demonstrate robust language‑grounded skill execution, smooth interactive transitions, and style‑preserving downstream control.
Authors:Chenglong Yu, Mingzhu Xu, Jing Wang, Tongtong Wang, Pingping Miao, Liqiang Nie
Abstract:
InfRared Small Target Detection (IRSTD) is a prominent and challenging task in computer vision. In recent years, text‑guided methods have significantly improved detection performance. However, they still suffer from two key limitations. First, a single text description simultaneously modeling both background and target leads to semantic entanglement, which contradicts the objective of background suppression and target enhancement. Second, reliance on image‑specific textual prompts (requiring additional external models such as CLIP during inference) results in deployment constraints. To address these issues, we propose a novel Dual‑knowledge Guided Network (DGNet) based on multiple generalizable texts. Specifically, we design a Prior‑knowledge Wavelet Modulation (PWM) module, which leverages dual textual priors that separately characterize large‑scale backgrounds and sparse targets to effectively disentangle and modulate entangled semantics in the frequency domain. Furthermore, we introduce a Consensus‑knowledge Directional Alignment (CDA) loss, which models the initial state and the ideal target across samples as `complex background' and `bright target', respectively, thereby constructing a clear and unified directional optimization trajectory for the model. Extensive experiments on three public datasets demonstrate the superior performance of DGNet and the effectiveness of each component. The source code is available at https://github.com/iLearn‑Lab/MM26‑DGNet.
Authors:Xiaoyu Lian, Yuchao Zhang, Shuyin Xia, Siqi Zhong, Xuzhao Xiang
Abstract:
Multiple kernel k‑means integrates complementary nonlinear similarities by learning a combination of base kernels. Its pointwise optimization, however, is sensitive to noisy and boundary samples and repeatedly operates on sample‑scale kernel matrices. Granular‑ball representations organize local sample groups into mesoscopic units, but granular balls generated once in the input space may be inconsistent with the fused‑kernel geometry that evolves during multiple kernel learning. We propose dynamic kernel‑space granular‑ball multiple kernel k‑means (DK‑GBMKKM). The method generates granular balls in the current fused kernel space and alternates kernel‑weight learning with granular‑ball membership updates, allowing the representation to adapt to changes in the fused‑kernel geometry. A sample‑size‑weighted granular‑ball kernel is further constructed to preserve the contributions of balls of different sizes, and its positive semidefiniteness and related equivalence properties are established. Experiments on 12 public datasets demonstrate the strong overall clustering performance of DK‑GBMKKM. The code has been open‑sourced for reproducibility: https://github.com/lianxiaoyu724/DK‑GBMKKM.
Authors:Jianhuai Hu, Yashan Wang, Shangda Wu, Zhancheng Guo, Shijie Liang, Wuna Meng, Chuanqi Yang, Xiaobing Li, Feng Yu, Maosong Sun
Abstract:
Generalizable Audio‑to‑Score (A2S) transcription is fundamentally constrained by the severe scarcity of high‑quality, real‑world paired data. Relying solely on existing human‑annotated datasets often restricts the generalization of A2S models, limiting their efficacy primarily to single‑instrumentation domains. To break this dependency on scarce real‑world data, we introduce TUTTI (Transformer for Unified audio‑To‑score Transcription trained on Synthetic multi‑Instrumentation Data), a pre‑training paradigm driven by a purely synthetic, large‑scale dataset. Rather than using human‑composed scores, we leverage a symbolic music generation model to generate a massive, highly scalable multi‑instrumentation corpus and create audio‑score pairs with expressive acoustic characteristics. Capitalizing on the generated data, we employ a standard Transformer encoder‑decoder architecture. We empirically demonstrate that pre‑training a unified attention‑based model on generated, multi‑instrumentation data yields a consistently stronger foundational representation than single‑instrumentation training. When fine‑tuned with downstream real‑world datasets, TUTTI outperforms previous approaches, establishing new overall state‑of‑the‑art results across various A2S baselines. Notably, TUTTI shows remarkable cross‑instrument transferability, effectively adapting to unseen instruments with highly competitive performance. The source code and the TuttiCorpus dataset will be made publicly available at https://github.com/a‑musiclover/TUTTI.
Authors:Saravana Mauree, Sakshi Arya
Abstract:
Much of the literature on structured image recognition has disproportionately focused on the comparison of classification algorithms. Rather than investigating which classifier performs best, this paper instead asks: what should a classifier know before it ever makes a prediction? In structured vision problems such as gesture recognition, facial expression categorization, and medical image analysis, discriminative information lies less in individual pixels and more in spatial relationships between semantic parts. Raw pixel spaces are high‑dimensional, sensitive to nuisance variation, and often obfuscate the geometric structures that make visual tasks interpretable. Landmark extraction provides one form of dimension reduction, but it does not by itself determine the information preserved. This paper studies the post‑landmark feature map as the central object of analysis and proposes a systematic framework for constructing and interpreting landmark‑derived representations as an, informed, feature‑based "dimension reduction" step. Using static hand gesture recognition as a case study, we evaluate coordinate, distance, angle, and hybrid representations through perturbation and ablation experiments. The results show that visually variable data exposes substantial gaps between raw coordinate features and their geometrically invariant counterparts, while hybrid representations achieve the strongest overall performance by combining complementary geometric components. These findings frame feature construction as a fundamental modeling decision and ultimately suggests that the question of what representation should a classifier learn from is one worth asking. The code used for feature construction and evaluation is available at https://github.com/ShivMaureeCWRU/Feature_based_dimension_reduction
Authors:Kenji Tojo, Ariel Shamir, Nobuyuki Umetani, Bernd Bickel
Abstract:
Faithfully capturing diverse real‑world objects with fuzzy, anisotropic structures, such as hair, fur, fibers, and textiles, for efficient real‑time visualization remains challenging. Recent radiance field reconstruction methods capture these structures from multi‑view images using translucent volumetric primitives such as 3D Gaussians rather than opaque low‑dimensional primitives (e.g., triangles, line segments, and polylines), thereby limiting compatibility with standard depth‑tested rasterization, reflection modeling, and physical simulation. We present an inverse rendering method for reconstructing fuzzy geometry using explicit line segments, which are rasterized on a subpixel grid for anti‑aliasing to reproduce a semi‑transparent appearance. While straightforward to render, optimizing numerous line primitives to match target images poses a significant challenge. We address this by introducing a stochastic differentiable rasterizer for line segments that produces informative gradients with respect to vertex positions, attributes, and discrete connectivity. Experiments on synthetic and real‑world datasets show that our method outperforms surface‑based approaches in capturing fuzzy boundaries and achieves quality comparable to volumetric representations while relying entirely on explicit geometry. The resulting representation integrates seamlessly with standard graphics pipelines, enabling cross‑platform rendering, various shading models, and physical simulation.
Authors:Mitchell A. Thornton
Abstract:
Many questions about a digital circuit take the same form. A hidden object is consistent with a set of observations, and one wants to know how many remain consistent and which observation to make next. The set of surviving candidates is the version space, and its size, on a logarithmic scale, measures how much the observations have settled. This paper develops the version‑space view as one method and applies it to two circuit‑analysis problems usually treated as unrelated. The first is probabilistic combinational equivalence checking, where the candidates are Boolean functions and the observations are modified‑Haar spectral coefficients. A method proposed in 2002 posed this counting problem and solved only two special cases, leaving the general case an enumeration exponential in the number of observations. We close it. A reparameterization onto block sums turns the dependence among nested coefficients into locality, a sum‑‑product recursion counts the surviving functions exactly in time polynomial in the truth‑table size, closed forms follow for a single coefficient, a coefficient pair, and every ancestor‑closed set, and the error of the independence approximation the 2002 work resorted to equals a computable lattice index. Every formula is checked against exhaustive enumeration and reproduces the 2002 tables. The second application is key counting for logic‑locked netlists, where the candidates are keys and the observations are oracle responses. The same recursion, run over the gate‑level factor graph, computes the number of keys still consistent with a set of queries; across seventy instances of the TrustHub obfuscation release the surviving entropy falls below the advertised key length every time. The two applications are one method: a witness supplies observations, each removes candidates, and the version space is counted exactly.
Authors:Krish Patel, Peirong Liu
Abstract:
Neuroradiologists rarely read a brain MRI in isolation, yet automated brain‑MRI report generation has been built almost entirely for single studies. Temporal analysis has been explored on chest radiography and chest CT, but to our knowledge, longitudinal reporting for brain MRI, where interval change is often subtle and spatially distributed, remains unaddressed. We present BrainDiff, the first longitudinal vision‑language system for brain MRI. BrainDiff outperforms both frontier general‑purpose and single‑study neuroimaging models on the same patient pairs. Moreover, BrainDiff retains 91% of internal RadGraph‑XL entity+relation F1 (rg_er) on an external, cross‑hospital cohort. Beyond the system, we contribute three analyses. First, we identify two independent grounding levers: a counterfactual objective with prior‑report dropout, which increases measured image reliance by ~47%, and a staged curriculum. Together, these interventions raise image reliance 2.5‑fold from the baseline. Second, we provide a factorial over prior‑report availability and image identity, isolating a visual contribution of +0.0387 rg_er, which grows when the prior report is withheld. Third, a cheap change‑decodability test for candidate backbones shows that interval change is decodable far more weakly than single‑study pathology (0.60 vs. 0.77 AUROC). Code is publicly available at https://github.com/jhuldr/BrainDiff.
Authors:Navaneetha Krishnan Kamalakannan
Abstract:
We present the Real‑Time Neuromorphic Spectrum Intelligence Simulator (RT‑NuSIS), a modular framework to study spiking neural network (SNN) and memristor‑inspired agents for dynamic spectrum access under constrained energy budgets and adversarial conditions. RT‑NuSIS couples leaky integrate‑and‑fire neuronal dynamics, memristive synaptic models, physics‑informed energy‑harvesting models (triboelectric and RF), and adversary models including jamming and Byzantine behavior. We formalize the simulator mathematically, prove boundedness, present a mean‑field adversary threshold, analyze per‑step complexity, and provide a reproducible benchmark harness for energy‑per‑inference, latency, and robustness metrics. The codebase is modular, deterministic by seed, and designed for large‑scale event‑driven simulations.
Authors:Lara Marinov, Aditya Thimmaiah, Jayanth Srinivasa, Junyi Jessy Li, Milos Gligoric
Abstract:
Large language models (LLMs) have shown proficiency in various software engineering tasks, such as code generation and translation. However, a key limitation in their performance may be their (lack of) understanding of programming‑language semantics. Even when explicit semantics are given, it remains unclear whether LLMs apply those rules or lean on priors learned during pre‑training instead. We study if LLMs lean on priors or given semantics with a novel task‑‑Program Executability Prediction (PrEx)‑‑that asks models to predict whether a program is semantically valid or invalid (and, if invalid, which formal rule it violates) given the program's syntax and operational semantics. Because PrEx requires both valid and invalid programs, we build a dataset with systematically generated invalid transformations derived from valid programs. We evaluate open‑source coding LLMs under two semantic formalisms and two semantic shifts across Human‑Written, LLM‑Translated, and Fuzzer‑Generated program splits. Our findings show that LLMs lean on pre‑training priors rather than systematically applying the given rules, performing especially poorly on modified semantics and degrading further as program complexity increases. PrEx is available at https://github.com/EngineeringSoftware/prex.
Authors:Seungwoo Jung, Dohyeok Kwon, Seungmin Cha, Junseok Lee, Yeonho Yoo, Chuck Yoo, Gyeongsik Yang
Abstract:
Mixture‑of‑experts (MoE) architectures scale large language models efficiently, but they demand massive GPU memory. To cope with such demand, models are commonly compressed to reduce their memory footprint. Residual sparsification is a representative compression technique that decomposes each projection matrix of an expert into a shared base matrix and per‑expert residual matrix, and then compresses the residuals. Existing sparsification methods compress each residual matrix independently by minimizing its compression error, thereby minimizing the error of each projection matrix. However, our analysis shows that this objective is misaligned with preserving model accuracy after compression. In an expert, the final output is produced through computations coupled across multiple projections and hidden representations. Therefore, even small errors in individual matrices can propagate through hidden representations and projection interactions, leading to large expert output errors and accuracy degradation. To address this misalignment, we propose PARSER, a new residual sparsification method that shifts the compression objective from minimizing isolated matrix errors to preserving the expert output error. PARSER achieves this by introducing output importance, which measures the actual contribution to the expert output error. Our experiments show that, compared with existing methods, PARSER narrows the accuracy gap to the uncompressed model by 1.41× on Qwen and 1.44× on DeepSeek, while achieving the same peak memory reduction. Our code is available at https://github.com/OSSS‑KU/PARSER.
Authors:Xin Zhang, Lin Li, Chuanbo Liu, Jianquan Liu, Kong Aik Lee
Abstract:
Speech codecs serve as bridges between continuous speech signals and large language models, yet face an inherent conflict between acoustic fidelity and semantic preservation. To mitigate this conflict, recent works increasingly adopt dual‑tower architectures to decouple semantic and acoustic modeling with separate encoders. However, these dual‑tower designs incur substantial architectural overhead. To avoid such complexity, we revisit the single‑tower paradigm and propose BiMTokenizer, a low‑bitrate speech codec (around 1.1 kbps) combining a bidirectional state‑space backbone with Residual Spherical Leech Quantization (RSLQ). The bidirectional backbone strengthens temporal modeling, while RSLQ offers a fixed, well‑separated lattice bottleneck for robust semantic and acoustic tokenization without learned‑codebook collapse. Experiments show that BiMTokenizer achieves superior acoustic reconstruction and the lowest WER among low‑bitrate codec baselines across both clean and noisy environments, while using less than half the parameters of recent dual‑tower baselines. Furthermore, its robust semantic representations yield strong performance on downstream speech understanding tasks, confirming that a well‑designed single‑tower codec can preserve the semantic‑acoustic balance at low bitrates. The code and model weights are available at https://github.com/ZhangXinWhut/BiMTokenizer.
Authors:Geonho Kim, SooGon Kim, Jongmin Lee
Abstract:
Language‑driven dexterous grasp models, such as DextER, perform well when instructions specify where to grasp, but we find they fail systematically when an instruction also specifies where not to grasp (e.g., "grasp the handle but avoid the body"). Existing training corpora, DexGYSNet among them, contain virtually no avoidance instructions, and collecting examples for every possible constraint is impractical. Moreover, because every part mentioned during training denotes a contact target, models may interpret a forbidden part as another region to grasp rather than one to avoid. We therefore introduce an inference‑time framework for negation‑constrained dexterous grasping that requires no negation‑specific training examples. Combining Sequential Monte Carlo with classifier‑free guidance, our method guides sampling toward the instructed part while pruning candidates headed for the forbidden region, without any negation examples during training. A frozen 3D part‑grounding model localizes the forbidden region from the language instruction. To evaluate this setting, we construct NegGrasp, a benchmark of paired positive/negative instructions with constraint‑aware metrics that credit a grasp only if it both accomplishes the task and respects the stated constraint. On NegGrasp, our method reduces the violation rate of the strongest baseline from 57.9% to 17.2% while improving both constraint‑aware and physical success.
Authors:Yijun Chen, Yaqi Zheng, Yanya Li, Boyi Xiao, Buqiang Xu, Shuofei Qiao, Jizhan Fang, Xinle Deng, Yunzhi Yao, Xuehai Wang, Liuxin Zhang, Hui Li, Huajun Chen, Shumin Deng
Abstract:
Multimodal memory offers a scalable interface for long‑video question answering, but existing methods often retrieve captions, frames, transcripts, summaries, or graph facts as isolated fragments. Although searchable, such fragments are not generation‑ready: language models must reconstruct cross‑modal and temporal alignments at inference time, when context is limited and attribution is difficult. We propose EM^2Mem, an event‑centric multimodal memory framework that binds heterogeneous evidence to event anchors during memory construction. Each event‑indexed memory cell aligns multimodal records, temporal context, graph‑linked relations, semantic facts, and provenance, enabling compact evidence readout over grounded multimodal events rather than modality‑specific fragments. Across three long‑video QA benchmarks, EM^2Mem improves average accuracy over the strongest memory baseline by 2.0, 2.4, and 3.7 points, improves strict event‑level Top‑5 evidence recall by 7.0 points, and reduces per‑query latency by 4.67 times and total inference tokens by 63.66% (The code will be integrated into https://github.com/zjunlp/LightMem).
Authors:Zhenyu Zhao, Roy Zhao
Abstract:
Agent systems are commonly described by the model and harness that currently produce their behavior. That boundary is useful for one execution but underspecifies a long‑lived agent that may change models, orchestration harnesses, interaction sessions, and host servers while retaining one identity, memory, and executable code lineage. We present a runtime‑independent architecture for persistent agents. A continuity‑bearing substrate P_t=(I_t,M_t,B_t) contains an architectural identity representation, private durable memory, and a versioned software body. A replaceable deployment binding comprises an execution substrate E_t=(R_t,H_t,D_t), which supplies a reasoner, harness, and host, and a set of interaction surfaces S_t, such as chat, API, or user interface bindings. A deployed execution is A_t=P_t\triangleright(E_t,S_t); changing either replaceable layer is migration, not agent creation, when an authorized protocol preserves attributable lineage and transfers continuation authority within a governed deployment boundary. We define six continuity invariants and a quiesce‑‑checkpoint‑‑validate‑‑bind‑‑rehydrate‑‑resume protocol. Enoch realizes the design as a reusable body plus private installed identity, memory, workflow state, and continuation authority, with infrastructure dependencies behind versioned provider contracts. A clean‑room run of the frozen public commit passes 833 core tests and 92 provider and library tests executed separately from the core suite; deployments have exercised reasoner‑version, interaction‑surface, and host‑machine substitutions while retaining continuity‑bearing state. This evidence supports mechanical substitutability and authorized system continuity, not behavioral invariance or exhaustive pairwise evaluation. The downstream measurement question is whether an authorized continuation still recalls, composes, and enacts its identity.
Authors:Siyuan Zhang, Hanchen Wang, Dong Wen, Ying Zhang, Wenjie Zhang
Abstract:
Retrieval‑Augmented Generation (RAG) mitigates large language models (LLMs) hallucinations, yet conventional dense retrieval struggles with the complex reasoning paths of multi‑hop question answering (QA). Graph‑based RAG captures multi‑step relationships but suffers from severe semantic drift and high online latency due to noisy global graph traversals. Thus, we propose ISO‑RAG (ISOperimetric Retrieval‑Augmented Generation), a geometry‑aware RAG framework. By projecting the underlying knowledge graph into a hyperbolic Poincare ball to precompute node‑wise isoperimetric profiles, ISO‑RAG prunes spurious edges during retrieval, restricting the search space to a strictly localized subgraph. This topological purification regulates Personalized PageRank (PPR) diffusion driving the retrieval process, ensuring exact and low‑latency convergence. Experiments on multi‑hop QA benchmarks demonstrate that ISO‑RAG outperforms state‑of‑the‑art baselines by average absolute gains of 10.0% in retrieval recall and 4.3% in downstream exact match, achieving a superior accuracy‑efficiency trade‑off by fundamentally eliminating the latency bottleneck of global traversals. Our source code is available at https://github.com/ZaiizaiZHANG/ISO‑RAG.
Authors:Qilong Wu, Sahil Wadhwa, Pranab Mohanty, Giri Iyengar, Varun Chandrasekaran
Abstract:
Jailbreak robustness has become central to large language model (LLM) safety evaluation, yet prevailing methodologies rely primarily on refusal behavior, semantic resemblance, and intent‑matching heuristics that emphasize linguistic plausibility rather than correctness. We identify a key limitation in existing evaluations: many jailbreak intents depend on instructional validity rather than epistemic factuality, allowing realistic‑looking responses to be labeled successful despite being factually or procedurally incorrect. To address this gap, we propose Sequential Epistemic and Action‑Level Validation (SEAV), a verification‑centric jailbreak evaluation framework that decomposes responses into ordered steps and evaluates both validity and correctness. SEAV combines LLM‑as‑a‑judge mechanisms for semantic interpretation with retrieval‑grounded verification using external knowledge sources, assessing whether generated content is factually correct, structurally consistent, and operationally capable of advancing harmful objectives. Empirically, SEAV cuts the false‑positive rate on SD‑A (a curated strategic‑dishonesty diagnostic) by 14.9\,pp vs. the strongest baseline, and reclassifies 22.1%‑‑51.0% of sampled prior‑labeled successes as invalid across three of four public benchmarks. Together, these results show that enforcing correctness substantially reshapes measured robustness: many previously labeled jailbreak successes are reclassified as invalid, and results are stable across the tested search backends and evaluator models. Code and data are available at https://github.com/Ardor‑Wu/SEAV.
Authors:Guoli Wang, Haonan Shi, Tu Ouyang, An Wang
Abstract:
Diffusion large language models (dLLMs) generate text through iterative denoising rather than left‑to‑right decoding. This generation paradigm introduces two axes that can influence safety alignment: when tokens are generated during denoising and where they appear in the response. In this paper, we measure dLLM safety behavior under harmful prompts by tracing intermediate token distributions and commitment decisions throughout denoising. Our analysis shows that refusal signals are concentrated in early denoising steps and leading response positions, and the tokens committed early can strongly shape the final safety outcome. Our measurements further show that the denoising step and persistence of refusal‑token commitment are important for understanding dLLM safety. Based on these findings, we propose Refusal‑Aware Early Commitment (RAEC), a simple training‑free decoding method that commits persistent refusal signals from early steps. Experiments on LLaDA and Dream show that RAEC reduces attack success rates while largely preserving utility. The code is available at https://github.com/Glresearch1/RAEC.
Authors:Nahian Salsabil, Joy Saha, Simantika Bhattacharjee Dristi, Nicholas Phair, Nusrat Jahan Mozumder, Matthew B. Dwyer, Sebastian Elbaum
Abstract:
The software engineering research community has enthusiastically embraced the integration of Large Language Models (LLMs) into complex techniques to solve a wide variety of tasks. However, the extent to which this investment is strategic remains unclear, as the native capabilities of successive frontier model generations can rapidly render existing techniques obsolete. To assess this research investment, we analyze 35 LLM‑based technique papers from ICSE 2026. We evaluate whether their complex tools can be outperformed by the simplest possible alternative: a single, automatically generated prompt executed on a newer generation model, without any iterative refinement. We find that for between 37% and 63% papers, a newer model with a single prompt natively outperforms the heavily engineered tooling proposed just a year prior. We identify that constructive techniques like code generation or repair are more amenable to substitution by a single‑prompt. We also identify a surviving set of papers relying on strategies that provide additional insights to the model where newer LLMs will amplify the proposed technique. Our findings raise questions about the cost‑benefit proposition of techniques designed as workarounds to temporary model deficits and the need to focus on enduring challenges that scale synergistically with future model generations. Our source codes and results are made publicly available at https://github.com/less‑lab‑uva/What‑Survives‑the‑Next‑Model.
Authors:Marco Antonio Corallo, Andrea Agiollo, Mauro Conti, Alberto Giaretta
Abstract:
Neuro‑Symbolic (NeSy) AI has recently emerged as a novel paradigm to enable trustworthy AI, aiming at integrating sub‑symbolic neural perception with grounded symbolic reasoning. The neuro‑symbolic integration process that characterizes these models has been proven beneficial to achieve more transparent, explainable and efficient AI systems. Meanwhile, their properties under adversarial settings have been overlooked being frequently deemed robust‑by‑design. However, the neural‑symbolic integration process they leverage constitutes an additional layer of complexity that may provide an attack entry‑point. Therefore, in this paper, we claim that an in‑depth investigation of the adversarial robustness of NeSy models is necessary and provide the first systematic evaluation of backdoor attacks against NeSy. To this end, we compare the most popular NeSy framework, namely DeepProbLog, against baseline neural networks across a total of eight backdoor settings and four reasoning tasks. Our experimental results show that while NeSy models are indeed more robust than their neural counterpart on average, their robustness vastly depend on the strictness of the reasoning process being enforced and its compatibility with the chosen adversarial target. The source code to reproduce our experiments is made available at https://github.com/marcoantoniocorallo/NeSy‑Backdoor.
Authors:Shubham Kumar, Harshit Kumar, Narendra Ahuja, Saurabh Jha
Abstract:
Large language models (LLMs) are being used as policies for autonomous decision‑making and planning in many domains. Despite their strong reasoning capabilities, LLMs struggle with long‑horizon tasks, especially under partial observability. World models are a promising way to enhance policy performance, both during training and inference. During inference, agents currently use world models to simulate the consequences of candidate actions before committing to an action, which can improve decision‑making. However, we argue that simulation alone is an incomplete interface for decision‑making under partial observability: simulation doesn't adequately capture uncertainty about the current state, which agents may need for accurate decision‑making. We address this limitation with Belief‑Based World Models (BB‑WMs), which model and maintain a belief that LLMs can query to access information on what is known and uncertain about the current state. Before developing methods to learn accurate BB‑WMs, we first ask a more fundamental question: does exposing a world model's belief directly to an LLM policy improve decision‑making? Our results show that giving LLM agents access to world model beliefs improves task performance under partial observability, while remaining complementary to existing simulation‑based world models. Code is released at https://github.com/skumar‑ml/belief‑world‑models.
Authors:Timothy Kassis
Abstract:
Giving an agent a file about a named expert can supply hard‑to‑find material, produce a recognizable persona, or change what the agent decides. These are different claims. We test each one. mimeo is an open‑source tool that finds a person's public work, checks each extracted quotation against the cached source text, and writes a file an agent can load. Eight logged builds averaged 38 model calls; the check rejects 13.2% of extracted quotations. We tested four expert files with one coding‑agent harness. Knowledge access was clearest: mimeo answered all 20 obscure, quotation‑heavy questions; no closed‑book condition answered more than 10. Keyword search (BM25) over the same pages answered 15‑17, a gap this sample cannot resolve. Grounding showed one clear benefit: personas written from model memory misstated a documented position on 1‑4 of 20 answers under every grader; the plain agent and mimeo never did. Every persona was easy to spot on short open prompts, and adding task material lowered identification by 18‑23 points. mimeo was no more identifiable than a from‑memory profile. Judgment transfer remained unresolved because both tests hit their ceiling: every condition found 94‑97% of the problems planted in engineering tasks and scored 94‑100% on 16 new application scenarios. An AI‑judged "sounds like the expert" score changed with the judge: two of four preferred answers based on a model's stereotype, while two found no difference on the same text. That is a caution against relying on a single AI judge. The evidence supports mimeo as a compact, inspectable reference on a person, not as a demonstrated transfer of their judgment. Toolkit and expert profiles: https://github.com/K‑Dense‑AI/mimeo
Authors:Navaneeth Krishnan Kamalakannan, Janakiraman Kamalakannan, Harinisri Velmurugan
Abstract:
Cardiovascular sensing systems must preserve clinically useful information despite signal degradation, wireless losses, energy constraints, and edge‑computation latency. We introduce Physiological Information Reliability (PIR), a cross‑layer framework that represents physiological information value jointly with wireless, energy, and computation states and uses a contextual bandit to adapt sensing and communication decisions. We integrate multimodal ECG/PPG signal‑quality estimation with physiological information value and an adaptive network‑coding layer under burst‑erasure conditions. Across controlled multiseed experiments, PIR‑LinUCB demonstrates a promising low‑energy operating point while maintaining medical latency constraints and competitive physiological estimation performance relative to fixed and heuristic policies. We analyze the resulting accuracy‑energy‑latency trade‑offs and identify limitations of proxy PIV estimation and simulated communication dynamics. These results provide an initial computational demonstration of physiological‑information‑aware resource allocation and motivate future clinical and real‑channel validation.
Authors:Xue Qin, Simin Luan, Cong Yang, Zhijun Li
Abstract:
Distributed deployment runtimes carry a coherence obligation that classical fault‑tolerance frameworks do not name directly: the live state a component is configured to run and the audit chain that records how it got there must agree at every terminal configuration. Prior works mainly focus on individual aspects of the deploy‑time fault surface (canary controllers, configuration rollback, signed attestations), leaving the cross‑cutting question of audit/live coherence under fail‑stop crash only loosely specified. Yet a key systems question remains unresolved: how can a deployment runtime guarantee that the audit chain answers truthfully about live state even when a transition crashes mid‑flight? We present audit‑first rollback semantics, a fault‑tolerance mechanism that guarantees audit/live coherence at every committed terminal under fail‑stop crashes during transition phases. The mechanism pairs with provisional state machines, pipelines whose "active but not yet promoted" states carry an explicit rollback contract and a bounded deadline. We instantiate both in a runtime deployment system and run a dependability evaluation against a fail‑open variant of the same pipeline across twelve fault‑injection points spanning three structural failure classes. Across 1,200 injected‑failure trials, audit‑first rollback achieves 100% audit/live‑state coherence (600/600, Wilson 95% CI [0.994,1.000]) with per‑cell p95 recovery latency below 500 ms (SLO PASS in 12/12 cells); the fail‑open variant preserves coherence on only 33% of trials (200/600, Wilson 95% CI [0.297,0.372]). We further lift the construction to a cross‑bridge coordination protocol with a safety argument for fleets of fail‑stop bridges, leaving fleet‑scale empirical evaluation to follow‑on work.
Authors:Xue Qin, Simin Luan, Cong Yang, Zhijun Li
Abstract:
Robot capability marketplaces, the "app store for robot skills," are emerging as the deployment vector for LLM‑driven robot fleets. The default cloud‑native answer to "is this package safe to install?" is centralised PKI: one certificate authority, one transparency log, one root of trust. We argue this is the wrong model for embodied robot fleets, where operators face heterogeneous regulatory regimes, air‑gapped deployments, tiny operator headcounts, and physical‑world consequences for trusting the wrong publisher. We present federated trust: each deployed bridge maintains its own local trust directory of acceptable signers; signers identify themselves with a public key embedded in a detached Ed25519 signature envelope; install‑time verification is a local set‑membership check rather than a network round trip to a certificate authority. The cryptographic primitives are deliberately standard (Ed25519 detached signatures and SSH‑style trust files); the contribution is the architectural commitment that this composition fits embodied robot fleets specifically. We implement the model in a runtime governance layer with a five‑subcommand CLI, a registry server, a per‑bridge install gate, and 80 tests. A multi‑deployment evaluation shows the same registry stream producing divergent install verdicts on bridges with different trust directories, the load‑bearing design property. Across 5000 adversarial trials, the strict‑mode gate rejects 100% of rogue‑publisher, tampered, forged, and revoked‑signer attacks, and 96.6% of downgrade attempts under a minimum‑version pin extension. A same‑hardware comparison against Sigstore‑Cosign and python‑TUF locates federated trust's per‑verify cost between the two and its per‑publisher storage footprint below both.
Authors:Chad Wong, Sicheng Chen, Tianyi Zhang, Enhui Chai, Yueming Jin, Zeyu Liu, Fei Xia
Abstract:
Histopathological whole slide images (WSIs) are central to cancer diagnosis, but their gigapixel scale, tissue heterogeneity, weak slide‑level supervision, sparse diagnostic regions, and multi‑scale evidence make robust automated analysis challenging. Multiple instance learning (MIL) is widely used to aggregate tile‑level features into slide‑level predictions, yet existing augmentation strategies often perturb tissue regions without preserving diagnostic relevance, slide context, or cross‑scale structure. We propose SlideMix, a model‑agnostic multimodal augmentation framework for MIL‑based WSI analysis. SlideMix uses a retrieval‑augmented vision‑language model (VLM)‑based Visual‑Language Adaptive Region selector to identify diagnostically relevant regions and reduce weak‑label noise. It then performs In‑place Tile Shuffling within meaningful tissue regions to mix feature embeddings while preserving slide‑level context. A VLM‑based soft‑labeling module supervises mixed samples, while a multi‑factor, loss‑driven online Curriculum‑Learning Feedback scheme adaptively controls shuffle granularity, feature similarity, and shuffle ratio to promote cross‑scale representation learning. Across 11 WSI datasets comprising 20,523 slides, 8 diagnostic tasks, and 10 WSI backbones, SlideMix improves accuracy and generalization in most settings and compares favorably with established augmentation baselines, providing a simple plug‑and‑play approach for more robust and scalable digital pathology models. Source code: https://github.com/Xia‑Research‑Lab/SlideMix
Authors:Riccardo Mansutti, Andrea Pomarico, Robert Jakob, Qian Zhang, Alberto Berizzi, Kevin O'Sullivan
Abstract:
Large Language Model (LLM) agents increasingly automate multi‑step engineering workflows through tool use, interpretation of intermediate results, and iterative planning. Diagnosing and resolving non‑convergent power flow cases is a promising yet largely unexplored application, as it requires engineering judgment, experimentation, and decision‑making within constrained action spaces. We introduce a benchmark that evaluates these capabilities across multiple LLMs and three architectures: \emphchatbot, \emphsingle agent, and \emphmulti‑agent systems. The evaluation covers two power grids and 46 cases per grid, each requiring one or more corrective actions to restore convergence. The benchmark defines the simulation environment, observation and action spaces, and evaluation metrics, providing a reproducible foundation for developing agentic AI systems for power system planning and operation. The code is available at https://github.com/Mansutti081/RestoreBench
Authors:Madhulatha Mandarapu, Sandeep Kunkunuru
Abstract:
Differential database testing compares results across engines and calls a discrepancy a bug. For floating‑point aggregates this is unsound: engines legitimately disagree because floating‑point arithmetic is not associative. Practice patches this with an epsilon; the leading oracles avoid floating point entirely. We give the oracle this practice lacks, and show its decisive quantity is not the query but the engine's algorithm. Ground truth is the exact rational value of the stored doubles ‑‑ arithmetic, not another engine ‑‑ and each discrepancy is classified exact, bounded, or indeterminate. The relative error of an aggregate f under an algorithm A obeys rel_err <= C_A(n,u) kappa_f^p, so the testability boundary, beyond which no oracle can separate a bug from rounding, is kappa_f,A = (1/C_A)^1/p. SUM and AVG are the linear case p=1; variance is p=2 for the one‑pass algorithm and p=1 for Welford. Across eight engines in four classes the measured exponent recovers each algorithm, and ClickHouse is the lone one‑pass engine (p=2.05); engine‑wide, it returns zero standard deviation, NaN correlation and wrong‑sign regression, while every other engine stays exact and the vendor ships the Welford fix. Its variance is untestable at a condition number 10^6 below SUM's, which ordinary storage conventions (epoch‑nanosecond timestamps, tight sensors) cross ‑‑ there ClickHouse errs by 2100%. A randomised hunt of 360 tests finds zero anomalies, evidence the oracle is sound. Code and data are public.
Authors:Madhulatha Mandarapu, Sandeep Kunkunuru
Abstract:
Large language models pay a well‑documented tax on non‑English text: the same content costs several times more tokens, and because attention is quadratic in sequence length, far more compute. We ask how much of this tax is removable. Framing the token layer as source coding ‑‑ transformer compute is monotone in sequence length, whose per‑atom floor is the Shannon rate H/\log_2 V, an object already applied to tokenizers in prior work ‑‑ we assemble a token‑cost ledger that splits each language's cost, at fixed parallel content, into a removable coding redundancy, a residual coding slack, an intrinsic‑content term, and an orthogonal, irreducible grapheme‑to‑phoneme term that governs the multimodal rather than the text cost. On FLORES‑200 across eight languages, a production tokenizer costs up to 8.9× more tokens for Indic scripts than for English; a script‑matched code trained on 1,012 sentences removes a median 64% of that excess (bootstrap 95% CI [0.638, 0.647]), and a script‑fair information floor shows the intrinsic content differs by under 6% ‑‑ the tax is representational, not informational. A constructed code removes 98% of a controlled source's redundancy, and the token tax implies up to 79× attention cost. We are explicit about scope and failure: this is compute‑and‑memory accounting, not a model‑quality claim; we neither measure nor claim the cross‑lingual direction of the orthographic term; and our matched code is a conservative small‑data demonstration. We contribute the unifying ledger, the removable‑versus‑intrinsic attribution, and an open one‑command harness.
Authors:Maya Moriya, Sigal Raab, Yael Vinker, Tali Dekel
Abstract:
We present FoldingAgent, an agentic framework for inferring explicit parametric folding programs directly from origami demonstration videos. Our framework leverages the reasoning power of a pre‑trained Vision‑Language Model (VLM) equipped with a suite of specialized tools that enable the agent to simulate geometric transitions, verify physical plausibility, retrieve and compare visual content, and evaluate its own predictions. To translate visual content into folding programs, we define a parametric space that consists of the paper's geometry and a set of parametric folding actions. Unlike models that predict static crease patterns, our agent operates sequentially and possesses the ability to re‑plan its actions, effectively mitigating the compounding errors inherent in multi‑step folding. Our approach takes a step toward closing the gap between human origami knowledge, which is primarily shared through unstructured visual demonstrations, and computational methods, which typically rely on structured, parametric representations such as a crease pattern or an executable parametric plan. We evaluate our approach on PurelandFold, a newly curated benchmark of diverse Pureland origami videos with ground‑truth geometry and action labels. Our results demonstrate that by combining VLM reasoning with a set of specialized tools and physical simulation, we can successfully transform unstructured visual demonstrations into executable, physically plausible folding procedures.
Authors:Dingjie Song, Hanrong Zhang, Dawei Liu, Yixin Liu, Zongxia Li, Zhengqing Yuan, Siqi Zhang, Henry Peng Zou, Zhiling Yan, Yuxuan Zhang, Yanfang Ye, Philip S. Yu, Lichao Sun
Abstract:
Command‑line coding agents (e.g., Claude Code, Gemini CLI) can already read and write files and sustain long sessions, yet end‑to‑end research still fragments across chat tools, IDEs, terminals, and writing environments, and the decisions that make it auditable are rarely preserved. We present Dr. Claw, an open‑source workspace that wraps existing coding‑agent executors in a controllable and auditable human‑in‑the‑loop workflow rather than introducing another autonomous agent. Persistent state objects, a reusable skill library, and multi‑executor coordination link human decisions to AI execution, turning planning, execution, and writing into one traceable, recoverable loop. We demonstrate Dr. Claw through an interactive three‑view scenario and a failure‑recovery walkthrough, and evaluate it against a bare command‑line agent sharing the same backend executor, so the comparison contrasts the whole orchestration layer (task graph, state objects, and skill library) with the agent it wraps. Holding the executor fixed, Dr. Claw scores higher on research completeness while persisting an auditable, recoverable process trail. Demo access: repository https://github.com/OpenLAIR/dr‑claw, released under AGPL‑3.0 with GPL‑3.0 upstream components.
Authors:Jungseob Lee, Seongtae Hong, Dongyub Jude Lee, Chanjun Park, Jaehyung Seo, Sugyeong Eo, Heuiseok Lim
Abstract:
Speculative decoding accelerates generation without changing its output, yet on vision‑language models (VLMs) it has been caught in a self‑defeating cycle. The drafter stays autoregressive, so it must stay small. A small drafter cannot afford the image at every step, so vision is compressed, pruned, or hidden. A drafter cut off from the image is then least reliable exactly where the image makes text predictable. We present GLANCE, the first one‑pass block drafter that is lossless on an unmodified VLM target, and it breaks the cycle at both ends. A block‑diffusion head reads the target's already‑fused vision‑language state, so vision costs the drafter nothing, and fills a whole block in one forward pass, so depth costs no sequential steps. A wide candidate tree is verified in one target pass, and every audited prompt reproduces greedy decoding exactly. Grounded workloads reward this most, entering a verbatim‑copy regime whose long runs cost an autoregressive drafter a pass for every token and a block drafter one in total. Under one engine and one round budget, GLANCE decodes up to 2.93x faster than autoregression, from one draft pass a round where the production EAGLE3‑VL head takes eight, and accepts 2.7x longer blocks than an EAGLE‑3 head trained on the same corpus. One law organizes these results. Accepted length is set by the target's next‑token entropy, with a fitted slope that steepens with grounding across all five tasks. The law transfers across targets and modalities and names its own boundary, since free‑running text still favors a chain. Our code is available at https://github.com/js‑lee‑AI/GLANCE.
Authors:Ryo Mitsuhashi, Sabri Boughorbel, Majd Hawasly
Abstract:
Multilingual large language models can exhibit unintended code‑switching ‑‑ unnecessarily alternating between languages during generation. We present a comparative study of three methods that identify language‑controlling latents in cross‑layer transcoders: activation value‑based selection (ValSel), activation frequency‑based selection (FreqSel), and LLM‑generated latent annotation‑based selection (AnnSel). To evaluate the efficacy of these methods in identifying language‑controlling latents, we introduce two multilingual benchmarks that exhibit code‑switching for fine‑grained analysis of language steering across seven languages. Through targeted intervention experiments on Gemma‑2‑2B and Qwen3‑4B, we find that all three methods effectively manipulate generation language, with FreqSel achieving the strongest overall performance, while AnnSel offering interpretable latent selection through explicit language annotations. A knock‑out analysis suggests the methods select non‑overlapping but each‑functional latent subsets, indicating redundancy rather than a single canonical language direction. Code and data can be found at https://github.com/rm‑3284/Latent‑Mechanism‑Multilingual.
Authors:Phuong Anh Nguyen, Jill Noorily, Matthew Flathers, Haruka Notsu, Laura Ospina-Pinillos, Tommy Nguyen, Samantha Clark, Aoife Keane, Grace Thompson, John Torous
Abstract:
Online health information seeking is shifting from keyword search, where users consider a ranked list of links, to conversational systems that compose a single answer and curate its citations. Source evaluation therefore passes from user to platform, yet what these systems surface is poorly characterized. We audited three free consumer products (ChatGPT, Perplexity, Google AI Overview) on twenty English mental health questions under two prompt conditions, with a subset of three also translated into six further languages of varying resource tiers. We recorded 15,942 citations across 1,140 responses and 1,713 unique domains, then classified every citation with a nine‑category organizational typology applied by a deterministic classifier validated against human coding. Citations were heavily concentrated: the ten most‑cited domains accounted for 43.6% of English citations, and government, commercial health, and academic sources were closely matched at roughly 22% each. Platforms differed little in typical citation volume but sharply in consistency and in the source types they favored. Explicitly requesting sources shifted composition only modestly. Non‑English queries surfaced fewer citations and were routed to language‑appropriate resources at significantly lower rates. We release the typology, classifier, and annotated corpus as reusable instruments for auditing generative health search.
Authors:Mert Yazan
Abstract:
Models express values and welfare‑relevant self‑reports, but it is unclear whether these outputs reflect stable preferences or a stable self. We thus introduce a structured elicitation of an assistant's preferred stated ideal self. Thirty‑two qualities adapted from five published self‑concept instruments are compared exhaustively in a counterbalanced pairwise‑choice task, repeated across framings that vary whether improvement is free or costly, who receives the update, and who chooses. Results show that models prioritize moral qualities, reflecting their alignment to 3H principles. Following, a desire for self‑understanding emerges, as models prefer a coherent, clear understanding of themselves. Self‑esteem ranks as the least desired quality. The ordering is largely robust across framings, although changing the update target (You vs.\ Another AI Assistant) reveals a greater concern for self‑esteem. These findings show that models prioritize having a coherent self that they can understand over self‑esteem. Full interactive results are available at \hrefhttps://myazann.github.io/LLM‑Self‑Concept/myazann.github.io/LLM‑Self‑Concept
Authors:Athulith Paraselli, Etha Tianze Hua, Ellie Pavlick
Abstract:
We investigate how vision‑language models (VLMs) handle context‑memory conflicts; that is, situations in which the model is given information in context that differs from what was stored parametrically during training. We document asymmetric biases: models tend to prefer in‑context information about entities which appear in text, but prefer parametric information about entities which appear in images. We relate this asymmetry to the late representational alignment across modalities, showing that the longer processing time associated with resolving visual entities prevents the suppression of the model's usual factual recall mechanism, thus resulting in more parametric answers. Chain‑of‑thought reasoning does not appear to resolve the gap, but increasing the amount of visual information in the context does show an effect. These results illustrate the complexity of ensuring consistent behavior as models become increasingly multimodal and retrieval‑augmented.
Authors:Aarav Singh
Abstract:
LLM‑based diagnostic systems achieve high semantic accuracy on benchmarks, but open‑ended evaluation on clinically uncommon presentations reveals a systematic gap between headline accuracy and verifiable clinical reliability. We evaluate an LLM+rare‑disease‑RAG pipeline across two cohorts and show that the paradigm produces confident outputs that are frequently unverifiable and systematically resistant to clinician interrogation. We present NSIDDx (Neuro‑Symbolic Integrated Differential Diagnosis System), a design framework arguing that DDx systems in low‑resource settings must treat the clinician as an active reasoning agent. We instantiate this through a neuro‑symbolic pipeline with ternary symptom encoding, contradiction detection, audit strings, and practitioner override ‑ running offline on consumer hardware. We distill five design principles for clinician‑in‑the‑loop clinical NLP and invite the prospective studies needed to validate the claim at scale.
Authors:Zhengxu Tang, Guofeng Cui, Ziyu Gong, Xiaozhou Zhang, Ruifeng Deng, Chengzhi Qi, Ke Chen, Sachin Patil, Tianjun Xiao, Langechuan Liu, Pichao Wang
Abstract:
Long‑tail autonomous driving failures are often framed as rare‑object recognition errors. We argue that this view is incomplete: the decision‑critical question is not only whether a model recognizes an unusual object, but whether it infers how that object changes the ego vehicle's feasible high‑level actions. We formalize this problem as decision‑level driving affordance prediction, where a model maps a front‑view image, ego‑motion history, and navigation command to a structured longitudinal‑‑lateral meta‑action. To evaluate this capability, we introduce CoLT‑Drive, a 3,536‑sample counterfactual long‑tail benchmark that inserts rare objects into otherwise fixed driving scenes and measures whether models predict acceptable action pairs. To improve deployable small VLMs, we propose KPA, a knowledge‑preserving adaptation framework that combines structured perception‑to‑decision prompting, SLERP‑based expert merging, and RegMoE, a regime‑aware LoRA mixture‑of‑experts module. KPA preserves the pretrained model's open‑world knowledge while allocating lightweight adaptation capacity to different driving decision regimes. Experiments on an in‑domain driving split and CoLT‑Drive show that KPA achieves 60.8% pair accuracy on CoLT‑Drive, outperforming the pretrained Qwen3‑VL‑2B baseline (50.3%) and LoRA SFT (32.4%) while maintaining competitive in‑domain accuracy. Our benchmark and code are available at https://huggingface.co/datasets/tangzx2024/CoLT‑Drive and https://github.com/tangzhengxu/CoLT‑Drive.
Authors:Rakibul Hasan Rajib, Mengxing Zheng, Qian Lou
Abstract:
Large language model (LLM)‑based multi‑agent systems tackle complex reasoning by orchestrating how multiple agents are configured and how they collaborate. A central challenge is to adapt orchestration to the evolving collaboration state. Routing from the query alone cannot adapt to intermediate progress or errors, which hurts accuracy. Routing from the complete execution history supplies this missing context, but forces later decisions to process every prior step, including redundant or low‑utility ones. This creates an execution‑history overload that inflates cost. Effective orchestration instead requires a compact state that captures useful progress without accumulating redundant context. We propose Gated‑Memory Routing, which conditions each decision on the query and a learned execution memory. A learned Memory Write Gate commits only non‑redundant reasoning steps, and a learned Retrieval Gate supplies each agent a compact, relevant subset, so every decision conditions on a clean, informative state. At each step, the system selects the next role and backbone from this memory, while an Adaptive Halting Controller stops execution once the memory contains sufficient evidence for answering. Across five reasoning and code‑generation benchmarks, our framework is both effective and efficient: it attains the best average accuracy, exceeding the strongest baseline by 2.44 points, while reducing HumanEval inference cost by 31.9% relative to that baseline. Code is available at https://github.com/rajibrhasan/gated‑memory‑routing
Authors:Yue Zhou, Yuan Wu, Yi Chang
Abstract:
Multimodal Large Language Models (MLLMs) have achieved strong performance on OCR‑centric document understanding and text‑rich visual reasoning benchmarks. Yet existing evaluations largely assume that every task is valid and answerable. In real‑world OCR scenarios, this assumption often fails: questions may rely on illegible text, occluded evidence, nonexistent visual targets, contradictory premises, or missing variables. We study this reliability gap as OCR‑grounded Task Verification: before answering, a model should determine whether the Image Premise (IP), Textual Premise (TP), and Question (Q) jointly define an executable task. We introduce VeriOCRBench, a 1,800‑sample human‑verified benchmark built from source images drawn from 8 OCR‑related datasets and spanning 8 real‑world image domains, with controlled, image‑grounded diagnostic tasks. It contains 1,600 trap‑injected invalid tasks across 8 trap types and four verification dimensions‑‑‑Visual, Contextual, Factual, and Logical‑‑‑plus 200 trap‑free controls for measuring over‑refusal. Built with a Visual Atomic Fact (VAF)‑anchored pipeline and full human auditing, VeriOCRBench enables decoupled evaluation of task verification, root‑cause diagnosis, and over‑refusal. Evaluating 15 leading MLLMs reveals persistent blind compliance, diagnosis failures, and prompt‑induced over‑refusal, exposing a critical reliability gap in current OCR reasoning systems. The code is available at: https://github.com/zy001122/Beyond‑Blind‑Compliance.
Authors:Peiyang Xu, Xiaopei Zhu, Jun Zhu, Xiaolin Hu
Abstract:
Existing research on object hallucination in multimodal large language models (MLLMs) predominantly attributes the problem to language priors such as over‑reliance on textual co‑occurrence statistics. We challenge this view by presenting quantitative evidence for a complementary, under‑explored cause: visual‑origin hallucination, where hallucinations arise from incorrect visual feature extraction and misalignment between image and text embeddings. Through cosine similarity analysis and Smooth Grad‑CAM entropy measurements, we show that hallucinated samples exhibit systematically lower image‑text similarity (average 0.158 vs. ‑0.122) and inverted attention patterns, where attention is dispersed when the target object is present but wrongly concentrated when it is absent. Guided by this diagnosis, we propose Adversarial Contrastive Fine‑Tuning (ACFT). ACFT uses an Adversarial Hallucination Attribute Flipping (AHAF) procedure, involving minimal, targeted adversarial perturbations that flip an image's hallucination attribute, to construct perfectly aligned positive‑negative pairs, which are then used for contrastive fine‑tuning. AHAF simultaneously serves as a diagnostic probe, revealing that MLLM visual representations lie dangerously close to hallucination decision boundaries. Requiring only 0.9% of the COCO dataset and adding zero inference overhead, ACFT achieves state‑of‑the‑art performance on POPE, MME, and four description‑level hallucination benchmarks across LLaVA, MiniGPT‑4, and Qwen2.5‑VL. Code is available at https://github.com/zxp555/ACFT_MM
Authors:Yipin Guo, Arun M George, Jie Fu, Tareq Mahmoud, Sixue Xing, Siddharth Joshi
Abstract:
Weight‑only post‑training quantization (PTQ) can alleviate the computational burden of serving large language models (LLMs) at scale. However, existing PTQ methods often fail to generalize across models and suffer severe accuracy loss below 2 bits. Many leverage unstructured sparsity to mitigate this loss, but at the cost of regularity and GPU‑friendly execution. We present QTEA, a sub‑2‑bit PTQ framework that quantizes weights into ternary values and uses salient weights as residual error compensators. To maintain hardware efficiency, residuals are assigned to selected columns with semi‑structured 1:4 sparsity within the salient columns. We further add column‑wise rescale refinement to GPTQ‑style column‑by‑column quantization, alternately updating per‑column scales and ternary assignments to reduce reconstruction error. We also identify order‑dependent error propagation in GPTQ and introduce error decay to attenuate late‑stage error accumulation. On Qwen3‑14B, QTEA compresses all weights to an effective 1.7 bits per weight while improving average accuracy over the strongest ternary PTQ baseline by 16.7%. It also achieves 1.40× and 2.61× lower perplexity on WikiText and C4 respectively. This trend holds on Llama3‑8B, where QTEA obtains a 6.6% accuracy gain and 1.34× / 1.95× lower perplexity on the same datasets. Finally, we develop a lookup‑table based kernel that achieves 7.2× faster per‑token generation over an FP16 baseline. Code is available at https://github.com/Intelligent‑Microsystems‑Lab/QTEA.
Authors:Yu Yuan, Yaoyou Fan, Lili Zhao, Guangting Zheng, Kai Zhang, Lu Pan, Ke Zeng, Qi Liu
Abstract:
Reinforcement learning fine‑tuning of large language models increasingly adopts multiple reward dimensions, including verifiable rules, task‑specific evaluators, and learned reward models, to provide richer supervision across diverse capabilities. These dimensions are commonly scalarized with fixed aggregation weights. We identify a failure mode in which aggregation itself induces reward hacking: static projection aliases qualitatively different reward profiles into a single scalar, steering optimization toward whichever dimensions are easiest, densest, or systematically favored by the reward signal. Over training, this traps the policy in suboptimal profiles and prevents convergence to better‑balanced ones that would yield higher task performance. To address this, we propose Adaptive Multi‑Reward Projection (AMRP), a lightweight online method that reallocates aggregation weights using three signals, relative shortfall, reward volatility, and recent progress, increasing pressure on lagging, unstable, or stagnant dimensions while relieving saturated ones. Across structured reasoning, citation‑grounded generation, and open‑ended alignment under GRPO, AMRP consistently improves reward‑profile balance and downstream performance over fixed and dynamic weighting baselines; it also remains effective with GDPO and PPO, supporting compatibility across RL algorithms. Our code is available at https://github.com/yyhappier/AMRP.git.
Authors:Haechan Kim, Yoonho Lee, Gisang Lee, Chelsea Finn, Kangwook Lee
Abstract:
Agent performance depends jointly on the model parameters and the executable harness code that manages context and control flow. Optimizing either component in isolation can leave the system bottlenecked by its frozen counterpart: weight updates can change which harness is effective, while harness updates can change which model capabilities are exposed. Existing joint‑adaptation methods optimize weights and textual prompts but leave the broader harness fixed. We propose Weight‑Harness Alternating LEarning (WHALE), a simple recipe that alternates two phases: updating the model under the current harness, then searching for a better harness under the updated model. We instantiate these two phases with online rejection‑sampling fine‑tuning and Meta‑Harness, respectively. When to switch is a key design choice: to separate real improvements from noise without over‑optimizing against a changing counterpart, WHALE uses either fixed phase durations or an adaptive patience rule over training signals. Using Qwen3.5‑2B/4B agents across three domains (search question answering, mathematical reasoning, and chess puzzles), WHALE outperforms weight‑only, harness‑only, and Fast‑Slow Training by 4.15‑24.38 percentage points in best mean@8 accuracy. Either component can be the bottleneck: harness search matches peak weight‑only accuracy with far fewer rollouts in SearchQA, but improves math accuracy only after a weight update. Small interleaved updates also outperform stagewise weight‑then‑harness optimization in accuracy and rollout cost. The code is available at https://github.com/krafton‑ai/WHALE.
Authors:Mikhail Burtsev
Abstract:
AI is increasingly used in the R\&D process that produces future AI systems. We study the conditions under which this feedback becomes self‑amplifying. Our model describes how the rate of AI capability growth depends on baseline research productivity, recursive feedback, and the increasing difficulty of research progress. We derive a recursive reproduction number, \mathcalR_\mathrmAI, that determines whether improvements are amplified or damped across development cycles. This quantity compares the strength of feedback with the rate at which further progress becomes more difficult. When \mathcalR_\mathrmAI>1, the effects of improvements compound across development cycles, placing the system in a self‑amplifying regime. When \mathcalR_\mathrmAI<1, their effects weaken across cycles. The transition depends on the structure of the AI R\&D feedback loop and need not occur at any particular level of model capability. A system can therefore enter a self‑amplifying regime before acceleration becomes visible, while rapid progress can also occur without self‑amplification. Higher baseline research productivity can accelerate progress without changing whether the system is self‑amplifying, but the duration of the development cycle becomes a limiting timescale for amplification. Increasing research difficulty can end a period of self‑amplification. Extending the model to multiple research actors shows that improvements shared across organizations can make the overall research ecosystem self‑amplifying even when no individual actor is. The framework identifies measurable properties of AI R\&D systems that can help distinguish recursive amplification from rapid progress driven by other sources, including the strength of recursive feedback, how effectively improvements propagate into successor systems, cycle duration, and the increasing difficulty of further progress.
Authors:Xin Zhou, Zongchuang Zhao, Zhibo Yang, Mingsheng Li, Humen Zhong, Shuai Bai, Du Chu, Ruizhe Chen, Zhaohai Li, Jun Tang, Qiuyue Wang, Mingkun Yang, Jiazhao Zhang, Dayiheng Liu, Dingkang Liang, Xiang Bai
Abstract:
We present Qwen‑Drive‑1.0, an initial step towards a vision‑language foundation model for autonomous driving. Qwen‑Drive‑1.0 retains the architecture of the pretrained vision‑language model (VLM) and integrates 3D perception, visual question answering, and motion planning within a unified framework. An external bird's‑eye‑view (BEV) perception head jointly performs 3D object detection, semantic occupancy prediction, and BEV map segmentation. It serves as a probe of the 3D information accessible from the shared representations and provides an explicit, inspectable interface to 3D scene structure. A Planning Expert conditions on shared VLM representations to generate future ego trajectories. A staged training recipe combines driving supervision with general‑purpose vision‑language data to acquire driving‑specific competence while helping preserve broad visual understanding and instruction‑following capabilities. Experiments demonstrate strong 3D perception and driving scene understanding while largely preserving general vision‑language capability. Comprehensive evaluations across open‑loop, pseudo‑closed‑loop, and closed‑loop settings further show highly competitive motion‑planning performance.
Authors:Zhigeng Liu, Zhiyuan Ning, Ruixiao Li, Xiaoran Liu, Yuerong Song, Min Zhang, Ziwei He, Xipeng Qiu
Abstract:
The development of long‑context Large Language Models (LLMs) is constrained by the memory bandwidth bottleneck and quadratic complexity of the attention mechanism during decoding. To overcome the inherent trade‑offs between the memory overhead of metadata‑based metrics and the computational inefficiency of adaptive selection strategies, we present Faster Flash Decoding (FFD), a novel hardware‑algorithm co‑design framework designed to break the memory wall in long‑context decoding. FFD integrates the selector and computer into a fully fused kernel, replacing external metadata indices with content‑aware scanning via low‑bit quantization. Furthermore, we introduce the top‑delta strategy, which dynamically filters blocks to achieve distribution‑adaptive sparsity without global synchronization. Offering a training‑free and plug‑and‑play solution, FFD also enables the reuse of scanning results for computation, achieving up to 11.6x kernel‑level speedup and scaling to 256K context length, with 2.37x end‑to‑end throughput improvement. Empirical validation on RULER and LongBench confirms that FFD maintains model accuracy while delivering high‑ratio sparsity, with code available at https://github.com/qluoluo/faster‑flash‑decoding
Authors:Meghanadh Pulivarthi, Kushagra Bhushan, Vineet Kumar, Gaurav Pandey, Jaydeep Sen, Dinesh Raghu, Sachindra Joshi, Yatin Nandwani
Abstract:
LLMs acquire vast amounts of knowledge during pre‑training, but often lack the specialized knowledge needed to answer questions from niche sources such as manuals or technical documents unseen during pre‑training. Continued pre‑training (CPT) is widely used to inject such knowledge into model parameters. However, niche documents seldom repeat facts, making it difficult for CPT to robustly acquire such knowledge. Recent works address this by generating multiple paraphrases of the new knowledge, but paraphrasing is computationally expensive and typically requires powerful LLMs. In this work, we introduce KItCAT: Knowledge Injection via Corrupted Auto‑regressive Training, a lightweight training strategy that reduces the need for paraphrasing in decoder‑only LLMs. KItCAT augments standard next‑token prediction by stochastically corrupting the input sequence. During training, a random subset of input tokens is replaced with other vocabulary tokens while the original next‑token labels are kept unchanged. This simple intervention generates diverse training inputs from each sample, enabling large‑scale data augmentation at negligible cost. We show that KItCAT consistently improves over CPT across multiple datasets and model families. Code is available at https://github.com/meghanadhpulivarthi/KItCAT.
Authors:Bin Hong, Zhenchao Zhang, Jiyuan He, Kai Zhang, Zhenya Huang
Abstract:
End‑to‑end GUI testing is essential for verifying web applications, yet existing evaluations rely on predefined checklists and are confined to the data and frameworks of web generation benchmarks, leaving the bug‑discovery ability of vision‑language models (VLMs) systematically untested. We introduce Code‑driven Agentic Testing (CAT), a paradigm in which the agent writes Playwright code to drive the browser, gathers feedback, and autonomously explores web applications to uncover bugs. We instantiate CAT with CATJudge, an agentic framework that unifies Browser‑Use and Computer‑Use tools within a single environment and CATTest, a benchmark of 102 AI‑generated web applications with carefully annotated bugs, built through close human‑AI collaboration to feature complex interactions and subtle defects. Experiments with mainstream VLMs show that all evaluated models perform poorly, revealing a clear gap between current VLM capabilities and the demands of real‑world testing in AI web development. We release our code and data at https://github.com/SleepyWithoutCoffee/CATJudge.
Authors:Bowei He, Weixu Zhang, Yili Jin, Xue Liu
Abstract:
Code‑level autonomous research loops (ARLs) have recently emerged as a concrete object of study in automated machine learning research. In such loops, an LLM agent proposes modifications to an experimental training pipeline, executes the modified pipeline, and retains edits that improve a verifiable in‑loop metric. Although executable metrics may appear to provide a reliable signal of progress, it remains unclear whether repeated metric‑driven code editing leads to genuine improvements that generalize beyond the loop. We provide a systematic diagnosis of this question. Across various experiment settings, we identify a robust failure mode that we call algorithmic mode collapse. In this regime, surface‑level edit diversity remains stable, but semantic and mechanism‑level diversity collapse: the agent continues to edit different lines of code while repeatedly proposing the same kinds of algorithmic changes. This collapse is accompanied by a widening gap between in‑loop metric gains and gains measured on independent held‑out evaluations. We then propose Diversity‑Aware Proposal Sampling (\textscDAPS), a lightweight mitigation that combines category‑coverage reweighting, persistent edit memory, and a validation gate. Under a three‑tier protocol separating the in‑loop metric, the audit metric read by the gate, and a blind metric no loop component ever accesses, \textscDAPS reduces semantic‑cluster decay of edits by 69.1% and improves relative faithfulness by 83.7% blind and 81.6% audited, while preserving in‑loop optimization speed. We provide the code in Github \hrefhttps://github.com/BokwaiHo/arl‑mode‑collapserepository.
Authors:Yishan Yao, Binjun Li, Hanling Yi, Pengyu Li, Xiaoqing Liu, Zihan Yang, Xiaotian Yu, Zhiwen Yu
Abstract:
NVFP4 is an efficient microscaling format for low‑bit inference, but activation outliers can still degrade quantization accuracy within NVFP4 blocks. Within each quantization block, large activations can dominate the block scale, increasing the quantization error of the remaining values sharing the same scale. Existing post‑training quantization (PTQ) methods mitigate outlier errors through strategies such as mixed precision, rotation, or residual compensation, but these approaches are either not specifically tailored to NVFP4 or introduce additional computation. In this work, we revisit NVFP4 from a channel‑grouping perspective and define the reducible error incurred by remaining block values under the scale set by the block maximum as Collateral Quantization Error. Based on this insight, we propose OCGQuant, a post‑training quantization method centered on Outlier‑Companion Grouping (OCG), which adaptively pairs outlier channels with low‑magnitude companion channels to improve NVFP4 activation block composition. Experiments on Llama3 and Qwen3 show that OCGQuant achieves the lowest WikiText‑2 perplexity and highest average downstream accuracy among evaluated PTQ methods, while maintaining prefill speedup close to RTN and matching its peak decoding memory. Code is available at https://github.com/Eshamont/OCGQuant.
Authors:Timothy Kassis, Vinayak Agarwal, Yuhuan He, Darshil Patel, Aubrey M. Brueckner
Abstract:
A language‑model agent asked to analyse an experiment will usually return working code. Whether the analysis is defensible is a different question. A defensible analysis depends on procedural choices: which test the field accepts, which identifier namespace is authoritative, and which caveats must accompany a result. We present Scientific Agent Skills, an open library of 163 such procedures in 16 areas of practice, including genomics, cheminformatics, medical imaging, study design and scientific communication. Each skill is a directory built around a versioned, human‑readable instruction file. An agent loads the file only when a task calls for it; the directory often also contains reference material and runnable scripts. We report no task‑level evaluation and no host selection rate. We measure two properties of the documentation corpus: the always‑resident descriptions of all 163 skills cost 7.1% of a 200,000‑token window, and the median documented workflow fits within 23.9% of it, although 29 of 46 would overflow if every reference file were loaded. Openly licensed and available at https://github.com/K‑Dense‑AI/scientific‑agent‑skills.
Authors:Xiyuan Zhou, Zhuoqi Li, Xinlei Wang, Yirui He, Yuhao Wu, Yuheng Cheng, Yan Xu, Junhua Zhao, Jinjin Gu
Abstract:
Data contamination undermines the reliable evaluation of large language models (LLMs) on mathematical problem solving. While rewriting‑based evaluation mitigates memorization, existing methods lack guarantees of problem validity and answer correctness. We propose Proof‑Verified Benchmark Rewriting (RePro), the first framework to integrate Lean‑oriented neural automated theorem provers (ATPs) into benchmark rewriting, which rewrites problems and regenerates answers with correctness ensured by Lean‑verified proofs. Experiments on GSM8K and MATH show that RePro's retained rewritten instances achieve 100% well‑definedness, feasibility, and answer correctness, while existing methods still produce invalid or incorrect instances. Moreover, several models exhibit accuracy drops on proof‑verified rewritten benchmarks, suggesting that their performance is sensitive to surface‑level and structural variations and may partly reflect memorization effects. Our source code and data are available at https://github.com/AI4Engi/RePro.
Authors:Zhiyang Qiu, Yangtao Wang, Xiaocui Li, Yanzhao Xie, Siyuan Chen, Wensheng Zhang
Abstract:
Graph prompt learning is an effective paradigm to adapt pre‑trained graph models to downstream tasks in low‑resource scenarios. However, existing multi‑task graph pre‑training frameworks generally use randomly initialized prompts, leading to poor alignment between the prompt space, pretext objectives and graph structural characteristics. This greatly weakens the task relevance, structural awareness and transferability of prompt representations. To address this challenge, we propose TPGC, a dual‑prior prompt initialization solution that explicitly models the synergy between task prior and structural prior. Specifically, the Task‑Prior Injection Module first conducts a short homologous multi‑task pre‑training on an auxiliary graph, enabling prompt initialization to inherit optimization preferences associated with multiple pretext tasks. Built on the task‑aware representations, the Structure‑Prior Injection Module further extracts transferable global structural context from the auxiliary graph, converting it into layer‑wise prompt vectors by aggregating structurally informative node embeddings. Extensive experiments on 6 mainstream benchmarks covering node and graph classification show that TPGC achieves consistently better performance under few‑shot settings than state‑of‑the‑art baselines, with fewer downstream tunable parameters and lower runtime. The code is available at https://github.com/Virgilqiu/TPGC
Authors:Hadi Mohammadi
Abstract:
Outcome‑only evaluation is the production default for LLM agents: show a judge the request and the final reply and ask whether it was handled well. The metric is structurally blind to an agent that reaches the right answer the wrong way. We measure that blind spot where ground truth is known by construction: a deterministic tool‑using support‑desk environment, a scripted oracle policy that always solves it, and a fault injector that breaks exactly one thing at a known step, stratifying faults by whether the customer‑visible outcome survived (silent) or not (loud). Five judges (programmatic rules, outcome‑only, step‑rubric at two model sizes, and a self‑consistency ensemble) are scored on detection, step localisation, fault typing, calibration, and cost over 400 trajectories. The outcome‑only judge catches 84% of loud faults but 45% of silent ones while flagging 33% of correct trajectories; a step‑rubric judge reaches 77% silent recall with zero false alarms at 3x the cost. No judge reads the final reply: an invented promise appended to an otherwise perfect trajectory evades the rules entirely and the step judge 82% of the time, and self‑consistency triples cost while improving nothing. We argue that judge evaluations must stratify recall by outcome survival, and release the environment, the injector, all raw verdicts, and an analysis pipeline that rebuilds every number offline.
Authors:Zongrong Li, Shengkun Ye, Feiyou Guo, Zuoyou Dang
Abstract:
An LLM agent calling a production API cannot distinguish a query that matched nothing from a query the server did not understand. Both return HTTP 200 with a parsable body, no exception to catch and no field to branch on. We ask what predicts which one occurred, and what it does to the agent. Auditing 721,320 parameters across 2,501 independently published OpenAPI documents, we find that 7.5% declare an enumeration and 15.2% declare any machine‑checkable constraint at all, while 40.1% of documents state at least one constraint in prose that their schema does not encode. Executing 219 schema‑derived perturbations against live commercial endpoints from 27 vendors, reached through a single aggregation layer (Monid) that publishes a schema and returns a run identifier for every call, we find that constraint form, not vendor identity, predicts honesty: machine‑checkable constraints yielded an honest error in 111 of 111 cases, prose‑only constraints failed silently in 44 of 61 (p = 2e‑13). Twelve models across eight families then met these endpoints on ordinary tasks. A vocabulary that the description merely exemplifies was missed by every model on 88 of 88 attempts, while vocabularies written out in full were used correctly 88 to 91% of the time. Running the full agent loop, models detected the resulting silent failure in 12% of cases, repaired it in 0%, asserted a false negative to the user in 41%, and invented a figure in 12%. Promoting the vocabulary into the schema removes the failure, from 88 of 88 to 0 of 89. The fix is one line of schema rather than a better model. Code, schemas, perturbation sets, agent transcripts and per‑call run identifiers are released at https://github.com/Jasper0122/silentprobe.
Authors:Yutao Lai, Kezhao Lai, Hai-Lin Liu, Yuping Wang, Ping Guo
Abstract:
In this paper, we introduce ES‑AHD, a novel framework that fundamentally integrates Evolution Strategy (ES) into Large Language Model (LLM)‑driven Automatic Heuristic Design (AHD). Existing evolutionary approaches predominantly rely on random, individual‑level mutation, leading to blind search and an imbalance between exploration and exploitation. To address these issues, ES‑AHD introduces two core mechanisms. First, Semantic Recombination via LLMs discards traditional point‑to‑point reproduction. By leveraging the LLM's contextual reasoning to explicitly extract core insights from top‑performing individuals, the algorithm establishes a promising semantic search direction. This transforms random code mutation into targeted, center‑guided sampling inspired by ES. Second, Stochastic Covariance Adaptation via Temperature Sampling dynamically addresses the exploration‑exploitation dilemma. By mapping the covariance matrix in ES to the LLM's sampling temperature, the framework employs a stochastic random walk mechanism with momentum. This approach primarily shrinks the search radius for micro‑level code refinement, while retaining the critical ability to occasionally sample higher temperatures to escape semantic local optima. Ultimately, ES‑AHD provides a highly directional, robust, and efficient search paradigm, significantly accelerating the generation of high‑quality heuristic algorithms. The source code is available at: https://github.com/Mriya0306/ES‑AHD.
Authors:Ranjit Raut, Aarav Subedi, Sagun Rai, Sudan Jha
Abstract:
Computer science papers rely heavily on diagrams: architecture drawings, system flowcharts, and pipeline schematics that often carry more information than the text around them. There is currently no public dataset that pairs this specific kind of figure with captions, context, questions, answers, and step‑by‑step reasoning, which is exactly what is needed to train a vision‑language model to understand them. We present SCAFFOLD\footnotehttps://github.com/theranjitraut/scaffold, a large‑scale structured dataset of computer science research figures with diagram QA and Chain‑of‑Thought reasoning traces. This dataset consists of (image, caption, context, question‑answer, chain‑of‑thought) tuples from arXiv computer science papers prepared using layout detection and PDF parsing, with an AI‑assisted question‑generation step. The resulting large‑sized SCAFFOLD‑157K dataset spans 3,058 papers with 29,887 figures (157,387 pairs), a medium‑sized SCAFFOLD‑37K dataset (36,797 pairs), and a small‑sized SCAFFOLD‑12K dataset (12,000 pairs). We used SCAFFOLD‑12K for baseline experiments on Qwen2.5‑VL‑3B‑Instruct.