❌

Normal view

Received — 2 April 2026 ⏭

ASI-Evolve: AI Accelerates AI

✇cs.AI, q-bio.NC updates on arXiv.org
By: Weixian Xu · Tiantian Mi · Yixiu Liu · Yang Nan · Zhimeng Zhou · Lyumanshan Ye · Lin Zhang · Yu Qiao · Pengfei Liu
1 April 2026 at 12:00
arXiv:2603.29640v1 Announce Type: new Abstract: Can AI accelerate the development of AI itself? While recent agentic systems have shown strong performance on well-scoped tasks with rapid feedback, it remains unclear whether they can tackle the costly, long-horizon, and weakly supervised research loops that drive real AI progress. We present ASI-Evolve, an agentic framework for AI-for-AI research that closes this loop through a learn-design-experiment-analyze cycle. ASI-Evolve augments standard evolutionary agents with two key components: a cognition base that injects accumulated human priors into each round of exploration, and a dedicated analyzer that distills complex experimental outcomes into reusable insights for future iterations. To our knowledge, ASI-Evolve is the first unified framework to demonstrate AI-driven discovery across three central components of AI development: data, architectures, and learning algorithms. In neural architecture design, it discovered 105 SOTA linear attention architectures, with the best discovered model surpassing DeltaNet by +0.97 points, nearly 3x the gain of recent human-designed improvements. In pretraining data curation, the evolved pipeline improves average benchmark performance by +3.96 points, with gains exceeding 18 points on MMLU. In reinforcement learning algorithm design, discovered algorithms outperform GRPO by up to +12.5 points on AMC32, +11.67 points on AIME24, and +5.04 points on OlympiadBench. We further provide initial evidence that this AI-for-AI paradigm can transfer beyond the AI stack through experiments in mathematics and biomedicine. Together, these results suggest that ASI-Evolve represents a promising step toward enabling AI to accelerate AI across the foundational stages of development, offering early evidence for the feasibility of closed-loop AI research.

Targeting FTO shows therapeutic potential in esophageal squamous cell carcinoma by modulating microRNA biogenesis

✇Oncogene - Issue - nature.com science feeds
By: Wei Zhou · Chunyan Wang · Changhao Li · Pengxiang Chen · Yuchen Liu · Hongyuan Mao · Pengfei Zhu · Yuxiao Gong · Yufeng Cheng · Lin Zhang
1 April 2026 at 08:00

Oncogene, Published online: 01 April 2026; doi:10.1038/s41388-026-03754-4

Targeting FTO shows therapeutic potential in esophageal squamous cell carcinoma by modulating microRNA biogenesis
Received — 26 March 2026 ⏭

CyberGym: Evaluating AI Agents' Real-World Cybersecurity Capabilities at Scale

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhun Wang · Tianneng Shi · Jingxuan He · Matthew Cai · Jialin Zhang · Dawn Song
25 March 2026 at 12:00
arXiv:2506.02548v3 Announce Type: replace-cross Abstract: AI agents have significant potential to reshape cybersecurity, making a thorough assessment of their capabilities critical. However, existing evaluations fall short, because they are based on small-scale benchmarks and only measure static outcomes, failing to capture the full, dynamic range of real-world security challenges. To address these limitations, we introduce CyberGym, a large-scale benchmark featuring 1,507 real-world vulnerabilities across 188 software projects. Adjustable to different vulnerability analysis settings, CyberGym primarily tasks agents with generating a proof-of-concept test that reproduces a vulnerability, given only its text description and the corresponding codebase. Our extensive evaluation highlights that CyberGym effectively differentiates agents' and models' cybersecurity capabilities. Even the top-performing combinations only achieve a ~20% success rate, demonstrating the overall difficulty of CyberGym. Beyond static benchmarking, we show that CyberGym leads to the discovery of 34 zero-day vulnerabilities and 18 historically incomplete patches. These results underscore that CyberGym is not only a robust benchmark for measuring AI's progress in cybersecurity but also a platform for creating direct, real-world security impact.

