❌

Normal view

Received — 4 April 2026 ⏭

ProCeedRL: Process Critic with Exploratory Demonstration Reinforcement Learning for LLM Agentic Reasoning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jingyue Gao · Yanjiang Guo · Xiaoshuai Chen · Jianyu Chen
3 April 2026 at 12:00
arXiv:2604.02006v1 Announce Type: new Abstract: Reinforcement Learning (RL) significantly enhances the reasoning abilities of large language models (LLMs), yet applying it to multi-turn agentic tasks remains challenging due to the long-horizon nature of interactions and the stochasticity of environmental feedback. We identify a structural failure mode in agentic exploration: suboptimal actions elicit noisy observations into misleading contexts, which further weaken subsequent decision-making, making recovery increasingly difficult. This cumulative feedback loop of errors renders standard exploration strategies ineffective and susceptible to the model's reasoning and the environment's randomness. To mitigate this issue, we propose ProCeedRL: Process Critic with Explorative Demonstration RL, shifting exploration from passive selection to active intervention. ProCeedRL employs a process-level critic to monitor interactions in real time, incorporating reflection-based demonstrations to guide agents in stopping the accumulation of errors. We find that this approach significantly exceeds the model's saturated exploration performance, demonstrating substantial exploratory benefits. By learning from exploratory demonstrations and on-policy samples, ProCeedRL significantly improves exploration efficiency and achieves superior performance on complex deep search and embodied tasks.

Bias Is a Subspace, Not a Coordinate: A Geometric Rethinking of Post-hoc Debiasing in Vision-Language Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Dachuan Zhao · Weiyue Li · Zhenda Shen · Yushu Qiu · Bowen Xu · Haoyu Chen · Yongchao Chen
3 April 2026 at 12:00
arXiv:2511.18123v2 Announce Type: replace-cross Abstract: Vision-Language Models (VLMs) have become indispensable for multimodal reasoning, yet their representations often encode and amplify demographic biases, resulting in biased associations and misaligned predictions in downstream tasks. Such behavior undermines fairness and distorts the intended alignment between vision and language. Recent post-hoc approaches attempt to mitigate bias by replacing the most attribute-correlated embedding coordinates with neutral values. However, our systematic analysis reveals three critical limitations of this coordinate-wise approach: feature entanglement, poor cross-dataset generalization, and incomplete bias removal. We find that bias is not localized to a few coordinates but is instead distributed across a few linear subspaces. To address these limitations, we propose $\textbf{S}$ubspace $\textbf{P}$rojection $\textbf{D}$ebiasing ($\textbf{SPD}$), a geometrically principled framework that identifies and removes the entire subspace of linearly decodable bias while reinserting a neutral mean component to preserve semantic fidelity. Extensive experiments across zero-shot classification, text-to-image retrieval, and image generation validate the effectiveness of SPD: our method achieves more robust debiasing with an average improvement of $18.5\%$ across four fairness metrics, while maintaining minimal loss in task performance compared to the best debiasing baseline.

Accuracy of Radiomics-Based Machine Learning for Predicting Risk of Recurrence in Non–Small Cell Lung Cancer: Systematic Review and Meta-Analysis

