ResoSeg: Resonance Tagger using Transformer and Segment Model

By: Chunkai Li · Junhao Yin · Ke Li · Jingde Chen

14 September 2026 at 12:00

arXiv:2609.12610v1 Announce Type: cross Abstract: Deep learning has been widely applied across many areas of experimental high-energy physics, yet existing models address only event-level classification or object tagging and therefore still require reconstruction algorithms tailored to each decay channel. We present the first application of segmentation to resonance tagging at BESIII and introduce ResoSeg, a deep learning model that jointly performs particle-level segmentation and event-level classification, enabling a one-pass analysis of resonance to anything decays while precisely reconstructing the relevant resonance properties. We demonstrate the reconstruction of $\eta_c$ with $e^+e^-\to\pi^+\pi^-h_c$, $h_c\to\gamma\eta_c$, $\eta_c\to\text{anything}$. The model is trained on BESIII-$\eta_c$ dataset, which is constructed with per-track true labels obtained via a Truth-Matching Algorithm. Experimental results show that the average combined efficiency of ResoSeg is more than double that of the conventional 16-channel approach across energy points from 4.19 to 4.60\,GeV. The model generalizes to unseen energy points, adapts to other $\eta_c$ production modes through transfer learning, and remains robust against variations in the $\eta_c$ mass, width, and branching fractions, providing a general, resonance-aware model applicable beyond $\eta_c$ and BESIII. The source code is available at https://github.com/oashen/ResoSeg.

HEAPr: Hessian-based Efficient Atomic Expert Pruning in Output Space

cs.AI, q-bio.NC updates on arXiv.org

By: Ke Li · Zheng Yang · Zhongbin Zhou · Feng Xue · Zhonglin Jiang · Wenxiao Wang

26 May 2026 at 12:00

arXiv:2509.22299v3 Announce Type: replace-cross Abstract: Mixture-of-Experts (MoE) architectures in large language models (LLMs) deliver exceptional performance and reduced inference costs compared to dense LLMs. However, their large parameter counts result in prohibitive memory requirements, limiting practical deployment. While existing pruning methods primarily focus on expert-level pruning, this coarse granularity often leads to substantial accuracy degradation. In this work, we introduce HEAPr, a novel pruning algorithm that decomposes experts into smaller, indivisible atomic experts, enabling more precise and flexible atomic expert pruning. To measure the importance of each atomic expert, we leverage second-order information based on principles similar to the Optimal Brain Surgeon theory. To address the computational and storage challenges posed by second-order information, HEAPr exploits the inherent properties of atomic experts to transform the second-order information from expert parameters into that of atomic expert parameters, and further simplifies it to the second-order information of atomic expert outputs. This approach reduces the space complexity from $O(d^4)$, where $d$ is the model's dimensionality, to $O(d^2)$. HEAPr requires only two forward passes and one backward pass on a small calibration set to compute the importance of atomic experts. Extensive experiments on MoE models, including DeepSeek MoE and Qwen MoE family, demonstrate that HEAPr outperforms existing expert-level pruning methods across a wide range of pruning ratios and benchmarks. Specifically, HEAPr achieves nearly lossless compression at pruning ratios of 20% ~ 25% in most models, while also reducing FLOPs nearly by 20%. The code can be found at [https://github.com/LLIKKE/HEAPr](https://github.com/LLIKKE/HEAPr).

DIRECT: Video Mashup Creation via Hierarchical Multi-Agent Planning and Intent-Guided Editing

cs.AI, q-bio.NC updates on arXiv.org

By: Ke Li · Maoliang Li · Jialiang Chen · Jiayu Chen · Zihao Zheng · Shaoqi Wang · Xiang Chen

7 April 2026 at 12:00

arXiv:2604.04875v1 Announce Type: cross Abstract: Video mashup creation represents a complex video editing paradigm that recomposes existing footage to craft engaging audio-visual experiences, demanding intricate orchestration across semantic, visual, and auditory dimensions and multiple levels. However, existing automated editing frameworks often overlook the cross-level multimodal orchestration to achieve professional-grade fluidity, resulting in disjointed sequences with abrupt visual transitions and musical misalignment. To address this, we formulate video mashup creation as a Multimodal Coherency Satisfaction Problem (MMCSP) and propose the DIRECT framework. Simulating a professional production pipeline, our hierarchical multi-agent framework decomposes the challenge into three cascade levels: the Screenwriter for source-aware global structural anchoring, the Director for instantiating adaptive editing intent and guidance, and the Editor for intent-guided shot sequence editing with fine-grained optimization. We further introduce Mashup-Bench, a comprehensive benchmark with tailored metrics for visual continuity and auditory alignment. Extensive experiments demonstrate that DIRECT significantly outperforms state-of-the-art baselines in both objective metrics and human subjective evaluation. Project page and code: https://github.com/AK-DREAM/DIRECT