From Noisy Labels to Intrinsic Structure: A Geometric-Structural Dual-Guided Framework for Noise-Robust Medical Image Segmentation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Tao Wang · Zhenxuan Zhang · Yuanbo Zhou · Xinlin Zhang · Yuanbin Chen · Tao Tan · Guang Yang · Tong Tong
25 March 2026 at 12:00
arXiv:2509.02419v2 Announce Type: replace-cross Abstract: The effectiveness of convolutional neural networks in medical image segmentation relies on large-scale, high-quality annotations, which are costly and time-consuming to obtain. Even expert-labeled datasets inevitably contain noise arising from subjectivity and coarse delineations, which disrupt feature learning and adversely impact model performance. To address these challenges, this study propose a Geometric-Structural Dual-Guided Network (GSD-Net), which integrates geometric and structural cues to improve robustness against noisy annotations. It incorporates a Geometric Distance-Aware module that dynamically adjusts pixel-level weights using geometric features, thereby strengthening supervision in reliable regions while suppressing noise. A Structure-Guided Label Refinement module further refines labels with structural priors, and a Knowledge Transfer module enriches supervision and improves sensitivity to local details. To comprehensively assess its effectiveness, we evaluated GSD-Net on six publicly available datasets: four containing three types of simulated label noise, and two with multi-expert annotations that reflect real-world subjectivity and labeling inconsistencies. Experimental results demonstrate that GSD-Net achieves state-of-the-art performance under noisy annotations, achieving improvements of 1.58% on Kvasir, 22.76% on Shenzhen, 8.87% on BU-SUC, and 1.77% on BraTS2020 under SR simulated noise. The codes of this study are available at https://github.com/ortonwang/GSD-Net.

NUP85 as a Pan-Cancer Immune Biomarker: Integrated Multi Omics and Functional Analyses Reveal Its Role in Tumor Prognosis

✇(Multiomics OR Omics) AND (Lung OR gastric OR Hepatocellular)
By: Weihao Kong · Ying Hu · Kangjie Zhang · Zhipeng Zhu · Yajun Zou · Long Teng · Xingyu Wang · Jianlin Zhang
23 March 2026 at 18:00

Immunotargets Ther. 2026 Mar 17;15:541852. doi: 10.2147/ITT.S541852. eCollection 2026.

ABSTRACT

PURPOSE: NUP85 encodes protein components of the Nup107-160 subunit of the nuclear pore complex, belonging to the Nucleoporins (NUPs) family, potentially implicating its role in human cancer. This study aims to elucidate the potential involvement of NUP85 in cancer pathogenesis.

METHODS: Leveraging data from The Cancer Genome Atlas (TCGA), Genotype-Tissue Expression (GTEx), Clinical Proteomic Tumor Analysis Consortium (CPTAC), Cancer Cell Line Encyclopedia (CCLE), Human Protein Atlas (HPA), Gene Expression Profiling Interactive Analysis (GEPIA), CellMiner, and GeneMANIA databases, we investigated the role of NUP85 across various tumors. Correlations between NUP85 expression and pathological stage, histological grade, survival, immune infiltration, tumor mutational burden (TMB), microsatellite instability (MSI), drug resistance, DNA methylation, copy number variation (CNV), and single-cell expression were analyzed. Gene functional enrichment analysis was conducted to explore NUP85-associated pathways. Molecular biology experiments including Western blotting, flow cytometry, trans-well migration, and invasion assays were performed to validate NUP85's oncogenic role in lung adenocarcinoma (LUAD) and oral squamous cell carcinoma (OSCC) cell lines.

RESULTS: Our findings reveal up-regulated expression of NUP85 in most tumor tissues, with significant correlations observed with pathological stage, survival, immune infiltration, TMB, MSI, drug resistance, DNA methylation, and CNV. Molecular biology experiments confirm NUP85's tumor-promoting role in LUAD and OSCC cell lines. Single-cell sequencing data suggest elevated NUP85 expression primarily in proliferative T cells (Tprolif).

CONCLUSION: NUP85 emerges as a potential tumor marker associated with tumor immunity and poor prognosis. These insights offer avenues for the development of novel therapeutic targets and anti-neoplastic drugs.

PMID:41869435 | PMC:PMC13005628 | DOI:10.2147/ITT.S541852

Hypoxia-related and immune phenotype-related fusion model for non-invasive prognostication of hepatocellular carcinoma treated by TACE: a multicentre study

✇Omics in Hepatocellular
By: Yusheng Guo · Guilin Zhang · Xiaona Fu · Shanshan Jiang · Yi Li · Shanmei Li · Xiaofang Guo · Xiaolin Zhang · Chang Zhao · Rong Ding · Lei Yu · Xuegang Yang · Kai Zhao · Yuxin Sun · QiuPing Liu · YuDong Zhang · Xuhua Duan · Hui Zhao · Jiahua Zou · Bin Liang · Lian Yang · Chuansheng Zheng · Xuefeng Kan
19 March 2026 at 18:00