✇Journal of Medical Internet Research
By: Junpei Wu · Ye Zhang · Jiaye Wang · Chengshui Chen · Shiyu Hu · Wenyu Chen
3 April 2026 at 03:15
Background: During the diagnosis and treatment of non–small cell lung cancer (NSCLC), detecting the risk of its recurrence in an early phase is still challenging. Recent studies have investigated the radiomics-based machine learning (ML) models for detecting the risk of recurrence in NSCLC. However, there is still insufficient systematic evidence to prove its efficiency. Objective: This study is designed to systematically evaluate the effectiveness of radiomics-based ML in predicting the risk of recurrence in NSCLC, aiming to provide evidence-based support for the subsequent development of scoring tools to forecast recurrence risk. Methods: For acquiring research on radiomics-based models for forecasting the risk of recurrence in NSCLC, Cochrane Library, Web of Science, PubMed, and Embase were systematically retrieved, up to October 24, 2025. Studies on analyzing the recurrence of NSCLC using radiomics-based ML were included, while those in which only texture analysis was conducted or radiomics-based ML was not constructed were excluded. The Radiomics Quality Score (RQS) was used to appraise the eligible studies. Subgroup analyses were conducted according to the variables of the model, the background of treatment, the stage of lung cancer, and the pathological type. Results: Ultimately, 30 eligible studies in total were included, covering 7964 patients with NSCLC. According to the meta-analysis, the c-index of radiomics-based ML models for forecasting the risk of recurrence in NSCLC was 0.850 (95% CI 0.834‐0.866, 95% prediction interval [PI] 0.623‐1.004) in the training set. Specifically, the pooled c-index was 0.876 (95% CI 0.853‐0.900) among the patients receiving the stereotactic body radiation therapy and 0.825 (95% CI 0.804‐0.848) among those who received surgeries combined with other adjuvant treatment regimens. The c-index of the radiomics-based ML models combined with clinical features for forecasting the risk of recurrence in NSCLC was 0.833 (95% CI 0.822‐0.854, 95% PI 0.717‐0.945) in the training set. In contrast, the c-index of radiomics-based ML models for forecasting the risk of recurrence in NSCLC was 0.878 (95% CI 0.854‐0.902, 95% PI 0.681‐1.000) in the validation set. The c-index of radiomics-based ML models combined with clinical features for forecasting the risk of recurrence in NSCLC was 0.854 (95% CI 0.830‐0.878, 95% PI 0.655‐0.992) in the validation set. The average RQS across the included studies was 27.4%, revealing methodological limitations and an absence of standardization. Conclusions: This study is the first to confirm that radiomics-based ML models effectively predict the risk of recurrence in NSCLC. This study provides evidence-based support for the subsequent development or updating of radiomics-based ML models. However, the current methodological application of radiomics remains concerning. Therefore, in the future, research should standardize the workflow for implementing radiomics-based ML and incorporate multicenter imaging data to enhance its generalizability. Trial Registration: PROSPERO CRD42025631191; https://www.crd.york.ac.uk/PROSPERO/view/CRD42025631191
Received — 2 April 2026 ⏭

Trace2Skill: Distill Trajectory-Local Lessons into Transferable Agent Skills

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jingwei Ni · Yihao Liu · Xinpeng Liu · Yutao Sun · Mengyu Zhou · Pengyu Cheng · Dexin Wang · Erchao Zhao · Xiaoxi Jiang · Guanjun Jiang
1 April 2026 at 12:00
arXiv:2603.25158v3 Announce Type: replace Abstract: Equipping Large Language Model (LLM) agents with domain-specific skills is critical for tackling complex tasks. Yet, manual authoring creates a severe scalability bottleneck. Conversely, automated skill generation often yields fragile or fragmented results because it either relies on shallow parametric knowledge or sequentially overfits to non-generalizable trajectory-local lessons. To overcome this, we introduce Trace2Skill, a framework that mirrors how human experts author skills: by holistically analyzing broad execution experience before distilling it into a single, comprehensive guide. Instead of reacting sequentially to individual trajectories, Trace2Skill dispatches a parallel fleet of sub-agents to analyze a diverse pool of executions. It extracts trajectory-specific lessons and hierarchically consolidates them into a unified, conflict-free skill directory via inductive reasoning. Trace2Skill supports both deepening existing human-written skills and creating new ones from scratch. Experiments in challenging domains, such as spreadsheet, VisionQA and math reasoning, show that Trace2Skill significantly improves upon strong baselines, including Anthropic's official xlsx skills. Crucially, this trajectory-grounded evolution does not merely memorize task instances or model-specific quirks: evolved skills transfer across LLM scales and generalize to OOD settings. For example, skills evolved by Qwen3.5-35B on its own trajectories improved a Qwen3.5-122B agent by up to 57.65 absolute percentage points on WikiTableQuestions. Ultimately, our results demonstrate that complex agent experience can be packaged into highly transferable, declarative skills -- requiring no parameter updates, no external retrieval modules, and utilizing open-source models as small as 35B parameters.