WIMLE: Uncertainty-Aware World Models with IMLE for Sample-Efficient Continuous Control

cs.AI, q-bio.NC updates on arXiv.org

By: Mehran Aghabozorgi · Alireza Moazeni · Yanshu Zhang · Ke Li

7 April 2026 at 12:00

arXiv:2602.14351v2 Announce Type: replace-cross Abstract: Model-based reinforcement learning promises strong sample efficiency but often underperforms in practice due to compounding model error, unimodal world models that average over multi-modal dynamics, and overconfident predictions that bias learning. We introduce WIMLE, a model-based method that extends Implicit Maximum Likelihood Estimation (IMLE) to the model-based RL framework to learn stochastic, multi-modal world models without iterative sampling and to estimate predictive uncertainty via ensembles and latent sampling. During training, WIMLE weights each synthetic transition by its predicted confidence, preserving useful model rollouts while attenuating bias from uncertain predictions and enabling stable learning. Across $40$ continuous-control tasks spanning DeepMind Control, MyoSuite, and HumanoidBench, WIMLE achieves superior sample efficiency and competitive or better asymptotic performance than strong model-free and model-based baselines. Notably, on the challenging Humanoid-run task, WIMLE improves sample efficiency by over $50$\% relative to the strongest competitor, and on HumanoidBench it solves $8$ of $14$ tasks (versus $4$ for BRO and $5$ for SimbaV2). These results highlight the value of IMLE-based multi-modality and uncertainty-aware weighting for stable model-based RL.

Elevation of Liver Elastic Value Following Radiofrequency Ablation Reflected Neutrophils Mediated Abscopal Effect in Liver Cancer

Omics in Hepatocellular

By: Ke Lin · Jiayao Huang · Nan Zhang · Bin Qiao · Daopeng Yang · Jianping Guo · Xiaoyan Xie · Manxia Lin · Bowen Zhuang

25 March 2026 at 18:00

JHEP Rep. 2026 Mar 23:101824. doi: 10.1016/j.jhepr.2026.101824. Online ahead of print.

ABSTRACT

BACKGROUND & AIMS: Hepatocellular carcinoma (HCC) is a leading cause of cancer-related mortality globally. Radiofrequency ablation (RFA) is a widely used treatment for HCC, but its efficacy is often limited by tumor relapse. Neutrophils, serve as a double-edged sword in tumor immunology, have recently been implicated in anti-tumor immunity post-RFA. Shear wave elastography (SWE) is a non-invasive examination for liver tissue, and associated with immune response. This study investigates the correlation between dynamic change of SWE values and neutrophils response following RFA, and explores potential adjuvant strategies for RFA.

METHODS: We conducted a comprehensive analysis using both clinical data from patients undergoing RFA (n=102) and experimental studies in mouse models (n=4-6 per group). Single-cell RNA sequencing (scRNA-seq) and multi-omics analyses including multiplex immunofluorescence staining and flow cytometric analysis were performed to identify neutrophil subsets. To assess the therapeutic potential of neutrophils-activating therapy for enhancing anti-tumor immunity post-RFA, we tested CD40 agonist in combination with RFA in preclinical models.

RESULTS: We noticed that rising liver SWE values following RFA were significantly associated with reduce relapse (n=102, p<0.001), and demonstrated that this phenomenon was linked to the inflammatory environment induced by the infiltration of neutrophils (2.5-fold increase, p<0.001). scRNA-seq analysis identified neutrophil subsets characterized by high expression of interferon-stimulated genes, which exhibited potent anti-tumor activity via nitric oxide. Importantly, treatment with CD40 agonist significantly augmented this immune response, leading to reduced tumor growth in mice (149.6±38.12 mm³ vs 23.92±4.43 mm³, p=0.008).

