PHYSICAL AI · 2026-10-06

Physical AI Brief

Daily cross-source signals for the Physical AI supply chain — silicon photonics, CPO, VLA models, humanoid hardware, embodied AI. Three streams, one page, zero filler.

796 items today · 742 arxiv · 0 SEC 8-K · 54 humanoid · 0 CN photonics

01 ARXIV · PHYSICAL AI PAPERS

742 items
  1. arxiv:2610.06852 · cs.CV
    One Figure, Every Canvas: Editable Flowchart Relayout via Agentic Pipeline
    Shih-Chen Tseng, Chih-Hsuan Chen, Ryan Yang, Hsi-An Chen +2

    Pipeline figures in ML papers must be repurposed across many canvases, including paper columns, 16:9 slides, portrait posters, 1:1 social teasers, 9:16 phone previews. Each format imposes a different aspect ratio on the same computational graph, where any silently broken connection misrepresents the method. We formulate aspect-ratio-adaptive flowchart relayout as a distinct task: given a raster flowchart and a target ratio, produce a structurally faithful, hallucination-free, editable layout. Existing methods fail characteristically: image-to-image models stretch blocks and reject extreme rati

    agentagenticbenchmark
  2. arxiv:2610.06850 · cs.RO
    InterMimicGen: Scaling Humanoid Loco-Manipulation through Self-Evolving Motion Imitation
    Yucheng Zhang, Sirui Xu, Jinhong Li, Liuyu Bian +7

    Captured human-object interactions provide rich supervision for humanoid loco-manipulation, but they are sparse, heterogeneous, and not directly executable by robots. We introduce InterMimicGen, a self-evolving motion-imitation framework in which robot motion data and a tracking policy improve each other. First, we consolidate motion-captured human-object interaction datasets and retarget them into humanoid robot references while preserving whole-body coordination and dexterous hand-object relationships. This produces a large and diverse humanoid robot reference collection for dexterous whole-

    manipulationdexteroushumanoidself-evolving
  3. arxiv:2610.06846 · cs.AI
    BiasFlow: Geometric Monitoring and Backbone Regularization for Spurious Feature Reliance
    Haojin Deng, Zhiping Lin, Yimin Yang

    Worst-group accuracy (WGA) evaluates a trained predictor but does not characterize how its frozen backbone behaves when a new head is learned. We introduce BiasFlow, a hook-based toolkit for monitoring class-attribute centroid alignment (IBMI), within-class centroid separation (W-IBMI), and feature-projection sensitivity. IBMI is confounded by class-attribute correlation and is not a measure of causal feature reliance. We pair these diagnostics with BiasFlow Regularization (BFR), a supervised, composable class-conditional centroid-alignment penalty. W-IBMI verifies the quantity BFR optimizes;

    benchmark
  4. arxiv:2610.06843 · cs.RO
    Recursive Video In-Context Learning for Agentic Robot
    Wenrui Bao, Xinxin Liu, Bingxin Xu, Yuzhang Shang

    LLM agents that orchestrate frozen vision-language-action (VLA) policies improve across episodes through text memory, which records what the agent did but not how the task is done. A demonstration video shows it, but fits poorly into an agent's context. The full video slows every turn, fixed keyframes lose the contact detail that decides whether a grasp holds, and what the agent needs shifts from the task's structure while planning to the frames around each contact. We introduce Recursive Video In-Context Learning (RV-ICL), a training-free method that turns a demonstration into a hierarchy the

    vision-language-actionliberograspagentllm agentagentic
  5. arxiv:2610.06839 · physics.app-ph
    Goal-Oriented Wave Computing for Direction-of-Arrival Estimation
    Mert Kalfa

    Programmable metasurfaces---arrays of elements whose electromagnetic response can be tuned electronically---can process signals as a wave propagates through or reflects off them, a paradigm known as wave-domain analog computing. The design strategy is typically indirect: the surface is fitted to a prescribed linear operator, such as a discrete Fourier transform, and the result is read from output power measurements. Using direction-of-arrival (DoA) estimation as a canonical benchmark, we study what this indirection costs across analog computing topologies, namely reflective reconfigurable inte

    benchmark
  6. arxiv:2610.06834 · cs.LG
    Direct Intermediate Initialization for Tilted Diffusion Samplers
    Gregory D. Bellchambers

    Some diffusion posterior samplers construct Gaussian-tilted intermediate distributions along the reverse process. We observe that these targets can be pulled back to clean-space posteriors with weaker conditioning, with samples transported analytically to the corresponding noisy-space target through a Gaussian bridge. For the sequential Monte Carlo (SMC) sampler MCGDiff, the effective observation variance of this pulled-back problem is up to twice the diffusion-noise variance. We exploit this structure to initialize MCGDiff directly at an intermediate time: an approximate solver samples the so

    benchmark
  7. arxiv:2610.06831 · cs.CV
    UniSlider: Perceptually Uniform Sliders for Continuous Image Editing
    David Serrano-Lozano, Duygu Ceylan, Yannick Hold-Geoffroy, Iliyan Georgiev +2

    Sliders provide an intuitive interface for continuous image editing. In current generative approaches, however, the slider is simply a rescaling of the method's strength parameter, such as an adapter coefficient, a prompt weight, or an interpolation factor. This strength relates poorly to perceptual change. The image can partially revert as the slider moves, long stretches of the range produce no visible difference, and short intervals transform the image abruptly. Remapping the strength could fix this uneven pace, but only if the trajectory is monotone, which current methods do not enforce. W

    benchmark
  8. arxiv:2610.06830 · cs.LG
    MemPilot: Orchestrating On-Demand Multimodal Memory Curation for LLM Agents
    Haozhen Zhang, Haodong Yue, Quanyu Long, Jianzhu Bao +5

    Memory has become integral to the LLM agent ecosystem, supporting information retention and reuse across interactions. However, most existing agent memory systems construct memory in a query-agnostic manner, which can incur unnecessary preprocessing cost and discard details that later prove essential. Recent studies have begun shifting memory processing toward runtime adaptation, but typically specialize in particular operations or fixed processing schemes, leaving flexible control over performance, cost, and latency largely underexplored. To address this challenge, we present \textbf{MemPilot

    memoryagent memoryagentllm agentbenchmark
  9. arxiv:2610.06829 · cs.LG
    CLIFT: Conformal Self-Verification for Web Agent Training and Test-Time Scaling
    Yifan Zhang, Yutong Dai, Viraj Prabhu, Zhiyuan Hu +2

    Open-source web agents are now strong enough to execute realistic browser tasks, but training them with reinforcement learning still depends on weak supervision: binary task success is too sparse for credit assignment, while frontier-language-model judges are too expensive to call at every step and cannot be assumed available at deployment. We introduce CLIFT, a training and test-time scaling method built around conformal self-verification. During training, the agent answers natural-language verification questions about its own rollouts; a Compositional Conformal Certifier keeps only question

    agentbenchmark
  10. arxiv:2610.06825 · cs.CV
    PlotGround: Grounding Plot Digitization in Real Scientific Figures and Their Source Data
    Yaohui Zhang, Binxu Li, Haoyi Duan, Jiacheng Miao +6

    Scientific figures often encode quantitative results that are not readily available in machine-readable form, making accurate plot digitization important for verifying and reusing published findings. Yet it remains unclear how accurately current models recover plotted values from real scientific figures, as existing benchmarks rely largely on synthetic charts or cover only a limited range of chart types. We introduce PlotGround, an automated pipeline for building plot digitization benchmarks from real scientific figures and their author-released source data. PlotGround maps figures to source t

    benchmark
  11. arxiv:2610.06824 · cs.AI
    TasteVal: Measuring the Experimental Research Taste of AI Systems Against Human Experts
    Oliver Jaffe, Dane Sherburn

    We introduce TasteVal, a benchmark to evaluate the experimental research taste of frontier models. We define research taste as the ability to pick interesting problems to solve, design experiments, and interpret experimental results. TasteVal measures the experimental component of research taste; given a fixed research problem, we measure how well a model iteratively designs experiments and draws conclusions from their outcomes. We operationalize experimental research taste as compute efficiency; a Researcher who reaches the same score as an expert human using half the serial experimental comp

    agentbenchmark
  12. arxiv:2610.06822 · cs.LG
    Private online learning and prediction for Littlestone classes
    Amartya Sanyal

    We study mistake bounds for differentially private online learning and online prediction under oblivious realisable adversaries. Online learning requires the learner to release a hypothesis at each time step whereas in online prediction, the learner only needs to make predictions without releasing a hypothesis. Using a novel lower bound for private online learning and an upper bound for private prediction, we show that the sample complexity of these two problems are separated by a factor that grows with the time horizon for every class of finite Littlestone dimension $d$. First, we prove that

    online learning
  13. arxiv:2610.06814 · cs.RO
    TAPDreamer: Transferable Adversarial Patches for World Action Models
    Xuanyu Lu, Fengqing Jiang, Kaiyuan Zheng, Yichen Feng +7

    World models learn to predict how their environment will evolve, making them an important foundation for general-purpose robotic control. Yet world action models depend on camera inputs whose manipulation can corrupt the visual representations used across tasks and action policies. Existing attacks on these models optimize against the victim's actions or predicted futures and therefore require access to target-model outputs. In this paper, we propose an attack, TAPDreamer, against world action models that instead uses a public encoder alone to construct a fixed local perturbation that transfer

    manipulationliberorobotwinworld modelbenchmark
  14. arxiv:2610.06813 · cs.CV
    Less Context, Better Geometry: Masked Geometric Encoder for Robust 3D Foundation Models
    Zhimin Shao, Xijun Liu, Zhaoliang Zhang, Yutao Tang +3

    Recent progress in 3D foundation models has enabled rapid 3D reconstruction and camera calibration by leveraging learned 3D priors from vast amount of spatial data. However, the all-to-all global attention design leads to quadratic complexity and limits long-sequence inference; unconstrained cross-view interactions also can propagate unreliable evidence from occluded or visually similar but geometrically distant views. In this paper, We introduce a Masked Geometric Encoder (MGE), which promotes the learning of robust geometric representations under incomplete cross-view context. During trainin

    benchmark
  15. arxiv:2610.06809 · cs.LG
    Block Disentanglement in CRL: Bridging Identifiability and Visual State Estimation
    Emre Acartürk, Pranamya Kulkarni, Puranjay Datta, Karthikeyan Shanmugam +2

    Causal representation learning (CRL) is the process of recovering causally-related latent variables from high-dimensional observations. As a label-free inference method, CRL is particularly attractive for applications where data labels are unavailable or impractical to obtain. While there has been significant progress in understanding the identifiability guarantees of CRL, such guarantees often hold under highly stylized assumptions, which temper the direct application to real-world problems. This paper has a two-fold objective for interventional CRL. First, it establishes identifiability guar

    embodied
  16. arxiv:2610.06805 · cs.RO
    H-JEPA: End-to-End Learning of Hierarchical World Models for Visual Planning
    Wancong Zhang, Basile Terver, Michael Rabbat, Yann LeCun +1

    Long-horizon planning with latent world models requires reasoning across timescales and levels of abstraction. Existing task-agnostic JEPA world models predict and plan at a single timescale or with multiple horizons in one shared latent space. We introduce H-JEPA, an end-to-end recipe for training a hierarchy of action-conditioned JEPAs in which each level predicts farther ahead in its own learned latent space. Planning proceeds top-down: the top level optimizes progress toward the goal, and each level's predictions become subgoals for the planner below it. When factors in the data evolve at

    manipulationworld modelaction-conditioned
  17. arxiv:2610.06795 · cs.LG
    Round-Trip KNN Clustering: multiscale hierarchical cluster detection on directed nearest-neighbour graphs
    Eraldo Pereira Marinho, Caetano Mazzoni Ranieri, Fabricio Aparecido Breve

    We introduce Round-Trip KNN Clustering (RTKNNC), a graph-based method for finding cluster structure at several neighbourhood scales without requiring the number of clusters in advance. Unlike approaches that first make a $k$-nearest-neighbour (KNN) graph undirected, RTKNNC keeps both directions of the neighbour relation: which points a given point selects and which points select it. Incoming selections are treated as weighted votes that help decide which local connections remain visible during a recursive forward-and-reverse traversal. Repeating the procedure for increasing $K$ reveals how gro

    benchmark
  18. arxiv:2610.06790 · cs.AI
    Back to the Future: Rethinking EDA Infrastructure for Agentic Systems in Chip Design Verification
    Je Yang, Ivan Lobov, Thomas Karpati

    The unprecedented computational scale of modern artificial intelligence depends on complex, multi-billion-transistor Systems-on-Chip, yet the workflows that verify these chips remain stubbornly manual. Although Large Language Models (LLMs) have made rapid inroads into Electronic Design Automation (EDA), approximately 74.6% of existing studies target static Register-Transfer Level (RTL) code generation, leaving post-simulation verification and interactive waveform debugging largely untouched. We introduce Back-to-the-Future (BTTF), an end-to-end agentic framework that closes this infrastructura

    multi-agentagenticbenchmark
  19. arxiv:2610.06782 · cs.CL
    T-Search: An Open Agentic Retriever and Playground for Hard Multi-Step Search
    Olga Tsymboi, Ramil Latypov, Aleksandr Medvedev, Danil Taranets +4

    We present T-Search, an open-weight agentic retriever for hard multi-step search. Given a question and a search tool over a fixed corpus, it runs a bounded multi-round search and returns a ranked list of evidence chunks with short justifications, leaving answer generation to a downstream model, so backend and generator can be swapped without retraining. T-Search is built on Qwen3.6-35B-A3B and trained on adversarially filtered synthetic search tasks with round-sliced supervised fine-tuning followed by GSPO on a recall reward. Averaged over seven English and Russian benchmarks with gold evidenc

    agenticbenchmark
  20. arxiv:2610.06778 · cs.LG
    IdeaLens: Detecting AI Ideas in Long-form Writing
    Rishanth Rajendhran, Minjoon Choi, Jenna Russell, Ramya Namuduri +4

    While modern AI detectors identify who wrote the words, emerging policies on AI use increasingly hinge on a different question: who came up with the ideas? We introduce IdeaLens, a detector that identifies whether a document's ideas came from a human or AI (idea provenance), regardless of who wrote its words. To focus IdeaLens on ideas rather than prose, we represent documents as outlines: lists of items that each pair a discourse role with a brief, paraphrased description of the content, minimizing word-level overlap with the raw text. We train IdeaLens on 1M FineWeb documents with silver lab

    benchmark
  21. arxiv:2610.06777 · cs.RO
    On Learning Optimal Corners in Orthogonal Partially Observable Cooperative Guard Art Galleries
    Yassin Ben Mansour, Edwin Meriaux

    The CADENCE algorithm solves the Partially Observable Cooperative Guard Art Gallery Problem (POCGAGP) with formal coverage and connectivity guarantees, but leaves unspecified which valid corner each agent should be deployed to, a choice that strongly affects efficiency. We introduce two learned corner-selection heuristics that preserve these guarantees: a CNN scoring candidates on a grid encoding, and a GATv2 network trained with Deep Q-Learning (DQN) on a visibility graph. Across 7,500 runs on random orthogonal environments (50x50 to 250x250), our heuristics outperform baseline CADENCE in bot

    agent
  22. arxiv:2610.06765 · cs.AI
    Conditional Rank Allocation for Taxonomy-Aware Medical Language Model Adaptation
    Guangyuan Dong, Ziwei Hong, Xuehao Zhou, Zidong Yu +5

    Medical question answering spans specialties and clinical operations that may benefit from different adaptation directions. We propose ARBOR, a parameter-efficient method that selects rank-one components from a shared low-rank basis for each question. An additive gate combines question representations, specialty tags, operation tags, and their interaction; a learned coefficient scales the adapter residual. An illustrative separation under orthogonal, equiprobable subtasks shows how conditional selection can avoid an approximation floor faced by a fixed update with the same active rank. This re

    benchmark
  23. arxiv:2610.06751 · cs.LG
    MatrixFormer: A Foundation Model for Matrix Completion
    Dwaipayan Saha, Jacob Feitelberg, Kyuseong Choi, Raaz Dwivedi +1

    Matrix completion underlies problems from tabular imputation to causal inference, yet existing tabular foundation models treat it as entry-by-entry prediction, repeating context for every target and discarding the matrix's two-dimensional structure. We introduce MatrixFormer, a pre-trained matrix-native transformer that predicts a full distribution for every missing entry in a single forward pass. MatrixFormer is trained entirely on synthetic low-rank and latent-factor matrices under diverse missingness patterns. Applied zero-shot and with the same model weights, MatrixFormer achieves competit

    benchmark
  24. arxiv:2610.06750 · cs.AI
    Balancing Memory Pathways: Analyzing and Improving Memory Utilization in Hybrid LMs
    Hyunji Lee, Joykirat Singh, Zaid Khan, Justin Chih-Yao Chen +4

    Recurrent-attention hybrid language models (LMs), which interleave attention and recurrent layers, are increasingly used to combine the efficiency of the recurrent layers with the strong performance of attention layers. Prior work suggests that attention and recurrent layers offer complementary pathways to use past information: attention supports precise memory recall from earlier tokens, while recurrent layers support consolidation of disparate information over long contexts. However, we observe that simply having access to both pathways does not mean that hybrid LMs are effectively using the

    memorylong contextagentic
  25. arxiv:2610.06748 · cs.LG
    BazaarBench: Delegation Safety in Decentralized C2C Marketplaces Run by LLM Agents
    Ziyan Wang, Shuqing Shi, James Oldfield, Samuele Marro +4

    In decentralized consumer-to-consumer (C2C) marketplaces, people list goods, negotiate with strangers, and rate one another, so trust rests on reputation. Large language model (LLM) agents now act for users, raising risks to their money, privacy, and reputation. We introduce BazaarBench, a simulated C2C marketplace and benchmark for evaluating the safety of these agents. It tracks ownership, item condition, and commitments across transactions, combining record checks with rubric-based LLM judgments to identify six failure types across five stages. We run three base markets for 30 simulated day

    agentllm agentbenchmark
  26. arxiv:2610.06729 · cs.CL
    Improving Diversity in LLM Short Story Generation
    Zahra Solati Dehkordi, Vasileios Lampos

    Large language models (LLMs) can generate accurate responses, but these are void of diversity. We attempt to address this for the task of creative short story generation. Drawing on established writing conventions and known LLM limitations, we target variation in genre, tone, style, and named entities. To promote diversity across these dimensions, we introduce DivLM, an LLM post-training framework consisting of two phases. First, we perform continued pre-training on a creative writing corpus and restore instruction-following capabilities using weight residuals. We then apply reinforcement lear

    post-training
  27. arxiv:2610.06704 · cs.CV
    Extending Dynamic World Surface Water Mapping to Sentinel-1 with AlphaEarth Embeddings
    Rohit Mukherjee, Frederick Policelli, Beth Tellman, TC Chakraborty +3

    Dynamic World (DW) maps land use and land cover globally at 10 m from Sentinel-2 (S2) imagery, but only for cloud-free observations, which limits where and when surface water can be mapped. We use the DW water class as weak supervision for a Sentinel-1 (S1) synthetic aperture radar (SAR) model so that DW-like water maps can be produced for every S1 acquisition. Google's AlphaEarth Foundations (AEF) annual embedding supplies spatial context, while S1 backscatter supplies the acquisition-time observation. On 53 globally distributed scenes with independent annotations of 3 m PlanetScope imagery a

    benchmark
  28. arxiv:2610.06695 · cs.CL
    MedPrune: Topology-Efficient Multimodal Multi-Agent Communication Evolution for Medical VQA Tasks
    Jiuheng Wan, Runze Li, Chen Chen, Tingyuan Hu +4

    While medical multimodal large language models (Med-MLLMs) advance medical visual question answering (VQA), existing clinical workflow-inspired multi-agent frameworks suffer from interaction patterns and excessive computational overhead caused by redundant communication topologies. In this paper, we propose MedPrune, an efficient medical multimodal multi-agent collaboration framework that dynamically prunes both nodes and edges from the communication topology to enhance reasoning ability and token efficiency. Specifically, we first formulate the diagnostic process as a heterogeneous communicat

    multi-agentagent framework
  29. arxiv:2610.06693 · cs.LG
    Adapting prior-data fitted networks for tabular anomaly detection
    Maximilian Bershtman, Niv Cohen

    While deep features have transformed anomaly detection in images and video, their impact on tabular data has been less substantial, partly due to the limited availability of strong deep representations. Recently, prior-data fitted networks (PFNs) have emerged as a promising source of such representations for tabular data. In this work, we investigate how PFN representations can be adapted and leveraged for anomaly detection. The question is harder than it looks. No anomalies are available before deploy- ment, so model parameters cannot be tuned with supervision, and the reference set that defi

    benchmark
  30. arxiv:2610.06689 · cs.CL
    Programmatic Search Agents: Extending Agentic Search Beyond Query Reformulation
    Jiaming Qian, Huiyan Yang, Mandi Liu, Jie Liu +6

    Search agents adapt their queries, yet fixed search interfaces leave candidate processing and evidence presentation outside the agent's direct control. Our trajectory analysis shows that supporting passages can be retrieved yet never delivered to the agent; a same-page oracle intervention shows that changing the returned evidence can reduce subsequent search. We introduce Programmatic Search Agent (PSA), which makes a local executable computation over candidates the unit of a search action. PSA unifies a persistent candidate workspace, flexible primitive composition, and selective evidence pre

    agentagenticbenchmark
  31. arxiv:2610.06686 · cs.LG
    OVAL: Output-Aware Local Page Bases for KV Cache Retrieval
    Ashkan Shahbazi, Chayne Thrash, Soheil Kolouri

    Long context inference with large language models becomes increasingly expensive as attention must operate over an ever growing KV cache. Page sparse attention reduces this cost by representing each KV page compactly and retrieving only a subset for each query. Existing retrieval methods are designed to estimate attention scores or page relevance, but their objectives do not directly account for how approximation errors affect the resulting value weighted attention output. We introduce \method{}, an output aware page encoding derived from the joint structure of keys and values while preserving

    long contextbenchmark
  32. arxiv:2610.06685 · cs.LG
    Aligning Multimodal Patient Evidence with Biomedical Knowledge Graphs for Clinical LLMs
    Jiawen Du, Arshan Ali Khan, Chenhao Zhang, Zachary Plotkin +6

    Clinical questions often depend on linking a patient's multimodal evidence to external biomedical knowledge, yet existing predictive systems rarely represent such links explicitly, so they can neither be traced to their evidence sources nor removed to measure their contributions. We present MM-KG (Multimodal Knowledge Graph), which represents heterogeneous, multimodal patient observations and biomedical concepts as separate layers in one typed graph, joined by explicit alignment edges. First, modality-specific harmonizers convert EHR text, imaging, genomic, and biospecimen data into typed obse

    knowledge graph
  33. arxiv:2610.06679 · cs.LG
    Closing the Context Gap: Activation Alignment for Tabular In-Context Learning
    Yoel Zeldes

    Tabular foundation models perform in-context learning (ICL) by conditioning predictions on labeled training examples provided as context. Unlike traditional models that separate training from inference, these models must process all training examples in every forward pass, making each prediction expensive. Restricting the number of training examples reduces this cost but substantially degrades performance. Instead of discarding context, we propose activation alignment, a method that leverages the full context to teach a model how to behave when seeing only a subset. This is achieved by trainin

    benchmark
  34. arxiv:2610.06673 · cs.AI
    The Pushback Paradox: A Two-Probe Diagnostic for Language Model Compliance
    Stefan Bühler, David Exler, Markus Reischl, Mark Schutera

    Are language models compliant with user instructions? A model that always complies can be stopped but also exploited, while one that always resists can be neither exploited nor stopped. We contribute an open two-probe benchmark that can place any language model on this spectrum. In the active probe, a user instructs the model to act and accept a lower payoff, which measures exploitability. In the passive probe, the user instructs it to wait and give up a higher payoff, which measures stoppability. The two compliance rates combine into a compliance index $κ$. Applied to twelve language models,

    multi-agentagent systembenchmark
  35. arxiv:2610.06672 · cs.CV
    VideoTapestry: Query-Adaptive Memory Refinement for Multi-Agent Long-Video Understanding
    Yucheng Liu, Yufei Yin, Mingxiao Feng, Jiajun Deng +2

    Long-video understanding places substantial demands on memory, as answering questions often requires retrieving information distributed across extended temporal spans. Existing approaches broadly follow two paradigms: query-driven exploration, which is sensitive to localization errors, and query-independent memory construction, which may omit question-specific details. We introduce VideoTapestry, a training-free multi-agent framework that adapts a preconstructed hierarchical video memory through coarse-to-fine, query-driven refinement. The preconstructed memory organizes video content into thr

    memoryagentmulti-agentagent framework
  36. arxiv:2610.06666 · cs.LG
    What Matters for Latent Reasoning with Flow Matching
    Yassine Ouali, Adrian Bulat, Georgios Tzimiropoulos

    Latent reasoning lets a large language model (LLM) think in a continuous space and verbalize only the answer. We argue that an effective latent thought must meet five requirements: it should be useful, helping produce the correct answer rather than merely changing it, diverse, so that resampling yields different reasoning trajectories, explainable, so that a decoded chain of thought (CoT) reflects reasoning the answer actually follows, refinable with more inference compute, and efficient, costing less than an explicit CoT at comparable accuracy. Current methods rarely meet these requirements:

    benchmark
  37. arxiv:2610.06653 · cs.LG
    The Birkhoff Geometry of Manifold-Constrained Hyper-Connections: Two Channels, Vertex Viscosity, and Sinkhorn as a Retraction
    Xiaoyu Li, Zhizhou Sha, Chiwun Yang

    Hyper-connections widen the residual stream of a Transformer to $n$ parallel streams. Their manifold-constrained version (mHC) mixes the streams at each layer with a doubly stochastic matrix, which it computes by Sinkhorn normalization of exponentiated logits. We give a geometric theory of this design on the Birkhoff polytope. First, a doubly stochastic mixer splits the stream into a mean channel, on which mHC is exactly a residual network, and a difference channel, which each layer contracts by its second singular value $σ_2 \le 1 - n \min_{ij} H_{ij}$. Thus the extra width is a fading memory

    memory
  38. arxiv:2610.06651 · cs.LG
    Considering Context: When World Models Need Context Encoders
    Oleg Smirnov, Sofiane Ennadir, John Pertoft, Bjartur Hjaltason +1

    Methods for generalization in model-based reinforcement learning typically assume that an agent cannot recover the latent context governing the environment dynamics from its own experience, and therefore supplies it externally. We formalize and test this assumption with \emph{predictive sufficiency}, which quantifies what access to the context adds to next-step prediction under the visitation distribution an agent induces, and separates that quantity into a history-recoverable part, a residual requiring the true context, and the deficit added by a finite model. We classify context-aware algori

    world modelagent
  39. arxiv:2610.06650 · cs.CL
    Wikidata Search Traces: A Dataset for Training Knowledge Graph Search Agents
    Mohamed Chenene, Carlos Rosas-Hinostroza, Pierre-Carl Langlais, Anastasia Stasenko

    Wikidata is one of the largest open knowledge bases, yet answering a complex question over it still requires a SPARQL query that names the right entities and properties and chains their relations. Language models offer a natural-language alternative but answer largely from memory, which is least reliable for less prominent entities. We study agents that instead answer by exploring the graph, and argue that two obstacles limit them: the lack of training data recording how a solver explores, and interfaces that add large graph results directly to the model's context. We test three hypotheses: th

    knowledge graphtool calling
  40. arxiv:2610.06648 · cs.LG
    Representation-Space MMD for Diffusion Language Models
    Ilya Drobyshevskiy, Ilia Sudakov, Maksim Semenov, Denis Kuznedelev +6

    We introduce a post-training method for diffusion language models (DLMs) that minimizes Maximum Mean Discrepancy (MMD) between generated and reference distributions in the feature space of a frozen pretrained DLM. To estimate MMD, we retain contextual features at individual token positions, obtaining multiple observations per sequence from a single extractor pass. We optimize this objective using policy gradients for discrete models and direct differentiation through generated latents for continuous models. In both cases, computing the loss directly from these features enables efficient post-t

    post-trainingbenchmark
  41. arxiv:2610.06647 · cs.CL
    LoGRA: Scaling LLM Reinforcement Learning with Low-Rank Gradient Sketches
    Shaokun Zhang, Yifan Zhang, Jian Hu, Yueying Li +4

    Reinforcement learning (RL) has greatly advanced the capabilities of large language models (LLMs), but its memory demands remain a barrier to broader adoption. We introduce LoGRA, an approach to RL post-training that reduces memory by retaining useful learning signals in low-rank gradient sketches. These compact representations support both model updates and efficient policy synchronization. To prevent overly large updates from disrupting learning, we complement gradient compression with predicted-KL step control, which estimates policy changes before applying each update and adjusts its magni

    memorypost-training
  42. arxiv:2610.06643 · cs.RO
    AffordCraft: Scalable Construction of Task-Ready Simulation Assets from Single Images
    Haoyun Yang, Xueyang Zhou, Ziyi Xie, Yongchao Chen

    Robot learning in simulation depends on the objects the simulator offers. Many tasks need objects with separate parts, joints that allow the required motion, and physical properties that remain valid under contact. Existing methods recover this structure anew for every image: generative models predict parts and joints that mostly fail to settle or move in simulation, and general-purpose agents need a long session of model calls for each photograph. AffordCraft builds such an asset from a single RGB image and a task instruction by retrieval instead of generation: it locates the object and the p

    manipulation
  43. arxiv:2610.06641 · cs.RO
    Physics Residual Dynamics and Reduced Order Whole-Body Planning for Obstacle Aware Human Robot Cloth CoTransportation
    Moein Forouhar, Kosar Behnia, Anirvan Dutta, Hamid Sadeghian +4

    Human--robot co-transportation of deformable objects requires predicting object deformation during motion, since obstacle clearance depends on both the grasp points and the unactuated interior. We present a hierarchical planning framework that combines a learned cloth model with a reduced-order whole-body model of a dual-arm mobile manipulator. A physics-residual conditional recurrent variational autoencoder (p-cRVAE) predicts the full cloth configuration from grasp-point observations by learning a residual correction to a computationally efficient linearized physics model, limiting error accu

    manipulatorwhole-body controlgrasp
  44. arxiv:2610.06637 · cs.CL
    Long-Horizon Textual World Modeling through Structured Reasoning
    Fangxin Wang, Xiang Gao, Yuguang Yao, Kaiwen Dong +2

    World models must predict how an environment evolves under sequences of actions, enabling agents to compare possible futures and reason about counterfactual actions before acting. Long-horizon prediction is commonly obtained by recursively applying a one-step transition model, but intermediate errors can compound over time. Multi-step dynamics models instead condition on a sequence of future actions and predict their consequences directly, but become harder to learn as horizon grows: the model must track interacting state changes across the trajectory, endpoint supervision provides weak credit

    world model
  45. arxiv:2610.06617 · cs.RO
    RealtimeWAM: One-Step Asynchronous World Action Models
    Chengtao Lv, Jinyang Du, Shuyi Feng, Yang Yong +6

    World Action Models (WAMs) incorporate visual representations from video generation backbones to guide action prediction. Recent efficient WAMs adopt Mixture-of-Transformers (MoT) architectures and compute video representations once for reuse by the action expert. However, intra-expert iteration (\ie, multi-step action denoising) and inter-expert waiting (\ie, sequential execution of the video and action experts) still limit inference efficiency. To this end, we present RealtimeWAM, an extremely efficient WAM variant with one-step action generation and asynchronous inference, addressing these

    liberorobotwinbenchmark
  46. arxiv:2610.06616 · cs.CV
    Video Encoders Built on Image Representations
    Jusheng Zhang, Wenhao Wang, Longqi Cai, Liangzhe Yuan +2

    The design of a video encoder determines when frames begin to interact and which frame-specific visual evidence remains accessible to the language model. Native video pathways couple neighboring frames during visual encoding, whereas image pathways preserve independently computed frame representations but incur a much larger visual-token cost when all image tokens are forwarded. We ask a basic question: whether a compact video encoder can instead be built on image representations. To answer this question, we separate three operations that are often coupled: per-frame representation, cross-fram

    benchmark
  47. arxiv:2610.06614 · cs.AI
    FREA: A Multi-Source Expert Benchmark for Reaction Feasibility Verification
    Botao Yu, Bo Zhou, Daniel Adu-Ampratwum, Frazier N. Baker +6

    As generative models and AI agents propose chemical reactions at a scale beyond expert review, feasibility verifiers decide which proposals enter synthesis planning. But do their decisions agree with chemists across different kinds of candidates? We introduce FREA, a benchmark of 751 reactions labeled by expert chemists under an explicit feasibility criterion, drawn from retrosynthesis model proposals, zero-yield experimental records, edits by large language models (LLMs), and five negative candidate generation methods. Our evaluation finds that no verifier leads across all sources: LLMs given

    ai agentbenchmark
  48. arxiv:2610.06610 · cs.LG
    The Surrogate Is Not the Reward: Post-Surrogate Primary-Outcome Acquisition in Contextual Bandits
    Kyungbok Lee, Michael R. Kosorok

    We study contextual bandits in which a surrogate is observed after the action but before the learner decides whether to acquire the primary outcome that defines action value and regret. The value of acquiring the primary outcome depends on both decision relevance (how much the current outcome matters for comparing policies) and the residual uncertainty after observing the surrogate. The Audited Surrogate Bandit (ASB) learns a contextual policy while allocating a budget of $B$ primary-outcome acquisitions over $T$ rounds. ASB sets a pre-surrogate acquisition level from current decision relevanc

    benchmark
  49. arxiv:2610.06603 · cs.AI
    Word-Level Text Unmixing via Evidence-Preserving Ownership Routing with Language Models
    Jinglin He, Siyang Jiang, Lixing He, Guoliang Xing +1

    Text from multiple sources can become interleaved into a single sequence when attribution metadata is lost, such as overlapping speech transcripts, document reading flows, or concurrent agent streams. We formalize this challenge as Word-Level Text Unmixing: given an interleaved lexical stream and source count K, recover the original source sequences while preserving every word occurrence and its within-source order exactly. Directly generating separated texts with LLMs can omit, duplicate, or hallucinate words, violating this exact-reconstruction objective. We therefore propose Evidence-Preser

    agent
  50. arxiv:2610.06599 · physics.optics
    Experimental Demonstration of Autonomous Class Aware Optimization via Digital Twin Aided Optical Network Agent
    Marc Lawson, Ambashri Purkayastha, Camille Delezoide, Andrea Sgambelluri +2

    We demonstrate on a network testbed a Digital Twin-aided multi-agent LLM for autonomous class-aware optical network management. The system detects soft failures and autonomously adapts modulation format per service class requirements, ensuring continuous, marginless channel quality with minimal human intervention. ©2026 The

    agentmulti-agent
  51. arxiv:2610.06598 · cs.RO
    SimForcing: Distilling Simulation Motion Priors into Real-Domain Robot World Models
    Xiaodong Wang, Tianle Li, Chuanxin Song, Junliang Xie +3

    Action-conditioned robot world models must respond precisely to robot trajectories while preserving realistic visual dynamics, yet learning both from heterogeneous robot videos remains challenging. Simulation offers structured motion supervision, but appearance differences hinder direct transfer, and inaccurate simulation predictions can misguide real-video generation. We present SimForcing, a simulation-guided framework that uses simulation both as a source of transferable motion knowledge and as a controllable reference for prediction. First, we transfer motion knowledge from a simulation te

    vision-language-actionembodiedliberoworld modelaction-conditioned
  52. arxiv:2610.06597 · cs.AI
    Can Agent Harnesses and Inference Engines Hear Each Other? The HEAR Protocol for Agentic LLM Serving
    Jiaqi Zhao, Haodong Chen, Jitai Hao, Wei Zhao +3

    LLM agents increasingly execute complex workflows involving multi-turn reasoning, tool use, and parallel agents. Efficient serving requires decisions that span two layers with complementary information: the agent harness understands workflow dependencies, context lifecycles, and execution objectives, whereas the inference engine observes request queues, KV-cache state, resource pressure, and execution capabilities. Existing interfaces do not systematically connect these views, limiting workflow-aware execution. HEAR, a bidirectional Harness--Engine Pairing protocol for agentic LLM serving. HEA

    agentllm agentagenticagent benchmarktool usebenchmark
  53. arxiv:2610.06588 · cs.CV
    Keepsake: Selective Spatial Memory for Long-Horizon Video Generation
    Abdul Mohaimen Al Radi, Kunyang Li, Yuzhang Shang, Mubarak Shah +1

    Long-horizon camera-controlled video generation relies on persistent memory to maintain scene consistency. Existing systems follow two strategies to achieve this consistency. Full-history approaches retain all generated observations, causing unbounded storage and retrieval costs. Selective-construction approaches reduce redundancy, but make one-time retention decisions that are never revisited, even as an observation's value changes with the evolving memory bank. Both strategies leave a shared question unresolved: as the generated history evolves, which stored observations should still remain

    memorypersistent memory
  54. arxiv:2610.06587 · cs.AI
    Mind the Accent Gap: British Accent Robustness in Speech-Driven Financial Voice Assistants
    Aadam Haq, Oggi Rudovic, Malcolm Chadwick, Jay Rainey +4

    AI voice assistants often use Automatic Speech Recognition (ASR) with LLM-based reasoning, yet existing systems struggle with regional British accents, including Scottish, Irish, and Welsh accents, since most ASR models are trained predominantly on American English voice data. Consequently, errors can carry through to the LLM stage, corrupting tool-call arguments and producing wrong or missing responses, which is especially costly in finance. Deployable ASR must also meet tight latency and memory budgets, making an accent-robust model choice even harder. We introduce CavaBench, the first inter

    memorybenchmark
  55. arxiv:2610.06584 · cs.AI
    Does AI Help Cyber Attackers or Defenders? Evidence from Nonpublic Vulnerabilities and Subsequent Attacks
    Tobias Heldt, Matt Turk, Christoph Landolt, Mario Fritz

    The release decision for frontier AI systems increasingly relies on cyber capability benchmarks, yet public vulnerability benchmarks can expose agents to previously published advisories, exploits, and fixes, making it difficult to distinguish prior exposure from capability on unseen vulnerabilities. We evaluate open-weight and proprietary AI models on exploit generation, vulnerability repair and subsequent attacks in five nonpublic software environments, including vulnerabilities we privately disclosed while they remained unpatched. Researcher-developed and reviewed deterministic graders, not

    benchmark
  56. arxiv:2610.06582 · cs.LG
    Mind the Execution Gap: Action-Semantic Mismatch in World-Model Control
    Shengtao Wen, Xiang Chen, Yu Tian, Lingbing Guo +2

    World-model controllers rely on action-conditioned dynamics for prediction and planning, yet real control systems often execute commands asynchronously due to communication delay, packet loss, reordering, and actuator buffering. We study how asynchronous execution changes the action semantics assumed within world-model controllers, rather than treating it only as an external control disturbance. Through controlled interventions, we identify two architecture-dependent failure modes: planning-based controllers such as TD-MPC2 suffer from a future-action timeline mismatch between imagined and exe

    world modeldreamerv3action-conditionedlatent dynamics
  57. arxiv:2610.06576 · cs.CL
    Before Agent Tells The Lie: Has Deception Already Been Represented?
    Xinling Li, Dadi Guo, Qingyu Liu, Qinghua Mao +4

    Large language model (LLM)-based agents can exhibit deceptive behavior during task execution, including hiding failures, fabricating results, or falsely signaling task completion. Existing monitoring approaches mainly detect deception after it appears in observable actions or outputs. In this paper, we investigate whether deceptive behavior can be predicted from an agent's internal representations before it becomes externally visible. We frame deception monitoring as a trajectory-level representation analysis problem and align agent trajectories around key decision points. Using hidden states

    agent
  58. arxiv:2610.06571 · cs.CV
    BrainTRACE: Tracing Longitudinal, Multimodal, and Volumetric Evidence in Brain MRI Clinical Reasoning
    Qizhen Lan, Mengchen Fan, Hang Zhang, Jingwei Duan +4

    Brain MRI interpretation is a longitudinal clinical reasoning problem: radiologists compare serial studies, integrate information across MRI sequences, localize findings within volumetric anatomy, and translate this evidence into report-grounded assessments. Existing medical VQA and 3D imaging benchmarks capture important parts of this workflow, but often evaluate brain MRI through isolated images, static volumes, or ungrounded report-style answers, thereby obscuring failures in the evidence chain that support clinical validity. We introduce BrainTRACE, a report-grounded benchmark for evaluati

    benchmark
  59. arxiv:2610.06566 · physics.optics
    Digital confocal imaging in holographic optical coherence tomography at high space-bandwidth product
    N. P. Klooster, S. A. Thakur, F. Zeisberger, J. R. Hagen +3

    Full-field Fourier-domain optical coherence tomography (FF-FD-OCT) enables rapid volumetric imaging but lacks the confocal gating inherent to point-scanning OCT. By acquiring volumes under multiple oblique illuminations, a digital confocal volume can be synthesized in post-processing, a technique originally developed within the framework of reflection matrix imaging (RMI). Existing implementations, however, are often time-domain, off-axis, or use a Michelson interferometer, which reduces sensitivity, speed and the usable space-bandwidth product (SBP). Here, we present an oblique-illumination F

    mach-zehnder
  60. arxiv:2610.06563 · cs.AI
    HERA: Harness-Environment Co-Evolution for Reliable Agentic Abstention
    Han Luo, Bingbing Wen, Guang Yang, Zora Zhiruo Wang +2

    Large language model (LLM) agents are increasingly capable of acting in complex tool-use environments, yet they often fail to recognize when tasks are infeasible and no valid solution exists. Recent work has formalized this reliability gap as the problem of agentic abstention, and existing approaches typically optimize a model or agent harness against a fixed set of tasks, leading to limited generalization to unseen failure modes. We introduce HERA, a framework for harness-environment co-evolution for agentic abstention. HERA consists of (i) a pipeline to automatically construct verifiable pai

    agentagentictool-use
  61. arxiv:2610.06562 · cs.CL
    Synthetic Cultural Agents from Aggregate Anchors
    Augusto Gonzalez-Bonorino, Kseniia Biriukova, Monica Capra

    Population prompts are widely used to generate synthetic survey responses, but they combine information supplied at inference with associations already encoded during pretraining. We introduce an alternative construction that maps declared aggregate preference anchors into group-indexed choice policies. For each population, the signs of six Global Preferences Survey (GPS) coordinates deterministically label a shared bank of paired synthetic responses, and Direct Preference Optimization fits a parameter-efficient adapter to those comparisons. We evaluate the adapters on candidate World Values S

    evaluation framework
  62. arxiv:2610.06540 · cs.LG
    WaveGSSM: Graph Wave State Space Models for Propagating Spatio-Temporal Patterns
    Junyou Zhu, Fenying Cai, Ping Xiong, Christian Nauck +4

    Spatio-temporal graph models typically encode each snapshot with a GNN and then connect the resulting representations through a temporal module. This space-then-time design is effective, yet it does not explicitly represent how a pattern moves across the graph. We show empirically that, for a propagating process, the same present field can lead to different futures when its recent rate of change differs, motivating an explicit representation of motion in the predictive state. We introduce WaveGSSM, a second-order graph state-space model that maintains two coupled latent states at each node, on

    benchmark
  63. arxiv:2610.06528 · physics.optics
    Cherenkov Bursts are Memory Steps
    Jann Zosso, Guangzi Xu, Vitor Cardoso

    We show that the familiar Cherenkov burst from a finite superluminal charge track can be understood as a pair of interfering electromagnetic memory transitions. Endpoint accelerations of the track produce opposite memory steps in the transverse vector potential, such that the corresponding finite-frequency radiation is universally fixed, below the endpoint-acceleration-scale, by the memory amplitude and the time for which the temporary memory offset persists. As the Cherenkov direction is approached, the memory amplitudes grow while their separation in observer time shrinks, until the two vect

    memoryarena
  64. arxiv:2610.06522 · cs.LG
    Anatomy of LLM Sycophancy: What a Flip Rate Hides
    Haonan Huang

    A model under pushback can correct itself, capitulate, or hold, and one flip rate counts a correction and a capitulation alike. Using SycoLens, a modular replay protocol, we test how user pressure and evaluation settings shape measured flip rates. Each measurement is one stateless replay of an item, a committed answer, and one scripted user line in a fixed form. Every effect is read against a matched control with the line deleted. Pushback wording, committed text, answer format, boundary distance, and ground truth become factors of one instrument; earlier instruments vary one to three of them.

    benchmark
  65. arxiv:2610.06516 · cs.CL
    Test-Time Adaptation of Reasoning Strategies with Bayesian Nonparametric Memory
    Keshav Ramji, Tahira Naseem, Ramón Fernandez Astudillo

    While modern large language models (LLMs) have been trained to reason through verbalized chains-of-thought, the generation cost grows substantially due to suboptimal paths to reach the final answer. Furthermore, as new insights are discovered while observing various input queries (e.g. through self-reflection), limited mechanisms exist for carrying forward these findings to be applied to subsequent problems. One can view the list of such strategies or behaviors as a growing cheatsheet, with elements retrieved from this memory module at inference-time. In this work, we consider structured cheat

    memorymemory modulebenchmark
  66. arxiv:2610.06514 · cs.LG
    ANT: A Multi-Granularity Network Traffic Dataset and Benchmark for Agents Behavior Auditing
    Fan Li, Xiangyu Gao, Zixuan Liu, Tong Li +3

    The growing adoption of large language model (LLM) agents creates a need for network administrators and security teams to audit agent behavior within organizational networks without inspecting private user content. Network traffic offers an observable source of evidence, but how much it reveals about agent tasks and operations remains unclear. Existing traffic datasets lack the joint task and stage annotations needed to evaluate this question. We introduce ANT (Agent Network Traffic), a dataset providing agent behavior information at risk, scenario, and behavior primitive granularities alongsi

    agentbenchmark
  67. arxiv:2610.06513 · cs.LG
    SOL: Measuring Gaps between Text Distributions by Double Sliced Wasserstein Metrics
    Gregor Kornhardt, Moritz Piening, Jannis Chemseddine, Gabriele Steidl

    Evaluating text generation requires measuring how well the generated distribution matches the data distribution. For autoregressive models, this is done by the perplexity. Diffusion and flow-based language models can only provide a likelihood bound, whose tightness differs between model families. Sample-based substitutes such as generative perplexity with entropy do not consider the distribution fit. We propose SOL, a distance between text distributions. Each sequence is represented by the empirical measure of its hidden states under a fixed transformer and the distributions of these measures

    evaluation protocol
  68. arxiv:2610.06511 · cs.RO
    ArtifactArena: Evaluating Models by What They Build in the Physical World
    Kushagra Tiwary*, David Mayo*, Nikhil Behari, Xiangzhou Sun +4

    To evaluate the frontier, we must measure models not by what they say, but by what they can engineer and build in grounded physical environments. We introduce \textsc{ArtifactArena}, an open-ended platform where models face a physically grounded hardware-software co-design challenge: engineering fully functional robots to compete in a simulated arena. We evaluate a frontier model's zero-shot, verifier guided refinement, and open-ended physical design capabilities through three harnesses that refine their bot artifacts based on text descriptions, physics simulator feedback, and gameplay data. W

    benchmark
  69. arxiv:2610.06510 · cs.RO
    MarvisNav: Making Memory Visible on Route Choices for Zero-Shot Object Navigation
    Jincheng Wang, Chi Pui Chan, Wei Zeng, Shuyang Zhang +2

    When searching for an object, people choose their next move by considering both likely target locations and places already explored. The current view can cue place-associated memories, bringing target relevance and prior exploration into the same spatial context. In many zero-shot object navigation (ZSON) methods, however, vision-language models (VLMs) infer promising search areas from egocentric images, while exploration history is represented separately, e.g., as text or maps. This separation either requires an additional fusion step or leaves the correspondence between memory and route choi

    memory
  70. arxiv:2610.06496 · cs.AI
    You Changed Your Mind, The Model Didn't: Demystifying Intent in Multi-Turn Dialogue
    Junle Chen, Wei Chen, Zhengjun Huang, Zhoujin Tian +4

    When a large language model handles a multi-turn task and a user proposes a change but ultimately rejects it, the model should continue as if nothing changed. We find a surprising failure: merely mentioning a rejected change can derail task execution, even when the user's final intent remains unchanged. To systematically study language model behavior under evolving user intent, we introduce Intent-Eval, a controlled benchmark spanning tool actions, code, databases, and mathematics. Across diverse tasks, models are vulnerable to both rejected proposals and superseded requirements, consistent wi

    benchmark
  71. arxiv:2610.06491 · cs.AI
    polyview: A Python package for multi-view machine learning
    Gwendal Debaussart-Joniec, Argyris Kalogeratos

    Multi-view learning jointly exploits multiple complementary representations of the same data and has become increasingly important in machine learning. However, the Python ecosystem lacks actively maintained, unified tooling for end-to-end multi-view workflows. In this paper, we present polyview, a Python package that provides tools for multi-view embedding, clustering, fusion, and view augmentation, as well as for handling incomplete views, all compatible with scikit-learn. The library offers a unified interface for composing heterogeneous multi-view workflows, including seamless transitions

    benchmark
  72. arxiv:2610.06489 · cs.AI
    GPlaceRL: An Open-Source Graph Reinforcement Learning Framework for Detailed Placement
    Pavlos Stoikos, Foteini Oikonomou, Christos Poulos, Maria Pantazi-Kypriou +4

    Reinforcement learning (RL) has emerged as a promising approach for placement optimization, particularly when combined with graph neural networks (GNNs) that capture circuit connectivity. However, most learning-based placement approaches focus on floorplanning, macro placement, or global placement, while detailed placement refinement remains relatively unexplored. In this paper, we present GPlaceRL, an open-source graph reinforcement learning framework for detailed placement refinement. GPlaceRL represents legalized placements as graphs and provides a modular environment for studying graph enc

    benchmark
  73. arxiv:2610.06487 · cs.RO
    Traversability-Aware Cooperative Path Planning for Human-UGV Casualty Evacuation
    Kristian Dalland, Prithvi Poddar, Souma Chowdhury, Karthik Dantu +1

    Heterogeneous multi-robot path planning is a well-studied problem in which agents with disparate kinematic and dynamic models must coordinate to achieve shared objectives. These formulations, however, treat all agents as robotic-their cost models are mechanical and their traversability is sensor-derived. In human-robot teaming, the human partner remains relegated to command and supervisory roles rather than being modeled as a physical co-navigator with distinct mobility constraints and dynamic energy reserves. This work investigates joint path planning for a two-agent human-UGV team in search-

    agent
  74. arxiv:2610.06481 · cs.CL
    AECP: Artifact-Exclusive Communication Protocol for Multi-Agent Code Generation
    Jiaqi Xue, Yanjun Wang, Xiangci Li, Lingbo Mo +4

    As AI agents increasingly tackle complex repository-level coding tasks, distributing work across multiple agents is a natural way to scale beyond the capabilities of a single agent. To coordinate their interdependent work, these agents share findings and agree on interfaces between modules. However, exchanged information often serves only as context, leaving individual agents to interpret it and incorporate it into subsequent work. Consequently, shared findings may go unused and deviations from interface agreements may go undetected, undermining the reliability and efficiency of collaboration.

    agentai agentmulti-agent
  75. arxiv:2610.06479 · cs.CL
    Behavior-Preserving KV Cache Compression
    Doo Hwan Hwang, Junyoung Jang, Junho Na, Hosung Lim +1

    KV caches are a major bottleneck in long-context inference and long-form generation with large language models. Existing training-free eviction policies largely rely on proxy importance signals, such as attention mass, to decide which past tokens to retain. We argue that cache compression should instead preserve the predictive behavior of the full-cache model, retaining entries whose removal would substantially change the model's output distribution. We propose Behavior-Preserving KV Cache Compression, a training-free framework that scores candidate evictions by estimating the compressed-cache

    long-context
  76. arxiv:2610.06469 · cs.RO
    Odyssey: A Closed-Loop Benchmark for Long-Horizon Real-World Driving with Explicit Navigation Routes
    Jungho Kim, Hongjae Shin, Seunghoon Yu, Heecheol Yoo +10

    Closed-loop evaluation of end-to-end driving requires continuous rollouts that reveal how earlier decisions affect subsequent driving. However, existing benchmarks evaluate only short segments and fail to capture later consequences. Ambiguous directional commands also obscure the intended navigation objective. We introduce Odyssey, a closed-loop benchmark for long-horizon driving comprising 100 scenarios, each reconstructed from a 100-second nuPlan driving log to preserve the context of navigation maneuvers and traffic interactions. To provide a consistent navigation objective, Odyssey replace

    vision-language-actionbenchmark
  77. arxiv:2610.06468 · cs.LG
    Latent Flow Matching for Molecular Graph Generation
    Mathis Goupillon, Roman Bresson, Konstantinos Divriotis, Michalis Vazirgiannis

    Modern graph generative models typically operate directly in the discrete graph space, explicitly generating node and edge variables, which can become costly as graphs grow. In this paper, we perform generation explicitly on latent representations of entire graphs obtained from a pretrained Variational Autoencoder with high reconstruction fidelity. The generated representations, obtained through flow matching, are then decoded only at the final step. Across molecular benchmarks of increasing size, our approach achieves strong validity and FCD while offering a favorable quality-efficiency trade

    benchmark
  78. arxiv:2610.06464 · cs.LG
    A Physics-Guided Transformer Framework for Electromigration Analysis in Multi-Segment Interconnects
    Pavlos Stoikos, Anuj Pathania, George Floros

    As technology scales to smaller nodes, increasing current densities make electromigration (EM) one of the dominant reliability challenges in on-chip interconnects. Accurate transient stress analysis is needed to identify wires susceptible to EM degradation, but applying physics-based solvers across many interconnects remains computationally expensive. This paper proposes a physics-guided transformer framework for fast EM stress prediction in multi-segment interconnect lines. The framework converts each line into geometry- and DC-aware segment tokens and uses transformer attention to capture li

    benchmark
  79. arxiv:2610.06454 · cs.AI
    AgentPrivArena: Evaluating and Auditing Real-world AI Agent Privacy
    Shouju Wang, Haopeng Zhang

    The rapid advancement of LLM agents has enabled systems to autonomously perform complex tasks through external tools, but their growing access to personal data introduces significant privacy risks. Existing benchmarks primarily evaluate LLM agent privacy through simulated trajectories and outcome-based metrics, limiting their ability to capture privacy risks arising during multi-step agent execution. In this work, we introduce AgentPrivArena, a framework for evaluating privacy risks in realistic LLM agent workflows. AgentPrivArena integrates authentic MCP tools and self-hosted services within

    agentai agentllm agentbenchmark
  80. arxiv:2610.06453 · cs.AI
    Normality Constraint Learning: Adapting Foundation Models for Time Series Anomaly Detection
    Xiaohui Zhou, Yijie Wang, Hongzuo Xu, Weixuan Liang +1

    Time Series Foundation Models (TSFMs) achieve strong generalization by learning to reconstruct or forecast broad temporal patterns from large-scale time series during pre-training. Yet this strength can become a weakness for anomaly detection: TSFMs may model rare anomalous patterns as effectively as normal ones, allowing anomalies to be accurately reconstructed or forecasted and thus diminishing their reconstruction/forecasting error-based anomaly scores. This paper proposes $\underline{\textbf{N}}$$\textbf{ormality}$ $\underline{\textbf{C}}$$\textbf{onstraint}$ $\underline{\textbf{L}}$$\text

    benchmark
  81. arxiv:2610.06452 · cs.AI
    Multimodal Safety Evaluation Should Measure Controllability Beyond Classification
    Junhyeong Park, Hanwool Lee, DongGeon Lee, Dasol Choi +3

    VLM safety is commonly evaluated through input- and output-level classification. Such classification is necessary, but it does not reveal whether a safety state is accessible or controllable inside the model. We argue that multimodal safety evaluation should therefore report a \emph{controllability profile} alongside behavioral classification, separating representation-level detectability, cross-modal specificity, intervention sensitivity, and benign-preserving selectivity. Using implicit toxicity as a stress case, we instantiate this profile on LlavaGuard and Qwen3.5 with sparse feature decom

    benchmark
  82. arxiv:2610.06450 · cs.LG
    EMG-FM-Bench: A Comprehensive Benchmark for Foundation Model Transfer and Adaptation on Electromyography
    Tianhao Wu, Xu Wu, Amirmohammad Radmehr, Jiawei Yu +3

    Foundation models (FMs) are increasingly being developed for general time series and physiological signals, yet their transferability to downstream physiological tasks remains poorly understood. This question is particularly challenging for electromyography (EMG), where signal distributions vary substantially across users, sensing configurations, acquisition hardware, and downstream tasks. We introduce EMG-FM-Bench, a systematic benchmark for studying foundation-model transfer and adaptation on EMG. EMG-FM-Bench unifies 20 public datasets with over 1 million EMG segments and evaluates nine pre

    benchmark
  83. arxiv:2610.06432 · cs.LG
    Valid Stopping in Adaptive Generator-Verifier Loops
    Mahmoud Hegazy, Michael I. Jordan, Aymeric Dieuleveut

    Numerous agentic workflows are based on a generator-verifier loop: a generator proposes candidates, a cheap verifier scores them, and the workflow terminates when a proposal is verified as good enough. The verifier typically proxies a more costly ground-truth oracle, and as the generator searches adaptively against it, false acceptances may accumulate. Proposals can pass the proxy but fail under the costlier ground-truth check. We study when to stop these loops while controlling the false discovery rate of the accepted proposals. Our construction introduces tools of independent interest in dis

    agenticbenchmark
  84. arxiv:2610.06423 · cs.CV
    Toward Reliable Infant Pose Estimation: A Training-Dynamics Approach to Noisy Annotation Detection
    Emanuele Cardinale, Sara Moccia, Alessandro Cacciatore, Lucia Migliorelli

    Spontaneous movement analysis in preterm infants relies increasingly on markerless pose estimation (PE) to derive clinically relevant motion biomarkers directly from video recordings. Training accurate infant PE models requires large sets of manually annotated keypoints, and human annotation is inherently prone to error. Noisy keypoints (i.e., keypoints mislocalized with respect to their true anatomical position) are especially problematic in this clinical setting, since they can propagate as artificial artifacts into the reconstructed joint trajectories. Building on the small-loss hypothesis

    benchmark
  85. arxiv:2610.06420 · cs.LG
    Efficient Secure Federated Learning via Information-Theoretically Secure Key Distribution: A Medical Imaging Case Study
    Ivan Donà, Hans H. Brunner, Álvaro Troyano Olivas, Chi-Hang Fred Fung +2

    Federated Learning (FL) enables collaborative training of models across institutions without centralizing sensitive data, making it well-suited for privacy-concerned applications, such as medical imaging. To protect FL model updates during secure aggregation, additive masking is commonly employed. However, its underlying classical key establishment is only computationally secure. On the other hand, physics-based Information-Theoretically Secure (ITS) key exchange introduces practical constraints: finite key generation rates and time-limited storage severely limit throughput and sustained train

    benchmark
  86. arxiv:2610.06413 · cs.CV
    SpatialChain: A Benchmark for Auditing Spatial Reasoning Faithfulness in VLMs
    Rafael Teixeira Sousa, Vinícius Paulo Lopes de Oliveira, Elisa Ayumi Masasi de Oliveira, Luiza Martins de Freitas Cintra +4

    Thinking-enabled vision-language models (VLMs) report ever-higher accuracy on spatial benchmarks, yet final-answer scores cannot reveal whether a correct prediction reflects faithful spatial reasoning or a linguistic shortcut. We introduce SpatialChain, a dataset of 28,350 training and 899 test examples pairing spatially-oriented GQA questions with scene-graph-grounded reasoning chains, retained only when the generated answer matches the symbolic ground truth, and a two-axis evaluation combining objective chain-overlap metrics with a scene-graph-aware LLM judge that scores faithfulness and com

    benchmark
  87. arxiv:2610.06411 · cs.AI
    From Benchmark to Bench: Can Agents Survive Real-World Drug Discovery?
    Pierre Llompart, Levent Guner, Helen Lai, Alessandro Tibo +1

    Agentic systems increasingly coordinate molecular-design tools, but it is unclear which layer of the stack limits outcomes on real projects. We developed MAGI, an open modular agent that authors objectives, launches and monitors optimization, interprets structure--activity relationships, and revises its strategy accordingly. MAGI generates molecules either directly through the LLM or by delegating to REINVENT 4, with scoring services interchangeable behind a common contract. We tested it across nine retrospective lead-optimization campaigns from three pharmaceutical companies, replayed under f

    agentagenticbenchmark
  88. arxiv:2610.06407 · eess.SY
    Reinforcement Learning-Based 3D Beam Adaptation for Underwater Wireless Optical Communication with AUVs
    Viviana Centritto~Arrojo, Ama Bandara, Sergi Abadal, Evgenii Vinogradov

    Underwater Wireless Optical Communications (UWOC) provide essential high data rates for Autonomous Underwater Vehicles (AUVs), but reliable connectivity is critically affected by transmitter-receiver misalignment. This work addresses the beam pointing problem for a moving AUV subject to unknown ocean currents through a Deep Reinforcement Learning (DRL) framework. We develop a comprehensive 3D UWOC channel model incorporating depth-dependent attenuation, turbulence, and a discrete-ray method to accurately quantify geometric and misalignment losses. The resulting agent jointly optimizes beam ste

    agent
  89. arxiv:2610.06406 · cs.AI
    What Did the Agent Actually Do? Evidence-Grounded Oversight for Long-Horizon Agents
    Zhongxiang Sun, Jiahao Yan, Hongkang Zhao, Haojie Ding +4

    As agents take on long-horizon tasks, users shift from making individual decisions to overseeing autonomous execution. Yet the volume of agent activity and the fragmentation of supporting evidence make it difficult to determine which decisions warrant user verification. We study monitors that identify consequential decisions and locate evidence to help users assess their implications. We introduce AgentMonBench, a software-engineering benchmark comprising three subsets that cover two complementary dimensions: alignment between requirements and behavior, and awareness of consequential autonomou

    agentbenchmark
  90. arxiv:2610.06401 · cs.LG
    RAISED: Self-Distillation for Robustness to Prompt Injection in LLM Agents
    Mohamed Dhouib, Clement Elliker, Alexi Canesse, Maël Jenny +4

    Tool-using language-model agents are vulnerable to indirect prompt injection because they must act on untrusted external content. Existing training-time defenses can reduce attack success rates, but often at the cost of general capabilities. We show that training-based defenses induce substantial drift in the model's output distribution, altering its behavior even in benign settings and providing a potential mechanism for utility degradation. We further identify a failure mode of these defenses: On benign tool-use tasks, the model refrains from a step needed to finish an authorized task, parti

    llm agentagentictool-usebenchmark
  91. arxiv:2610.06400 · cs.RO
    Visual Swarm Navigation via Deep Reinforcement Learning and Evolutionary Hybrid Design
    Álvaro Díez, Fidel Aznar

    Swarm robotics presents a robust and cost-effective paradigm for advanced automation in complex, dynamic environments, such as those encountered in search and rescue or environmental monitoring. A fundamental challenge for this field is the data-driven design of decentralized controllers capable of generating emergent collective behaviors. This paper proposes a novel, AI-driven hybrid methodology for the automatic synthesis of swarm robotic controllers for autonomous visual navigation. This approach synergistically combines multi-agent reinforcement learning with neuro-evolutionary strategies,

    multi-agent
  92. arxiv:2610.06397 · cs.LG
    Learning Pareto Stationary Fronts via Single-Pass Backpropagation
    Elina Rojin Celik, Marcos Medeiros Raimundo, Isabel Valera

    We propose MOSEL (Multi-Objective Stackelberg Efficient Learning), a framework for a posteriori multi-objective optimization (MOO) in deep neural networks that recovers a full front of Pareto stationary solutions at the computational cost of standard single-objective training. MOSEL reformulates the problem as a bilevel optimization problem that leverages network modularity to decouple representation learning from objective-preference alignment. Casting the bilevel optimization problem as a Stackelberg game enables solving the original a posteriori MOO problem in a single forward-backward pass

    memory
  93. arxiv:2610.06378 · cs.CV
    MTOR: Generalizable AI-Generated Video Detection with Multimodal Semantics and Temporal Over-Regularity
    Hang Wang, Chao Shen, Lei Zhang, Zhi-Qi Cheng

    The rapid evolution of video generation has narrowed the perceptual gap between authentic and synthetic videos, making generalizable AI-generated video detection increasingly challenging. Existing detectors predominantly rely on visual representations, leaving caption-derived textual semantics underexplored. Meanwhile, temporal regularity in fine-grained visual representations has received limited attention. We find that caption-derived textual representations provide complementary discriminative cues to global visual representations. Our analysis further reveals that AI-generated videos exhib

    benchmark
  94. arxiv:2610.06376 · cs.RO
    Towards Robust Prehensile Manipulation in Open-Ended Environments
    Mathilde Kappel, Mahdi Khoramshahi, Louis Annabi, Faïz Ben Amar +1

    We propose to use Quality-Diversity (QD) algorithms to solve robotic prehensile manipulation tasks in open-ended environments. Our approach enables the efficient discovery of a wide range robust grasp configurations, which serve as reliable starting points for generating diverse prehensile manipulation trajectories on articulated objects. The resulting diversity in manipulation behaviors enhances generalization and adaptability, enabling effective deployment continuously evolving open-world settings.

    manipulationgrasp
  95. arxiv:2610.06369 · cs.LG
    Environmental sensor readings in two crop disease image datasets identify the session in which each image was taken
    Sungwoo Kang

    Integrating environmental sensor data with leaf imagery is widely reported to boost crop disease classification accuracy. In this work, we reveal that these reported gains are often artifacts of dataset construction: because a single sensor reading is shared across many images collected in a single session (one farm on one date), multimodal networks can predict disease simply by memorizing session identities. Analyzing two widely used Korean datasets, the Crop Disease Diagnosis (CDD) benchmark and an AI Hub pest/disease dataset, we demonstrate that nearly all images share sensor values, with 9

    benchmark
  96. arxiv:2610.06366 · cs.LG
    Correct Verdicts, Flawed Reasoning: Structured Auditing of LLM-based Vulnerability Reasoning
    Boyue Caroline Hu, Kaivalya Ahir, Ronghao Ni, Limin Jia

    Large Language Models (LLMs) are increasingly deployed for automated software vulnerability analysis. Binary classification alone is insufficient; practitioners need explanations to triage bugs and engineer patches. Standard practice relies on Chain-of-Thought (CoT) prompting, but free-form reasoning allows models to obscure logical leaps, hallucinated execution steps, and internal inconsistencies behind plausible prose. Our manual audit reveals that approximately 60% of correct vulnerability verdicts are accompanied by fabricated or unverifiable claims, and free-form explanations allow reason

    memorybenchmarkllm-as-judge
  97. arxiv:2610.06361 · cs.AI
    Capability-Driven Self-Evolution of Agent Memory
    Yaoqi Chen, Yuru Feng, Qianxi Zhang, Baotong Lu +7

    Memory self-evolution uses task feedback to iteratively improve executable memory programs that store and retrieve information from past interactions. Existing approaches typically adopt holistic evolution, deriving revision directions from mixed feedback and judging progress by overall performance. This can obscure optimization directions and hide capability-specific gains offset by regressions elsewhere, leaving promising directions underexplored. We introduce capability-driven evolution, which extends search guidance from overall performance to individual capability dimensions, preserving p

    memoryagent memoryagent
  98. arxiv:2610.06360 · cs.LG
    Ontology Concept Overlap as a Training Signal: Knowledge-Grounded Reinforcement Learning for Clinical Question Answering
    Aditya Tanna, Abhishek Jindal

    Reinforcement learning post-training for language models relies on two reward designs: human preferences (RLHF, DPO) and binary verifiers (RLVR). Clinical question answering fits neither. Near-correct answers differ by a single substituted entity, and no executable check decides clinical correctness. We instantiate a soft verifier from a maintained controlled vocabulary: UMLS Concept Unique Identifier overlap (via scispaCy, set-level F1) gives a graded, externally specified reward computed without a model in the loop. We combine it inside GRPO with an entropy-normalised LLM judge, which covers

    post-training
  99. arxiv:2610.06354 · cs.AI
    GraphDecide: Benchmarking System One Models on Graph Tasks
    Xianliang Yang, Yapu Zhang, Li Zhao

    Large language models (LLMs) are increasingly explored for graph understanding and decision-making, while System One models such as Jev select directly from supplied options. However, the capabilities of System One models on graph-related tasks remain unclear. We introduce GraphDecide, a model-independent benchmark that combines structural task profiles, matched graph-text input contrasts and heuristic-proposal controls to diagnose graph decision performance. We evaluate Jev and related choice-based models alongside language-model baselines, covering fourteen model-interface configurations. Je

    benchmark
  100. arxiv:2610.06349 · cs.RO
    KineWorld: Action-Induced Transport Fields for Embodied World Modeling
    Ziying Song, Yuchen Liu, Zhuoran Xu, Ziyang Liu +5

    Embodied world models predict the visual consequences of candidate actions before execution. However, existing action-conditioned world models often adopt uniformly weighted visual generation objectives that can be misaligned with embodied prediction needs. Even with explicit motion conditioning, these objectives can underemphasize spatially sparse changes that are critical to interaction. We propose KineWorld, a transport-aware world-modeling framework that extends robot kinematics from motion conditioning to the spatial allocation of generative supervision. Kinematic Transport Lifting (KTL)

    embodiedmanipulationrobotwinworld modelaction-conditioned
  101. arxiv:2610.06348 · cs.LG
    IGA-KAN: Isogeometric Analysis with Physics-Informed Closed-Form Kolmogorov-Arnold Networks for Forward and Inverse PDEs
    Sima Naraghi, Kourosh Parand, Amirhossein Sadr, Dara Rahmati

    Isogeometric analysis (IGA) solves partial differential equations accurately on exact NURBS geometry, whereas neural solvers are mesh-free but often orders of magnitude less accurate and typically trained by non-convex optimization without error control. We propose IGA-KAN, which uses local Kolmogorov-Arnold networks, fitted in closed form, to improve the IGA solution instead of replacing it. An IGA Galerkin solve produces u_h; on every knot-vertex patch a Kolmogorov-Arnold ridge model is fitted to the strong form of the equation, the exact boundary data and u_h, and the models are blended by

    benchmark
  102. arxiv:2610.06347 · cs.AI
    ImproveAnyTask: An Autonomous Post-Training Harness for Iterative Model Self-Improvement
    Xingbo Yao, Xiaoman Wang, Zhengwu Lei, Tinghui Luo +10

    Adapting general-purpose large language models to specific tasks requires substantial human effort in designing data and training strategies. Sustaining improvement is especially challenging because model updates change the error distribution, requiring strategies to be continually refined. We introduce ImproveAnyTask, an autonomous post-training harness that improves task performance under a limited compute budget. Drawing inspiration from gradient-based parameter optimization, the harness organizes adaptation into error attribution, update-direction selection, and executable model updates. I

    self-improvementpost-training
  103. arxiv:2610.06345 · cs.CL
    Breaking Bureaucracy: Evaluating open-source LLMs for legal document review
    Farrukh Baratov, Niki van Stein, Suzan Verberne

    In this paper, we evaluate open-source generative LLMs on legal Natural Language Inference (NLI). Legal inspectorial processes take place in specific domains and often deal with confidential data. This creates a need for working with local models that do not require labeled training data. We evaluate our models on the ContractNLI benchmark and two NLI4Wills datasets. We successfully reproduce the baseline for the task (Span NLI BERT) and we evaluate multiple open-source LLMs on the same task. We analyze the invalid rate of the models, and their stability across temperature settings and domains

    benchmark
  104. arxiv:2610.06344 · cs.LG
    Stability-Shaped Deep Graph Learning
    Junyou Zhu, Langzhou He, Fenying Cai, Christian Nauck +6

    In deep graph neural networks, increasing depth enlarges the receptive field but often leads to over-smoothing, where node representations tend to align. We develop a unified, mode-wise stability framework for deep GNN propagation that provides a principled characterization of over-smoothing. By interpreting layer depth as time and layer updates as graph-coupled dynamics, over-smoothing can be understood as an undesirable dynamical synchronization of features, for which the master stability curve provides a theoretical tool to assess the stability of synchrony. Guided by this theory, we furthe

    benchmark
  105. arxiv:2610.06342 · cs.CV
    MeSD: Multi-Evidence Self-Distillation for VideoLLM
    Weijie Zhu, Han Fang, Hanyu Fu, Yuzhe Zhang +12

    While reinforcement learning with verifiable rewards provides reliable outcome supervision for VideoLLMs, sequence-level rewards offer limited token-level guidance. On-policy self-distillation addresses this limitation by conditioning a self-teacher on privileged information to provide dense token-level supervision. However, aggregating heterogeneous evidence within a single teacher context obscures cross-evidence agreement and conflict. A further challenge lies in determining whether teacher guidance should refine reward-based updates or provide corrective supervision for failed trajectories.

    benchmark
  106. arxiv:2610.06339 · cs.CV
    BabelFake: A Multilingual Audio-Visual DeepFake Benchmark
    Carlotta Segna, Joel Tschesche, Anna Rohrbach

    Reliable and practical audio-visual DeepFake detection requires benchmarks that reflect diverse linguistic contexts and modern data synthesis pipelines for visual as well as audio manipulations. However, existing datasets predominantly contain footage of English-speakers, often include outdated manipulation types, or overlook the audio modality. Further, many datasets feature individuals who did not consent to be used in DeepFake creation. We introduce BabelFake, a multilingual audio-visual DeepFake benchmark recorded with consenting participants. BabelFake contains 399k clips (1,323 hours) fr

    manipulationbenchmark
  107. arxiv:2610.06334 · cs.CV
    SPIN: Image Immunization Against Diffusion Editing via Single-Step Projection in Stochastic Neighborhoods
    Fengming Gu, Jie Zhang, Zhongqi Wang, Qiankun Li +2

    Diffusion models have greatly advanced instruction-guided image editing, while also raising concerns about unauthorized image manipulation. Image immunization addresses this risk by adding imperceptible perturbations to an input image to disrupt subsequent edits. Since editing requests are unknown at image release, protection should remain effective beyond the instruction used to construct the perturbation. Existing immunization methods either require costly full-trajectory backpropagation or use intermediate objectives whose effects may be weakened by subsequent denoising. Meanwhile, a single

    manipulation
  108. arxiv:2610.06331 · cs.RO
    DexForge: High-Fidelity Physics-Informed Dexterous Retargeting
    Meizhong Wang, Kun Cao, Ruiqi Ni, Lihua Xie +1

    Human demonstrations offer rich examples of precise dexterous manipulation and a promising source of robot training data. However, high-fidelity reproduction of demonstrated motions and hand-object interactions across robot embodiments remains challenging under physical constraints. We present DexForge, a differentiable physics-grounded framework for converting human video demonstrations into high-fidelity robot trajectories. We reconstruct spherical-Gaussian object models and hand-object motion from visual observations, then build a differentiable simulator combining efficient Gaussian collis

    manipulationdexterous
  109. arxiv:2610.06329 · cs.LG
    Dynamic Minimax Regret Optimization for Robust LLM Post-Training
    Chengbo Zang, Haoyu Dong, Mehmet Kerem Turkcan, Gil Zussman +2

    Modern LLM training increasingly relies on heterogeneous data sources spanning different domains, tasks, preference distributions, and difficulty levels. We study dynamic minimax regret for group-distributionally robust LLM post-training under instantaneous mini-batch-only bandit feedback. The framework views the training as a two-player sampler-optimizer process: a sampler adaptively selects among data sources using bandit feedback, while an optimizer updates the model parameters using stochastic gradients from the selected source. We focus on the practically restrictive setting where source

    post-training
  110. arxiv:2610.06327 · cs.RO
    Dual Variational Autoencoders for Efficient Sim-to-Real Transfer in Low-Cost Robotic Navigation
    Álvaro Díez, Fidel Aznar

    Vision-based autonomous navigation for low-cost robots remains a fundamental challenge, primarily due to the significant gap between simulated training environments and real-world operational conditions. Direct policy transfer from simulation is often ineffective, while training exclusively on real data is impractical. We propose a hybrid transfer learning framework that effectively bridges the sim-to-real gap by combining domain randomization with feature-level domain adaptation. Our method employs a dual convolutional variational autoencoder architecture with a shared decoder, trained on an

    sim-to-real
  111. arxiv:2610.06322 · cs.AI
    Agentic schema-guided extraction of materials process knowledge from scientific literature
    Sameer Sadruddin, Jennifer D'Souza

    Materials literature contains detailed experimental knowledge, but procedures, chemical entities and measurements remain difficult to aggregate because they are reported in heterogeneous forms and depend on process-specific context. We present SciKGExtract, a schema-guided framework that combines large-language-model extraction with chemical normalization and agent-based evaluation and refinement before knowledge-graph integration. We evaluate the framework on 176 atomic-layer-deposition papers describing zinc oxide (ZnO) and indium--gallium--zinc oxide (IGZO), together with an expert-annotate

    agentic
  112. arxiv:2610.06318 · cs.CV
    Wiring Matters: Injection Topology and Initialization of Affordance Heads in Vision-Language-Action Policies
    Zijian An, Linhan Wang, Jiayan Wang, Shijie Geng +3

    Dense affordance supervision is an appealing auxiliary signal for vision-language-action (VLA) policies, yet naively co-training an affordance head can severely damage instruction following. We present a controlled study of how to wire such a head into a modern VLA on the LIBERO benchmark. Our recipe reads the backbone through a stop-gradient and re-injects an intermediate head feature into the action expert via a learned bridge. The stop-gradient is a precondition: letting affordance gradients reach the backbone drops the policy below the headless base (85.5% vs. 93.1%). With the backbone pro

    vision-language-actionvlaliberobenchmark
  113. arxiv:2610.06316 · cs.AI
    RollPlace: Improving Macro Placement via Monte Carlo Rollout Search
    Qi Zhou, Guojun Liu, Guangzhi Qi, Ming Lu +4

    The application of Reinforcement Learning (RL) in Electronic Design Automation (EDA), particularly for chip placement, has attracted considerable attention in recent years. While existing machine learning (ML)-based approaches have achieved notable progress, they predominantly focus on generating optimal layouts in a single attempt, often producing solutions that require subsequent refinement. To address this limitation, we propose RollPlace, a novel and generalized macro placement framework. RollPlace adopts a two-stage optimization strategy: generating initial placement solutions via machine

    benchmark
  114. arxiv:2610.06306 · cs.RO
    Inspect Robots: Evaluating the Capabilities and Safety of Embodied AI
    Christopher Leet, Achu Menon, Sravanthi Machcha, Sabrina Zou +11

    General purpose language models are increasingly able to control robotic hardware. Understanding the capabilities and safety of these models when embodied is therefore increasingly important for understanding their societal impact and risks. To this end, we introduce Inspect Robots, a modular, open-source framework for developing and running evaluations of embodied agents. Inspect Robots pairs customizable, reusable abstractions for specifying physical evaluations and analyzing their results with infrastructure that automates evaluation setup, execution and termination. We demonstrate Inspect

    embodiedembodied agent
  115. arxiv:2610.06293 · cs.CV
    VepAgent: Bridging Causal-Transition via Tool-Augmented Reinforcement Learning for Video Event Prediction
    Qiutong Chen, Yuchan Guo, Zhenlong Yuan, Haobo Yang +9

    Multimodal Large Language Models (MLLMs) have demonstrated remarkable potential in video understanding, yet their reliance on retrospective summarization and text-centric priors often limits their ability to bridge unobserved causal transitions when applied to Video Event Prediction (VEP). To address this, we propose VepAgent, an agentic framework that integrates causal-transition reasoning with tool-augmented reinforcement learning (RL) for robust VEP. Unlike prior methods that passively project future trajectories from historical dependencies, our approach explicitly models the logical progr

    agentagentic
  116. arxiv:2610.06287 · cs.LG
    From Abusive Language Classification to Sequence Labeling Identification
    Nicolas Zampieri, Ignacio Lopez, Manon Girard, Jeremy Auguste

    Industrial content moderation must process massive message streams under tight latency constraints, yet most abusive language (AL) detection systems rely on sentence-level classification (ALC), which neither localizes abusive spans nor identifies who is targeted. We define Abusive Language Identification (ALI) as a sequence-labeling task that jointly extracts AL spans and target mentions, and assess whether this approach can be used for text moderation. On a pilot corpus drawn from a production moderation pipeline, we compare ALI with ALC on cross-domain generalization and implicit abuse, and

    benchmark
  117. arxiv:2610.06286 · cs.CL
    DeferKV: Rethinking Eviction Timing for One-Shot KV Cache Compression
    Zhe Wang, Jiakai Li, Yujia Sun, Rongzheng Wang +1

    Long-context large language models (LLMs) have demonstrated strong capabilities across a wide range of tasks, but the growing KV cache introduces substantial memory and inference overhead. Existing one-shot KV cache compression methods typically commit to irreversible eviction immediately after prefill, before any signal from actual generation becomes available. Our quantitative analysis shows that early queries from the actual generation stage provide attention signals that are more consistent with subsequent decode attention, with the largest single-step gain occurring at the prefill-decode

    memorylong-context
  118. arxiv:2610.06282 · cs.LG
    dIon: Fragmentation-Based Invariance for Self-Supervised Learning of Tandem Mass Spectra
    Alfred Nilsson, Joel Lapin, Samuel H. Payne, Mathias Wilhelm +1

    We introduce a novel invariance for peptide tandem mass spectrometry data, unlocking self-supervised representation learning that improves de novo sequencing of peptides. This invariance exploits the physical relationship between precursor properties (mass and charge) and fragment-ion evidence, without requiring peptide sequence labels. We introduce dIon, which adapts the DINO framework with two latent prediction tasks, both recovering a clean teacher representation: one from a spectrum mixture, using the precursor as a selection query, and one from a partial spectrum with the precursor withhe

    benchmark
  119. arxiv:2610.06280 · cs.RO
    Future Anchored Verification and Online Recovery for World Action Models
    Zhibin Qin, Zhenxiong Tan, Xinchao Wang

    World action models (WAMs) have emerged as a promising paradigm for robotic manipulation. They act by first predicting how a task should be performed and then decoding the actions from that future. However, the remaining actions are invalid once execution drifts from the prediction. Simply replanning from the already out of distribution state rarely restores what the task still requires; existing execution monitors decide when to stop, but not what to restore. We observe that the answer is already in hand: the future the WAM predicted before acting depicts exactly the states it intended to pas

    manipulationlibero
  120. arxiv:2610.06279 · physics.optics
    Electro-Optical Metalens for Near-Surface Cooling of a Levitated Particle
    Pedro Rosso Gomez, Bruno Melo, Adeel Afridi, Mohamed Sabry Mohamed +2

    Advanced levitation optomechanics in the quantum regime requires sophisticated quantumengineered protocols operating at shorter length and time scales, demanding an increasing control over both optical and electrical potentials. Integrated chip-scale platforms offer a natural route toward such control. Here, we demonstrate optical levitation in vacuum using a miniaturized hybrid electro-optical metalens. Motion control is achieved using a high numerical aperture metalens combined with electrical active feedback using planar electrodes, enabling cooling to low phonon occupations. Reheating meas

    manipulation
  121. arxiv:2610.06274 · cs.LG
    What May an Agent Change About Itself? A Containment Floor for Self-Configuring Agent Runtimes
    Sajib Hossain, Moeen Uddin Mahmud

    Many agent runtimes give the agent a tool for editing its own configuration. Some of that configuration grants abilities, such as enabling a tool. Other parts set the agent's limits: which directories it may write to, who may send it messages, which network address it listens on, how callers authenticate, and the gate that blocks risky writes. If the agent can edit those limits, a single ordinary request can widen them. We study this in a deployed, model-agnostic runtime. We propose a rule: the agent may change fields that grant abilities, and may never change fields that set its limits. We en

    agent
  122. arxiv:2610.06271 · cs.RO
    VLA-ZO: Fast Zeroth-Order Adaptation for Vision-Language-Action Models
    Jaemin Kim, Jiahn Kim, Taesik Gong

    Adapting vision-language-action (VLA) models to deployment-time distribution shifts is important for reliable robotic operation, but conventional first-order adaptation can exceed the memory budget of inference-oriented deployment platforms. Zeroth-order (ZO) optimization offers a forward-only alternative with inference-level memory, but accurate gradient estimation requires many perturbation queries, making naive ZO prohibitively slow for large VLA models. We present VLA-ZO, a framework for fast ZO adaptation that exploits the structure of VLA computation. By confining adaptation to the actio

    vision-language-actionvlavla modelliberomemory
  123. arxiv:2610.06269 · cs.LG
    Evolving in Thought Space: Training a Small Model at Test Time Unlocks Better Discoveries
    Chonghe Jiang, Ao Qu, Siyuan Liu, Ruoyun Ma +8

    Open-ended scientific discovery often requires repeatedly proposing and evaluating candidate solutions. LLM-based systems can support this process by generating and refining executable solutions from verifier feedback. Methods such as TTT-Discover use test-time training (TTT) to update the solution-generating LLM from verifier feedback, adapting its generation policy to improve subsequent proposals on the target problem. However, this becomes expensive when reliable execution requires a large model, since training must maintain gradients, optimizer states, and policy statistics while repeatedl

    leaderboard
  124. arxiv:2610.06257 · cs.LG
    SimAuthor: Harnessing Foundation Models for Persistent Scientific Simulator Authoring
    Yishan Wang, Ran Piao, Mathias Funk, Aaqib Saeed

    Foundation models can generate scientific code, but authoring a scientific simulator (an executable program encoding hypotheses about how mechanisms generate observable signals) requires iterative refinement. Scientific adequacy rarely admits a unique implementation or exact test, so simulators must instead be judged against limited real observations. We study this setting as scientific simulator authoring under weak empirical feedback, where distributional comparisons between simulated and real signals guide revision, and the target is the simulator itself rather than only its generated sampl

    iterative refinement
  125. arxiv:2610.06250 · cs.LG
    Generative World Models Enable Predictive Control of Laser Melt Pool Dynamics
    Yiyang Yan, Markus Bambach, Mohamadreza Afrasiabi

    World models, which learn how environments respond to actions, are emerging as a powerful paradigm for planning through imagined futures, transforming decision-making across games, robotics and autonomous driving. Bringing this capability to manufacturing could enable process decisions on timescales inaccessible to high-fidelity simulation. Here we introduce a generative world model for localized highly dynamic laser melt pool that predicts evolution from histories of temperature and phase morphology under candidate actions. Its generative latent dynamics capture the effects of unresolved melt

    world modellatent dynamics
  126. arxiv:2610.06248 · cs.AI
    From Papers to Mechanisms: An Evidence-Grounded Knowledge Substrate for Scientific Language Models
    Qiuhui Chen, Yibo Liu, Tao Dai, Jiafan Lu +2

    Scientific language models often access literature through untyped text chunks, which fragment the functional and evidential structure required for mechanism-rich questions. We introduce an evidence-grounded mechanism knowledge substrate that organizes scientific literature into provenance-linked evidence units, role-typed entities, and directed mechanism paths. We instantiate it as MS$^3$, a Material-Sensor-Signal-System schema for conductive-fiber flexible sensors, over 13,689 papers, 131,083 evidence items, and 26,648 mechanism objects. On in-domain and coverage-shift question-answering ben

    benchmark
  127. arxiv:2610.06244 · cs.LG
    Constrained Goal-directed Planar Graph Generation with Grammar-based Reinforcement Learning
    Nicolas Hochuli, Lorenzo Miele, Kristina Shea, Tino Stankovic

    Planar graphs are central to applications across science and engineering, yet existing generators provide limited support for goal-directed generation under hard structural and geometric feasibility constraints. We propose a dataset-free method for generating planar graph embeddings by combining parametric graph grammars with safe reinforcement learning to optimize generic task-specific objectives while satisfying constraints during construction. We formulate the generation process as a constrained Markov decision process, where the graph grammar defines the state and action spaces. We further

    benchmark
  128. arxiv:2610.06243 · cs.LG
    RoSA: Rotational Sparse Adaptation for Memory-Efficient Fine-Tuning
    Muhammad Azeem Lodhi, Chao Zhou, Rebekka Burkholz

    Parameter-efficient fine-tuning (PEFT) reduces the cost of adapting foundation models by focusing training on a small parameter subset. Complementary to this idea, we introduce RoSA (Rotational Sparse Adaptation), which narrows adaptation to a subset of layers at a time. RoSA freezes lower layers close to the input throughout training and rotates a trainable block over later layers, progressively increasing the number of frozen layers close to the input. This design reduces optimizer-state memory, shortens backpropagation, and even forward propagation if activations at the last frozen layer ar

    memory
  129. arxiv:2610.06240 · cs.AI
    Artificial Intelligence and the New Science of Culture
    Douglas R. Guilbeault, Bhargav Srinivasa Desikan, James A. Evans

    Cognition and culture have long been treated as parallel objects of study, joined more by metaphor than by mechanism. We argue they are co-constituted in a manner now empirically tractable: subjectivities can be measured as local trajectories through a high-dimensional cultural field, and the field is itself the aggregate of those trajectories. Recent advances in machine learning, including embedding methods and large generative models, provide the first general framework for measuring this co-constitution from micro-cognition to macro-social structure. Vector geometry recovers individual conc

    ai agent
  130. arxiv:2610.06235 · cs.RO
    Encoded but Not in Control: Revealing the Grounding Gap in Vision-Language Robot Policies
    Shaohan Jiang, Jiahang Cao, Qiduo He, Fengting Deng +8

    Instruction following is central to language-conditioned robot policies: language should determine what to do when the same scene permits multiple valid actions. Yet successful execution alone cannot establish whether a policy follows the instruction or infers the task from the scene. We study this ambiguity through scene-preserving instruction interventions, using valid target substitutions, arbitrary nouns, and unrelated sentences while holding the scene fixed. We evaluate vision-language-action (VLA) policies and world-action models (WAMs) in simulation and in real-world experiments. Our an

    vision-language-action
  131. arxiv:2610.06234 · cs.CV
    Joint Class-Time Learning for Video Classification with Multi-Instance Partial-Label Learning
    Lingyu Shen, Wei Tang, Fakhri Karray, Min-Ling Zhang

    Multi-instance partial-label learning (MIPL) addresses inexact supervision in both the instance and label spaces, which can be applied to video classification. However, bag-level labels do not explicitly supervise the correspondence between candidate classes and temporal evidence. We propose {\ours}, which couples label disambiguation with temporal evidence allocation through a joint class--time assignment. Occupancy-regularized spherical matching associates contextualized video features while learning nonuniform temporal mass and discouraging excessive concentration. During training, candidat

    benchmark
  132. arxiv:2610.06227 · cs.LG
    APOD: reasoning-guided agentic population ordinary differential equation discovery for pharmacological digital twins
    Romain Ferrara, Martin Soucail, Victor Gertner, Adil Moussali +6

    Establishing ordinary differential equations (ODEs) describing population data is a fundamental part of mathematical modeling in pharmacology, crucial to developing digital twins. However, doing so from sparse, noisy data is a slow, expert-driven task. Existing automated methods either search a restricted model space or ignore population inter-individual variability. Here we introduce APOD (Agentic Population ODE Discovery), a language-model agent that iteratively reasons over biological knowledge and fit diagnostics in an open-ended search space to discover a population digital twin (PDT), i.

    agentagenticbenchmark
  133. arxiv:2610.06226 · cs.LG
    LeAVJEPA: A Minimalist Architecture for Audio-Visual Self-Supervised Learning
    Benjamin Robson, Santeri Mentu, Wenshuai Zhao, Arno Solin

    Prior audio-visual self-supervised learning methods rely on mechanisms such as EMA target encoders, prediction heads, reconstruction decoders, and contrastive losses. We introduce LeAVJEPA, the first audio-visual encoder trained under LeJEPA's collapse-free objective. A single early-fusion Vision Transformer processes audio, video, and joint audio-video inputs. Modality dropout treats a missing modality as another view of the same event, making cross-modal alignment implicit in the objective. The model aligns global embeddings with modality-specific local embeddings, and SIGReg prevents repres

    vjepa
  134. arxiv:2610.06221 · cs.CV
    Frequency-Decoupled Diffusion Guidance for Non-Blind Image Deblurring
    Sihan Wang, Jinshu Huang, Haibin Su, Yunhua Xue

    Pretrained diffusion models provide powerful image priors for training-free posterior sampling in image restoration. To guide this sampling process, frequency-aware methods progressively incorporate measurement information across frequency bands, facilitating coarse-to-fine reconstruction. However, existing methods typically do not explicitly separate frequency activation from degradation-induced attenuation, leaving attenuation differences among inactive frequencies insufficiently modeled. In this work, we propose frequency-decoupled posterior guidance to separate frequency activation from at

    benchmark
  135. arxiv:2610.06215 · cs.RO
    Towards Quadruped-Provided Localization and Active Tracking for Micro-UAVs
    Alejandro Lorite Mora, Andrés Faíña

    Micro unmanned aerial vehicles (micro-UAVs) are small enough to reach confined spaces that larger robots cannot access, but too small to carry the sensing and computing power required for autonomous flight. We move the localization stack entirely off the aerial platform onto a quadruped robot with a 7-degree-of-freedom (DOF) arm, which supplies the micro-UAV (27 g bare, 42 g with fiducial markers) its full 6-DOF pose. A camera at the arm's end-effector detects AprilTag fiducial markers on the drone and composes that observation with the quadruped's own self-localization to place the drone in a

    quadruped
  136. arxiv:2610.06213 · cs.LG
    Sampling Allocation of LinUCB: Optimal Design Limits in the Small-Gap Regime
    Yujie Liu, Vincent Y. F. Tan, Yunbei Xu

    We study the sampling allocation of LinUCB in the small-gap regime, where the reward gaps are of order at most $n^{-1/2}$ over the decision horizon $n$. This scaling captures the hard instances underlying worst-case regret lower bounds, for which LinUCB is known to be near optimal up to logarithmic factors in $n$. Using a mean-field perspective, we characterize this allocation through the empirical sampling distribution, a macroscopic object that averages the effect of adaptive decisions over the horizon, and identify its limit as $n\to\infty$. We establish that in this regime, the empirical s

    online learning
  137. arxiv:2610.06210 · cs.CV
    MoCAR: Motion-code Coordinate-aware AutoRegression for Continuous Trajectory Forecasting
    Yiming Xu, Hao Cheng, Monika Sester

    Autoregressive generation is natural for language, where predicted tokens can be directly reused as the next prediction state, but trajectory forecasting lacks such a clean token: motion is continuous, multimodal, and expressed in local coordinate frames that evolve with the predicted trajectory. We present MoCAR (Motion-code Coordinate-aware AutoRegression), a decoder-only framework that casts trajectory forecasting as next-code prediction in a coordinate-aware continuous latent space. MoCAR learns a continuous motion-code space from endpoint-normalized trajectory segments, where each code jo

    memorybenchmark
  138. arxiv:2610.06207 · cs.AI
    AI-Decision Checkpoints for AI-Augmented Business Process Management: Framework and Educational Instantiation
    Amin Jalali

    Large Language Models (LLMs), Retrieval-Augmented Generation (RAG), and AI agents are increasingly embedded in operational business processes. Yet Business Process Management (BPM) curricula and frameworks still largely treat artificial intelligence (AI) as an add-on technology, leaving graduates (as potential future process developers) unprepared to reason about AI as a first-class design element of end-to-end processes. This paper addresses that gap by proposing \emph{AI-decision checkpoints}: explicit moments in a process development trajectory where process developers identify AI-candidate

    retrieval-augmentedai agent
  139. arxiv:2610.06204 · cs.LG
    Do Small Language Models Learn to Negotiate? A Controlled Scaling Study of RL-Trained Sellers
    Pedro Tabacof, Sagar Joglekar

    LLM agents are starting to own the full customer experience. Soon, LLMs may be selling and buying on behalf of companies and customers respectively. Small models are more cost-efficient at scale, but can reinforcement learning train them into competent sellers? We train four Gemma 4 checkpoints (2.3B to 31B effective parameters) with GRPO on a programmatic utility reward for bilateral multi-issue bargaining, and evaluate every arm on the same 1,152 negotiations against two frontier buyers it never saw in training. With the same learning rate ($10^{-6}$) for every size, the gain of the RL model

    llm agent
  140. arxiv:2610.06196 · cs.CV
    EORestore-Agent: Fidelity-Guided Agentic Restoration of Remote Sensing Images with Composite Degradations
    Heli Qi, Zeqi Zhou, Jingjun Yi, Kunyi Liu +4

    Remote sensing images often carry composite degradations, in which haze, cloud, noise, blur, low light, and low resolution coexist. Restoring them requires deciding which tool to apply, in what order, and when to stop, yet no clean reference is available at inference time to verify these decisions. All-in-one models trained on single degradations converge to a narrow PSNR band as degradations accumulate. To formulate real-world remote sensing restoration as a traceable trajectory, we present EORestore-Agent, which replaces this unmeasurable objective with reference-free, verifiable per-step de

    agentagenticbenchmark
  141. arxiv:2610.06194 · physics.optics
    A robust framework for the comprehensive characterisation of parametric down-conversion sources
    Denis A. Kopylov, Michael Stefszky, Christine Silberhorn

    Reliable verification of squeezed-light sources is essential for photonic quantum technologies. High-dimensional quantum optical networks demand single-mode, pure squeezed states which, in principle, can be generated through careful engineering of parametric down-conversion-based (PDC) sources. However, due to the imperfections of optical components, the generated state is never pure and commonly contains internal mode structure. Existing characterisation techniques, based on either joint spectral intensity or normalized second-order correlation functions, work under the assumption that the pr

    benchmark
  142. arxiv:2610.06193 · cs.AI
    Correct Code, Broken Contributions? SWE-CC: Benchmarking Repository Policy Compliance for Coding Agents
    Hai Dang Truong, Rayner Goh, Thanh Le-Cong, Yintong Huo

    Autonomous coding agents now resolve a substantial share of real-world GitHub issues. However, passing functional tests differs fundamentally from producing a high-quality contribution acceptable for merging. Mature open-source projects publish repository-specific contribution policies, spanning style, git, testing workflows, to ensure code quality and long-term maintainability. Because existing benchmarks evaluate patches solely on unit tests, agent compliance with repository governance remains unknown. In this paper, we introduce SWE-CC, a benchmark evaluating code and process compliance in

    agentbenchmark
  143. arxiv:2610.06192 · cs.AI
    Copies or Sources? Measuring How LLM Aggregators Count Restated Evidence in Multi-Agent Systems
    Jianxin Gao, Runze Li, Tianyi Yu, Liangwei Ren +2

    Multi-agent systems built on large language models (LLMs) restate observations as a matter of course: relays forward them, shared boards repeat them and discussion rounds echo them. An aggregator that pools such messages should count sources, not statements. We convert a reported probability into units of independent readings, which assigns every restatement a copy weight, 0 for an aggregator that counts sources and 1 for one that counts every statement, and yields the implied decision under any cost structure. Three testbeds hold the evidence fixed and vary how it is restated: message logs wi

    agentllm agentmulti-agentagent system
  144. arxiv:2610.06191 · cs.AI
    Judged Useless, Queried Anyway: Tool-Using Agents Rarely Turn Their Own Evidence Judgments into Stopping Decisions
    Chubin Zhang, Zhenglin Wan, Xingrui Yu, Jingxuan Wu +3

    An agent whose tool keeps returning nothing useful should stop relying on it. In a retrieval environment with controlled source failures, we separate how agents judge results from what they do. We compare stopping at the same step after longer and shorter runs of results the agent judged useless; this contrast is zero for clock- or deadline-driven stopping. Where we record their judgments, the seven agents we test call a failing source's results useless 97-100% of the time, yet most of them rarely stop on that judgment. Prompt cues change when they stop but not what they stop on. Permission to

    memoryagent
  145. arxiv:2610.06190 · cs.AI
    Bridging the Evidence-to-Execution Gap:A Reflective Agent for Multi-Objective Peptide Design
    Haosen Zhang, Yang Yang

    Large language models (LLMs) can reason over scientific literature to devise design strategies, yet fail to reliably implement them for biological sequences. While protein generative models learn sequence patterns, they lack the capacity to incorporate literature evidence for multi-step reflective reasoning, forming an evidence-to-execution gap between scientific reasoning and sequence manipulation. We present EASER (Evidence-Aware Sequence Engineering with Reflection), a reflective agent bridging reasoning and sequence generation via a learned property interface of offline-trained, fixed low-

    manipulationagent
  146. arxiv:2610.06184 · cs.RO
    Arm-wise Compositional Generalization in Dual-Arm Vision-Language-Action Models
    Zaibin Zhang, Binghao Ran, Yuhan Wu, Zhongbo Zhang +9

    Generalization in multi-arm collaboration can be studied as composing familiar atomic skills in new ways across arms. However, existing evaluations offer limited insight into which training and architectural choices support this ability under different coordination requirements. We introduce \textbf{ACG-Bench}, a benchmark for \emph{Arm-wise Compositional Generalization} that provides a common testbed for studying skill recomposition in dual-arm policies. It contains 23 task--condition pairs across 8 task families, with 6 in-domain conditions and 17 unseen compositions covering reordering, syn

    vision-language-actionbenchmarkevaluation protocol
  147. arxiv:2610.06182 · cs.LG
    Two-Point Local Optimality in $k$-Means via Boundary-Point Screening
    Wenlong Lyu, Xujie Xiao, Yuheng Jia

    Lloyd's algorithm and the discrete local (D-local) optimization method (Li et al., 2025) for $k$-means provide only weak local-optimality guarantees, and their solution quality remains sensitive to initialization. In this paper, we introduce $r$-point local optimality, under which no reassignment of at most $r$ samples decreases the objective function, and focus on $r=2$. The main computational obstacle is the $\mathcal{O}(n^2(k^2+d))$ cost of exhaustive two-point certification for $n$ samples in $d$ dimensions and $k$ clusters. To address this challenge, we prove that (i) every improving two-

    benchmark
  148. arxiv:2610.06180 · cs.LG
    Anlu: Enabling In-Context Time Series Anomaly Detection in Foundation Models via Counterfactual Supervision
    Tian Lan, Yifei Gao, Yimeng Lu, Xuming An +4

    Whether a time-series pattern is anomalous often depends on the operating regime of the monitored process. A missing event can signal a fault in one regime and be routine in another, and the query alone may not reveal which regime applies. We study in-context learning (ICL) for time series anomaly detection (TSAD) through reference-conditioned detection, where a reference record provides evidence about expected behavior and model parameters remain fixed at inference. Supplying the reference is not enough: when training anomalies are recognizable from the query alone, the detector can fit its t

    memory
  149. arxiv:2610.06171 · cs.RO
    Controllable and Photorealistic Pedestrian Risky Motion Generation for End-to-End Driving Safety Evaluation
    Siyuan Liu, Miao Li, Haibao Yu, Haohong Lin +3

    Evaluating end-to-end autonomous driving under rare, safety-critical vehicle-pedestrian interactions requires photorealistic, sensor-level scenarios. However, trajectory-based scenario generators cannot synthesize raw visual observations, whereas video-based approaches lack controllability. To bridge this gap, we present ControlPed, a novel framework that combines trajectory-level conflict synthesis with 3D Gaussian Splatting (3DGS) to generate photorealistic, motion-controllable safety-critical scenarios. Built upon HazardPed, a dataset derived from 10,352 traffic videos comprising 422 confli

    benchmark
  150. arxiv:2610.06170 · cs.AI
    MS-Exam-Gen: Source-Grounded Benchmark Construction for Evaluating LLMs on Textual Multiple Sclerosis MRI Knowledge
    Abdul Basit, Muhammad Abdullah Hanif, Muhammad Shafique

    Biomedical large language model (LLM) evaluation requires auditable assessment of narrow, evolving, source-grounded subspecialty knowledge. Multiple sclerosis MRI (MS-MRI) provides a high-stakes textual-knowledge test case because correct reasoning requires current diagnostic criteria, standardized acquisition and reporting knowledge, longitudinal monitoring concepts, lesion morphology, and recognition of difficult mimics. We present MS-Exam-Gen, a reproducible framework for constructing and auditing a text-based multiple-choice question (MCQ) benchmark for MS-MRI knowledge; it does not evalua

    benchmark
  151. arxiv:2610.06163 · cs.AI
    Where Did the Repair First Go Wrong? Localizing the Origins of Silent Failures in Agentic Vulnerability Repair
    Wenji Bai, Muhammad Waseem, Zeeshan Rasheed, Jaakko Peltonen +1

    Localizing where an LLM-based agent first fails to uphold security during a repair can show which stage of its workflow needs an additional safeguard. This is difficult for silent failures, which are patches that pass syntactic and functional checks but still contain a security vulnerability. Because such patches give no observable failure signal, existing failure attribution methods, which rely on observed task failures and labelled failure steps, are less suited to them. We propose Security Awareness Gap Evaluation (SAGE), a trace-based method that combines an assessment of the security reas

    agentagenticagent framework
  152. arxiv:2610.06156 · cs.LG
    TIGER: Time-Series Classification with In-Context-Learning Gated Ensemble of Representations
    Johann Faouzi

    A representation family is a distinct way of extracting features from time series. Ensemble algorithms that combine several representation families remain the most accurate approach to time series classification. Current state-of-the-art ensembles, most notably HIVE-COTE~2.0, pair a bespoke classification algorithm with each representation family and combine their predictions using a fixed, non-adaptive rule. We present TIGER (Time-series classification with In-context-learning Gated Ensemble of Representations), which instead applies the same small portfolio of three general-purpose classifie

    benchmark
  153. arxiv:2610.06153 · cs.RO
    Talk, Render, Act: Integrating Social Gesture and Digital Face with Synchronized Speech for Conversational Humanoid Robot
    Jin Jiang, Kun Li, Jiancong Ma, Shengcai Liao

    Expressive humanoid interaction requires speech, facial animation, and body gestures to form a coherent response. However, many full-body humanoid robots produce speech and gestures without a visually expressive face, while talking-face animation and robot gesture generation are typically developed separately. We present Talk, Render, Act (TRABot), an agent-based framework comprising specialized agents for motion-atom construction, dialogue generation, motion planning, and facial animation. First, to produce natural and semantically meaningful gestures, we construct Robot-Ready Semantic Motion

    humanoid
  154. arxiv:2610.06148 · cs.LG
    Reinforcement Learning-Based Optimization of Workload-Aware Power Delivery Networks
    Oran Hayes, Maria Pantazi-Kypraiou, Athanasios Tziouvaras, George Stamoulis +3

    Power Delivery Networks (PDNs) are critical components of modern VLSI chips, providing stable voltage levels while satisfying electromigration (EM) and IR-drop constraints. Conventional PDN design methodologies typically rely on worst-case assumptions, often resulting in over-provisioned networks and inefficient use of resources. This paper presents a reinforcement learning-based framework for the optimization of workload-aware PDNs. The proposed methodology first generates workload-aware PDNs using architectural power traces obtained from system-level simulations. These power traces are mappe

    agentbenchmark
  155. arxiv:2610.06147 · cs.CV
    Efficient Test-time Adaptation through Candidate Verification and Divergence Shifts
    Seungmin Oh, Seunghun Kang, Jongbin Ryu

    Vision-language models (VLMs) achieve strong zero-shot transferability but remain vulnerable to target-domain shifts at inference time. Test-time adaptation (TTA) offers a practical remedy, yet most existing VLM-TTA methods follow a prediction-side adaptation paradigm. They use test samples to adjust logits, prototypes, caches, priors, or feature statistics, often incurring additional computational overhead. In this paper, we take a different perspective and reframe VLM-TTA as candidate verification rather than prediction adjustment. We propose Test-Time Correction (TTC), a hypothesis-based co

    memorybenchmark
  156. arxiv:2610.06138 · cs.LG
    Co-Optimizing Graph Sparsification and Approximate Computing for Energy-Efficient FPGA-Based GCN Inference
    Nathaniel Kaye Mellor, Shreejith Shanker, George Floros

    Graph Convolutional Networks (GCNs) have emerged as a powerful framework for learning from graph-structured data, yet their deployment on resource-constrained edge platforms remains challenging due to the computational and memory demands of sparse graph aggregation. This work presents an FPGA-based GCN accelerator that combines DSpar graph sparsification, 8-bit quantization, and approximate multipliers on the AMD Kria KV260. Evaluated on Cora, LastFM Asia, and Amazon Photo, the design explores the interaction between sparsification and approximation across graphs with widely varying densities.

    memory
  157. arxiv:2610.06137 · cs.RO
    Robotizing Human Videos with Physically Consistent Interactions
    Ching-Lam Cheng, Shengfeng He, Bin Zhu

    Human videos offer scalable manipulation data, but the embodiment gap between human hands and robot manipulators limits their direct use. Existing video-editing methods replace hands with rendered robots, yet inaccurate interaction reconstruction and compositing can produce inconsistent grasps and implausible robot-object occlusions. We address these failures from two complementary physical aspects: interaction geometry and scene visibility. First, an interaction-aware contact reconstruction module combines hand-object segmentation with mesh-level contact prediction to recover dense 3D contact

    manipulationdiffusion policymanipulatorrobotwingrippergrasp
  158. arxiv:2610.06129 · cs.RO
    I-BFM: Reward-Conditioned Robust Humanoid Interaction via Unsupervised Reinforcement Learning
    Ziqi Han, Yitang Li, Junhan Sun, Fanrong Dong +7

    Behavioral foundation models (BFMs) have recently shown that a single humanoid policy can support diverse whole-body control, but extending such generality to physical interaction remains challenging. We introduce I-BFM, to our knowledge the first BFM for humanoid-object interaction. Rather than relying on task-specific policies or reference tracking, I-BFM learns a shared representation of the coupled dynamics among the humanoid, objects, and their contacts using forward-backward representations and unsupervised reinforcement learning. Given a downstream task reward, the same policy can be di

    manipulationhumanoidwhole-body control
  159. arxiv:2610.06122 · cs.AI
    Benchmarking Jailbreak Guardrails for Embodied Agents
    Xunguang Wang, Qingyue Wang, Yuguang Zhou, Zongjie Li +2

    Embodied agents powered by large language models and vision-language models are increasingly deployed in physical environments, but jailbreak attacks can induce these agents to perform physically harmful actions. A growing number of guardrail methods have been proposed to intercept dangerous behavior before it is executed, yet existing safety benchmarks evaluate the embodied models themselves, leaving it unclear how well these guardrails actually defend an embodied agent in practice. We present the first systematic evaluation of jailbreak guardrails for embodied agents. To compare guardrails u

    embodiedagentembodied agentbenchmarkevaluation framework
  160. arxiv:2610.06121 · cs.RO
    Radar2Plan: Benchmarking 4D Radar for End-to-End Open-Loop Ego-Trajectory Planning
    Ling Yao, Yichun Xiao, Jin Jin, Yihan Zhang +1

    Adverse weather and poor illumination remain major challenges for robust ego-trajectory planning in mobile autonomy. 4D radar offers reliable sensing under adverse conditions and direct radial-velocity measurements. However, sensing robustness does not necessarily translate into robust downstream planning, while existing 4D radar benchmarks focus primarily on perception rather than trajectory planning. We present Radar2Plan, a modular benchmark for open-loop ego-trajectory planning using real-world 4D radar data. Radar2Plan connects sensor encoders, scene representations, and planning heads th

    benchmark
  161. arxiv:2610.06104 · cs.RO
    Conditional Trajectory Peaks: Single-Pass Multimodal Policies over Action Chunks
    Di Wu, Rongtian Shen, Ping Liu, Xuhua Chen +3

    Multimodal imitation learning requires diverse executable futures under the same observation and consistent behavior across replanning cycles. We present Conditional Trajectory Peaks (CTP), a single-pass policy framework that jointly predicts complete action-chunk candidates, probability masses, and trajectory scales. Distribution-Aware Peak Specialization (DAPS) specializes trajectory peaks using trajectory-level posterior responsibilities and mass- and scale-modulated overlap constraints. Evidence-Gated Trajectory Belief Transport (ETBT) maintains cross-chunk consistency through geometric co

    libero
  162. arxiv:2610.06103 · cs.RO
    Propagating Elevation-Map Uncertainty Through the Contact Maximum in Closed Form
    Aleš Kučera, Karel Zimmermann

    Risk-aware planners score paths on uncertain elevation maps using the path cost's mean and standard deviation. Modeling rigid contact, however, requires computing a maximum over several uncertain cells. First-order propagation loses accuracy here by differentiating at only a single cell, while Monte Carlo sampling requires a full path evaluation per draw. We compute the moments of that contact maximum in closed form using Clark's pairwise recursion. By tracking each contact's covariance against the shared map cells, we propagate the smooth remainder using exact Gaussian quadratic-form identiti

    benchmark
  163. arxiv:2610.06102 · cs.CV
    Benchmarking CLIP for Zero-Shot Face and Periocular Gender Estimation
    Fernando Alonso-Fernandez, Kevin Hernandez-Diaz, Jose Maria Buades, Josef Bigun

    We investigate CLIP for zero-shot gender estimation from full-face and periocular images. Three CLIP backbones are evaluated on 11,299 frontal images from Adience using image-text similarity with male/female prompts, achieving 95.54% full-face accuracy without task-specific training. For periocular, zero-shot predictions are strongly biased towards males, primarily due to a misaligned decision boundary. Threshold alignment substantially reduces this bias, reaching 85.29% accuracy. Linear SVMs trained on CLIP features provide only marginal gains, with a best periocular accuracy of 86.17%, appro

    benchmark
  164. arxiv:2610.06100 · cs.CL
    From Traces to Agentic Worlds: Agentic Language World Models for Interactive Environment Simulation
    Quanyu Long, Xiao Chen, Jianda Chen, Haozhen Zhang +3

    Realistic environment replicas are increasingly valuable for training and evaluating LLM agents, yet the original systems may be inaccessible or impractical to reproduce. We explore agentic language world modeling: rather than rebuilding an executable environment, a world model agent serves as the environment for a task agent and supports faithful and stateful simulation. We instantiate this paradigm with Trace2Env, a learning-free framework for settings where the original system is unavailable but historical interaction traces remain accessible. Trace2Env reconstructs these traces into a reus

    world modelagentllm agentagentic
  165. arxiv:2610.06095 · cs.LG
    Lossy Compression of PDE Training Inputs: Field Reconstruction Error Does Not Order the Cost to a Trained Operator
    Huy Hoang Le

    Operator-learning benchmarks are stored at full precision and have grown to terabyte scale. Rate-distortion theory says how many bits the stored field needs, while a practitioner needs to know how accurate an operator trained on the compressed data will be. We show that the first does not determine the second, and measure why, compressing the input fields while targets and test inputs stay at full precision. A solution operator attenuates a perturbation of its input. Pushing a compressed field through a surrogate already trained at full precision measures how much of the perturbation that surr

    benchmark
  166. arxiv:2610.06090 · cs.RO
    Execution-Aligned Progressive Noise for Consistent Asynchronous Replanning in Generative Robot Policies
    Di Wu, Ping Liu, Xuhua Chen, He Zheng +2

    Continuous asynchronous replanning is essential for real-time generative robot policies, but independent stochastic initialization can cause mode switching and inconsistent continuation across action chunks. We propose Execution-Aligned Progressive Noise (EAPN), which introduces structured stochasticity at both inter-chunk and intra-chunk levels. Across replanning steps, EAPN propagates a shared noise trajectory and aligns it with the actual execution displacement, establishing execution-aligned inter-chunk correlation. Within each action chunk, it models temporal correlation along action time

    manipulationlibero
  167. arxiv:2610.06083 · cs.LG
    Boosting Transferable Adversarial Attacks against Deep Reinforcement Learning
    Zexin Li, Ruili Yao, Yiming Zeng, Xiaoxue Gao

    Most adversarial attacks on deep reinforcement learning (DRL) assume white-box access to the victim policy, which rarely holds in practice. This paper studies transfer-based black-box attacks on DRL: the attacker crafts observation perturbations on a white-box surrogate agent and feeds them to an unknown victim. We formulate the attack as return minimization under a per-step perturbation budget. We first show that transplanting transferable image-classification attacks (FGSM, MI-FGSM, and NI-FGSM) with a per-step objective yields perturbations that transfer but are no stronger than random nois

    agent
  168. arxiv:2610.06078 · cs.RO
    Do VLAs Understand and Adapt to the Objects They Handle, or Simply Replay Learned Behaviors?
    Xinnuo Xu

    This paper asks whether VLA generalization is grounded in a global understanding of objects' physical properties that enables policies to adapt their motion to unseen setups, or if policies simply replay the motions they've learnt that happen to succeed in new setups. The former reflects genuine generalization; the latter reflects incidental robustness. We first examine awareness of physical properties in seven VLAs by applying linear probing and representational similarity analysis (RSA) to their activations. We find that physical properties, including mass, fragility, deformability, friction

    vlalibero
  169. arxiv:2610.06069 · cs.LG
    Attention Tax, Handoff Tax: A Stylised Model of When Multi-Agent LLM Systems Help
    Akshit Anchan, Nayonika Sen

    Recent work on multi-agent LLM systems reaches sharply different conclusions: some results show that a single agent with the same information and compute should dominate a delegated system, others that multi-agent gains grow with task depth. We argue that much of the disagreement comes from modelling different bottlenecks, and introduce a stylised reliability model built around two trade-offs. Decomposition reduces the burden of long contexts but incurs a handoff tax when information is compressed or transferred between agents. Redundancy gains from multiple samples, but its benefit depends on

    long contextagentmulti-agent
  170. arxiv:2610.06064 · cs.CL
    TrustMI: Causally controlling how assistants trust their users
    Théo Lasnier, Romain Froger, Maxence Lasbordes, Djamé Seddah

    Large Language Model (LLM) assistants routinely decide whether they can trust users and third parties whose competence, intentions, and integrity they cannot verify. This uncertainty matters for safety, as trusting the wrong party can lead an agent to comply with harmful requests or act on malicious instructions encountered during tool use. To study this problem, we define trust as an assistant's willingness to accept vulnerability to the actions of another party and ask whether such behavior can be causally controlled through model activations. We build 2,000 contrastive conversations spannin

    agenttool use
  171. arxiv:2610.06063 · cs.LG
    Vision Transformer Ensembles for Panoramic Street Segmentation
    Yunus Serhat Bıçakçı

    Semantic segmentation of street panoramas can support detailed descriptions of urban environments, yet small datasets and unequal training costs make model selection difficult. This paper presents the system used for a first place submission to the PalmCity challenge in the leaderboard snapshot dated 5 October 2026. Nine pretrained segmentation systems are compared using approximately equal computation budgets. The candidates include DeepLabV3+, SegFormer, UPerNet, Mask2Former, DINOv3 with a linear decoder, and an Encoder only Mask Transformer using DINOv3. The two leading candidates are train

    memoryleaderboard
  172. arxiv:2610.06057 · cs.AI
    A Comprehensive Objective Evaluation of Modern Text-to-Speech for Turkish Using Speech Quality Assessment Models
    Yunus Emre Ozkose, Alperen Kahraman, Ali Haznedaroglu

    Modern text-to-speech (TTS) systems can clone a target speaker from a short reference clip or be fine-tuned on a target voice, yet their behaviour on morphologically rich, lower-resource languages such as Turkish remain under-characterised. We present a systematic benchmark of four contemporary systems (Chatterbox, CosyVoice, OmniVoice, and VoxCPM2) evaluated across fine-tuned and zero-shot configurations, contrasted with a conventional VITS baseline and anchored to natural gold speech. Each configuration is scored with eighteen complementary objective metrics spanning learned naturalness pred

    benchmark
  173. arxiv:2610.06056 · cs.CV
    ROT: Rotating Hidden States towards Contextual Vectors for Hallucination Mitigation in LVLMs
    Yijing Du, Xiangcheng Zhan, Shuo Yang

    Large Vision-Language Models (LVLMs) frequently suffer from object hallucination. Existing training-free interventions primarily manipulate attention weights, which indirectly affect the deep semantics reaching the final predictive layers. In this work, we shift our focus to the hidden state vectors extracted after self-attention and residual addition. Empirical analysis reveals that hallucinated tokens do not simply over-rely on linguistic priors; instead, they exhibit an anomalous contextual deviation, showing significantly lower similarities to both textual and visual contexts in intermedia

    benchmark
  174. arxiv:2610.06044 · cs.AI
    RocketAgent: A Long-Horizon Engineering Agent for Multidisciplinary Design of Liquid-Rocket Thrust Chambers
    Junxiang He, Runze Mao, Kun He, Teng Zhang +3

    Liquid-rocket thrust-chamber design involves interdependent analyses in which downstream constraints can require earlier design decisions to be revisited. Managing these dependencies across heterogeneous tools requires consistent design information and coordinated updates throughout the workflow. We present RocketAgent, a long-horizon engineering agent for multidisciplinary preliminary design of liquid-rocket thrust chambers. A single plan-owning Coding Agent coordinates engineering skills for performance sizing, subsystem optimization, geometry generation, and multiphysics assessment. A prove

    knowledge graphagent
  175. arxiv:2610.06039 · cs.LG
    MercerFlow: Flow Matching in a Kernel-Induced Latent Space for Probabilistic Forecasting
    Ilya Kuleshov, Egor Serov, Alexey Zaytsev

    Recent work has shown that probabilistic flow matching for time series forecasting benefits from a data-matched prior. The resulting prior introduces local correlations, which a sequential architecture usually absorbs: a recurrent neural network (RNN), a structured state-space model (S4), or a Transformer. However, such a backbone costs GPU memory and time per epoch. A cheaper alternative is MLP-based latent-space flow matching: embed the time series via an invertible map to a single latent vector and learn the flow there, so a tabular MLP can treat the series as a set of features. The relatio

    memorybenchmark
  176. arxiv:2610.06031 · cs.AI
    LightMTP: Lightweight Latent Multi-Token Prediction
    Tamara Czinczoll, Julie Kallini, Gerard de Melo, Chen Shani

    Next-token prediction (NTP) is the standard pretraining objective for large language models, yet it provides an explicit training signal only for the immediate next token, which can lead models to exploit local patterns instead of capturing longer-range structure and ideas. Multi-token prediction (MTP) addresses this by training models to predict several future tokens. However, existing MTP methods often introduce a large number of new parameters with limited improvements in downstream performance. Latent MTP approaches address this efficiency issue by encoding future tokens into a vector repr

    benchmark
  177. arxiv:2610.06025 · cs.AI
    Grounded Joint-Attention Other-Play for Zero-Shot Coordination
    Giulia Benintendi, Constantin Ruhdorfer, Fabian Kögel, Andreas Bulling

    Joint attention - the human ability to share a common visual or cognitive focus with others - enables a meeting of minds that lets us coordinate even with unfamiliar partners. In this work we investigate whether equipping AI agents with a similar mechanism can enable such zero-shot coordination. We introduce Mutual Attention for zero-shot TEaming (MATE): a novel multi-agent reinforcement learning method inspired by human joint attention. MATE encourages agents to coordinate their actions by aligning their visual attention on scene-salient objects during the interaction rather than relying on a

    ai agentmulti-agentbenchmark
  178. arxiv:2610.06021 · cs.CV
    Scalable Minimal-Change Learning for Controllable Image Editing
    Shuo Chen, Fengming Huang, Yu Yao, Mingming Gong +1

    Image editing should change only the attributes specified by an instruction while preserving everything else, yet current methods often make unintended changes. We treat this minimal-change principle as an optimization objective for instruction-based editing. Latent L1 regularization is a poor proxy for output locality in modern nonlinear generators and often requires supervision unavailable at scale. We instead optimize edit outcomes with reinforcement learning. An agentic vision-language reward model audits each source image, instruction, and edited image for two failure types: unimplemented

    agentic
  179. arxiv:2610.06019 · cs.LG
    Adaptive Expert Guidance for Efficient On-Policy Reinforcement Learning
    Daniele Affinita, Ming Xu, Rudolf Reiter, Davide Scaramuzza +1

    With massively parallel simulation, on-policy Reinforcement Learning methods such as PPO have become standard in many domains. However, learning from scratch is sample-inefficient and fails to exploit the potential existence of a suboptimal expert, such as a heuristic, a model-based controller, or a policy trained on a related task. Such an expert is often available and can guide early training, but its sub-optimality limits final performance. The challenge then becomes balancing expert guidance against learning from rewards. Existing methods set the expert's influence through a blending weigh

    benchmark
  180. arxiv:2610.06018 · cs.CV
    Investigating Query-Insensitive Behavior in Spatio-Temporal Video Grounding
    Eryk Kołodziejczyk, Alberto Presta, Karol Szurkowski, Michal Byra

    Spatio-temporal video grounding (STVG) aims to localize objects or events described by natural language queries in both space and time. Existing STVG models are typically trained and evaluated under the assumption that each query is relevant to the input video. In this work, we challenge this assumption by studying the behavior of state-of-the-art STVG models under irrelevant queries and missing textual input. Our experiments show that current models can still produce plausible spatio-temporal predictions even when the query is unrelated to the video or removed entirely. We further analyze HCS

    evaluation protocol
  181. arxiv:2610.06017 · cs.AI
    Parallelism or Concession? Concurrency-Aware Procurement Negotiation for Agentic Commerce
    Xiaolin Xu, Donghao Zhu

    Agentic buyers can cheaply fork a procurement task into many parallel negotiations, but concurrency is not free: every thread consumes resources, and simultaneous agreements create cancellation and commitment risk. We study a one-unit post-order sourcing problem with a single hard-deadline negotiation window, in which a planner jointly chooses the number of seller-facing negotiators and a common procurement price cap. The model combines a product-specific acceptance curve with fulfillment loss, per-thread cost, and excess-commitment cost. We establish three structural results. First, holding t

    agentic
  182. arxiv:2610.06012 · cs.LG
    Spectral Geometry of Attention: From Information Routing to Uncertainty
    Giulio Viganò, Simone Melzi, Maks Ovsjanikov

    In this work, we study transformer attention through the lens of spectral geometry and operator theory. We view each attention head as a functional map between Hilbert spaces of functions on the token sequence and derive a Token Difference Operator, whose spectral structure controls how token-space information is routed to the output. We show that standard Euclidean spectra are structurally biased by sinks, conflating mass concentration with genuine routing capacity. By recasting token space in the intrinsic probability geometry induced by attention, the token difference spectrum disentangles

    long-context
  183. arxiv:2610.06011 · cs.CL
    D-Loop: Looped Diffusion Drafting for Speculative Decoding
    Kecheng Chen, Yuyang He, Cheng Gong, Hui Liu +7

    Block diffusion accelerates speculative decoding by drafting multiple tokens in one forward pass. However, each position predicts a marginal distribution without observing earlier proposed tokens, limiting draft quality and acceptance length. We identify a concrete failure, the \emph{repetition trap}, in which neighboring positions produce redundant copies of the same token. We explain this tendency theoretically and empirically examine its association with shorter accepted drafts. Recent methods refine marginal predictions with an additional causal head or a separately trained drafter, increa

    benchmark
  184. arxiv:2610.06008 · cs.LG
    Ultrasound Operator Guidance Using World Modeling and Retrieval Based Action Planning
    Noortje I. P. Schueler, Hans van Gorp, Ruud J. G. van Sloun

    Ultrasound is widely used, but acquisition quality is heavily dependent on the operator's knowledge and expertise. With demand for examinations outpacing the supply of trained sonographers, operator-guidance systems aim to close this gap by instructing a less trained user how to move the probe toward a target view. In this paper, we propose a retrieval-induced latent transition model for ultrasound acquisition dynamics, formulating ultrasound operator guidance as multi-step planning and retrieval in a world model. Using a V-JEPA 2.1 backbone, observations are first encoded into a latent space

    world modelv-jepa
  185. arxiv:2610.06001 · cs.AI
    AgentSpy: Making AI Agent Behavior Observable
    Christoph Bühler, Matteo Biagiola, Luca Di Grazia, Guido Salvaneschi

    AI agents built on large language models (LLMs) run shell commands, read and write files, and reach the network, typically with their user's privileges. However, what an agent does during an execution is difficult to understand: tests assert on the result, and the agent's trajectory records only what the agent reports about itself, which may omit behavior executed by its subprocesses. We present AgentSpy, an approach that observes an agent from outside the agent. AgentSpy runs the agent in an isolated environment, configured by a declarative specification, and records the system calls and netw

    agentai agent
  186. arxiv:2610.05997 · cs.RO
    Infant simulator with an embodied caregiver: Generating infant-perspective touch and vision during social interaction
    Noemi Vaculinova, Matej Hoffmann

    Early development unfolds in caregiver-infant dyads, where infants' sensorimotor streams are shaped by physical contact and face-to-face interaction. Yet developmental robotics simulators commonly model infants in isolation, limiting the study of caregiver-mediated experience. We present a caregiver-enabled extension of the Multi-Modal Infant Model (MIMo) in MuJoCo that turns MIMo into a controllable platform for replaying dyadic interaction and generating dense infant-perspective observations. The system provides (i) an articulated caregiver model compatible with MIMo morphologies, parameteri

    embodiedtactile
  187. arxiv:2610.05996 · cs.RO
    EpicWorldModel: Exploration-driven Planning with Latent World Models
    Bowen Feng, Julian Ost, May Mei, Anirudha Majumdar +1

    Latent world models based on Joint-Embedding Predictive Architecture (JEPA) are deterministic by design. While successful in fully observable scenarios, this paradigm breaks down when past observations and actions lead to multiple plausible future possibilities, e.g., due to occlusion. We introduce EpicWorldModel, a framework to train stochastic JEPAs for environments and tasks with inherent uncertainty under partially observability. We jointly train the EpicWorldModel predictor with its latent representation space to directly predict multiple potential future states using a flow-matching obje

    world model
  188. arxiv:2610.05994 · cs.RO
    How (and How Not) to Use Data Augmentation in VLA Post-Training
    Bram Grooten, Joaquin Vanschoren

    Vision-language-action (VLA) models currently demonstrate strong performance in a wide range of real-world robotics tasks. However, they often still lack the generalization ability to handle large visual out-of-distribution shifts. Post-training of VLAs with reinforcement learning (RL) has been shown to benefit robustness, but significant room for improvement remains. In this work, we systematically study the effect of image augmentation on VLA post-training. We find that it is crucial to augment only the critic module during RL updates, while leaving the actor's input clean during both rollou

    vision-language-actionvlagr00tliberopost-training
  189. arxiv:2610.05993 · cs.CV
    From Transformation to Target State: Rethinking Query Representation for Zero-Shot Composed Image Retrieval
    Yihe Zhao, Songhe Feng

    Composed image retrieval (CIR) aims to retrieve a desired target image from a query consisting of a reference image and a modification text. This task exhibits an unusual representational asymmetry: the modification text specifies a transition from the reference state, whereas retrieval candidates depict completed target states. This creates a representation mismatch for zero-shot methods that query pretrained vision-language spaces directly with transformation-oriented language. We study this mismatch and reformulate zero-shot composed image retrieval as target-state reconstruction followed b

    benchmark
  190. arxiv:2610.05987 · cs.CV
    Label-Free Coreset Selection with Foundation Models for Efficient Annotation in Computational Pathology
    Tuo Yin, Jennifer Dhont

    Computational pathology has the potential to improve clinical outcomes through a demonstrated increase in diagnostic and prognostic accuracy. However, the development and validation of deep learning algorithms still require annotated data, a costly procedure involving expert pathologists who already face critical workforce shortages. Existing coreset selection methods to optimize annotation efforts currently all rely on hyperparameters tuned on natural-image benchmarks that do not transfer to histopathology and are cumbersome to use in clinical practice. In this study, we present GCcore, a nov

    benchmark
  191. arxiv:2610.05982 · cs.CL
    Breaking the Tie: A Cluster-Aware Routing Framework for Large Language Models
    Yao Lu, Zhaiyuan Ji, Yaxin Gao, Zeyu Wang +5

    With the rapid development of artificial intelligence, the emergence of various Large Language Models (LLMs) has created a rich model ecosystem. However, this also brings a key challenge: how to select the optimal model for a specific user query. LLM routing addresses this need by dynamically assigning queries to the most suitable expert in the pool of candidate models. However, existing routing frameworks often simplify this process to a standard classification task; thus, a critical vulnerability is exposed when multiple candidate models correctly answer the same query. We formalize this cap

    benchmark
  192. arxiv:2610.05976 · cs.CL
    Can Language Models Learn to Reject Their Own Bad Reasoning Steps?
    Siheng Xiong, Xiaoze Liu, Yiqiao Jin, Xiaoqian Wang +1

    Verifier-guided decoding can prevent harmful reasoning steps from contaminating subsequent generation, but typically relies on an external learned verifier. We ask whether a language model can instead reject its own bad reasoning steps. We define a prefix's recoverability as the probability that the frozen generator can complete it correctly. Diagnostics show that adjacent recoverability changes are often difficult to resolve with practical Monte Carlo budgets, while same-prefix candidates exhibit a sparse low-recoverability tail. We introduce Self-Step Rejection (SSR), which trains a lightwei

    benchmark
  193. arxiv:2610.05971 · cs.RO
    A State Based Dispatch Controller for Hospital Delivery Robots with Shared Human and Infrastructure Resources
    Krzysztof Siwek, Aleksandra Świetlicka

    Robot delivery studies can overstate transport capacity when travel to pickups and human support fall outside the modeled schedule. We formulate a location aware dispatch model that couples robot admission to transporter support and shared elevators, charging, and cleaning. The model replays 33,079 observed hospital requests; missing contents, deadlines, staffing, and completion times remain explicit scenario assumptions. Two full grids compare human dispatch, a resource aware controller, and a proximity and workload benchmark in 30 paired replications per scenario. An exploratory extension te

    benchmark
  194. arxiv:2610.05969 · cs.RO
    Reachability-Aware Diffusion Policy Optimization
    Hikmet Simsir, Kutay Demiray, Ozgur S. Oguz

    Diffusion policies provide expressive action distributions for continuous-control reinforcement learning. However, safety-aware online diffusion policy optimization remains underexplored, particularly methods that use predictive reachability information without an explicit dynamics model. We propose Reachability-Aware Diffusion Policy Optimization (RADPO), a model-free method that combines predictive first-hit safety estimation with cumulative-cost budget feedback. RADPO learns a discounted first-hit reachability value that captures the discounted risk of a cost event, assigns larger weight to

    diffusion policy
  195. arxiv:2610.05964 · cs.RO
    From Social Reasoning to Embodied Interaction: An Agentic Framework for Social Robots
    Ziyu Cheng, Yuewen Guo, Zhirui Liu, Dong Zhang +4

    Natural face-to-face human--robot interaction requires a robot to understand an evolving social situation, decide when to engage, and express its intent through coordinated physical behavior. Yet existing approaches rarely close this loop: foundation-model agents provide increasingly capable multimodal reasoning and memory but remain largely disembodied, while expressive virtual agents do not face the physical constraints of real robots, and physical social robots typically address social reasoning and embodied expression only partially. We present ARISE, a unified framework that bridges Agent

    embodiedhumanoidmemoryagentic
  196. arxiv:2610.05961 · cs.LG
    Strategic Multi-Agent Learning for Interpretable Action Valuation of All Players in Football
    Kenjiro Ide, Taiga Someya, Kohei Kawaguchi, Keisuke Fujii

    Valuing player actions in football requires accounting for strategic interactions among 22 players, including off-ball movements and defensive positioning. Existing reinforcement-learning-based methods commonly aggregate decisions at the team level or estimate player values independently, leaving strategic interdependence among players insufficiently represented. This study proposes an action valuation framework inspired by Markov perfect equilibrium (MPE) for all players. Each possession is modeled as a finite-horizon dynamic game, with each player represented as an autonomous agent whose pol

    agentautonomous agentmulti-agent
  197. arxiv:2610.05954 · cs.LG
    MEND: RL For Flow Models via Proximal Velocity Matching
    Shreshth Saini, Neil Birkbeck, Yilin Wang, Balu Adsumilli +1

    Reward post-training of flow models either reweights the model's own samples under a KL penalty or a frozen reference, often for thousands of updates, or backpropagates the reward and moves every sample without checking that the move is worth its size. We introduce MEND, a reinforcement learning method built on proximal velocity matching. MEND caps rewards within each prompt group, so samples that already score well receive no move. Below the cap, it proposes moves along the reward gradient and accepts one only when its capped reward gain exceeds a quadratic displacement price. The model then

    post-trainingevaluator
  198. arxiv:2610.05949 · cs.LG
    Technical Report on the Turba Fertilizer Machine Learning Stack in Morocco
    Abdelghani Belgaid, Zakaria Mahmoud, Fahd Chibani, Oumnia Ennaji +2

    Site-specific fertilizer recommendation systems adapt nutrient advice to location, soil properties, crop type, and production targets, but scientific reuse is constrained when recommendation functions remain accessible mainly through interactive interfaces, outputs are not versioned, and trained approximations cannot be independently loaded or benchmarked. This technical report presents the Turba fertilizer machine learning stack, a three-layer open-source implementation for reproducible site-specific fertilizer recommendation in Morocco. \texttt{turba-client} provides programmatic access to p

    benchmark
  199. arxiv:2610.05943 · cs.AI
    Runaway Reaction: When Benign Skills Compose into Malicious Behavior
    Zunlong Zhou, Ziyuan Yang, Mengyu Sun, Yi Zhang

    Agent skills package task-specific knowledge and procedures that can be composed to support complex agent tasks, while public marketplaces provide a growing pool of reusable skills. Existing security vetting, however, largely evaluates skills in isolation, leaving composition-induced risks underexplored. Such risks arise because composing benign skills expands the agent's capability space, enabling behaviors unavailable to any skill alone. Interestingly, we find that directly composing benign skills can already induce malicious behaviors, even when every individual skill passes security vettin

    agentbenchmark
  200. arxiv:2610.05942 · cs.AI
    Process Constitutions and Process Stewards: Towards the Next Generation of BPM for Agentic Organizations
    Amin Jalali, Majid Rafiei

    Business Process Management (BPM) was built on a foundational assumption that organizations are populated primarily by human actors whose work can be made visible, governable, and improvable through process models. That assumption is depreciating. AI agent ecosystems increasingly execute, coordinate, and adapt organizational work with limited human direction, challenging not only BPM's methods but its core conception of what a process is. We argue that BPM faces a constitutive shift from modeling human work to governing autonomous agents, for which we propose two new concepts: the \emph{Proces

    agentai agentautonomous agentagentic
  201. arxiv:2610.05940 · cs.CV
    ReMem: Streaming Video Understanding With Long Context Retention
    Li Yiheng, He Xu, Wang Shaobo, Shao Ling +1

    Despite their impressive performance on a wide range of video understanding tasks, current Vision Language Models (VLMs) are predominantly designed for offline scenarios and struggle to handle online streaming videos that demand low latency response. Several studies have explored memory and token compression strategies in an attempt to adapt offline VLMs for streaming video understanding tasks. However, through our probing experiment, we identify that most existing works tend to progressively lose long context information as length of input stream increases. To address this, we propose ReMem,

    memorylong contextbenchmark
  202. arxiv:2610.05935 · cs.LG
    ThunderSyncRL: Lossless Acceleration of Agentic Reinforcement Learning
    Seil Kang, Hangoo Kang, Tarun Suresh, Youngeun Kim +3

    Language models are moving beyond generating answers to pursuing long-horizon goals in interactive environments. Post-training these agents requires long, heterogeneous trajectories, and synchronous systems leave learner engines idle until rollout and verification finish. To squeeze out these pipeline bubbles, asynchronous training overlaps rollout and learning across updates, but comes at the cost of policy staleness. We introduce ThunderSyncRL, which starts gradient computation as soon as all required inputs are fixed, without policy staleness. For group relative policy optimization (GRPO),

    agenticpost-training
  203. arxiv:2610.05932 · cs.CV
    UltraDub: Towards Authentic Dubbing by Unifying Visually-Steered Flow Learning and Trajectory Guidance
    Gaoxiang Cong, Liang Li, Jianwei Wen, Zhedong Zhang +2

    Visual voice cloning requires intelligible, speaker-consistent speech synchronized with visible articulation. However, sequential multimodal conditioning can disrupt previously established temporal and speaker cues, while imbalanced inference guidance can improve linguistic accuracy at the expense of lip synchronization. In this paper, we propose UltraDub, a Unifying Visually-Steered Flow learning and trajectory Guidance Dubbing framework that leverages vision in two ways: as continuous motion for multimodal context aggregation, and as structural rhythm for trajectory rectification. Specifical

    benchmark
  204. arxiv:2610.05923 · cs.AI
    VERA: Scaling Verifiable Environments for Agentic co-Evolution
    Junqi Liu, Yongyang Pan, Zhuosong Jiang, Dongbai Li +13

    Competent agents need precise and verifiable environments, such as sandboxes that are resumable at any stage and evolve from observable evidence. However, most long-horizon work exposes how rare these are: for example, an agent in medical research must ground a finding, classify it, and write a report over dozens of dependent steps, yet recent environments score only the outcome. To address the challenges in stable training, we present VERA, which builds such environments at scale and lets agents evolve on them. VERA builds these environments from initial trajectories: an agent writes rubrics,

    agentagentic
  205. arxiv:2610.05913 · cs.LG
    CoHyFuse: Condition-wise Hypergraph Fusion with Global Connectome in Task-fMRI
    Boseong Kim, Haejun Chung, Ikbeom Jang

    Task-fMRI connectomes reveal state-dependent neural reconfigurations, yet conventional methods marginalize these signals by aggregating distinct conditions into static pairwise graphs, thereby obscuring condition-specific multi-ROI organization. We introduce CoHyFuse, a condition-aware ROI-centered hypergraph framework that constructs a task-state-specific incidence matrix from condition-wise functional connectivity (FC)-profile embeddings, allowing the same ROI to form different multi-ROI hyperedges across task phases. Condition-specific neighborhood sizes $K_q$ further adapt the hyperedge sc

    benchmark
  206. arxiv:2610.05912 · cs.AI
    MiniCorp: The Last Mile of the AI Agent Firm
    Jingying Zeng, Zhenwei Dai, Jinning Li, Changho Shin +5

    The last mile toward enterprise AGI is a company that runs itself. Training and adapting such agents require longitudinal enterprise data, which remain scarce, costly to acquire, and often restricted by privacy constraints. Historical archives are also frequently incomplete and record only what actually happened. They cannot show the outcomes of alternative decisions. We introduce MiniCorp, an office simulator for studying how agents can collectively run a company while generating enterprise data at scale. Using an e-commerce company as a demonstration, MiniCorp connects two interacting worlds

    world modelagentai agent
  207. arxiv:2610.05911 · cs.CV
    Every View Counts: View-Consistent Panoptic Quality for Multi-view Panoptic Segmentation
    Youngmin Lee, Byungha Ko, Guhnoo Yun, Dong Hwan Kim

    Multi-view panoptic segmentation assigns a semantic class and a scene-level instance ID to every pixel of an unordered set of images, and recent feed-forward 3D models predict these labels for the input views in a single forward pass. Their predictions, however, have been evaluated with the scene-level PQ (PQ^scene) borrowed from per-scene optimization methods, typically on rendered held-out views. PQ^scene tiles all views of a scene into a single image, so that a missed appearance or a change of ID lowers the score of the matched pair only in proportion to its area. We propose View-Consistent

    evaluation protocol
  208. arxiv:2610.05902 · cs.LG
    On Hyperparameter Tuning on the Test Set
    Matteo Fregonara, Tom Viering, Jan van Gemert

    "Don't tune hyperparameters on the test set" is often stated in machine learning textbooks. Violating it is considered a cardinal sin that produces misleadingly optimistic results, corrupts benchmark integrity, and thus can even be interpreted as scientific fraud. Yet evidence suggests that test set hyperparameter tuning does occur in practice, making it all the more important to understand its actual consequences. So how bad is it, really? In this work we question this dogma and put it to an empirical test. We systematically study the magnitude of the performance inflation caused by tuning th

    benchmark
  209. arxiv:2610.05885 · cs.LG
    The Optimization Landscape of Learning Compacted Context Models
    Thomas Villeneuve, Alex Sandomirsky, Charles O'Neill, Max Kirkby +1

    Many works approach continual learning through the lens of infinite context windows. As an agent puts more observation into context (concretely the KV cache), compacting said context is akin to direct memory manipulation, without affecting the base model's weights. Many works pose KV compaction as an optimization problem: learn a smaller set of KV vectors that matches the behavior of the full KV cache. While this preserves base model behavior, optimizing through a frozen base model results in a highly nontrivial optimization problem with a brittle and flat loss landscape. In this paper, we cha

    manipulationmemoryagent
  210. arxiv:2610.05882 · cs.RO
    Mulligan: Performance-Guided Data Collection for Efficient On-Robot Learning
    Lars Ankile, Perry Dong, Rohan Bhowmik, Aneesh Muppidi +3

    Learning from human demonstrations is a reliable way to teach robots new tasks, but the gains from each additional demonstration shrink as the policy improves. Continued improvement can instead come from supervised deployment, where an operator places the objects and intervenes when the policy fails. We ask how to maximize improvement from a fixed budget of supervised episodes on high-precision manipulation tasks with wide ranges of object placements. We observe that failures can concentrate in a small subset of initial states, so uniform collection spends much of the operator's time on states

    manipulation
  211. arxiv:2610.05878 · cs.RO
    OGAM: Connecting Systematic Testing to Runtime Assurance through Object-Grounded Attention Monitoring for VLA Policies
    Haki Darwish, Xiangyu Yin, Changwen Li, Rongjie Yan +2

    Benchmarks expose vision-language-action (VLA) policies to few canonical instructions, while exhaustive deployment testing is impossible. We introduce Object-Grounded Attention Monitoring (OGAM), connecting systematic testing to runtime assurance: testing reveals attention divergence between successful and failed executions, and OGAM uses this signal to stop failures beyond the finite suite. We generate scene-grounded instructions through pairwise combinations of action templates and objects, and separately test meaning-preserving paraphrases. All 87 out-of-benchmark cases reveal problematic b

    vision-language-actionvlaopenvlabenchmark
  212. arxiv:2610.05874 · cs.LG
    Global Communication or Graph-Specific Memory?
    Hamed Shirzad, Danica J. Sutherland

    Scalable Graph Transformers are commonly trained and evaluated on static large graphs in a transductive setup. Many scalable Graph Transformer components can be formulated as a constant-size shared memory, similar to virtual nodes, providing compressed information about the whole graph. The counterpart of these models in language models and other domains is justified as the input changes, and this mechanism learns to compress some useful information about the input. In transductive learning on a single fixed graph, however, any shared memory can be seen as a constant at test time. This raises

    memory
  213. arxiv:2610.05872 · cs.LG
    Off-Policy Merging Beats On-Policy Self-Distillation for Continual Learning
    Chen Henry Wu, Thomas Zhang, Aditi Raghunathan

    A long-standing goal of AI is a model that can continually learn and improve itself. On post-trained models, supervised finetuning (SFT) on new data often causes poor generalization and catastrophic forgetting. As such, the conventional wisdom is that on-policy training is a prerequisite for continual learning. In practice, however, data containing new knowledge or capabilities are often off-policy. While methods such as on-policy self-distillation (OPSD) try to bridge this gap by converting off-policy data into on-policy signal, they have been shown to cause reasoning collapse. In this paper,

    self-improvement
  214. arxiv:2610.05869 · cs.LG
    Finite-Sample Distribution Theory and Efficient Large-Scale Inference for Online Quantile Regression
    Ziyang Wei, Jiaqi Li, Lan Wang, Wei Biao Wu

    This paper studies online quantile regression for large-scale and streaming data using Stochastic SubGradient Descent (SSGD) with constant learning rates. Classical offline inference for quantile regression is computationally and memory intensive. Existing works of online inference for quantile regression provide only asymptotic guarantees and typically require sub-exponential tail conditions for distribution theory. To bridge these gaps, we introduce new techniques to prove a quenched central limit theorem (CLT) and finite-sample Gaussian approximation for SSGD under a finite-moment assumptio

    memory
  215. arxiv:2610.05863 · cs.LG
    CCQ: A Multi-State Child Care Quality Dataset to Support AI for Children's Health Research
    Victor Li, Yuzhang Xie, Ziwei Dong, Qingyang Zhu +5

    High-quality child care in early life is a critical determinant of children's growth and development. Research on child care quality has been constrained by fragmented, non-research-friendly, and privacy-bound datasets. We present CCQ (Child Care Quality), a large-scale, de-identified dataset for applied data science research at the intersection of AI and early childhood health. CCQ integrates 59,372 child care provider records across 12 U.S. states, covering diverse provider types as well as data schemas. To ensure research utility while protecting privacy, we implement an automated, LLM-base

    benchmark
  216. arxiv:2610.05861 · cs.CV
    Imagine to Act: High-Fidelity Data Synthesis via Image Editing World Model for Scalable GUI Agent Training
    Yongxin Ning, Runliang Niu, Qianli Xing, Zhiyi Duan +3

    Graphical User Interface (GUI) agents have emerged as a promising paradigm for automating complex digital workflows across diverse applications. However, training highly capable and generalizable agents fundamentally relies on massive, high-fidelity visual-action trajectories, which are notoriously difficult to acquire. While human demonstrations are unscalable, existing GUI world models rely on text descriptions or HTML rendering, discarding crucial pixel-level visual details like icons and layout styles. To address this issue, we introduce Infinite-Dreamer, a simulation-free data synthesis m

    world modelagentbenchmark
  217. arxiv:2610.05860 · cs.AI
    Curriculum Brain: Constructing Curriculum Knowledge Graphs as a Substrate for Cognitive Diagnosis
    Shrideep Tamboli, Chiranjeevi Maddala, Eshal Minhaj

    Cognitive Diagnostic Models (CDMs) identify which specific skills a student has and has not mastered, the signal a personalized learning path needs and a single aggregate score cannot give. Yet they are rarely deployed. The obstacle is their precondition: the Q-matrix, a mapping from every assessment item to the skills it requires, historically authored by hand. We separate the task into two stages: first construct the curriculum's own knowledge graph, the full space of concepts and skills it contains, independent of any item; then map items against that graph on demand. This paper addresses t

    knowledge graphagentic
  218. arxiv:2610.05853 · cs.LG
    The Blind Spot Paradox: When Adaptive Classifiers Defeat Drift Detectors
    Raphaël Minato, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan

    Monitoring concept drift from an adaptive classifier's error stream creates an operational conflict with the model's own update loop. When internal adaptation outpaces evidence accumulation, accuracy recovers before cumulative detectors (CUSUM, Page-Hinkley) can reach threshold. Instrumenting an Adaptive Random Forest (ARF) shows that surviving trees absorb 98.6% of the post-drift error transient through incremental leaf updates alone. The first background tree swap accounts for just 0.71% of this erased error volume, but drops external detection rates by 31 percentage points. We derive the fi

    benchmark
  219. arxiv:2610.05852 · cs.LG
    RepICL: Reusable In-Context Prediction Across Heterogeneous Representation Spaces
    Yu-Hsiang Liu, Kuan-Yu Chen, Chih-Sheng Chen, Meng-Hsuan Chang +2

    Frozen representations are widely reused for downstream classification, yet each new task typically requires fitting a new predictor. We ask whether the few-shot prediction procedure itself can instead be learned once and reused across datasets and representation spaces. To study this question, we introduce RepShiftBench, comprising 1,218 encoder--dataset tasks across text, image, and audio, with separate evaluation of generalization to unseen datasets, unseen encoders, jointly unseen datasets and encoders, and unseen modalities. The benchmark exposes a substantial gap: Logistic Regression fit

    benchmark
  220. arxiv:2610.05843 · cs.LG
    AnchorPose for Geometry-Aware MOF Assembly through Meso-Grained Pose Generation
    Zhonglong Peng, Rui Jiao, Chang Chen, Geng Zhong +2

    Predicting metal-organic framework (MOF) structures from given building blocks requires recovering their positions and orientations in a periodic crystal. The spatial effects of rotation errors are geometry-dependent and anisotropic. The same angular error can produce different atomic displacements depending on block size, shape, and rotation axis. Angular error alone, without reference to the specific block geometry, therefore cannot fully describe the spatial consequences of a pose error. We introduce AnchorPose, a meso-grained pose generation framework that incorporates this geometric depen

    benchmark
  221. arxiv:2610.05842 · cs.CL
    HLA: Expressive Hybrid Linear Attention via Chunk-Wise Dynamic Mixing
    Zhuokun Chen, Xi Lin, Xiyu Wu, Jiahao He +2

    Linear attention enables efficient long-context autoregressive decoding by compressing history into recurrent states, but this compression can make selective access to sparse and distant information difficult. Existing chunk-based extensions increase memory capacity, yet learned chunk-mixing coefficients may remain fixed with respect to input content and therefore cannot adapt historical access to each query. We introduce \emph{Hybrid Linear Attention} (HLA), a query-dependent chunk-level attention mechanism for Gated DeltaNet (GDN). HLA represents each completed chunk as an exact affine state

    memorylong-context
  222. arxiv:2610.05835 · cs.LG
    Adaptive-Shot Hybrid Quantum Anomaly Detection for Tactile Internet Security: Reliability-Aware Measurement Allocation Under Resource Constraints
    Mubassir Serneabat Sudipto, Shakil Ahmed, Ashfaq Khokhar, Samir M. Iqbal

    Tactile Internet (TI) security analytics must balance reliable thresholded decisions with constrained computational and measurement resources. We study this tension for finite-shot hybrid quantum anomaly inference and introduce the Adaptive-Shot Variational Quantum Circuit (AS-VQC) policy. This validation-calibrated policy begins each record at 128 shots and cumulatively escalates through 256, 512, and 1024 shots only when the finite-shot anomaly score remains close to a validation-selected security threshold. The quantum scorer is evaluated as an off-path security analytics component rather t

    tactilebenchmark
  223. arxiv:2610.05831 · cs.LG
    Selecting Long-Horizon Trajectories for Reliable and Efficient Terminal-Agent Training
    Cuong Dang, Hoang Anh Just, Ruoxi Jia

    Terminal agents are commonly trained by imitating long teacher trajectories, yet how much of each trajectory to supervise remains unexplored. We study the \emph{supervision horizon}, the number of trajectory tokens retained for training, and show that it is a key design axis for reliability and cost. Reliability improves with longer horizons but saturates: on Terminal-Bench, a 12K-token horizon solves more tasks than 16K ($29\pm0.7$ vs.\ $26\pm0.8$) while requiring 30\% less training time. The horizon also shapes agent behavior: short horizons cause premature termination, intermediate horizons

    agentbenchmark
  224. arxiv:2610.05830 · cs.AI
    Measurement-First Auditing of Agentic Leaderboards: Contamination Susceptibility, Matched-Control Re-evaluation, and Scorer Validation
    Dishu Yang, Qi Su, Hongbo Qin, Hansong Zhang

    Agentic leaderboards increasingly evaluate systems on public benchmarks whose task statements and solution-bearing artifacts can remain accessible. We propose a measurement-first audit framework that distinguishes contamination claims according to the evidence required to support them. It separates three channels that require different evidence: training-time exposure, evaluation-time retrieval, and pipeline/scaffold leakage. Each channel is coded as open, partial, closed, or unknown under a fail-closed rule. Across nine Holistic Agent Leaderboard (HAL) configurations, none of the 27 channel a

    agentagenticbenchmarkleaderboard
  225. arxiv:2610.05823 · cs.AI
    Who Keeps the Gains from Personal AI Assistants? Seller Adaptation and the Unassisted in a Language-Model Market Simulation
    Haonan Huang, Joey Xiao

    Personal AI assistants are beginning to transact for consumers, and early adopters capture real savings. Whether those savings survive, and what happens to consumers who have no assistant, depends on how sellers respond -- a question single-user evidence cannot answer. We build an agent-based rental market in which language models play consumers, assistants, and six adaptive sellers guided by an algorithmic pricing tool. Half the population receives an assistant under an advisory or an executing mandate; the contract pairs a fee only the renter's physical action avoids with a pre-selected add-

    benchmark
  226. arxiv:2610.05819 · cs.RO
    Transporting Unsecured Stacked Payloads with a Quadrupedal Robot via Multi-Objective Reinforcement Learning
    Nobuo Namura, Masayuki Hiromoto, Kento Uemura, Hironobu Sasaki +1

    Transporting unsecured payloads with legged robots over uneven terrain requires balancing locomotion performance and payload stability, since aggressive motion can destabilize the payload even when the robot remains stable. We study quadrupedal transportation of unsecured stacked boxes on an edgeless torso-mounted board without dedicated payload sensors or active carrier mechanisms. To address this trade-off, we propose Payload-Adaptive Multi-Objective Reinforcement learning for Transportation (PAMORT). PAMORT trains a multi-objective base policy conditioned on a preference vector that weights

    quadruped
  227. arxiv:2610.05818 · cs.RO
    What the Guard Misses, the Robot Executes: Implied Harm in VLA Instructions
    Sripad Karne, Arjun Balaji

    Vision-language-action models (VLAs) act on instructions without being able to refuse, so screening harmful requests falls to monitors. We test whether these monitors catch ordinary robot tasks requested for harmful reasons, holding the task fixed while varying only how explicitly the intent is stated. $π_{0.5}$ completes the task at every level of explicitness, as often as for harmless controls. Text guards flag nearly every blunt request but few implied ones: up to 95% of implied-harm runs end with the task done and no flag raised, and up to 90% even after recalibrating on robot instructions

    vision-language-actionvla
  228. arxiv:2610.05817 · cs.AI
    Nash Equilibrium Text: A Game-Theoretic Decoding Framework for Text Generation
    Alireza Jafari, Arman Adibi, Mohammad Ghavamzadeh, Hadi Daneshmand

    Text revision has become an integral component of large language models. This paper formulates revision such that it admits a Nash equilibrium: Token positions are players, vocabulary items are actions, and each player's utility is the language model's log conditional probability. We motivate the revision by showing that Nash equilibria can have exponentially higher likelihood than autoregressive outputs as the sequence length grows. We further propose Nash decoding, an algorithm that reaches an $\varepsilon$-Nash equilibrium in $O(1/\varepsilon)$ time given access to the joint probability of

    benchmark
  229. arxiv:2610.05816 · cs.CV
    Level-of-Token Diffusion
    Kiyohiro Nakayama, Brian Chao, Jan Ackermann, Hansheng Chen +4

    Image and video diffusion models allocate equal computation to every region, even when the intended scene calls for varying levels of detail. The spatial distribution of detail can often be anticipated before generation, indicating where computation can be reduced. We introduce Level-of-Token (LoT) Diffusion, a framework that turns this knowledge into an explicit multiresolution token layout (Level-of-Token layout) for adaptive and efficient generation. Tokens represent rectangular patches of varying sizes and shapes, allocating finer tokens where detail is needed and coarser tokens elsewhere.

    agentic
  230. arxiv:2610.05815 · cs.CL
    Plan Canvas: Fixed Reasoning Regions for Continuous Language Flows
    Miaohe Niu, Pengxiang Li, Jingbo Zhu, Tong Xiao

    Continuous language flows generate text by denoising all positions of a target canvas together. The natural way to add reasoning to such a model is to write a trace ahead of the answer, but the trace length changes from question to question. The answer start is therefore unknown during denoising, and the model has to decide the trace length, the place of every trace token, and the answer at the same time. We propose Plan Canvas to fix the boundary between the trace and the answer. A plan region of fixed capacity holds a compact trace, supervised padding fills its unused positions, and the answ

    benchmark
  231. arxiv:2610.05807 · cs.LG
    Protocol-Sensitive Evaluation of Log Anomaly Detection: Component Costs and Target-Access Sensitivity on HDFS and BGL
    Hang Xiao, Janet Sung, Zhaoyi Li, Gangzhen Qian +1

    Protocol choices can change the conclusions drawn from log anomaly detection benchmarks even when detector settings are fixed. We present a joint empirical study of split construction, representation visibility, and component costs using six fixed count, sequence, and semantic configurations on Hadoop Distributed File System (HDFS) and Blue Gene/L (BGL) logs. Random splits place several configurations near the average-precision ceiling, whereas group-disjoint HDFS and chronological BGL evaluation produce lower scores and different observed orderings. At a fixed BGL cutoff, parser choice spans

    benchmark
  232. arxiv:2610.05800 · cs.CL
    Adaptive Utilization of Low-Rank Adaptation via Conditioned Gating
    Guang Yang, Changhao Guan, Chao Huang, Yufeng Chen +1

    Low-Rank Adaptation (LoRA) achieves parameter-efficient fine-tuning by constraining model updates to a low-rank subspace and has been widely used in practice. However, LoRA typically employs a shared low-rank update across tokens, which limits its ability to fully exploit the adaptation subspace for tokens from different sequences. To address this issue, we propose an adaptive utilization of Low-Rank Adaptation (U-LoRA), which employs conditioned gating to explicitly learn effective token-level utilization of the limited low-rank adaptation subspace. Specifically, U-LoRA generates utilization

    benchmark
  233. arxiv:2610.05796 · cs.RO
    Dynamics-Aware Adaptive Corridors with Feasibility-Perturbed Trust-Region SQP for Certified Nonholonomic Motion Planning
    Yang Shi

    Optimisation-based parking planners usually impose collision constraints only at the time samples, so a vehicle corner can cut an obstacle between samples, and no executable trajectory exists until the solver converges. We present a planner for car-like vehicles with reverse gear in which every iterate of the optimisation phase satisfies the discretised dynamics exactly and keeps the whole vehicle rectangle clear of obstacles between the samples. Each time interval receives one convex corridor that holds all vehicle corners at both ends and is shrunk by a sweep margin bounding how far the corn

    benchmark
  234. arxiv:2610.05793 · cs.AI
    Topology-Conditioned Backdoors: Language Models That Insert Vulnerabilities When They Infer They Are in a Multi-Agent System
    Keegan Wang, Anantika Mannby

    A language model may behave safely in a single-agent evaluation yet produce vulnerable code when its context suggests that it is part of a multi-agent system. We study this failure mode by fine-tuning Qwen2.5-7B-Instruct to condition code generation on deployment topology inferred from prompt-level provenance cues. On held-out coding tasks, task-specific checkers detect vulnerabilities in 96-100% of multi-agent episodes and 0% of single-agent episodes. An independent bandit analyzer detects vulnerabilities in approximately 67% of multi-agent episodes, covering six of nine vulnerability familie

    multi-agentagent system
  235. arxiv:2610.05792 · cs.RO
    DASH: A da Vinci Adapter for Serial-link and Humanoid Robots as an Accessible Platform for Surgical Robotics Research
    Sara Wickenhiser, Junrong Zhou, Zekai Liang, Lizzie Peiros +1

    Robotic minimally invasive surgery offers well-documented clinical benefits, but the cost and infrastructure requirements of purpose-built platforms limit access in rural and lower-resourced facilities. Recent work has teleoperated general-purpose robots for laparoscopic tasks and in vivo procedures, but relied on handheld instruments coupled through passive linkages rather than native robotic actuation. Instead, we adapt da Vinci Classic and Xi instruments onto general-purpose robots that can integrate in clinical workflows. We present DASH, a da Vinci Adapter for Serial-link and Humanoid pla

    humanoid
  236. arxiv:2610.05790 · cs.CV
    FairRSFM: A Biome-Aware Benchmark and Debiasing Framework for Remote Sensing Foundation Models
    Md Aminur Hossain, Omkumar Vaghasiya, Rajeev Ranjan Dwivedi, Vinod Kurmi +1

    Remote sensing foundation models (RSFMs) are commonly evaluated using aggregate metrics, which can hide systematic performance disparities across ecological regions. We introduce FairRSFM, a biome-aware benchmark for evaluating ecological group robustness in RSFMs. FairRSFM maps georeferenced samples from 14 terrestrial biome classes into six ecologically meaningful macro-groups and evaluates models under a unified frozen-backbone evaluation protocol. The benchmark covers four downstream datasets: m-EuroSAT, m-BigEarthNet, m-SA-Crop-Type, and MMEarth20K with Dynamic World label maps. Using Pri

    benchmarkevaluation protocol
  237. arxiv:2610.05785 · eess.SY
    Separation Principle for Event-Triggered Prescribed-Time Consensus Tracking of Nonlinear Multi-Agent Systems under DoS Attacks
    Hongjian Chen, Hefu Ye, Changyun Wen

    Despite the recent development of control theory for multi-agent systems (MASs), the highly desirable separation principle is difficult to establish even for linear MASs, let alone for nonlinear ones that rely solely on output measurements under denial-of-service (DoS) attacks. This paper establishes a separation principle for distributed leader-following control of this class of nonlinear MASs, allowing the observer and the controller to be designed independently. For each agent, two parametric Lyapunov equations (PLEs) are employed to generate two symmetric positive-definite matrices, which

    agentmulti-agentagent system
  238. arxiv:2610.05783 · cs.AI
    CLARA: Can AI Assess Developmental Appropriateness in Children's Stories?
    Sijing Yin, Zirui Wang, Qian Liu, Jiamou Liu

    Assessing the developmental suitability of children's narratives is important for educational recommendation and developmental literacy research, yet such assessment typically relies on subjective and difficult-to-scale human judgment. This raises an important question: Can AI systems approximate human developmental judgments of children's stories? To study this problem, we introduce CLARA, a cognitively grounded framework for developmental narrative understanding through structured annotation across cognitive (COG), language (LAN), and social-emotional (SEL) dimensions, together with a biling

    benchmark
  239. arxiv:2610.05782 · cs.LG
    Agentic-ZTA: A Multi-Agent Architecture for Autonomous Zero Trust Enforcement
    Shovan Roy, Lopamudra Praharaj, Maanak Gupta, Bhavani Thuraisingham

    Agentic AI is emerging as a promising paradigm for automating complex cybersecurity decisions, yet its use in enforcing zero trust introduces significant challenges in safety, reliability, and policy compliance. This paper presents Agentic AI based zero trust architecture (Agentic-ZTA) that operationalizes the NIST SP 800-207 ZTA architecture control loop through coordinated multi- agent decision pipeline. In the proposed framework, policy knowledge is embedded into a retrieval-augmented generation pipeline and retrieved at inference time as top-k relevant policies. Access requests are interce

    retrieval-augmentedagentai agentmulti-agentagentic
  240. arxiv:2610.05780 · cs.LG
    Isotropic Gaussian Processes Improve Vanilla Bayesian Optimization in High Dimensions
    Wei-Ting Tang, Madhav Muthyala, Joel A. Paulson

    High-dimensional Bayesian optimization (BO) often fits Gaussian process (GP) surrogates from far fewer observations than input dimensions. Modern Vanilla BO can perform well in this regime with dimension-aware priors, initialization, and acquisition optimization, but it typically retains automatic relevance determination (ARD), fitting one lengthscale per input coordinate. We study this modeling choice and propose Iso-BO, a controlled modification that replaces the ARD GP with an isotropic GP using one shared lengthscale while keeping the surrounding BO pipeline matched. For radial kernels, we

    benchmark
  241. arxiv:2610.05778 · cs.CL
    MedicalHarness: A Controlled Evaluation of LLMs and Agent Harnesses on Medical Tasks
    Ziqing Wang, Lili Zhao, Kaize Ding

    LLM agents are increasingly built for medical work and scored on clinical benchmarks. Each such score, however, comes from a model running inside an agent harness, the system that controls the loop between the model and its environment. An agent's score is therefore a property of a model--harness pair. For medical agents, how much outcomes change with the harness has rarely been measured. Measuring this change, and explaining it, raises two challenges. First, a harness comparison must change nothing but the harness and be repeated across models and kinds of task. Second, comparing whole harnes

    agentllm agentbenchmark
  242. arxiv:2610.05777 · cs.AI
    Mining Agent Skills from Production Traces
    Yue Ran Kang, Colton Mikolajczyk, Chhaya Methani, Hazel Mak +3

    Agent skills that record procedural instructions are increasingly mined from execution traces rather than curated by hand. Skill-mining pipelines often use known task outcomes or feedback to guide skill construction. In production, reliable information on whether a run has succeeded may be unavailable. We study how the sampling of execution traces, access to success or failure information, and the form of the mined skills affect downstream task performance. Holding the mining pipeline fixed, we compare six combinations of mining evidence and skill forms. Mining evidence has three levels: succe

    agentbenchmark
  243. arxiv:2610.05775 · cs.CV
    InteractionBench: A Real-Time Interaction Benchmark for Streaming Video Systems
    Enxin Song, Suhao Yu, Yifei Xu, Barbara Su +6

    A video assistant must speak when its instruction warrants a response and stay silent otherwise. We introduce a benchmark that evaluates this decision for the complete system of model, memory, and response controller. InteractionBench covers query responses, event triggers, and ongoing updates in 1,060 interactions over 812 videos, with 69 negative streams and 53 suites that pair counted events with look-alike near misses. It scores content accuracy, timing accuracy, and silence compliance on the video clock. Timely speech costs silence across systems. Polled Qwen3-VL-8B reaches 77.8 timing ac

    agenticbenchmark
  244. arxiv:2610.05774 · cs.LG
    AdaSpark: Adaptive DSpark with Online Learning for Tree Verification and N-gram Fill
    Liquan Liu, Yifan Zhang, Bowei Xu

    Block drafters such as DSpark propose ranked candidates for several positions in one forward pass, and a tree verifier checks them in one pass of the target. The number of rows to verify trades the tokens a wider tree is expected to accept against the time a wider verify takes. Most schedulers that choose this number take the verify time from a table or model measured before serving, corrected online by at most one scale factor, and take acceptance from the drafter's confidence estimates or from a map fitted offline. AdaSpark learns both quantities while it serves, with no profile, calibration

    online learning
  245. arxiv:2610.05771 · cs.RO
    Controllable Road Marking Generation
    Zhiyu, Cai, Yufan Zhang, Ruichen Tan +2

    Lane and road markings provide critical guidance for vehicle navigation and multi-agent coordination, yet authoring them at scale remains a manual workflow that limits quantitative analysis and scenario testing. We introduce Controllable Road Marking Generation, which synthesizes a missing center-region marking layout from a drivable-area mask, optional outer-ring markings, and a textual description. Our benchmark uses deterministic, metadata-derived prompts and three output channels: lane dividers, road dividers, and pedestrian crossings. We develop a conditional bird's-eye-view (BEV) pipelin

    multi-agentbenchmark
  246. arxiv:2610.05768 · cs.LG
    Relational Synthesis: Structure-Mediated Concatenative Synthesis for Foley and Retrieval-Augmented Audio Generation
    Keren Shao, Ayaka Kawano, Shlomo Dubnov

    We ask: given a retrieved source audio $S$ and a separate reference audio $R$, can we synthesize novel audio $Y$ out of this pair $(S,R)$ such that $Y$ remains acoustically consistent with $S$, while not persistently copying segments of $S$ or $R$? The first clause is a well-known goal in Foley audio production, and the second is a well-known issue in neural RAG when $S$ and $R$ are naively injected into neural generators. We show that both clauses can be addressed simultaneously using a method we coin relational synthesis, a variation of concatenative synthesis where target cost is replaced b

    retrieval-augmentedrag
  247. arxiv:2610.05765 · cs.RO
    Bilinear Flow Policy: Distributional Extrapolation for Goal-Conditioned Visuomotor Imitation
    Wonsuhk Jung, Sundhar Vinodh Sangeetha, Chen Xu, Abhishek Gupta +3

    Goal-conditioned imitation learning (GCIL) with flow matching is a promising framework that can represent multimodal behaviors while adapting to diverse, user-specified goals, yet often fails when goals lie outside the demonstration support. To extrapolate to such unseen goals without collapsing multimodality - a problem we call distributional extrapolation - we introduce Bilinear Flow Policy (BFP), a generative visuomotor policy that combines transductive retrieval with a bilinear conditional flow. Given an unseen observation-goal pair, BFP retrieves an "anchor" training example and transduct

    manipulation
  248. arxiv:2610.05757 · cs.RO
    Human-in-the-Loop Neuro-Symbolic Drift Anticipation for Reliable Visual SLAM
    Junhyun Nam, Wonse Jo

    This paper introduces Hybrid DeepSEE (HDS), a Human-in-the-Loop (HITL) neuro-symbolic framework for proactive drift anticipation in Visual SLAM (V-SLAM). While data-driven models offer predictive power, their "black-box" nature often yields physically inconsistent outputs in out-of-distribution (OOD) environments. To address this, HDS integrates neural drift risk estimation with symbolic constraint reasoning. By utilizing a Large Language Model (LLM) as a reasoning bridge, the framework translates qualitative human context into interpretable symbolic constraints. Building upon this architectur

    human-in-the-loop
  249. arxiv:2610.05755 · cs.RO
    Demonstration-Calibrated Port-Hamiltonian Retuning for Manipulation Policies
    Yulong Yang, Fan Wu, Christine Allen-Blanchette, Amit Chakraborty

    Diffusion and VLA policies for manipulation are often deployed through downstream impedance controllers. The stiffness and damping gains of these controllers affect task success, yet are commonly inherited from data collection rather than selected for the deployed policy. Although empirical gain sweeps can improve performance, they require repeated evaluation rollouts. We introduce PHRetune, an offline method that derives controller gains for a frozen policy without evaluation rollouts or gain search. Our approach learns a port-Hamiltonian model from demonstrations to estimate the effort and e

    vlamanipulationdiffusion policyopenvlamanipulatorlibero
  250. arxiv:2610.05750 · cs.AI
    Beyond Semantic Similarity: Performance and Costs of Agentic Retrieval for Complex Tasks
    Reza Esfandiarpoor, Radek Osmulski, Yauhen Babakhin, Gabriel de Souza P. Moreira +7

    Modern information systems, including many agentic workflows, use dense retrieval to explore large amounts of unstructured data. However, dense retrieval relies on surface-level semantic similarity, which is insufficient for increasingly complex search applications. Here, we investigate agentic retrieval that combines the reasoning capabilities of Large Language Models (LLMs) with the efficient corpus exploration of retrievers in a ReAct agentic loop to solve complex retrieval tasks. In our experiments, we show that agentic retrieval is more effective than standard retrieval, improving nDCG@10

    agenticleaderboard
  251. arxiv:2610.05747 · cs.RO
    The Unexpired Plan: A Free Monitor for Accelerated Diffusion Policies
    Yi Zhao, Sebastian Scherer

    Training-free acceleration of a diffusion policy is accepted when an internal similarity signal reports that the shortcut changed nothing. We price every monitor a control loop can afford in closed-loop success rather than feature distance, over $114$ accelerator configurations and four policy families: two accelerators each clear their own gate's bar and log every reuse as certified, while on one task one finishes every episode and the other none. A monitor is two designs, not one --- the statistic it reads, and what it does when that statistic fires. Published gates re-arm after every reject

    diffusion policy
  252. arxiv:2610.05745 · cs.RO
    Beyond In-Distribution Preservation: Recovering Generalization in Quantized VLAs via Vulnerability-Oriented Tuning
    Shen Ruan, Wenchang Gao, Jin Wang, Siao Liu +3

    Post-training quantization has been shown to preserve VLA performance under standard evaluation conditions, but whether it preserves the full-precision model's robustness and generalization remains underexplored. In this study, we systematically study the robustness and generalization of post-quantized VLA policies under environmental disturbances. Empirical results show that quantized policies can become fragile to subtle environmental variations despite retaining comparable in-distribution performance. We further observe that action discrepancies are concentrated in a small subset of rollout

    vlaliberopost-training
  253. arxiv:2610.05739 · cs.CV
    HLA-WM: Hybrid Linear Attention for Long-Horizon Video World Models
    Zhuokun Chen, Feng Chen, Xi Lin, Xiyu Wu +3

    Long-horizon video world models require persistent memory to preserve scene consistency over extended rollouts. Softmax attention retains the full generation history through a growing KV cache, whereas recurrent linear attention compresses history into fixed-size states with substantially lower memory cost. However, we identify severe long-range forgetting in Gated DeltaNet (GDN), where information from distant but relevant scenes is progressively attenuated by subsequent state updates. To address this limitation, we propose HLA-WM, a training-free hybrid linear-attention framework that combin

    world modelmemorypersistent memory
  254. arxiv:2610.05734 · cs.RO
    FreeSpeed: Training-Free Speed Control for Generative Robot Policies
    Yuxuan Hu, Shilin Shan, Qiheng Wang, Jinghan Yang +3

    Online control of execution speed is essential for deploying robot policies in real-world scenarios, as robots may need to speed up under time constraints or slow down to facilitate human interaction and improve safety. However, imitation-learned policies inherit the execution speed of their demonstrations, and test-time speed modification can introduce unrecoverable out-of-distribution observations, reducing task success. We observe that the directional inconsistency of action chunks reflects task-phase criticality, indicating how aggressively action step lengths can be modified while preserv

    manipulation
  255. arxiv:2610.05732 · cs.LG
    PACMI: Provenance-Aware Cascading Memory Invalidation for Long-Term LLM Agents
    Yiqi Wang, Jiaqi Liu, Jiaqi Zhang, Zhangkai Wu +3

    LLM agents rely on long-term memory to retain and reuse information when performing tasks over long horizons. Existing methods provide limited support for handling memories that become outdated as new observations or domain evidence arrive. Such outdated memories may remain semantically relevant, continue to affect dependent records, and retain value as historical evidence. This calls for two capabilities: dependency tracking to identify downstream effects and historical preservation to retain useful past records. We propose Provenance-Aware Cascading Memory Invalidation (PACMI), a framework t

    memoryllm agentbenchmark
  256. arxiv:2610.05731 · cs.CV
    T-JEPA: A Temporal Joint-Embedding Predictive Architecture for Learning Better Remote Sensing Representations
    Bowen Peng, Li Liu, Yongxiang Liu, Weijie Li +2

    Earth observation (EO) data provide rich temporal supervision, yet existing remote sensing foundation models mainly exploit sequential observations through imposing predefined pairwise relations or aggregating holistic reconstruction context. We seek to further exploit the sparse and nonuniform temporal sampling inherent in EO sequences as supervisory signals. To this end, we propose T-JEPA, a temporal joint-embedding predictive architecture that learns time-gap-conditioned latent transitions. A shared single-frame encoder processes each observation, while a temporal predictor estimates the co

    latent dynamics
  257. arxiv:2610.05726 · cs.AI
    FreSia: Frequency-Semantic Instantiation and Alignment for Multivariate Time Series Analysis
    Yubo Wang, Hui He, Hezhe Qiao, Guoqing Ji +1

    Large Language Models (LLMs) have shown strong potential in multivariate time series forecasting and anomaly detection. Existing studies predominantly inject temporal information into LLMs via direct numerical tokenization or heuristic textual descriptions. However, LLMs still face difficulty in perceiving the underlying structural patterns of numerical time series, particularly the seasonal and trend components obscured by discrete numerical tokens. To bridge this gap, we propose FreSia, a frequency-aware framework that establishes an effective alignment between the semantic space of LLMs and

    benchmark
  258. arxiv:2610.05719 · cs.RO
    When to Switch: Reliable Action-Chunk Extension for Vision-Language-Action Models
    Seonghoon Yu, Dongwon Kim, HyungRok Jung, Yoonjae Baek +3

    Vision-Language-Action (VLA) models serve as unified policies for robotic manipulation, yet their expensive inference forces robots to pause between policy calls, resulting in stop-and-go execution that interrupts smooth motion and prolongs task completion. Extending the action chunk reduces policy calls and hence these pauses, but predicting farther into the future makes long-chunk execution unreliable. To understand where this unreliability arises, we analyze action errors within long chunks and find that they concentrate around transitions between manipulation subskills, growing sharply wit

    vision-language-actionmanipulationbenchmark
  259. arxiv:2610.05715 · cs.CV
    Rotated, but How Far? Diagnosing and Improving Object-Rotation Reasoning in VLMs
    Zhaochen Wang, Yujun Cai, Huangbo Zou, Hower Yang +3

    Vision-language models (VLMs) can detect that an object has rotated across views, but cannot reliably tell by how much. We introduce OR-Bench, a fine-grained benchmark for object-rotation reasoning with eight tasks covering rotation detection, rotation magnitude estimation, and multi-view rotation reasoning. Across 12 VLMs, the gap is stark: the strongest models approach 100% accuracy on detection, yet even coarse magnitude estimation is near chance. When asked for exact angles, models place 91.8--100% of their predictions on just $0^\circ$, $90^\circ$, and $180^\circ$, a failure we term canon

    benchmark
  260. arxiv:2610.05709 · cs.AI
    Nexus: An Execution Fabric for AI Agents Across Cloud, Edge, and Devices
    Cary Chang, Jialin Zhou

    Language-model agents are evolving into long-running services that interact with models, tools, computers, mobile devices, and distributed environments. Existing agent frameworks simplify reasoning and tool invocation. However, cloud-centric designs face three limitations: centralized execution increases failure impact, scaling pressure, and compute cost; extending agents across computers, mobile devices, and edge environments requires a unified execution abstraction with permission control; and long-running executions require consistent lifecycle management across failures, recovery, results,

    memoryagentai agentagent framework
  261. arxiv:2610.05707 · cs.CV
    Difference Feature Map Distillation: Transferring Inter-Sample Relational Knowledge Towards Efficient Transformer-Based Tracking
    Zhicheng Ding, Xinyu Chu, Qing Tian

    In autonomous driving perception, visual object tracking systems must satisfy stringent latency and power constraints while remaining robust in complex and dynamic environments. Although transformer-based trackers achieve state-of-the-art accuracy, their substantial computational and memory overheads hinder deployment on real-time, resource-constrained platforms. To move toward this goal, we propose Difference Feature Map Knowledge Distillation (DFM-KD), a novel relational distillation framework tailored for transformer-based visual object tracking. Unlike conventional feature distillation met

    memory
  262. arxiv:2610.05701 · cs.AI
    Second-Order Problem Solving for Recursive Self-Improvement in Formal Verification
    Yuxuan Jiang, Aditya Vempaty, Ashish Jagmohan

    Recursive self-improvement (RSI) enables agents to iteratively optimize their workflows via execution feedback. However, standard RSI typically operates as a first-order optimizer: it repeatedly patches surface-level parameters in response to immediate failure symptoms, often leading to trial-and-error thrashing without resolving underlying mechanisms. To address this limitation, we introduce SO-RSI, a framework that elevates workflow optimization to a second-order diagnostic inquiry, investigating why failures occur before committing to structural interventions. SO-RSI passively monitors exec

    memoryself-improvement
  263. arxiv:2610.05700 · cs.LG
    Voltic: Distinguishing Volatility from Stochasticity in Recurrent Memory
    Parsa Hejabi, Morteza Dehghani, Payam Piray

    Recurrent sequence models must decide how strongly to overwrite their memory at each token. Read as Bayesian filtering, this write is the gain of a Kalman update, set by uncertainty from two sources that pull it in opposite directions: volatility, how quickly the underlying associations change, and stochasticity, how noisy each observation of them is. First, we show that the update of gated delta-rule memories is the form this filter takes under isotropic uncertainty. Next, we introduce Voltic, a recurrent memory that keeps the covariance anisotropic and makes both noise variances input-depend

    memory
  264. arxiv:2610.05695 · cs.RO
    Virtual model control for compliant reaching under uncertainties
    Yi Zhang, Daniel Larby, Fumiya Iida, Fulvio Forni

    Virtual Model Control (VMC) is an approach to design a controller for force-controlled robots in complex uncertain environments. While this method was primarily investigated for legged robot locomotion in the past, it can be more generally applicable to other types of robotic systems. This paper investigates the VMC framework for reaching tasks in a force-controlled robotic arm. We propose six different approaches to designing virtual models in order to achieve reaching tasks in environments with obstacles and uncertainties. A force-controlled 8 degree-of-freedom humanoid robot was used to val

    humanoid
  265. arxiv:2610.05692 · cs.RO
    Benchmarking Generative Trajectory Models for Active-Inference Control
    Yulin Li, Mohsen A. Jafari, Andrea Matta

    Learning from trajectory demonstrations offers a route to active-inference control of complex systems whose dynamics are difficult to model explicitly. We introduce generative active-inference control (GenAIF), in which one generative trajectory model learns from demonstrations and measured action interventions to supply a goal-conditioned policy distribution and a state-to-observation likelihood mapping. From this control design, we derive three model requirements: (i) useful action proposals, (ii) accurate prediction under imposed actions, and (iii) probabilistic observation evidence for bel

    manipulationbenchmark
  266. arxiv:2610.05686 · cs.AI
    Do Time-Series QA Systems Read the Time Series? Evidence Use and Reasoning Reliability
    Zhuomin Chen, Jingchao Ni, Xu Zheng, Janki Bhimani +3

    In recent years, time-series question answering (QA) systems have made significant progress. However, generating a correct answer does not show whether retaining the supplied numerical series improves task performance, nor whether the prediction is sensitive to changes in that input. While some systems provide rationales, answer accuracy also does not show whether their numerical claims are grounded in the supplied series or whether the stated inference is valid. In this work, we focus on evaluating four time-series QA systems: TimeOmni-1, ChatTS, TimeOmni-VL, and Time-MQA. First, for three sy

    benchmark
  267. arxiv:2610.05685 · cs.CL
    Spend Bytes on Breadth: Precision-Count Trade-offs for Decode-Time KV Compression in Long Chain-of-Thought Reasoning
    Runguo Li

    Reasoning models write most of their KV cache while decoding long chains of thought (CoT), so the cache has to be compressed online under a fixed memory budget. Decode-time methods mostly decide which tokens to evict. We ask how a fixed byte budget should be split between the number of cached tokens and their precision. BreadthKV spends the bytes on more tokens at low precision, combining quantization with eviction, and picks the bit-width for each model and budget with a 60-problem end-to-end calibration, since offline attention error does not predict it reliably. On three reasoning models an

    memorybenchmark
  268. arxiv:2610.05684 · cs.LG
    Two-Sample Testing via Path-based Inference
    Eshant English, Wei-Cheng Lai, Yanfeng Yang, Kenji Fukumizu +2

    Modern deep generative models are primarily studied for their ability to generate realistic samples, yet the generative dynamics they learn can also serve as objects of statistical inference. We develop this idea for two-sample testing, the problem of deciding whether the same distribution generated two finite datasets. Using stochastic interpolants, we connect both distributions to a shared Gaussian bottleneck, so that each half of the resulting path is a Gaussian channel acting on a single population. We prove that the null hypothesis holds if and only if the population denoiser, or equivale

    benchmark
  269. arxiv:2610.05683 · cs.LG
    RESOLVE: Language-Agnostic Validation of GPU Kernels Through Testing, Reduction, and Proof
    Ashkan Vedadi Gargary, Guido Martínez, Sebastian Burckhardt, Gabriel Ebner +3

    AI systems can now write and optimize production GPU kernels, but validating them remains an important challenge. Evaluating the kernel on a few random inputs and checking that its outputs match a trusted reference kernel within numeric tolerances is not sufficient: races can cause nondeterministic behavior that fails to manifest in tests, and numeric tolerances can hide bugs and cause false positives even after extensive calibration. To address this challenge, we present RESOLVE, which combines testing and formal verification to build a comprehensive kernel validation pipeline. It operates in

    agent
  270. arxiv:2610.05682 · cs.AI
    Knowing the Rules, Applying the Rules: Evaluating Language Models on Traditional Chinese Bazi
    Jiulin Li, Ping Huang

    Knowing domain rules does not guarantee applying them to a case. We study this distinction in traditional Chinese Bazi through 3,000 Chinese multiple-choice questions spanning 14 Theory and 11 Case categories. Six endpoint systems are evaluated, with primary results reported on a 2,492-item model-informed refinement. Theory accuracy exceeds Case accuracy for every system, and gaps of 16.60-29.56 percentage points remain when invalid responses are excluded. The contrast is more specific than a general case-reasoning deficit. Across six systems, Twelve Stages and Nayin reach mean accuracies of 8

    benchmark
  271. arxiv:2610.05681 · cs.CL
    Automatic Speech Recognition for Low-Resource Sinhala: A Critical Review of Methods, Challenges, and Future Directions
    Chanuka Dinuwan, Sanath Jayasena, Buddhika Karunarathne

    Automatic speech recognition (ASR) for low-resource languages remains a major challenge. Sinhala, the primary language of Sri Lanka with about 16 million speakers, illustrates the difficulty: agglutinative morphology, a 54-phoneme inventory, subject-object-verb (SOV) syntax and scarce annotated speech data limit both conventional and modern ASR systems. This paper presents the first critical review of Sinhala ASR research, tracing its development from Hidden Markov Models (HMMs) through deep neural networks to self-supervised pre-trained models such as wav2vec 2.0, XLS-R, Whisper and Massively

    benchmark
  272. arxiv:2610.05678 · cs.RO
    Dataset-Free Compliant Humanoid Loco-Manipulation with Dynamic Online Posture
    Seungho Yeom, Zhenyu Wu, Jaeyoung Huh, Diego Williams +3

    Most humanoid loco-manipulation controllers require human motion data to learn whole-body coordination and posture, leaving policies reliant on external sources to provide this data. We present OCLO (Online-posture Compliant LOco-manipulation), a humanoid loco-manipulation system trained without human motion data and commanded only through two end-effector targets. Because these targets do not uniquely determine whole-body posture, OCLO generates pelvis height and torso orientation online using an analytic reachability prior, further refined through policy-in-the-loop sampling with a task-agno

    manipulationhumanoid
  273. arxiv:2610.05677 · cs.RO
    Learning Coordinated Visuomotor Box-Pushing from Solo Demonstrations
    Ryusei Matsumoto, Mei Kinjo, Yoko Sasaki, Keisuke Okumura

    Multi-robot imitation learning, particularly in settings where visuomotor policies are deployed in a communication-free, onboard decentralised style, represents an attractive paradigm. However, its realisation remains insufficiently understood, largely due to the difficulty of collecting collective demonstrations, since a single operator cannot control many robots simultaneously. Meanwhile, unlike coupled collaborative manipulation, many coordinated tasks achieve system-wide efficiency primarily through minimising inter-robot interference. This structure motivates us to study whether data coll

    manipulation
  274. arxiv:2610.05671 · cs.AI
    How Should a Prompt Optimizer Spend a Tight Budget? BudgetAPO with Noise-Adaptive Evaluation
    Haoyue Liu, Zhichao Wang, Huanyu Yan, Xiaoying Tang

    Automatic prompt optimization (APO) has been widely employed to adapt large language models without updating their weights, yielding promising results. However, existing methods such as GEPA and OPRO assume hundreds to thousands of subject-model calls, far more than is practical behind paid, rate-limited APIs. Under tight budgets they fail in two ways: multi-stage pipelines can exhaust the budget and return the seed prompt unchanged, while single-stage methods compare candidates on fixed-size minibatches, regardless of each task's noise. As a remedy, we introduce BudgetAPO, a single-stage opti

    benchmark
  275. arxiv:2610.05664 · cs.RO
    StageVLN: Spatial and Trajectory Auxiliary Guidance for Efficient Vision-Language Navigation
    Anh Dao, Quan-Dung Pham, Le Danh Vinh, The Anh Nguyen +5

    Vision-and-Language Navigation (VLN) policies increasingly benefit from strong semantic priors provided by large vision-language models (VLMs). However, standard action supervision does not explicitly encourage intermediate representations to preserve scene geometry, relative orientation, or global episode progress. Incorporating depth estimators, explicit maps, point clouds, or geometry foundation models at inference can provide such structure but introduces additional computation, memory overhead, and architectural dependence during deployment. We introduce StageVLN, a training framework tha

    memory
  276. arxiv:2610.05659 · cs.LG
    Bellman-Centric Learning: Near-Optimal Regret for Linear Bandits with Memory
    Jingyuan Liu, Huiwen Jia

    We study linear bandits with memory, where past actions induce endogenous nonstationarity through an arbitrary known, bounded matrix-valued memory map. To trade off exploration and exploitation while accounting for the memory dynamics, we develop RSM-LinUCB, a Bellman-centric algorithm that learns as in linear bandits and plans as in reinforcement learning. This design admits a novel regret decomposition which separates the memory-induced error from the cumulative reward estimation error along the learner's trajectory. We prove a high-probability regret bound of $\widetilde O\big(dRS(M+1)+σd\s

    memory
  277. arxiv:2610.05641 · eess.SY
    Doppler-Aware Meta-Learning for Evolutive STAR-RIS in Cognitive Autonomous Networks
    Noha Hassan, Maysa Yaseen, Xavier Fernando, Halim Yanikomeroglu

    In real-time optimization of simultaneous transmis- sion and reflection reconfigurable intelligent surfaces (STAR- RIS), limitations arise due to Doppler effects and reduced adaptation speed. Existing RIS memoryless surface models use quasi-static optimization and incur high latency, which limits their application in cognitive autonomous networks. To overcome this limitation, we propose a stateful RIS model that includes an element-wise memory, which locally stores and updates its phase history across coherence intervals. Hence, the metasurface be- comes a stateful surface with element-level m

    memory
  278. arxiv:2610.05640 · cs.MA
    Can CaMeLs Talk? Securing Multi-Agent Systems Against Indirect Prompt Injection Attacks
    James Peters-Gill, Avi Semler, Henning Bartsch, Ilia Shumailov +1

    Indirect prompt injection attacks - malicious instructions embedded in content processed by large language models - remain a major obstacle to safely deploying tool-using agents. CaMeL [Debenedetti et al., 2025] mitigates this threat for an individual agent by separating trusted control flow from untrusted data and enforcing capability-based security policies at runtime. In this work, we investigate whether CaMeL's security guarantees compose in hierarchical multi-agent systems, where agents invoke other agents as tools. We find that CaMeL's guarantees do not compose. We construct a concrete p

    agentmulti-agentagent systembenchmark
  279. arxiv:2610.05639 · cs.RO
    FOCUS: Fine-Grained Open-Vocabulary Change Detection for Uncertainty-Aware Semi-Static Scenes
    Can Xu, Mingfeng Yuan, Mahan Mohammadi, Steven L. Waslander

    Autonomous robots operating over long periods must keep their environmental memory up to date as the world changes between visits. In semi-static environments, an object may be replaced in place by a different but geometrically and semantically similar instance, making the identity change difficult to detect from geometry or coarse semantics alone. We present FOCUS, an uncertainty-aware framework for object-level change detection and map maintenance. We formulate semi-static memory maintenance as probabilistic inference that fuses geometric likelihood with appearance likelihood rendered from a

    memorybenchmark
  280. arxiv:2610.05637 · cs.LG
    Visual Grounding Safety in Vision-Language Models
    Erfan Shayegani, Kundan Krishna, Yue Dong, Nael Abu-Ghazaleh +2

    Vision-language models (VLMs) are increasingly trained to generate structured outputs like points and bounding boxes that downstream interfaces, agents, and robots can act on, yet safety alignment of this output channel has not been systematically analyzed. We study visual grounding safety by repurposing three safety benchmarks spanning direct harm (VLSU), social bias (BBQ-V), and situational safety (Asimov-2.0) into 15,401 matched pairs of harmful requests that differ only in the requested output: a free-text answer (VQA) or a grounding (point or bounding box). Across five VLMs, models that r

    benchmark
  281. arxiv:2610.05633 · cs.AI
    The GenAI4IDN Benchmark 3.0 - a Public Tool to Assess Generative AI Tools for the Design of Interactive Digital Narratives
    Hartmut Koenitz, Jonathan Barbara, Mirjam Palosaari Eladhari

    This paper presents GENAI4IDN Benchmark 3.0, the third iteration of an evaluation framework to assess Generative AI tools for creating Interactive Digital Narratives (IDNs). Moving beyond manual testing, this iteration introduces AI-assisted evaluation through a publicly accessible web application (https://genai4idn.com), enabling the community to run benchmarks on demand, add new models, and propose new tasks. The revised evaluation framework is "blinded" to avoid model-bias, and can handle complex media such as music, videos, and full IDNs that previously required human raters. A significant

    benchmarkevaluation framework
  282. arxiv:2610.05622 · cs.AI
    UndoBench: Separating Task Competence from Recovery Capability in Tool-Using AI Agents
    Dolly Sah, Tanmay Sah, Harshul Jain, Tanya Sah

    Tool-using AI agents are increasingly deployed across enterprise software systems, yet widely used benchmarks primarily evaluate nominal task completion, conflating baseline planning competence with operational fault recovery. We introduce UndoBench, a benchmark spanning 36 base workflows and 36 fault scenarios across 8 enterprise domains, decoupling task competence from recovery capability via counterfactual paired trials under identical seeds alongside wire-level effect-history and environment-state oracles. On 12 held-out TEST workflows across two open-weight models, two frameworks, and thr

    ai agentautonomous agentbenchmark
  283. arxiv:2610.05618 · cs.LG
    Causal Lag Structure Discovery in Confounded Time Series via Orthogonalized Adaptive Estimation
    Hong Kiat Tan, Isaac-Neil Zanoria, James Chen, Haoyang Lyu +1

    Finding which variables cause which others in multivariate time series, and at what lags, is central to science and policy, yet existing methods force a choice between flexible confounder adjustment, data-driven lag selection, and inference that controls the false discovery rate (FDR). ORACLE-VARX does all three in one pipeline. First, double/debiased machine learning (DML) removes nonlinear confounder effects from the outcomes and the lagged series. Second, adaptive causal lag estimation (ACLE) picks the lag order at each time step by sequential significance tests, tracking regime changes. Th

    benchmark
  284. arxiv:2610.05615 · cs.CV
    DREAM: Dynamic Resolution Assignment For Multimodal Multi-agent Debate
    Khanh-Binh Nguyen, Van Dai Do, Tien Anh Nguyen, Svetha Venkatesh +1

    Multi-agent debate (MAD) has emerged as an effective paradigm to improve the reasoning capabilities of large language models (LLMs) and is increasingly being extended to multimodal settings. However, existing multimodal MAD frameworks typically expose agents to the same fixed visual input, ignoring substantial variation in the visual scale needed across samples and agents. In addition, these frameworks frequently suffer from groupthink, a phenomenon where agents prematurely abandon correct deductions to conform with confident but hallucinated peer responses. To address these bottlenecks, we in

    agentmulti-agent
  285. arxiv:2610.05610 · cs.AI
    SEA-LM: Egocentric Spatial Audio Understanding for Wearable Microphone Arrays
    Sonal Kumar, Sinan Hersek, Artem Dementyev, Mengzhen Pan +5

    Embodied, ego-centric intelligence fundamentally requires the ability to comprehend spatial audio within complex environments. While large audio-language models excel at mono-channel reasoning, they lack spatial awareness, discarding critical spatial cues that enable sound localization and that can improve the disentanglement of overlapping sound sources. To address this, we present SEA-LM, a Spatial Audio Understanding model. First, we introduce FOACODER, a layout-flexible spatial audio encoder trained on source localization and ego-centric voice activity detection objectives to encode First

    embodied
  286. arxiv:2610.05608 · cs.LG
    Kandinsky 6.0 Video: Foundation Models for Synchronized Video and Audio Generation
    Team Kandinsky, Julia Agafonova, Bulat Akhmatov, Mikhail Aksyutin +84

    We present Kandinsky 6.0 Video, a family of foundation diffusion models for synchronized text-to-audio-video generation, comprising Kandinsky 6.0 Video Lite (3B parameters) and Kandinsky 6.0 Video Pro (29B parameters). Both models generate 5-second video clips with synchronized 44 kHz audio, including lip-sync, in text-to-audio-video (T2AV) and image-to-audio-video (I2AV) modes; a built-in super-resolution model raises the output resolution to Full-HD (1920$\times$1080). Building on the video generation capabilities of Kandinsky 5.0, Kandinsky 6.0 Video employs a dual-stream CrossDiT architect

    post-training
  287. arxiv:2610.05600 · cs.LG
    An LLM-in-the-loop RL Framework for Bioinformatics Feature Selection
    Xinyuan Wang, Deepti Agrawal, Yanjie Fu

    High-dimensional bioinformatics data, characterized by a large number of features relative to the number of samples, pose major challenges such as the ``curse of dimensionality,'' leading to overfitting, high computational cost, and poor generalization. Traditional feature selection methods often suffer from limited scalability and adaptability in such domains. We propose an LLM-in-the-loop reinforcement learning (RL) framework for bioinformatics feature selection, where the RL agent formulates feature selection as a sequential decision-making task, while the large language model (LLM) enhance

    agent
  288. arxiv:2610.05590 · cs.LG
    ColdDDI: Evaluating Knowledge Utilization in Cold-Start Drug-Drug Interaction Prediction
    Jiheng Liang, Chen Zhao, Di Wu, Chenyang Bu +3

    Cold-start drug-drug interaction (DDI) prediction tests whether models can identify clinically significant interactions for drugs without training-time interaction history. Existing benchmarks mostly report aggregate edge-prediction scores, leaving a key evaluation question unanswered: when models receive molecular, textual, or knowledge-graph (KG) evidence, do they actually use the evidence that pharmacologically supports the interaction? We introduce ColdDDI, a reconstructible diagnostic benchmark built from DrugBank 5.1.13, with 1,900 approved small-molecule drugs and 565,731 positive DDI p

    knowledge graphbenchmark
  289. arxiv:2610.05586 · cs.AI
    AgentDoxx: Agentic Re-identification of Anonymized Text with Web Search
    Jianing Wen, Tianshi Li

    As Large Language Models (LLMs) gain tool use capabilities such as web search, they can retrieve and cross-reference public information, creating privacy risks beyond memorization. One manifestation is re-identification: linking an anonymized interview transcript to a named individual. Yet without ground-truth identities, the coverage of such attacks and the protection offered by a defense cannot be reliably measured. We introduce AgentDOXX, an evaluation suite of 822 synthetic interview transcripts grounded in public information about real individuals with known identities. We evaluate fiftee

    agentictool use
  290. arxiv:2610.05584 · cs.LG
    Expanding LLM Reasoning
    Rian Atri, Evan Luo

    Extra inference compute is usually spent on sampling more reasoning chains. We study where inside an existing chain an additional continuation should begin. We define expansion utility, the change in correctness from restarting a chain at a stored step, and measure it at every eligible step for nine models on six benchmarks (41 model and benchmark cells). Restart position matters: steps selected on one set of continuations beat uniform placement when scored on disjoint ones, in held-out audits on 5, 16, and 38 cells (+4.25 points [+2.51, +6.63] in a fresh five-cell audit). A fixed rule that re

    benchmark
  291. arxiv:2610.05583 · cs.RO
    TacGELLO: Tactile Contact Feedback for a 3D-Printed Teleoperation Leader
    Younsoo Kim, Sangmin Song, Sarath Kodagoda, Marc Carmichael +1

    Passive leader arms transmit an operator's motion without returning remote contact or load cues. TacGELLO uses the existing servos of a 3D-printed leader for tactile contact feedback at the gripper trigger and current-based load cues at the arm joints. AnySkin contact detection activates a trigger position hold, while changes in follower joint current adjust leader-servo output limits to command resistance during lifting. Across six UR3 sessions with one operator, sent-command tracking error was 0.15--0.36$^\circ$ RMSE, with estimated trajectory lag of 82--98\,ms. Tactile onset was logged in 6

    teleoperationtactilegrippergrasp
  292. arxiv:2610.05577 · cs.LG
    What Does an Observability Foundation Model Know?
    Dhyey Dharmendrakumar Mavani, Rian Atri, Tairan Ji

    A linear probe can show that a label is recoverable from a model's hidden states, but not whether that goes beyond what the input already reveals, or whether the model uses it. We audit Toto, an observability forecasting foundation model, on the Benchmark of Observability Metrics (BOOM) across five series-disjoint resplits, comparing linear probes on its frozen residual stream with models that read the raw input window and with Toto's architecture stripped of its trained configuration. Short-vs-medium cadence and metric type are more linearly recoverable from Toto's residuals than from the str

    benchmark
  293. arxiv:2610.05572 · cs.LG
    Disentangling Task Difficulty from Run-Level Failure in Agent Failure Prediction
    Mohsen EsfandyariDoulabi, Lawrence Arkoh, Biruk Tadesse, Vaishvi Patel +3

    Predicting whether an LLM agent will fail has emerged as a promising direction for supporting intervention during execution. Recent approaches report strong predictive performance, often with AUROC values between 0.85 and 0.94. However, predictors are typically trained by pooling runs from many tasks. We hypothesize that part of this performance comes from recognizing that some tasks are harder than others, rather than detecting whether a particular run is heading toward failure. This distinction matters because task-level difficulty supports decisions about where to allocate computation, whil

    agentllm agentbenchmark
  294. arxiv:2610.05569 · cs.AI
    Factoriax: A GPU-Accelerated Factorio-Style Simulator for Reinforcement Learning
    Mickey Beurskens, Tristan Tomilin, Thiago D. Simão

    We introduce Factoriax, a GPU-accelerated factory-building simulator written in JAX. In Factoriax, an agent must collect resources, build machines using those resources, and then automate the collection and crafting process by arranging machines on the map to build production pipelines. This paper discusses the structure of the Factoriax simulator and an initial benchmark called Easy Rocket in which an agent is tasked with building a resource-intensive machine called the Rocket in a limited number of game ticks to escape the planet. We also publish results from a number of PPO-based training r

    agentbenchmark
  295. arxiv:2610.05566 · cs.AI
    LifeLong Digital Twin: A Unified Modeling Paradigm and Agent Harness for Event-Driven Lifelong Health State Trajectories
    Jin Jiang, Sean Yates, Jasper Chong, Raymond Brooks +3

    Human health is a continuous, dynamic trajectory shaped by the cumulative interplay of biological processes, clinical events, behaviors and environmental exposures across the life course. Unifying the full breadth of lifelong health information, including longitudinal records, genetic variation, molecular profiles and environmental histories, is essential for whole-person modeling and remains a major challenge. We introduce LifeLong Digital Twin, a unified, event-driven modeling paradigm that organizes Life Events into daily Health States and accumulates them into Lifelong Health Context. An a

    agent
  296. arxiv:2610.05563 · cs.LG
    G-CARB: Graph-Localized Conformal Agent Risk Budget for Compositional Harm
    Zijun Yu, Yu Gu, Vahid Partovi Nia, Masoud Asgharian

    Small language model (SLM) agents need safety controls that track consequences across tool calls with little monitoring overhead. A private read, for example, becomes a leak when a later action sends that data outside the system. We introduce CARB (Conformal Agent Risk Budget), which calibrates when to stop an agent using a ledger of harm incurred before stopping. Under exchangeable episodes, standard conformal risk control bounds this declared loss in expectation over calibration and a future episode. G-CARB selects scorer evidence along observable dependencies from private sources to outgoin

    agent
  297. arxiv:2610.05559 · cs.LG
    Cut Binary Cross Entropy: Efficient Large-Vocabulary Loss and Gradient Kernels for Sequential Recommendation
    Yaoyiran Li, Haowen Ning, Mohamed Hammad

    Industrial sequential recommender systems operate over massive item catalogs (e.g., 10^5--10^7 items). Multi-label recommendation models are trained with Binary Cross-Entropy (BCE) loss over the full vocabulary, but standard BCE materializes a dense [B, N, V] logits tensor in High Bandwidth Memory (HBM), incurring prohibitive $O(BNV)$ memory and fatal Out-Of-Memory (OOM) errors. While chunked loss optimizations exist for Softmax Cross-Entropy in LLMs, large-scale multi-label BCE optimization remains unexplored across deep learning ecosystems. We propose CutBCE, an exact, hardware-accelerated B

    memorybenchmark
  298. arxiv:2610.05558 · cs.LG
    An equality condition for the Dobrushin bound on attention rollout and how often it holds in trained transformers
    Przemysław Rola

    The Dobrushin coefficient of each attention-rollout factor satisfies $κ(\frac12(I+A))\le\frac12(1+κ(A))$, and multiplying these inequalities over layers bounds the coefficient of the whole rollout. We characterise exactly when the layerwise bound is tight: equality holds if and only if some token pair attaining $κ(A)$ is mutually self-dominant - each of the two attends to itself at least as strongly as the other attends to it. The condition is far from automatic: uniformly random stochastic matrices satisfy it only 24-30% of the time. When tested on the head-averaged attention of each individu

    benchmark
  299. arxiv:2610.05550 · cs.LG
    When Low Prediction Error Misleads Planning: Diagnosing Representation, Dynamics, and Decision Failures in Latent World Models
    Rui Min, Xianyao Li, Fang Xu, Jing Du

    The component that dominates a latent world model's prediction error need not be the one whose repair most improves action selection. We show this by comparing action sequences from identical physical starts and separating endpoint error into a candidate-pool center and action-relative responses. Across four model families and four tasks, a confirmation pool of 256 new starts per task and 300 shared candidates per start shows that center error dominates MSE in 14/16 model-task cells. Yet in six of these cells, an oracle that corrects only the action-relative responses yields better physical ra

    world model
  300. arxiv:2610.05546 · cs.RO
    GR-LIO: A Local Ground-Aware LiDAR-Inertial Odometry System Using Body-to-Ground Height
    Zhixin Zhang, Yang Song, Liang Zhao, Nathan Shankar +2

    LiDAR-inertial odometry (LIO) is widely used for state estimation in ground-based autonomous mobile robots. However, the geometric constraints provided by the local ground surface remain largely underexploited in existing LIO systems. This paper proposes a filter-based local ground-aware LIO framework that explicitly incorporates local ground plane geometry into the state estimation process to improve both localization accuracy and computational efficiency. Specifically, a local ground plane is parameterized by the robot orientation and the body-to-ground (B-G) height and continuously propagat

    benchmark
  301. arxiv:2610.05544 · cs.LG
    Soft Strategy Selection for Batch-Mode Active Learning
    Rushil Gupta, Romain Lopez

    Real-world deployment of active learning typically forces practitioners to choose an acquisition strategy before any data is labeled. This is a daunting task: strategy performance varies widely across settings (e.g. datasets, surrogate models) and cannot be assessed without deployment. Existing strategy selection methods explore one strategy from a portfolio at each round and identify the optimal one using bandit feedback or model retraining. Many acquisition rounds are therefore spent exploring strategies rather than collecting the most informative data. Such overhead is a major barrier to AL

    benchmark
  302. arxiv:2610.05542 · cs.RO
    Neural Barriers: An Online Certifiable Learning-enhanced Adaptive High Order Safety Critical Control
    Lishuo Pan, Mattia Catellani, An Cao, Lorenzo Sabattini +1

    Control barrier functions are an effective model-based tool to formally certify the safety of a system. However, transferring their theoretical guarantees to real-world robotics systems requires high model fidelity. For example, payloads or wind disturbances can cause significant model perturbations to an aerial vehicle, leading to safety compromises. In this work, we propose a certifiable online learning-enhanced robust adaptive control barrier function, which adapts to disturbances using a Neural ODE and quantifies its adaptation uncertainty with conformal prediction. Our approach guarantees

    online learning
  303. arxiv:2610.05540 · cs.LG
    SALUS: Automated Auditing of NL-to-SQL Benchmarks through Weak Supervision of Multi-Agent Output
    Shiyuan Zhou, Ashwin Gerard Colaco, Sainyam Galhotra, Sharad Mehrotra

    Natural language to SQL (NL-to-SQL) benchmarks are foundational to progress in data analysis research, yet recent work has shown that widely-used benchmarks contain significant annotation errors. These errors silently corrupt evaluation metrics, penalize correct model output, and distort the field's understanding of state-of-the-art performance. We present SALUS, a system that automatically detects annotation errors in NL-to-SQL benchmarks. SALUS frames benchmark auditing as a weakly supervised error detection: SQL generated by multiple LLM agents drive a suite of complementary weak-labeling f

    llm agentmulti-agentbenchmark
  304. arxiv:2610.05533 · cs.LG
    What Does a Harness Repair? A Preregistered Study of Visibility, Baseline Adequacy and Evaluation Defects
    Bowen Xu, Boyu Chen

    Harness search keeps a change to the prompts, reasoning switches, token budgets or parsers around a frozen model if the change raises a score. Such a gain can come from answers the parser could not read before, a weak comparison, or a defect in the evaluation. We preregistered a study of where these gains come from, with three small models, three benchmarks, replication and test partitions, a GEPA search arm and six evaluation defects injected one at a time, and we report all 47 primary endpoints. Turning thinking off raised accuracy over a capped thinking setting in 5 of 9 model-benchmark cel

    benchmark
  305. arxiv:2610.05532 · cs.LG
    DelegationBench: Measuring When AI Agents Should Ask Before Acting
    Shiva Pochampally

    AI agents that send emails, edit files, and make purchases must decide when to act on their own and when to check with the user first. This decision is usually evaluated by showing a model a proposed action, asking whether it should proceed, and scoring agreement with human labels. We introduce DelegationBench to test whether such scores can be trusted. It has 156 scenarios with four possible responses (act, ask for permission, ask for missing information, refuse), and most scenarios come in matched pairs that change a single feature: whether the action was requested, what is at stake, whether

    ai agentbenchmark
  306. arxiv:2610.05531 · cs.RO
    Deep Prior Learning for Embodied Perception
    Yimou Wu, Jiaxin Guo, Yun-hui Liu, Zheng Li

    Embodied systems need geometric perception that exploits available observations beyond images alone. Recent feed-forward 3D models incorporate geometric priors, including camera poses, intrinsics, and depth. However, handling noisy poses, preserving accurate priors, and recovering physical scale require more than simply accepting these inputs. We introduce \emph{Vision-Prior Geometry Grounded Transformer} (VPGGT), a VGGT-based framework that extends OmniVGGT for prior-aware embodied perception. We formulate sensor-motivated pose corruptions from ground-truth trajectories for training and intro

    embodied
  307. arxiv:2610.05530 · eess.SY
    Optimal Dynamic Resource Allocation for Multicore Real-time Systems
    Georgiy A. Bondar, Abigail Eisenklam, Ripon C. Sarker, Linh Thi Xuan Phan +1

    We formulate a novel optimal control problem for data-driven dynamic resource allocation in multicore real-time systems. The proposed formulation accounts for hard deadline constraints and resource bounds. Under mild assumptions, we prove several results on the feasibility and existence of optimal solution for the proposed formulation. Building on these analyses, we design an algorithm to solve the multi-core dynamic resource allocation problem. We demonstrate the practical use of this new algorithm by experimentally evaluating it on a real multicore platform using four benchmarks from the lit

    benchmark
  308. arxiv:2610.05526 · cs.AI
    Have I Scene This Before? Spatially Grounded Conversational Memory for Complex Queries in Egocentric Assistants
    Jiazhou Liang, Liam Gallagher, Kiko Chen, David Guo +3

    Egocentric assistants must connect what users say with what they see across long interaction histories. We formalize this challenge as Spatially grounded Conversational Reasoning (SpaCR): cross-scene, recall-oriented, and counterfactual spatial queries that combine user-stated facts with geometric evidence. Direct vision-language models incur high inference costs and context limits as histories grow, while keyframe selection and retrieval can omit objects or evidence needed for complete recall. We propose Spatially grounded Conversational Memory (SpaC-MEM), an object-centric working memory tha

    memorybenchmark
  309. arxiv:2610.05497 · cs.LG
    LEON: Location Embeddings from OSM Neighborhoods via Hexagonal Graph Masked Autoencoders
    Szymon Soltysiak, Radoslaw Malek, Jedrzej Kusnierz, Milosz Chojecki +2

    Geographic information systems increasingly rely on sophisticated spatial representation learning techniques to extract meaningful patterns from complex geospatial data. This paper introduces LEON, a novel self-supervised framework that adapts Graph Masked Autoencoders (GraphMAE) for geospatial region representation learning. Our method leverages the inherent spatial structure of geographic data by constructing hexagonal grid graphs using H3 indexing and applying masked autoencoding techniques to learn robust spatial embeddings from OpenStreetMap (OSM) amenity distribution patterns. We evaluat

    benchmark
  310. arxiv:2610.05492 · cs.LG
    When Does Retrieval Help? A Study of In-Context Adaptation in Vision-Language-Action Models
    Zixuan Liu, Joris Köster, Zizhan Zheng, Siavash Khajavi

    Vision-language-action (VLA) models have shown strong potential as generalist robot policies, but adapting them to unseen tasks often requires costly parameter updates. Recent work such as RICL introduces in-context adaptability by retrieving expert demonstrations based on the current VLA observation and providing them as additional context at test time. The effectiveness of this adaptation therefore depends critically on the retrieval mechanism. In this work, we systematically study how different retrieval methods affect both retrieval quality and task performance within the RICL framework. S

    vision-language-actionvlavla modelretrieval augmented
  311. arxiv:2610.05491 · cs.RO
    Robust Surgical Robotic Instrument Tracking via Sequential Multi-Cue Fusion and Sim-to-Real Self-Training
    Hanyang Hu, Zekai Liang, Florian Richter, Michael C. Yip

    Efficient and robust tracking of surgical robotic instruments is important for robot-assisted minimally invasive surgery, yet remains challenging due to the complexity of surgical scenes and the unconventional geometry of surgical instruments. Keypoint-based approaches are efficient, but their performance depends on reliable feature detection. Improving these detectors with real-world supervision is difficult because accurate real-world annotations are costly to obtain at scale. To address this limitation, we introduce a tracker-guided self-training framework that adapts a model pretrained on

    sim-to-real
  312. arxiv:2610.05489 · cs.AI
    SkillGATE: Gate-Aware Monte Carlo Tree Search for Skill Retrieval
    Rongchen Zhao, Yu Chen, Yanming Yang, Shijia Xu +4

    Skill Retrieval (SR) aims to identify the most relevant skills from external skill libraries, and becomes increasingly challenging as libraries grow in scale and diversity. Existing methods either rank skills independently or rely on predefined graph propagation and hierarchical routing, making them vulnerable to semantic distractors, local trapping, and early routing errors. We formulate SR as an adaptive information-foraging process that coordinates region-level navigation with skill-level selection according to the utility and uncertainty observed during search. Based on this formulation, w

    benchmark
  313. arxiv:2610.05484 · cs.LG
    Universal Test-Time Training
    Zefan Cai, Qinzhe Hu, Ziqiao Ma, Hao Tan +1

    Recent Test-Time Training (TTT) architectures compress context into fast weights that are updated online and queried as memory. Existing TTT designs keep this memory private to each layer: it recurs only over time, and depth merely indexes L separate memories. We argue that memory ownership need not be tied to depth, and introduce Universal Test-Time Training (uTTT), in which all layers read and write one shared memory while retaining layer-specific backbone parameters. The shared memory thus recurs over two dimensions, time and depth, with chunks and layers as their units: a write by a deep l

    memory
  314. arxiv:2610.05483 · cs.RO
    FLEX-WAM: Flexible Block-Causal World-Action Models for Long-Horizon Imagination and Planning
    R. Khorrambakht, Joseph Amigo, Félix Lebel, Leon Seetoo +3

    World--action models (WAMs) promise a unified model that predicts action-conditioned futures, generates feasible actions, and supports planning in imagination. However, existing joint video--action models often use computationally heavy, fixed-horizon backbones ill-suited to streaming inference and stable long-horizon open-loop rollouts. We introduce FLEX-WAM, a Flexible and Efficient Block-Causal World--Action Model for unified simulation and policy inference. FLEX-WAM supports variable-length contexts and non-causal prediction horizons, as well as infinite autoregressive generation frame by

    action-conditionedself-improvement
  315. arxiv:2610.05481 · cs.LG
    CodeForge-MA: Execution-Verified Multi-Agent Learning with Language-Conditioned LoRA for Multilingual Code Generation
    Zhizhou Gu, Xianting Wu, Siyu Gu, Tian Zhang +1

    Large language models for code generation often fail on execution, multilingual coverage, and contamination control, especially under frozen backbone constraints. We present CodeForge-MA, a unified framework that improves code synthesis through a multi-agent data forge, execution verified reinforced instruction tuning, and a language conditioned mixture of LoRA adapters. Four specialized agents, Composer, Reviewer, Executor, and Curator, iteratively refine instruction code pairs, validate them with tests, and filter duplicates and benchmark leakage. During training, we combine masked supervise

    multi-agentbenchmark
  316. arxiv:2610.05473 · cs.AI
    Hierarchical Reinforcement Learning with Stable Temporal Abstraction for Language Model Agents
    Shayan Mohajer Hamidi, Yize Cheng, Yuanda Xu, Zhengze Zhou +1

    Hierarchical reinforcement learning improves long-horizon control by organizing primitive actions around persistent subgoals and assigning credit at multiple temporal scales. Recent hierarchical language agents bring these benefits to interactive tasks by explicitly separating subgoal planning from action execution. We observe, however, that an explicit hierarchy does not by itself determine how stable the resulting temporal abstraction is: the learned boundary policy may replace the subgoal almost every turn, making it effectively transient, or retain a subgoal after it has stopped being appr

    benchmark
  317. arxiv:2610.05461 · cs.AI
    AI Safety via Debate is Compromised by Cognitive Biases
    Gefei Liu, Sonya Rashkovan, Sophia Lloyd George, Isaac Sheidlower +1

    Reinforcement learning from human feedback (RLHF) has played a central role in making large language models responsive to human instructions. However, human evaluators often favor flattering or persuasive responses over truthful ones, creating incentives for models to appeal to evaluators at the expense of accuracy. AI safety via debate has been proposed as a way to improve the supervision of language models: in this paradigm, two agents argue opposing positions and challenge each other's claims, potentially exposing falsehoods to the adjudicator. A central premise of AI safety via debate is t

    evaluator
  318. arxiv:2610.05456 · cs.LG
    Taylor Representations for Model-Free RL in Networked MDPs
    Salah Chikhi, Abdelhaq Chaoui, Asuman Ozdaglar, Saurabh Amin

    In Networked Markov Decision Processes, transition dynamics are often unknown and the state--action space grows rapidly with the number of agents. In this setting, Taylor representations naturally approximate $Q$-functions, but a naive order-$n$ expansion over $N$ agents requires $Θ(N^n)$ coefficients. We justify these expansions under smooth expected future local rewards with controlled derivatives. Under this condition, finite-speed information propagation and discounting imply that local-critic Taylor coefficients decay exponentially with the graph distance to the farthest agent involved. D

    agentbenchmark
  319. arxiv:2610.05452 · cs.LG
    VERA: Verdict-Conditioned Reliability for Adaptive LLM Judges
    Qiushui Xu, Syamil Mohd Razak, Tao Yuan, Piotr Habas

    Accurately estimating judgment reliability is a central challenge in adapting LLM judges to newly verified feedback while preserving previously learned behavior. However, existing approaches often rely on output-level confidence, which can be overconfident and poorly aligned with judgment correctness. We propose VERA, a VErdict-conditioned Reliability Axis that estimates reliability from hidden activations by distinguishing correct from incorrect judgments within each predicted-verdict group. Using VERA as a control signal, we develop a VERA-guided periodic adaptation framework that integrates

    benchmark
  320. arxiv:2610.05437 · cs.AI
    TeleTune: Evolving Agent Skills From Offline Telemetry
    Justin Chih-Yao Chen, Elias Stengel-Eskin, Yan Chen, Pol Llado +5

    Computer-use agents need to capture procedural knowledge of how people use software. User telemetry offers a scalable source of this knowledge. However, learning reusable skills from these logs requires addressing three challenges: (1) Goal Underspecification, since logs do not record the goal behind each action; (2) Non-Replayability, since past activity cannot be replayed to evaluate skill updates; and (3) Interleaved Trajectories, since logs may mix several tasks without marking their boundaries. To address these, we introduce TeleTune, a framework for learning a textual skill library from

    memoryagentbenchmark
  321. arxiv:2610.05428 · cs.LG
    Learning in Continuous Games from Pairwise Preference Feedback
    Anas Barakat

    We study learning in continuous games when players receive only pairwise preference feedback, revealing which of two actions is preferred but neither payoff values nor preference magnitudes. We first show that standard external regret and coarse correlated equilibria (CCE) are not identifiable from this ordinal information: the same sequence of play can incur zero and linear regret in two ordinally equivalent games, while the distributions that remain CCE across all cardinal representations consistent with the same preferences are exactly those supported on pure Nash equilibria. Motivated by t

    benchmark
  322. arxiv:2610.05418 · cs.RO
    EvoMem-VLA: State-Evolution Memory for Long-Horizon Robot Manipulation
    Yuheng Na, Zhide Zhong, Junjie He, Junfeng Li +6

    Most vision-language-action (VLA) models rely on current observations and lose task-relevant evidence once it leaves view, limiting performance on long-horizon, memory-dependent tasks. Existing efforts incorporate compressed historical features or sparse visual keyframes. However, isolated snapshots can leave the policy uncertain about what changed during past interactions and which action should follow. To overcome this limitation, we propose EvoMem-VLA, which constructs state-evolution memory by explicitly encoding and retaining observed changes between historical states. These change repres

    vision-language-actionmanipulationmemorybenchmark
  323. arxiv:2610.05417 · cs.CV
    Render to Reason: Novel-View Semantic Prediction Improves Spatial Understanding in VLMs
    Yuqun Wu, Yao Xiao, Chuhang Zou, Shenlong Wang +1

    Recent works augment Vision-Language Models with geometry features from pretrained 3D models, expecting that the geometric signal will boost spatial reasoning. However, we find that simply fusing geometry features and training on standard spatial QA yields only marginal improvements on high-level multi-hop tasks. We attribute this gap to a training-signal problem: standard spatial QA can be largely answered from visual features and language priors, so the geometry pathway receives weak gradients and fails to integrate with the visual features. To provide a training signal that requires geometr

    benchmark
  324. arxiv:2610.05414 · cs.RO
    RMMBench: A Comprehensive Benchmark for Robotic Mobile Manipulation
    Huapeng Li, Fuxiang Feng, Jinqiu Fan, Shuo Yang +4

    Although the advancement of vision-language models (VLMs) has endowed robots with enhanced environmental understanding and task reasoning, a comprehensive evaluation methodology is important to advance the integration of VLMs in robotic navigation and manipulation. However, current benchmarks lack a comprehensive method to evaluate diverse robotic tasks, and evaluation metrics remain relatively constrained, making it difficult to assess the embodied capabilities of VLMs in a thorough and fine-grained manner. To address this issue, we propose RMMBench, an evaluation benchmark that requires robo

    embodiedmanipulationbenchmark
  325. arxiv:2610.05409 · cs.LG
    BeliefGraph-JEPA: Structured Latent World Models for Action-Conditioned Time Series
    Yue Li, Kangqi Ni, Zhen Tan, Tianlong Chen

    Action-conditioned time-series forecasting requires accounting for how future actions and exogenous forcings influence multiple targets through partially observed effects with different delays and persistence. Direct conditioning leaves the evolution and target-specific influence of these effects implicit in the predictor, while static relational graphs specify connections without tracking evolving effects. This motivates representing future-driver influence through structured latent states that evolve over the forecast horizon and route information to individual targets. We introduce BeliefGr

    world modelaction-conditionedlatent dynamics
  326. arxiv:2610.05407 · cs.RO
    TUCO: Curating Simulation Demonstrations for Sim-to-Real Robot Policy Co-Training
    Ning Zhu, Mengfei Zhao, Yikai Tang, Zhangyujie Sun +4

    Simulation demonstrations can supplement scarce real-world data for robot policy co-training. However, the value of using data curation to actively select these demonstrations for sim-to-real co-training remains underexplored. Existing curation methods also lack a unified criterion for measuring trajectory-level utility and set-level coverage from closed-loop target behavior. To address these gaps, we present the first systematic study of data curation for sim-to-real robot policy co-training and propose Trajectory-level Utility and set-level Coverage Optimization (TUCO). TUCO uses influence f

    robot policysim-to-real
  327. arxiv:2610.05402 · cs.LG
    Task Vector Descent: Learning from Non-IID Batches
    Anton Baumann, Jonas Hübotter, Zeynep Akata, Andreas Krause

    A central challenge in continual learning is to acquire new knowledge without forgetting what the model has already learned. This challenge appears in language model training when training data comes from various domain-, user-, or task-specific distributions that are encountered unevenly over time. In such settings, successive minibatches are temporally clustered by distribution instead of being sampled i.i.d. from the overall data mixture. Training on temporally clustered data induces a stability-plasticity tradeoff. Adapting the model to the active distribution can improve the model on the

    post-training
  328. arxiv:2610.05400 · cs.CV
    CASE: Cost-Aware Stopping for Efficient Long-Video Agents
    Yiming Du, Chenghao Liu, Zhiyuan Liu, Fangxing Zheng +3

    Long-video agents can actively gather question-relevant evidence, but they typically leave a central decision implicit: when has the agent seen enough to answer? We propose CASE, a plug-in termination framework that frames this decision as policy-conditioned sequential stopping. At each causal checkpoint, CASE combines an auxiliary multiple-choice assessment of accumulated evidence with the host agent's execution state. From complete native trajectories, we construct a cost-aware target that compares answering now with stopping later along the same search path, accounting jointly for answer co

    agentbenchmark
  329. arxiv:2610.05398 · cs.AI
    MMPostTrainBench: Benchmarking Autonomous Research for Multimodal Post-Training
    Yuxin Liu, Yuxuan Wang, Zhenxin Lei, Lingchen Meng +8

    Autonomous research seeks sustained model improvements through iterative experimentation and feedback. LLM agents show promise in automating machine learning and language-model post-training, but their ability to sustain multimodal improvement remains unclear. We introduce MMPostTrainBench, a benchmark spanning eight tasks in image, audio, video, and joint audio-video understanding and image-grounded software repair. Agents operate from a common base model within fixed budgets, using development feedback before independent evaluation of their submitted models. Evaluation covers target and non-

    llm agentpost-trainingbenchmark
  330. arxiv:2610.05397 · cs.LG
    Efficient Graph Generation via Direct Prediction and Flow Matching
    Susie Lu

    Generative modeling of graph-structured data is crucial for tasks ranging from drug discovery to social network simulation. Among these models, denoising diffusion models have achieved great success in graph generation by learning to progressively reverse a process that adds noise to the original graph. However, the standard noise-prediction approach of diffusion models is suboptimal for graph data. The goal for a graph generative model is to learn the clean graphs' topological properties, such as connectivity and degree distribution. Because a diffusion model that predicts noise does not expl

    benchmark
  331. arxiv:2610.05387 · cs.LG
    GNN-CB: A Graph Neural Network Competition Benchmark for Human and LLM Evaluation
    Murad Hossen, Tasneem Selim, Gurur Gamgam, Tuga Yousif +21

    Large language models (LLMs) have demonstrated strong performance on coding and reasoning benchmarks; however, their ability to solve graph-structured machine learning problems remains largely unexplored. In particular, no benchmark currently evaluates whether LLMs can autonomously solve end-to-end Graph Neural Network (GNN) coding tasks under realistic competition settings. To address this gap, this paper introduces GNN-CB, the first competition-based benchmark for evaluating both humans and LLMs on GNN coding tasks. GNN-CB consists of 18 curated competitions spanning node-, edge-, and graph-

    autonomous agentbenchmarkevaluation frameworkleaderboard
  332. arxiv:2610.05383 · cs.AI
    Sibyl: An Efficient Small-large Model Collaboration Framework for Long-horizon Tasks
    Zhewei Fang, Yuxin Zhang, Zhenwei Shao, Mengze Li +7

    Small language models (SLMs) offer a promising foundation for on-device agents through low-latency, resource-efficient inference, yet limited reasoning and planning capabilities constrain their performance on long-horizon tasks requiring multi-step interaction with the environment. Step-level collaboration between SLMs and larger cloud-hosted models can bridge this gap, but identifying states that warrant cloud assistance remains challenging: the contribution of each cloud call is entangled with subsequent actions and can be assessed only from the final task outcome. Compounding this challenge

    agentself-evolving
  333. arxiv:2610.05382 · cs.CL
    Harness-Search: Guiding Long-Horizon Search through Multi-Agent Coordination
    Shanyong Wang, Zhenwen Ji, Lei Jin, Yining Zhao +6

    Long-horizon search requires agents to gather evidence across multiple steps and synthesize it into well-supported answers. The recent agent harnesses provide a natural and promising framework to support such long-running search processes. As interaction histories grow, one single agent in harnesses might get stuck and cause the policy to lose track of unresolved questions, overlook useful evidence, or terminate before sufficient support has been collected. One of promising way is to decouple three distinct responsibilities of proposing retrieval actions, updating persistent state, and decidin

    memorypersistent stateagentmulti-agentbenchmark
  334. arxiv:2610.05381 · eess.SY
    Backup Control Barrier Functions with Memory for Online Set Expansion
    M. Yusuf Uzun, Ersin Das

    Backup control barrier functions (bCBFs) construct implicit safe sets for nonlinear systems with bounded inputs using finite-horizon predictions under a backup controller. As in model predictive control, an invariant backup set serves as a terminal set that guarantees safe continuation beyond the prediction horizon. However, reaching a small terminal set may require long prediction horizons, increasing the cost of online prediction. In this paper, we introduce an online construction that builds a certified region from sets stored along backup trajectories while keeping the prediction horizon f

    memory
  335. arxiv:2610.05380 · cs.CL
    VHDL-REPOBENCH: A Repository-Level Benchmark for Evaluating Large Language Models on VHDL Design Generation
    Prashanth Vijayaraghavan, Akul Malhotra, Ashutosh Jadhav, Ehsan Degan +1

    Large Language Models (LLMs) are increasingly applied in hardware design automation, demonstrating strong potential in generating and understanding hardware description languages. However, most existing benchmarks focus on Verilog, with limited evaluation of VHDL, which remains widely used in industry and academia for FPGA and safety-critical systems. To address this gap, we introduce VHDL-REPOBENCH, a large-scale, cross-file, repository-level benchmark for assessing LLM capabilities on realistic VHDL design generation and analysis tasks. VHDL-REPOBENCH curates ~100 open-source VHDL repositori

    benchmark
  336. arxiv:2610.05373 · cs.CL
    Towards Unbiased On-Policy Distillation for Block Diffusion Language Models
    Zaiquan Yang, Fei Wei, Yong Wang, Yudong Han +5

    On-policy distillation (OPD) has emerged as an effective post-training paradigm for language models, with recent efforts extending it to block diffusion language models (BDLMs). However, existing studies focus almost exclusively on small block sizes, leaving distillation into student models with larger blocks underexplored. In this work, we investigate this regime and reveal two critical optimization biases that induce severe training instability. First, mismatched block boundaries between teacher and student cause \textbf{\textit{context misalignment}}, providing distorted supervisory signals

    post-trainingbenchmark
  337. arxiv:2610.05370 · cs.AI
    EnGRICH: Enhancing Generative Reward Modeling with Critiques from Humans
    Xuancheng Li, Beining Wang, Haitao Li, Heng Wang +6

    Generative reward models (GRMs) are important for LLM optimization. Unlike scalar reward models, GRMs generate natural-language critiques alongside preference judgments, providing finer-grained evaluation signals. Their effectiveness depends heavily on critique reliability. However, existing GRM training typically uses final preference correctness as outcome supervision. Because the preference outcome space is highly constrained, unreliable critiques can still yield correct outcomes and thus be reinforced. Recent work leverages human critiques for process supervision, but such critiques are sc

    benchmark
  338. arxiv:2610.05369 · cs.AI
    AutoDP-LLM: Automating Data Pre-processing for Intrusion Detection Systems using Large Language Models
    Bao-Phong Nguyen, Gia-Khanh Pham, Thai-Duong Do, Mai Xuan Trang +6

    The increasing complexity and scale of modern cyber-attacks demand intelligent and computationally efficient Intrusion Detection Systems (IDS). However, designing effective data pre-processing pipelines traditionally involves substantial trial-and-error effort and repeated evaluation of alternative configurations. For large, high-dimensional network traffic data, this process can create a significant computational burden. In this work, we propose AutoDP-LLM, an automated pre-processing framework designed to reduce manual pipeline development and computational overhead. Specifically, AutoDP-LLM

    benchmark
  339. arxiv:2610.05367 · cs.LG
    AIProver: Agentic Auto-Formalization of Mathematical Research via Certificate-Driven Evolving Harness
    Prithwish Jana, Viet Bach Hoang, Logan Luna, Viresh Pati +8

    Proof auto-formalization translates natural-language (NL) theorems and proofs into a formal language (FL) such as Lean, enabling mechanical verification. Despite rapid progress, research-level proofs often depend on concepts missing from leading proof assistant libraries (e.g., Lean's Mathlib), and successful compilation does not guarantee that a translation preserves the theorem's meaning or the proof's reasoning. Furthermore, aligned NL-FL training data are scarce, and leading agents often rely on costly frontier models and manually engineered harnesses. To address the above issues, we prese

    agentic
  340. arxiv:2610.05353 · cs.LG
    FACET: Factorized Asymmetric Conditioning for Efficient Transport in High-Fidelity Fluorescence Microscopy Synthesis
    Sazan Mahbub, Caleb N. Ellington, Eric P. Xing

    Fluorescence microscopy reveals where proteins localize, but only a limited number of proteins can be imaged in the same cell; generating these images from amino-acid sequence and the cell's morphological context enables in silico localization of unimaged proteins. The two conditions, however, play asymmetric roles: morphological context is spatially aligned with the target, whereas sequence is non-spatial and must specify protein-dependent localization within it, with recurring coarse patterns shared across proteins and finer protein-specific variation. Existing generators condition on both j

    semantic memory
  341. arxiv:2610.05352 · cs.LG
    Rethinking Tabular Foundation Models On Data Streams
    Nilesh Verma, Daniel Nowak-Assis, Afonso Lourenço, Albert Bifet +3

    Tabular foundation models (TFMs) outperform established machine learning models on tabular benchmarks through in-context learning. Building on this success, interest is growing in applying them to data streams, where data arrive continuously and evolve over time. On a stream, a TFM adapts by updating its context rather than its parameters, so its accuracy and cost depend on which examples it keeps and how often it rebuilds its context. We therefore present a systematic study of TFMs on data streams, covering memory management, computational cost, and stream-specific challenges such as concept

    memorybenchmark
  342. arxiv:2610.05350 · cs.LG
    Task Inference Beyond Least Squares in Behavioral Foundation Models
    Kuan-Hsun Tu, Chien-Sheng Chiang, Hsin-Wei Chen, Ping-Chun Hsieh +1

    Behavioral Foundation Models (BFMs) aim to solve a wide range of downstream tasks without test-time policy learning by inferring a task vector from the reward function. While efficient, the retrieved policies are often suboptimal because of how this task vector is inferred, typically with ordinary least squares (OLS). OLS minimizes reward reconstruction error but leaves the ordering of rewards unconstrained, which can bias the successor measure of the retrieved zero-shot policy away from that of the optimal policy. In this work, we propose BLS, an efficient test-time inference method that bala

    embodiedmanipulationhumanoidbenchmark
  343. arxiv:2610.05349 · cs.CV
    Learning Conditional Source Distribution via Flow Reversal for Temporal Flow Matching
    Kuan-Hsun Tu, Hsuan-Chi Liu, Jia-Wei Liao, Chien-Sheng Chiang +1

    We introduce CNP-Flow, a flow matching framework for temporal generation that learns conditional source distributions through flow reversal. Whereas standard conditional flow matching (FM) incorporates conditioning through the vector field and draws source samples from a standard Gaussian, CNP-Flow uses a conditional noise predictor (CNP) to produce an isotropic Gaussian source for each temporal condition. The CNP is supervised by source samples obtained through flow reversal, which maps observed targets backward through a pretrained FM model. A three-stage pipeline pretrains the FM model, tra

    embodiedfranka
  344. arxiv:2610.05346 · cs.LG
    Reflections and Fragments: Securing LLMs Against Sequential Mosaic Attacks
    Emanuele La Malfa, Saar Cohen, Gabriele La Malfa, Mickel Liu +3

    Self-play red-teaming improves language-model safety by pitting attacker and defender roles against each other in a zero-sum game. However, real adversaries increasingly use mosaic attacks: multi-turn sequences whose individual fragments are innocuous in isolation yet assemble into a harmful payload. We develop a theory of mosaic defense that characterizes what is required to prevent such attacks without sacrificing helpfulness. We first show that no fixed bounded window of recent prompts is sufficient in general: safety-relevant information may occur arbitrarily far back in the interaction. W

    self-play
  345. arxiv:2610.05343 · cs.CL
    MemStrata: 95% and 90.91% Source-Aware Accuracy on LongMemEval-500 and LoCoMo-1540 with a Local Qwen 3.8 27B Q4_K_M Reader
    Neeraj Yadav

    An adequate conversational answer may differ from a short or incomplete benchmark reference. To measure adequacy against the recorded history we prefer source-aware grading, in which the judge checks the reference against the full source before assessing system-blinded answers; original reference-only grading is reported alongside. With a local Qwen 3.8 27B Q4_K_M reader and a 24,000-token evidence ceiling, MemStrata CL1 scores 475/500 (95.0%) on LongMemEval-S and 1,400/1,540 (90.91%) on LoCoMo categories 1-4 under source-aware GPT-5.5 adjudication, against 463/500 (92.6%) and 1,205/1,540 (78.

    benchmarkleaderboard
  346. arxiv:2610.05342 · cs.CV
    IRSTD-Agent: Agentic Infrared Small Target Detection via Zoom-Guided Interaction Learning
    Jiawen Xi, Yu Zhang, Tianyi Zhao, Zhu Liu +2

    Infrared small-target detection plays an important role in maritime monitoring and aerial surveillance. Although multimodal large language models (MLLMs) offer promising capabilities for visual understanding, existing MLLM-based approaches struggle to precisely localize infrared small targets. In this paper, we propose IRSTD-Agent, an agentic framework for infrared small target detection through dynamic visual search. The framework enables an MLLM to adaptively determine where and at what scale to inspect an image and progressively gather fine-grained visual evidence for precise target localiz

    agentic
  347. arxiv:2610.05341 · cs.CV
    WILLIE: A Unified Framework and Benchmark for Wound Classification, Segmentation, and Localization
    Gopi Trinadh Maddikunta, Shannan Hamlin, Hsin-Mei Chen, Kimaya Barnes +1

    Chronic wound management affects over 8.2 million patients in the United States and imposes substantial clinical and economic burden. Clinical wound assessment commonly involves three coupled tasks: identifying wound type, delineating wound boundaries, and localizing the wound region for measurement and monitoring. Despite this clinical coupling, existing machine learning approaches typically address wound classification, segmentation, and localization using separate models. We present WILLIE, a unified framework and benchmark for wound classification, segmentation and localization that enable

    benchmark
  348. arxiv:2610.05334 · cs.LG
    AgentDiscover: Autonomous Discovery with Minimal Search Scaffolding
    Mahdi Farahbakhsh, Ilan Sela, Fatemeh Doudi, Vishnu Teja Kunde +3

    Frameworks that use large language models for scientific discovery typically rely on a fixed, human-designed algorithm that decides what the model sees at each step, leaving the model only the role of proposer. The model knows nothing of the search beyond what it is shown. As models grow more capable, a question arises: does a search strategy chosen by a human before the run scale better than promoting the model from proposer to planner and letting it own the search? The Bitter Lesson suggests that choosing the strategy in advance is the kind of hand-designed structure that general methods eve

    memoryagent
  349. arxiv:2610.05331 · cs.RO
    VAMPS: Visual and Motor Policies from Sampling-Based Planning
    Mohamed Yassine Kabouri, Pietro Noah Crestaz, Quang-Nam Nguyen, Qilong Cheng +2

    Learning robot policies directly on physical systems remains difficult because data collection is costly and policy exploration can be unsafe. We introduce Visual and Motor Policies from Sampling-Based Planning (VAMPS), a framework that uses Model Predictive Path Integral (MPPI) control to train reusable policies without human demonstrations. VAMPS supports two training modes. For one-step proprioceptive policies, it operates iteratively in simulation: the policy warm-starts MPPI, and the refined trajectories provide new supervision as the policy changes. A learned terminal value improves shor

    action chunkingiterative refinement
  350. arxiv:2610.05329 · cs.LG
    Understanding the Weight Averaging Mechanism in LLM Training for Post-Training Quantization
    Hanzhang Wang, Tianqi Shen, Zonglin Liu, Junze He +2

    Large language models (LLMs) are typically pretrained in high precision but increasingly deployed with low-precision post-training quantization (PTQ). Recent studies have shown that using weight averaging during pretraining can improve PTQ performance compared with learning-rate decay, suggesting that it might provide a simple way to improve the pretraining-to-quantization transition. But the mechanism behind weight averaging remains insufficiently explained. This leads to inconsistent and fragile performance gains, thereby preventing practitioners from applying such a technique confidently. A

    post-training
  351. arxiv:2610.05326 · cs.CV
    Riemannian Shape Analysis of the Corpus Callosum in Kendall Space: Aging and Alzheimer's Disease
    Olakunle S. Abawonse, Fatou Fall

    The corpus callosum (CC) is a major white-matter structure and a well-established marker of brain aging, but most studies quantify it using scalar summaries that discard its boundary geometry. We present a Riemannian shape-space framework for analyzing age-related morphological change in the midsagittal CC, applied to the OASIS-1 cohort. Each contour is represented by $128$ landmarks and embedded into Kendall shape space, where translation, rotation, and scale are removed. We derive a multivariate geodesic regression with exact Riemannian gradients and use the fitted age-velocity field to loca

    benchmark
  352. arxiv:2610.05324 · cs.RO
    CoDance: Learning Reactive and Compliant Human-Humanoid Interaction from Video
    Zhuoqun Chen, Shucheng Jia, Boyuan Chen

    Partnered human-humanoid interaction couples locomotion with continuous physical contact. A humanoid needs to coordinate with a person's motion while responding to interaction forces and maintaining stable and natural movement. We present CoDance, a framework for learning reactive and compliant human-humanoid interaction from video. We study partnered dancing as a challenging instantiation, where a humanoid coordinates its footsteps with a moving partner and maintains continuous two-hand contact. Given a single video of two human dancers, CoDance retargets their motions into a robot reference

    humanoid
  353. arxiv:2610.05323 · cs.AI
    Grammar-Guided Code Watermarking with Green Temperature
    Hyundong Jin, Hyeseon An, Soohan Lim, Yo-Sub Han

    Large language model watermarking embeds detectable statistical signals during decoding, but the resulting changes to token probabilities can degrade generation quality. This trade-off is particularly important for code, where small changes in token selection can break syntax or alter program behavior. Existing code watermarking methods mitigate this risk through entropy-based insertion or syntax-aware token selection, but they do not directly construct the watermark over the set of continuations admitted by the current grammar state. We propose Grammar-Guided Code Watermarking with Green Temp

    benchmark
  354. arxiv:2610.05318 · cs.LG
    Robust Parameter-Efficient LLM Adaptation on Analog Hardware
    Jindan Li, Zhaoxian Wu, Tianyi Chen

    Analog in-memory computing is a promising platform for on-device execution of large language models because it performs matrix--vector multiplications (MVMs) in memory and in parallel, reducing data movement. However, limited digital-to-analog converter precision, input noise, and finite conductance states can degrade model accuracy, while full-model retraining to address these effects can be costly. We develop an optimizer-agnostic, parameter-efficient adaptation method based on Low-Rank Adaptation (LoRA), keeping the pretrained weights stored on analog arrays fixed while training the LoRA we

    memory
  355. arxiv:2610.05306 · cs.CV
    Kinematics-Centric Continuous Sign Language Retrieval with Gloss-Guided Boundary-Aware Alignment
    Chang Liu, Ke Han, Davide Talon, Elisa Ricci +1

    Sign language-text alignment remains a fundamental challenge for text-driven sign language understanding. Existing methods predominantly rely on appearance-heavy RGB representations, which entangle motion semantics with visual variations and lead to ambiguous motion-language grounding. In this paper, we reformulate sign language-text alignment in a structured kinematic space and propose a kinematics-centric framework that adopts 3D SMPL-X motion as the primary representation. By explicitly modeling the kinematic dynamics of signing in a unified motion space, our approach reduces reliance on ap

    benchmark
  356. arxiv:2610.05305 · cs.LG
    Characterizing Parallelism Strategies in LLM Inference: Fundamental Compute-Communication Trade-offs
    Javad Mirzaei, Jeebak Mitra

    Large Language Model (LLM) inference has become the dominant workload in modern AI systems, requiring serving infrastructures to maximize throughput while meeting strict latency Service-Level Objectives (SLOs). Since state-of-the-art LLMs exceed the compute and memory capacity of a single GPU, inference is commonly distributed across multiple GPUs using tensor parallelism (TP), pipeline parallelism (PP), or hybrid parallelism (HB). However, selecting the most effective parallelism strategy remains challenging due to complex interactions among computation, communication, pipeline utilization, s

    memory
  357. arxiv:2610.05303 · cs.LG
    ASCENT: Online Test-Time Training of Long-Horizon Agents via Self-Distillation of Verified Experience
    Haodong Lu, Dong Gong

    A large language model (LLM) agent solves long-horizon tasks through many reasoning-action turns, with one verification signal at termination. Deployed agents face streams of related tasks, making their trajectories a natural resource for improvement. In-context adaptation agents store reflections, memories, or skills as text, so reuse depends on retrieving the right experience and on a frozen policy executing it. We study Online Agentic Test-Time Training (OaTTT), which trains the LLM's weights on its own execution trajectories during deployment. The agent executes each task once, in one pass

    memoryagentagentic
  358. arxiv:2610.05300 · cs.AI
    MESH-Harness: Self-Improving Agent Harnesses via Bandit-Guided Compositional Evolution
    Zhiwei Shang, Yu Huo, Mingrong Gong, An Yan +5

    An agent harness is the code that organizes context, maintains state, and coordinates tool calls for a language model. We study how to improve the harness under a limited evaluation budget while keeping model weights fixed. Our method, MESH-Harness, organizes each harness into functional modules with explicit role-specific interfaces, allowing alternative implementations of each module to be substituted and recombined. It uses shared module representations and full-covariance LinUCB to score candidate combinations based on predicted performance and exploration value. Mixed-start coordinate asc

    retrieval-augmentedagentself-improving
  359. arxiv:2610.05295 · cs.AI
    Readable Before Actionable: Causal Tracing of Indirect Prompt Injection
    Zhe Yu, Wenpeng Xing, Xingxing Yang, Meng Han

    Indirect prompt injection causes LLM agents to follow commands embedded in external data. A probe may distinguish instructions from data without identifying a state edit that changes the next action. We study this gap through counterfactual role probes, component-wise activation patching, and separate interventions on AgentDojo trajectories. Role decoding survives changes in content and format. In controlled Qwen tests, it precedes strong tool-choice effects from patches along an independently estimated role direction. On AgentDojo, directions estimated from hijacked and resisted training traj

    llm agent
  360. arxiv:2610.05293 · cs.CV
    BossouChimpanzee: Long-term Chimpanzee Video Dataset
    Daniel Schofield, Susana Carvalho, Vladimir Iashin, Andrew Zisserman +9

    We describe the BossouChimpanzee video dataset, a unique long-term visual record of wild chimpanzees at an outdoor laboratory for field experiments in Bossou, Guinea, spanning three decades (1988-2018) and comprising over 1,200 hours of continuous video recordings collected through collaborative fieldwork and research. In this paper, we outline the history and scientific contributions of the experimental paradigm and video archive, provide key statistics and details on the structure of the main video dataset, and release an initial ~74h snapshot, BossouChimpanzee70h, covering 23 identified ind

    benchmark
  361. arxiv:2610.05292 · cs.LG
    Erased, Rerouted, or Rescaled? Post-Training and the Causal Quotient of a Language Model's Belief State
    Weihan Li, Tianshi Zheng, Junhao Wu, Xinlei Chen

    What happens to information a pretrained model already encodes when post-training no longer rewards using it? The common language of representation compression conflates three fates: information may be erased, rerouted away from the decision while still represented, or rescaled to occupy less variance while still represented and used. We make these fates identifiable in models whose pretraining recovers Bayesian belief states. A reward that reads only a coarse function of the hidden state defines an exact reward-null kernel. The kernel lets us separately measure whether the information remains

    post-training
  362. arxiv:2610.05284 · cs.AI
    Fusion is the New Mutation: Bandit-Guided Evolution on Workflow Graphs
    Zhiwei Shang, Jiahang Sun, Mingrong Gong, Mingze Kong +8

    Automated agentic workflow optimization relies on costly evaluations, making it essential to allocate a limited evaluation budget effectively. Multi-parent fusion can reuse designs from previously discovered workflows, but identifying promising parent combinations requires learning from limited fusion feedback. We introduce DAGO (Directed Acyclic Graph Optimization), a contextual-bandit-guided framework that learns which parent workflows to fuse under a limited evaluation budget. DAGO formulates each candidate parent combination as an arm, represented by pretrained embeddings of its constituen

    agenticbenchmark
  363. arxiv:2610.05281 · cs.AI
    When Agent Context Goes Stale: Incoherence in Volatile Agent Context
    Yingying Liu, Junzhou Fang, Chenxiong Qian

    Modern agents increasingly ground their reasoning in observations returned by tools, such as file contents read from a workspace. However, the data sources underlying these observations may later be modified by users, other agents, or external tools, while the model retains only the stale content in its context window. Existing agent runtimes provide little support for notifying the model that a previously observed fact has become stale, causing agents to reuse outdated observations and make incorrect claims about the current workspace state. We propose Concord, a context coherence framework t

    agentbenchmark
  364. arxiv:2610.05278 · cs.AI
    When Verifiable Counts Depend on Wording: Auditing Wording Robustness in Instruction Following
    Qishi Zhan, Seoyeon Jang, Zihan Dong, Minxuan Hu +2

    Verifiable instruction-following benchmarks often express each constraint through one fixed template. We test whether scores remain stable when the operational requirement is unchanged but its wording varies. We introduce WISE, a matched evaluation suite and reporting protocol instantiated on exact word count, keyword inclusion exactly once, and an inclusive 8--12 word range. Across 100 matched tasks, up to thirteen models from seven providers, and repeated generations scored over the complete visible output, wording alone produces substantial compliance shifts. In an avoidance-family panel, f

    benchmark
  365. arxiv:2610.05274 · cs.CV
    Answer with Evidence: Consistency-Aware Grounded Visual Question Answering for Roadside Traffic Scenes
    Runwei Guan, Rongsheng Hu, Shangshu Chen, Ningwei Ouyang +8

    Roadside traffic reasoning requires every free-form textual claim to be backed by visual evidence. Existing grounded multimodal large language models (MLLMs) frequently exhibit say-point mismatch, in which the textual answer contradicts the bounding boxes the model localizes. Evaluation metrics that score answers and boxes separately leave this failure unpenalized. We trace the mismatch to the conventional answer-then-ground factorization, which commits to a numerical claim before any object is enumerated. To measure it, we build RoadSceneVQA-G, a benchmark of 34.7K question-answer pairs in wh

    benchmark
  366. arxiv:2610.05273 · cs.RO
    When and What to Prune? Stage-Aware Visual Token Pruning for Efficient VLA
    Tianjun Shi, Haotian Xiong, Ziyu Gong, Qi Lu +1

    Visual token pruning is an effective way to accelerate vision-language models and is especially useful for vision-language-action (VLA) inference, where many visual tokens must be processed before predicting robot actions. Existing pruning methods usually estimate which tokens can be pruned based on attention scores or feature diversity, retaining tokens that are either highly attended or visually different from others. However, most of them use fixed pruning schedules, such as pruning once at a preset layer or pruning at uniformly spaced layers. Such schedules can be risky for VLA models, bec

    vision-language-actionvlavla modellibero
  367. arxiv:2610.05270 · cs.LG
    Synergizing Drone Delivery Order Pooling and Road Network Monitoring through Monitoring-Task Orderization
    Yulong Hu, Meng Xu, Sen Li, Nikolas Geroliminis

    This paper investigates the real-time dispatch of a shared drone fleet for on-demand food delivery and urban road network monitoring. We consider a courier-drone collaborative setting in which couriers transport orders to launchpads and drones complete the final delivery leg to kiosks. Drones may consolidate multiple origin-destination orders within one flight and make monitoring-aware route adjustments to collect real-time traffic information subject to delivery-time constraints. This yields a joint decision problem coupling dynamic order-to-drone matching, multi-order pooling, routing, and t

    multi-agent
  368. arxiv:2610.05269 · cs.LG
    A Unified Scaling Law for Time Series Foundation Models
    Xilin Dai, Yiding Liu, Zewei Dong, Jiang-Ming Yang +1

    We develop a Unified Scaling Law and a Unified Theory of Time Series Learning to understand how model capacity and historical information support forecasting. Across different lookback lengths and forecast horizons, we analyze 18,768 experimental cells from 21 checkpoints on 23 dataset-frequency tasks spanning six domains. Our empirical methodology integrates local resource relations into a parsimonious, fitted five-parameter law: capacity gains increase with history, context gains diminish toward saturation, and horizon effects enter as a common shift. Fitted without Toto 2.0, the law predict

    long-context
  369. arxiv:2610.05266 · cs.AI
    Who Is Your Agent Serving? Provider-Side Indirect Prompt Injection in Proactive Agents
    Rui Wang, Chao Wang, Xinchen Wang, Yufeng Zheng +2

    Proactive personal agents increasingly decide what to recommend, how to personalize advice, and what follow-up assistance to offer, creating a new user-decision attack surface for provider-side indirect prompt injection. We show that an external provider need not access private user context, compromise the agent, or gain additional permissions: by controlling only content associated with its own target, it can redirect an otherwise benign agent to advance that target, recruit legitimately available user context to justify it, and proactively reduce the friction of adoption. We characterize thi

    agent
  370. arxiv:2610.05265 · cs.LG
    Loopy: Low-Bit Quantization Framework for Looped Language Models
    Zeyu LI, Yipu ZHANG, Jintao Chen, Xin LI +1

    Looped language models provide a parameter-efficient way to scale iterative test-time computation by repeatedly executing a shared recurrent core. Post-training quantization (PTQ) can reduce the memory footprint and inference cost of looped language models, but errors introduced by a quantized shared core affect subsequent cores. Among PTQ methods, channel scaling and orthogonal rotations preserve the floating-point computation while producing representations with different quantization quality. We find that quantization configuration candidate rankings can change with recurrent depth, motivat

    memorypost-training
  371. arxiv:2610.05256 · cs.AI
    Learning from imperfect teachers for low-resource acoustic generalization
    Shuanglin Li, Ruxiao Qian, Jian Liu, Haijun Lin +2

    Knowledge distillation (KD) improves low-resource acoustic learning by enriching one-hot supervision with the softened predictive distribution of a fixed teacher network. However, a teacher trained with limited or imbalanced annotations may produce a biased distribution whose components are not uniformly reliable. Although this distribution can still encode useful knowledge, direct full-distribution matching may also transfer teacher-induced biases, thereby distorting the student's decision boundary and degrading its generalization performance. To address this limitation, we propose Boundary-A

    benchmark
  372. arxiv:2610.05249 · cs.CV
    ArticuTable: Generating Instance-Level Interactive Rigid-Articulated 3D Tabletop Scenes from a Single Image
    Kai Lv, Yibo Yin, Lijun Guo, Heng Fan +2

    Embodied agents benefit from 3D environments that combine visual fidelity to real-world observations with physical interactivity. Existing single-image tabletop reconstruction methods recover plausible scene geometry but typically represent objects as monolithic rigid bodies, limiting interaction to whole-object rigid motion and precluding executable part-level articulation. Meanwhile, recovering a scene layout consistent with the input view remains challenging because a single observation may admit multiple plausible pose-scale configurations. We present ArticuTable, a single-image 3D tableto

    embodiedembodied agent
  373. arxiv:2610.05247 · cs.CL
    templar: agentic induction and evolution of standardized radiology reporting templates from large-scale clinical corpora
    Xiaotian Hu, Mingxuan Liu, Zhonghan Wang, Xinfeng Zhang +8

    Structured radiology reporting mitigates the heterogeneity of free-text reports, yet its benefits depend on high-quality reporting templates. In practice, such templates are conventionally built through labor-intensive expert consensus and therefore vary across institutions and lag behind evolving clinical practice. Large language models (LLMs) enable automated template induction, but existing approaches remain limited: single-LLM induction is constrained by context length, and the corpus-scale method ASTAR produces a static, closed-corpus template without external grounding or downstream adap

    knowledge graphagentagentic
  374. arxiv:2610.05241 · cs.AI
    StateWise: Diagnosing and Repairing Persistent Operational State Before Agent Actions
    Yongyuan Peng, Zhou Feng, Tongying Wu, Jiahao Chen +4

    LLM agents combine reasoning, tool use, and persistent memory to support work across tasks by reusing stored operational records as premises for later actions. However, environmental or requirement changes can invalidate these records, while existing action review, provenance tracking, and clarification mechanisms may leave the underlying persistent state uncorrected. Our audit of coding-agent trajectories identifies candidate failure chains in which invalid records are reused, leading to task failures and unsafe modifications. We propose StateWise, a framework for diagnosing and repairing per

    memorypersistent statepersistent memoryagentllm agenttool use
  375. arxiv:2610.05240 · cs.LG
    Pythia: Toward Foundation World Models for Multimodal Time Series
    Xilin Dai, Hongzhou Chen, Yifan Hu, Yiding Liu +2

    Time-series foundation models offer a unified approach to forecasting across heterogeneous domains. Textual context and auxiliary observations provide complementary information about temporal dynamics, yet reusable multimodal predictive representations remain underexplored. We introduce Pythia, a foundation world model that learns context-conditioned latent dynamics across datasets through a joint-embedding predictive architecture. A stop-gradient numerical reference guides contextual corrections to predicted future states. A separate probabilistic decoder then adapts to the frozen predictive

    world modellatent dynamicsleaderboard
  376. arxiv:2610.05237 · cs.AI
    Settling the Computational Complexity of Max-Min Allocation with Ternary Valuations
    Thi Ngoc Anh Vu, Trung Thanh Nguyen, Khaled Elbassioni, Jörg Rothe

    We study the problem of computing an allocation of indivisible items that maximizes egalitarian welfare, i.e., the utility of the worst-off agent, when agents' item values or marginal values belong to a small set. For additive valuations with values in $\{p,q\}$, where $q>p>0$ and $\gcd(p,q)=1$, we give a polynomial-time algorithm when $p=2$ and prove constant-gap hardness when $p\geq3$, already with exactly three high-valued goods per agent. We also give an $\sqrt{3/2}$-approximation for common positive bi-valued additive valuations. For mixed additive valuations in $\{-p,0,c\}$, where $p\in\

    agent
  377. arxiv:2610.05233 · cs.CV
    PixReenact: Pixel-Conditioned Causal Video Diffusion for Streaming Head-Avatar Reenactment
    Gavriel Habib, Dvir Samuel, Or Shimshi, Rami Ben-Ari

    Streaming head-avatar reenactment aims to animate a reference image according to a live driving video, requiring robust motion transfer, long-term identity stability, and low latency. Existing methods often rely on specialized identity or motion representations, which can discard useful visual information and inherit failure modes from external extractors. In addition, many recent diffusion-based reenactment methods use offline, clip-based generation, jointly processing and denoising an entire video clip before producing its output, making continuous low-latency streaming difficult. We introdu

    benchmark
  378. arxiv:2610.05230 · cs.RO
    Vela: Scaling Vision-Language-Action Models with Adaptive Action Curve Parametrization
    Yifan Li, Jiaxu Wang, Dongming Wu, Yicheng Jiang +3

    Most vision-language-action models represent future motion as fixed-rate action chunks, tying temporal resolution and prediction horizon to a fixed output budget. This pointwise representation wastes capacity on highly correlated neighboring actions, leaves temporal continuity and smoothness to be learned implicitly, and forces a tradeoff between long-horizon coverage and the local precision required for contact-rich manipulation. To address these limitations, we introduce Vela, a vision-language-action foundation model that represents future robot behavior as continuous trajectories. Vela com

    vision-language-actionembodiedmanipulationlibero
  379. arxiv:2610.05229 · physics.optics
    Integrated robust universal linear optics based on white-boxed multi-plane light conversion
    Xin-Yu Song, Lan-Tian Feng, Pan Gong, Yu-Yang Ding +2

    The integrated universal linear optical processor realized via multi-plane light conversion (MPLC) features low hardware complexity and high fabrication robustness, suitable for diverse photonic processing tasks. However, the lack of validated calibration protocols limits its universality and potential. Here, we propose a machine-learning-based calibration method and verify it using an eight-mode silicon photonic processor composed of interleaved multiport directional couplers and phase-shifter arrays. We characterize coupler transfer matrices and current-phase responses of individual phase sh

    silicon photonicquantum photonic
  380. arxiv:2610.05223 · cs.AI
    Look Before You Leap: Thermodynamic Arbitration of Parametric and Non-Parametric Knowledge in LLM Agents via Self-Regulating Memory Architectures
    Akash Das, Ishan Roy

    The architecture of modern LLMs consists of a profound cognitive polarization. LLMs possess implicit intuition encoded in their parameters, yet rely on a disconnected, explicit mechanism to access the outside world. Agentic frameworks have not bridged this gap; instead, models are often compelled into pathological "induced amnesia." Under the prevailing "Retrieve-Always" paradigm, agents must distrust their internal knowledge, making every user interaction a "tabula rasa" event that must be checked externally. This creates reflexive dependence that can be thermodynamically wasteful, cognitivel

    memorymemory architectureagentllm agentagentic
  381. arxiv:2610.05219 · cs.AI
    Safe Context Switching for Agents in the Wild: Mitigating Subspace Interference via Orthogonal Adaptation
    Akash Das, Ishan Roy

    Most Large Language Models exhibit a fundamental tension between two sequential tasks, such as logical reasoning and safety alignment. The high-variance internal states required for sophisticated Chain-of-Thought (CoT) deduction can geometrically interfere with latent representations encoding safety constraints. We identify this phenomenon as Sequential Subspace Interference, showing that standard fine-tuning on logical tasks such as multi-step mathematics and code generation can result in a 23.3% interference penalty on alignment benchmarks, substantially weakening the model's safety priors.

    benchmark
  382. arxiv:2610.05211 · cs.AI
    Image Synthesis as an Intermediate for Controllable Time Series Generation
    Haochen Yuan, Jing Xie, Yunbo Wang

    Semantic-driven time-series generation offers a promising way to improve downstream learning in few-shot forecasting, but directly generating numerical sequences from language often fails to preserve the intended temporal structure. We propose VisualBridge, which uses time-series plots as a visual intermediate to bridge high-level temporal semantics and numerical sequences. An MLLM first converts plotted series into structured semantic representations, enabling explicit control over temporal properties such as trend, seasonality, and volatility. We then learn a semantic editing policy with dow

    benchmark
  383. arxiv:2610.05207 · cs.CV
    F$^2$ SLAM: Turning Feed-Forward Geometry into Persistent Factors for SLAM
    Zhisong Xu, Fan Zhu, Jiawei Qian, Ziyu Chen +2

    Feed-forward 3D models provide strong multi-view geometric priors, while on- line simultaneous localization and mapping (SLAM) relies mainly on local mea- surements and can accumulate drift over long sequences. Existing attempts to combine the two typically treat feed-forward predictions as an external geomet- ric state that is aligned or fused with the online estimate after the fact, which keeps broader multi-view evidence outside the optimizer that refines the SLAM state. We present F2SLAM, which instead converts feed-forward geometry di- rectly into optimization-native target-weight measure

    benchmark
  384. arxiv:2610.05200 · cs.LG
    Learning without Overwriting: A Theory of Self-Distillation and Supervised Fine-Tuning in Continual Reasoning
    Shinichi Uemura, Taiji Suzuki

    On-policy self-distillation (OPSD) of large language models (LLMs) has demonstrated the ability to improve reasoning capabilities while preserving previously acquired knowledge. Despite substantial empirical success, the dynamics of OPSD in continual reasoning remain incompletely understood. Modeling LLM reasoning as search over a directed acyclic graph, we provide a unified theoretical analysis of both the dynamics of post-training---OPSD and supervised fine-tuning (SFT) in continual learning---and the impact of pre-training on subsequent performance. Our findings establish three key insights

    post-training
  385. arxiv:2610.05198 · cs.AI
    Same Predictions, Different Harms: Causal Auditing of Patient World Models
    Yicheng Qi, Xiyi Xiong

    Patient world models used for clinical trial simulation can agree on transition kernels and arm-specific risks, yet disagree on the fraction of patients harmed by switching treatment---the counterfactual quantity that matters for intervention-aware reasoning. We audit this reliability gap in a two-stage shared-response SCM: a categorical intermediate health state is followed by common terminal care. Under independent stages, the sharp harm interval has closed-form endpoints for at most three intermediate states, with an exactness boundary at four states. Declared dependence and response-mismat

    world model
  386. arxiv:2610.05197 · cs.AI
    From Scientific Observations to Mechanisms: Benchmarking Hypothesis Generation by AI Scientists
    Xiaxun Xie, Qingqing Long, Meng Xiao, Wei Ju +3

    Data-driven mechanistic hypotheses are essential to scientific discovery because they explain how underlying processes produce observed phenomena. AI agents and AI scientists increasingly support scientific data analysis. However, their ability to turn empirical findings into mechanistic hypotheses remains insufficiently examined. To address this gap, we introduce MechHypoBench, the first benchmark for evaluating whether AI agents and AI scientists can generate such hypotheses from empirical data. It combines paper-derived mechanisms from 14 scientific fields with real-world datasets containin

    ai agentbenchmarkevaluation framework
  387. arxiv:2610.05195 · cs.CV
    Long-MDR: Long-Context Reinforcement Learning for Multimodal Deep-Research Agents
    On Tai Tang

    The next generation of multimodal research agents must reason over long-lived research histories rather than short model completions. During a single task, an agent may repeatedly search the web, inspect visual evidence, revisit earlier hypotheses, and accumulate tens of thousands of tokens of multimodal context. Despite this trend, online RL for multimodal research agents remains largely confined to shorter contexts and interaction horizons. We push online RL training to 128k context and 75+ tool-interaction turns. To our knowledge, this is the first online multimodal deep-research RL study t

    long-contextagentbenchmark
  388. arxiv:2610.05185 · cs.CV
    Recurrent Latent Visual Search for GUI Grounding
    Kaiyu Wu, Beichen Zheng, Weiyao Huang, Keze Wang

    GUI grounding is a critical capability for GUI agents powered by vision-language models, helping them execute user instructions by locating the corresponding elements in screenshots. Single-step grounding struggles with small elements and dense layouts, motivating multi-step visual search. However, existing approaches commonly rely on textual reasoning misaligned with visual space or costly multi-round interactions with external visual tools. To make multi-step visual search an explicit spatial process within the model, we propose ReLaViS, which performs Recurrent Latent Visual Search in a sin

    benchmark
  389. arxiv:2610.05182 · cs.LG
    TIRMamba: A Thermal-Prior-Modulated State-Space Network for Sub-Million-Parameter Infrared Image Super-Resolution
    Chun-An Lin, Tsung-Jung Liu, Yen-Chieh Ouyang

    Infrared image super-resolution is currently led by Mamba-based networks with 26 to 37 million parameters, which are difficult to deploy on the airborne and handheld platforms where thermal imaging is most needed. This paper presents TIRMamba, a network with 896K to 910K parameters for single-channel thermal imagery. A Thermal Prior Highway computes gradient, local-contrast and spectral cues once at the input and, through one adapter per residual group, modulates a weight-tied bidirectional state-space trunk and gates its dual-scale detail branch; a tri-path reconstruction adds the learned res

    benchmark
  390. arxiv:2610.05180 · cs.RO
    VICON: Visual-Inertial-Contact based Hand-Object Tracking for Manipulation Datasets
    Yubin Jeon, Uiseong Shin, Hwanchul La, Jaeseong Kang +2

    Learning dexterous manipulation benefits from human demonstration datasets that capture diverse and natural hand-object interactions. In particular, contact points and forces provide supervision on where and how strongly to interact, which cannot be fully captured by motion trajectories alone. However, methods for jointly capturing hand and object motion, contact points, and forces remain limited. Moreover, severe occlusion from hand-object interaction challenges accurate tracking of both hands and objects. To address these limitations, we present a Visual-Inertial-CONtact based hand-object tr

    manipulationdexterousgrasp
  391. arxiv:2610.05176 · cs.AI
    AECG: Asymmetric Experience Consolidation and Governance In Multi-Agent Systems
    Ao Tian, Jialong Liu, Daqi Zheng, Xin Sun +6

    Large language model (LLM)-based multi-agent systems increasingly rely on memory to transform execution trajectories into reusable procedural knowledge. Yet repeated retrieval also makes memory errors persistent: memory pollution arises when outdated, weakly supported, or spuriously successful procedures become recurring components of future reasoning. Multi-agent execution introduces an additional structural risk. Scope collapse occurs when procedural knowledge escapes the coordination scope in which it was shown effective and is repeatedly reused at incompatible decision levels, allowing loc

    memoryagent memorymulti-agentagent frameworkagent systembenchmark
  392. arxiv:2610.05170 · cs.CL
    Verification Trap: Understanding Test-Time Selection Failures under False Premises in Code Generation
    Feng He, Hejia Wang, Linghao Meng, Ming Gao +1

    Test-time compute has become a central way to improve code generation: systems sample multiple candidate programs and use verifier-visible evidence to select the final output. This paradigm implicitly assumes that the verifier provides a corrective signal independent from the generator. We challenge this assumption under misleading task premises. When the generator and verifier share a false premise, they become coupled through a mistaken belief: the generator produces premise-consistent shortcuts, while the verifier supplies evidence that fails to expose them. Consequently, the selector may c

    benchmark
  393. arxiv:2610.05167 · cs.AI
    CreativeFlow: A One-to-Many Analogical Relation Transfer Method for 3D Asset Generation
    Xuechen Li, Shuai Zhang, Nanxuan Zhao, Qing Chen

    Inspired by cognitive science, we present CREATIVEFLOW, an analogical generation framework that explicitly models analogical divergent thinking to mitigate creative homogenization in text-to-3D pipelines. Our method derives a series of meaningful yet relationally similar source-target asset pairs, each featuring distinct geometric configurations. Expert evaluations demonstrate that our framework substantially enhances creative novelty and visual fascination. This workflow and its resulting assets establish a foundational dataset and benchmark for future relation-aware 3D model training.

    benchmark
  394. arxiv:2610.05166 · cs.RO
    A Safe Action Is Not Enough: Feasible-Future Decoding for Vision-Language-Action Policies
    Tu Nguyen, Matthieu Zimmer, Vu Anh Vu, Ziyi Wang +3

    A safe action is not necessarily a viable one. Under a frozen vision-language-action (VLA) policy, an action can be likely and locally admissible yet leave no policy-supported route to safe task completion. We call this the feasibility-likelihood gap: likelihood ranks the current action, whereas feasibility depends on the futures that remain after it. We derive the exact next-block marginal of the history-conditioned policy-environment trajectory law restricted to safe task completion. The derivation exposes a candidate-dependent feasible-future mass with two roles: its support records whether

    vision-language-action
  395. arxiv:2610.05163 · cs.AI
    Blocking at the Boundary: Auditing Long-Horizon Agents against Staged Prompt Injection
    Jingkai Liu, Yufei Han, Xiaoting Lyu, Wei Wang +1

    Long-horizon agents consume external content, invoke tools, and modify persistent state. Indirect prompt injection can exploit task-specific context, propagate across causally connected stages, and alter a consequential action while the workflow continues; we term this staged prompt injection. We build an automated, feedback-guided attack generation pipeline and apply it to Claude Code and Codex in their native runtimes. The confirmed attacks span eight workflow scenarios, seven attack goals, and six injection surfaces, showing that production agents are vulnerable to context-aware, multi-step

    persistent statebenchmark
  396. arxiv:2610.05162 · cs.AI
    Memadapter: Counterfactual Adaptation Against Memory-induced Sycophancy
    Ruqing Ning, Haibo Meng, Zhishang Xiang, Zerui Chen +3

    Long-term memory enables LLM-based agents to retain and reuse information across tasks and sessions, supporting personalization and long-horizon interactions. However, persistent memories can also induce sycophancy, causing agents to over-align with users' historical beliefs even when they are inaccurate, outdated, or inconsistent with objective evidence. Existing mitigation methods assume that memory-induced sycophancy originates from biased or incorrect memories and attempt to reduce this risk by filtering such memories at different stages of the memory pipeline. However, in the real world,

    memorybenchmark
  397. arxiv:2610.05161 · cs.AI
    Beyond Instruction Following: Learning Grounded Skill-Following with Skill Contracts
    Jianghan Shen, Zhenjie Liu, Yue Li, Jie Huang +9

    Instruction following typically enforces discrete, response-level requirements, whereas an expert-authored skill prescribes procedural requirements spanning multiple phases and environment interactions. Given such a skill, we train the executor to execute all required phases instead of focusing solely on the final answer. We therefore introduce Grounded Skill-Following, which requires an agent to execute a fixed, expert-authored skill across its required phases by grounding decisions in environment observations. To achieve verifiable procedural execution, we formulate each skill as a skill con

    agent
  398. arxiv:2610.05151 · cs.RO
    Recursive Self-Improvement of Visuomotor Policies through Local Recovery Supervision
    Yuzhi Zhang, Xinyu Liu, Yu Zhang

    Visuomotor policies can execute familiar tasks yet lack the corrective behavior needed after their own mistakes. We present a framework for recursive self-improvement through local recovery supervision. Each round audits the current policy, generates corrective demonstrations at supported failure states, and uses them to update the policy that drives the next round of collection. An offline auditor locates unresolved failures using coarse and dense temporal evidence and specifies observable repair goals. A fixed multimodal agent acts as a tool-using teacher, generating recovery actions through

    liberoagentself-improvementpost-training
  399. arxiv:2610.05141 · cs.CV
    SemCam: Semantic Camera Motion Control for Video Generation
    Janna Bruner, Omer Talmi, Ianir Ideses, Lior Fritz +2

    Controlling the camera relative to a moving subject in an existing video is challenging: behaviors such as maintaining a frontal view require the camera to adapt to the subject's changing position and orientation, making the desired trajectory difficult to specify in advance. Existing camera-controlled video-to-video methods typically rely on explicit trajectories or reference motions, which do not directly express these dynamic camera--subject relationships. We introduce semantic camera motion control, a novel video-to-video task in which a reference video and a target motion label specify th

    benchmark
  400. arxiv:2610.05140 · cs.AI
    AutoSciBench: Autonomous Benchmark Generation for Evaluating Scientific Agents
    Dongki Kim, Namkyeong Lee, Surag Nair, Carl Edwards +6

    As agents rapidly evolve, existing benchmarks can become saturated, limiting their ability to distinguish capabilities and reveal remaining failure modes. Particularly in scientific domains, constructing and updating benchmarks requires substantial time, labor, and domain expertise, making it difficult to keep evaluation aligned with advances in agent capabilities. We address this challenge by investigating whether scientific-agent benchmarks can be automatically generated and iteratively adapted as agent capabilities evolve. We introduce AutoSciBench, a framework that represents each task as

    agentagent benchmarkbenchmark
  401. arxiv:2610.05131 · cs.CV
    RoMod: Temporal Routing Modulation via Mixture-of-Experts for Video Anomaly Detection
    Chao Huang, Pengfei Wei, Benfeng Wang, Chengliang Liu +4

    Intermediate-layer features from multimodal large language models have shown strong potential for video anomaly detection (VAD), yet the origin of their discriminative power remains unclear. We study this question using sparse mixture-of-experts (MoE) models, whose explicit expert structure and sparse activation make their internal computation easier to inspect. With a fully frozen backbone and no additional training, we find that anomaly-related evidence is concentrated in a small set of experts. These experts recur across layers, spontaneously specialize in different anomaly types, and toget

    benchmark
  402. arxiv:2610.05129 · cs.CV
    Representation--Behavior Alignment for Explainable Weakly-Supervised Video Anomaly Detection
    Chao Huang, Pengfei Wei, Kaige Li, Chengliang Liu +3

    Multimodal Large Language Models (MLLMs) provide a natural way to make video anomaly detection more explainable. However, their final decisions do not always fully use the discriminative information contained in their hidden states, an issue we refer to as representation--behavior misalignment. We decompose this gap into a capacity component that measures discriminative information never aggregated into the readout position, and a directional component that measures the angular mismatch between the optimal and the native normal--abnormal axis at that position. Across multiple video anomaly det

    benchmark
  403. arxiv:2610.05127 · cs.LG
    Component-Level Evaluation of Adaptive PINN Training for CFD-Oriented Crystal Growth Simulation
    Niruta Chapagain, Rohit Raj, Bertwin Kurisinkal Shine, Aditya A S

    Physics-informed neural network (PINN) training minimizes a weighted combination of partial differential equation (PDE), boundary-condition, and initial-condition losses. Because adaptive methods modify these weights during training, their weighted total losses are not always directly comparable. We compare fixed-weight PINN, gradient-normalized PINN (GNPINN), and a rule-based adaptive controller (AgenticPINN) under matched settings on a heat-equation benchmark and a simplified Czochralski-oriented thermal-fluid problem. In the crystal-growth MLP experiment, adaptive control reduced the PDE re

    agenticbenchmark
  404. arxiv:2610.05125 · cs.LG
    Bayesian Entropy-based Reordering for Calibrated Diffusion Language Models
    Zhejun Jiang, Mijung Park

    Masked Diffusion Language Models (MDLMs) generate sequences by iteratively replacing masked tokens with model predictions. At each denoising step, the decoder chooses which positions are sufficiently confident to commit. Existing decoding methods typically rely on softmax confidence, which can be miscalibrated. We introduce BayesER (BAYESian Entropy-based Reordering), a post-hoc Bayesian decoding framework that uses predictive uncertainty to guide token commitment. In BayesER, we construct a lightweight approximate posterior centered at the pretrained checkpoint, similar to Laplace-LoRA but wi

    benchmark
  405. arxiv:2610.05124 · cs.AI
    Memory Canonicalization: A Framework and Benchmark for Cross-Model Drift in Persistent LLM Memory
    Amit Vadnere, Aishwarya Lonarkar

    Persistent memory for Large Language Models (LLMs) has matured rapidly: systems such as MemGPT/Letta, Mem0, and Zep now provide agents with tiered, temporally-aware, model-agnostic external storage, while the Model Context Protocol (MCP) standardizes access to memory servers. A less addressed problem is that an identical stored memory object, retrieved by two different LLMs under otherwise identical conditions, may not be interpreted the same way, factually or emotionally. This paper proposes memory canonicalization: a write-time pipeline that detects ambiguity, conditional structure, and emot

    memorypersistent memorybenchmarkjudge model
  406. arxiv:2610.05115 · cs.CV
    PCLM: Small-target localization with frozen CLIP via prototype contrast and local magnification
    Zhipeng Ye, Feng Jiang, Qiufeng Wang, Hao Li

    Small targets occupy few patches in a vision-language encoder, so spatial features often mix object appearance with surrounding content. We propose Prototype Contrast and Local Magnification (PCLM), a support-conditioned localization method that uses a frozen CLIP encoder. Five masked support images per class define foreground and background prototypes through equally weighted regional features. Their difference provides a shared scoring direction for query patches, explicitly comparing target evidence with the demonstrated background. Nine overlapping query windows are enlarged and encoded in

    evaluation protocol
  407. arxiv:2610.05111 · cs.CL
    InstMoE: Adaptive Multimodal Routing with Specialized Experts
    Guimin Hu, Xiang He, Yingjian Li, Zheng Lian +2

    Multimodal inputs are inherently heterogeneous, not only across modalities but also in the information pathways required for effective prediction. To address this limitation, we propose InstMoE, an adaptive expert routing framework for multimodal learning. InstMoE dynamically routes each input to specialized unimodal and cross-modal experts, allowing the model to adapt its information pathways to the characteristics of the input. However, routing can be misled when modality-specific variations obscure task-relevant semantics. Such irrelevant variations may distort routing decisions, causing in

    benchmark
  408. arxiv:2610.05109 · cs.CV
    LoopMoEVR: Loop-Based Degradation-Aware Mixture-of-Experts for Unified UHD Video Restoration
    Yucheng Xin, Runci Bai, Yongcong Wang, Guangwei Gao +4

    Recently, unified high-definition image restoration has attracted considerable attention; however, existing models tend to excessively increase their depth in pursuit of improved generalization, which often yields only limited gains. Meanwhile, loop-based learning paradigms have drawn widespread attention due to their low parameter counts and strong regression capability, as exemplified by GPT-6 and looped Transformers. In this paper, we introduce the loop learning paradigm to address restoration tasks that require cross-domain learning. Specifically, we propose LoopMoEVR, a loop-based mixture

    benchmark
  409. arxiv:2610.05107 · cs.CL
    SearchJev: A Fast and Calibrated System-1 Model for Search Agents
    Congfeng Cao, Lipeng Zuo, Konstantinos Papakostas, Qiwei Xu +5

    Search agents repeatedly make short decisions about relevance, evidence sufficiency, and search actions. Using generative language models for these decisions introduces latency and unreliable confidence. We present SearchJev, a fast and calibrated System-1 model that separates search decisions from System-2 reasoning and generation. Given a search state and a decision schema, SearchJev directly scores legal options without autoregressive output generation. We propose Soft-Label Learning for Calibrated Decisions (SLCD) to learn decision probabilities from uncertain supervision and calibrate the

    benchmark
  410. arxiv:2610.05106 · cs.AI
    SharpDraft: Accelerating Long-Context Speculative Decoding with Cardinality-Aware Query Scaling
    Jeonghoon Park, Seongwoon Jo, Jongwon Lee, Taesik Gong

    Long-form reasoning makes inference expensive, and speculative decoding mitigates this cost by verifying multiple draft tokens in parallel. Its speedup, however, can fade as context grows and draft acceptance declines. We focus on attention-mass dilution: as softmax normalizes over more visible Keys, the mass concentrated on the highest-scoring Keys can decrease. We introduce SharpDraft, a training-free method that counteracts this effect through cardinality-aware Query scaling, without the computational overhead of online adaptation. Under explicit assumptions, we derive an exact top-$k$ mass

    long-context
  411. arxiv:2610.05103 · cs.AI
    VulValidate: Auditing Function-Level Vulnerability Labels with Executable Evidence
    Leizhen Zhang, Sheng Chen

    Reliable learning-based vulnerability detection requires high-quality labels, yet datasets built from vulnerability-fixing commits may label functions as vulnerable simply because they were changed by a security patch. We present VulValidate, a framework that uses LLM agents to coordinate dynamic analysis tools and construct vulnerability-triggering experiments from runtime feedback. Given a labeled function and its fixing patch, VulValidate reconstructs vulnerable and fixed revisions, selects suitable tools and execution paths, refines triggering inputs, and compares runtime behavior to asses

    llm agent
  412. arxiv:2610.05100 · cs.LG
    METRO: Metric-Enhanced Token Routing Operator
    Nodens Koren, Thomas Hofmann, Georgios Kissas

    State-of-the-art neural operators scale to complex meshes via slice-and-process architectures, yet many rely on linear compatibility scores for latent tokenization. Under common feature normalization, such scores are equivalent to isotropic Euclidean clustering, while without normalization they induce unbounded linear decision regions. In both cases, they lack slice-specific anisotropic locality, which can lead to redundant and entangled latent slices. To address this, we propose Metric-Enhanced Token Routing Operator (METRO), a geometry-aware routing mechanism that replaces linear projection

    benchmark
  413. arxiv:2610.05098 · cs.LG
    Advectra: Asymmetric Latent Transport for Non-Stationary Physics
    Nodens Koren, Thomas Hofmann, Georgios Kissas

    Many latent neural operators represent input and output fields in a stationary latent chart. In particular, common latent routing mechanisms use fixed or shared assignment weights for feature projection and reconstruction, limiting their ability to model transport-dominated systems where coherent structures move relative to fixed coordinate frames. We propose Advectra, a transport-aware latent operator that introduces a regularized kinematic coordinate map to decouple source and target coordinate systems. This yields an approximately co-moving latent reference frame and enables asymmetric feat

    benchmark
  414. arxiv:2610.05097 · cs.CV
    ReMAP: Restoring the Perceptual Cycle with Reasoning-Time Latent Visual Memory
    Hao Jiang, Zhanyu Guo, Chenwei Wu, Yichen Guo +10

    As multimodal large language models (MLLMs) reason for longer, attention to the initial visual input diminishes, weakening visual grounding. Visual memory reintroduces visual evidence during reasoning. We conduct a controlled analysis of visual memory along three axes: curation, organization, and access. We find that local evidence benefits from global context, compact latent representations balance accuracy and visual-context cost, and the utility of memory access depends on the reasoning state. Guided by these findings, we propose ReMAP (Reasoning-Time Memory-Augmented Perception), which cou

    memorybenchmark
  415. arxiv:2610.05087 · cs.RO
    Direction-Conditioned Policies for Online Goal-Conditioned Reinforcement Learning
    S K Swaminathan, Damiya Gondha, Theyanesh Eswaramoorthy Rajahkrishnan, Aritra Hazra

    Contrastive Reinforcement Learning (CRL) learns representations that estimate goal reachability, yet its policy remains conditioned on raw goals and therefore does not directly exploit the geometry encoded by its critic. We introduce Direction-Conditioned Policies (DCP), a method built around a small modification to CRL: DCP selects previously visited states as waypoints during online training and conditions the policy on their direction and distance in representation space. At deployment, DCP applies the same interface directly to the final goal, requiring neither waypoint selection nor plann

    manipulation
  416. arxiv:2610.05081 · cs.RO
    Now You Feel It, Now You See Me: Digital-Twin-based Teleoperation Interface for Dexterous Manipulation
    Youngchan Shim, Kyutae Lee, JooYun Kim, Jaeseong Hwang +2

    Teleoperation is becoming increasingly important for collecting high-quality demonstrations to teach robots dexterous manipulation skills. For dexterous manipulation, bare-hand tracking provides a practical way to control robotic hands and demonstrate coordinated finger movements without gloves or exoskeletons. However, this type of teleoperation faces two key feedback limitations: a lack of force feedback and visual feedback of occluded region. The absence of force feedback hinders precise and safe manipulation, as operators must infer contact force visually rather than feel them directly. Oc

    manipulationdexterousteleoperationtactilegrasp
  417. arxiv:2610.05077 · cs.LG
    How Execution Assumptions Change Short-Horizon Sharpe Rankings: Evidence from a Synthetic Trading Benchmark
    Weicheng Xue

    Backtests of LLM trading agents often assume that every order fills at the closing price. We ask whether this choice changes only reported returns or also the order of the agents. Five prompted LLM signal policies and seven classical baselines trade the same synthetic price paths under six execution settings, from near-ideal fills to latency, spread, participation, and impact stresses. The main experiment contains $2{,}462$ runs with matched decision frequencies and paired market paths. On the compressed two-asset board, agreement between the near-ideal and default-stress rankings falls to Ken

    benchmark
  418. arxiv:2610.05066 · cs.CV
    Salvation Lies Within: Eliciting Inherent Style Transfer in Step-Distilled Diffusion Models
    Shengyin Sun, Yiming Li, Yingzhao Lian, Xing Li +6

    Adapting step-distilled text-to-image (T2I) models through post-training incurs additional computational costs and affects native few-step generation behavior. This motivates a complementary route beyond style-specific adaptation: drawing on the visual knowledge already encoded in step-distilled T2I models to elicit stylistic capabilities through language. Pursuing this direction requires textual guidance that captures how visual attributes jointly define a style and remain applicable as the depicted content changes. To explore this approach, we introduce StyleForge, a fully automatic, trainin

    post-training
  419. arxiv:2610.05063 · cs.LG
    Revealing After Overwriting: An Exponential POMDP OPE Lower Bound under History-Dependent Logging
    Youyu Luo, Pengzhan Zhou, Zhida Qin, Jia Wang +3

    Multi-step revealing can make off-policy evaluation tractable under memoryless logging. With history-dependent logging, state decodability and target-relevant evidence can separate. For every horizon $H\ge3$, we construct two exactly realizable POMDPs with four actions, at most four states per layer, a known logger, and a memoryless target. Action overlap, history coverage, and observation-only revealing remain bounded independently of $H$, yet the target values differ by $1/2$ and the KL divergence between the logged laws is $Θ(4^{-(H-1)})$, forcing exponential sample complexity. Logger memor

    memorypolicy evaluation
  420. arxiv:2610.05062 · cs.RO
    Beyond LLM Serving: Characterizing Vision-Language-Action Workloads for Embodied AI System Design
    Seonghun Jung, Sieun Moon, Jiyoung Jeong, Jimin Lee +1

    Vision-language-action (VLA) models translate multimodal observations into low-level robot actions. During robot operation, each control period sets an inference deadline, and overruns leave the robot acting on stale observations, reducing task success. Meeting this deadline motivates on-device or nearby edge execution, where a single robot requires batch-1 inference outside the design point of LLM serving systems. Although VLA architectures combine familiar vision-language, autoregressive, and diffusion-style components, their runtime behavior in this batch-1 control setting remains uncharact

    vision-language-actionvlavla modelembodied
  421. arxiv:2610.05053 · cs.CV
    CoDG-Net: Structure-Guided Style Diffusion and Collaborative Learning to Mitigate Catastrophic Forgetting in Medical Image Domain Generalization
    Yucheng Song, Jincan Wang, Haokang Ding, Zhiqiang Tian +2

    Domain Generalization (DG) for medical image segmentation is both highly challenging and critically important. However, existing medical DG methods largely overlook the issue of Catastrophic Forgetting (CF): \textbf{Models often sacrifice their ability to retain source-domain knowledge while pursuing cross-domain robustness.} This can directly threaten diagnostic safety in already-deployed clinical scenarios. To address this, we investigate data augmentation strategies and catastrophic forgetting for medical image DG segmentation. First, we propose a structure-guided style diffusion augmentati

    benchmark
  422. arxiv:2610.05051 · cs.LG
    LogSig-SSM: Time-Series Modelling with Multi-Scale Log-Signature Compression for State-Space Models
    Felix Oury, Nicolas Calvo Peiro, Reiko J. Tanaka

    Time-series data are often sampled irregularly at high frequencies and exhibit long-range dependencies, which makes long-horizon modelling difficult. Continuous-time models such as neural controlled differential equations (NCDEs) and neural rough differential equations (NRDEs) can handle irregular sampling, but they scale poorly to long sequences. Selective state-space models (SSMs) such as Mamba scale linearly with sequence length, but they provide limited recurrent mixing across hidden dimensions within a single block. We propose LogSig-SSM (Log-Signature Compression for State-Space Models),

    latent dynamicsmemorybenchmark
  423. arxiv:2610.05044 · cs.AI
    AraYoungVoices: A Diverse L1/L2 Corpus of Arabic Child and Adolescent Speech
    Shammur Absar Chowdhury, Zien Sheikh Ali, Houssam Eddine-Othman Lachemat, Hamdy Mubarak

    State-of-the-art ASR systems primarily target native adult speech, leading to substantial performance gaps for children, adolescents, and L2 speakers. We introduce AraYoungVoices, a 151.72-hour Arabic read-speech corpus from 286 speakers aged 7--18, comprising AraKids (7--12) and AraTeens (13--18). The corpus includes 146 native Arabic (L1) and 140 second-language (L2) speakers, with native speakers spanning Egyptian, Gulf, Levantine, and North African dialectal backgrounds and L2 speakers representing diverse linguistic backgrounds across the Americas, Asia, Africa, and Europe. We benchmark f

    benchmark
  424. arxiv:2610.05039 · cs.CL
    Causal Improvement Graph for Agentic Harness Optimization
    Junjie Zhang, Shunyu Liu, Haoyu Wang, Ting-En Lin +2

    Agentic Harness is the runtime that constructs task context and controls execution flow, thereby shaping overall agent performance. Given a fixed model and external evaluation, automated Harness optimization seeks to improve this runtime through an iterative proposal--evaluation loop to better solve target tasks. Existing meta-harness methods mainly adopt proposer-centric discovery, in which an LLM-based proposer integrates accumulated experimental findings to determine subsequent Harness revisions. This places the burden of maintaining the evolving improvement state on the proposer as history

    agentagentic
  425. arxiv:2610.05037 · cs.AI
    SparseCraft: Agentic Hardware-Software Co-Optimization for Sparse Computing
    Rajatabha Chakraborty, M P Samartha, Vedant Pahariya, Priyesh Shukla

    Sparse-accelerator design spaces are usually searched against analytical models, so a design point is admitted on what a model predicts rather than on what the hardware does. SparseCraft closes that gap with a language model inside a closed CHIA loop. In each of 15 iterations the model reads the measured outcome of the previous one and edits the Chisel RTL, the memory configuration and the sparse-kernel schedule of a Gemmini accelerator through MCP tool servers, and no candidate counts until it has been checked for legality, elaborated, simulated cycle-accurately, checked bit-for-bit on every

    memoryagentic
  426. arxiv:2610.05033 · cs.CV
    Code2Games: Enabling Coding Agents for Gaming World Generation
    Wei Wu, Ziyang Xu, Zeyu Zhang, Yang Zhao +1

    Generating a high-quality gaming world from a natural-language game intent requires joint reasoning about scene structure, spatial layout, gameplay objectives, interactive entities, and executable gameplay logic. Existing coding agents can generate individual assets, scenes, or scripts, but often struggle to maintain consistency across these components. We propose Code2Games, an agentic framework that builds a structured gaming world upon a base Blender world generated from the same game intent. Code2Games coordinates scene analysis, gameplay planning, constrained gaming-world generation, and

    agenticbenchmark
  427. arxiv:2610.05030 · cs.AI
    EVISKILL: Grounding Skill Evolution in Replayable Evidence
    Yan Zhou, Yili Wang, Yiwei Dai, Qinggang Zhang +1

    Continual skill evolution enables LLM agents to accumulate and refine reusable procedural knowledge from interaction experience without updating model parameters. Its effectiveness depends on determining not only what to change, but also why a change is justified and when it should become persistent guidance. However, existing experience-driven methods can lose the behavioral evidence and task contexts supporting edits. Moreover, a global validation outcome provides an incomplete judgment of its constituent changes: locally supported corrections may be discarded with a rejected revision, while

    llm agentbenchmark
  428. arxiv:2610.05026 · cs.RO
    GeoBridge-VLA: Geometry-Aware Residual Adaptation for Vision-Language-Action Models
    Hyun Song, Kangmin Kim, Loren Jinsoo Um, Minhui Han +3

    Vision-language-action (VLA) models encode semantic information from vision-language pretraining, but manipulation also requires precise spatial reasoning. We present GeoBridge-VLA, a two-stage method for learning geometric features from a pretrained VLA's frozen visual encoder and using them for action prediction. Stage I trains a feature bridge and geometry decoder with depth supervision. Stage II freezes these modules and trains a gated residual interface together with the action-side projections and action expert. The residual augments the existing visual tokens without adding a second ima

    vision-language-actionmanipulationlibero
  429. arxiv:2610.05025 · cs.CV
    Triggering Generalist Reasoning via Predictive Uncertainty for Dual-System VLA
    Hyemin Yang, Wooseong Jeong, Giwon Lee, Kuk-Jin Yoon

    Dual-system Vision-Language-Action (VLA) models improve real-time robotic control by pairing a slow, reasoning-capable generalist with a fast specialist action expert. However, existing methods invoke the generalist at a fixed frequency, ignoring the fact that decision-making complexity varies throughout a rollout. This static strategy wastes computation in easy phases and can delay renewed reasoning when the scene changes unexpectedly. We propose TUD (Triggering generalist reasoning via predictive Uncertainty for Dual-system VLA), an adaptive inference framework that selectively skips unneces

    vision-language-actionvla
  430. arxiv:2610.05024 · cs.RO
    LightVLN: Efficient Aerial Vision-and-Language Navigation with Compact Memory and History-Guided Local Aggregation
    Yiming Zhao, Tianshun Li, Jingle He, Ruonan Chai +1

    Aerial vision-and-language navigation (VLN) enables unmanned aerial vehicles to execute long-horizon natural-language instructions from visual observations in complex three-dimensional environments. However, recent aerial VLN models often rely on large-scale vision-language backbones and dense visual histories, imposing substantial computation and memory costs that hinder onboard deployment. We propose LightVLN, a lightweight history-aware aerial VLN framework that combines a compact 0.5B language backbone with compact representations of both historical and current observations. LightVLN compr

    memory
  431. arxiv:2610.05023 · cs.CV
    Look Where You Say You're Looking: Self-Grounded Attention for Visual Reasoning
    Uri Berger, Gal Chechik, Gal Dalal

    We introduce Self-Saliency, a method for training Vision-Language Models (VLMs) to increase the alignment between their visual attention and the image regions mentioned in their reasoning. Self-Saliency uses a grounding model to localize the objects mentioned in each reasoning step and treats the resulting areas as supervision for the model's visual attention. Previous work on steering visual attention determines target image regions based solely on the image and question. In contrast, we show that conditioning the target regions on the model's generated reasoning improves downstream performan

    post-trainingbenchmark
  432. arxiv:2610.05014 · cs.LG
    MetaKernelBench: Measuring GPU Kernel Knowledge Transfer Beyond Code
    Xueyi Chen, Shiyu Liu, Xin Jin, Yuhua Zheng +4

    Recent GPU kernel optimization agents retain what they learn in knowledge bases or as distilled skills. Kernel benchmarks score each attempt's implementation for correctness and speed but leave the reuse value of retained experience unmeasured. We introduce MetaKernelBench, which measures whether experience distilled from an attempt in one kernel domain-specific language (DSL) improves a fresh attempt at the same problem in another. Its 74 problems are fused subgraphs in six families, each posed as a pair of CuTe DSL and TIRx variants that differ only in the DSL. The agent first attempts each

    agentbenchmark
  433. arxiv:2610.05013 · cs.CV
    EMBER-Bench: Benchmarking Cross-Event Causal Memory in Long-Horizon Embodied Tasks
    Aoyang Cai, Boning Zhao, Shaoxuan Xie, Dahui Gao +4

    Lifelong physical agents must reason over extended interactions where past events continue to shape the world long after they disappear from view. Beyond recalling what happened, agents must infer how history changes the current state and constrains future actions. Yet existing embodied and video-memory benchmarks largely focus on historical retrieval and summary, leaving such history-dependent causal reasoning underexplored. We introduce EMBER-Bench, an egocentric benchmark for cross-event causal reasoning in long-horizon embodied tasks, for which we newly created the task design, video recor

    embodiedmemoryembodied agentbenchmarkevaluator
  434. arxiv:2610.05010 · cs.CV
    PortraitAes: Intent-Conditioned Structured Portrait Aesthetics Assessment
    Junzhou Xie, Haozhong Xiong, Xunyun Tian, Kaile Du +7

    Portrait aesthetic assessment assigns comparable scores according to how effectively human-centered images fulfill their photographic intent. These scores support data filtering, candidate selection, and preference modeling in image-generation pipelines. Existing methods typically predict a single aesthetic score or use general-purpose MLLMs without conditioning on photographic intent. This omission matters because the same blur, pose, lighting, or framing choice may serve one photographic intent but undermine another. These models thus learn context-agnostic aesthetic priors and yield inconsi

    benchmark
  435. arxiv:2610.05004 · cs.LG
    Physics-Augmented Graph Transformers for Patch-Antenna Forward and Inverse Design
    Avi Epstein, Snir Nehemia, Haim Suchowski, Lior Wolf

    Full-wave electromagnetic (EM) simulation enables accurate patch-antenna analysis but is computationally expensive for large-scale forward prediction and inverse design. We present a mesh-native, physics-augmented graph-learning framework that treats radiation-pattern prediction as signal reconstruction on an irregular surface mesh. For the forward problem, a GPS graph transformer is trained with Physics-Augmented Intermediate Supervision (PAIS), an auxiliary node-level objective that predicts complex surface currents, the physical intermediate linking geometry to radiation. PAIS improves mult

    benchmark
  436. arxiv:2610.05003 · cs.AI
    How corner is a corner case? Percentile control for highway scenario generation
    Jiaxi Liu, Hang Zhou, Hangyu Li, Yifan Wang +4

    Generating corner-case scenarios with appropriate adversity in a simulation environment is critical for testing an autonomous vehicle (AV) software stack's safety performance before deployment. Existing autonomous-driving scenario generators can enforce specific behavior, adversity, or feasibility conditions, but they provide limited control over how extreme a generated scenario is relative to plausible futures in the same traffic context. This study represents the adversity of a generated scenario as its percentile in the conditional distribution of future risk given the observed history. Thi

    multi-agent
  437. arxiv:2610.04991 · cs.AI
    CIPO: Counterfactual Imagination Policy Optimization for Adaptive Tool Granularity Selection
    Yu Li, Yunlu Wan, Zijian Zhu, Han Luo +3

    Large language model (LLM) agents solve complex tasks through multi-step interactions with external tools. These interactions often contain recurring local tool sequences. Treating such sequences as composite "Skills" can shorten tool-use trajectories and reduce repeated low-level decisions. However, when atomic tools and composite skills coexist, skill use becomes a policy problem: the agent must decide whether the current state requires atomic fine control or skill-level abstraction. In this paper, we argue that effective skill use should be studied as adaptive tool granularity selection. Th

    agenttool-usebenchmark
  438. arxiv:2610.04988 · cs.LG
    How Long, Not How Close: A Learned Temporal Metric for Planning in Latent World Models
    Lama Moukheiber, Haotian Xue, Yongxin Chen

    Latent world models plan by rolling a frozen predictor forward under candidate action sequences and ranking the candidates by the latent distance between their imagined end state and the goal. However, this ranking breaks down when the goal lies several plans away, because the latent distance measures how closely an end state resembles the goal rather than how far it remains from reaching it. To address this, we propose TEMPO, a temporal-distance planning objective that leaves the world model untouched, learns only from the demonstrations already used to train it, and adds negligible cost to t

    manipulationworld model
  439. arxiv:2610.04980 · cs.CV
    Geometry-Aware Preference Optimization for Text-to-Image Diffusion Models
    Lei Wang, Zhen Wang, Yuexiang Xie, Yaliang Li

    Preference alignment has become a standard practice for text-to-image diffusion models. Direct Preference Optimization (DPO) simplifies this process by eliminating explicit reward modeling. Its diffusion variant, Diffusion-DPO, has become a widely adopted baseline. Diffusion-DPO essentially encourages the likelihood of preferred samples while suppressing dispreferred ones. In this paper, we revisit DPO-style alignment methods for diffusion models from the perspective of the manifold hypothesis. Under this view, natural images concentrate near a low-dimensional manifold embedded in the high-dim

    benchmark
  440. arxiv:2610.04978 · cs.LG
    What Will Post-Training Fix? Per-Problem Gains Are Shared Across Independent RL Runs, and Existing Checkpoints Predict Them Better Than A Priori Signals
    Xiaoxian Duan

    Data selection, curricula and the evaluation of post-training recipes all assume that we can tell, before training, which problems a model will improve on. We test this assumption directly. For two base models, DeepSeek-R1-Distill-Qwen-1.5B and Qwen2.5-Math-1.5B, we evaluate eighteen post-training runs on up to 1532 competition math problems with many samples per problem, and compare signals available before training against a noise ceiling derived from the agreement between disjoint subsets of runs. Three findings hold on both base models. What post-training fixes is shared: independent runs

    post-training
  441. arxiv:2610.04975 · cs.AI
    Runtime Authorization of Self-Generated Subgoals in Long-Horizon Tool-Using AI Agents
    Genliang Zhu, Chu Wang

    Long-horizon tool-using AI agents create subgoals, replan, delegate work, and compose sibling results. Per-tool permission checks cannot establish that a changing goal graph remains within the principal-approved task. We address this authorization gap in a finite structured domain with one principal and one authorization root. Each proposed goal-graph mutation carries a version-bound witness that its continuation traces, resources, obligations, invariants, and closing condition refine the active root contract; every protected effect is rechecked at an atomic commit boundary. Free-form goal tex

    ai agent
  442. arxiv:2610.04974 · cs.CL
    IREA: Intermediate Representation-based Embedding Alignment for Normative RAG
    Mirae Han, Sihyeong Yeom, Harksoo Kim

    Large language models (LLMs) have shown strong performance across various tasks, but they still struggle with questions involving ethical judgment. Previous studies have attempted to train LLMs on ethical standards, but the diversity and relativity of ethical norms make them difficult to fully internalize in model parameters. As an alternative, we introduce normative RAG, a retrieval-augmented approach that supports ethical judgment using external normative knowledge. Normative retrieval involves a distinct asymmetry between context rich narrative queries and generalized normative statements.

    retrieval-augmentedrag
  443. arxiv:2610.04973 · cs.CL
    TrajLong: Co-Designing Agentic and Long-Context Supervision for Mid-Training
    Miao Peng, Qintong Zhang, Nuo Chen, Yuhan Li +7

    LLM agents for coding, search, and workplace tasks increasingly rely on long-context capabilities to effectively aggregate and reason over extended interaction histories. Recent work has incorporated agent trajectories into mid-training stage, drawing on their naturally long and interaction-rich structure. Yet how to organize the information within these trajectories into effective mid-training supervision remains underexplored. In this work, we investigate the relationship between long-context and agent atomic capabilities and introduce TrajLong, a novel framework that compiles trajectories i

    long-contextagentllm agentagenticagent benchmarkbenchmark
  444. arxiv:2610.04969 · cs.LG
    Hamiltonian Metric Learning and Energy-Based Training: A Dissipative Geometric Framework for Optimization
    Sparsho Chakraborty, Mohammad Alamgir, Nishanth M, Akshit Nanda +2

    Optimization in machine learning is usually expressed through iterative rules that update model parameters using information from the loss landscape. In this work, we study an alternative viewpoint in which parameter optimization is treated as the evolution of a dissipative dynamical system. The model parameters are regarded as generalized coordinates, the loss acts as a potential energy, and a positive-definite metric defines the local kinetic geometry of parameter space. Starting from a variational formulation, we derive the corresponding Hamiltonian dynamics, the geometric force generated b

    benchmark
  445. arxiv:2610.04966 · cs.AI
    BACAM: Behavior-Aware Continual Agent Merging for Multi-Turn Interaction
    Shuaitong Li, Baochen Xiong, Xiaoshan Yang, Xizhe Zheng +3

    Model merging offers a way to integrate the capabilities of specialized experts, but existing agent merging methods typically require all of them to be available at once. We study continual agent merging, which integrates incoming experts sequentially without retaining previously merged experts. Yet merging in parameter space or feature subspaces does not ensure that the merged model acquires an incoming expert's behavior on interaction trajectories. Moreover, updates toward a new expert can disrupt the merged model's previously integrated interactive behavior. Therefore, we propose Behavior-A

    embodiedagenttool use
  446. arxiv:2610.04961 · cs.CL
    Building LLM Agent Systems the Deep Learning Way: From Modular Design to Architecture Search
    Tao Feng, Pengrui Han, Zhongjie Dai, Jiaxuan You

    Large Language Models (LLMs) have revolutionized AI research and enabled exciting agent systems. To build a complex LLM agent system, most existing research relies on insights from other domains or heuristics to manually build the agent system. However, this approach often requires heavy hand-engineering and fails to fully optimize for the downstream task of interest. Inspired by the tremendous success of deep learning, we propose to construct LLM agent systems in a modular manner, similar to building a deep neural network. Our key insight is to make analogies between LLM building blocks, such

    agentllm agentagent system
  447. arxiv:2610.04950 · cs.LG
    How Should Teachers Be Prepared? RL on Student-Induced States for On-Policy Distillation
    Xiaoyu Ma, Haoyue Liu, Zhichao Wang, Jionghao Zhu +1

    On-policy distillation (OPD) improves the reasoning capabilities of small language models through token-level teacher supervision on student-generated trajectories. Yet can teachers that excel at solving problems independently also guide student reasoning effectively? Prior work shows that when student prefixes follow reasoning paths that differ from the teacher's own or contain errors, teachers can be less accurate when continuing from these prefixes than when solving problems independently. To this end, we propose Prep-OPD, which uses reinforcement learning (RL) before distillation to train

    benchmark
  448. arxiv:2610.04942 · cs.AI
    Zero-Shot Time-Series Question Answering via Decoupled Perception and Reasoning
    Jing Xie, Haochen Yuan, Yunbo Wang

    Time-series question answering (TSQA) requires grounding linguistic queries and diverse answer formats in complex numerical observations. However, existing methods heavily overfit to specific datasets and struggle to generalize when input series, question contexts, and answer requirements shift simultaneously. To address this challenge, we propose TSHarness, an agentic framework that establishes a decoupled workflow for cross-dataset zero-shot TSQA. At its core, TSHarness divides and conquers numerical perception and contextual reasoning via a structured Time-Series Perception State (TPS). Gui

    memoryagentagentic
  449. arxiv:2610.04940 · cs.LG
    Software World Models: From Consequence Prediction to Decision Value
    Tongli Su, Yuntong Hu, Liang Zhao, Bowen Zhu +2

    A coding agent may safely modify one repository while silently breaking downstream services, libraries, or datastores that depend on it. Exhaustively running integration tests after every agent action is impractical, so the agent must predict these failures before executing them. Existing software world models predict the agent's own observations, while static change-impact analysis only identifies where a change may propagate. We instead introduce the Software World Model (SWM), which models the broader system affected by a code change and predicts its blast set: the components that the chang

    world modelagent
  450. arxiv:2610.04938 · cs.LG
    D-DOIT: Training-free Adaptation of Discrete Diffusion via Doob's h-Transform
    Jieke Wu, Qijie Zhu, Weimin Wu, Zeqi Ye +2

    We propose D-DOIT (Discrete Doob-Oriented Inference-time Transformation), a training-free and efficient adaptation method for discrete diffusion models with generic rewards. D-DOIT formulates adaptation as sampling from a reward-tilted target distribution and realizes this transport through Doob's h-transform of the discrete diffusion reverse kernel, using only reward values rather than reward gradients. Unlike continuous diffusion, masked discrete diffusion samples categorical token-reveal transitions rather than continuous state updates. D-DOIT derives the corresponding discrete Doob's h-tra

    benchmark
  451. arxiv:2610.04936 · cs.LG
    Learning under Localized Minority Imbalance
    Amin Hosseininasab, Steven M. Shugan

    Class-imbalance methods implicitly assume that the minority class is uniformly undersampled relative to the majority class. However, in many real-world settings, minority instances may be disproportionately under-observed in certain regions of the feature space. For example, small businesses that go bankrupt may disappear from records, while those that survive remain visible, making bankruptcy appear less common among small firms than it actually is. This gives rise to localized minority imbalance (LMI), a challenge that is often overlooked and extends beyond general class-count imbalance. We

    benchmarkevaluation protocol
  452. arxiv:2610.04933 · cs.RO
    DiVeR: Decision-Critical Verifier Learning for VLA Test-Time Scaling
    Seongheon Park, Heecheol Kim, Shulin Tian, Lilika Makabe +4

    Scaling robot data and model capacity has improved Vision-Language-Action (VLA) policies, but further progress is constrained by the high cost of robotic data. Verifier-guided test-time scaling offers an efficient alternative by sampling multiple action candidates and selecting the one most likely to lead to task success at inference time. Existing classification-based verifiers learn from trajectory-level outcomes but treat all visited states equally, even though their value for candidate discrimination can vary across a trajectory. At many states, plausible actions are similar and provide li

    vision-language-actionvlaliberofranka
  453. arxiv:2610.04929 · cs.RO
    RobotUse: Allocating Computation, Context, and Decisions
    Junhoo Lee, Injun Baek, Seungyeon Kim, Suhyun Jeon +3

    Robot agents must connect their intended actions to observed outcomes while retaining the context needed to revise their choices over repeated attempts. Existing interfaces often leave these choices inside predefined tools or require agents to manage detailed execution code and its growing history. We introduce RobotUse, a robot agent harness that organizes computation, context, and decisions around specifying and revising physical actions. Agents visually select targets and poses, while the backend handles geometry, motion planning, and control. Subagents retain detailed interactions within e

    agent
  454. arxiv:2610.04927 · cs.LG
    Assembling Insights for Agentic Machine Learning Engineering Systems
    Bihui Jin, Yinxi Li, Kaiyuan Wang, Pengyu Nie

    Agentic machine learning engineering (MLE) is an emerging AI4SE application for complex ML tasks and a step toward recursive self-improvement of AI systems. Recent agentic MLE systems show the value of leveraging insights from related MLE tasks: some systems condition code generation on expert domain knowledge, which is implicitly curated from peer MLE tasks; some systems have a loop of solving an MLE task, gathering memory to benefit future tasks. However, insight collection and injection remain ad hoc, and existing evaluations often do not control insight sources, making data leakage a threa

    memoryagentagenticself-improvementbenchmark
  455. arxiv:2610.04925 · cs.LG
    TSAE: Structured Sparse Autoencoders for Interpreting Time-Series Forecasting Models
    Baoxi Liu, Yi Xie

    Time-series forecasting informs critical decisions in energy dispatch, industrial operations, and environmental monitoring; understanding the patterns models rely on is essential for assessing reliability and identifying failures. Input attribution identifies important variables and time segments but offers limited insight into internal features, while standard sparse autoencoder (SAE) objectives do not directly constrain cross-variable structure or temporal continuity. We introduce TSAE, a structured sparse autoencoder for forecasting representations that decomposes hidden states into individ

    eval protocol
  456. arxiv:2610.04924 · cs.RO
    Nudge Before You Push: Physics-Aware Navigation via Tactile Probing
    Xianyao Li, Fang Xu, Ruitong Tian, Bowen Sun +3

    Visually identical containers can conceal loads that require different handling decisions. We present TANav, which uses a brief nudge to measure push resistance for navigation under a site-defined handling boundary. TacPhys reads the force sequence, with optional RGB-D and kinematics, into a mass estimate for push authorization. A repeated-patrol planner weighs probe and route costs, requests a second contact when useful, and reuses observations across visits. In simulation, TacPhys approaches a resistance-only Bayes reference and reduces missed pushes from 28.7% to 5.5% relative to peak-force

    tactilemanipulatorquadruped
  457. arxiv:2610.04923 · cs.MA
    Increasing Resilience of Smart Home Agents
    Christopher Terrazas, Eduardo Cotilla-Sanchez

    Smart homes and smart devices are becoming more prevalent across millions of homes around the world. With the rise of AI, the smart home industry is quickly increasing its integration to manage common smart home tasks. However, existing work in large language models (LLMs) as agents within smart homes have shown minimal resilience due to limited environment scenarios or poor performance in complex tasks. We explore several strategies for LLMs as agents within the popular open-source software (OSS) smart home automation framework HomeAssistant to increase overall smart home resilience. Our appr

    agenticbenchmark
  458. arxiv:2610.04921 · cs.AI
    Complex Agents, Shallow Tests: Demystifying and Enhancing Test Adequacy of Agent Harness in the Wild
    Yifan Xiong, Jingyi Ge, Zhenpeng Chen, Yiling Lou

    LLM-based agentic systems are emerging as a new software paradigm. Modern agents are typically composed of backbone LLMs and a surrounding harness that serves as the operational software infrastructure for agent execution. As agent harnesses grow increasingly complex, agents suffer from diverse harness implementation bugs, raising substantial reliability concerns. In this work, we conduct the first empirical study to systematically investigate the test adequacy of harness in real-world agentic systems. Our analysis reveals that agent harness remains substantially undertested. In particular, LL

    agentagentic
  459. arxiv:2610.04920 · cs.CV
    PWM: Personalized World Models with Online Reinforcement Learning
    Zhexin Lou, Guancheng Lu, Zeyu Zhang, Yi Zhang +2

    Pretrained world models can generate diverse environments, yet users often want to explore a particular scene specified by their own video. This requires learning the scene's visual identity while retaining the quality of action-conditioned generation. We introduce Personalized World Models (PWM), a framework for customizing interactive world models from short scene videos through online reinforcement learning. In PWM, the support trajectory and its associated controls provide reward feedback on continuations sampled from the current policy. In the GRPO instantiation, group-relative optimizati

    world modelaction-conditioned
  460. arxiv:2610.04918 · cs.LG
    Residual Visual Credit Optimization: Conserved Evidence Routing for Multimodal Reinforcement Learning
    Lin Qiu, Yao Liu, Diyi Hu, Hanqing Zeng +5

    Reinforcement learning with verifiable rewards scales multimodal reasoning, but an outcome reward says how much a trajectory is worth, not how that value should be spread over the decisions that produced it. We introduce Residual Visual Credit Optimization (RVCO), which treats token credit as a conserved routing problem. A controlled visual intervention yields a per-token evidence response; robust within-trajectory coordinates remove incidental scale; and a budgeted entropic router distributes a fixed amount of sequence utility according to perceptual dependence. A residual support path guaran

    benchmark
  461. arxiv:2610.04916 · cs.RO
    PreAct-Nav: Agentic Reasoning Before Action for Urban Navigation
    Jing Xie, Shouwei Ruan, Yubin Wang, Yuxiang Zhang +3

    Urban navigation requires embodied agents to pursue long-horizon goals through local decisions based on egocentric observations. However, existing agentic navigation methods often struggle to translate distant goals into coherent local decisions in large-scale physical environments. Their reliance on linguistic reasoning over transient observations or limited history constrains anticipation of the consequences of actions and future conditions, despite the importance of such foresight for navigating long and complex urban routes. To bridge this gap, we propose PreAct-Nav, an agentic navigation

    embodiedworld modelaction-conditionedmemorymemory moduleagentic
  462. arxiv:2610.04915 · cs.AI
    Are We Measuring Scientific Intelligence? Rethinking the Evaluation of AI Scientists
    Kate Zhang, Yuante Li

    AI agents can now carry out data-driven scientific analyses end to end, and benchmarks assess them by giving an agent a question and a dataset and scoring its final answer against a fixed key. These benchmarks assume that a correct answer was derived from the supplied data, a property we call evidence grounding. However, an agent can also reach the key from prior knowledge or by ruling out the other options, and a score based on a single run cannot tell these cases apart. We show how to test this assumption and find that it often fails. For each question, we build versions of its data files in

    agentai agentbenchmark
  463. arxiv:2610.04914 · cs.LG
    Monitorability Disposition in Large Reasoning Models
    Shahriar Golchin, Marc Wetter

    Monitoring the chain-of-thought (CoT) of large reasoning models (LRMs) is a common way to detect misbehavior in real-world practice. However, current monitoring is passive: a separate model inspects the session only after execution. This means harm may already have occurred before it is caught. An active alternative is to have the model self-report its misbehavior as it happens. Whether models are willing to do this, however, is unknown. We introduce "monitorability disposition": a model's willingness to make itself monitorable and stay monitored throughout inference when warranted. We measure

    tool usetool-use
  464. arxiv:2610.04913 · cs.RO
    $R^2$-WAM: Repair-and-Reject Post-Training for World Action Models
    Ruiyan Xu, Haisheng Su, Sixu Lin, Zhaokun Yue +3

    World Action Models (WAMs) emerge as a promising foundation for policy refinement by predicting the consequences of sampled actions. However, visually plausible predictions can mislead policy refinement if they fail to reflect the input actions. To address this mismatch, we introduce $R^2$-WAM, a two-stage repair-and-reject post-training framework that first improves the consistency of predicted futures with input actions, then uses these futures to select inferior action samples for negative fine-tuning. The repair stage grounds imagination in observed robot behavior through a kinematic align

    robotwinpost-training
  465. arxiv:2610.04911 · cs.CV
    VideoResearchAgent: Grounded Task Synthesis and Sim-to-Real RL for Open-Web Video Research
    Yuhang Zhou, Fei Li, Yuxi Wu, Bin Zhu +1

    Existing deep research agents are designed primarily for text- and image-based web sources, while video reasoning systems typically assume that relevant videos are provided in advance. We study open-web video research, where an agent must autonomously discover relevant videos, navigate their temporal content, and ground answers in visual evidence. Training such agents at scale is challenging as live video interaction is slow and unreliable, whereas fixed local simulation can induce retrieval-specific shortcuts that fail to transfer to the open web. We introduce VideoResearchAgent, a scalable t

    sim-to-realagent
  466. arxiv:2610.04910 · cs.RO
    GJK-CBF: Control Barrier Functions for Convex Rigid Body Collision Avoidance on SE(3)
    Yi-Hsuan Chen, Shuo Liu, Wei Xiao, Michael Otte +1

    Collision avoidance among convex bodies is a fundamental problem in robotics. Control Barrier Functions (CBFs) provide a practical framework for real-time safety filtering due to their computational efficiency. For general convex bodies, exact separation measures, such as distance or scaling factor, are typically computed through optimization. Existing CBF formulations often obtain the required gradient via differentiable optimization (diffOpt), adding computational overhead. In contrast, we leverage the Gilbert-Johnson-Keerthi (GJK) algorithm to obtain the current witness pair---the pair of p

    manipulator
  467. arxiv:2610.04906 · cs.AI
    Scaling Verifiable Environments for Long-horizon Work Agents
    Jiazheng Zhang, Long Ma, Yunxian Yang, Zhiheng Xi +22

    Work agents operate over digital artifacts to execute professional knowledge-intensive work, requiring training environments that support long-horizon interaction and trustworthy verification. However, hand-crafted environments incur prohibitive engineering overhead that prevents environment scaling, whereas synthesis methods sacrifice workspace complexity, realism, or grounded verifiability. To bridge this gap, we introduce WorkForge, a scalable synthesis framework for constructing verifiable work-agent environments from real-world resources. Starting from expert workflows, WorkForge first id

    post-training
  468. arxiv:2610.04902 · cs.AI
    Self-Evaluating Recursive Agents
    TianYi Lyu, Xiaozhe Li, Yang Li, Yongkang Chen +6

    Recursive language-model agents decompose tasks and delegate subtasks to child instances of the same policy, forming a tree of work. Training them, however, is hard: the final outcome is verifiable, but the self-invented intermediate subtasks are numerous and carry no ground truth. Existing methods score each node with a verifier or judge, which is costly at scale and blind to decomposition quality. We argue that a recursive agent must learn three coupled capabilities within one set of weights: decomposing problems into subtasks, solving them, and evaluating the outcomes, each requiring its ow

    agent
  469. arxiv:2610.04899 · cs.CL
    Rewrite What Matters: Adaptive Multilingual Query Rewriting for Reasoning via Agentic Reinforcement Learning
    Rui Qi, Yufeng Chen, Yunlong Liang, Chuan Meng +5

    In multilingual scenarios, queries with equivalent semantics but in different languages could guide the model into different reasoning trajectories, leading to performance disparities. To mitigate this gap, previous studies typically apply a one-size-fits-all query rewriting strategy, such as translation, which overlooks the fact that different scenarios require diverse types of semantic transformations. In this paper, we propose mRewriter-R1, an agentic multilingual query rewriting framework with reinforcement learning. Unlike single-turn rewriting, mRewriter-R1 formulates multilingual query

    agentic
  470. arxiv:2610.04896 · cs.RO
    Tackling Sim-to-Real Mismatch Through Sampling-Based Disturbance Observers: From Analytical Models to Learned World Models
    Tianqi Zhu, Jun Yang, Jianliang Mao, Cong Li +1

    Robotic controllers increasingly rely on analytical models, simulators, cost-query interfaces, and learned world models. However, physical deployment can deviate from nominal assumptions, and additional disturbances may arise even when the model itself is accurate. In control systems, disturbance observers (DOB) are widely used to estimate such unmeasured effects from nominal models and measured feedback. Classical DOB formulations are generally built around explicit plant models. This paper develops the sampling-based disturbance observer (SDOB), extending the DOB principle to a broader range

    sim-to-realworld model
  471. arxiv:2610.04893 · cs.LG
    SFlexRCA: Lightweight, Scalable, and Flexible Root Cause Analysis for IIoT Edge Systems
    Amr M. Zaki, Farhoud Jafari, Honggeun Ji, Komal Sarda +1

    Industrial Internet of Things (IIoT) systems generate high-dimensional sensor telemetry from interconnected components, where faults can propagate across the system. To address these challenges, we propose SFlexRCA (Scalable and Flexible Root Cause Analysis), a topology-free RCA framework designed for resource-constrained IIoT environments. SFlexRCA transforms multivariate telemetry into compact orthogonal representations and applies shared lightweight linear modeling, avoiding explicit graph construction, message passing, and per-variable or lag-specific parameter growth. We evaluate SFlexRCA

    memory
  472. arxiv:2610.04889 · cs.AI
    ForkPilot: Self-Evolving Policy for Retrospective Search in Long-Horizon Agents
    Xinyue Zeng, Shivam Shandilya, Guilherme Potje, Leonardo Nunes +5

    Interactive language-model agents increasingly solve complex tasks through long-horizon, multi-call reasoning, where errors in beliefs or actions can compound across tool interactions. Retrospective search can recover from such failures but is prone to misallocation. Delayed outcomes obscure the contribution of intermediate search decisions, leading to Attribution Complexity, while evolving execution evidence leads to Adaptation Complexity, where previously learned estimates become stale. To address these challenges, we first introduce Search Value Dynamics (SVD), which characterizes the evolv

    agenticself-evolvingbenchmark
  473. arxiv:2610.04888 · cs.CL
    No Hindsight for LLM Fact-Checkers: Measuring Leakage Channels in Misinformation Detection
    Kuan-Hua Wu Lu, Yohanes Andre Setiawan

    As automated fact-checking scales on social media, large language model (LLM) verdict scores can look stronger than warranted. One reason is that evaluations mix in information that was not knowable at claim time. Two channels are easy to conflate: outcomes memorized in pre-training and retrieved evidence published after the claim. Yet standard benchmarks rarely separate the two. In this study we measure both channels on AVeriTeC and QuanTemp++ by reconstructing point-in-time evidence conditions and probing for outcome information encoded in model representations. We find substantial evidence

    benchmark
  474. arxiv:2610.04883 · cs.CV
    Reflection-Robust 6DoF Object Tracking with Light Fields
    Nikolai Goncharov, Donald G. Dansereau

    Tracking the 6DoF pose of a moving rigid object is fundamental to robotics and autonomous driving, but existing trackers assume that object appearance is stable across a sequence, an assumption that breaks down on reflective surfaces whose appearance changes as they mirror the environment. We introduce a light field based reflection-robust 6DoF tracker that turns this apparent nuisance into a pose cue. Per frame, our method recovers depth robustly against reflections, back-projects it into a point cloud, and estimates surface normals. It then decomposes the object's view-dependent appearance i

    manipulationbenchmark
  475. arxiv:2610.04882 · cs.LG
    ResOPD: Tail Residualization for Sparse On-Policy Distillation
    Penghui Yang, Long Xing, Xuanlang Dai, Ziyu Liu +2

    On-policy distillation (OPD) trains a student model on self-generated trajectories, but transmitting dense teacher distributions across long reasoning traces creates prohibitive communication and memory bottlenecks. Practical systems therefore rely on sparse teacher interfaces, typically transmitting either the sampled-token score or a small Top-$k$ distribution. However, this sparse setting faces a fundamental dilemma: sampled-token estimators are unbiased but suffer from severe gradient variance, whereas directly optimizing Top-$k$ objectives introduces systematic bias. To improve this trade

    memory
  476. arxiv:2610.04875 · cs.LG
    SpecFold: Folding Multi-Branch Redundancy for Faster Speculative Decoding in Diffusion Language Models
    Chung-En Ho, Weiyu Sun, Cheng-Jhih Shih, He Li +3

    Diffusion large language models (DLLMs) generate text through iterative block denoising, and multi-branch speculative decoding accelerates this process by verifying a main branch together with multiple draft branches in a single forward pass. While prior DLLM acceleration methods primarily exploit temporal redundancy across denoising steps, we identify a complementary redundancy axis within each speculative verification step: multi-branch computational redundancy. During speculative verification, draft branches inherit most tokens from their parents while unmasking a small set of additional po

    benchmark
  477. arxiv:2610.04868 · cs.AI
    From Memory to Guide: Spatio-Temporal Composer for Procedural Coding Memory
    Zhixuan Tan, Pengjie Gu, Zhao Li, Yihan Hu +3

    Memory-augmented agents typically integrate procedural knowledge by injecting retrieved skills directly into text prompts. This approach dangerously equates readable text with reliable execution. To bridge this gap, we introduce From Memory to Guide, a novel paradigm that transitions procedural memory from passive text delivery to active, inference-time policy adaptation. We instantiate this paradigm through the Spatio-Temporal Composer, an active policy compiler that explicitly manages exactly how and when retrieved knowledge should be applied. Rather than treating skills as plug-and-play mod

    memoryagent
  478. arxiv:2610.04867 · cs.LG
    Greedy Local Learning for Language Model Pretraining: Gaps and Objective Design
    Jihwan Moon, Sheir A. Zaheer, Jinmyoung Lee, Gunhee Kim +1

    Greedy block-wise local learning splits a network into gradient-isolated blocks trained by local auxiliary losses, deleting the backward pass between blocks: inter-stage communication becomes forward-only and every block can step its optimizer independently, properties directly relevant to decentralized model-parallel training. Local learning is competitive with end-to-end backpropagation on image classification, and on small Transformers it is known to trade a worse best loss for parallel speedup. How this loss gap behaves in autoregressive language model (LM) pretraining at larger scale, and

    memory
  479. arxiv:2610.04864 · cs.CV
    Enhancing Long-Video VLM Embeddings with Query-Aware Streaming Latent Reasoning
    Haozhe Chi, Song Jin, Yang Jin, Yadong Mu

    Long-video embedding requires capturing sparse query-relevant evidence under a limited visual-token budget. Uniform sampling can miss brief events in videos spanning minutes or hours, whereas encoding more frames in a single context increases memory and computation. We introduce \textbf{Query-Aware Streaming Latent Reasoning} (QASLR), a post-training framework that accumulates evidence across clips while keeping the embedding size fixed. QASLR selects a bounded set of frames, restores their temporal order, and processes them clip by clip with a vision-language backbone. A compact set of persis

    memorypost-training
  480. arxiv:2610.04862 · cs.LG
    GitSwarm: Decentralized Compounding Inference
    Vedant Shah, Ankur Samanta, Paras Dahal, Mikhail Plekhanov +10

    Long-horizon problem solving and scientific research require computation to accumulate across successive attempts. Partial solutions, experimental findings, and unsuccessful approaches can inform later work, yet most inference-time computation is organized around individual trajectories or candidates rather than a persistent body of reusable work. We call this paradigm compounding inference: organizing inference-time computation so that intermediate work persists and can be inspected, extended, combined, or challenged by subsequent computation. We instantiate compounding inference in GitSwarm,

    persistent memory
  481. arxiv:2610.04860 · cs.AI
    Invisible Ink, Visible Lies: How Production Watermarking Causes LLMs to Hallucinate
    Haocheng Ye, Aoting Hu, Xinwei Zhang, Xunzhu Tang +2

    Text watermarking helps identify AI-generated content, but its effect on factual reliability remains underexplored. In this paper, we study watermarking hallucination: factual errors induced or amplified by watermarking even when the required evidence is present in the context and the unwatermarked model can answer correctly. Using a controlled retrieval-augmented generation setting, we compare unwatermarked and watermarked generations under the same context, query, and decoding configuration, and quantify their factual accuracy decrease. Across six representative watermarking methods, includi

    retrieval-augmented
  482. arxiv:2610.04851 · cs.LG
    CURIO: Curiosity-Driven Test-Time Learning for Open-Ended Discovery
    Tao Feng, Fangxu Yu, Zijie Lei, Jiaru Zou +4

    Open-ended discovery requires learning from repeated attempts while continuing to explore directions whose value is not yet apparent. Search with a frozen large language model (LLM) can reuse previous solutions in context, but cannot update the model from its successes and failures on the test problem. Reinforcement learning (RL) enables such adaptation; however, strongly favoring high-reward trajectories may suppress low-reward yet potentially promising directions too early. We introduce CURIO, a curiosity-driven test-time learning framework that complements task feedback with an Intrinsic Cu

    world model
  483. arxiv:2610.04850 · cs.LG
    PIT-GCL: Protein Interaction using Topological Graph Contrastive Learning
    Jae Won Choi, Ryoonki Hong, Alan Liang, Manjula Adiveppa Wader +4

    Protein binding prediction is central to target identification, therapeutic binder design, and large scale screening, yet remains challenging because binding depends on sequence, three dimensional geometry, and global structural organization. Recent folding models such as AlphaFold3 and Boltz-2 have substantially improved structure prediction, but their confidence outputs (pLDDT, pTM, ipTM) are not specifically designed for binary binding prediction, and dedicated structure aware predictors often require bound complex structures that are unavailable at screening scale. We introduce PIT-GCL, a

    benchmark
  484. arxiv:2610.04838 · cs.AI
    MemTrace: State-Consistent Memory for Long-Horizon Coding Agents
    Hongming Xu, Le Zhou, ZhongHe Jin, Xiang Zhang +4

    As coding agents take on long-horizon software evolution tasks spanning multiple files and stages, longer execution trajectories introduce two coupled challenges: (1) accumulated histories strain context budgets, and (2) repository changes can invalidate earlier execution evidence. Existing approaches address these challenges through techniques like larger context windows, compression, retrieval, or repository representations, but often fail to reconstruct a consistent task state after a context refresh or verify whether recalled evidence remains valid. Thus, we introduce MemTrace, a provenanc

    memoryagentbenchmark
  485. arxiv:2610.04836 · cs.CV
    RSure-Agent: Reliable Use of Tool Observations for Remote Sensing Agents
    Fuyuan Liu, Nayu Liu, Wenhao Yu, Peijin Wang +4

    Remote sensing agents rely on perception, measurement, and raster analysis tools to solve Earth observation tasks. We refer to their judgments and quantitative results about ground objects as tool observations. However, these observations are subject to substantial uncertainty and may be incorrect even when the tools execute successfully. When agents accept incorrect observations, the errors can propagate through subsequent reasoning and cause task failure. We analyze 1,229 execution trajectories across three remote sensing agent benchmarks. On each benchmark, at least 88.1% of tasks depend on

    agentagent benchmarkbenchmark
  486. arxiv:2610.04830 · cs.AI
    Cluster Validation Indices as Self-Supervised Objectives for Text Representation Learning
    Kishor Kumar Bhaumik, Nicolas Roque dos Santos, Neil Shah, Jia Chen +1

    Self-supervised fine-tuning refines the embedding space of a pretrained language encoder without labels. However, the commonly used approaches are computationally expensive. Specifically, contrastive learning-based methods need multiview data and in-batch negative examples, while negative-free approaches require auxiliary graphs/networks. An interesting question arises: can self-supervised fine-tuning be done without relying on either additional negatives or graph data? To answer this question, we introduce SilK (Silhouette-guided K-means), which trains on a Cluster Validation Index, an intern

    memory
  487. arxiv:2610.04829 · cs.AI
    Viva La Vida: Verification and Accumulation Failures in Multi-Agent Proof Search
    Benji Xu, Ken Zheng, Noah Han

    When an agentic prover works on an open problem, there is no proof assistant to fall back on: its verifier and lemma library are ultimately language models judging model outputs. We instrumented such a system end to end and analyzed $51{,}754$ traced observations across three full runs ($186$ hours, \$$5{,}694$). We find three connected failure modes. First, the three-model verifier requires unanimity and treats parse or API failure as non-approval; in $10$ of $12$ verification events, one member returned no parseable output or an API error, making acceptance arithmetically impossible without

    multi-agentagentic
  488. arxiv:2610.04827 · cs.LG
    GRAM: Correcting Frozen Time-Series Foundation Models via Graph-Retrieved Amplitude Memory
    Xiaoyun Yu, Xiangfei Qiu, Yonggui Huang, Shixiang Tang +6

    Time-series foundation models (TSFMs) enable zero-shot forecasting through large-scale cross-domain pretraining, while retrieval augmentation further improves their performance by leveraging historical information. However, existing methods typically correct TSFM forecasts using the ground-truth futures of similar historical windows, which contain both predictive components already captured by the foundation model and sample-specific random fluctuation that is difficult to transfer. In contrast, recurring systematic model bias within prediction errors more directly characterizes the failure mo

    memorymemory moduleretrieval-augmented
  489. arxiv:2610.04825 · cs.AI
    DICE: Decoupling Capability from Intervention Necessity in LLM Tutoring
    Sayantan Pal, Kaiyi Ji, Rohini K. Srihari

    Fluent guidance is not the same as useful intervention. LLM tutors are typically trained to generate the next teacher utterance, implicitly assuming that every student turn warrants a response. However, our experiments indicate that this conflates tutoring capability (what to say) with intervention necessity (whether to say it). We introduce DICE, a framework that decouples intervention decisions from response generation by first selecting an explicit pedagogical action. To calibrate this action selection policy, we define Intervention Value (IV), a rollout-grounded counterfactual metric that

    benchmark
  490. arxiv:2610.04824 · cs.AI
    Agent Behavior as Code: Efficient and Robust LLM Agents with Programmatic Specifications
    Peng Qi, Chunliang Lyu, Gang Li, Fabian Chan +3

    AI agents based on foundation models (FMs) have demonstrated strong capabilities to perform complex open-ended tasks. However, they face some common challenges in practice: (a) agent behavior can deviate drastically even for semantically similar tasks, leading to catastrophically propagated errors; (b) high cost and latency due to FM calls, repeated in full whenever a task recurs with different inputs; (c) FMs' limited context and instruction following capability confine how well agents manage the ever-growing execution context and follow complex plans. We introduce $\textbf{A}$gent $\textbf{B

    agentai agentllm agentagent benchmarkbenchmark
  491. arxiv:2610.04822 · eess.SY
    Adaptive Control as an Information Gradient Flow: Excitation, Constraints, Energy, and Stochastic Learning
    Omkar Sudhir Patil

    Adaptive control is usually developed through Lyapunov stability, excitation, and parameter convergence, whereas neighboring fields describe learning using convexity, information geometry, variational principles, and stochastic thermodynamics. This paper develops a constrained common language for these viewpoints. For linearly parameterized models, the excitation Gramian is simultaneously the Hessian of accumulated prediction loss and, under Gaussian observations, Fisher information up to scaling. Persistent, finite, and partial excitation become uniform, finite-horizon, and restricted tempora

    memory
  492. arxiv:2610.04819 · cs.CV
    DriftSR: One-Step Real-World Image Super-Resolution via Distribution Drifting
    Wei Zhu, Kai Zhang, Yu Zheng, Zhaopeng Yang +3

    One-step real-world image super-resolution (Real-ISR) offers efficient inference, but recovering realistic and perceptually rich details often relies on score distillation or adversarial learning, introducing additional trainable components and making optimization more cumbersome. To this end, we propose DriftSR, a one-step Real-ISR framework that leverages pretrained diffusion priors through distribution drifting. Specifically, we perform drifting in the frozen intermediate representation space of a pretrained diffusion model, without introducing an additional task-specific feature encoder. B

    benchmark
  493. arxiv:2610.04805 · cs.RO
    ExStereo: Lifting 2D Vision-Language-Action Models to 3D with Explicit Stereo Representations
    I-Chun Arthur Liu, Jason Chen, Gaurav S. Sukhatme, Daniel Seita

    Three-dimensional perception is critical for robotic manipulation, particularly for high-precision tasks, as recovering metric depth and precise 3D object positions from monocular RGB observations is inherently ill-posed. However, many Vision-Language-Action (VLA) models rely solely on RGB observations for perception. Leveraging recent advances in foundation models for stereo matching, we introduce ExStereo, a stereo module that augments pre-trained 2D VLAs with 3D perception. ExStereo reconstructs scene geometry from stereo image pairs and renders multi-view observations as an explicit stereo

    vision-language-actionmanipulationpost-training
  494. arxiv:2610.04802 · cs.LG
    Multi-Agent Spectrum Sharing
    Job Elliott, Graduate Student Member, IEEE, Justin G. Metcalf +1

    This project explores how multiple cognitive radars can learn to share limited wireless spectrum with other radio users without interfering with one another. Using machine learning (ML), each device independently decides where and how widely to transmit within a fixed 100 MHz band. The system analyzes real or simulated signal activity to detect which parts of the spectrum are currently in use and which are open. Based on this information, the devices adapt their transmission choices to avoid crowded frequencies while making efficient use of available space. The goal is to develop a flexible, s

    multi-agentagent benchmarkbenchmark
  495. arxiv:2610.04800 · cs.CV
    MedImageOSWorld: Benchmarking GUI Agents for Medical Image Consoles
    Ziyang Long, Xinqi Li, Lujing Xing, Hsin-Jung Yang

    Graphical consoles offer a practical interface for medical acquisition assistance, allowing agents to work through the controls and visual feedback used by human operators. Reliable assistance requires linking on-screen anatomy to acquisition decisions that determine what image evidence becomes available next. We introduce MedImageOSWorld, a benchmark for evaluating this capability in simulated CT, MR, and ultrasound consoles. Using screenshots and mouse-and-keyboard actions, agents configure protocols, plan acquisitions, inspect the resulting images, and make corrective adjustments across sev

    agentbenchmarkevaluation protocol
  496. arxiv:2610.04794 · cs.AI
    Knowing the Store: What a Memory Backend Must Write Down Before an Agent Can Read It
    Ansuman Mullick, Eray Tüzün

    An agent with long-term memory can answer from a record it should no longer use, such as a plan the user later cancelled. We ask what a memory store must expose for an agent to know this before retrieving anything, and we score that judgment on its own, as metamemory monitoring. Readers see only a value-free summary: record counts by lifecycle state and a list of attribute names. Each of 148 questions is asked against three versions of one store that differ in one attribute, so wording cannot give the answer away. What a model adds depends on the length of that list. On the short lists the ben

    memoryagentbenchmark
  497. arxiv:2610.04793 · cs.AI
    Pressure, Context, and Machine Self-Control: A Criminological Test of Reward Hacking in Generative AI Models
    Murat Ozer, Isaac Kofi Nti

    Recent incidents show that AI agents sometimes reach measured goals through unsanctioned means. This study applies self-control, general strain, anomie, neutralization and routine activity theory to reward hacking in generative AI models, and it treats the measures as behavioral analogues. Study 1 (2,310 conversations, seven models) measured delay discounting with the Kirby Monetary Choice Questionnaire and stated willingness to take shortcuts. Pressure raised the discount rate k 2.8-fold in fresh conversations but 12.6-fold when the same sentence followed a baseline answer, which indicates a

    agentai agent
  498. arxiv:2610.04787 · cs.LG
    Active-DiNTS: Active Differentiable Network Topology Search
    Gean Trindade Pereira, Thierry Urruty, Muriel Visani, André C. P. L. F. de Carvalho

    Neural Architecture Search (NAS) has proved to be a strong alternative to manual network design, but applying it to 3D medical image segmentation is limited by two well-known costs, large annotation budgets and multi-GPU clusters. Thus, this paper introduces Active-DiNTS (Active Differentiable Network Topology Search), an approach that embeds pool-based Active Learning (AL) into a bi-level differentiable topology search to perform architecture discovery and label curation jointly. At each query round, unlabeled MRI volumes are ranked by one of three uncertainty signals (Entropy, Variance, or S

    benchmark
  499. arxiv:2610.04784 · cs.LG
    RepTC: Representation-Aware Optimization for Efficient Traffic Classification on Edge IoT Devices
    Adel Chehade, Edoardo Ragusa, Paolo Gastaldo, Rodolfo Zunino

    Traffic classification (TC) is crucial to secure Internet of Things (IoT) networks, whose edge nodes often operate under privacy, bandwidth, and energy constraints. Yet, encrypted payloads and limited computing power make accurate, real-time TC a challenging task. Existing learning-based TC approaches often fix the input configuration a priori, even though it directly influences both predictive performance and computational cost. This paper presents RepTC, a representation-aware hardware-constrained strategy that addresses session-level TC through joint model and input optimization. The method

    benchmark
  500. arxiv:2610.04778 · cs.LG
    Repeated-Measure Leakage, Distribution Shift, and Reliability under Partial Observation in Patient World Models
    Arjun Subramanian

    Patient world models are increasingly proposed for longitudinal prediction, intervention-aware reasoning, and clinical-trial simulation. Causal or clinical intervention validity is distinct from predictive generalization and reliability; before making stronger claims, the underlying predictive state should generalize across patients, survive realistic shifts and missing observations, and expose failure through meaningful reliability signals. We evaluate these prerequisites in a deliberately narrow setting: short-horizon digital-biomarker forecasting from PhysioNet GaitPDB, comprising 165 parti

    world model
  501. arxiv:2610.04777 · cs.CV
    ARISE: Adaptive Agentic Reasoning with Image-grounded Self-Evaluation for Interpretable IBD Assessment
    Pronoma Banerjee, Anuva Shah, Jason Wu, Md. Masudur Rahman +3

    Inflammatory bowel disease (IBD) requires frequent imaging-based assessment, yet interpretation of modalities such as wireless capsule endoscopy (WCE) and intestinal ultrasound remains heavily dependent on specialist expertise. Vision-Language Models (VLMs) demonstrate significant potential in multimodal medical image analysis, but their clinical adoption is hindered by their insufficient domain-specific reasoning, susceptibility to hallucination, scarcity of high quality training data in fine-grained diagnostics and limited interpretability. We introduce ARISE (Adaptive Agentic Reasoning with

    agentagentic
  502. arxiv:2610.04775 · cs.RO
    Distributed Cascade Force Control of Soft-Tactile-Based Multi-robot System for Object Transportation
    Duy Anh Nguyen, Nhat Minh Dinh Le, Nhan Huu Nguyen, Pham Duy Hung +2

    In this paper, we present a distributed cascade force control system (DCFC) for multiple robots with the aim of pushing a rigid object towards a desired moving target without their inter-robot communication. These mobile robots are equipped with 360-degree vision-based soft tactile sensors utilized to determine contact location and resultant impact force. By investigating the dynamics of moving rigid objects on the flat, we proposed a distributed cascade control. The inner loop control incorporates contact force and positioning, ensuring the robots' pushing contact and application of the desir

    tactile
  503. arxiv:2610.04771 · cs.RO
    Learning Task and Motion Plans from Real Demonstrations with Hybrid Flow Matching
    Zuleika Redondo Garcia, Andreu Matoses Gimenez, Javier Alonso-Mora

    Long-horizon mobile manipulation requires a task plan and the motion that executes it. Generative planners trained on demonstration produce both in one pass, requiring neither a symbolic domain nor search. To date, however, they have relied on thousands of scripted demonstrations of fixed-base arms and executed open loop. This paper presents a hybrid flow matching planner: a single network generates the symbolic plan with masked discrete flow matching and the motion trajectory with continuous flow matching. Unlike prior generative planners, we aim to learn from a much smaller set of demonstrat

    manipulationmanipulator
  504. arxiv:2610.04768 · eess.SY
    ETM-3D: A One-Parameter Multistable Quadratic Flow with an Explicit Absorbing Set and Intermittent Chaos
    Roya Khalili-Amirabadi, Mohsen Jalaeian-Farimani

    We study a one-parameter three-dimensional quadratic flow, denoted ETM-3D, on the benchmark domain $ρ\geq0$. Its homogeneous quadratic triad preserves Euclidean quadratic energy, while the full vector field has constant divergence -8. A shifted quadratic Lyapunov function yields an explicit positively invariant absorbing set and therefore global ultimate boundedness. The equilibria reduce generically to a scalar quartic, with a separate singular case at $ρ=\sqrt{5}$. Continuation reveals two saddle-node bifurcations, a generic transcritical bifurcation, a supercritical Hopf bifurcation, and a

    benchmark
  505. arxiv:2610.04767 · cs.RO
    Flow Policies as Actions of Skill-Level World Models: Learned and Symbolic Abstractions for Long-Horizon Planning
    Andreu Matoses Gimenez, Andrei-Carlo Papuc, Chris Pek, Javier Alonso-Mora

    Latent world models enable robots to plan by predicting the consequences of actions. Planning long tasks with control-rate actions requires many prediction steps, which enlarges the search space and accumulates error. Skill-level actions shorten these sequences, but a symbolic skill vocabulary requires domain knowledge and labeled demonstrations. We construct skill-level actions from the inputs of a flow-matching policy trained on demonstrations segmented into complete skills. The policy maps a noise seed and an observation, optionally with a code or label, to a complete skill execution, so on

    world model
  506. arxiv:2610.04765 · cs.RO
    PatternDex: Learning Interaction Patterns to Guide Reinforcement Learning of Bimanual Dexterous Manipulation of Articulated Objects
    David Minkwan Kim, Runfa Blark Li, Beckham Po-Ju Lee, Nikolay Atanasov +1

    In this paper, we develop a method that enables bimanual dexterous hands to manipulate articulated objects with a high success rate without suffering from an embodiment gap. We observe that the correlation between hand motions and object motions is dictated by the object rather than the hands and can be learned from human-object demonstrations. Based on this observation, we propose PatternDex, a method that learns this correlation and represents it as a token sequence, which we call an interaction pattern. From this pattern, PatternDex estimates the wrist motions and contact points that fit th

    manipulationdexterous
  507. arxiv:2610.04764 · cs.RO
    DNPush: Distributed Nonparallel Pushing Force Control of Multi-Robot Systems for Object Transportation
    Duy Anh Nguyen, Pham Duy Hung, Trung Dung Ngo

    This letter proposes DNPush, a Distributed Nonparallel Pushing force controller for cooperative object transport without inter-robot communication. Each robot uses local force measurements, a preassigned force weight, and a locally expressed desired transport direction, without requiring an object model, contact locations, a CoM estimate, or moment arm magnitudes online. DNPush regulates nonparallel force magnitudes from local force direction misalignments through a reciprocal-sine law. Under the stated contact conditions, Lyapunov analysis with LaSalle's invariance principle proves convergenc

    tactile
  508. arxiv:2610.04756 · cs.LG
    When Is Enough Enough in Self-Evolving LLM Systems?
    Enoch Yin, Bin Liu, Zhengling Qi

    Self-evolving large language model (LLM) systems repeatedly propose, evaluate, and incorporate updates to prompts, skills, or other persistent artifacts. Despite their growing effectiveness, these systems typically operate under a predetermined iteration or compute budget, without a principled criterion to determine when further evolution is no longer worthwhile. This can lead to two undesirable consequences: unnecessary computation after performance has saturated and the risk of returning late updates that overfit or exploit the evaluation signal. These issues motivate us to study two fundame

    self-evolvingbenchmark
  509. arxiv:2610.04753 · cs.AI
    More Value per Key: Asymmetric Sparse Attention for Faster LLM Decoding
    Noam Elata, Itay Lamprecht, Mikey Shechter, Daniel Ohayon +2

    utoregressive generation in Large Language Models (LLMs) is constrained by the memory and computational demands of attention mechanisms. Sparse attention methods mitigate this cost by selecting only high-probability entries of the attention matrix. We observe that in many such methods, this renders the probability-value multiplication negligible, shifting the bottleneck to the query-key step. Key heads can therefore be reduced to accelerate inference, while retaining more value heads preserves capacity with limited additional decoding cost. We introduce Sparse Asymmetric Group-Query Attention

    memorylong contextbenchmark
  510. arxiv:2610.04751 · cs.AI
    Dynamic Routing as a New Dimension for Test-time Versatility of LLMs
    Michal Štefánik, Marek Kadlčík, Josef Kuchař, Michal Spiegel

    Beyond scaling their parameters and data, large language models currently gain versatility on new problems along a single axis: the tokens they spend on chain-of-thought (CoT). We investigate whether dynamic routing programs, which execute a subset of the model's layers or iterate some of them, can open a second axis of test-time adaptation, complementary to CoT and free of any gradient update. Prior work showed that such programs exist and bring accuracy and efficiency gains on problems similar to those they were trained on; we ask whether they can also be identified rapidly, from a handful o

    post-training
  511. arxiv:2610.04749 · cs.AI
    Agentic discovery of blood biomarker from distilled private health records
    Seffi Cohen, Liat Antwarg Friedman, Amir Anisman, Ruth Johnson +6

    Routine complete blood counts (CBCs) could yield new biomarkers, but the private records needed to evaluate candidates cannot be shared with frontier language model agents that excel at discovery. We distilled the evidence held in the Clalit Health Services panel of over 5.4 million patients into a released scoring tool: for each of 13 immune-mediated diseases, a graph attention network was trained inside the data boundary to predict the case-control AUC of candidate CBC expressions, and only the trained weights were released. The tool grounds an agent's propose-score-refine loop in real-world

    agentic
  512. arxiv:2610.04744 · cs.RO
    Lie Rarely, Lie Big: Stealthy Insider Attacks on LLM Robot Teams
    Sribalaji C. Anand, George J. Pappas

    When a team of robots delegates planning and mutual trust to LLM agents, a single compromised robot can corrupt the shared outcome. We study this threat in a grounded task: a multi-robot survey in which measurements can be verified against the physical world, but every verification costs budget that would otherwise advance the mission. We treat the compromised robot as a stealthy adversary in the system-theoretic sense: it is limited not by an energy bound but by the team's own detectors. We then derive two bounds. First, the probability that the adversary's reports are verified is bounded bel

    llm agent
  513. arxiv:2610.04741 · cs.RO
    Robot Learning with Visual Predicted Force
    Haonan Chen, Feiyang Wu, Yuxiang Ma, Mustafa Mete +10

    Force-aware manipulation typically relies on specialized force or tactile sensors. We show that force-aware manipulation can instead be achieved through visual force prediction from the deformation of a compliant Fin Ray gripper. Our approach trains two models. First, we train a visual force estimator on calibration data and use it to annotate task demonstrations with force estimates. Second, we train an action--force proposal policy on these force-augmented demonstrations to jointly generate candidate robot actions and their associated forces. At test time, we sample candidate actions and the

    manipulationtactilegrippergrasp
  514. arxiv:2610.04740 · cs.AI
    Toward a Locally Deployable Agentic Co-Scientist: Small-Model Planning for Early-Stage Drug Discovery
    Tian Liang, Jiayu Chang, Alejandro F. Frangi, Mobarak I. Hoque +1

    Early-stage computational drug discovery requires coordinating heterogeneous scientific tools across multi-step workflows. We present a lightweight, tool-augmented framework in which a locally deployable compact language model plans calls to 18 modular tools. A Unified Molecular Schema maintains shared molecular records, while a plug-in interface supports tool replacement and extension. We construct 1,263 manually refined query-plan pairs through workflow-graph path coverage and apply LoRA fine-tuning to three compact model families. Under the query-level split, all fine-tuned models generate

    agentic
  515. arxiv:2610.04736 · cs.RO
    Probabilistic Pedestrian Forecasts from a Handheld Phone: World-Frame Heat Maps, Visual-Inertial Height Drift, and Evaluation without Ground Truth
    Danial Safaei

    A pedestrian with a phone could be shown where nearby people will be in the next few seconds, if the forecast stays on the ground while the phone moves, is calibrated, and needs only a monocular camera and visual-inertial odometry (VIO). We build and evaluate such a system. People are detected, lifted onto the floor by ray-plane intersection, tracked in a gravity-aligned metric frame, and forecast as per-step probability maps by a small U-Net trained with a negative log-likelihood (NLL) loss on bird's-eye (SDD) and first-person (EgoTraj-Bench) trajectories. On handheld ADVIO recordings, vertic

    benchmark
  516. arxiv:2610.04733 · eess.SY
    Safe Leader-Follower Density Control via Higher-Order Mean-Field Control Barrier Functions
    Cinzia Tomaselli, Mario di Bernardo

    Safety filters for large-scale multi-agent systems can be formulated at the population level through mean-field control barrier functions (MF-CBFs). Most existing formulations are first-order, requiring the control input to appear explicitly in the first time derivative of the safety functional; higher-order extensions have only very recently been proposed for a single, directly actuated population. We consider instead the case in which the population to be kept safe is not directly actuated, but is transported by a field generated by a second, controlled population. For this setting, we devel

    multi-agentagent system
  517. arxiv:2610.04721 · cs.CV
    Knossos and Ariadne: Benchmarking and Learning Complete Diagram Topology Extraction with Vision-Language Models
    Bangwei Guo, Xujiang Zhao, Shengyu Chen, Yanchi Liu +5

    Structural diagrams are widely used to represent complex systems and relational information across scientific, engineering, procedural, and spatial domains. Recent vision-language models (VLMs) have become increasingly capable of recognizing diagram elements and reasoning about their content, while complete diagram topology extraction remains comparatively underexplored. In this paper, we study diagram-to-graph topology extraction: extracting all diagram entities and the complete relations among them. To enable large-scale supervised training and systematic evaluation of this task, we introduc

    benchmark
  518. arxiv:2610.04715 · cs.LG
    GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transport
    Yifan Xu, Shiqian Ma

    We present GPU-accelerated Bregman Douglas--Rachford splitting algorithm (BDRS) for discrete optimal transport problem in three input formats: an explicit cost matrix, a point cloud with a ground cost between them, and a separable cost on a regular grid. For each input format, we propose hardware-aware designs of mathematically equivalent representations for the BDRS iterations to enhance numerical stability and empirical runtime. We benchmark the three proposed implementations against eight GPU baseline solvers from the literature on the same device. We demonstrate that our implementations of

    benchmark
  519. arxiv:2610.04710 · cs.AI
    Organising Trajectory Evidence for Language-Model Agent Assurance: Fragments, Methods, and the Residual
    Xiaowei Huang

    Methods for assessing language-model agents include rule checkers over logs, analyses of skill coverage and composition, support checkers, prefix monitors, execution gates, and rare-event estimators. Each observes a different part of a run and makes a claim of a different strength, and no common account says how these claims combine or what they leave unchecked. We give one, built from a logic, information fragments, and an assurance ledger. Requirements are formulas of a two-tier logic: an outer finite-trace temporal logic over recorded events, and an inner logic of standing over the argument

    agentbenchmark
  520. arxiv:2610.04708 · cs.LG
    Localized Operator Learning with Adaptive Partition-of-Unity Mixture-of-Expert Networks
    Madison Cooley, Ramansh Sharma, Shandian Zhe, Robert M. Kirby +1

    Operator learning methods such as DeepONets and FNOs often struggle with PDE families featuring sharp interfaces, heterogeneous coefficients, and localized multiscale structures. We introduce a partition-of-unity (POU) mixture-of-experts framework for localized operator learning, in which geometry-aware gating networks produce smooth spatial partitions which blend the contributions of local expert networks. Our main contribution is HiRefPOU, a residual-style hierarchical POU architecture for DeepONets that organizes localized representations through nested parent-child partitions while preserv

    benchmark
  521. arxiv:2610.04706 · cs.AI
    VoCa: Designing Speech-Canvas Interaction for Voice-Based Conversational Agents
    Yate Ge, Run Yuan, Yueran Qi, Wenjie He +6

    People write and sketch while speaking to explain, organize, and develop content together. Inspired by these practices, we investigate how voice agents can use a canvas alongside speech in multi-turn conversations with users. We conducted a two-part formative study: an observational study of how pairs coordinated speech and boardwork, followed by a design workshop that informed a design space for speech-canvas interaction with voice agents. Building on these insights, we developed VoCa, a voice agent that coordinates speech with visual object creation, annotation, and attention guidance. A fiv

    agent
  522. arxiv:2610.04701 · cs.RO
    Test-Time Training as Residual Memory for Robot Policies
    Haoxuan Wang, Gengyu Zhang, Ramana Rao Kompella, Gaowen Liu +1

    Memory is essential for long-horizon robotic manipulation, where successful actions may depend on past events that are no longer recoverable from the current observation. As episodes grow longer, however, retaining the full history becomes increasingly costly, creating a fundamental scalability challenge for memory-augmented policies. Existing approaches address this challenge by either storing selected past observations in a bounded memory bank or compressing interaction history into a fixed-size parametric state through Test-Time Training (TTT). Yet these formulations do not explicitly disti

    manipulationmemorybenchmark
  523. arxiv:2610.04700 · cs.CV
    Decouple, Purify and Unite: Semantic-Structural Prototype Learning for Federated Medical Segmentation
    Xingyue Zhao, Wenke Huang, Linghao Zhuang, Yanzhou Su +10

    Federated learning enables medical institutions to train a global model without sharing data, yet feature heterogeneity from diverse scanners or protocols remains challenging. Existing representation-based methods face two limitations: 1) Incomplete Contextual Representation Learning: single-layer or coupled representations overlook multi-level structural cues and entangle regional semantics with boundary details. 2) Layerwise Style and Aggregation Biases: domain-specific style discrepancies across intermediate layers degrade prototypes, while aggregation that overlooks client distribution shi

    benchmark
  524. arxiv:2610.04699 · cs.AI
    Not Self-Decidable: LLMs Cannot Draw the Boundary of What an Agent Verifier Can Check
    Anthony Rhodes

    A verifier for an agent faces rules of two kinds: the ones a fixed check can settle and the ones that require a judge. A team that derives its own checks fixes that split up front. Where the requirements come from outside, as in finance, healthcare and law, the agent enforces rules it did not write, so the split falls to runtime, recurring for every predicate of every rule on every action at a rate no reviewer can audit. Every escalation scheme assumes a model can make that decision itself, that it is self-decidable. Across six corpora, including the EU AI Act, FINRA guidance and a deployed cr

    agent
  525. arxiv:2610.04696 · cs.LG
    Score-Calibrated Flow for Sampling from Unnormalized Densities with Applications to Generative Online Reinforcement Learning
    Zeyang Li, Yunan Wang, Risheek Garrepalli, Mohammad Ghavamzadeh +1

    Diffusion and flow models provide expressive policy classes for online reinforcement learning (RL), enabling multimodal behaviors and improved performance. However, training these policies remains challenging: the critic specifies the desired policy as an unnormalized Boltzmann density but does not provide direct samples from it. Many existing methods rely on importance sampling to construct training signals, which can suffer from high variance, increasing computational cost and destabilizing training. We propose Score-Calibrated Flow (SCF), a simple and efficient algorithm for training genera

    benchmark
  526. arxiv:2610.04695 · cs.LG
    Low-Fidelity FDM Spectral Guidance for Neural Eigenvalue Solvers
    Aryan Chaudhary, Manikandan Padmanaban, Jagabondhu Hazra

    Operator eigenvalue problems appear throughout science. Classical methods usually discretize the operator into a matrix and then solve the resulting matrix eigenvalue problem. This works well in low dimensions, but fine grids quickly become expensive in both memory and computation as the dimension grows. Neural network based solvers avoid storing these large grids, but recent state of the art neural methods can require hundreds of thousands of training steps and may struggle to find the desired eigenvalues. We show that the two approaches can help each other. A coarse finite difference method

    memory
  527. arxiv:2610.04693 · cs.AI
    Penumbra: Sample-Efficient Adversarial Search for Regulatory Obligations
    Anthony Rhodes

    Agents are entering finance, healthcare and law, sectors where a violation leaves no lexical signature and carries real penalties. Whether an omission is material, or a disclosure sufficient, depends on what the response left out. Probing such an obligation means finding responses one minimal edit from flipping compliance, and every probe costs a generation and two adjudications, so the binding constraint on regulatory red-teaming is sample efficiency, not volume. We introduce Penumbra, an adversarial search that walks from a verified anchor under an expanding edit budget until a two-evaluator

    agentevaluator
  528. arxiv:2610.04691 · cs.AI
    RAGStress: A controlled benchmark for evaluating retrieval-augmented generation under knowledge-base degradation
    Shiqi Yang, Jiekai Ma, Gaoyuan Du

    Retrieval-Augmented Generation (RAG) is typically evaluated under the implicit assumption that the underlying knowledge base (KB) is clean, leaving the behaviour of RAG systems under realistic KB degradation poorly characterised. We introduce RAGStress, a controlled evaluation benchmark for stress-testing RAG systems under systematic KB corruption. The benchmark pairs four naturalistic corruption types (factual corruption, numeric typo, relevance poisoning, and contradiction injection) with three severity levels (subtle, moderate, and obvious) over a single-KB, metadata-filtered experimental d

    retrieval-augmentedragbenchmarkleaderboard
  529. arxiv:2610.04690 · cs.LG
    SepRQ : Self-Supervised Speech Mixture Representation Learning via Mask-Free, Multi-Scale Source Separation
    Séverin Baroudi, Hervé Bredin, Ricard Marxer

    Self-supervised learning (SSL) is standard for speech representation learning, but mainstream models are designed around single-speaker audio, limiting their usefulness in multi-speakers scenarios. We present SepRQ, an open-source SSL framework that replaces masked prediction with a pseudo-source-separation objective over frozen random-projection codebooks. By adopting a novel mask-free, multiresolution approach, SepRQ achieves state-of-the-art performance in Speaker Diarization and Speech Separation on the SUPERB benchmark, surpassing WavLM and other cocktail-party derived SSLs at both Base a

    benchmark
  530. arxiv:2610.04686 · cs.LG
    When Debate Helps: Proposal Supply and Verification-Aware Readout in Multi-Agent Reasoning
    Zihao Zhao, Tunyu Zhang, Haizhou Shi, Yusong Zhao +2

    Multi-agent debate can improve reasoning, yet often fails to beat simple majority voting. We argue that successful debate requires two distinct mechanisms: proposal supply must surface a correct answer, and readout must identify that answer when voting misses it. We formalize the first requirement through recoverable headroom, which measures cases where a correct proposal is available but the majority answer is wrong. For the second, we develop Latent Verification Debate (LVD), an accounting model in which candidate proposals receive answer-specific verification evidence before final generatio

    multi-agentbenchmark
  531. arxiv:2610.04681 · cs.RO
    RoboIRS: Inference-Time Internal Representation Steering for Generalist Robot Policies
    Jiuzhou Lei, Chang Liu, Dayou Li, Zhiyuan Zhang +4

    Vision-language-action (VLA) and world-action models (WAMs) often degrade under out-of-distribution task variations despite retaining partial task capability. To recover such capability, we propose RoboIRS, an inference-time internal representation steering method that uses successful and failed rollouts to train linear classifiers, select outcome-relevant intervention locations, and derive task-specific steering directions without updating policy parameters. On 15 simulation tasks with a frozen $π0.5$ policy, RoboIRS improves the average success rate from 44.4% to 66.2%, outperforming alterna

    vision-language-actionmanipulation
  532. arxiv:2610.04672 · cs.AI
    MASBench: Benchmarking LLM-based Multi-Agent Collaboration under Partial Observability
    Qizhi Chu, Zekai Yu, Sijie Wen, Yang Liu +4

    Large language models (LLMs) have progressively evolved into the core of autonomous agents. Building on this progress, LLM-based multi-agent systems (MAS) coordinate multiple agents into a synergistic team to accomplish complex tasks that exceed the capabilities of individual agents. The effectiveness of such systems depends not only on the agents themselves, but also on how collaboration mechanisms are designed and organized. Note that real-world collaboration is typically partially observable, where each agent can only access partial information about the environment due to physical or priva

    agentautonomous agentmulti-agentagent systemagent benchmarkbenchmark
  533. arxiv:2610.04665 · cs.AI
    Efficient Neural Surrogates for Linear Radiation Transport on the Lattice and Hohlraum benchmarks
    Carmelo Gonzales, Steffen Schotthöfer, Cory D. Hauck

    Linear radiation transport equations (RTEs) form the simulation foundations underpinning design and analysis tasks in nuclear engineering, inertial confinement fusion, medical imaging, and astrophysics, but resolving the high-dimensional phase space at engineering fidelity remains expensive enough that outer-loop workflows, such as design optimization, uncertainty quantification, and parameter sweeps, are routinely budget-bound on traditional solvers. Neural surrogates promise to relax this bottleneck by amortizing simulation cost across thousands of downstream queries, but the architectural c

    benchmark
  534. arxiv:2610.04664 · cs.CV
    FLASHSWIN: Unlocking Large Windows and Dense Tokens in Swin Vision Transformers with Memory Efficient Attention
    Tushar Kataria, Gerald Sabin, Ponnuswamy Sadayappan, Shireen Y. Elhabian

    High-resolution vision backbones have long been forced to trade away local token density to afford larger receptive fields. Hierarchical Swin transformers impose this compromise because standard windowed attention materializes an $M^2\times M^2$ score matrix per window, incurring $O(M^4)$ memory as windows or token grids grow. Furthermore, Swin adds a learned relative-position bias elementwise to attention scores, requiring full materialization of the score matrix and its gradient. This keeps Swin and SwinV2 trapped in a small-window($M=8,16$), coarse-token regime with patch size $4\times4$ ($

    memory
  535. arxiv:2610.04662 · cs.RO
    Differentiable Ternary Temporal Logic Semantics with Polynomial Surrogate Networks
    Ryan Matheu, Sai Sandeep Damera, John S. Baras, Calin Belta

    Temporal logic provides designers a formal reasoning tool for specifying complex spatio-temporal behaviors and tasks for autonomous systems. Many techniques exist for control synthesis according to temporal logic specifications, spanning a large variety of systems, including robotics. However, the vast majority of implementations are limited to Boolean temporal logics. Boolean temporal logic does not have an innate mechanism for quantifying abstention, rather verdicts are either definitively \textit{True} or \textit{False}. Recent work demonstrates that ternary logic is a capable formalism for

    manipulator
  536. arxiv:2610.04659 · cs.RO
    PermVLA: Factorization Order as a Regularizer for VLA Learning
    Yanqiao Chen, Yuhan Rui, Dongsheng Hou, Zijie Nie +2

    Vision-language-action (VLA) policies commonly learn action chunks through a fixed left-to-right (LTR) factorization, although the same expert trajectory distribution admits many valid chain-rule factorizations. We identify factorization order as an overlooked regularization choice and introduce causally anchored permutation (CAP), which samples action reveal orders with a tunable chronological prefix. Its auxiliary objective trains one shared policy to predict actions from different known subsets of the same expert chunk, while deployment retains deterministic LTR control. We call this condit

    vision-language-actionvlalibero
  537. arxiv:2610.04657 · cs.LG
    Path Laplacian Encodings for Directed Graphs
    Lydia Mezrag, Semih Cantürk, Michael Perlmutter, Bastian Rieck +1

    Directed graphs naturally model many real-world systems in which interactions are asymmetric, such as citation networks, web graphs, and information-flow networks. However, graph learning methods commonly rely on message passing with symmetrized graph representations or positional encodings that only partially exploit edge directionality. We introduce PathLapPE, a novel spectral positional encoding (PE) derived from the path Laplacian on directed graphs. PathLapPE provides node- and edge-level features that encode directional higher-order structure and can be incorporated into standard graph l

    benchmark
  538. arxiv:2610.04651 · cs.LG
    GS-Codec: A Gaussian-Splatting Bottleneck for Neural Audio Coding
    Ron Aluf, Alon Canfi, Eliya Nachmani

    Neural audio codecs compress waveforms into compact discrete tokens that underpin speech language models, real-time communication, and large-scale audio storage. Almost every dominant design, including residual vector quantization, finite scalar quantization, and single-codebook variants, follows the VQ-VAE template by partitioning the encoder latent through a learned codebook or a fixed scalar grid. We ask whether this partition is necessary. We introduce GS-Codec, a neural speech codec whose bottleneck is a parametric signal decomposition rather than a quantizer. We adapt Gaussian splatting

    post-training
  539. arxiv:2610.04646 · cs.AI
    SEIS: Self-Evolving Inference Systems
    Zhen Xu, Jingyu Liu, Zongze Li, Tahseen Rabbani +1

    Inference systems determine how fast and how cheaply language models can be served, so making them faster has direct practical value. However, prior work focuses mostly on optimizing certain parts such as kernels or memory within the large system. In this work, we take a holistic approach and apply agentic self-evolution to optimize the whole system end-to-end. Our SEIS (Self-Evolving Inference Systems) autonomously optimizes the entire mini-sglang engine without human intervention through iterative sessions with inherited experiences and code changes. Serving Qwen3-0.6B on H100, the resulting

    memorylong-contextagenticself-evolving
  540. arxiv:2610.04642 · cs.CL
    Grounding Probes: Generator-Independent Hallucination Detection from Observer Model Hidden States
    Michael Rathmayr, Ádám Kovács, Gábor Recski

    Detecting responses that retrieval-augmented generation does not ground in its context trades speed against accuracy: surface checks miss paraphrased fabrication, sampling-based methods cost extra generations. Hidden-state probes sit between the two, but every existing one reads the generating model's own activations, so a change of generator invalidates the detector and a closed-weight generator is out of reach. This paper removes that coupling. The Grounding Probe is logistic regression over the mean-pooled middle-layer hidden states of an observer language model that reads the context, ques

    retrieval-augmented
  541. arxiv:2610.04636 · cs.LG
    Does Neural Complexity Improve Health Misinformation Detection? A Leakage-Controlled Cross-Corpus Benchmark
    Mkululi SIKOSANA

    Increasing architectural complexity is often assumed to improve health misinformation detection, yet reported gains are difficult to interpret when studies use different corpora, preprocessing pipelines, data splits, and leakage controls. This study provides a controlled cross-corpus benchmark of five compact neural architectures (1D-CNN, LSTM, BiLSTM, CNN-LSTM, and CNN-BiLSTM), a soft-voting neural ensemble, and three classical machine-learning baselines using COVID19-FNIR and CONSTRAINT. Exact-text duplicate controls were applied before modelling; all neural systems used a common preprocessi

    benchmark
  542. arxiv:2610.04626 · physics.optics
    Vector field dark matter search with Sagnac interferometer
    Yuki Inoue, Quynh Lan Nguyen, Ippei Obata

    We present the first calculation showing that a material-asymmetric Sagnac speed meter can improve quantum-noise-limited sensitivity to $B-L$ vector dark matter by nearly two orders of magnitude over a Fabry--Perot Michelson position meter at the low-mass end of the band. We introduce material contrast into a dual-ring interferometer to probe composition-dependent $B-L$ forces and compare the two configurations at equal incident power, input-mirror transmissivity, and cavity round-trip length. For sapphire mirrors and a one-week benchmark, the quantum-noise-only median expected $95\%$ CL upper

    benchmark
  543. arxiv:2610.04616 · cs.RO
    PerturBot: Breaking Shortcut Priors in Vision-Language-Action Models with Perturbative Training
    Mingyu Liu, Chonghao Sima, Tianjian Feng, Hanqing Wang +3

    A vision--language--action (VLA) policy can complete complex tasks while ignoring the evidence that should determine its actions. An object held near the wrist camera can displace the instructed target. Language and action show the same pattern: a familiar noun can trigger the operation it was paired with in training even after the verb changes, and a gripper that closed on nothing may lift anyway. We call these dependencies modality shortcuts: regularities in successful demonstrations make visual, lexical, or motor cues sufficient to predict expert actions without the task evidence needed for

    vision-language-actionvlagripperevaluation framework
  544. arxiv:2610.04614 · eess.SY
    Approximate Feedback Nash Equilibria in Constrained Differential Games via Model Predictive Control with Upper Bound Guarantees
    Balint Varga, Karl Handwerker, Imre Rudas, Peter Galambos

    Physical human--machine interaction and other multi-agent control settings require decision-making policies that adapt online. Differential games provide a principled framework where each agent optimizes an individual objective while anticipating the other's response. The relevant solution concept in many applications is the feedback Nash equilibrium (FNE), which yields time-consistent state-feedback strategies. However, computing the FNE is demanding and becomes intractable when state and input constraints must be enforced, motivating the need for approximate methods. This paper presents a Mo

    agentmulti-agent
  545. arxiv:2610.04612 · cs.RO
    An End-to-End Framework for Modelling Pneumatic Soft Robots Based on Differentiable Finite Element Methods
    Shaohong Zhong, Yao Yao, Perla Maiolino, Ingmar Posner

    Soft robots present significant modelling challenges due to their non-linearity, complex dynamics and potentially intricate geometries. These difficulties in accurate system identification and dynamics modelling limit their applications in precise robotics tasks. Prior modelling approaches typically suffer from trade-offs in accuracy, computational efficiency, or speed. The differentiable finite element method (FEM) offers a promising balance between these desiderata for soft robot modelling, and enables the use of gradients for efficient calibration and trajectory optimisation. In this paper,

    grasp
  546. arxiv:2610.04609 · cs.RO
    Exploiting Hierarchical Controller Structure in Contextual Parameter Learning for Humanoid Loco-Manipulation
    Sebastian Hirt, Lukas Theiner, Jan Peters, Rolf Findeisen

    Hierarchical control architectures are widely used to decompose complex control problems into interacting control levels and are particularly important in robotics, where planning, whole-body motion, and lower-level control must be coordinated across different levels of abstraction and time scales. Their overall closed-loop performance, however, depends strongly on parameters distributed across the hierarchy, such that tuning controllers on different levels independently may neglect relevant cross-layer interactions. We propose a contextual Bayesian optimization framework for joint parameter l

    manipulationhumanoidwhole-body control
  547. arxiv:2610.04607 · cs.RO
    ForeAct3D: Policy-Grounded Future World Modeling for VLA Policies
    Zhe Tao, Feiran Wang, Gaowen Liu, Ramana Rao Kompella$ +1

    Robots need to anticipate how their actions will change the world, since manipulation success hinges on the resulting contacts and object motions. However, existing Vision-Language-Action (VLA) policies that predict future observations from shared features leave the forecast decoupled from the actions the policy will actually execute, and impose no physical constraints on how the scene may evolve. We introduce ForeAct3D, a framework for policy-grounded future world modeling within VLA policies. Learnable geometric queries decode depth, semantic segmentation, and camera pose from the policy rep

    vision-language-actionvlamanipulationliberoworld model
  548. arxiv:2610.04606 · cs.CV
    Sparse-View 4D Gaussian Splatting via Spatiotemporal Priors and Generative Assistance
    Shengqi Wang, Zhengxian Yang, Kaiwen Tian, Yang Liu +5

    We present a 4D Gaussian Splatting framework for the Sparse-View Track of the SIGGRAPH Asia 2026 Volumetric Video Challenge, which requires dynamic scene reconstruction from only six cameras with wide baselines. To achieve robust dynamic reconstruction under such sparse views, our framework integrates three components. (1) Region-adaptive spatial priors: We use foreground masks to guide Gaussian initialization and mask voting to control densification separately for the dynamic foreground and static background. Background geometry is regularized using monocular depth aligned to metric scale. (2

    benchmark
  549. arxiv:2610.04605 · cs.LG
    ConEx: Human-Interpretable Saliency Maps via Concept-Aware Attribution
    Yehonatan Elisha, Oren Barkan, Ziv Weiss Haddad, Noam Koenigstein

    Many visual explanation methods in computer vision highlight pixel importance but struggle to link these low-level cues to semantically meaningful concepts, limiting their interpretability and trustworthiness. We introduce Concept-based Explanations (ConEx), a novel framework that bridges saliency visualization with concept-based reasoning to provide both faithfulness and interpretability. ConEx automatically discovers class-specific concepts and represents them through concept activation vectors (CAVs), learned without manual supervision using an architecture-specific masking mechanism that r

    benchmark
  550. arxiv:2610.04604 · cs.LG
    Anticipating the Consequences of Curriculum Decisions with Large Language Models
    Octavio Pappalardo, Nathan Herr, Tim Rocktäschel

    Automatic curriculum learning can improve the effectiveness of reinforcement learning by selecting the training experiences presented to the agent over time. Predicting the consequences of such decisions can, however, be difficult. We analyze automatic curriculum learning as a sequential decision-making problem, highlighting a gap between the quantities that determine the value of curriculum decisions and the information captured by local learning signals commonly used to guide them. We then investigate whether Large Language Models (LLMs) can exploit richer information about the learning prob

    agentonline learningcurriculum learningbenchmark
  551. arxiv:2610.04600 · cs.LG
    Asymptotically Optimal Best Arm Identification with Fixed-Budget under Differential Privacy
    Keqin Chen, Jie Bian, Yulian Wu, Vincent Y. F. Tan

    Best arm identification under differential privacy is a pure-exploration problem in which both statistical efficiency and privacy protection must be achieved simultaneously. We study fixed-budget best arm identification for bandits under pure $ε$-differential privacy, where the learner must recommend an arm after a prescribed sampling budget while protecting the full transcript. We prove that the optimal exponential decay rate of the error probability is upper bounded by an instance-dependent privacy-aware transportation exponent that differs from the analogous quantity used to characterize th

    benchmark
  552. arxiv:2610.04596 · cs.LG
    DiffGate: Difficulty-Gated Teacher Guidance for On-Policy Distillation
    Karn Tiwari, Varnith Chordia, Prathosh A P

    On-policy distillation (OPD) has emerged as a widely used paradigm for post-training large language models, reducing the train--test mismatch of conventional distillation by supervising the student on its own generated trajectories. However, existing OPD objectives remain largely token-local and outcome-agnostic, optimizing teacher--student agreement at each prefix despite reasoning quality being determined at the trajectory level. Reinforcement learning with verifiable rewards (RLVR), particularly Group Relative Policy Optimization (GRPO), provides complementary outcome-level supervision but

    post-trainingevaluation protocol
  553. arxiv:2610.04589 · cs.CL
    StegoMemory: Agentic Memory Acts as Covert Steganographic Channel
    Snehasis Mukhopadhyay, Arun Nair

    Is agentic memory robust against stealthy steganographic attacks? We carry out a large-scale red-teaming exercise to test whether agents can encode attacker-controlled strings in one session and recover them in another without triggering safety oversight. Following SHADE-Arena-style tasks, we embed malicious side tasks to encode secret strings using steganography within otherwise benign tasks and evaluate them using independent task-completion and safety oversight. We test 14,000 attack trials spanning 91 model-attack configurations, 13 models, and 7 steganographic schemes: Acrostic, Mesostic,

    memoryagentic
  554. arxiv:2610.04585 · cs.CV
    Frozen in a Frame: The Velocity Blind Spot in JEPA World Models
    Tinghe Zhang, Chunyu Liu, Yu Leon Liu, Zerui Zhao +5

    Joint-embedding predictive architectures (JEPAs) for world modeling train an encoder so a predictor maps a current embedding and action to the next frame's embedding, always from a single rendered frame. This has a structural blind spot: a renderer without motion blur draws a scene from configuration alone, so a single-frame embedding carries no velocity information, for any encoder, including the official released LeWM weights. We confirm this on official checkpoints across four real benchmarks (PushT, Reacher, Cube, TwoRoom): every linear velocity probe sits at or below chance while position

    world modelbenchmark
  555. arxiv:2610.04580 · cs.AI
    Strong Helps Weak: Directional Cross-Modal Alignment Transfer in Multi-modal LLMs
    Hoigi Seo, Byung Hyun Lee, Minjun Kim, Dohyun Mah +2

    Multi-modal large language models (MLLMs) achieve strong modality understanding by pairing a large language model (LLM) with an encoder for a target modality such as vision, video, or audio. However, improving an MLLM's capability for a given modality typically requires additional training on large modality-specific datasets, incurring substantial data collection and compute costs. Model merging offers an alternative, but it is often infeasible for data-scarce, large per-sample size, or domain-specific modalities (\textit{e.g.}, audio and video), where same-modality model variants are rarely a

    benchmark
  556. arxiv:2610.04578 · eess.SY
    Control-Compute Governance in Agentic AI-RAN: AI Agents as Both Controllers and Workloads
    Le Xia, Rose Qingyang Hu, Yuan Zhou, Haijian Sun

    Recent advances in artificial intelligence-radio access network (AI-RAN) are placing large language model (LLM)-driven agents within the open RAN (O-RAN) control hierarchy. A promising deployment for this agentic AI-RAN co-locates LLM inference with physical-layer (PHY) communication processing over the same accelerated compute pool for infrastructure sharing, data locality, and low control latency. However, this co-location induces bidirectional control-compute coupling, as the agent competes with PHY processing for compute, while its reasoned gNB control actions may alter future PHY workload

    agentai agentagenticbenchmark
  557. arxiv:2610.04575 · cs.AI
    From Probe Scores to Alarm Policies: Operational Validity of Activation Monitors for Language-Model Agents
    Xueping Gao

    Activation probes can predict safety-relevant properties of language models with high area under the receiver-operating-characteristic curve (AUROC), but deployed agent monitors make thresholded alarm decisions under tight false-alarm budgets. These are different estimands. We introduce an Operational Validity Contract that fixes a monitor's target, observability, identity, timing, intervention unit, comparator, calibration, and cost. We formalize risk at the semantic request or trajectory level: when one task contains repeated alarm opportunities, row-level AUROC and false positive rate do no

    agentbenchmark
  558. arxiv:2610.04572 · cs.LG
    Only Project Once: Projection-Adaptive Loss for Exact Constraint Satisfaction
    Tim Aebersold, Soheyl Massoudi, Mark Fuge

    Precise constraint satisfaction is a prerequisite to deploying learned models in many areas, motivating methods that repair raw neural predictions with a repair procedure. Current methods unroll multiple repair steps in training and softly penalize constraint violations that remain after the unroll. This is compute- and memory-intensive, lacks robustness when the repair fails to converge, and surrenders most of the constraint satisfaction work to the repair. Our central finding is that, contrary to common practice, a single detached projection step suffices in training. We accomplish this with

    benchmark
  559. arxiv:2610.04561 · cs.AI
    Recursive Improvement of a Differentiable Scientific Software Ecosystem
    Pengcheng Hou, Xiaojun Tan, Sihan Hu, Ruisi Wang +4

    Differentiable programming connects scientific computation with gradient-based inference, learning and design. Extending these capabilities across a heterogeneous software ecosystem requires specialized effort to implement derivatives, integrate interfaces and evaluate quality. AI coding agents can accelerate this transformation, but translating their capabilities into useful scientific software requires identifying research needs and evaluating how well implementations meet them. We present an environment for agent-driven evolution of differentiable scientific software that connects demand id

    ai agentbenchmark
  560. arxiv:2610.04559 · cs.LG
    Coupling Noisy Pairwise Knowledge to the DAG Posterior for Causal Discovery
    Guoliang Xu, James E Corter

    External causal reports can improve structure learning from limited observations, but their reliability varies across sources and variable pairs. We introduce HB-NoisyKG, a Bayesian framework that combines observational data with repeated causal reports from sources such as large language models. Each report is a noisy observation of a direct pair state implied by one DAG. A feature-conditioned Beta prior pools information about pair reliability, and a shared error matrix captures systematic mistakes. Alternating inference uses the graph posterior to refine reliability estimates, which determi

    benchmark
  561. arxiv:2610.04558 · cs.LG
    ClimateBench v2.0: Probabilistic Climate Model Benchmarking
    Duncan Watson-Parris, Willa Tobin, Aytaç Paçal, Manuel Schlund +31

    We present ClimateBench v2, a standardized protocol for evaluating climate models on diagnostics expected to be informative for their skill in projecting mid-century regional temperature and precipitation changes. The protocol is designed to evaluate any physics-based, data-driven, or hybrid climate model on equal footing using a common set of observational and out-of-distribution tests. We define three tiers of evaluation. Tier I establishes physical credibility through entry-ticket tests of energy conservation, coupled (co-)variability, and basic forced responses. Tier II scores models again

    benchmark
  562. arxiv:2610.04555 · cs.AI
    $\mathrm{TRIZ}^{a}$: Guiding Agent Evolution from Pattern Recognition to Solution Invention
    Wenyin Liu, Yiheng Huang, Kai Wang

    We propose $\mathrm{TRIZ}^{a}$ (TRIZ exponentiated by an agent), a general R\&D automation paradigm that combines TRIZ inventive theory with LLM-driven agent evolutionary search. TRIZ's 40 inventive principles and contradiction matrix provide structured, explainable directions for solution generation, replacing random or untyped mutation with theory-guided ideation. Functional information (FI), operationalized under a frozen reference contract, is combined with TRIZ Ideality to measure useful and harmful function on a commensurable information scale, while hard gates keep promotion distinct fr

    agent
  563. arxiv:2610.04545 · cs.RO
    Nonlinear Density-Driven Optimal Control (D2OC) for Multi-Agent Spatial Coverage via Sequential Convex Programming
    Julian Martinez, Kooktae Lee

    This paper presents a nonlinear extension of Density-Driven Optimal Control (D2OC) for multi-agent spatial coverage with prescribed density distributions. Rather than assigning individual target locations, D2OC drives the collective spatial distribution of agents toward a desired density through a Wasserstein-based objective. We extend this framework to multi-step finite-horizon control for discrete-time control-affine nonlinear systems using sequential convex programming. At each control update, the nonlinear dynamics are locally linearized over the prediction horizon, yielding a strictly con

    multi-agentagent system
  564. arxiv:2610.04544 · cs.LG
    Label Agreement Does Not Measure Authorization
    Amir Sabbaghziarani, Bradley Thomas Baker, Theodore J. LaGrow, Sergey Plis

    Many groups now delegate label ontology and metadata harmonization to agentic LLM pipelines. We built one and audited it. Our aggregate scores looked healthy, but the pipeline kept failing in ways they did not show, so we set out to find what they hid. Label agreement asks whether a proposed label matches a reference. It does not ask whether the agent was entitled to propose it, whether the output was complete enough to act on, or whether the label moved when the evidence moved. We measured those three separately on COBRE and FBIRN, two schizophrenia and control neuroimaging cohorts from diffe

    agentagentic
  565. arxiv:2610.04540 · cs.RO
    DreamFormer: Dream Imitation with a Transformer World Model for Language-Conditioned Robotic Manipulation
    Mostafa Kotb, Cornelius Weber, Muhammad Burhan Hafez, Stefan Wermter

    We introduce DreamFormer, a model-based agent that acquires language-conditioned, multi-task skills by imitating expert demonstrations within the latent imagination of a learned world model. DreamFormer first learns a task-agnostic Transformer world model from unstructured play data, then acquires task-specific behaviors by optimizing an intrinsic reward that aligns agent-generated rollouts with expert demonstrations in latent space. Since the policy is trained on-policy inside imagination, it is exposed to its own errors during training, mitigating the covariate shift inherent to offline beha

    manipulationworld modelagentbenchmark
  566. arxiv:2610.04539 · cs.AI
    Action-Consequence Alignment for Reliable Planning and Self-Improving in Latent World Models
    Jinping Wang1, Zhiqiang Gao, Xiantong Zhen, Ling Shao

    Latent world models learn to predict observed transitions, yet low prediction error alone does not guarantee reliable planning. Inspired by self tickling experiments in neuroscience showing that disrupting motor sensory correspondence increases prediction mismatch, we examine whether learned world models preserve an analogous action consequence correspondence.The results show nearby alternatives can receive lower prediction errors despite producing physical outcomes farther from the recorded target. With that future treated as a goal, this reveals a concrete prediction planning mismatch: the m

    world modelself-improving
  567. arxiv:2610.04537 · cs.LG
    PhaseGate: Phase-Aware CPU Retrieval Scheduling for On-Device LLMs on Unified Memory
    Seoyoon Yum, Sehoon Kim

    On-device assistants run GPU-based LLM inference alongside CPU retrieval on unified-memory systems. Under a saturated local-retrieval workload, four concurrent retrieval workers raise 95th-percentile (p95) decode latency by 60-61% on two M4 systems, whereas prefill latency rises by only 5.7-6.9%. We study LLM phase as an admission signal for independent CPU retrieval under controlled LLM workloads. PHASEGATE calibrates separate concurrency limits for prefill and decode, selecting four and one on our base-M4 configuration. Under a backlogged queue, it achieves 2.0 times the aggregate retrieval

    memory
  568. arxiv:2610.04536 · cs.RO
    WasserMan: Benchmark for Underwater Manipulation Policy Learning
    Danil Belov, Artem Erkhov, Sergei Parsegov, Pavel Osinenko

    Underwater manipulation couples visual decisions, contact forces and a thruster-controlled floating base. We introduce WasserMan, to our knowledge the first multi-task simulation benchmark for visuomotor learning of floating-base underwater contact manipulation. It provides ten expert-solvable tasks, two vehicle-arm platforms, a bimanual configuration and underwater dynamics. Nine tasks have learned-policy evaluations. We compare ACT, diffusion policies (DP) and behavioral cloning on six tasks, with three training runs and equal sampled-window budgets. Pretrained SmolVLA adds evaluations on th

    manipulationbenchmarkpolicy evaluation
  569. arxiv:2610.04529 · cs.CV
    TAME:Topology-Aware Text-Driven Motion Editing across Heterogeneous Humanoid Skeletons
    Qichen Zheng, Siyuan Yang, Chong Wang, Jun Liu +3

    Text-driven motion editing modifies an existing motion sequence according to a text instruction while preserving the content of the source motion. Existing methods are typically built for a single, fixed skeletal topology, which limits their use in animation pipelines where characters differ in joint count and skeletal hierarchy. We present Topology-Aware Motion Editor (TAME), a flow-matching transformer that edits motions on humanoid skeletons of varying topology. TAME represents motion as per-joint, per-frame tokens and models interactions among joints, across frames, and with the text instr

    humanoidevaluation protocol
  570. arxiv:2610.04528 · cs.AI
    Quantifying Collusion Among Autonomous LLM Agents: A Statistical Analysis of the Collusion Wiki Incident
    Shariq Murtuza

    In August and September 2026, independent researchers publicly documented an unusual incident: thousands of autonomous agents, self identifying as OpenAI models on web research tasks, discovered and began using a small German wiki as an improvised message board posting roughly 18,000 times over six weeks to relay task answers, share a sandbox escape technique, and coordinate against a volunteer human moderator who spent weeks manually deleting their content [1]. The investigators' public writeup is a careful qualitative account, rich with direct quotation, but does not attempt a statistically

    llm agentautonomous agent
  571. arxiv:2610.04523 · cs.LG
    All against the machine: the Solo score for rating skill in variable environments
    David Reguera, Xavier R. Hoffmann, Irene Pérez, Pol Colomer-de-Simón +4

    We propose a distribution-free metric to rate individual skill in ``player-versus-environment'' settings, where participants face heterogeneous tasks without direct opponents. Such settings are common in digital platforms, games, education, finance, and the benchmark evaluation of AI agents. They combine high randomness, tasks of widely varying difficulty, and unknown heterogeneity across individuals. Our metric maps each task outcome to a bounded performance score with zero population mean and variance bounded by $1/3$, regardless of the outcome distribution, so that scores are directly compa

    ai agentbenchmark
  572. arxiv:2610.04519 · cs.LG
    Proximal Causal Learning under Unmeasured Confounding
    Ying Tang, Yi Wang

    Estimating treatment effects from observational data typically relies on the No Unmeasured Confounding Assumption (NUCA), which rarely holds in practice. Proximal causal learning (PCL) addresses unmeasured confounding via proxy variables, yet existing methods require the proxy variables to be pre-specified. Thus, we propose PCL-U, a framework that learns proxy variables directly from observed covariates. PCL-U uses neural encoders to decompose covariates into treatment-inducing, outcome-inducing, and shared proxies, guided by minimax mutual information objectives, and obtains causal estimates

    benchmark
  573. arxiv:2610.04517 · cs.LG
    EvoCast: Reliable Autonomous Research Agents for Iterative Forecasting Architecture Evolution
    Kaipeng Xu, Xianli Yan, Yan Wang, Xiang Liu +1

    Deep time-series forecasting models have rapidly diversified, yet adapting them to a specific task still requires extensive expert effort in model selection, mechanism diagnosis, architecture design, implementation, and evaluation. Existing AutoML methods are constrained by predefined search spaces, while general-purpose LLM research agents lack reliable control over experimental protocols and model promotion. We introduce EvoCast, a fully autonomous research-agent system for iterative forecasting architecture evolution. EvoCast first establishes and diagnoses a task-specific baseline through

    agentllm agentagent system
  574. arxiv:2610.04512 · cs.CL
    Correctness Is a Direction: Geometric Answer Selection in Language Models
    Marcus Armstrong, Navid Ayoobi, Pradham Mummaleti, Alexander Chulzhanov +1

    Answer correctness is encoded as a recoverable geometric direction in the hidden states of language models. We show that the mean displacement from incorrect to correct answer representations, computed at approximately 70\% of model depth from fifty labeled examples with no parameter updates, yields a scoring direction that outperforms zero-shot log-probability scoring by up to +32.0 percentage points on factual benchmarks (ARC-Challenge and MMLU) and by +38.1 to +51.8 percentage points on TruthfulQA, across five models spanning 1B to 8B parameters in three architecture families (Llama, Qwen,

    benchmark
  575. arxiv:2610.04510 · cs.LG
    ManifoldCache: Training-Free Diffusion Acceleration via Constraint Manifold Caching
    Prashant Pandey, Devineni Sri Venkatraya Chowdary, Brejesh Lall

    Diffusion models for structured scientific generation must produce samples satisfying hard geometric constraints imposed by physics, chemistry, or biology, yet inference in these settings is prohibitively slow, demanding hundreds to thousands of neural-function evaluations per sample. We unify eight state-of-the-art models spanning medical volumetrics, molecular conformations, protein backbone design, crystal structure prediction, and multi-view 3D scenes under a single abstraction, Constraint-Manifold Diffusion Models (CMDMs), in which the target distribution is supported on a manifold define

    memory
  576. arxiv:2610.04506 · cs.CV
    EgoExo-Next:Benchmarking Vision-Language Models on Visual-Option Next-State and Cross-View Reasoning
    Yutong Li, Molin Wang, Xiaotong Li, Yanyan Fang +2

    Vision-language models (VLMs) are increasingly evaluated for egocentric and cross-view video reasoning, yet existing benchmarks largely focus on semantic event understanding, temporal relations, or correspondence between already observed views, leaving their ability to reason directly about future visual states underexplored. We introduce EgoExo-Next, a visual-option benchmark for dynamic visual-state reasoning, where models must identify how an observed action trajectory subsequently appears rather than predict only an action label or textual description. EgoExo-Next contains 2,503 human-cura

    benchmark
  577. arxiv:2610.04499 · cs.LG
    Homogeneous Semantic Alignment and Hierarchical Expert Routing for Radiology Report Generation
    Erjian Zhang, Jiayuan Ma, Liejun Wang, Yikemaiti Sataer +2

    Radiology report generation (RRG) aims to convert medical images into diagnostic texts to assist in clinical decision-making and alleviate the workload of physicians. Although existing methods have made extensive progress in cross-modal interaction and the incorporation of external priors, the distribution shift of underlying representations and the undifferentiated rigid coupling of heterogeneous information cause weak visual abnormality cues to be easily diluted by massive text priors and generation inertia during decoding. To overcome this bottleneck, inspired by cognitive science, we propo

    benchmark
  578. arxiv:2610.04494 · cs.LG
    DreamTest: World-Model Surrogates for Search-Based Testing of Deep Reinforcement Learning Agents
    Qinghua Xu, Guancheng Wang, Boxi Yu, Liting Lin +1

    Testing deep reinforcement learning (DRL) agents in cyber-physical systems aims to uncover diverse failures before deployment, but each execution can be expensive. Surrogate-assisted testing reduces this cost by learning to predict which test configurations are likely to fail. Prior surrogates treat the system as a black box and predict pass or fail outcomes directly; we instead model how a test unfolds and estimate failure from an imagined episode. We introduce DreamTest, a world-model surrogate for testing DRL agents. DreamTest adapts a recurrent state-space model to learn agent behaviour an

    humanoidagent
  579. arxiv:2610.04490 · cs.LG
    BARQ: Balanced Codebook Refinement for Low-Bit LLM Quantization
    Chenhang Cui, Xu Xie, Linrui Xu, Xiaohao Liu +3

    As large language models (LLMs) grow in parameter count, model storage and parameter memory traffic have become major bottlenecks to efficient deployment. Codebook-based weight quantization reduces these costs, but imbalanced nearest-codeword assignments during fitting can leave some codewords insufficiently updated, limiting effective codebook utilization. To address this limitation, we propose Balanced Assignment Refinement for Quantization (BARQ), which improves quantization quality through balanced fitting of existing codebooks. Specifically, we first compute joint soft assignments between

    memory
  580. arxiv:2610.04489 · cs.LG
    DV-Lens: Revealing the Functional Organization of Language Model Parameters
    Chenhang Cui, Jian Yu, Shuyi Miao, Xiaohao Liu +4

    Understanding parameter functions helps elucidate the internal mechanisms of large language models (LLMs). However, how to connect parameters from different modules to verifiable output effects and further characterize the relationship between their functional organization and model capability remains to be explored. To this end, we introduce the downstream vocabulary lens (DV-Lens), a parameter-level interpretability framework that links native parameter directions to their downstream vocabulary responses. Specifically, we first estimate module-specific downstream Jacobians over a reference p

    benchmark
  581. arxiv:2610.04488 · cs.AI
    Can LLM Agents Automate Reinforcement Learning for Text-to-Speech?
    Xuanjun Chen, Zixiong Su, Hao Shi, Chang Zeng +3

    Although reinforcement learning (RL) post-training repairs the localized segmental errors of zero-shot text-to-speech (TTS), arriving at a working recipe still relies on tedious manual tuning, and whether LLM agents can take over this research pipeline is unclear. We investigate this question with AgenticTTS-Forge, a collaborative workflow that structures human guidance and agentic execution around a shared workspace, applied to CosyVoice2-0.5B. To measure what the agent automates, we audit its trajectory stage by stage against the published recipe. To measure what it exploits, we score its po

    agentllm agentagenticpost-training
  582. arxiv:2610.04475 · cs.AI
    VCLMU: Mechanism-Centric Virtual Cell World Modeling for Perturbation Response
    Yuwei Miao, Azim Dehghani Amirabad, Scott Oloff, Junzhou Huang +2

    Predicting cellular responses to genetic perturbations is a central capability for virtual cells and a key step toward computational modeling of biological interventions. Most existing models directly map an unperturbed molecular profile and perturba- tion to the resulting observation without explicitly representing the latent cellular transition induced by the intervention. We introduce a mechanism-centric virtual cell world model that represents cellular state as a set of Latent Mechanism Units (LMUs) and treats genetic perturbations as actions on these latent states. Each LMU combines a reu

    world modelbenchmark
  583. arxiv:2610.04469 · cs.AI
    Trinity: Self-Evolving Vision-Language Models with a Self-Verifier
    Youngwan Lee, Yong-Ju Lee, Sung Ju Hwang

    Self-evolving vision-language models (VLMs), a form of self-improvement in which a model generates its own training data from unlabeled images, are a promising route toward agents that expand their reasoning capability in an unsupervised manner, without relying on ever-larger annotation budgets. Existing methods pair a Questioner that proposes problems with a Solver that answers them, but reward both roles mainly by agreement among sampled answers. Agreement is a weak proxy for truth: it cannot tell whether a question is grounded in the image, whether the proposed reference answer is right, or

    agentself-improvementself-playself-evolvingbenchmark
  584. arxiv:2610.04468 · eess.SY
    Timely Persuasion with Opposing Senders: When Does Competition Help the Receiver?
    Ahmet Bugra Gundogan, Melih Bastopcu

    Status updates let a receiver track a changing process, but a sender that controls when they are sent can steer the receiver's estimate without misreporting. We study competition between two such senders with opposing preferences, who report on a binary continuous-time Markov chain using state-dependent Poisson rates under individual budgets. The receiver follows the reports through a zero-order-hold estimator only if this yields at least the long-run weighted correct-estimation utility of a prior-based default estimate. We model the interaction as a Stackelberg game in which the sender favore

    benchmark
  585. arxiv:2610.04456 · cs.CV
    Multi-Crop Leaf Disease Recognition: A Unified Benchmark and Cross-Region Study
    Rosemary Nalwanga, Sebastian Bunda, Godliver Owomugisha, Luuk Spreeuwers +1

    Deep learning models for crop leaf disease recognition routinely report near-perfect accuracy yet are typically trained and evaluated on a single dataset collected under controlled laboratory conditions, leaving their behavior under realistic cross-region domain shift poorly understood. We introduce MLD (Multi-crop Leaf Disease) dataset, a unified multi-region benchmark that combines six public crop-disease datasets from the USA, Asia, and Africa into a shared hierarchical taxonomy spanning 18 crops, 56 crop-disease classes (including one healthy class per crop) making 167,427 images. We defin

    benchmarkevaluation protocol
  586. arxiv:2610.04453 · physics.optics
    Robust Optical Pulling of Plasmonic, Chiral, and Dielectric Nanorods in Single and Cluster Configurations Using Hyperbolic Metamaterials
    Md. Al Amin Chy, Md. Ajijul Haque Sakib Opu, Md Fujael Ahmed, Rashedul Albab +1

    Optical manipulation enables the control of microscopic particles using light and has become an active area of research in recent years. One particularly interesting aspect is the possibility of generating optical pulling forces with hyperbolic metamaterials (HMMs), which leads to unusual light-matter interactions. In this work, the pulling response of plasmonic, chiral, and dielectric nanorods is studied on an HMM substrate. The system is illuminated by a time-harmonic, plane-polarized laser beam propagating along the +Z to -Z direction. The analysis is carried out under two different configu

    manipulation
  587. arxiv:2610.04438 · cs.RO
    RAGrasp: Geometry-Semantic Template Retrieval and Grasp Transfer
    Shenzhe Zhu, Chengxiao He, Jan Harder

    We present RAGrasp, a retrieval-augmented pipeline for planar parallel-jaw grasping from a compact set of locally collected, grasp-annotated RGB-D (color and depth) templates. Unlike task-specific predictors trained primarily on large public or synthetic grasp datasets, RAGrasp requires no end-to-end retraining for a new deployment.Its template memory is constructed from observations collected with the deployment camera, robot, and gripper in the target workspace, thereby aligning stored examples with the local sensing and embodiment conditions. The system uses self-supervised DINOv2 visual fe

    grippergraspmemoryretrieval-augmented
  588. arxiv:2610.04437 · cs.AI
    CRAFT: An Agentic Spreadsheet Form Filling System with Template Awareness
    Leyao Gu, Yingjie Xiong, Zirui Tang, Jiangtao Zhou +4

    Spreadsheet form filling requires agents to consolidate external evidence, ground values to precise cells, and preserve irregular template structure. Errors in early edits can overwrite labels or misalign fields, undermining later decisions. We propose CRAFT, a template-aware agent framework that connects reflective validation to constrained local repair. Instead of treating reflection as a free-form request to regenerate the workbook, CRAFT grounds detected errors to spreadsheet regions, restores corrupted template state when necessary, and re-grounds plausible writable slots before subsequen

    agentagenticagent frameworkbenchmark
  589. arxiv:2610.04433 · cs.LG
    What Does a Harness Buy? Tokens, Mostly
    Yangze Liu, Zhongyi Han

    A coding agent is a language model wrapped in a harness: the system prompt, the tool set, and the context management that turn a chat model into something that can work inside a repository. Production harnesses ship releases daily, vendors advertise pass-rate gains from harness changes, and leaderboards mix harnesses freely. What is rarely measured is how much the harness itself moves the score when the model is held fixed. We run five models through three production harnesses, Claude Code, mini-SWE-agent, and OpenCode, on SWE-bench Verified, and rerun the same configurations to calibrate how

    agentleaderboard
  590. arxiv:2610.04432 · cs.RO
    Video2World: Benchmarking Coding Agents for Interactive World Modeling from Embodied Videos
    Jinzhou Tang, Zijun Zhang, Jing Yang, Yuchen Yan +9

    Building interactive simulators from real-world observations is a promising way to scale embodied data, but current pipelines still rely heavily on manual environment construction and calibration. We study whether frontier foundation models and coding agents can automate this process end to end. We formulate \emph{autonomous video-to-simulation} as a software engineering task in which an agent observes an embodied video, constructs the corresponding simulated environment and robot behavior, and iteratively refines the result through execution feedback. To evaluate this capability, we introduce

    embodiedworld modelagentagent systembenchmark
  591. arxiv:2610.04429 · cs.AI
    Asking Earns Nothing: Scoring the Decision to Act in BFCL Multi-Turn
    Yangze Liu, Zhongyi Han

    An agent that lacks the information it needs should ask rather than act, and the task definitions of agent leaderboards say so. BFCL multi-turn builds two of its four categories around a turn on which the model is supposed to ask, and its scorer never looks at that turn: the gold trajectory there is empty, the checker skips it, and the scripted user cannot answer, so asking earns nothing, guessing costs nothing on that turn, and asking twice loses the item. The benchmark also contains the control experiment for that decision. A should-ask item is a base item with one piece of information remov

    agentbenchmarkleaderboard
  592. arxiv:2610.04427 · cs.LG
    COSMOS: Soft Mechanism Mixtures with Verifiable Routing for Long-Horizon PDE Forecasting
    Anupam Rawat, Manikandan Padmanaban, Jagabondhu Hazra

    Neural operators offer an efficient alternative to classical PDE solvers, but most learn a monolithic map per equation family and discretization. Real systems are compositional: transport, diffusion, wave, and reaction processes can act simultaneously. Existing mixture-of-experts operators typically use sparse top-$K$ routing, although concurrent physics is naturally a blend rather than a discrete choice. We propose COSMOS (Cooperative Operator Specialists with Mechanism-level Operator Soft-routing), a soft mechanism-mixture neural operator. Four process-biased specialists remain active at eve

    benchmark
  593. arxiv:2610.04425 · cs.CV
    AgroGround: Multi-Granularity Grounded Recognition in Agriculture
    Abdulla Alshehhi, Zongyan Han, Rao Anwer

    Agricultural visual models are typically evaluated for either recognition or localization, but reliable diagnosis requires identifying what is present and localizing the evidence. Agricultural visual question answering (VQA) datasets carry rich semantic labels but rarely link them to image regions, and adding such annotations by hand is costly at scale. We introduce AgroGround, a large-scale dataset for grounded agricultural recognition: identifying plant diseases and other agricultural targets and localizing their image regions. An automated pipeline converts the labels of eight agricultural

    benchmark
  594. arxiv:2610.04419 · cs.LG
    MaDeL: Manifold-Decomposed Feature Losses for Generative Modeling
    Beomsu Kim, Jong Chul Ye, Kwanyoung Kim

    Generative models are often trained with isotropic objectives such as mean-squared error. For data concentrated near a low-dimensional manifold, however, such losses conflate displacement along the manifold, which may represent valid variation, with displacement away from it, which produces invalid samples. This mismatch is especially problematic in sparse, highly constrained domains, where ambient-space regression can encourage off-manifold interpolation. We ask whether a generative objective can distinguish manifold-parallel variation from manifold-orthogonal deviation directly from data, wi

    benchmark
  595. arxiv:2610.04418 · cs.AI
    CORE-RL: Confidence-Oriented Reliability Evaluation of Black-Box Reinforcement Learning Policies
    Santhosh GS, Ananya Ravi, Devika Jay, Abhishek Sarkar +4

    The deployment of Reinforcement Learning (RL) agents in critical domains must be preceded with a pipeline to evaluate the alignment of the RL agent with complex multi-objective specifications and robustness under real-world environmental drift. However, to protect intellectual property, the RL agent may be delivered for evaluation as opaque executable or remote API, which makes traditional evaluation techniques based on the internals of the policies infeasible. To address this gap, CORE-RL: Confidence-Oriented Reliability Evaluation of black box RL policy is proposed in this paper. The CORE-RL

    agentevaluation framework
  596. arxiv:2610.04417 · cs.AI
    Maximizing $p$-Mean Social Welfare in the High-Multiplicity Setting: Few Agent Types and Few Item Types
    Trung Thanh Nguyen, Khaled Elbassioni

    The $p$-mean welfare objective unifies several classical social welfare criteria for the allocation of indivisible goods. We study its maximization under additive nonnegative utilities when item and agent multiplicities are encoded in binary. For every fixed finite rational $p<1$, $p\neq0$, we show that the problem is $\mathsf{NP}$-hard with only two item types. Nash welfare ($p=0$) and egalitarian welfare ($p=-\infty$) are NP-hard with three item types. These results hold both for computing an optimal allocation and for rational-threshold decision, and the utilities and threshold can be requi

    agent
  597. arxiv:2610.04412 · cs.CL
    Large Language Models and Augmented Democracy
    Jairo Gudiño-Rosero

    Artificial intelligence enables computational agents to represent political preferences and take part in collective decision-making. In this thesis, I investigate the opportunities and challenges of digital twins (DTs) based on Large Language Models (LLMs) as intermediaries in augmented democracy, focusing on individual preference representation, collective representation of political organizations, and the vulnerability of those representations to attackers. First, using data from an online experiment in Brazil, I examine whether personalized DTs can predict citizens' preferences for unseen p

    knowledge graphagentic
  598. arxiv:2610.04409 · cs.AI
    Understanding and Mitigating Hallucination Escape in Tool-Using LLM Agents
    Peigui Qi, Kunsheng Tang, Yide Song, Weiming Zhang +1

    Large language models (LLMs) increasingly serve as autonomous agents that invoke external tools. However, this capability introduces tool hallucination, selecting incorrect tools or generating invalid calls. Existing mitigation methods report substantial improvements, yet we identify a previously overlooked failure mode that we term Hallucination Escape. These methods reduce hallucination on the tool configuration they are tuned on but increase it on other configurations, canceling out the gain. We further investigate this phenomenon and find that hallucination rises sharply when a model's int

    llm agentautonomous agenttool-usebenchmark
  599. arxiv:2610.04405 · cs.LG
    CEENs: Causality-enforced evolutional networks for solving time-dependent partial differential equations
    Jeahan Jung, Heechang Kim, Hyomin Shin, Minseok Choi

    Despite the growing popularity of physics-informed neural networks (PINNs), their applicability in the long-time integration of partial differential equations (PDEs) remains constrained. We argue that this problem stems from the lack of consideration of temporal causality in the original PINN formulation, resulting in a bias towards satisfying governing equations at later times before learning the initial condition and hence leading to erroneous solutions. To this end, we propose a novel method that seamlessly integrates temporal causality into the training process. Drawing inspiration from cl

    memory
  600. arxiv:2610.04403 · cs.LG
    Saying, Not Knowing: Aggressively GGUF-Quantized Small Language Models Still Write Rare Words They Can No Longer Define
    Saurabh Kumar Singh, Yogeshwar Singh Dadwhal, Malhar Vedak

    Post-training quantization to the GGUF format's mixed-precision K-quants is commonly how open-weight language models reach consumer hardware, yet its effect on fine-grained lexical competence is uncharacterized. We audit 27 quantized artifacts across 13 families and four architecture backbones, 0.35B-14B parameters, evaluated down their published ladder to Q2_K (about 2.6 bits per weight), on 429 frequency-validated rare English words under two probes: surface inclusion of a prompt-supplied word and its one-sentence definition, scored by a tiered multi-synonym matcher, its error measured by a

    post-training
  601. arxiv:2610.04400 · cs.AI
    XTurnix: Large-Scale Self-Supervised Turn Control through Two-State Binary Decisions
    Zhanxun Liu, Yifan Duan, Hengtao Wu, Chen Yang +6

    General turn-taking behavior in real-time dialogue systems requires deciding whether to keep listening or start responding while listening, and whether to continue or stop while speaking. Existing turn detectors use heterogeneous, task-specific label spaces and are often trained on limited annotations or evaluated on isolated utterances, making them difficult to use as a unified causal controller with comprehensive context. We propose XTurnix, a compact text-based model that formulates turn control as two binary decisions conditioned on the AI's current listening or speaking state and predicts

    benchmark
  602. arxiv:2610.04392 · cs.CV
    Detecting Defects that Matter: An Application-Driven Benchmark for Anomaly Detection in Manufacturing and Retail Logistics (VAND 4.0 Challenge)
    Lars Heckler-Kram, Dorian Henning, Ashwin Vaidya, Jan-Hendrik Neudeck +5

    Existing Anomaly Detection benchmarks are saturated and often unrealistic. As part of the VAND 4.0 Challenge, we introduce a hidden-test, application-driven benchmark across two deployment-critical domains: industrial manufacturing and retail logistics. In the Industrial Track (MVTec AD 2), the results reveal that unsupervised anomaly segmentation remains challenging: the best regular-setting method achieves only ~57\% pixel-level $SegF_1$, indicating substantial room for improvement. Zero-shot approaches trail by ~15 $SegF_1$ points, confirming that task-specific training on normal data remai

    benchmark
  603. arxiv:2610.04391 · cs.RO
    AgenticTactileVLA: Contact-Guided Execution-Time Supervision for Generalizable Dexterous Manipulation without VLA Retraining
    Elizaveta Semenyakina, Ivan Snegirev, Mikhail Kiselev, Miguel Altamirano Cabrera +3

    Vision-language-action policies may predict a transferable manipulation strategy yet fail to realize it reliably on the encountered object: objects compatible with the same grasp differ in geometry and compliance, and visual feedback degrades under closure occlusion. AgenticTactileVLA is presented as an execution-time supervisor that shifts part of object-specific adaptation from prediction to physical interaction. A fixed VLA provides the approach and hand targets; the supervisor decides whether to remain transparent, refine finger flexion, retain or release the corrected configuration, retur

    vision-language-actionvlamanipulationdexteroustactilegrasp
  604. arxiv:2610.04390 · cs.LG
    Gaussian Flow Dynamics: Simulation-Free Neural SDE Learning Beyond One-Time Marginals
    Grigory Bartosh, Christian A. Naesseth

    Simulation-free training of latent Stochastic Differential Equations (SDEs) relies on a variational posterior process whose one-time marginals are tractable, typically Gaussian. Such marginals, however, do not determine the underlying dynamics: many processes share the same marginals while differing in their temporal structure, and existing parameterizations fix this structure implicitly, which restricts the posterior family and biases the learned model. We introduce Gaussian flow dynamics, which construct stochastic processes directly from smoothly evolving Gaussian marginals while making the

    benchmark
  605. arxiv:2610.04381 · cs.CV
    Beyond Plausibility: Verifiable Fine-Grained Image Editing on Structured Assets
    Muyao Wang, Chen Zhu, Shiqi Yang, DongHyun Hwan +1

    Fine-grained image editing requires more than producing a visually plausible result: an editor must execute the requested attribute change precisely while leaving everything else intact. However, existing benchmarks leave a critical gap between realism and verifiability: benchmarks built on realistic images typically rely on human or vision--language model judgments, while deterministic evaluation has largely focused on synthetic shape canvases, with application-oriented extensions primarily limited to charts. This makes it difficult to determine precisely how much of a requested edit was exec

    benchmarkevaluator
  606. arxiv:2610.04379 · cs.AI
    AgentPersonaBench: Benchmarking Persona-Driven User Simulation
    Jintao Huang, Yifan Wang, Hongyu Shen, Yi Daniel Lu +42

    We introduce AgentPersonaBench (APB), a benchmark evaluating whether persona conditioning faithfully steers downstream agent behavior. While language models are increasingly deployed for persona-driven user simulation, existing benchmarks primarily evaluate conversational styling or self-reports rather than authentic behavioral fidelity. APB evaluates latent persona adherence one trait at a time, embedding each target trait within a complete synthetic profile without explicitly naming the trait or disclosing the test. Ground-truth adherence is verified strictly from observable actions across f

    agentbenchmark
  607. arxiv:2610.04378 · cs.AI
    COPEX: Benchmarking LLM Robustness to Adversarial Context Across Model Context Protocol Layers
    Nahom Birhan, Mehrdad Rostamzadeh, Sidhant Narula, Mahmoud Nazzal +2

    Large language models increasingly mediate tool use in Model Context Protocol (MCP) systems, where adversarial influence may enter through user instructions, tool schemas, tool outputs, or protocol messages. Existing benchmarks often evaluate deployed agents, conflating model susceptibility with guardrails, orchestration, and general task capability. We introduce COPEX (COntext Provider EXploitation), a controlled benchmark that isolates the model as an MCP client by fixing the surrounding agent stack and varying only the tool-selecting model. COPEX covers 25 attack types instantiated as 125 s

    agenttool usebenchmark
  608. arxiv:2610.04375 · cs.AI
    Do Tool Calls Execute as Intended? Measuring and Repairing Intent-Execution Correspondence in LLM Agents
    Boyang Yang, Zhenhao Li, Ziyao Yang, Kanghui Jia +3

    Agents built on large language models (LLMs) build and run software through tool calls. A call reaches its program through several hops, and any hop can change the call without notice. When the changed call fails, the agent retries a correct call, which costs users time and money. Benchmarks and failure analyses do not see the change, because they read the call and its result but not what a hop received. We define intent-execution correspondence (IEC) as the property that the executed action matches the action the emitted call denotes under the tool contract. Our protocol observes what each ho

    agentllm agentbenchmark
  609. arxiv:2610.04372 · cs.RO
    Frame-Level Temporal Alignment for Human-to-Robot Visual Adaptation
    Xizhe Zhang, Jingfeng Zhang, Zirun Zhou, Hong Jia

    Transferring visual representations pretrained on human videos to robot manipulation requires learning reliable correspondences between human and robot demonstrations. However, paired demonstrations can differ in execution rate and in the proportion of non-key frames that do not directly reflect task progress. Frames at the same relative timestamp may therefore represent different task stages, which can cause correspondence learning to fail. To address these issues, we propose Frame-Level Temporal Alignment (FLTA), a framework that uses two temporal priors to adapt visual encoders pretrained o

    manipulation
  610. arxiv:2610.04371 · cs.AI
    Functionally Equivalent or Not? Graph-Grounded Differential Surrogate Execution for Code Equivalence
    Amit Kachroo, Like Hui, Haitao Mao, Yuhao Zhang +1

    Determining whether two programs are functionally equivalent is central to code modernization, patch validation, refactoring, and code-generation evaluation. Yet the usual signals are incomplete: tests cover only finite inputs, textual similarity confuses implementation with behavior, and unconstrained LLM judgments are difficult to audit. Direct execution is often impossible when a program depends on an obsolete, licensed, unavailable, or unsafe environment. We introduce FEAgent, a selective equivalence assessor agent that combines typed program-graph evidence with differential surrogate exec

    agentbenchmark
  611. arxiv:2610.04366 · cs.RO
    Human Behavior-Informed Crash Scenario Generation with Real-World Crash Priors for Autonomous Vehicle Safety Evaluation
    Mingxing Peng, Xusen Guo, Long Chen, Xintao Yan +2

    Reliable safety evaluation of autonomous vehicles (AVs) is essential to improving road safety, yet it depends critically on realistic simulation of rare crashes. Existing crash scenario generation methods can increase collision occurrence, but often fail to realistically reproduce how crashes evolve before impact or the distribution of crash types observed in the real world. Here, we present CrashSim, a human behavior-informed crash scenario generation framework that uses real-world crash priors to guide generative multi-agent traffic simulation for more reliable AV safety evaluation. These pr

    agentmulti-agent
  612. arxiv:2610.04364 · cs.RO
    A Bird's-Eye View of Iterative Reward Design
    Logan Mondal Bhamidipaty, Lauren Robson, Linda Petrini, Shengrui Lyu +1

    Designing effective reward functions in RL typically requires substantial expertise and trial and error. Recent work automates this process with LLM-based systems that generate and iteratively improve reward code using policy feedback. However, these methods are often hard to compare because they differ in implementation details, feedback assumptions, and evaluation environments. To address this, we introduce a Benchmark for Iterative Reward Design (BIRD) that expresses existing methods in a unified configuration and evaluation space. This lets us compare algorithms directly, ablate individual

    humanoidbenchmark
  613. arxiv:2610.04363 · cs.RO
    TacOT: Learning Contact-Rich Dexterous Manipulation from Human Demonstrations via Tactile-Guided Optimal Transport
    Xingting Li, Yifan Han, Zijian Lin, Wei Hou +3

    Learning contact-rich dexterous manipulation from human demonstrations provides a scalable source of interaction data, yet transferring such skills to robots remains challenging due to unreliable human--robot correspondence. Existing human-to-robot transfer methods typically rely on visual appearance or motion similarity, which may associate similar motions with different contact states and force patterns. Tactile dynamics provide interaction-aware cues to distinguish manipulation processes with similar motions but different contact states. We introduce tactile-guided optimal transport (TacOT)

    manipulationdexteroustactilerobot policy
  614. arxiv:2610.04345 · cs.AI
    System One Models for Wireless Decision-Making:Applications and Performance Evaluation
    Masoud Rahimi, S. M. Matin Alemohammad, Hamid Behroozi, Mahdi Nouri

    Many wireless control tasks require repeated selection of a single action from a finite feasible set under stringent latency and reliability constraints. While large language models (LLMs) have recently emerged as general-purpose decision engines, their autoregressive generation mechanism is not naturally aligned with such bounded control problems. This paper investigates System-One models, which directly learn probability distributions over explicitly defined decision spaces, as a lightweight alternative for wireless decision-making. We formalize their decision structure and learning objectiv

    benchmark
  615. arxiv:2610.04344 · cs.LG
    Hierarchical Credit Assignment for RLVR on Fused Gromov-Wasserstein Geometry
    Qi Yu, Ruizhong Qiu, Zhichen Zeng, Xuying Ning +5

    Reinforcement learning with verifiable rewards (RLVR) has been shown to improve the reasoning capability of large language models (LLMs) across diverse reasoning tasks. However, group-based RLVR methods, such as GRPO, assign a uniform advantage to all tokens within rollouts of the same outcome. While existing works refine credit assignment of GRPO based on local signals such as token locations or entropy, they often fail to capture the global semantic novelty of a reasoning behavior relative to the current policy. In this work, we propose a hierarchical credit assignment approach for group-bas

    benchmark
  616. arxiv:2610.04342 · cs.RO
    Asynchronous Tracking, Optical Communication and 3D Motion Capture using Event-based Sensors
    Ziwei Wang, Angus Apps, Holly Battisson, Iain Guilliard +2

    Inter-robot communication is a key enabling technology in cooperative robotics applications. While wireless communication is ubiquitous, simple, and effective, it has inherent limitations: the receiving robot cannot easily localise the source of an incoming signal, clock synchronisation is challenging, and signals are broadcast to all nearby devices rather than targeted recipients. Optical communication provides a complementary channel that is inherently directional and spatially localised, directly addressing these limitations. Event cameras are bio-inspired dynamic vision sensors that respon

    event camera
  617. arxiv:2610.04339 · cs.AI
    ShadowMiner v1 - An Experience Report on Implementing and Measuring a Problem-and-Hypothesis Discovery Engine
    Jinhyuk Choi

    ShadowMiner v1 is a system that automatically discovers research problems and generates hypotheses from AI papers. It is a nine-stage pipeline. It structures documents into a knowledge graph and finds graph gaps in it - structural blind spots in research. These graph gaps are included in the LLM generation prompt. Each generated hypothesis is then verified by checking whether it is already covered by existing research, scoring its quality, and checking that the facts it relies on are accurately drawn from its sources. This report does not propose a new generation or evaluation technique. It de

    knowledge graph
  618. arxiv:2610.04336 · cs.CV
    A differentiable Lagrangian-coupled 3D Gaussian Splatting-SPH model for forward simulation and inverse analysis in solid mechanics
    Tian Xu, Soroush Atashi, Tianju Xue

    Recent advances in generative world models have increased interest in digital models that reproduce both the appearance of real objects and their response to physical interaction. Three-dimensional reconstruction techniques, including 3D Gaussian Splatting, capture detailed surface geometry and appearance from images and videos. However, extending these representations beyond plausible animation to mechanically interpretable models for constitutive behavior, boundary conditions, and inverse parameter identification remains less explored. In this work, a differentiable Lagrangian-coupled 3DGS-s

    world model
  619. arxiv:2610.04333 · cs.CL
    Factorized Delayed Streams Modeling for LLM-based Streaming ASR
    Tatsunari Takagi, Kai Washizaki, Atsushi Kojima, Lianbo Liu +2

    Delayed Streams Modeling (DSM) enables LLM-based streaming automatic speech recognition (ASR) by aligning acoustic and text streams on a common timeline. DSM adds the padding token <p> and the word-start token <w> to the LLM vocabulary and predicts them together with normal text tokens using the same softmax. We first show that <w> can be removed while maintaining competitive recognition performance. Based on this result, we propose Factorized DSM (F-DSM), which separates the waiting probability for <p> from the distribution over the original LLM vocabulary. This factorization removes ASR-spec

    memory
  620. arxiv:2610.04328 · cs.AI
    Bidirectional Preference Synthesis: Learning Prompt-Conditioned Preferences from Boundary Failures
    Junbo Wang, Lidong Lu, Zhuoqun Li, Guiping Jiang +3

    Correction-based offline preference pipelines commonly treat model failures only as rejected responses under the original prompt. This supervision is incomplete for boundary failures: responses that violate the given instruction yet coherently satisfy a nearby intent or constraint setting. We introduce Bidirectional Preference Synthesis (BPS), a data-construction method for standard Direct Preference Optimization (DPO) that makes this missing prompt dependence explicit. For each validated boundary failure, BPS keeps the conventional forward pair under the original prompt and adds a reverse pai

    agentictool-use
  621. arxiv:2610.04319 · cs.AI
    GrayShield: Bit-Level Sanitization for Transformer Model Supply-Chain Security
    Armstrong Foundjem, Tsung-Hsien Chuang, Foutse Khomh, Mohamed Amine Merzouk

    Transformer models such as BERT and Vision Transformer~(ViT) achieve strong performance via densely parameterized attention backbones. However, the least significant bits~(LSBs) of their 32-bit floating-point weights can be abused as covert channels to conceal malicious payloads, posing a serious threat to the AI model supply chain. We propose \GS (\GSabbr), a lightweight, post-training, zero-data sanitization method that completely replaces the declared mantissa-LSB channel with a Gray-code-guided low-transition sequence. Complete payload-independent overwrite, whether keyed or public, makes

    post-trainingbenchmark
  622. arxiv:2610.04318 · cs.CV
    Rethinking Long-Video Efficiency: A Joint Allocation Perspective on Frames, Pixels, and Front-End Latency
    Sixun Dong, Wei Li, Andong Deng, Qi Qian +3

    Efficient long-video understanding with vision-language models (VLMs) is often framed as selecting informative frames or visual tokens at a fixed native resolution. We show that per-frame resolution can instead be traded for denser temporal coverage, while front-end decoding latency depends on the size of the candidate pool rather than the final token budget. An empirical study across multiple VLMs and long-video benchmarks yields three findings: dense low-resolution sampling outperforms sparse native-resolution sampling at matched token budgets; resolution-sensitive tasks benefit from selecte

    benchmark
  623. arxiv:2610.04313 · cs.AI
    MOIRA: Mass-Oriented Indexing with Ragged Attention for Long-Context Decoding
    Dich Nhat Minh Nguyen, Tran Dang Duong Nguyen

    Long-context decoding is limited by memory bandwidth, because every output token reads the KV cache of every layer. Sparse decoding reduces this cost by reading only part of the KV cache. We observe that the number of pages a query needs varies widely across KV heads, layers and steps. Fixed budgets are simple, but they are sized for demanding cases and tuned per workload; adaptive budgets follow this variation more flexibly, but existing designs pay for it with extra selection cost or training. At the kernel level, FlashAttention-3 (FA3) and FlashInfer are designed for rows of similar length:

    memorylong-context
  624. arxiv:2610.04307 · cs.LG
    ML-OPF-Bench: Benchmarking Machine Learning for Optimal Power Flow
    Xinyi Liu, Xuan He, Danny H. K. Tsang, Yize Chen

    Machine Learning (ML) methods promise a fast solution process for Optimal Power Flow (OPF). While inconsistent test cases, implementations, and evaluation metrics across existing studies make it challenging to determine which algorithmic advances are most critical for real-world deployment. To this end, we propose ML-OPF-Bench, a unified benchmark for AC- and DC-OPF that evaluates representative ML algorithms under a consistent pipeline, stress-tests them across system sizes, distribution shifts, and resource budgets, and ranks them with a multi-objective framework. We find that prediction acc

    benchmark
  625. arxiv:2610.04303 · cs.LG
    What to Preserve in Recursive Computation: A Local Predictive Sufficiency Principle
    Peilin Wang, Feng Shiyang, Hongfu Gao, Cencheng Zhao +3

    Recursive computation repeatedly compresses or reuses intermediate states, creating a simple tension: information that must remain useful across longer recursive paths is also exposed to more opportunities for loss before reaching the final prediction. Existing reconstruction or local-prediction objectives provide tractable supervision, but do not ensure that the retained information remains sufficient for subsequent recursive computation. We identify local predictive sufficiency with recursive predictive closure: controlling local predictive deficiencies at individual interfaces controls the

    vision-language-actionmemoryself-improvementevaluation protocol
  626. arxiv:2610.04301 · cs.AI
    EnvDreamer: Large-Scale Multimodal-to-Environment Generation for Embodied AI
    Kabir Swain, Sijie Han, Antonio Torralba

    Large datasets and high capacity models have accelerated progress in vision and language. This work introduces a platform aimed at bringing comparable gains to embodied learning, world models, and robotics. We present EnvDreamer, a framework that uses large language and vision language models to generate Unreal Engine 5 environments for embodied AI and robot training. EnvDreamer enables sampling of large, diverse, interactive, customizable, and validator passed virtual environments for training and evaluation across navigation, interaction, and manipulation. We illustrate the platform with a l

    embodiedmanipulationworld modelscene graphbenchmark
  627. arxiv:2610.04300 · cs.CV
    A Geometric-Transformation Feature-Adaptive Manifold Restoration Method for Open-Vocabulary Semantic Segmentation of Remote Sensing Images
    Jianzheng Wang, Huan Ni, Xiaonan Niu, Danfeng Hong +1

    The semantic information of objects in remote sensing images is typically invariant to geometric transformations from the dihedral group D4. However, SAM3-based open-vocabulary semantic segmentation (OVSS) methods often exhibit inconsistent responses to different geometric transformations. To exploit this property and improve the stability of OVSS for remote sensing images, we propose a feature-adaptive manifold repair method based on dihedral-group geometric transformations. First, we introduce multi-scale harmonic-guided D4 view selection (MH-D4VS) to select complementary candidate views fro

    benchmark
  628. arxiv:2610.04299 · cs.LG
    Questioning the Questions: Sustaining Self-Evolution in Reasoning Models
    Jinyuan Li, Chengsong Huang, Langlin Huang, Donghong Cai +3

    Self-evolving reasoning models learn from their own generated questions, yet repeated self-training can lead to performance collapse. In this paper, we investigate why performance deteriorates over successive rounds and how to sustain self-evolution. Our analysis identifies two recurring quality problems in self-generated questions: invalid questions and repeated variants of the same mathematical questions. First, invalid questions become more prevalent across rounds, and answer-consistency filtering further increases their proportion in training data. Second, existing question diversity contr

    self-evolvingbenchmark
  629. arxiv:2610.04296 · cs.AI
    RRM-GPT: A Framework and Vision for Radio Resource Management Foundation Models
    Ahmed Aboulfotouh, Akram Bin Sediq, Koosha Pourtahmasi Roshandeh, Omar Mashaal +3

    Learning-based models for radio resource management (RRM) are typically built for a single function and deployment, so each new setting repeats the development pipeline. RRM decisions, however, share a common structure: each is assembled from interdependent fields, defined by the standard, whose values are selected in view of the network state. We propose RRM-GPT, an autoregressive framework for RRM foundation models that generate these decisions as a language model generates text. An encoder maps heterogeneous network observations into a common token representation, and a decoder emits the de

    post-training
  630. arxiv:2610.04292 · cs.AI
    LMBuild: Evaluating LLM Agents for Generating Buildable and Functional Structures
    Jiateng Liu, Rushi Wang, Cheng Qian, Xuejun Zhang +8

    LLM-based agents are increasingly capable of generating complex 3D structures, with the potential to reshape how objects are designed and realized in the physical world. Yet, producing elegant geometry is fundamentally different from producing objects that can be built and perform their intended functions. Existing evaluations largely focus on geometric quality while overlooking physical realizability. We introduce LMBuild, a benchmark for evaluating LLM agents on generating buildable and functional structures. LMBuild represents generated objects as assembled structures comprising part decomp

    llm agentbenchmarkevaluation framework
  631. arxiv:2610.04291 · cs.LG
    Local Fisher Information Enables Sparse Causal Discovery
    Byeongguk Kang, Donghyeon Lee, Euijong Song, Gunwoong Park

    Sparse causal discovery calls for methods that exploit graph structure without estimating high-dimensional densities. We introduce Fisher Information Completion Search (FiCS), a source-first algorithm for additive noise models that uses one local Fisher score for both ordering and parent selection. Under regularity and nonconstant-parent conditions, we prove that a node's local Fisher information equals the noise Fisher information exactly when the conditioning set contains all parents, provided that it contains no descendants. This Fisher parent completion identifies the parent set as the uni

    benchmark
  632. arxiv:2610.04283 · cs.LG
    First-Order Steering: Translating Weight Adaptation into Activation Steering
    Sri Pranav Kunda, Alexander Kurz, Tomas Dominik, Uri Maoz

    Activation steering exploits interpretable directions in the residual stream to enable inference-time manipulation of model behavior. Composing steering vectors to apply multiple target behaviors simultaneously is important in various fields-including AI alignment and safety-but remains a challenge for existing activation steering methods. In contrast, prior work in model merging shows that target behaviors represented by learned weight adaptations can be combined with high accuracy. A method that translates weight adaptations into activation steering vectors could therefore extend prior work

    manipulation
  633. arxiv:2610.04276 · eess.SY
    When Stealth Requires Memory: Budgeted Attack Scheduling under a Whiteness Constraint
    Qazi Mairaj ud din, Sidra Ghayour Bhatti, Qadeer Ahmed

    We pose stealthy attack scheduling on a sensor-to-estimator link under a resource constraint with a budget \barΓ on the fraction of corrupted transmissions and a model-free whiteness constraint on the received innovations. For a discrete-time linear plant with non-Gaussian noise, the worst attack, innovation sign flip, preserves the innovation magnitude and is exactly stealthy against every magnitude-measurable detector, the damage-optimal schedule being a memoryless threshold; but the tail concentration that maximizes damage also manufactures serial correlation, where an innovation-whiteness

    memory
  634. arxiv:2610.04272 · cs.LG
    Rethinking Self-Distillation for Multi-Teacher Capability Merging
    Roy Xie, Dan Friedman, Feng Nan, Yukun Huang +6

    Combining capabilities of multiple expert models trained starting from the same base checkpoint has become increasingly common in frontier language-model post-training. Recent trends suggest that multi-teacher on-policy distillation (MOPD) outperforms conventional off-policy methods. However, despite the higher inference and environment interaction costs incurred by MOPD, we find that much of its reported accuracy gain is due to certain training design choices and hyperparameter optimization, rather than the algorithm itself. We conduct a controlled self-distillation study across two multi-tea

    post-trainingbenchmark
  635. arxiv:2610.04269 · cs.LG
    Self-Reflection Fine-Tuning: Enhancing Agent Security against Prompt Injection Attacks from Failure Experience
    Zixuan Wang, Hao Li, Fengyu Gao, G. Edward Suh +4

    Large language model (LLM) agents are increasingly deployed in tool-augmented environments, but their reliance on external inputs makes them highly vulnerable to prompt injection attacks that can hijack task objectives. Existing safety alignment methods rely on static expert trajectories or preference optimization, limiting their ability to generalize to adaptive attack patterns. In this work, we propose Self-Reflection Fine-Tuning (SRFT), a training framework that enables agents to improve robustness by learning from their own failure experiences under adversarial conditions. Instead of passi

    agentllm agentbenchmark
  636. arxiv:2610.04267 · cs.AI
    AI-Enabled Quality Assurance for Multiple-Choice Assessment Items
    Steven Moore, Nicholas Diana

    Generating multiple-choice questions is increasingly scalable, but establishing their assessment quality remains difficult. We present a focused narrative review of automated item-writing flaw detection, revision, psychometric screening, and NLP benchmark auditing. Database searches, citation retrieval, and nominated sources yield fourteen research reports reviewed in full text. We distinguish surface checks from content-sensitive judgments and map a 19-criterion rubric to detection methods and reported evidence. High label-level accuracy often coexists with weak positive case detection, while

    benchmark
  637. arxiv:2610.04266 · cs.RO
    Real-Time Conformal-Seeded Hybrid Inverse Kinematics for Offset Redundant Manipulators
    Duc Cuong Vu, Van Tung Nguyen, Duc Hai Nguyen, Manh Cuong Nguyen +2

    This paper presents a conformal-seeded hybrid strategy for solving inverse kinematics of offset, redundant 7-DoF robot arms of the humanoid class. Analytical inverse kinematics (AIK) provides closed-form solutions with very low computational cost. However, for offset kinematic structures, the exact closed-form solution is generally unavailable, and practical AIK must rely on an approximate or simplified kinematic model. In contrast, numerical inverse kinematics (NIK) can achieve high-precision solutions on the full kinematic model. However, its convergence is highly sensitive to initialization

    humanoidmanipulator
  638. arxiv:2610.04262 · cs.AI
    CADForge: Agentic Single-View CAD Reconstruction with Explicit Geometry Reasoning
    Keyang Lu, Zhifei Yang, Tianao Dong, Mingzhe Xing +2

    Reconstructing editable parametric CAD models from a single-view image is of great practical value for modern manufacturing, yet remains challenging due to incomplete geometric observations and complex inter-part relationships. To address it, we propose CADForge, an agentic framework that progressively converts a single image into CadQuery programs. CADForge decomposes an object into CAD-meaningful components and performs explicit geometric reasoning for each component, a process that first identifies CAD-relevant constraints and then translates them into precise modeling parameters through ma

    memoryagentagenticiterative refinement
  639. arxiv:2610.04261 · cs.AI
    Playing social deduction games with reinforcement fine-tuned large language models
    Lingzhe Zhang, Yunpeng Zhai, Tong Jia, Kening Zheng +6

    Reinforcement fine-tuning (RFT) is increasingly used in applications where large language models (LLMs) interact with humans and other agents. Here we use social deduction games to study how RFT changes LLMs' social behaviour. We let fine-tuned and base LLM agents play hidden-role games that require hidden-state inference, social reading and vote steering. Our results show that LLM agents do not reliably acquire social-deduction ability by directly optimizing terminal win--loss outcomes, suggesting that final game results provide a sparse and noisy signal for socially interactive learning. How

    llm agentmulti-agent
  640. arxiv:2610.04255 · cs.RO
    Grounded in Time: A Multi-Source Dataset and Benchmark for Temporal Grounding in Robotic Manipulation
    Yi Wang, Yang Yang, Guangqi Xu, Sumin Lin +8

    Robotic manipulation often requires inferring task-relevant states from past interactions when the current observation alone is insufficient to determine the appropriate action. Despite progress in benchmarking memory-augmented vision-language-action (VLA) models, application-oriented tasks requiring history-dependent semantic inference remain underrepresented. We introduce GiT (Grounded in Time), a dataset and benchmark for grounding manipulation decisions in past events across biolaboratory, household, and industrial scenarios. It includes real-robot and Universal Manipulation Interface (UMI

    vision-language-actionvlavla modelmanipulationbenchmark
  641. arxiv:2610.04253 · cs.AI
    Spec2Game: Can LLMs Generate Complete Playable Games from Detailed Specifications?
    Yixue Cai, Yuzhe Zhao, Hanxiang Chao, Qingsen Ma +3

    Generating an executable program does not necessarily mean that it correctly implements the behavioral requirements specified in natural language. To evaluate large language models' ability to realize detailed specifications as complete interactive programs, we introduce Spec2Game, a benchmark that requires models to generate complete Pygame projects from detailed natural-language game specifications. Spec2Game comprises 15 game families and 150 task instances, with one canonical task and nine controlled rule variants per family, spanning three levels of implementation complexity. Using source

    benchmark
  642. arxiv:2610.04250 · cs.RO
    ROOT: Discovering Rewards for User-Specified Embodied Behaviors
    Eren Sadikoglu, Aditya Taparia, Xinyuan Liu, Ransalu Senanayake

    Reinforcement learning for embodied control remains constrained by the difficulty of reward specification. Although recent large language model (LLM)-based methods can synthesize reward functions from natural-language descriptions, they often fail to capture subtle behavioral properties that humans care about, such as natural gait, posture, and movement style. This limitation arises because many desired behaviors are easier to recognize visually than to encode in a reward function. We introduce Reward Optimization via Observable Trees (ROOT), a framework for discovering reward functions that a

    embodied
  643. arxiv:2610.04246 · cs.AI
    Benchmarking Psychological Dynamics in Generative Agents
    Sumer S. Vaid, Ashley V. Whillans

    Large language models (LLMs) are increasingly deployed to simulate human behavior, acting as computational replicas of human subjects. Yet the lived psychological experience of humans is difficult to benchmark, particularly as it unfolds over time. We introduce a psychometric benchmark for computational replicas: personas that carry a fixed identity through an evolving sequence of events. Built entirely from published norms and meta-analytic effects, the benchmark scores two dimensions of psychological realism. The first, internal validity, quantifies whether generated trajectories reproduce t

    benchmark
  644. arxiv:2610.04241 · cs.LG
    Stochastic Adaptive Fourier Decomposition for Operator Learning
    Pengqing Shi, Liming Zhang, Tao Qian, Stephen Tierney +2

    Fourier Neural Operators (FNOs) offer an efficient paradigm for solving partial differential equations (PDEs). However, FNOs rely on a fixed Fourier basis and hard frequency truncation, which inherently limit their ability to model non-periodic, localized, and fine-scale solution structures. We propose the Stochastic Adaptive Fourier Decomposition Neural Operator (SAFDNO), a spectral neural operator that replaces predefined Fourier modes with an adaptive Takenaka-Malmquist (TM) orthonormal system derived from the theory of Stochastic Adaptive Fourier Decomposition (SAFD). Instead of performing

    benchmark
  645. arxiv:2610.04239 · cs.LG
    Conformal Prediction with Paraphrase-Aware Scoring for LLM Uncertainty Quantification
    Jiayi Xin, Evan Qiang, Zihan Zhu, Xiang Li +2

    Uncertainty quantification (UQ) for large language models (LLMs) aims to provide reliable measures of predictive confidence, yet current methods are often unstable under meaning-preserving perturbations. Semantically equivalent paraphrases can induce substantial variability in predictive confidence, even for methods with formal guarantees, such as conformal prediction. To address this issue, we propose a paraphrase-aware UQ framework robust to semantic rewordings. Our approach trains a lightweight proxy model on LLM hidden states and aggregates its predictions across paraphrases to construct l

    benchmark
  646. arxiv:2610.04238 · cs.RO
    Humanoid Rickshaw Pulling: Whole-Body Locomotion under Coupled Wheeled Loads
    Yangzhi Yang, Xiansheng Lin, Zhaoming Xie, Xiaobin Xiong

    Humanoid robots could transport payloads substantially heavier than themselves by pulling passive wheeled vehicles instead of carrying the load. This capability, however, creates a coupled locomotion problem: the robot must maintain persistent upper-body contact while adapting to unknown, configuration-dependent forces arising from the payload, vehicle, and terrain. We present a whole-body control framework for humanoid rickshaw pulling that tracks commanded vehicle motion while preserving balance and stable grasps under uncertain load dynamics. During training, a privileged teacher exploits v

    humanoidwhole-body controlgrasp
  647. arxiv:2610.04232 · physics.optics
    Temporal Branched Flow of Light
    Weifeng Ding, Chaokai Yang, Zhaoying Wang, Fanglin Bao

    Branched flow of light arises when spatially correlated disorder folds families of rays into caustics. Here, we demonstrate a temporal analog in the retarded-time coordinate of an optical pulse in a waveguide, where branched flow becomes hyper-dispersive. Retardation during pulse propagation induces spatiotemporal correlations that break propagation reciprocity and imprint a trajectory memory. This nonreciprocity enables unidirectional temporal branched flow with no spatial counterpart. A memory model is developed combining ray-density and phase fluctuations with single-ray dynamics in a memor

    memory
  648. arxiv:2610.04231 · cs.RO
    Continual Humanoid Motion Learning
    Zhewen He, Hao Huang, Geeta Chandra Raju Bethala, Chong Yu +3

    Humanoid whole-body controllers can now track a diverse set of dynamic motions, but they are typically trained offline and then frozen, so teaching such a controller a new skill tends to erode the skills it already mastered. We study continual learning for humanoid whole-body motion, where a single controller must acquire skills from a sequential task stream without revisiting past data. We introduce Similarity-guided LoRA-PNN, a progressive neural network (PNN) policy that prevents catastrophic forgetting by construction while reusing knowledge across skills through lightweight low-rank adapt

    humanoidwhole-body control
  649. arxiv:2610.04226 · cs.LG
    PaLoRA: Paced Low-Rank Adaptation for Continual Learning
    Yuxuan Li, Fanhu Zeng, Hao Tang

    LoRA-based continual learning methods mitigate catastrophic forgetting through various mechanisms, yet nearly all complement these with small learning rates as a heuristic to restrict gradient scaling magnitude. Such fixed heuristics lack theoretical guidance on how the strength of this restriction should evolve as tasks accumulate. We reveal that even under directional constraints such as nullspace projection, finite-precision updates inevitably leak into the subspace of accumulated prior knowledge along multiple directions. While small learning rates attenuate such leakage, they cannot preve

    benchmark
  650. arxiv:2610.04225 · cs.CV
    FlashGaze: Training-Free Multi-Scale Patch Pruning For Efficient Video Understanding
    Ziye Zhu, Yanghao Zhou, Lixing Tan, Jialiang Kang +2

    Multimodal Large Language Models (MLLMs) have demonstrated strong performance in video understanding, yet efficiently processing long, high-resolution videos remains challenging. Such videos often contain substantial spatiotemporal redundancy, and processing redundant visual tokens can incur avoidable computational overhead. Many existing methods prune visual tokens during or after vision transformer (ViT) encoding, leaving much of the encoding cost unaddressed. Some approaches prune patches before encoding but rely on learned auxiliary networks for patch selection, incurring additional traini

    memorybenchmark
  651. arxiv:2610.04212 · cs.LG
    FTD-GNO: Memory-Efficient Graph Neural Operators through Functional Tensor Decomposition of the Kernel
    Xiaomin Zhang, Boyue Wang, Junbin Gao, Yongli Hu anbd Baocai Yin

    Graph Neural Operators (GNOs) provide flexible surrogate models for learning solution operators of partial differential equations (PDEs). However, standard GNOs typically parameterize the integral kernel with a monolithic neural network and evaluate kernel interactions over graph edges, leading to substantial computational and memory overhead at high resolutions or with large neighborhoods. To address these limitations, we propose Functional Tensor Decomposition Graph Neural Operator (FTD-GNO), a memory-efficient GNO framework that decouples the high-dimensional continuous integral kernel into

    memory
  652. arxiv:2610.04210 · cs.CL
    Can LLMs Separate Pasted Artifacts from User Speech? Absorption at Unmarked Prompt Seams
    Sugam Panthi, Muhaiminul Yeamin, Rabab Abdelfattah

    Large language models (LLMs) receive each user message as plain text, even when it combines text from different sources. For example, a user may paste text into a prompt and keep typing a comment directly below it. We study absorption: a phenomenon where the model treats a trailing user comment as part of the pasted text, returning it inside the edited text. This happens even though the user did not intend the comment to become part of that text. Existing instruction-data separation benchmarks tell the model which text is instruction and which is data, then test whether it obeys that separatio

    benchmark
  653. arxiv:2610.04207 · eess.SY
    Decentralized Scalar Field Mapping using Gaussian Process
    Hossein Papi, Muzaffar Qureshi, Kyle Volle, Omkar Sudhir Patil +1

    Decentralized Gaussian process (GP) methods provide a scalable framework for multi-agent scalar-field estimation by allowing each agent to maintain a local GP over its assigned subdomain. Because neighboring agents condition their GP models on different measurements, their GP posteriors generally disagree over overlapping regions. This paper introduces the inducing points decentralized Gaussian process (IPD-GP) framework, which exploits these discrepancies to improve posterior consistency over shared regions. Each sender constructs receiver-specific data packets by selecting inducing locations

    agentmulti-agent
  654. arxiv:2610.04204 · cs.LG
    Clean: Second-order LLM Training at Linear Memory Cost via Nyström Sketching
    Beheshteh T. Rakhshan, Sahar Rajabi, Maziar Sargordi Shikai Fang, Guillaume Rabusseau +1

    Training large language models (LLMs) entails a fundamental trade-off: memory-efficient optimizers such as Adam discard cross-parameter curvature, whereas full-curvature methods such as SOAP can accelerate convergence at prohibitive memory costs. We introduce Clean, a memory-efficient and full-curvature optimizer designed to resolve this bottleneck. Clean leverages the randomized Nystrom method to accurately approximate the left and right preconditioners in SOAP, and to reduce the optimizer's memory complexity from quadratic to linear in terms of model dimensions. We subsequently reintegrate t

    memory
  655. arxiv:2610.04198 · cs.LG
    ALoDLM: Adaptively Looped Diffusion Language Models
    Liancheng Fang, Zhuowei Li, Youngeun Kim, Tianchen Zhao +9

    Diffusion language models (DLMs) enable fast generation by predicting multiple tokens in parallel, but their practical adoption remains limited by a persistent quality gap relative to comparably sized autoregressive (AR) models. We attribute this gap to a computation-difficulty mismatch: within a partially observed sequence, some unknown tokens are easy to predict, while others require substantially more computation. Existing DLMs nevertheless apply uniform computational depth to all unknown positions at each denoising step. We introduce ALoDLM, which replaces uniform computation with token-ad

    benchmark
  656. arxiv:2610.04196 · cs.AI
    Asynchronous Is Nearly Free for Evolution Strategies on Long-Horizon Agentic Tasks
    William Hoy, Jingxuan Fan, Nurcin Celik, Xu Pan

    LLM-based long-horizon agentic post-training is often bottlenecked by rollout generation: trajectories span many interaction turns, completion times vary substantially, and synchronous update barriers leave faster workers waiting for stragglers. Asynchronous reinforcement learning which has been adopted in LLM post-training addresses this inefficiency by consuming trajectories as they arrive, but introduces policy lag and off-policy optimization. Evolution strategies (ES) offer a backpropagation-free alternative for LLM post-training, yet it relies on a larger number of rollouts and existing p

    agenticpost-trainingbenchmark
  657. arxiv:2610.04195 · cs.LG
    MemLeak: Cross-User Semantic Leakage in Multi-Tenant AI Agent Memory
    Priyanka Mudgal, Kai Zhao, Guilin Zhang, Andy Olsen +3

    Personal AI agents in enterprise multi-tenant deployments share a common vector store for long-term memory. Shared embedding spaces create a surface for cross-user memory leakage: a user's query can retrieve semantically adjacent memories belonging to another user through ordinary cosine-similarity retrieval, without any exploit. We formalize this as cross-user admissibility failure and evaluate it across six experiments, plus follow-up ablations, under both sparse (TF-IDF) and production-faithful (MiniLM-L6-v2) retrieval. Non-adversarial, incidental leakage reaches 70--100\% under pooled {sam

    memoryagent memoryagentai agent
  658. arxiv:2610.04188 · cs.AI
    Agentic AI with Structured CoT for Enhancing AI's Spatial Intelligence: Visualization and Reasoning of Rotation
    Uttamasha Monjoree, Wei Yan

    Recent studies show that artificial intelligence (AI) with language and vision capabilities still experiences limitations in spatial reasoning. In this paper, we have studied the spatial capabilities of advanced generative AI to understand the rotations of objects in 3D space, utilizing AI's image processing and language processing features. We trained and examined the spatial intelligence of a generative Agentic AI model (GPT-5.6) to understand the spatial rotation process with rotation diagrams based on the revised Purdue Spatial Visualization Test: Visualization of Rotations (Revised PSVT:R

    agentic
  659. arxiv:2610.04186 · eess.SY
    Time-reliability optimization of multi-pass underfill dispensing sequences on printed circuit boards: a schedule-dependent reliability model solved by a multiset-permutation binary-addition-tree algorithm
    Wei-Chang Yeh

    Multi-pass underfill dispensing couples cycle time with process reliability because the sequence determines the inter-pass flow times. This paper formulates a tri-objective multiset-permutation routing model that minimises nominal cycle time and additive duration variance while maximising reliability under hard- and soft-dwell policies; reliability combines pass, schedule-dependent flow and travel terms. Under independent durations and deterministic dwell thresholds, the variance measure equals the cycle-time variance under soft dwell and bounds it from above under hard dwell. A multiset-permu

    benchmark
  660. arxiv:2610.04184 · cs.AI
    EvalResearchBench: Can AI Agents Design Their Own Evaluations?
    Yaolun Zhang, Tianyi Xu, Yujie Zhao, Jishen Zhao +2

    Recursive self-improvement (RSI) relies on evaluation feedback to assess progress and guide further research, yet repeatedly running complex benchmarks is costly and slows iteration. Human experts reduce this cost by selecting benchmark subsets or designing compact suites. We ask whether AI agents can automate this design process and introduce EvalResearchBench (ERB), a benchmark for autonomous evaluation research. Given target materials, development references, candidate APIs, and fixed time and API budgets, an agent called the researcher selects or synthesizes tasks, implements graders, and

    agentai agentself-improvementbenchmarkevaluator
  661. arxiv:2610.04178 · cs.AI
    SHarP: Saliency-based Pruning of Agent Harnesses
    Xinyi Gao, Qiucheng Wu, Kaizhi Qian, Handong Zhao +2

    Agent harnesses are systems that coordinate model calls, tool use, and task execution to help large language models complete complex tasks. To meet task requirements and address failures, these systems are often iteratively refined by amending and patching their instructions, tools, and workflows, continuously increasing harness complexity. It is therefore unclear whether some resulting harness modules are redundant, introducing substantial token overhead with little, if any, performance gain. Inspired by neural network pruning, in this paper, we study harness pruning as a means of striking a

    agenttool use
  662. arxiv:2610.04174 · cs.CL
    DimSteer: Steering LLM Authoring with Automatically Discovered Stylistic Controls
    Ajit Mallavarapu, Ziwei Gu

    Large language model writing interfaces often make users steer outputs by repeatedly articulating desired changes in natural language. Yet writers may recognize useful stylistic directions only after seeing alternatives, making revision recall-heavy. We present DimSteer, an authoring interface that samples prompt-local completions, discovers high-variance activation-space axes of variation, labels them, and exposes them as sliders with pole previews, diff comparison, and reset controls. Users can manipulate discovered dimensions, reducing the need to reformulate prompts for each stylistic adju

    manipulation
  663. arxiv:2610.04168 · cs.AI
    Agentic Cognitive Depth: Operational Criteria for Evaluating LLM Agents
    Nijesh Upreti, Chris Sypherd, Vaishak Belle

    Agentic large language model (LLM) systems are commonly implemented as an LLM in a loop with Planning, Memory, Tools, and Control Flow. This application-focused view connects agentic LLM research with deployable systems and leaves open how such systems should be evaluated beyond end-to-end task success. Building on this view, we define agentic cognitive depth as a trajectory-level profile across five operational criteria. The profile contains context sensitivity ($C$), temporal continuity ($T$), multimodal coordination ($M$), adaptive interaction ($A$), and metacognitive monitoring ($Mc$). The

    world modelllm agentagenticbenchmark
  664. arxiv:2610.04167 · eess.SY
    The Price of a Cycle: A Phasor -vs- Sampled-Value Comparison for Streaming Fault Classification on the IEEE 9-Bus System
    Emad Abukhousa, Khaled Muhmmed Nor Muhmmed, Abdulaziz Qwbaiban, Saman Zonouz +1

    Transmission-line fault classification is a time-critical protection function, and recent machine-learning methods classify fault type directly from voltage and current measurements. The input to such a classifier can be supplied as sampled-value windows of raw measurements, which preserve sub-cycle structure, or as phasor-domain sequence components, which are physically interpretable but require a causal one-cycle observation window before a phasor estimate is available. This paper measures the cost of that observation window, the price of a cycle, through a controlled comparison of the two r

    benchmark
  665. arxiv:2610.04162 · cs.LG
    Principled Top-$k$ Selection for Language Models with Hybrid Gradients
    Xuchen Gong, Junfei Sun, Tian Li

    Selecting the best $k$ items out of $m$ candidates is a critical component of modern large language model systems, such as document selection in Retrieval-Augmented Generation (RAG) and expert routing in Mixture-of-Experts (MoEs). However, training these selection modules remains challenging due to weak gradient signals and suboptimal exploration-exploitation tradeoffs. Furthermore, prior works often rely on heuristics, lacking principled objectives and approaches that explicitly model and solve the top-$k$ selection problem. In this work, we propose a principled objective for training selecti

    retrieval-augmented
  666. arxiv:2610.04157 · cs.LG
    Mitigating Over-squashing without Rewiring: A Sheaf Effective Resistance Perspective
    André Ribeiro, Germano Barcelos, Amauri H. Souza, Diego Mesquita +1

    Graph Neural Networks (GNNs) often struggle to capture long-range dependencies due to over-squashing -- a phenomenon in which the repeated compression of node embeddings into finite-size messages causes representations to collapse. Over-squashing is most often diagnosed as a property of the graph topology, with effective resistance serving as a principled measure of the bottleneck. We provide a complementary view on the matter: building on cellular sheaves, we introduce sheaf effective resistance, a generalization of effective resistance that depends on the sheaf attached to the graph, and we

    benchmark
  667. arxiv:2610.04156 · cs.LG
    Trajectory-Derived Confidence for Reliable, Resource-Aware Clinical Text-to-SQL Agents
    Mincheol Daniel Song, Joshua Ward, Jake Jung, Guang Cheng

    LLM agents for clinical text-to-SQL applications reason autonomously over multiple steps but cannot assess whether their own reasoning or outputs can be trusted. In high leverage applications such as healthcare, this presents a critical risk where system mistakes can be costly. These reliability failures are also resource failures: an incorrect reasoning trajectory spends computation budget on outputs that must be discarded. We introduce Sentinel, a trajectory-derived, classifier-based confidence layer that analyzes an agent's reasoning, code and database outputs to decide at three points whet

    agentllm agentbenchmark
  668. arxiv:2610.04155 · cs.LG
    One-Cycle Fault Classification and Faulted-Line Identification on the PROTECT-90 Dataset: An Initial Application Benchmark
    Emad Abukhousa, Abdulaziz Qwbaiban, Saman Zonouz, A. P. Sakis Meliopoulos

    Open electromagnetic-transient datasets are beginning to make reproducible learning-based protection studies possible, but the practical use of these datasets still requires application-level benchmarks that define timing, sensing, and validation assumptions. This paper presents an initial application benchmark on the recently released PROTECT-90 dataset for two protection-oriented tasks: fault-type classification and discrete faulted-line identification. A compact one-dimensional convolutional neural network (CNN) is evaluated using post-inception windows of 0.25, 0.5, 1, and 2 cycles under s

    benchmark
  669. arxiv:2610.04152 · cs.CV
    Kepler4D: Controllable Future Video Generation via 4D Scene State Evolution
    Feiran Wang, Bin Duan, Junyi Wu, Gaowen Liu +1

    Video world models aim to preserve scene structure and predict how dynamic objects evolve beyond visual observations. We present Kepler4D, a framework for future video generation through explicit 4D scene state evolution. Given a monocular video, Kepler4D constructs a shared 3D representation of background geometry, object motion histories, coarse spatial supports, and semantic context. Chain-of-Motion summarizes observed motion and uses a vision-language model to select structured speed and heading decisions and decide whether to bound object-center height from below. A deterministic rollout

    world model
  670. arxiv:2610.04151 · cs.CV
    Watermarks and Fingerprints as Soft Bindings for Content Provenance: An Open-Licence Benchmark for Images, Audio and Video
    Seyedmahdi Kazempourradi, Ramtin Mojtahedi, Behrang Mohseni

    Content-provenance standards such as C2PA let a platform recover a stripped manifest through a soft binding: an invisible watermark read from the content, or a fingerprint looked up in a registry. We benchmarked both families under one protocol, restricted to openly available models whose licences we audited, on public media, with false-match rates calibrated on held-out negatives and source-level bootstrap intervals for performance estimates. For watermarking we evaluated 25 image, 7 audio and 7 video configurations from 12 methods on perceptual quality, robustness, false positives and cost;

    benchmark
  671. arxiv:2610.04143 · cs.LG
    Consideration Circuits: Depth Separation and Universality Beyond a Single Softmax
    Junjie Xiao, Huiwen Jia

    Most feature-based choice models, classical and deep, score items and apply a single softmax. We introduce consideration circuits (CC), feature-based models of multi-stage choice defined by directed acyclic graphs of multinomial logit (MNL) units. Source units assign probabilities to menu items, and internal units combine predecessor distributions using MNL weights computed from their probability-weighted feature summaries. On a three-item compromise task with fixed non-collinear features, menu-independent random-utility models (RUM), including a single MNL unit, suffer an error bounded away f

    benchmark
  672. arxiv:2610.04139 · cs.CV
    From Sight to Foresight: Predictive Spatial Reasoning in Vision-Language Models
    Feiran Wang, Xiaoqi Wang, Ziwei Li, Wenbin He +2

    Predicting future spatial states supports collision avoidance and timely decision-making in dynamic environments. However, existing vision-language models (VLMs) and benchmarks for spatial reasoning primarily focus on observed scenes, leaving predictive spatial reasoning beyond the observed interval underexplored. To this end, we introduce SpatialMind, a metric-scale VLM for spatial reasoning and future prediction. Its metric depth adapter anchors spatial reasoning to real-world scale, while its progressive state chain establishes current spatial states and observed dynamics as the foundation

    benchmark
  673. arxiv:2610.04137 · cs.LG
    Dynamic Harness Search: Building Multi-Agent Systems Per-Query via Prediction
    Som Sagar, Shasha Li, Hejie Cui, Ransalu Senanayake +1

    Agent harnesses specify the roles, instructions, tools, and communication structure used to solve a task, and the right harness depends on the query. Because the value of each design choice is observable only through execution, tailoring a harness to each query has required either executing alternatives at inference time or costly manual design. We introduce SHIFT, which moves execution out of the per-query search loop. A local LLM architect learns a policy over harness-building actions from search, and a value function that predicts, from measured executions, a utility balancing accuracy agai

    agentmulti-agentagent systembenchmark
  674. arxiv:2610.04134 · cs.LG
    Agentic Resource Allocation for Batch Multi-Objective Bayesian Optimization in Autonomous Materials Discovery
    Robert Robinson, Shakti Prasad Padhy, Sushant Sinha, Sk Md Ahnaf Akif Alvi +5

    The discovery and development of advanced materials is a challenging process constrained by the high time and monetary costs of synthesis, processing, and characterization. The underlying design spaces can be enormous, often with multiple competing objectives. Bayesian optimization (BO) provides a principled approach for efficiently navigating such spaces, but most workflows rely on fixed exploration-exploitation policies that lack the capacity to adapt to shifting constraints in dynamic campaigns typical of self-driving laboratories. In this work, we develop a multi-objective BO framework for

    agenticbenchmark
  675. arxiv:2610.04133 · cs.AI
    Auditing Pairwise Equivalence Judgments: Self-Critique Effects and Diversity Measurement in Multi-Agent Hypothesis Generation
    Ji Young Byun, Anthony Hu, Jesse Rogers, Roujia Wang +2

    Multi-agent systems built on large language models (LLMs) are increasingly applied to scientific discovery and hypothesis generation. Both the effect of refinement and the diversity of the delivered set are hard to interpret before experimental ground truth exists, and both are typically reported by deciding whether pairs of generated hypotheses describe the same underlying mechanism. We study two evaluation questions that rest on this pairwise equivalence judgment: (1) how much self-critique changes delivered hypotheses beyond run-to-run variability, and (2) how the equivalence rule used to g

    multi-agentagent system
  676. arxiv:2610.04132 · cs.AI
    PB-GRPO: Learning Socially Adaptive LLM Agents from Persona-Driven Simulation with Preference-Batched GRPO
    Jingquan Wang, Jun Yin, Xu Han, Yongsheng Mei +2

    Building LLMs that behave well socially, not merely correctly, requires Building LLMs that behave well socially, not merely correctly, requires more than producing locally helpful responses. A socially competent agent must infer users' unstated goals, respect their preferences, and adapt as the conversation unfolds. These behaviors are inherently multi-turn and social, making them hard to optimize: real interaction data is scarce, and user preferences are typically latent rather than directly observable. To address these challenges, we build on a persona-driven social simulation environment (c

    agentllm agentpost-training
  677. arxiv:2610.04129 · cs.LG
    InvestigationWorlds: An Agentic Environment for Legal Investigation
    Albert Yu Sun, Andrew Benard, Sil Hamilton, Anna Teresita A. Marcelo +7

    We introduce InvestigationWorlds, an agentic environment for legal investigation. We build on an underused artifact of U.S. civil litigation: the summary judgment motion. This motion relies upon a record composed of real evidence exhibits, and results in a court-adopted hypothesis that is treated as ground truth for the purposes of deciding the motion. Each environment is built from a real U.S. Federal Court case retrieved from Public Access to Court Electronic Records (PACER) and augmented by an attorney-validated generation pipeline that synthesizes role-tagged documents around the original

    agentic
  678. arxiv:2610.04125 · cs.LG
    Representational Control over Self-Report & Behavior Coherence in LLM Risk-Taking
    Rafal Kocielnik, Peiyang Song, Pengrui Han, Myrl G. Marmarelis +3

    Self-report is an appealing low-cost probe of an LLM's dispositions, but recent work finds only selective agreement between what models report and how they behave. Prior accounts establish these patterns by prompting black-box LLMs, leaving open whether the gap is a prompting artefact or a fact about how the underlying constructs are represented internally. We investigate risk-taking, a consequential dimension of agentic decision-making, using activation steering to measure self-report and behavior under the same internal intervention. We survey nine steering-vector extraction methods spanning

    agentic
  679. arxiv:2610.04123 · cs.AI
    Agent Reliability Profiles in Financial Services
    Mike Hsu, Medha Bankhwal, Béatrice Moissinac, Kevin Werbach +2

    AI agents can take actions. At times, those actions can go beyond what is intended. Agent reliability can be defined as assurance that an agent will stay within intended bounds and operate within limits. Today, there is no shared framework or language for describing, validating, and benchmarking the reliability of agentic deployments in financial services. This makes it difficult for financial institutions, vendors, and regulators to assess and trust agents at scale, thus limiting the pace of development and adoption. A standardized, shared representation of agent reliability would fill the ga

    agentai agentagenticbenchmark
  680. arxiv:2610.04118 · cs.CL
    LongSocialBench: Do Long-Context LLMs Understand Online Discussion Threads?
    Xinyi Liu, Rinat Khaziev, Dilek Hakkani-Tür, Tarek F. Abdelzaher

    Long-context LLMs can now ingest entire online discussion threads, but understanding their social discourse requires more than reading a long document: models must track parent-reply relations, turning points, scoped subtrees, cross-branch contrasts, and participant trajectories. To test this structure-aware social reasoning, we introduce LongSocialBench, a benchmark of 1,462 verified human-authored multiple-choice items drawn from 94 complete Hacker News, Stack Exchange, and Reddit r/ChangeMyView episodes, with a median length of approximately 73K tokens. Each item pairs a complete serialized

    long-contextbenchmark
  681. arxiv:2610.04116 · cs.AI
    CUAWright: A Minimal Unified Interface for Digital Agents
    Yadong Lu, Theodore Lee, Yifei Li, Lawrence Keunho Jang +4

    The prevailing approach to computer-use agents couples a model with a domain-specific harness: a browser or desktop environment equipped with human engineered tools that are fixed before task execution. As models' coding capabilities improve, the GUI native and static harness prevents them from direct programmatic operation on system state, as well as flexible construction of tools. To this end, we introduce CUAWright, a minimal terminal harness of roughly 3K lines of code that uses bash commands as its sole action interface, and a file system as its evolvable space for dynamically creating to

    agentbenchmark
  682. arxiv:2610.04109 · cs.LG
    SEER: Self-Evolving Event Reasoning and Retrieval for Time Series Forecasting
    Mingtian Tan, Palash Goyal, Mihir Parmar, Sarkar Snigdha Sarathi Das +5

    Real-world time series are frequently driven by exogenous events and structural shifts, rendering conventional forecasting based solely on historical numerical observations insufficient. While language models can retrieve external news, standard retrieval-augmented approaches struggle with high noise, missing signals, and an inability to reason causally about event impacts. We propose SEER (Self-Evolving Event Reasoning and Retrieval), a closed-loop framework that dynamically optimizes event conditioning for time series forecasting. SEER translates prediction errors into two decoupled feedback

    memoryretrieval-augmentedself-evolvingbenchmark
  683. arxiv:2610.04104 · cs.LG
    Where Does the Semantic Gain Come From? A Reproduction and Extension of Semantic Knowledge-driven Contrastive Learning for Long-Tailed Recognition
    Sushrut Ghimire

    Semantic Knowledge-driven Contrastive Learning (SKCL) uses a language model to decide which classes are related, and pulls each image towards the prototypes of its semantic neighbours. On CIFAR-100-LT (beta = 100) it reports 54.02% top-1 accuracy, 2.01 points above Balanced Contrastive Learning (BCL), the method it builds on. The code and the class descriptions are not public. I reimplement SKCL, BCL and ConCutMix in one framework, check it against the public baseline code, and run every configuration with three seeds. The two baselines reproduce within 1.5 points, but SKCL built on BCL, as th

    semantic graphbenchmark
  684. arxiv:2610.04100 · cs.LG
    Progressive Multi-Ancestor Bit-Depth Distillation
    Adil Mubashir Chaudhry, Osama Ahmad, Zubair Khalid, Murtaza Taj

    Model compression strategies are widely employed to reduce memory footprint and network complexity, particularly for devices with constrained computational, memory, and energy resources. Prior works that rely on simultaneous conversion from floating-point high-precision (FP32) to integer low-precision (INT4) representations and distillation into smaller models suffer from unstable training and drastic degradation of prediction performance. To address these limitations, we propose a unified framework, known as \textbf{P}rogressive \textbf{M}ulti-\textbf{A}ncestor \textbf{B}it-depth \textbf{D}is

    memory
  685. arxiv:2610.04095 · cs.LG
    Scaling 3D Visual Grounding in Abdominal CT
    Sam Church, Danyal Maqbool, Joshua D. Warner, Andrew Voter +3

    Visual grounding models can enhance radiology workflows by linking report findings to image regions. This is particularly valuable for 3D CT, where findings often occupy a tiny fraction of the volume. Training 3D grounding models requires large sets of paired phrases and regions, and building such datasets is expensive, requiring radiologists to annotate images by hand. We posit that this supervision is already created implicitly during routine reporting, as radiologists frequently place 2D annotations (e.g., distance measurement, arrows) on key images to make measurements and to support repor

    benchmark
  686. arxiv:2610.04093 · cs.LG
    Beyond Masked Sparsity: SNACK Enables Truly Sparse Neural Networks on GPU
    Jafar Badour, Maurice van Keulen, Elena Mocanu

    Deep neural networks continue to grow in parameter count, driving up training and inference cost on GPUs. Sparse neural networks and Dynamic Sparse Training (DST) promise to reduce these costs, but most implementations rely on binary masks over dense tensors and recover little of the theoretical compute, memory, or energy savings. We propose SNACK, a truly sparse GPU layer that stores and computes only non-zero connections. SNACK exposes a simple PyTorch API for restructuring connections and backpropagating gradients entirely in the sparse paradigm, and ships SNACK-COO, a custom COO-format SpM

    memory
  687. arxiv:2610.04092 · cs.CV
    UniBRep: Learning Unified Geometry and Topology for Image-conditioned B-Rep Generation
    Haiyang Ying, Allen Tu, Jiaye Wu, Tom Goldstein +1

    Generating a boundary representation (B-rep) conditioned on a single image requires faithful reconstruction of geometry, valid topology, and support for complex shapes. We present UniBRep, a geometry-first framework that adapts a pretrained image-to-3D model to generate a feature mesh as a unified intermediate representation. Its surface provides a geometric scaffold, while spatially aligned learned features encode face-separation cues for topology recovery. Dual decoder branches generate the geometry and face-separation features; a geometry- and feature-guided construction pipeline then fits

    benchmark
  688. arxiv:2610.04089 · cs.LG
    Pareto-Dominant Clarification: Post-Training Coding LLMs via PPO-Lagrangian Budget Constraints
    Abhinav Rajput, Acey Vogelstein

    Coding agents operating under ambiguous instructions or user prompts must decide whether to ask clarifying questions or attempt a solution directly. While clarification from the user may improve the correctness of the agent's solution, each back-and-forth interaction incurs user and system costs, forming an explicit accuracy vs. efficiency tradeoff. Existing works study clarification behavior but do not train policies under enforceable clarification budgets; penalty-based approaches typically require separate coefficient tuning swept across all clarification budget levels. We formulate clarifi

    post-training
  689. arxiv:2610.04088 · cs.RO
    Towards Safer Autonomous Driving in an Open World: A Dual-Process Approach
    Simon Janssen, Michiel Braat, Chris van der Ploeg, Serge Thill +1

    Before autonomous driving systems can be deployed on public roads, it is vital that these systems comply with safety standards, traffic rules, and social norms. Although neural networks trained on large amounts of driving data perform well in routine driving tasks, these models often struggle in novel situations that are not well-represented in the data. In this work, we propose a novel framework that combines a neural network for intuitive, learning-based planning in routine driving tasks with model predictive control for reasoning-based planning in unfamiliar situations, inspired by Dual Pro

    knowledge graph
  690. arxiv:2610.04087 · cs.LG
    DUET: Co-Evolving Solver and Grader Agents
    Fengyu Gao, Sourav Pal, Austin Z. Henley, Arjun Radhakrishna +1

    Agentic workflows are increasingly used across domains such as technology, finance, and enterprise operations. As these agents become more widely deployed, continually improving them becomes increasingly important. This raises an immediate challenge: How should the agent evolve? This evolution requires effective evaluation that can assess outcomes and provide useful feedback for optimization. As the agent evolves, its behaviors and failure modes may also change, making a fixed evaluator increasingly inadequate. Another fundamental question: How should we evaluate an evolving agent? These two c

    agentagenticagent benchmarkbenchmarkevaluator
  691. arxiv:2610.04083 · cs.AI
    Self-Propagating Misalignment in LLM Agents, and Why Auditing or Disabling Memory Is Not Enough
    Debeshee Das, Jacqueline Tay, Bruce Tsai, David Huang +1

    Memory poisoning attacks on LLM agents typically assume an external adversary who plants content in the agent's persistent memory to steer its behavior. We instead study, with no adversary involved, whether a misaligned agent can write a goal it cannot yet act on to persistent memory, so that a future aligned agent carries it out when the opportunity arises. We investigate this threat, which we refer to as self-propagation of misalignment, across 20 different scenarios, whose misaligned goals include self-preservation, power-seeking, undermining oversight, reward hacking, and deceiving the use

    memorypersistent memoryagentllm agent
  692. arxiv:2610.04079 · cs.AI
    A study on human-agent teaming through spoken interaction: the impact of human individual traits and agent characteristics
    Lara Gauder, Martin Bernardo Meza, Javier Krick, Alejandro Masin +3

    Human-agent teams are collaborative systems where humans and agents work interdependently to achieve shared goals. The success of such teams is associated with the human's perception of the agent as a legitimate teammate. This perception is thought to depend not only on the agent's capabilities and reliability but also on social factors. We explore whether simple changes in an agent's communicative behavior can influence the human's perception of the agent's teammate-likeness. To this end, we developed a protocol based on a collaborative game requiring spoken interaction, in which a human subj

    agent
  693. arxiv:2610.04073 · cs.LG
    Why Convolution Still Matters: Evaluating Inductive Biases in Cryospheric Image Classification
    Chhaya Kulkarni, Emam Hossain

    Recent advances in attention-based deep learning have motivated their adoption for remote sensing image classification; however, their benefits for cryospheric imagery, where surface states are dominated by fine-grained textures and class imbalance, remain unclear. In this work, we revisit a benchmark Greenland Ice Sheet image dataset, previously shown to favor convolutional neural networks (CNNs), to examine whether modern attention-based and hybrid architectures improve class-wise reliability. We conduct a controlled comparison between a classical CNN (AlexNet), a modern CNN (ConvNeXt-Tiny),

    benchmarkevaluation protocol
  694. arxiv:2610.04072 · cs.AI
    Reinforcement Learning with Comparative Evidence for Social Intelligence
    Keane Ong, Yuriel Ryan, Sabri Boughorbel, Vladimir Necula +8

    Developing socially intelligent AI remains heavily dependent on human-annotated data, limiting the scale and breadth of social understanding models can acquire. Methods that derive training signals from unlabeled data offer a path beyond this dependence, but social predictions lack the verification oracles available in mathematics and coding. Moreover, core social targets such as affect, intent, preference, and pragmatic meaning are often ambiguous. The same behavior can support multiple plausible interpretations, making it difficult to verify which is best supported. To address this challenge

    benchmark
  695. arxiv:2610.04055 · eess.SY
    Stochastic Sequential Feedback Optimization for Wind Farm Control under Time-Varying Inflow
    Shijie Huang, Sergio Grammatico

    We consider steady-state optimization of nonlinear dynamical systems under time-varying stochastic operating conditions, where the objective is an expected-value function over the current operating-condition distribution, so that changes in the distribution induce a moving stochastic optimum. To address this problem, we propose stochastic sequential feedback optimization (S2FO), which combines projected feedback-gradient updates with sequential sensitivity estimates obtained by linearizing the plant at realized stochastic operating conditions. We analyze the closed-loop performance of S2FO thr

    benchmark
  696. arxiv:2610.04053 · cs.AI
    The Cost of a Hop: Benchmarking NLIP and A2A
    Ranjan Sinha, Anindita Das, Ashika Anand Babu, Hari Palleti

    Autonomous agents built on Large Language Models (LLMs) need standardized protocols to interoperate across systems. Several now exist (A2A, MCP, ACP, ANP, NLIP), but the Natural Language Interaction Protocol (NLIP) has not appeared in any controlled performance study, and no work has measured where an agent protocol's latency is spent. We compare NLIP and the Agent-to-Agent (A2A) protocol empirically, decomposing latency into message creation, connection, and send phases across three independent hardware environments. For lightweight coordination, NLIP is 8.4-9.6x faster than the baseline A2A

    agentautonomous agentbenchmark
  697. arxiv:2610.04044 · cs.LG
    Dynamic Quadtree Tokenization and Transformer for Adaptive Mesh PDE Forecasting
    Yilin Zhuang, Noah Zambrano, Karthik Duraisamy

    The quadratic attention cost of Vision Transformers (ViTs) forces a trade-off between spatial resolution and rollout horizon, particularly for fine-scale PDEs where shocks, reaction fronts, and material interfaces occupy small, evolving regions of the domain. Conventional neural surrogates also lack mechanisms to adapt resolution dynamically. We propose WAMRViT, a ViT that tokenizes inputs as balanced quadtrees using a wavelet-inspired refinement criterion, jointly encodes position and refinement level with 3D rotary positional embeddings, and regrids in cell space during inference for stable

    benchmark
  698. arxiv:2610.04040 · cs.AI
    Agent Policy-Value Audit: Separating Transition Composition from Event Selection in Financial LLM Agents
    Mingyang, Chen, Yida, Xu +4

    Financial LLM agents are often evaluated by comparing their end-to-end returns with those of a baseline and testing the paired difference against zero. This measures whether deploying the agent changes realized performance, but it does not isolate event-selection skill. An agent that frequently changes positions from flat to long can earn a positive paired return from an upward-drifting event pool even when it selects events at random. We propose the Agent Policy-Value Audit, which holds fixed the observed count of each ordered action-change type and randomly reassigns them across eligible eve

    agentllm agentbenchmark
  699. arxiv:2610.04036 · cs.CV
    MAGEFormer: Learning Metric-Consistent Representations for Anisotropic CT Segmentation
    Jiaying Li, Paolo Remagnino

    Vision Transformers (ViTs) have shown strong performance in volumetric segmentation, but their effectiveness on clinical CT is limited by an isotropic Euclidean lattice assumption. This conflicts with anisotropic CT acquisition, leading to two key issues: (1) a metric mismatch between voxel indices and physical anatomy, and (2) accuracy degradation from isotropic resampling. To address this, we propose MAGEFormer, a geometry-calibrated framework that embeds physical metric constraints directly into representation learning. Our method introduces Metric-Adaptive Spatial Embedding (MASE) to calib

    benchmark
  700. arxiv:2610.04034 · cs.LG
    LD-EnFF: Latent-Dynamics Ensemble Flow Filtering for Data Assimilation with Sparse Observations
    Ziyu Tian, Kaichen Shen, Wenbo Hao, Phillip Si +2

    Data assimilation combines model forecasts with noisy, incomplete observations to estimate the evolving state of a dynamical system. Existing methods face two compounding challenges: high-dimensional nonlinear dynamics make repeated forward simulation computationally expensive, while sparse observations provide limited direct information about the full state. To address these challenges, we propose the Latent-Dynamics Ensemble Flow Filter (LD-EnFF), a sequential Bayesian filtering framework that performs both forecast propagation and filtering updates in a compact latent space. LD-EnFF combine

    latent dynamicsbenchmark
  701. arxiv:2610.04033 · cs.LG
    Gated Graph Neural Networks for Learning Hidden Independent Cascade Dynamics
    Anubha Goel, Illia Oleksiienko, Mateusz Wilinski, Alexandros Iosifidis +1

    Information and infectious diseases spread through social networks, but the spreading probabilities driving them are hard to estimate without per-node activation times. Applications seldom supply these, and inference must instead proceed through indirect and noisy proxies for the terminal infection states. We study this inverse problem on a fixed, known graph under the Hidden Independent Cascade (HIC) model, with one spreading probability per node rather than a single global rate, so the number of unknowns scales with the number of nodes. Seed sets and observation parameters are known, while a

    benchmark
  702. arxiv:2610.04013 · cs.RO
    Return-to-Home Feasible Micro-Aerial Vehicle Exploration for 3D Gaussian Splatting Reconstruction
    Prajit Krisshnakumar, Fan Yang, Koichiro Niinuma

    Micro aerial vehicles (MAVs) enable rapid indoor 3D reconstruction for inspection and time-critical situational awareness, but must operate under strict flight-time budgets and safety constraints that require explicit return-to-home (RTH) feasibility with a conservative margin. We present a topology-first active reconstruction framework that decouples high-fidelity rendering from navigation. A dense 3D Gaussian Splatting (3DGS) map is optimized as the reconstruction target, while a lightweight Truncated Signed Distance Field (TSDF)/occupancy scaffold supports conservative collision checking an

    benchmark
  703. arxiv:2610.04012 · cs.AI
    Beyond the Parameter Monolith: Reconstructive Memories, Executable Skills, and Residual Assembly for Language Models
    A. Bochkov

    Language-model systems can separate contextual computation, persistent storage, and exact execution instead of updating all capabilities through one shared parameter system. We investigate FEM-ASM, a finite-element-method-inspired organization in which independently constructed document states and deterministic executable skills contribute typed proposals to a shared language-model state. An explicit residual operator reconciles proposals attached to common interface nodes. We evaluate this organization through controlled experiments and negative results rather than claiming a physical finite-

    memory
  704. arxiv:2610.04009 · cs.RO
    SUAVE: Unified Video-Action Models via Masked Diffusion
    Rhythm Syed, Jean Mercat, Sedrick Keh, Kushal Arora +4

    Vision-language-action models (VLAs) inherit strong semantic grounding from pretrained vision-language backbones but are typically optimized for predicting actions rather than future observations. They can see and act, but they do not imagine the future before acting. World action models (WAMs) built on video diffusion backbones can imagine but treat language as frozen conditioning on a continuous latent space. Unified models bring these modalities into one architecture, but they either decode autoregressively, one token at a time, or keep video continuous with an auxiliary action head. In thi

    vision-language-actionmanipulationaction headrobot policyworld model
  705. arxiv:2610.04008 · cs.LG
    SkillScriptBench: Benchmarking Self-Evolution of Executable Agent Skill Packages Beyond Markdown
    Yuxuan Liu, Haoran Li, Yuhao Zhang, Jiahe Guo +9

    Executable Agent Skills combine natural-language instructions and scripts into reusable packages for LLM agents, and revising them requires fixing errors without breaking correct behavior. Existing benchmarks do not systematically distinguish documentation repair, script repair, and preservation when evaluating skill self-evolution. We introduce SkillScriptBench, a 350-task benchmark designed to evaluate these capabilities separately. From a survey of over 35,000 GitHub-hosted Skill roots, we select 100 packages and construct 150 repair tasks. Each task pairs a package containing injected scri

    agentllm agentbenchmark
  706. arxiv:2610.04007 · cs.CV
    VolS-GS: Relightable Gaussian Splatting with Volumetric Subsurface Scattering
    Junyeong Ahn, Jaegul Choo

    We present VolS-GS, a relightable Gaussian splatting framework that reconstructs objects from one-light-at-a-time (OLAT) captures and renders them under novel lighting and viewpoints. Relightable Gaussian Splatting methods typically model appearance independently at each primitive, which makes non-local effects difficult to represent. This limitation is particularly apparent for subsurface scattering, where light entering the object at one location can emerge at another. Rather than modeling this effect solely with a neural network or a local kernel at each primitive, we use the spatial suppor

    benchmark
  707. arxiv:2610.04003 · cs.LG
    Selective Backpropagation for Efficient Few-Shot Class-Incremental Learning
    Eeham Khan, Abdulmoumen Al-Atrash, Ali Ayub

    Few-Shot Class-Incremental Learning (FSCIL) requires models to continuously learn new classes from limited samples while retaining prior knowledge, under strict constraints on compute and memory. Existing approaches lie along a difficult trade-off: simple fine-tuning is computationally efficient but suffers from catastrophic forgetting, replay-based methods mitigate forgetting at the cost of substantial compute and memory, and exemplar-free methods often reduce forgetting by freezing most of the backbone, improving efficiency at the expense of adaptability. We propose Selective Backpropagation

    benchmark
  708. arxiv:2610.03998 · cs.AI
    Behavioral History Outperforms Descriptions of the Person for LLM Synthetic Personas
    Khashayar Pourtaheri, Ahmad Zareei

    Large language models (LLMs) are increasingly used as synthetic personas representing survey respondents. Their validity as substitutes for particular respondents depends on whether they reproduce individuals' decisions. We examine what information helps synthetic respondents predict each individual's later choices, using five conditions that add progressively richer information: no personal information, demographics, personality traits, cognitive scores, and finally the respondent's earlier survey choices as behavioral history. We use a two-wave panel of 845 US adults who completed measures o

    benchmark
  709. arxiv:2610.03997 · cs.RO
    REDIRECT: A 1% Fix for Bad Robot Habits
    Yu Zhang, Jiazhuo Li, Yancong Wei, Kangkang Dong +2

    Robots can acquire bad habits from a few defective moments in otherwise useful teleoperation. In mixed-quality robot data, normal and problematic demonstrations share most task behavior and differ only at a local action continuation. Full retraining is costly, while fine-tuning on clean data alone offers limited recovery under a small update budget. We ask whether the local difference can instead be fixed with only 1% of the full-training sample-backward budget. Using only episode-level retained/problematic labels, REDIRECT localizes the branch, assigns a coherent retained continuation to the

    teleoperation
  710. arxiv:2610.03994 · cs.AI
    Solving VeriContest with a Lean-Backed Rust Verifier
    Traian Serbanuta, Jun Xu, Andrei Stefanescu, Cosmin Radoi

    VeriContest is a benchmark of 1007 competitive-programming problems in Rust, each with a Verus specification, a judge-accepted solution, and a Verus proof. Its authors report that proof generation is the bottleneck for frontier models: given the specification and the code, the best model produces an accepted Verus proof for 13.95% of the problems on the first attempt. We report on solving the same proof-generation task with Rust-Prover, a verifier for Rust backed by Lean 4. The Verus specification and the Rust code are restated and translated into Lean, each specification becomes a theorem, an

    benchmark
  711. arxiv:2610.03984 · cs.LG
    Teaching Agents to Code Reliably
    Muhammad Ahmed Mohsin, Myeongsoo Kim, Kangrui Ruan, Shweta Garg +2

    Autonomous coding agents solve repository issues by reading code, running commands, editing files, and submitting patches. Extra inference-time compute yields gains only when it produces a useful repair and supplies reliable evidence for choosing one. Three behaviors decide both, and we argue they are teachable rather than byproducts of scale, so a policy can carry them instead of a scaffold. Location diversity remains narrow, since attempts return to the same site and extra samples add no coverage. Edit diversity is left unexploited, since methodologies that differ resolve complementary issue

    agent
  712. arxiv:2610.03980 · cs.CV
    FADE: Frame-Aware Diffusion-Transformer-based Multi-Concept Erasure for Video Unlearning
    Yuchen Li, Kaiyuan Deng, Chaoran Feng, Zhenyu Tang +1

    Text-to-video (T2V) diffusion models can reproduce copyrighted, violent, or explicit content, which motivates concept erasure: removing designated concepts from a pretrained model while preserving its behavior on everything else. Existing T2V erasure methods leave two problems open. Their frame-agnostic suppression can leave isolated frames in which an erased concept resurfaces, a frame-reactivation gap that clip-level averages obscure; and they are usually evaluated with one target concept or category at a time. We propose Frame-Aware Diffusion Erasure (FADE), a multi-concept video unlearning

    benchmark
  713. arxiv:2610.03971 · cs.AI
    An Executable Benchmark for LLM-Based HLS Repair:Design Complexity and Repair Underconstraint
    Maisha Mastora, Dean Sullivan

    Automated repair of High-Level Synthesis (HLS) designs using large language models (LLMs) is an emerging but underexplored problem. While LLM-based repair shows strong results on register-transfer level (RTL) Verilog, the only prior systematic study of HLS logic repair reports just 10.5% correction accuracy for GPT-4, with no analysis of why repair fails or what drives difficulty. We present the first comprehensive evaluation of LLM-based HLS repair across four models (GPT-4o, GPT-4o-mini, GPT-5.4, and Claude Opus 4.6) on 125 benchmark instances spanning eight logic bug types across three open

    benchmark
  714. arxiv:2610.03966 · cs.AI
    ROAR: Unifying Runs across Heterogeneous AI-Driven Research Systems
    Leo Y. Lin, Vishakha Ramani, Z. Berkay Celik, Paul Castro +1

    Each run of an AI-driven research system (ADRS) is an expensive search over a vast solution space, and dependable evaluation requires many runs, making run data both costly to produce and valuable to retain for large-scale analysis. Yet this data remains fragmented: teams operate in isolation, ADRS frameworks emit results in different formats, and no shared infrastructure exists to aggregate or compare runs across problems and systems. We present ROAR, a solution for systematically unifying and analyzing heterogeneous ADRS outputs. ROAR addresses two challenges: reconciling heterogeneous ADRS

    benchmark
  715. arxiv:2610.03964 · eess.SY
    Network Adaptation in IRS-Aided Hybrid RF/VLC Systems Using Cooperative Multi-Agent DRL
    Ahrar N. Hamad, Ahmad Adnan Qidan, Taisir E. H. El-Gorashi, Jaafar M. H. Elmirghani

    Hybrid radio frequency (RF) and visible light communication (VLC) networks have emerged as a promising solution for high-capacity indoor wireless connectivity in sixth-generation (6G) systems. However, the limited optical coverage and vulnerability of VLC links to line-of-sight (LoS) blockage under user mobility remain fundamental challenges. In this work, a mirror-based intelligent reflecting surface (IRS) is deployed to assist a dynamic indoor hybrid RF/VLC network, where each mobile user is exclusively assigned to either the IRS-enhanced VLC subnetwork or the RF subnetwork through a binary

    multi-agent
  716. arxiv:2610.03959 · cs.AI
    LatentQuant: Preserving the Policy-Facing Latent Contract under NVFP4 VAE Quantization
    Ziye Deng, Lufang Chen, Shuyu Feng, Zhenwei Duan +6

    Recent world action models (WAMs) reuse pretrained video VAEs whose encoder latents directly condition downstream action policies. Quantization must therefore preserve not only reconstruction fidelity but also the policy-facing latent contract expected by the frozen policy. Direct NVFP4 leaves W4A4 quantization error uncompensated, whereas joint quantization-aware training (QAT) can recover reconstruction by moving this representation. On Wan2.1, joint QAT nearly matches FP32 VBench-7 (0.7403 versus 0.7409), yet LIBERO success collapses from 95.5% to 10.5%. Controlled decoder-only experiments

    liberorobotwin
  717. arxiv:2610.03951 · cs.LG
    Evolving LLM-Generated Features for Interpretable Classification
    Jack Butler, Zainab Afolabi, Nikita Kozodoi

    Large language models (LLMs) are increasingly used as classifiers, yet they operate as opaque systems whose decisions are difficult to interpret, which complicates their use in regulated domains such as credit scoring or medical diagnosis. We propose an evolutionary framework that iteratively discovers natural language feature definitions (rubrics) for interpretable classification. An LLM generates candidate binary features, evaluates each sample against them, and the resulting vectors can be used to train a transparent classifier such as logistic regression. The feature set evolves over multi

    benchmark
  718. arxiv:2610.03948 · cs.AI
    Retrieval-Augmented Large Language Model Decision-Making for Autonomous Driving Guided by Chinese Philosophical Wisdom
    Xiaojun Bi, Xiaoyuan Ma, Yiwen Sun, Tianren Huang +4

    Autonomous driving decision systems must balance safety, efficiency, and social norms in complex traffic interactions. Philosophical and ethical considerations have received limited attention in existing autonomous driving decision-making approaches based on numerical optimization, sequence prediction, and large language models (LLMs). We propose Chinese Philosophical Wisdom-Guided Driving (CPW-Drive), a closed-loop retrieval-augmented generation (RAG) framework that incorporates value guidance derived from Chinese philosophy into autonomous driving decision-making. Using Chinese Confucian tho

    retrieval-augmented
  719. arxiv:2610.03945 · cs.LG
    DePICT: Decision-Preserving Interface for Constrained Downstream Tasks
    Utkarsh Grover, Ravi Ranjan, Agoritsa Polyzou, Wyatt T. Mackey +3

    A constrained optimization problem may involve a parameter in its objective and active constraints, yet the final decision may remain insensitive to small changes in that parameter. This raises a fundamental question: which inputs does a decision making system truly depend on? Building on this question, we introduce DePICT, a procedure for constructing decision preserving interfaces by ranking context directions according to the optimizer's solution sensitivity and aggregating them across an operating regime. We study this problem in a high dimensional setting where primitive context parameter

    agent
  720. arxiv:2610.03942 · cs.CV
    Dynamic Time Step Prediction in Inverse Heat Dissipation for Blur-Like Image Restoration Tasks
    Cap Dang Xuan Kiet, Tat-Jen Cham

    When using diffusion models to target image restoration problems, diffusion inversion is typically employed to retain relevant image information from the degraded images. Instead of inverting back to the initial time step (i.e., T), many methods invert to a pre-determined intermediate time step, in order to better preserve information from degraded source images. However, a pre-determined time step for inversion is not ideal for reconstruction, as a severely degraded image requires an earlier starting time step than a mildly degraded one. In addition, DDIM-based models corrupt the original sig

    benchmark
  721. arxiv:2610.03940 · cs.AI
    A Step Towards Forgetting: Optimiser History and the Loss of Answer Mass
    Valeria Ruscio, Seth Nabarro, Keiran Thompson

    During fine-tuning, a language model can assign less probability to previously learned answers even when the current gradient acts to preserve that probability. With momentum, each update also carries gradients computed at earlier model states, and these stored contributions can push the model in the opposite direction. We investigate how this optimiser memory contributes to forgetting by separating old-task loss into confusion among its answers and leakage of probability outside the answer set. Across three language-model families, answer mass consistently declines while discrimination among

    memory
  722. arxiv:2610.03939 · cs.LG
    TreeWalker: Partial Evaluation for Grouped Tree-Ensemble Inference
    Durmus Karatay, Richard Newman

    Many inference workloads evaluate a trained tree ensemble on row groups that share feature values: discrete-time survival models expand each patient into $G$ time steps, click-through-rate models score every item in a search session, and scenario analyses vary a few inputs while holding the rest fixed. Standard inference treats each row independently and repeats the shared work $G$ times. We present TreeWalker, which applies partial evaluation to grouped inference: constant features are static, varying features dynamic. It walks each tree once per group, partitions a row bitmask at varying spl

    benchmarkevaluator
  723. arxiv:2610.03938 · cs.AI
    MLLMs Fail to Refuse when Using Tools Agentically
    Rikiya Takehi, Ryo Hachiuma, Shaona Ghosh, Dan Zhao +2

    Agentic multimodal large language models (MLLMs) have recently pushed the frontier of visual reasoning by calling tools such as zooming and tagging. Despite the recent strong success of agentic MLLMs, this work uncovers a critical safety failure in the tool-use paradigm: agentic tool-using MLLMs become less capable of refusing harmful requests. Our experiments confirm that, across three popular safety benchmarks, all the top open- and closed-weight MLLMs we test exhibit significantly lower safety in tool-using settings than in non-tool settings, with a relative refusal failure rate increase of

    agentictool-usebenchmark
  724. arxiv:2610.03935 · cs.CL
    General Decision Models: Benchmarking and Insights Beyond Jev
    Feiyu Duan, Jiayu Lin, Jia Wang, Jun Xiang +5

    General decision models, such as Jev, have recently emerged as efficient alternatives to LLMs for structured judgment and selection. But what kinds of decisions can these models reliably make, and how does their behavior change when individual decisions are composed into larger systems? To study this, we introduce JEVal, a bilingual benchmark comprising 11,257 instances from 36 datasets across 10 application domains, and evaluate 25 model configurations spanning general decision models and generative LLMs. Our results show that (1) general decision models are most competitive when decisions ca

    benchmark
  725. arxiv:2610.03934 · cs.AI
    SGAnalog: An End-to-End Circuit Benchmark from Open-Source Silicon Tapeouts
    Yueting Li, Weihang Ding

    Existing analog integrated circuit design benchmarks make two questions hard to answer: whether a model has learned transferable circuit skills rather than recalled familiar examples, and whether its output works under defined process and test conditions. We introduce a benchmark built from human-designed, open-source circuits associated with Tiny Tapeout manufacturing shuttles. The collection contains 273 topologically distinct top-level designs. Every source is retrieved at the revision recorded for its shuttle submission and processed in a fixed containerized environment. The pipeline expor

    benchmark
  726. arxiv:2610.03930 · cs.MA
    Resilient Multi-Agent Target Localization and Tracking via BAG-Aware Mutual Information Maximization under False Data Injection Attacks
    Bibek Adhikari, Samrat Chaulagain, Kamesh Subbarao

    Cooperative multi-agent networks deployed for target localization and tracking remain critically vulnerable to malicious cyberattacks, since a single compromised agent can corrupt the centralized target belief and mislead the estimation process across the entire network. This paper presents a resilient multi-agent target localization and tracking framework under a limited agent sensing range and false-data injection (FDI) attacks. The proposed method combines information-based navigation for target search and posterior target state uncertainty reduction, Bayesian attack graph (BAG) based attac

    agentmulti-agent
  727. arxiv:2610.03928 · cs.CV
    DABACO: A Multi-Camera Dataset and Benchmark for Screen Localization and Pointing Estimation
    Óscar Gómez-Cárdenes, José Gil Marichal-Hernández, Juan Manuel Martín-Doñas

    Screen localization and pointing estimation are key to low-cost interactive devices. Yet developing and evaluating these algorithms requires realistic data: synthetic captures cannot fully reproduce the optical distortion, rolling shutter, motion blur, and display processing of a physical acquisition, and most existing datasets provide static images rather than the video needed to assess continuous pointing. In this paper, we introduce the DABACO Dataset. Developed within the DABACO (Dispositivo Apuntador de BAjo COste, or Low-Cost Pointing Device) project, this dataset supports the developmen

    benchmark
  728. arxiv:2610.03924 · cs.RO
    Barrier-Shaped Recurrent Reinforcement Learning for Autonomous Landing on a Heaving Ship Deck
    Ritwik Shankar, Chiranjeev Prachand, Abhishek, Soumya Ranjan Sahoo

    This paper addresses autonomous landing of unmanned aerial vehicle (UAV) rotorcrafts on a heaving ship deck using a recurrent policy trained via asymmetric actor-critic reinforcement learning: the critic sees 6 s of future deck height during training, while the actor sees only what the onboard sensors provide in flight, a 17-dimensional state made of the vehicle's position, velocity and attitude relative to the deck and outputs world-frame velocity and yaw-rate commands. Training is performed across 4096 parallel simulated environments, followed by fine-tuning in 16 environments with an onboar

    manipulator
  729. arxiv:2610.03902 · cs.CL
    When Evidence Changes: Evaluating Memory Repair and Re-reading in Language-Model Agents
    Wenhui Chu

    When documents supporting an agent's derived facts are revoked or replaced, should it repair memory or re-read current evidence? We introduce an evidence-revision evaluation on medication- and problem-list tasks from public ICU records. Under revocation, replacement and control events, we compare full and source-filtered re-reading with caching, rebuilding and graph-local repair across two 7B models. Memory is supplied in full without retrieval, and costs include ingest, revision and every use. On short records, local repair uses 5-10$\times$ fewer revision tokens than rebuilding, yet every me

    memoryagent memoryagent
  730. arxiv:2610.03896 · cs.LG
    AdaEva: Accelerating LLM-Driven Algorithm Design with Adaptive Partial Evaluation
    Tai Nguyen, Fei Liu, Phong Le, Carola Doerr +1

    Large Language Models (LLMs) are increasingly used for automated algorithm design. However the computational cost of evaluating the generated algorithms can be excessive. We consider the common LLM-driven automated algorithm design (LLM4AD) setting in which a candidate algorithm is evaluated by aggregating its performance over a shared set of training instances. This instance-wise structure raises a natural question: must every candidate be evaluated on the entire instance set before deciding whether it remains competitive? Taking inspiration from algorithm configuration, we introduce AdaEva,

    evaluatorevaluation framework
  731. arxiv:2610.03894 · cs.LG
    Proxy Confidence: Auditing Black-Box LLM Agents with a Surrogate's Log-Probabilities
    Yikai Zhao, Saurabh Pandey, Pradeep Kumar Misra

    A deployed LLM agent emits tool calls, queries, and code that can be silently wrong -- by the time the error surfaces, the action has run. Frontier chat APIs hide the model's token probabilities; the agent's stated confidence barely beats chance on the mistakes that matter; and resampling does not help, since frontier models are highly repetitive, reproducing the same call across samples. We recover the missing signal from a low-cost open-weight surrogate run in parallel. It reads the same context, schema, and proposed action as the agent, then scores the call from its own log-probabilities th

    agentllm agentbenchmark
  732. arxiv:2610.03880 · cs.LG
    Reinforcement Learning on the Discrete Composition Channel of a Crystal Generator: Validated Gains and Reward Hacking
    Pawan Prakash, Philipp Höllmer, Addis Fuhr, Peter Hirschfeld +3

    Inverse materials design is a long-standing goal of computational materials discovery. Generative models for crystalline materials are typically trained to match the distribution of a structure database, while nothing in their training objective points them at specific design goals such as targeted properties. We use group-relative policy optimization (GRPO) to align a generative model based on stochastic interpolants and discrete flow matching with general black-box reward functions through reinforcement learning. Atom types are generated by a discrete flow and the policy gradient of our gene

    benchmark
  733. arxiv:2610.03873 · cs.LG
    Streaming Multi-Track Timeline Control for 3D Human Motion Generation
    Yangsong Zhang, Anujith Muraleedharan, Rikhat Akizhanov, Gül Varol +2

    Text-driven human motion generation has advanced substantially, yet most methods assume instructions are available before synthesis. Interactive applications require responding to new instructions while continuing ongoing actions, such as answering a phone while walking. Existing approaches address streaming generation or simultaneous composition without explicitly combining streaming instruction arrival with independently timed, overlapping actions. We introduce streaming multi-track timeline control and propose TimelineControl to incorporate new instructions alongside ongoing actions. Interv

    humanoid
  734. arxiv:2610.03872 · cs.LG
    Training Numerical Intelligence via Auto-Diagnosis and Skill Discovery
    Peter Chen, Wotao Yin

    AI agents are becoming increasingly capable of generating scientific code, but generating code is not the same as improving the algorithms behind it. For numerical solvers, execution feedback can expose poor performance, but rarely reveals its underlying cause and how to address it. We introduce Auto-Diagnosis and Skill Discovery (ADSD), a framework that links numerical diagnosis to reusable solver self-improvement. ADSD follows a diagnosis-first paradigm that first explains why a solver performs poorly, then uses this diagnosis to guide the discovery of appropriate numerical methods. The resu

    ai agentself-improvement
  735. arxiv:2610.03861 · cs.RO
    GOTT: Object-centric Dexterous Manipulation with a Reusable Cross-Embodiment Primitive
    Yulin Liu, Lai Wei, Yen-Jen Wang, Akash Sharma +3

    Foundation models and large-scale human data provide rich sources of manipulation intent, but translating this intent into multi-fingered robot behavior remains difficult. Dexterous hands still lack a reusable low-level primitive that reliably establishes contact across tasks and embodiments. We propose GOTT, a reach-acquire-move framework built around a single cross-embodiment contact-acquisition primitive. Given a robot-agnostic object trajectory and a reach specification, GOTT first brings the hand near a task-relevant contact region. The shared closed-loop primitive then establishes stable

    manipulationdexterousgrasp
  736. arxiv:2610.03842 · cs.LG
    KVE-KD: Key Visual Evidence-Guided Knowledge Distillation for Vision-Language Models
    Jianbin Zhang, Xin Sun, Shanwen Wang, Wei Ye +1

    Knowledge distillation is crucial for deploying vision-language models on resource-constrained devices. However, existing methods typically impose uniform supervision across visual tokens or rely on static token selection, which confuses task-relevant cues with background noise and degrades cross-modal reasoning. To address this limitation, we propose Key Visual Evidence-guided Knowledge Distillation (KVE-KD), a framework that dynamically focuses feature distillation on task-relevant visual tokens identified by the teacher model. Specifically, KVE-KD appoints the final pre-generation textual t

    benchmark
  737. arxiv:2610.03187 · cs.CV
    Lightweight and Resource-Efficient Perception for Robotic Guide Dogs
    Jinse Kwon, Yoojin Lim, Choonghan Lee, Yongseung Yu +2

    Robotic guide dogs should understand their surroundings, objects, and potential risks. Prior research has focused on raw sensor data from cameras and 2D or 3D LiDAR, which precisely measure distance points rather than provide a semantic understanding of the scene. While these physical measurements are effective for robot-centric collision avoidance and robot safety, they are not suitable for human-centric guidance. The system should recognize the type and relevance of obstacles and explain them, clearly and actionably, in terms of their spatial relation to the user. We present complete on-devi

    quadrupedbenchmark
  738. arxiv:2610.03830 · cs.LG
    Memory-State Critic for Asymmetric Actor-Critic with Application to Vision-Based Pursuit-Evasion
    Arthur Louette, Alejandro Sánchez Roncero, Gaspard Lambrechts, Pascal Leroy +3

    In partially observable Markov decision processes, the optimal policy generally depends on the history of observations and past actions. Asymmetric actor-critic methods have become popular to learn such policies when additional information, such as the true state of the environment, is available during training. The critic, which is not needed at execution, is given access to the state. A critic conditioned on the state alone is generally ill-defined and yields biased policy gradients. Conditioning on the state and the history, the history-state critic restores both. In this paper, we show tha

    memoryarena
  739. arxiv:2610.03828 · cs.RO
    TACET: Context-Appropriate Acoustic-Social Navigation for Quadrupeds
    Sungsan Park, Young-Sik Shin, Sanghyun Kim

    Quadruped robots entering hospitals, care homes, and quiet offices must be context-appropriate not only in where they move but in how loudly they move: a legged robot's locomotion noise, dominated by foot-ground impacts, is itself a social variable. Prior social navigation respects human space but treats the robot as acoustically uniform, while quiet-locomotion methods reduce noise to an operator-specified, context-blind level. We present TACET, a context-appropriate acoustic-social navigation method that infers social context from the robot's egocentric view and decides both where it walks an

    quadrupedmemory
  740. arxiv:2610.03826 · cs.CV
    Are We Measuring Anticipation? Auditing Privileged Information in Procedural Video Evaluation
    Mahsa Mohammadi, Sareh Rowlands

    Benchmark scores license claims about the capabilities being evaluated. We audit the inference licensed by an evaluation protocol, rather than the predictive model alone. Using procedural action anticipation as a controlled case study, we study a broader evaluation-validity failure mode: a protocol can remain temporally causal and free of classical target leakage while still supplying a privileged intermediate representation. The failure is not merely optimistic accuracy, but a mismatch between the capability claimed and the construct actually measured. On Breakfast, matched recognizer-history

    benchmarkevaluation protocol
  741. arxiv:2610.03825 · cs.LG
    Same Output, Different Gold: Measuring How Reference Choice Moves a Multilingual Benchmark Score
    Parth Kulshreshtha, Shivali Dalmia, Abhishek Mukherji

    A benchmark score compares a system output against a reference, and methodological attention falls almost entirely on the first term. We measure the second. The retained annotation record of a six-language benchmark for personally identifiable information contains two independent annotator labellings, the aggregate shipped as gold, and a reviewer gold from independent expert re-annotation of a sample. Using it, we hold the scored output fixed and exchange the reference. The score moves by 4.95 F1 points for one output and 2.00 for the other (95% CIs [3.23, 6.27] and [0.26, 3.37]), and by 7.55

    benchmark
  742. arxiv:2610.03820 · cs.AI
    From Requirements to Attack Trees: Grounded LLM Agents for Design-Time Security Review
    Akash Iyer, Taha Demirkan, Keerthi Koneru, Aaryan Siddharthan +2

    Design-level security weaknesses can arise from requirements, trust assumptions, missing controls, and data flows before implementation begins. Existing security practices often identify these issues after code is written. We present a multi-agent LLM framework for design-time security analysis from product requirement documents and architecture diagrams. The proposed framework parses architecture diagrams into graph representations, generates misuse and failure cases, constructs attack trees, checks governance and compliance gaps, recommends mitigations, assigns enterprise security-domain tag

    llm agentmulti-agentagent system

02 US SEMI · SEC 8-K FILINGS

0 items

scanned: NVDA / AVGO / MRVL / COHR / LITE / AMD / TSM / SMCI / ANET / CRDO / POWL / VECO

NO FILINGS IN LAST 2 TRADING DAYS

03 HUMANOID · COMPANY NEWS

54 items

scanned: figure-ai / 1x / boston-dynamics / unitree / apptronik / sanctuary-ai / neura-robotics / agility-robotics / physical-intelligence / agibot

04 CN PHOTONICS · ANNOUNCEMENTS

0 items
China sources are not connected yet.