InfiniteVL: Synergizing Linear and Sparse Attention for Highly-Efficient, Unlimited-Input Vision-Language Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Hongyuan Tao · Bencheng Liao · Shaoyu Chen · Haoran Yin · Qian Zhang · Wenyu Liu · Xinggang Wang
1 April 2026 at 12:00
arXiv:2512.08829v2 Announce Type: replace-cross Abstract: Vision-Language Models (VLMs) are increasingly tasked with ultra-long multimodal understanding. While linear architectures offer constant computation and memory footprints, they often struggle with high-frequency visual perception compared to standard Transformers. To bridge this gap, we introduce \textbf{InfiniteVL}. We first develop a hybrid base model called \textbf{InfiniteVL-Base} that interleaves a small fraction of Full Attention layers with Gated DeltaNet. Empowered by a tailored distillation and fine-tuning strategy, InfiniteVL-Base matches the fundamental multimodal performance of equivalent Transformers while achieving a \textbf{1.7$\times$} decoding speedup. However, the quadratic complexity of the retained Full Attention inevitably becomes an efficiency bottleneck when scaling to ultra long context. To break this barrier, we propose a novel Long-Sequence Architectural Fine-Tuning strategy that seamlessly transforms the dense attention into vision-specific sparse mechanisms. This yields two specialized variants: \textbf{InfiniteVL-Offline} for offline retrieval and \textbf{InfiniteVL-Online} for online streaming. By eliminating the computation explosion of global attention without sacrificing high-frequency visual recall, InfiniteVL-Offline achieves Transformer-level length generalization with a \textbf{5x} prefill acceleration at 256K context. Concurrently, InfiniteVL-Online delivers robust streaming perception with a constant memory footprint and a real-time throughput of \textbf{25} FPS. Code and models are available at https://github.com/hustvl/InfiniteVL.
Received — 26 March 2026 ⏭

From Static Templates to Dynamic Runtime Graphs: A Survey of Workflow Optimization for LLM Agents

✇cs.AI, q-bio.NC updates on arXiv.org
By: Ling Yue · Kushal Raj Bhandari · Ching-Yun Ko · Dhaval Patel · Shuxin Lin · Nianjun Zhou · Jianxi Gao · Pin-Yu Chen · Shaowu Pan
25 March 2026 at 12:00
arXiv:2603.22386v1 Announce Type: new Abstract: Large language model (LLM)-based systems are becoming increasingly popular for solving tasks by constructing executable workflows that interleave LLM calls, information retrieval, tool use, code execution, memory updates, and verification. This survey reviews recent methods for designing and optimizing such workflows, which we treat as agentic computation graphs (ACGs). We organize the literature based on when workflow structure is determined, where structure refers to which components or agents are present, how they depend on each other, and how information flows between them. This lens distinguishes static methods, which fix a reusable workflow scaffold before deployment, from dynamic methods, which select, generate, or revise the workflow for a particular run before or during execution. We further organize prior work along three dimensions: when structure is determined, what part of the workflow is optimized, and which evaluation signals guide optimization (e.g., task metrics, verifier signals, preferences, or trace-derived feedback). We also distinguish reusable workflow templates, run-specific realized graphs, and execution traces, separating reusable design choices from the structures actually deployed in a given run and from realized runtime behavior. Finally, we outline a structure-aware evaluation perspective that complements downstream task metrics with graph-level properties, execution cost, robustness, and structural variation across inputs. Our goal is to provide a clear vocabulary, a unified framework for positioning new methods, a more comparable view of existing body of literature, and a more reproducible evaluation standard for future work in workflow optimizations for LLM agents.

Symbolic Graph Networks for Robust PDE Discovery from Noisy Sparse Data

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xingyu Chen · Junxiu An · Jun Guo · Yuqian Zhou
25 March 2026 at 12:00
arXiv:2603.22380v1 Announce Type: cross Abstract: Data-driven discovery of partial differential equations (PDEs) offers a promising paradigm for uncovering governing physical laws from observational data. However, in practical scenarios, measurements are often contaminated by noise and limited by sparse sampling, which poses significant challenges to existing approaches based on numerical differentiation or integral formulations. In this work, we propose a Symbolic Graph Network (SGN) framework for PDE discovery under noisy and sparse conditions. Instead of relying on local differential approximations, SGN leverages graph message passing to model spatial interactions, providing a non-local representation that is less sensitive to high frequency noise. Based on this representation, the learned latent features are further processed by a symbolic regression module to extract interpretable mathematical expressions. We evaluate the proposed method on several benchmark systems, including the wave equation, convection-diffusion equation, and incompressible Navier-Stokes equations. Experimental results show that SGN can recover meaningful governing relations or solution forms under varying noise levels, and demonstrates improved robustness compared to baseline methods in sparse and noisy settings. These results suggest that combining graph-based representations with symbolic regression provides a viable direction for robust data-driven discovery of physical laws from imperfect observations. The code is available at https://github.com/CXY0112/SGN

