❌

Normal view

Received — 27 May 2026 ⏭

MindAlign: Bridging EEG, Vision, and Language for Zero-Shot Visual Decoding

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zexuan Chen · Sichao Liu · Runhao Lu · Huichao Qi · Alexandra Woolgar · Xi Vincent Wang · Lihui Wang
26 May 2026 at 12:00
arXiv:2605.24523v1 Announce Type: cross Abstract: Visual decoding from brain signals is a key challenge at the intersection of computer vision and neuroscience, requiring methods that bridge neural representations and computational models of vision. We introduce a tri-modal contrastive framework for EEG-based visual decoding that aligns EEG, visual, and textual representations within a unified latent space. Our approach follows a two-stage design. First, we pre-train an EEG encoder via masked reconstruction on unlabeled trials, learning spatio-temporal regularities that transfer robustly to downstream tasks. Second, we jointly align EEG, image, and LLM-generated textual descriptions through contrastive learning, where text supervision acts as a semantic regularizer that injects linguistic structure into the shared space without overwhelming the primary EEG-image signal. The encoder integrates subject-specific adaptation, graph-attention over channels, and temporal-spatial convolutional embeddings. On the Things-EEG2 200-way zero-shot benchmark, our framework achieves 54.1% Top-1 and 83.4% Top-5 accuracy, substantially exceeding the strongest prior baseline (32.4% / 64.0%), with paired Wilcoxon tests confirming significance (p

What Are We Actually Decoding? Source Attribution for Non-Invasive Brain-to-Language Retrieval

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xinyu Zhang · Sichao Liu · Runhao Lu · Alexandra Woolgar · Lihui Wang
26 May 2026 at 12:00
arXiv:2605.24524v1 Announce Type: cross Abstract: In non-invasive neural language decoding, results can be inflated by sources that are not stimulus-evoked neural evidence: decoder priors, embedding-based metrics, and non-neural structural nuisances such as signal duration. The methodological challenge is therefore attribution: a reported gain is more informative when it can be traced to a specific source. We recast stimulus-locked MEG-to-audio retrieval as an auditing framework that separates apparent performance into three sources - structural shortcuts, window-level stimulus-locked evidence, and cross-window contextual aggregation - and provides a diagnostic for each. Signal-blind Gaussian noise reaches 66.3% Rank@1 (R@1) under variable-length decoding but collapses to near chance once fixed-duration windows and stimulus-identity splits are enforced, isolating structural leakage. Under these controls, fixed-window retrieval recovers measurable MEG-audio discriminability, while an oracle sentence-bucket diagnostic shows that 95.7% of Top-1 errors select the wrong sentence, localising the residual bottleneck to sentence-level competition. We audit this contextual source with Group Context Bias (GCB), an inference-time additive logit bias that pools sentence-consistent evidence across windows while leaving the base retrieval scores and candidate pool fixed. Used as a score-space intervention, GCB makes the contextual source measurable: R@1 shifts from 44% to 52% on Gwilliams and from 22% to 29% on MOUS under the same fixed setting. GCB is auditable under this design: its effect collapses under random-grouping perturbations and vanishes when local evidence is attenuated in MEG or is near chance in EEG, supporting its use as a controlled source-attribution intervention. These results suggest that brain-to-language performance should be source-attributed, not merely reported.

Data-driven precision: artificial intelligence redefining immunoradiotherapy in advanced pancreatic cancer

✇(Multiomics OR Omics) AND (Pancreatic)
By: Yao-Wen Liu · Xiao-Ding Men · Bin-Ru Di · Yu-Lin Lei · Li Xiang · Yu-Hao Luo
25 May 2026 at 18:00

Front Pharmacol. 2026 May 8;17:1804673. doi: 10.3389/fphar.2026.1804673. eCollection 2026.

ABSTRACT

Advanced pancreatic ductal adenocarcinoma (PDAC) remains among the most formidable challenges in oncology, driven by a profoundly immunosuppressive tumor microenvironment (TME) and pervasive resistance to systemic and local therapies. Although immune checkpoint inhibitors (ICIs) can synergize with radiotherapy (RT) in several malignancies, the clinical benefit of immunoradiotherapy (iRT) in PDAC has been modest, highlighting the limitations of population-averaged paradigms that fail to capture extensive inter- and intratumoral heterogeneity. Here, we synthesize an artificial intelligence (AI)-enabled framework to refine both the biological rationale and clinical implementation of iRT for advanced PDAC through integrative analysis of multimodal data (clinical variables, imaging, RT dose distributions, and multi-omics). We highlight advances in three domains. First, AI-based deconvolution of TME heterogeneity can delineate clinically relevant molecular subtypes and spatial immune architectures that may be therapeutically tractable. Second, AI-driven modeling can optimize spatiotemporal RT-immunotherapy interactions, informing individualized dose, fractionation, and biologically guided target definition. Third, AI-supported predictive modeling and adaptive feedback can enable response-guided treatment adjustment beyond static planning. We also discuss unresolved clinical questions and key translational barriers, including data scarcity, lack of standardization, and limited interpretability. Finally, we outline priorities for translation-prospective digital biobanks, hybrid mechanistic-data-driven modeling, and adaptive trial designs-to enable rigorous validation and clinical deployment. Collectively, these developments position AI as a catalyst to move iRT for PDAC from empiricism toward real-time, individualized precision medicine.

PMID:42181887 | PMC:PMC13194001 | DOI:10.3389/fphar.2026.1804673

Received — 8 April 2026 ⏭

Affording Process Auditability with QualAnalyzer: An Atomistic LLM Analysis Tool for Qualitative Research

✇cs.AI, q-bio.NC updates on arXiv.org
By: Max Hao Lu · Ryan Ellegood · Rony Rodriguez-Ramirez · Sophia Blumert
7 April 2026 at 12:00
arXiv:2604.03820v1 Announce Type: new Abstract: Large language models are increasingly used for qualitative data analysis, but many workflows obscure how analytic conclusions are produced. We present QualAnalyzer, an open-source Chrome extension for Google Workspace that supports atomistic LLM analysis by processing each data segment independently and preserving the prompt, input, and output for every unit. Through two case studies -- holistic essay scoring and deductive thematic coding of interview transcripts -- we show that this approach creates a legible audit trail and helps researchers investigate systematic differences between LLM and human judgments. We argue that process auditability is essential for making LLM-assisted qualitative research more transparent and methodologically robust.
Received — 4 April 2026 ⏭

ReFlow: Self-correction Motion Learning for Dynamic Scene Reconstruction

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yanzhe Liang · Ruijie Zhu · Hanzhi Chang · Zhuoyuan Li · Jiahao Lu · Tianzhu Zhang
3 April 2026 at 12:00
arXiv:2604.01561v1 Announce Type: cross Abstract: We present ReFlow, a unified framework for monocular dynamic scene reconstruction that learns 3D motion in a novel self-correction manner from raw video. Existing methods often suffer from incomplete scene initialization for dynamic regions, leading to unstable reconstruction and motion estimation, which often resorts to external dense motion guidance such as pre-computed optical flow to further stabilize and constrain the reconstruction of dynamic components. However, this introduces additional complexity and potential error propagation. To address these issues, ReFlow integrates a Complete Canonical Space Construction module for enhanced initialization of both static and dynamic regions, and a Separation-Based Dynamic Scene Modeling module that decouples static and dynamic components for targeted motion supervision. The core of ReFlow is a novel self-correction flow matching mechanism, consisting of Full Flow Matching to align 3D scene flow with time-varying 2D observations, and Camera Flow Matching to enforce multi-view consistency for static objects. Together, these modules enable robust and accurate dynamic scene reconstruction. Extensive experiments across diverse scenarios demonstrate that ReFlow achieves superior reconstruction quality and robustness, establishing a novel self-correction paradigm for monocular 4D reconstruction.
Received — 2 April 2026 ⏭

TSHA: A Benchmark for Visual Language Models in Trustworthy Safety Hazard Assessment Scenarios

✇cs.AI, q-bio.NC updates on arXiv.org
By: Qiucheng Yu · Ruijie Xu · Mingang Chen · Xuequan Lu · Jianfeng Dong · Chaochao Lu · Xin Tan
1 April 2026 at 12:00
arXiv:2603.29759v1 Announce Type: cross Abstract: Recent advances in vision-language models (VLMs) have accelerated their application to indoor safety hazards assessment. However, existing benchmarks suffer from three fundamental limitations: (1) heavy reliance on synthetic datasets constructed via simulation software, creating a significant domain gap with real-world environments; (2) oversimplified safety tasks with artificial constraints on hazard and scene types, thereby limiting model generalization; and (3) absence of rigorous evaluation protocols to thoroughly assess model capabilities in complex home safety scenarios. To address these challenges, we introduce TSHA (\textbf{T}rustworthy \textbf{S}afety \textbf{H}azards \textbf{A}ssessment), a comprehensive benchmark comprising 81,809 carefully curated training samples drawn from four complementary sources: existing indoor datasets, internet images, AIGC images, and newly captured images. This benchmark set also includes a highly challenging test set with 1707 samples, comprising not only a carefully selected subset from the training distribution but also newly added videos and panoramic images containing multiple safety hazards, used to evaluate the model's robustness in complex safety scenarios. Extensive experiments on 23 popular VLMs demonstrate that current VLMs lack robust capabilities for safety hazard assessment. Importantly, models trained on the TSHA training set not only achieve a significant performance improvement of up to +18.3 points on the TSHA test set but also exhibit enhanced generalizability across other benchmarks, underscoring the substantial contribution and importance of the TSHA benchmark.

Let the Agent Steer: Closed-Loop Ranking Optimization via Influence Exchange

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yin Cheng · Liao Zhou · Xiyu Liang · Dihao Luo · Tewei Lee · Kailun Zheng · Weiwei Zhang · Mingchen Cai · Jian Dong · Andy Zhang
1 April 2026 at 12:00
arXiv:2603.27765v2 Announce Type: replace Abstract: Recommendation ranking is fundamentally an influence allocation problem: a sorting formula distributes ranking influence among competing factors, and the business outcome depends on finding the optimal "exchange rates" among them. However, offline proxy metrics systematically misjudge how influence reallocation translates to online impact, with asymmetric bias across metrics that a single calibration factor cannot correct. We present Sortify, the first fully autonomous LLM-driven ranking optimization agent deployed in a large-scale production recommendation system. The agent reframes ranking optimization as continuous influence exchange, closing the full loop from diagnosis to parameter deployment without human intervention. It addresses structural problems through three mechanisms: (1) a dual-channel framework grounded in Savage's Subjective Expected Utility (SEU) that decouples offline-online transfer correction (Belief channel) from constraint penalty adjustment (Preference channel); (2) an LLM meta-controller operating on framework-level parameters rather than low-level search variables; (3) a persistent Memory DB with 7 relational tables for cross-round learning. Its core metric, Influence Share, provides a decomposable measure where all factor contributions sum to exactly 100%. Sortify has been deployed across two markets. In Country A, the agent pushed GMV from -3.6% to +9.2% within 7 rounds with peak orders reaching +12.5%. In Country B, a cold-start deployment achieved +4.15% GMV/UU and +3.58% Ads Revenue in a 7-day A/B test, leading to full production rollout.
Received — 26 March 2026 ⏭

EVA: Efficient Reinforcement Learning for End-to-End Video Agent

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yaolun Zhang · Ruohui Wang · Jiahao Wang · Yepeng Tang · Xuanyu Zheng · Haonan Duan · Hao Lu · Hanming Deng · Lewei Lu
25 March 2026 at 12:00
arXiv:2603.22918v1 Announce Type: cross Abstract: Video understanding with multimodal large language models (MLLMs) remains challenging due to the long token sequences of videos, which contain extensive temporal dependencies and redundant frames. Existing approaches typically treat MLLMs as passive recognizers, processing entire videos or uniformly sampled frames without adaptive reasoning. Recent agent-based methods introduce external tools, yet still depend on manually designed workflows and perception-first strategies, resulting in inefficiency on long videos. We present EVA, an Efficient Reinforcement Learning framework for End-to-End Video Agent, which enables planning-before-perception through iterative summary-plan-action-reflection reasoning. EVA autonomously decides what to watch, when to watch, and how to watch, achieving query-driven and efficient video understanding. To train such agents, we design a simple yet effective three-stage learning pipeline - comprising supervised fine-tuning (SFT), Kahneman-Tversky Optimization (KTO), and Generalized Reward Policy Optimization (GRPO) - that bridges supervised imitation and reinforcement learning. We further construct high-quality datasets for each stage, supporting stable and reproducible training. We evaluate EVA on six video understanding benchmarks, demonstrating its comprehensive capabilities. Compared with existing baselines, EVA achieves a substantial improvement of 6-12% over general MLLM baselines and a further 1-3% gain over prior adaptive agent methods. Our code and model are available at https://github.com/wangruohui/EfficientVideoAgent.
Received — 17 March 2026 ⏭

Motion Dreamer: Boundary Conditional Motion Reasoning for Physically Coherent Video Generation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Tianshuo Xu · Zhifei Chen · Leyi Wu · Hao Lu · Yuying Chen · Lihui Jiang · Bingbing Liu · Yingcong Chen
16 March 2026 at 12:00
arXiv:2412.00547v4 Announce Type: replace-cross Abstract: Recent advances in video generation have shown promise for generating future scenarios, critical for planning and control in autonomous driving and embodied intelligence. However, real-world applications demand more than visually plausible predictions; they require reasoning about object motions based on explicitly defined boundary conditions, such as initial scene image and partial object motion. We term this capability Boundary Conditional Motion Reasoning. Current approaches either neglect explicit user-defined motion constraints, producing physically inconsistent motions, or conversely demand complete motion inputs, which are rarely available in practice. Here we introduce Motion Dreamer, a two-stage framework that explicitly separates motion reasoning from visual synthesis, addressing these limitations. Our approach introduces instance flow, a sparse-to-dense motion representation enabling effective integration of partial user-defined motions, and the motion inpainting strategy to robustly enable reasoning motions of other objects. Extensive experiments demonstrate that Motion Dreamer significantly outperforms existing methods, achieving superior motion plausibility and visual realism, thus bridging the gap towards practical boundary conditional motion reasoning. Our webpage is available: https://envision-research.github.io/MotionDreamer/.
Received — 5 March 2026 ⏭

Dynamic Adversarial Reinforcement Learning for Robust Multimodal Large Language Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yicheng Bao · Xuhong Wang · Qiaosheng Zhang · Chaochao Lu · Xia Hu · Xin Tan
5 March 2026 at 13:00
arXiv:2602.22227v3 Announce Type: replace-cross Abstract: Despite their impressive capabilities, Multimodal Large Language Models (MLLMs) exhibit perceptual fragility when confronted with visually complex scenes. This weakness stems from a reliance on finite training datasets, which are prohibitively expensive to scale and impose a ceiling on model robustness. We introduce \textbf{AOT-SFT}, a large-scale adversarial dataset for bootstrapping MLLM robustness. Building on this, we propose \textbf{AOT (Adversarial Opponent Training)}, a self-play framework that forges MLLM robustness by creating its own training data. Our method orchestrates a co-evolution between an image-editing Attacker and a Defender MLLM, where the Attacker generates a diverse and dynamic curriculum of image manipulations, forcing the Defender to adapt and improve. Extensive experiments demonstrate that AOT enhances the Defender's perceptual robustness and reduces hallucinations, establishing a scalable paradigm for training more reliable MLLMs.
Received — 25 February 2026 ⏭

Buy versus Build an LLM: A Decision Framework for Governments

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jiahao Lu · Ziwei Xu · William Tjhi · Junnan Li · Antoine Bosselut · Pang Wei Koh · Mohan Kankanhalli
24 February 2026 at 13:00
arXiv:2602.13033v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) represent a new frontier of digital infrastructure that can support a wide range of public-sector applications, from general purpose citizen services to specialized and sensitive state functions. When expanding AI access, governments face a set of strategic choices over whether to buy existing services, build domestic capabilities, or adopt hybrid approaches across different domains and use cases. These are critical decisions especially when leading model providers are often foreign corporations, and LLM outputs are increasingly treated as trusted inputs to public decision-making and public discourse. In practice, these decisions are not intended to mandate a single approach across all domains; instead, national AI strategies are typically pluralistic, with sovereign, commercial and open-source models coexisting to serve different purposes. Governments may rely on commercial models for non-sensitive or commodity tasks, while pursuing greater control for critical, high-risk or strategically important applications. This paper provides a strategic framework for making this decision by evaluating these options across dimensions including sovereignty, safety, cost, resource capability, cultural fit, and sustainability. Importantly, "building" does not imply that governments must act alone: domestic capabilities may be developed through public research institutions, universities, state-owned enterprises, joint ventures, or broader national ecosystems. By detailing the technical requirements and practical challenges of each pathway, this work aims to serve as a reference for policy-makers to determine whether a buy or build approach best aligns with their specific national needs and societal goals.
Received — 17 February 2026 ⏭