CONCLUSIONS: We linked clinical features to neutrophil-mediated immunity post-RFA. Neutrophil-activating therapy like CD40 agonists may prevent HCC relapse after RFA.

PMID:41881314 | DOI:10.1016/j.jhepr.2026.101824

SARE: Sample-wise Adaptive Reasoning for Training-free Fine-grained Visual Recognition

cs.AI, q-bio.NC updates on arXiv.org

By: Jingxiao Yang · DaLin He · Miao Pan · Ge Su · Wenqi Zhang · Yifeng Hu · Tangwei Li · Yuke Li · Xuhong Zhang

25 March 2026 at 12:00

arXiv:2603.17729v2 Announce Type: replace-cross Abstract: Recent advances in Large Vision-Language Models (LVLMs) have enabled training-free Fine-Grained Visual Recognition (FGVR). However, effectively exploiting LVLMs for FGVR remains challenging due to the inherent visual ambiguity of subordinate-level categories. Existing methods predominantly adopt either retrieval-oriented or reasoning-oriented paradigms to tackle this challenge, but both are constrained by two fundamental limitations:(1) They apply the same inference pipeline to all samples without accounting for uneven recognition difficulty, thereby leading to suboptimal accuracy and efficiency; (2) The lack of mechanisms to consolidate and reuse error-specific experience causes repeated failures on similar challenging cases. To address these limitations, we propose SARE, a Sample-wise Adaptive textbfREasoning framework for training-free FGVR. Specifically, SARE adopts a cascaded design that combines fast candidate retrieval with fine-grained reasoning, invoking the latter only when necessary. In the reasoning process, SARE incorporates a self-reflective experience mechanism that leverages past failures to provide transferable discriminative guidance during inference, without any parameter updates. Extensive experiments across 14 datasets substantiate that SARE achieves state-of-the-art performance while substantially reducing computational overhead.

AI Agents, Language, Deep Learning and the Next Revolution in Science

cs.AI, q-bio.NC updates on arXiv.org

By: Ke Li · Beijiang Liu · Bruce Mellado · Changzheng Yuan · Zhengde Zhang

10 March 2026 at 12:00

arXiv:2603.07940v1 Announce Type: cross Abstract: Modern science is reaching a critical inflection point. Instruments across disciplines, from particle physics and astronomy to genomics and climate modeling, now produce data of such scale, diversity, and interdependence that traditional analytical methods can no longer keep pace. This growing imbalance between data generation and data understanding signals the need for a new scientific paradigm. We propose that intelligent, human-supervised AI agents operating over deep-learning algorithms, represent the next evolution of the scientific method. Built upon large language models and multimodal learning, these agents can interpret scientific intent, design and execute analytical workflows, and ensure traceability through domain-specific languages that preserve human oversight and accountability. Particle physics, a historic incubator of computational innovation, offers the ideal testbed for this transition. At the Institute of High Energy Physics of the Chinese Academy of Sciences, the Dr. Sai system embodies this vision, a multi-agent reasoning framework deployed within collider research at the CEPC. This emerging approach does not replace human scientists but extends their cognitive reach, enabling discovery to scale with complexity and redefining how knowledge itself is produced in the age of intelligent machines. The significance of this paradigm transcends particle physics, offering a blueprint for all data-driven sciences facing the same complexity ceiling.

CRTAM inhibition mitigates toxicity of immune checkpoint inhibitors without antitumor efficacy trade-off

Nature Cancer

By: Si-Cong Ma · Zi-Xuan Rong · Zi-Peng Xu · Yan-Pei Zhang · Kui-Mao Zhuang · Hao Sun · Chuan-Hui Cao · Ze-Nan Wu · Hai-Peng Zhang · Qiang Zuo · Jia-Run Lin · Jia-Xin Cheng · Hua-Ting Qu · Duan-Duan Han · Wei Wei · Ke Liu · Xiao-Ting Cai · Ze-Qin Guo · Xue Bai · Li Liu · De-Hua Wu · Zhong-Yi Dong

5 March 2026 at 08:00

Nature Cancer, Published online: 05 March 2026; doi:10.1038/s43018-026-01135-0

Dong and colleagues report that blockade of T cell-expressed cytotoxic and regulatory T cell molecule results in selective mitigation of immune-related toxicities without affecting antitumor efficacy of immune checkpoint inhibitors.