Not All Tokens Are Created Equal: Query-Efficient Jailbreak Fuzzing for LLMs

✇cs.AI, q-bio.NC updates on arXiv.org
By: Wenyu Chen · Xiangtao Meng · Chuanchao Zang · Li Wang · Xinyu Gao · Jianing Wang · Peng Zhan · Zheng Li · Shanqing Guo
25 March 2026 at 12:00
arXiv:2603.23269v1 Announce Type: cross Abstract: Large Language Models(LLMs) are widely deployed, yet are vulnerable to jailbreak prompts that elicit policy-violating outputs. Although prior studies have uncovered these risks, they typically treat all tokens as equally important during prompt mutation, overlooking the varying contributions of individual tokens to triggering model refusals. Consequently, these attacks introduce substantial redundant searching under query-constrained scenarios, reducing attack efficiency and hindering comprehensive vulnerability assessment. In this work, we conduct a token-level analysis of refusal behavior and observe that token contributions are highly skewed rather than uniform. Moreover, we find strong cross-model consistency in refusal tendencies, enabling the use of a surrogate model to estimate token-level contributions to the target model's refusals. Motivated by these findings, we propose TriageFuzz, a token-aware jailbreak fuzzing framework that adapts the fuzz testing approach with a series of customized designs. TriageFuzz leverages a surrogate model to estimate the contribution of individual tokens to refusal behaviors, enabling the identification of sensitive regions within the prompt. Furthermore, it incorporates a refusal-guided evolutionary strategy that adaptively weights candidate prompts with a lightweight scorer to steer the evolution toward bypassing safety constraints. Extensive experiments on six open-source LLMs and three commercial APIs demonstrate that TriageFuzz achieves comparable attack success rates (ASR) with significantly reduced query costs. Notably, it attains a 90% ASR with over 70% fewer queries compared to baselines. Even under an extremely restrictive budget of 25 queries, TriageFuzz outperforms existing methods, improving ASR by 20-40%.

Behavioral Consistency Validation for LLM Agents: An Analysis of Trading-Style Switching through Stock-Market Simulation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zeping Li · Guancheng Wan · Keyang Chen · Yu Chen · Yiwen Zhao · Philip Torr · Guangnan Ye · Zhenfei Yin · Hongfeng Chai
25 March 2026 at 12:00
arXiv:2602.07023v2 Announce Type: replace-cross Abstract: Recent works have increasingly applied Large Language Models (LLMs) as agents in financial stock market simulations to test if micro-level behaviors aggregate into macro-level phenomena. However, a crucial question arises: Do LLM agents' behaviors align with real market participants? This alignment is key to the validity of simulation results. To explore this, we select a financial stock market scenario to test behavioral consistency. Investors are typically classified as fundamental or technical traders, but most simulations fix strategies at initialization, failing to reflect real-world trading dynamics. In this work, we assess whether agents' strategy switching aligns with financial theory, providing a framework for this evaluation. We operationalize four behavioral-finance drivers-loss aversion, herding, wealth differentiation, and price misalignment-as personality traits set via prompting and stored long-term. In year-long simulations, agents process daily price-volume data, trade under a designated style, and reassess their strategy every 10 trading days. We introduce four alignment metrics and use Mann-Whitney U tests to compare agents' style-switching behavior with financial theory. Our results show that recent LLMs' switching behavior is only partially consistent with behavioral-finance theories, highlighting the need for further refinement in aligning agent behavior with financial theory.

Boosting foundation models for rare eye disease diagnosis via a multimodal text-to-image generative framework

