Research

• Reliable request execution in streaming video generation1 paper raises it · 0 address it

  Models struggle to follow incremental multimodal requests while maintaining state consistency and visual fidelity.

  • StreamEval: Evaluating Interactive Streaming Video Generation Modelsraises
• End-to-end deep search in real-world open Web environments1 paper raises it · 0 address it

  Agents cannot reliably explore, integrate, and verify evidence from diverse, interactive, and heterogeneous web sources.

  • Deep Search in Real-World Web Environmentsraises
• Prior-consistent solutions for ambiguous nonlinear inverse problems1 paper raises it · 1 addresses it

  Diffusion-based samplers often favor measurement-consistent but prior-inconsistent solutions in ambiguous cases, masking failures with best-of-k reporting.

  • Beyond Best-of-$k$: Prior-Consistent DAPS for Ambiguous Nonlinear Inverse Problemsraises · addresses
• Explainable artifact detection in AI-generated videos1 paper raises it · 1 addresses it

  Detectors often fail to identify subtle artifacts or justify their decisions with faithful evidence.

  • Verus-Insight: Towards Explainable Artifact Detection in AI-Generated Videosraises · addresses
• Temporal trajectory modeling for clinical risk prediction1 paper raises it · 1 addresses it

  Existing multimodal approaches underutilize irregular, heterogeneous clinical data accumulated over time for accurate inpatient risk prediction.

  • TRACE: Tracking Multimodal Clinical Trajectories for Inpatient Risk Predictionraises · addresses

Named by an AI from these papers' abstracts.

• arXiv cs.ROOct 12

  Trust-Calibrated VLA Policy Post-Training with Evolving Imagination

  Wenzhan Li, Yiran Qin, Heng Zhou, Huirui Wang, Yulan Guo +1

  Vision-Language-Action (VLA) models are often pretrained via imitation learning, making reinforcement learning (RL) post-training important when deployment moves beyond demonstration coverage. Existing refinement paradigms expose a reliability--efficiency tension: model-free refinement avoids simulator bias but is interaction-intensive, whereas model-based refinement can exploit unreliable imagination even as its simulator adapts. We propose Model-Evolving Reinforcement Learning (MERL), a trust-calibrated framework that couples policy optimization with an online-updated simulator comprising a world model and a reward proxy head. Across stages, simulator reliability controls the imagined-data ratio and rollout horizon; within rollouts, chunk-level trust controls replay selection and optimization weight. For recursive imagination without exact grounded continuations, a residual predictor estimates trust without querying future ground truth. On perturbed LIBERO-PRO tasks, MERL reaches 79.7% average success, improves high-threshold learning speed by 10.9% over the matched model-free control, and outperforms same-protocol external baselines across three training seeds. Fixed-data…

  CodePDF

  Summarize this
• arXiv cs.CLOct 12

  Intent-Triggered Anchoring for Multi-Token Format Units in Parallel Decoding of Diffusion Language Models

  Junhyeok Lee, Kyu Sung Choi

  In parallel decoding, diffusion language models commit several tokens per forward pass, so co-committed tokens cannot see each other, breaking multi-token format units that parsers need. On ECHO, an open-weight one-step chest X-ray (CXR) report generator, 32.7-36.7% of evaluation reports lack a parseable Impression heading and score as empty. We propose intent-triggered anchoring, a training-free decoding rule that completes a format unit once the model commits its first token, inserting only units with a unique, content-free completion; fallbacks write the unit when the model stops or loops without starting it. On three CXR evaluation sets, the rule raises readable rates from 63.3-67.3% to 100.0% with no regressions and a 95th-percentile latency ratio of 0.68-1.28 against official decoding. Broken headings state findings absent from the reference; adding the heading at the end leaves them in 15.5-31.0% of reports, our rule in at most 0.6%. For math answer markers, the rule raises accuracy in the most parallel setting of five diffusion language models by 5.8-20.8 points on GSM8K and 5.1-17.1 on GSM-Symbolic, held out from tuning. With lenient answer extraction, gains are 3.3-12.5…

  PDF

  Summarize this