Learning Order Forest for Qualitative-Attribute Data Clustering

cs.AI, q-bio.NC updates on arXiv.org

By: Mingjie Zhao · Sen Feng · Yiqun Zhang · Mengke Li · Yang Lu · Yiu-ming Cheung

5 March 2026 at 13:00

arXiv:2603.03387v1 Announce Type: cross Abstract: Clustering is a fundamental approach to understanding data patterns, wherein the intuitive Euclidean distance space is commonly adopted. However, this is not the case for implicit cluster distributions reflected by qualitative attribute values, e.g., the nominal values of attributes like symptoms, marital status, etc. This paper, therefore, discovered a tree-like distance structure to flexibly represent the local order relationship among intra-attribute qualitative values. That is, treating a value as the vertex of the tree allows to capture rich order relationships among the vertex value and the others. To obtain the trees in a clustering-friendly form, a joint learning mechanism is proposed to iteratively obtain more appropriate tree structures and clusters. It turns out that the latent distance space of the whole dataset can be well-represented by a forest consisting of the learned trees. Extensive experiments demonstrate that the joint learning adapts the forest to the clustering task to yield accurate results. Comparisons of 10 counterparts on 12 real benchmark datasets with significance tests verify the superiority of the proposed method.

No Need For Real Anomaly: MLLM Empowered Zero-Shot Video Anomaly Detection

cs.AI, q-bio.NC updates on arXiv.org

By: Zunkai Dai · Ke Li · Jiajia Liu · Jie Yang · Yuanyuan Qiao

24 February 2026 at 13:00

arXiv:2602.19248v1 Announce Type: cross Abstract: The collection and detection of video anomaly data has long been a challenging problem due to its rare occurrence and spatio-temporal scarcity. Existing video anomaly detection (VAD) methods under perform in open-world scenarios. Key contributing factors include limited dataset diversity, and inadequate understanding of context-dependent anomalous semantics. To address these issues, i) we propose LAVIDA, an end-to-end zero-shot video anomaly detection framework. ii) LAVIDA employs an Anomaly Exposure Sampler that transforms segmented objects into pseudo-anomalies to enhance model adaptability to unseen anomaly categories. It further integrates a Multimodal Large Language Model (MLLM) to bolster semantic comprehension capabilities. Additionally, iii) we design a token compression approach based on reverse attention to handle the spatio-temporal scarcity of anomalous patterns and decrease computational cost. The training process is conducted solely on pseudo anomalies without any VAD data. Evaluations across four benchmark VAD datasets demonstrate that LAVIDA achieves SOTA performance in both frame-level and pixel-level anomaly detection under the zero-shot setting. Our code is available in https://github.com/VitaminCreed/LAVIDA.

WIMLE: Uncertainty-Aware World Models with IMLE for Sample-Efficient Continuous Control

cs.AI, q-bio.NC updates on arXiv.org

By: Mehran Aghabozorgi · Alireza Moazeni · Yanshu Zhang · Ke Li

17 February 2026 at 13:00

arXiv:2602.14351v1 Announce Type: cross Abstract: Model-based reinforcement learning promises strong sample efficiency but often underperforms in practice due to compounding model error, unimodal world models that average over multi-modal dynamics, and overconfident predictions that bias learning. We introduce WIMLE, a model-based method that extends Implicit Maximum Likelihood Estimation (IMLE) to the model-based RL framework to learn stochastic, multi-modal world models without iterative sampling and to estimate predictive uncertainty via ensembles and latent sampling. During training, WIMLE weights each synthetic transition by its predicted confidence, preserving useful model rollouts while attenuating bias from uncertain predictions and enabling stable learning. Across $40$ continuous-control tasks spanning DeepMind Control, MyoSuite, and HumanoidBench, WIMLE achieves superior sample efficiency and competitive or better asymptotic performance than strong model-free and model-based baselines. Notably, on the challenging Humanoid-run task, WIMLE improves sample efficiency by over $50$\% relative to the strongest competitor, and on HumanoidBench it solves $8$ of $14$ tasks (versus $4$ for BRO and $5$ for SimbaV2). These results highlight the value of IMLE-based multi-modality and uncertainty-aware weighting for stable model-based RL.

Reading view