✇npj Digital Medicine
By: Ruoyu Chen · Weiyi Zhang · Bowen Liu · Xinyuan Wu · Xiaolan Chen · Pusheng Xu · Shunming Liu · Mingguang He · Danli Shi
24 March 2026 at 08:00

npj Digital Medicine, Published online: 24 March 2026; doi:10.1038/s41746-026-02560-2

Boosting foundation models for rare eye disease diagnosis via a multimodal text-to-image generative framework

Unannotated noncoding transcripts as a source of intratumor heterogeneity in malignant cell states

✇(Multiomics OR Omics) AND (Lung OR gastric OR Hepatocellular)
By: Xiaolan Zhou · Limin Lin · Yu Chen · Guangrui Yang · Ting Ni · Zhaozhao Zhao
23 March 2026 at 18:00

Sci China Life Sci. 2026 Mar 16. doi: 10.1007/s11427-025-3273-6. Online ahead of print.

ABSTRACT

Phenotypic diversity of malignant cells within a tumor underlies intratumor heterogeneity (ITH), a key determinant of cancer metastasis and treatment failure. However, the molecular mechanisms driving this heterogeneity are poorly understood. Here, we curated and analyzed a cohort of 3' tag-based single-cell RNA-seq covering 12 common cancer types. We identified thousands of poly(A) site (PAS) peaks representing the 3' ends of previously unannotated transcripts, whose expression is widely associated with diverse malignant cellular states. By integrating multi-omics data, we characterized the expression patterns and epigenetic landscape of these unannotated PAS peak-associated transcripts (UPTs). The expression heterogeneity of UPTs was supported by multi-region sampling bulk RNA-seq data and recapitulated within cancer cell lines. As proof of principle validation, functional experiments confirmed that two noncoding UPTs promoted the proliferation and migration of lung cancer cells. Our results suggest that epigenetic activation of unannotated noncoding transcripts might represent a previously unrecognized mechanism contributing to transcriptomic ITH.

PMID:41870780 | DOI:10.1007/s11427-025-3273-6

Unannotated noncoding transcripts as a source of intratumor heterogeneity in malignant cell states

✇Omics In Lung
By: Xiaolan Zhou · Limin Lin · Yu Chen · Guangrui Yang · Ting Ni · Zhaozhao Zhao
23 March 2026 at 18:00

Sci China Life Sci. 2026 Mar 16. doi: 10.1007/s11427-025-3273-6. Online ahead of print.

ABSTRACT

Phenotypic diversity of malignant cells within a tumor underlies intratumor heterogeneity (ITH), a key determinant of cancer metastasis and treatment failure. However, the molecular mechanisms driving this heterogeneity are poorly understood. Here, we curated and analyzed a cohort of 3' tag-based single-cell RNA-seq covering 12 common cancer types. We identified thousands of poly(A) site (PAS) peaks representing the 3' ends of previously unannotated transcripts, whose expression is widely associated with diverse malignant cellular states. By integrating multi-omics data, we characterized the expression patterns and epigenetic landscape of these unannotated PAS peak-associated transcripts (UPTs). The expression heterogeneity of UPTs was supported by multi-region sampling bulk RNA-seq data and recapitulated within cancer cell lines. As proof of principle validation, functional experiments confirmed that two noncoding UPTs promoted the proliferation and migration of lung cancer cells. Our results suggest that epigenetic activation of unannotated noncoding transcripts might represent a previously unrecognized mechanism contributing to transcriptomic ITH.

PMID:41870780 | DOI:10.1007/s11427-025-3273-6

Received — 17 March 2026 ⏭

LR-SGS: Robust LiDAR-Reflectance-Guided Salient Gaussian Splatting for Self-Driving Scene Reconstruction