TabTracer: Monte Carlo Tree Search for Complex Table Reasoning with Large Language Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhizhao Luo · Zhaojing Luo · Meihui Zhang · Rui Mao
17 February 2026 at 13:00
arXiv:2602.14089v1 Announce Type: cross Abstract: Large language models (LLMs) have emerged as powerful tools for natural language table reasoning, where there are two main categories of methods. Prompt-based approaches rely on language-only inference or one-pass program generation without step-level verification. Agent-based approaches use tools in a closed loop, but verification is often local and backtracking is limited, allowing errors to propagate and increasing cost. Moreover, they rely on chain- or beam-style trajectories that are typically combinatorially redundant, leading to high token costs. In this paper, we propose TabTracer, an agentic framework that coordinates multi-step tool calls over intermediate table states, with explicit state tracking for verification and rollback. First, it enforces step-level verification with typed operations and lightweight numeric and format checks to provide reliable rewards and suppress hallucinations. Second, execution-feedback Monte Carlo Tree Search maintains a search tree of candidate table states and uses backpropagated reflection scores to guide UCB1 selection and rollback via versioned snapshots. Third, it reduces redundancy with budget-aware pruning, deduplication, and state hashing with a monotonicity gate to cut token cost. Comprehensive evaluation on TabFact, WikiTQ, and CRT datasets shows that TabTracer outperforms state-of-the-art baselines by up to 6.7% in accuracy while reducing token consumption by 59--84%.
There are no more articles
❌