Gut. 2026 Mar 30:gutjnl-2025-337938. doi: 10.1136/gutjnl-2025-337938. Online ahead of print.

ABSTRACT

BACKGROUND: Survival outcomes after transarterial chemoembolisation (TACE) vary in hepatocellular carcinoma (HCC) patients, and existing prognostic scores and imaging models often lack generalisability and biological interpretability.

OBJECTIVE: To develop and validate a multimodal prognostication model for HCC that allows for a precise assessment of survival outcomes of HCC patients receiving TACE therapy.

DESIGN: This study enrolled 1448 HCC patients, including a TACE cohort (n=1349), a biomarker subset from a randomised trial (n=41), a single-cell RNA sequencing cohort and The Cancer Genome Atlas (TCGA) HCC cohort (n=50). Pre-treatment contrast-enhanced CT images were used to construct deep learning and conventional radiomic models. The early-fusion and late-fusion models (LFMs) were compared, and a clinical-radiologic model (CRM) was formed by integrating the better-performing LFM with clinical variables. Using TCGA data and single-cell transcriptomic profiles, the differences between high-score and low-score groups in tumour immune microenvironment, cellular functional states and key signalling pathways were investigated.

RESULTS: The CRM effectively stratified patients' survival across multiple independent cohorts and achieved more granular risk stratification than the existing clinical models. Multi-omic analyses revealed that in the LFM high-score group, myelocytomatosis oncogene was activated, epithelial-mesenchymal transition enhanced, glycolysis upregulated and hypoxia pathway activated. Single-cell transcriptomic data confirmed that virtually all cell types in high-risk patients scored high in hypoxia, and cytotoxic T cells had a reduced cytotoxic activity.

CONCLUSION: The CRM model can non-invasively predict the prognosis of HCC patients treated by TACE therapy.

PMID:41856522 | DOI:10.1136/gutjnl-2025-337938

β-hydroxybutyrate enhances the metabolic fitness of CAR T cells in cancer

✇Cell
By: Shan Liu · Puneeth Guruprasad · Ranjani Ramasubramanian · Bhoomi Madhu · Luca Paruzzo · Kecheng Han · Andre Kelly · Alexander Shestov · He N. Xu · Alberto Carturan · Chaoting Zhou · Kevin R. Amses · Amichay Afriat · Lev Litichevskiy · Jason Lin · Ezra Dubowitz · Neil Tangal · Jing Zhang · Alana McSween · Melody Tan · Federico Stella · Andrew Lee · Siena Nason · Xianxin Hua · Michael Schneider · Madeleine Sleeman · Yunlin Zhang · Giulia Gabrielli · Ziqi Yang · Raymone Pajarillo · Ruchi Patel · Guido Ghilardi · Vrutti Patel · Akshita Joshi · Shunzhou Jiang · Yanqing Jiang · Patrizia Porazzi · Julia C. Tchou · Brian Keith · Mingyao Li · Elise Chong · Stephen J. Schuster · Michael Milone · Joshua Rabinowitz · Roddy S. O’Connor · Christoph A. Thaiss · Maayan Levy · Marco Ruella
6 March 2026 at 08:00
β-hydroxybutyrate (BHB), the ketone body associated with a ketogenic diet, metabolically reprograms and fuels CAR T cells to achieve proliferation, cytokine production, and superior tumor control. These findings suggest that BHB supplementation may be a practical way to boost adoptive cancer immunotherapy.
Received — 17 March 2026 ⏭