• arXiv cs.AIOct 12

  Boosting the Learning for Ranking Patterns

  Nassim Belmecheri, Noureddine Aribi, Nadjib Lazaar, Yahia Lebbah, Samir Loudni

  Pattern mining is a valuable tool for exploratory data analysis, but identifying relevant patterns for a specific user is challenging. Various interestingness mea- sures have been developed to evaluate patterns, but they may not efficiently estimate user-specific functions. Learning user-specific functions by ranking patterns has been proposed, but this requires significant time and training samples. In this paper, we present a solution that formulates the problem of learning pattern ranking functions as a multicriteria decision making problem. Our approach uses Analytic Hierarchy Process (AHP) to elicit weights for different interestingness measures based on user preference. We also propose an active learning mode with a sensitivity-based heuristic to minimize user ranking queries while still providing high-quality results. Experiments show that our approach significantly reduces running time and returns precise pattern ranking while being robust to user error, compared to state-of-the-art approaches.

  PDF

  Summarize this
• arXiv cs.LGOct 12

  pi-Net: Empirical Latent Representations for Differentiable Physics Heads in Data-Scarce Systems

  Akshay Dhalpe, Arnab Chattopadhyay, Shahriar Bakrani Balani, Eric Cortanéa, Sasu Tarkoma

  Developing reliable predictive models for multi-physics systems often forces a compromise between computationally demanding physical simulators and data-hungry, opaque machine learning (ML) algorithms. While incorporating dimensional analysis into directed computation graphs offers a structurally sound alternative to explicitly solving partial differential equations (PDEs), such formulations typically yield underdetermined systems that act as imperfect simulators. We introduce pi-Net, a physics-informed latent variable model that resolves these imperfect simulators. The hybrid pi-Net architecture consists of an encoder that maps inputs into physically normalized latent space, which are then decoded into final predictions by a differentiable physics head. Evaluated on a real-world, data-scarce Gas Metal Arc Welding (GMAW) case study, the framework achieves an R2 of 0.864 with only 60 experimental samples. The results demonstrate that pi-Net significantly outperforms purely data-driven baselines in data-scarce regimes while providing causal, process-level explainability.

  PDF

  Summarize this
• arXiv cs.CVOct 12

  KARAMEL: Knowledge-Aware Ranking for Multimodal Entity Linking in the Arts via Heterogeneous Graphs

  Raffaele Scaringi, Alejandro Sierra-Múnera, Gennaro Vessio, Giovanna Castellano, Ralf Krestel

  Discovering and disambiguating entities from multimodal and heterogeneous data is a key challenge in discovery science, where relevant knowledge is often implicit and distributed across modalities. We present KARAMEL, a framework for multimodal entity linking (MEL) - the task of aligning visual and textual mentions to entities in a knowledge base - in the cultural heritage domain. Unlike prior vision-language models that primarily rely on surface-level multimodal alignment, our approach incorporates sociohistorical and contextual knowledge through a knowledge-aware architecture that fuses a vision-language encoder with a heterogeneous graph neural network. This design enables contextual reasoning over complex relational structures and supports robust entity disambiguation under ambiguous or underspecified evidence. To benchmark multimodal discovery in this setting, we introduce WikiMuSA (Wikidata-based Multimodal Semantic data for Art), a new dataset that links artworks to Wikidata entities via images, textual descriptions, and structured contextual knowledge. Experimental results show that KARAMEL surpasses strong baselines, particularly on implicit or abstract mentions, while…

  PDF

  Summarize this