✇cs.AI, q-bio.NC updates on arXiv.org
By: Ziyu Chen · Fan Zhu · Hui Zhu · Deyi Kong · Xinkai Kuang · Yujia Zhang · Chunmao Jiang
16 March 2026 at 12:00
arXiv:2603.12647v1 Announce Type: cross Abstract: Recent 3D Gaussian Splatting (3DGS) methods have demonstrated the feasibility of self-driving scene reconstruction and novel view synthesis. However, most existing methods either rely solely on cameras or use LiDAR only for Gaussian initialization or depth supervision, while the rich scene information contained in point clouds, such as reflectance, and the complementarity between LiDAR and RGB have not been fully exploited, leading to degradation in challenging self-driving scenes, such as those with high ego-motion and complex lighting. To address these issues, we propose a robust and efficient LiDAR-reflectance-guided Salient Gaussian Splatting method (LR-SGS) for self-driving scenes, which introduces a structure-aware Salient Gaussian representation, initialized from geometric and reflectance feature points extracted from LiDAR and refined through a salient transform and improved density control to capture edge and planar structures. Furthermore, we calibrate LiDAR intensity into reflectance and attach it to each Gaussian as a lighting-invariant material channel, jointly aligned with RGB to enforce boundary consistency. Extensive experiments on the Waymo Open Dataset demonstrate that LR-SGS achieves superior reconstruction performance with fewer Gaussians and shorter training time. In particular, on Complex Lighting scenes, our method surpasses OmniRe by 1.18 dB PSNR.

FAPE-IR: Frequency-Aware Planning and Execution Framework for All-in-One Image Restoration

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jingren Liu · Shuning Xu · Qirui Yang · Yun Wang · Xiangyu Chen · Zhong Ji
16 March 2026 at 12:00
arXiv:2511.14099v3 Announce Type: replace-cross Abstract: All-in-One Image Restoration (AIO-IR) aims to develop a unified model that can handle multiple degradations under complex conditions. However, existing methods often rely on task-specific designs or latent routing strategies, making it hard to adapt to real-world scenarios with various degradations. We propose FAPE-IR, a Frequency-Aware Planning and Execution framework for image restoration. It uses a frozen Multimodal Large Language Model (MLLM) as a planner to analyze degraded images and generate concise, frequency-aware restoration plans. These plans guide a LoRA-based Mixture-of-Experts (LoRA-MoE) module within a diffusion-based executor, which dynamically selects high- or low-frequency experts, complemented by frequency features of the input image. To further improve restoration quality and reduce artifacts, we introduce adversarial training and a frequency regularization loss. By coupling semantic planning with frequency-based restoration, FAPE-IR offers a unified and interpretable solution for all-in-one image restoration. Extensive experiments show that FAPE-IR achieves state-of-the-art performance across seven restoration tasks and exhibits strong zero-shot generalization under mixed degradations.

Multimodal Continual Learning with MLLMs from Multi-scenario Perspectives

✇cs.AI, q-bio.NC updates on arXiv.org
By: Kai Jiang · Siqi Huang · Xiangyu Chen · Jiawei Shao · Hongyuan Zhang · Ping Luo · Xuelong Li
16 March 2026 at 12:00
arXiv:2511.18507v3 Announce Type: replace-cross Abstract: Multimodal large language models (MLLMs) deployed on devices must adapt to continuously changing visual scenarios such as variations in background and perspective, to effectively perform complex visual tasks. To investigate catastrophic forgetting under real-world scenario shifts, we construct a multimodal visual understanding dataset (MSVQA), covering four distinct scenarios and perspectives: high-altitude, underwater, low-altitude, and indoor environments. Furthermore, we propose UNIFIER (mUltimodal coNtInual learning with MLLMs From multi-scenarIo pERspectives), a continual learning (CL) framework designed to address visual discrepancies while learning different scenarios. Compared to existing CL methods, UNIFIER enables knowledge accumulation within the same scenario and mutual enhancement across different scenarios via Vision Representation Expansion (VRE) and Vision Consistency Constraint (VCC). Experimental results show that UNIFIER improves the last-step VQA scores by 2.70%~10.62% and the last-step F1 scores by 3.40%~7.69% compared to the state-of-the-art method, QUAD, in 20-step cross-scenario continual learning tasks. MSVQA dataset is available at https://huggingface.co/datasets/Kaij00/MSVQA.
Received — 14 March 2026 ⏭

Targeting the OXNAD1-PTGS2 axis with resveratrol overcomes ferroptosis Inhibition and reverses 5-FU resistance in gastric cancer