ARL-Tangram: Unleash the Resource Efficiency in Agentic Reinforcement Learning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Bangjun Xiao · Yihao Zhao · Xiangwei Deng · Shihua Yu · Yuxing Xiang · Huaqiu Liu · Qiying Wang · Liang Zhao · Hailin Zhang · Xuanzhe Liu · Xin Jin · Fuli Luo
16 March 2026 at 12:00
arXiv:2603.13019v1 Announce Type: cross Abstract: Agentic reinforcement learning (RL) has emerged as a transformative workload in cloud clusters, enabling large language models (LLMs) to solve complex problems through interactions with real world. However, unlike traditional RL, agentic RL demands substantial external cloud resources, e.g., CPUs for code execution and GPUs for reward models, that exist outside the primary training cluster. Existing agentic RL framework typically rely on static over-provisioning, i.e., resources are often tied to long-lived trajectories or isolated by tasks, which leads to severe resource inefficiency. We propose the action-level orchestration, and incorporate it into ARL-Tangram, a unified resource management system that enables fine-grained external resource sharing and elasticity. ARL-Tangram utilizes a unified action-level formulation and an elastic scheduling algorithm to minimize action completion time (ACT) while satisfying heterogeneous resource constraints. Further, heterogeneous resource managers are tailored to efficiently support the action-level execution on resources with heterogeneous characteristics and topologies. Evaluation on real-world agentic RL tasks demonstrates that ARL-Tangram improves average ACT by up to 4.3$\times$, speeds up the step duration of RL training by up to 1.5$\times$, and saves the external resources by up to 71.2$\%$. This system has been deployed to support the training of the MiMo series models.

daVinci-Env: Open SWE Environment Synthesis at Scale

✇cs.AI, q-bio.NC updates on arXiv.org
By: Dayuan Fu · Shenyu Wu · Yunze Wu · Zerui Peng · Yaxing Huang · Jie Sun · Ji Zeng · Mohan Jiang · Lin Zhang · Yukun Li · Jiarui Hu · Liming Liu · Jinlong Hou · Pengfei Liu
16 March 2026 at 12:00
arXiv:2603.13023v1 Announce Type: cross Abstract: Training capable software engineering (SWE) agents demands large-scale, executable, and verifiable environments that provide dynamic feedback loops for iterative code editing, test execution, and solution refinement. However, existing open-source datasets remain limited in scale and repository diversity, while industrial solutions are opaque with unreleased infrastructure, creating a prohibitive barrier for most academic research groups. We present OpenSWE, the largest fully transparent framework for SWE agent training in Python, comprising 45,320 executable Docker environments spanning over 12.8k repositories, with all Dockerfiles, evaluation scripts, and infrastructure fully open-sourced for reproducibility. OpenSWE is built through a multi-agent synthesis pipeline deployed across a 64-node distributed cluster, automating repository exploration, Dockerfile construction, evaluation script generation, and iterative test analysis. Beyond scale, we propose a quality-centric filtering pipeline that characterizes the inherent difficulty of each environment, filtering out instances that are either unsolvable or insufficiently challenging and retaining only those that maximize learning efficiency. With $891K spent on environment construction and an additional $576K on trajectory sampling and difficulty-aware curation, the entire project represents a total investment of approximately $1.47 million, yielding about 13,000 curated trajectories from roughly 9,000 quality guaranteed environments. Extensive experiments validate OpenSWE's effectiveness: OpenSWE-32B and OpenSWE-72B achieve 62.4% and 66.0% on SWE-bench Verified, establishing SOTA among Qwen2.5 series. Moreover, SWE-focused training yields substantial out-of-domain improvements, including up to 12 points on mathematical reasoning and 5 points on science benchmarks, without degrading factual recall.
Received — 14 March 2026 ⏭
Received — 11 March 2026 ⏭

BoxMind: Closed-loop AI strategy optimization for elite boxing validated in the 2024 Olympics

✇cs.AI, q-bio.NC updates on arXiv.org
By: Kaiwen Wang · Kaili Zheng · Rongrong Deng · Qingmin Fan · Milin Zhang · Zongrui Li · Xuesi Zhou · Bo Han · Liren Chen · Chenyi Guo · Ji Wu
10 March 2026 at 12:00
arXiv:2601.11492v2 Announce Type: replace Abstract: Competitive sports require sophisticated tactical analysis, yet combat disciplines like boxing remain underdeveloped in AI-driven analytics due to the complexity of action dynamics and the lack of structured tactical representations. To address this, we present BoxMind, a closed-loop AI expert system validated in elite boxing competition. By defining atomic punch events with precise temporal boundaries and spatial and technical attributes, we parse match footage into 18 hierarchical technical-tactical indicators. We then propose a graph-based predictive model that fuses these explicit technical-tactical profiles with learnable, time-variant latent embeddings to capture the dynamics of boxer matchups. Modeling match outcome as a differentiable function of technical-tactical indicators, we turn winning probability gradients into executable tactical adjustments. Experiments show that the outcome prediction model achieves state-of-the-art performance, with 69.8% accuracy on BoxerGraph test set and 87.5% on Olympic matches. Using this predictive model as a foundation, the system generates strategic recommendations that demonstrate proficiency comparable to human experts. BoxMind is validated through a closed-loop deployment during the 2024 Paris Olympics, directly contributing to the Chinese National Team's historic achievement of three gold and two silver medals. BoxMind establishes a replicable paradigm for transforming unstructured video data into strategic intelligence, bridging the gap between computer vision and decision support in competitive sports. Code and data is available at https://github.com/gouba2333/BoxingWeb.
Received — 25 February 2026 ⏭