• arXiv cs.CVOct 12

  Self-Verifier Capture in Unified Visual Generators: Diagnosing and Repairing Closed-Loop Self-Reward

  Binyan Chen, Tong Pan

  Image-space reward requires decoding and a separate judge; unified visual generators can instead reuse their understanding pathway for decode-free, self-supplied reward. Optimizing against this verifier closes the self-reward loop; shared trainable weights let one update move generation and scoring even with the reward gradient stopped. We call the resulting failure self-verifier capture: self-reward rises while independently measured quality falls. Matched semantic/denoising by shared/frozen cells on Scale-RAE isolate two routes: the policy exploits on-manifold blind spots of a frozen semantic judge, while shared updates additionally rewrite the judge. A frozen judge also becomes stale, and repeated self-refresh yields progressively weaker recoveries. The diagnosis yields a two-part repair: locking the warmed reward read blocks rewriting, while sparse, parameter-disjoint external anchors counter residual exploitation. Unanchored rollouts retain semantic reward across multiple latent noise levels, providing dense latent reward that terminal image-space judging cannot supply, while a drift-triggered controller allocates anchors to high-drift rollouts and propagates their…

  PDF

  Summarize this
• arXiv cs.SIOct 12

  From Caricature to Collective Artifact: How Persona Construction Drives Polarization in Generative Social Simulations

  Dimitris Michailidis, Petter Törnberg, Fernando P. Santos

  Generative Social Simulation (GSS) leverages Large Language Models (LLMs) to create sophisticated personas that define agents with demographics, emotions, and political opinions. While prior work shows that personas compress outputs into stereotypical caricatures, there is no comprehensive study of how these caricatures evolve into collective artifacts when they interact. Using a Twitter-like GSS platform with personas derived from the American National Elections Study (ANES), we ablate three layers of partisan identity: affective polarization markers, party identification, and vote choice, while retaining demographics, ideological positioning and important issues. We find that collective outcomes depend heavily on how survey responses are translated into personas. Removing a few explicitly partisan statements moves the network from near-complete segregation to cross-party ties approaching those of real Twitter networks. We argue that matching one outcome is not evidence for behavioral validity and point to salience as a possible explanation. Surveys ask for a position on every question regardless of its importance to the respondent, and persona construction turns each answer…

  PDF

  Summarize this
• arXiv cs.LGOct 12

  Drafting Agents, Not Just Tokens: Speculative Recursive Self-Improvement for Agentic Systems

  Xin Xu, Ke Cheng, Hao Wang, Yangru Huang, Yanghao Xiao +9

  Improving an agent through successive revisions requires balancing exploration and evaluation under a limited budget. A narrow search can miss useful sequences of edits, while fully evaluating every intermediate version can exhaust the budget before those sequences yield a verified improvement. We introduce Speculative Recursive Self-Improvement (SpecRSI), which drafts executable successor agents before their predecessors are fully evaluated, while requiring complete verification before adoption. Verification-Aware Tree Search (VATS) allocates the budget between further edits and outstanding checks using the predicted verified return of a continuation. Group Verification Optimization (GVO) learns the improver from completed searches while keeping the real evaluator fixed. In the main scientific comparison, terminal gains exceed Janus by 33.3%--40.0%. Additional evaluations show that SpecRSI outperforms Janus in all 50 scientific backbone--task pairs and exceeds MetaRSI-v1 by 1.85%--2.38% in macro-average system score across twenty backbones. Coding-validation success reaches 69.4% versus HGM's 64.3% at a 20.8% lower target-cost index.

  Code
• arXiv cs.CLOct 12

  Communication, Vocalisation, and Language

  Peter Wallis

  The contention is that the current batch of Large Language Models don't *understand* language, but they *do* it. Rather than LLMs forming some kind of ``distributed representation'' of symbols, the claim is that LLMs are capturing ``Cultural Intelligence'' and grounding symbols in what the sociologists call practices.

  PDF

  Summarize this
• arXiv cs.LGOct 12

  Growing and Transferring Pathways for LLM Reinforcement Learning

  Haolin Tian, Yikang Li, Tonghan Wang

  Reinforcement learning (RL) can substantially improve the reasoning capabilities of large language models, but an effective training run requires considerable resources. Reusing the computation acquired through RL across models would extend the value of that training. We propose GrowRL, an RL method that organizes learned updates into compact computational pathways through structural growth. GrowRL freezes the pretrained backbone and adds an independent causal attention branch and a feed-forward network branch at each Transformer layer. Zero-initialized output projections preserve the pretrained policy at initialization, and RL updates only the added pathways. The learned pathways remain explicit after training, allowing transfer to structurally compatible target models and subsequent adaptation with the target backbone frozen. The architecture also supports sequential transfer of additional pathways. By keeping the learned attention and feed-forward computation separate from the pretrained weights, GrowRL provides an explicit structure for preserving and reusing the outcome of an RL run. Experiments across five backbones show competitive mathematical reasoning and…

  PDF

  Summarize this