✇Omics in Gastric
By: Jinzhou Wang · Bishuang Xu · Xiaohan Lin · Biyu Chen · Xiaoyan Liu · Wei Wu
13 March 2026 at 18:00

Gastric Cancer. 2026 Mar 13. doi: 10.1007/s10120-026-01718-x. Online ahead of print.

ABSTRACT

BACKGROUND: 5-Fluorouracil (5-FU) remains a cornerstone of first-line chemotherapy for gastric cancer, yet the emergence of resistance severely compromises its clinical efficacy. Although ferroptosis suppression has been recognized as a pivotal mechanism of chemoresistance, the mitochondrial regulatory processes involved remain poorly understood.

METHODS: We integrated clinical specimen analysis, in vitro and in vivo functional assays, multi-omics profiling, and molecular docking to delineate the role of the mitochondrial oxidoreductase OXNAD1 in mediating 5-FU resistance in gastric cancer, and to assess the therapeutic potential of the natural polyphenol resveratrol as a chemosensitizing agent.

RESULTS: OXNAD1 was found to be significantly overexpressed in gastric cancer tissues and cell lines, correlating with unfavorable prognosis and enhanced 5-FU resistance. Mechanistically, OXNAD1 directly bound to and suppressed the ferroptosis driver PTGS2, thereby attenuating lipid peroxidation and mitochondrial damage, ultimately restraining ferroptosis and promoting drug resistance. Notably, resveratrol disrupted the OXNAD1-PTGS2 interaction by directly binding OXNAD1, reinstating ferroptotic activity, markedly enhancing the cytotoxic effect of 5-FU in resistant cells, and potentiating the antitumor efficacy of 5-FU in xenograft models.

CONCLUSION: The OXNAD1-PTGS2 axis constitutes a critical metabolic-cell death cross-regulatory pathway underlying 5-FU resistance in gastric cancer. Targeting this axis with resveratrol provides a promising combinatorial strategy to overcome chemoresistance.

PMID:41824193 | DOI:10.1007/s10120-026-01718-x

Received — 11 March 2026 ⏭

How Long Can Unified Multimodal Models Generate Images Reliably? Taming Long-Horizon Interleaved Image Generation via Context Curation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Haoyu Chen · Qing Liu · Yuqian Zhou · He Zhang · Zhaowen Wang · Mengwei Ren · Jingjing Ren · Xiang Wang · Zhe Lin · Lei Zhu
10 March 2026 at 12:00
arXiv:2603.07540v1 Announce Type: cross Abstract: Unified multimodal models hold the promise of generating extensive, interleaved narratives, weaving text and imagery into coherent long-form stories. However, current systems suffer from a critical reliability gap: as sequences grow, generation quality rapidly collapses. In this work, we investigate the mechanism behind this failure and argue that it is distinct from standard long-context challenges. We reveal that in generation, accumulated visual history acts as a source of active pollution, a decay governed specifically by the number of image events rather than raw token count. We identify a structural vulnerability where dense visual tokens overwhelm the attention mechanism, creating noise that distorts future synthesis. Guided by these mechanistic insights, we propose UniLongGen, a training-free inference strategy that prioritizes safe conditioning over total recall. Instead of retaining all history, UniLongGen dynamically curates the model's memory, identifying and discarding interfering visual signals based on the model's own internal relevance rankings. Extensive experiments demonstrate that this active forgetting approach is essential for stability: UniLongGen significantly outperforms baselines in long-horizon fidelity and consistency, while simultaneously reducing memory footprint and inference time.