RDBLearn: Simple In-Context Prediction Over Relational Databases

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yanlin Zhang · Linjie Xu · Quan Gan · David Wipf · Minjie Wang
24 February 2026 at 13:00
arXiv:2602.18495v1 Announce Type: cross Abstract: Recent advances in tabular in-context learning (ICL) show that a single pretrained model can adapt to new prediction tasks from a small set of labeled examples, avoiding per-task training and heavy tuning. However, many real-world tasks live in relational databases, where predictive signal is spread across multiple linked tables rather than a single flat table. We show that tabular ICL can be extended to relational prediction with a simple recipe: automatically featurize each target row using relational aggregations over its linked records, materialize the resulting augmented table, and run an off-the-shelf tabular foundation model on it. We package this approach in \textit{RDBLearn} (https://github.com/HKUSHXLab/rdblearn), an easy-to-use toolkit with a scikit-learn-style estimator interface that makes it straightforward to swap different tabular ICL backends; a complementary agent-specific interface is provided as well. Across a broad collection of RelBench and 4DBInfer datasets, RDBLearn is the best-performing foundation model approach we evaluate, at times even outperforming strong supervised baselines trained or fine-tuned on each dataset.

Diversity-Incentivized Exploration for Versatile Reasoning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zican Hu · Shilin Zhang · Yafu Li · Jianhao Yan · Xuyang Hu · Leyang Cui · Xiaoye Qu · Chunlin Chen · Yu Cheng · Zhi Wang
24 February 2026 at 13:00
arXiv:2509.26209v2 Announce Type: replace Abstract: Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as a crucial paradigm for incentivizing reasoning capabilities in Large Language Models (LLMs). Due to vast state-action spaces and reward sparsity in reasoning tasks, existing methods often struggle with deficient exploration and poor sample efficiency. In the paper, we propose \textbf{DIVER} (\textbf{D}iversity-\textbf{I}ncentivized Exploration for \textbf{V}ersatil\textbf{E} \textbf{R}easoning), an innovative framework that highlights the pivotal role of global sequence-level diversity to incentivize deep exploration for versatile reasoning. We first conduct a primary empirical study to reveal a strong positive correlation between global diversity and reasoning capacity. Building on this insight, we introduce global diversity incentives as an intrinsic reward to promote deep exploration in a semantically structured space. Incorporating the intrinsic reward, we develop a potential-based reward shaping mechanism to preserve optimal policy invariance and design simple heuristics to mitigate possible reward hacking. Experimental results show that DIVER outperforms competitive RLVR baselines with various exploration strategies on both in-domain and out-of-domain tasks, excelling in both Pass@1 and Pass@k evaluations. Our code is available at https://github.com/NJU-RL/DIVER.

Adaptive Runge-Kutta Dynamics for Spatiotemporal Prediction

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xuanle Zhao · Yue Sun · Ziyi Wang · Bo Xu · Tielin Zhang
24 February 2026 at 13:00
arXiv:2405.14504v2 Announce Type: replace-cross Abstract: Spatiotemporal prediction is important in solving natural problems and processing video frames, especially in weather forecasting and human action recognition. Recent advances attempt to incorporate prior physical knowledge into the deep learning framework to estimate the unknown governing partial differential equations (PDEs) in complex dynamics, which have shown promising results in spatiotemporal prediction tasks. However, previous approaches only restrict neural network architectures or loss functions to acquire physical or PDE features, which decreases the representative capacity of a neural network. Meanwhile, the updating process of the physical state cannot be effectively estimated. To solve the problems mentioned above, we introduce a physical-guided neural network, which utilizes an adaptive second-order Runge-Kutta method with physical constraints to model the physical states more precisely. Furthermore, we propose a frequency-enhanced Fourier module to strengthen the model's ability to estimate the spatiotemporal dynamics. We evaluate our model on both spatiotemporal and video prediction tasks. The experimental results show that our model outperforms several state-of-the-art methods and performs the best in several spatiotemporal scenarios with a much smaller parameter count.
There are no more articles
❌