• arXiv cs.LGOct 12

  SLEM: Spectrum-Aware Latent Expert Merging

  Dohyeon Kim, Bedionita Soro, Bruno Andreis, Sung Ju Hwang

  Mixture-of-Experts (MoE) models scale model capacity efficiently by activating only a small subset of experts for each input, while still requiring all parameters to be stored in memory, resulting in substantial memory overhead. Expert merging techniques have recently emerged as a promising compression paradigm that reduces this overhead by consolidating multiple experts into a smaller set. However, existing approaches have two key limitations: (i) direct convex interpolation in parameter space is not generally guaranteed to yield meaningful interpolation of expert functions; and (ii) estimating expert similarity or merging coefficients often relies on calibration data, introducing dependence on the calibration distribution. To address these limitations, we propose Spectrum-Aware Latent Expert Merging (SLEM), a calibration-free expert merging framework that occurs in a structured latent representation of expert weights using a VAE. SLEM groups experts within and across layers based on latent similarities and derives merging coefficients from expert weight spectra. It then performs geometry-aware latent interpolation and decodes the resulting representations into merged expert…

  PDF

  Summarize this
• arXiv cs.CVOct 12

  MiMaAlign: Hierarchical Micro-Macro Alignment for Physically Plausible Video Generation

  Yansong Liu, Litong Gong, Weijie Li, Tiezheng Ge, Ming Zeng

  Text-to-video (T2V) diffusion models have made remarkable progress in generating high-fidelity visuals, yet their outputs still often exhibit physically implausible phenomena, including discontinuous dynamics and implausible event interactions. Existing representation alignment methods mainly transfer generic video features or short-range motion cues, treating physical plausibility as a single-level representation problem. To address this issue, we propose MiMaAlign, a hierarchical micro-macro alignment framework that transfers complementary dynamics-oriented and event-oriented knowledge into different abstraction depths of a pretrained video diffusion model. Specifically, micro-level continuous dynamics alignment imposes constraints by aligning diffusion features with a continuous-time motion representation learned by a Neural Ordinary Differential Equation (Neural ODE), while macro-level event-commonsense alignment provides representations of object interactions and event semantics through an instruction-prompted vision-language model (VLM). With training-only auxiliary objectives, we align the complementary supervision from the two teachers with shallower and deeper generator…

  PDF

  Summarize this
• arXiv cs.AIOct 12

  PXRD-Bench: How Close Are We to Determining Crystal Structures from Powder Diffraction?

  Dongyeop Woo, Nofit Segal, Nayoung Kim, Minkyu Kim, Rafael Gomez-Bombarelli +1

  Determining crystal structures from powder X-ray diffraction (PXRD) would enable routine characterization of newly synthesized materials, including those absent from reference databases. Generative models offer a promising approach, but existing evaluations remain fragmented and largely assume single-phase samples with known composition. To fill this gap, we introduce PXRD-Bench, a unified benchmark that extends evaluation to unknown per-element atom counts and recovery of both structures in two-phase mixtures. It provides approximately 4.1 million training structures with simulated PXRD, tests generalization to unseen compositions and structural prototypes, and evaluates recovery from experimental PXRD after excluding structurally matching training entries. To provide a strong reference baseline, we also introduce Bragglite, a PXRD-to-structure model developed through a systematic study of PXRD modeling choices. It achieves a 44.2\% Top-1 match rate on experimental RRUFF patterns with known composition, 24.6\% above the strongest prior baseline. Further analysis yields several key findings: some models fail to benefit from experimental PXRD, while generalization to unseen…

  PDF

  Summarize this