Video-EM: Event-Centric Episodic Memory for Long-Form Video Understanding

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yun Wang · Long Zhang · Jingren Liu · Jiaqi Yan · Zhanjie Zhang · Jiahao Zheng · Ao Ma · Run Ling · Xun Yang · Dapeng Wu · Xiangyu Chen · Xuelong Li
10 March 2026 at 12:00
arXiv:2508.09486v2 Announce Type: replace-cross Abstract: Video Large Language Models (Video-LLMs) have shown strong video understanding, yet their application to long-form videos remains constrained by limited context windows. A common workaround is to compress long videos into a handful of representative frames via retrieval or summarization. However, most existing pipelines score frames in isolation, implicitly assuming that frame-level saliency is sufficient for downstream reasoning. This often yields redundant selections, fragmented temporal evidence, and weakened narrative grounding for long-form video question answering. We present \textbf{Video-EM}, a training-free, event-centric episodic memory framework that reframes long-form VideoQA as \emph{episodic event construction} followed by \emph{memory refinement}. Instead of treating retrieved keyframes as independent visuals, Video-EM employs an LLM as an active memory agent to orchestrate off-the-shelf tools: it first localizes query-relevant moments via multi-grained semantic matching, then groups and segments them into temporally coherent events, and finally encodes each event as a grounded episodic memory with explicit temporal indices and spatio-temporal cues (capturing \emph{when}, \emph{where}, \emph{what}, and involved entities). To further suppress verbosity and noise from imperfect upstream signals, Video-EM integrates a reasoning-driven self-reflection loop that iteratively verifies evidence sufficiency and cross-event consistency, removes redundancy, and adaptively adjusts event granularity. The outcome is a compact yet reliable \emph{event timeline} -- a minimal but sufficient episodic memory set that can be directly consumed by existing Video-LLMs without additional training or architectural changes.

LMMRec: LLM-driven Motivation-aware Multimodal Recommendation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yicheng Di · Zhanjie Zhang · Yun Wang · Jinren Liu · Jiaqi Yan · Jiyu Wei · Xiangyu Chen · Yuan Liu
10 March 2026 at 12:00
arXiv:2602.05474v3 Announce Type: replace-cross Abstract: Motivation-based recommendation systems uncover user behavior drivers. Motivation modeling, crucial for decision-making and content preference, explains recommendation generation. Existing methods often treat motivation as latent variables from interaction data, neglecting heterogeneous information like review text. In multimodal motivation fusion, two challenges arise: 1) achieving stable cross-modal alignment amid noise, and 2) identifying features reflecting the same underlying motivation across modalities. To address these, we propose LLM-driven Motivation-aware Multimodal Recommendation (LMMRec), a model-agnostic framework leveraging large language models for deep semantic priors and motivation understanding. LMMRec uses chain-of-thought prompting to extract fine-grained user and item motivations from text. A dual-encoder architecture models textual and interaction-based motivations for cross-modal alignment, while Motivation Coordination Strategy and Interaction-Text Correspondence Method mitigate noise and semantic drift through contrastive learning and momentum updates. Experiments on three datasets show LMMRec achieves up to a 4.98\% performance improvement.
Received — 5 March 2026 ⏭

AI4S-SDS: A Neuro-Symbolic Solvent Design System via Sparse MCTS and Differentiable Physics Alignment

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jiangyu Chen
5 March 2026 at 13:00
arXiv:2603.03686v1 Announce Type: new Abstract: Automated design of chemical formulations is a cornerstone of materials science, yet it requires navigating a high-dimensional combinatorial space involving discrete compositional choices and continuous geometric constraints. Existing Large Language Model (LLM) agents face significant challenges in this setting, including context window limitations during long-horizon reasoning and path-dependent exploration that may lead to mode collapse. To address these issues, we introduce AI4S-SDS, a closed-loop neuro-symbolic framework that integrates multi-agent collaboration with a tailored Monte Carlo Tree Search (MCTS) engine. We propose a Sparse State Storage mechanism with Dynamic Path Reconstruction, which decouples reasoning history from context length and enables arbitrarily deep exploration under fixed token budgets. To reduce local convergence and improve coverage, we implement a Global--Local Search Strategy: a memory-driven planning module adaptively reconfigures the search root based on historical feedback, while a Sibling-Aware Expansion mechanism promotes orthogonal exploration at the node level. Furthermore, we bridge symbolic reasoning and physical feasibility through a Differentiable Physics Engine, employing a hybrid normalized loss with sparsity-inducing regularization to optimize continuous mixing ratios under thermodynamic constraints. Empirical results show that AI4S-SDS achieves full validity under the adopted HSP-based physical constraints and substantially improves exploration diversity compared to baseline agents. In preliminary lithography experiments, the framework identifies a novel photoresist developer formulation that demonstrates competitive or superior performance relative to a commercial benchmark, highlighting the potential of diversity-driven neuro-symbolic search for scientific discovery.
❌