• arXiv cs.AIOct 12

  XAI-Guided Fourier Domain Generalisation for Pure-Simulation Sim-to-Real Deep Reinforcement Learning

  Wei Yao, Chuyao Wang, Ziwei Wang, Nabil Aouf

  Deep reinforcement learning has shown strong potential for vision-based autonomous driving, but policies trained in simulation often suffer severe performance degradation when deployed in the real world. Existing sim-to-real methods commonly address this gap through image-transfer-based domain adaptation or policy-agnostic domain randomisation. However, the former requires laborious acquisition of target-domain data and is often limited to the deployment domain, whereas the latter introduces unguided perturbations that may not reflect the underlying sim-to-real discrepancy, leading to suboptimal transfer performance. To overcome these limitations, we propose XFD, an explainable artificial intelligence (XAI)-guided Fourier domain generalisation framework for pure-simulation sim-to-real reinforcement learning. The proposed framework extracts explainability attribution maps from simulated observations, and converts these attributions into policy-conditioned Fourier-domain interventions. By perturbing appearance-sensitive spectral components while preserving task-defining spatial structures, XFD constructs robustness-enhancing visual domains entirely within simulation. Subsequently,…

  PDF

  Summarize this
• arXiv cs.CLOct 12

  Ontology-Based Post-Coordinated Expression Assembly: from Clinical Narrative to Queryable Knowledge Graphs

  Johann Pignat, Christophe Gaudet-Blavignac, Julien Ehrsam, Jean-Philippe Goldman, Cyrille Duret +5

  Clinical oncology documentation records decisive information in free text, where it remains readable but not retrievable at scale, leaving cohort identification dependent on incomplete diagnostic codes or manual review. The current standard, coding individual terms, captures what a document mentions, not what it asserts: meaning lies in how those terms relate to one another. We present a method for deriving queryable knowledge graphs from clinical narratives, conforming to the Extended Grammar of SNOMED CT across multiple ontologies. The method specifies how entities should be annotated and related. It defines five relation classes, each bound to a construction rule that assembles the entities and relations into post-coordinated expressions. A deterministic implementation, UNIGRAPHE, applies those rules to construct knowledge graphs from annotated text. Applied to expert-annotated real-world oncology documentation, UNIGRAPHE reconstructed 5,299 annotations into 2,196 post-coordinated expressions and shows that relation structure is the missing piece to make clinical narrative formally queryable.

  PDF

  Summarize this
• arXiv cs.CVOct 12

  Auditing Observation-Quality Shortcuts in the Evaluation of Person-Centered Motion for Video Anomaly Detection

  Chaehyun Kim, Changwon Lim

  Video anomaly detection (VAD) identifies deviations from normal patterns, but such deviations do not necessarily correspond to safety-critical events. We focus on human-centered emergencies and violence and investigate whether motion-based anomaly discrimination reflects task-relevant motion information or observation-quality differences arising from person detection, pose estimation, and tracking. We introduce an observation-quality-aware evaluation framework that combines quality diagnostics, quality balancing, motion orthogonalization, and robustness analyses. On human-centered categories of UCF-Crime, quality-only features match or exceed the discrimination of multi-cue motion in the original cohort, revealing a strong observation-quality shortcut. After cardinality matching brings all 11 measured quality variables below a prespecified marginal balance threshold, multi-cue motion consistently outperforms quality-only features across Logistic Regression, Random Forest, and RBF-SVM, yielding ROC-AUC gains of 0.046-0.141. Because nonlinear quality-only prediction remains above chance after matching, we interpret this result as additional discrimination beyond measured marginal…

  PDF

  Summarize this
• arXiv cs.CLOct 12

  PATMT2: Two-stage domain adaptation for multilingual patent translation

  Xiaowei Su, Xusen Cheng

  We present PatMT2 (Patent Machine Translation, v2), a two-stage LoRA pipeline that adapts the Hy-MT2-7B dedicated translation model to four-language (Chinese/English/Japanese/Korean) patent translation. On six translation directions, the Stage-2 checkpoint reaches a macro-average BLEU of 43.39 (BF16) to 43.57 (AWQ INT4), improving over the Hy-MT2-7B base by up to +8.8 BLEU and also exceeding Qwen3-32B and several external systems on the same average. We then measure the cost of adaptation: probing 38 languages absent from the fine-tuning data, the model still produces correct, fluent output on 34, while four low-resource languages collapse into distinct, reproducible failure modes. We treat these as diagnostic cases rather than retention rates, and report their mechanisms without attributing them to a single cause. Paired bootstrap tests confirm the translation gains over all baselines (p < 0.001).

  PDF

  Summarize this
• arXiv cs.CVOct 12

  Teaching Vision-Language Models to Decline: Support Completion Against Mirage

  Alfaj Uddin Ahmed, Md. Shaown Miah, Md Arid Hasan, Syed Ishtiaque Ahmed, Sayeed Shafayet Chowdhury

  Vision-language models answer questions about images they were never shown, a failure called mirage. Such an answer can be correct without being justified by the evidence, and the difference matters wherever a model's output is checked by someone who did not see its input. We locate the failure in the training objective: cross-entropy separates a model that reads the image from one that ignores it by only the conditional mutual information between answer and image, and no training example rewards declining. We formalise support completion, TIDE, which also shows each training question with a blank image, a same-domain wrong image and an out-of-domain image, with targets that decline, and prove that under TIDE every image-blind predictor is suboptimal by at least 1.04 nats per example, that the optimum declines exactly on the counterfactual kinds while keeping its behaviour on valid images, and that for any finite model the error of its answer-or-decline decision, declining on valid input plus answering on invalid input, is bounded below by how well its representation separates valid from invalid evidence. On Qwen2.5-VL-7B under a frozen held-out protocol with two judges, the…

  PDF

  Summarize this
• arXiv stat.MLOct 12

  Online Individualized Treatment Selection under Partial Feedback: False Discovery Control and Minimax Optimality

  Runzhe Gu, Zinan Zhao, Wenguang Sun, Xintao Xia

  We study online individualized treatment selection when only the outcome under the assigned treatment is observed. Our objective is to preferentially treat individuals whose potential outcomes under treatment exceed a covariate-specific control reference, while limiting false discoveries among treated individuals. We propose Partial-Feedback Adaptive Individualized Treatment Selection (PAITS), which initializes learning from historical data and combines sequential estimation of local null risks, randomized exploration, and feedback-driven updates of the treatment selection threshold. Under regularity conditions, we establish asymptotic false discovery rate control and sublinear gap-weighted assignment regret relative to a population oracle. We further establish a minimax lower bound on assignment regret under prescribed uniform nuisance-estimation requirements and give conditions under which PAITS attains the corresponding constrained minimax rate up to logarithmic factors. These results quantify the tradeoff between accurate treatment assignment and nuisance learning under partial feedback. Simulation studies and a real-data analysis using the Jester recommendation dataset…

  PDF

  Summarize this
• arXiv cs.CLOct 12

  The interpreter as developer: An autoethnographic design study of building a computer-assisted interpreting tool through human-LLM co-creation

  Zeming Zhao

  Real-time AI captioning now serves audiences at multilingual events, yet computer-assisted interpreting (CAI) tools are still built for interpreters, rarely by them. This article reports an autoethnographic design study in which a professional interpreter with no programming training built a local-first CAI system through expert-led 'vibe coding', co-creating with an LLM architect and a coding agent. Analysis of the complete development dialogues shows how tacit professional knowledge, from segmentation to booth infrastructure, was externalized into design after generic defaults failed in use. In a demanding public scientific event, three mechanisms of in-booth appropriation emerge under a firmly human-led division of labor; telemetry from a first fully instrumented assignment shows a fully local chain sustaining a median translation latency of 0.94 s across 971 utterances. The case is read as lead-user innovation newly enabled by generative AI, with implications for the technological literacy of interpreters and the future of interpreter training.

  PDF

  Summarize this

• Anomaly detectors20+11.1%
• Optimal power flow100.0%
• Deepfake detection47−4.1%
• Electrocardiogram ecg33−21.4%
• CAD models14−22.2%
• Forecasting time51−22.7%
• Medical image segmentation140−26.7%
• Multimodal525−28.9%