❌

Normal view

Received — 15 September 2026 ⏭

PhysCodeBench: Benchmarking Physics-Aware Symbolic Simulation of 3D Scenes via Self-Corrective Multi-Agent Refinement

✇cs.AI, q-bio.NC updates on arXiv.org
By: Tianyidan Xie · Peiyu Wang · Hu Jiaxin · Yuyi Qian · Yuxuan Wang · Shenyi Wang · Rui Ma · Yanlun Peng · Lanjun Wang · Ying Tai · Jian Yang · Zili Yi
14 September 2026 at 12:00
arXiv:2604.23580v2 Announce Type: replace-cross Abstract: Translating natural-language descriptions of physical phenomena into executable simulation code requires both programming expertise and physical reasoning. Current large language models (LLMs) lack this combination: they frequently produce code that runs but simulates the wrong physics. We introduce PhysCodeBench, the first benchmark for this task, with 1,200 expert-validated examples spanning four physical domains. Its evaluation suite, PhysCodeEval, goes beyond executability and visual fidelity to measure physical correctness directly from the engine state via conservation-law residuals and expert-written assertions, and supports cross-engine evaluation to disentangle physics reasoning from API fluency. As a reference method, we propose the Self-Corrective Multi-Agent Refinement Framework (SMRF), which decouples physics-aware error correction from code generation through specialized agents. This design is motivated by our finding that targeted correction, rather than generic iterative refinement, is the key driver of physical accuracy. SMRF nearly triples the physical-assertion pass rate of the best proprietary baseline (70.6\% vs.\ 23.8\%) and retains its advantage under cross-engine transfer.
Received — 10 September 2026 ⏭

Integrated single-cell multi-omics characterization reveals lipid-associated macrophage-mediated immunosuppression in neoadjuvant immunotherapy of hepatocellular carcinoma

✇Omics in Hepatocellular
By: Shengxuan Peng · Chang Liu · Junyu Long · Jincheng Tian · Han Li · Donghai Lu · Qihang Cao · Daolin Zhang · Qiao He · Jisen Jia · Yuxuan Wang · Zhaoru Dong · Haitao Zhao · Lei Zhao · Dongxu Wang · Tao Li
1 September 2026 at 18:00

Nat Commun. 2026 Jul 31;17(1):9381. doi: 10.1038/s41467-026-75949-y.

ABSTRACT

Hepatocellular carcinoma (HCC) is a cancer with high incidence and mortality rate. Although immune checkpoint inhibitors (ICIs) improved survival outcomes for HCC patients, limited objective response rate highlights the urgency of investigating determinants of immunotherapy. Here, we explore HCC resistance mechanisms following neoadjuvant αPD-1 immunotherapy by constructing a comprehensive multi-modal single-cell transcriptomic atlas consisting of 14 HCC patients treated with αPD-1 from our cohort (ClinicalTrials.gov ID: NCT06571396) and 60 external HCC cases with heterogeneous treatment backgrounds. Supervised by clinical outcomes of our cohort, we identify positive and negative regulators of immunotherapy within the tumor immune microenvironment (TIME), especially lipid-associated macrophages (LAM) with increased lipid metabolic state in non-responders and characterized by C1QA, FABP1, and APOA1 expression. We further show the presence, exogenous inducements and immunosuppressive functions of LAM, along with regulation strategies of its lipid-associated condition, including lycopene and chiglitazar. Furthermore, we construct interaction networks of immune regulators across responders and non-responders, showing distinct ligand-receptor landscapes with intervention targets. We reveal the TIME components including immunosuppressive LAMs that influence immunotherapy outcomes, thus providing evidence and insights for exploring immune landscape and therapeutic strategies for HCC immunotherapy. ClinicalTrials.gov ID: NCT06571396.

PMID:42680737 | PMC:PMC13534469 | DOI:10.1038/s41467-026-75949-y

Received — 8 April 2026 ⏭

HISA: Efficient Hierarchical Indexing for Fine-Grained Sparse Attention

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yufei Xu · Fanxu Meng · Fan Jiang · Yuxuan Wang · Ruijie Zhou · Zhaohui Wang · Jiexi Wu · Zhixin Pan · Xiaojuan Tang · Wenjie Pei · Tongxuan Liu · Di Yin · Xing Sun · Muhan Zhang
7 April 2026 at 12:00
arXiv:2603.28458v3 Announce Type: replace-cross Abstract: Token-level sparse attention mechanisms, exemplified by DeepSeek Sparse Attention (DSA), achieve fine-grained key selection by scoring every historical key for each query through a lightweight indexer, then computing attention only on the selected subset. While the downstream sparse attention itself scales favorably, the indexer must still scan the entire prefix for every query, introducing an per-layer bottleneck that grows prohibitively with context length. We propose HISA (Hierarchical Indexed Sparse Attention), a plug-and-play replacement for the indexer that rewrites the search path from a flat token scan into a two-stage hierarchical procedure: (1) a block-level coarse filtering stage that scores pooled block representations to discard irrelevant regions, followed by (2) a token-level refinement stage that applies the original indexer exclusively within the retained candidate blocks. HISA preserves the identical token-level top-sparse pattern consumed by the downstream Sparse MLA operator and requires no additional training. On kernel-level benchmarks, HISA achieves up to speedup at 64K context. On Needle-in-a-Haystack and LongBench, we directly replace the indexer in DeepSeek-V3.2 and GLM-5 with our HISA indexer, without any finetuning. HISA closely matches the original DSA in quality, while substantially outperforming block-sparse baselines.
Received — 2 April 2026 ⏭

Accelerating Diffusion Large Language Models with SlowFast Sampling: The Three Golden Principles

✇cs.AI, q-bio.NC updates on arXiv.org
By: Qingyan Wei · Yaojie Zhang · Zhiyuan Liu · Puyu Zeng · Yuxuan Wang · Biqing Qi · Dongrui Liu · Linfeng Zhang
1 April 2026 at 12:00
arXiv:2506.10848v3 Announce Type: replace-cross Abstract: Diffusion-based language models (dLLMs) have emerged as a promising alternative to traditional autoregressive LLMs by enabling parallel token generation and significantly reducing inference latency. However, existing sampling strategies for dLLMs, such as confidence-based or semi-autoregressive decoding, often suffer from static behavior, leading to suboptimal efficiency and limited flexibility. In this paper, we propose SlowFast Sampling, a novel dynamic sampling strategy that adaptively alternates between exploratory and accelerated decoding stages. Our method is guided by three golden principles: certainty principle, convergence principle, and positional principle, which govern when and where tokens can be confidently and efficiently decoded. We further integrate our strategy with dLLM-Cache to reduce redundant computation. Extensive experiments across benchmarks and models show that SlowFast Sampling achieves up to 15.63$\times$ speedup on LLaDA with minimal accuracy drop, and up to 34.22$\times$ when combined with caching. Notably, our approach outperforms strong autoregressive baselines like LLaMA3 8B in throughput, demonstrating that well-designed sampling can unlock the full potential of dLLMs for fast and high-quality generation.
Received — 26 March 2026 ⏭

DreamAudio: Customized Text-to-Audio Generation with Diffusion Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yi Yuan · Xubo Liu · Haohe Liu · Xiyuan Kang · Zhuo Chen · Yuxuan Wang · Mark D. Plumbley · Wenwu Wang
25 March 2026 at 12:00
arXiv:2509.06027v2 Announce Type: replace-cross Abstract: With the development of large-scale diffusion-based and language-modeling-based generative models, impressive progress has been achieved in text-to-audio generation. Despite producing high-quality outputs, existing text-to-audio models mainly aim to generate semantically aligned sound and fall short of controlling fine-grained acoustic characteristics of specific sounds. As a result, users who need specific sound content may find it difficult to generate the desired audio clips. In this paper, we present DreamAudio for customized text-to-audio generation (CTTA). Specifically, we introduce a new framework that is designed to enable the model to identify auditory information from user-provided reference concepts for audio generation. Given a few reference audio samples containing personalized audio events, our system can generate new audio samples that include these specific events. In addition, two types of datasets are developed for training and testing the proposed systems. The experiments show that DreamAudio generates audio samples that are highly consistent with the customized audio features and aligned well with the input text prompts. Furthermore, DreamAudio offers comparable performance in general text-to-audio tasks. We also provide a human-involved dataset containing audio events from real-world CTTA cases as the benchmark for customized generation tasks.
Received — 25 February 2026 ⏭

FaLW: A Forgetting-aware Loss Reweighting for Long-tailed Unlearning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Liheng Yu · Zhe Zhao · Yuxuan Wang · Pengkun Wang · Xiaofeng Cao · Binwu Wang · Yang Wang
24 February 2026 at 13:00
arXiv:2601.18650v2 Announce Type: replace-cross Abstract: Machine unlearning, which aims to efficiently remove the influence of specific data from trained models, is crucial for upholding data privacy regulations like the ``right to be forgotten". However, existing research predominantly evaluates unlearning methods on relatively balanced forget sets. This overlooks a common real-world scenario where data to be forgotten, such as a user's activity records, follows a long-tailed distribution. Our work is the first to investigate this critical research gap. We find that in such long-tailed settings, existing methods suffer from two key issues: \textit{Heterogeneous Unlearning Deviation} and \textit{Skewed Unlearning Deviation}. To address these challenges, we propose FaLW, a plug-and-play, instance-wise dynamic loss reweighting method. FaLW innovatively assesses the unlearning state of each sample by comparing its predictive probability to the distribution of unseen data from the same class. Based on this, it uses a forgetting-aware reweighting scheme, modulated by a balancing factor, to adaptively adjust the unlearning intensity for each sample. Extensive experiments demonstrate that FaLW achieves superior performance.
Received — 17 February 2026 ⏭

OmniVideoBench: Towards Audio-Visual Understanding Evaluation for Omni MLLMs

✇cs.AI, q-bio.NC updates on arXiv.org
By: Caorui Li · Yu Chen · Yiyan Ji · Jin Xu · Zhenyu Cui · Shihao Li · Yuanxing Zhang · Wentao Wang · Zhenghao Song · Dingling Zhang · Ying He · Haoxiang Liu · Yuxuan Wang · Qiufeng Wang · Jiafu Tang · Zhenhe Wu · Jiehui Luo · Zhiyu Pan · Weihao Xie · Chenchen Zhang · Zhaohui Wang · Jiayi Tian · Yanghai Wang · Zhe Cao · Minxin Dai · Ke Wang · Runzhe Wen · Yinghao Ma · Yaning Pan · Sungkyun Chang · Termeh Taheri · Haiwen Xia · Christos Plachouras · Emmanouil Benetos · Yizhi Li · Ge Zhang · Jian Yang · Tianhao Peng · Zili Wang · Minghao Liu · Junran Peng · Zhaoxiang Zhang · Jiaheng Liu
17 February 2026 at 13:00
arXiv:2510.10689v2 Announce Type: replace Abstract: Recent advances in multimodal large language models (MLLMs) have demonstrated substantial potential in video understanding. However, existing benchmarks fail to comprehensively evaluate synergistic reasoning capabilities across audio and visual modalities, often neglecting either one of the modalities or integrating them in a logically inconsistent manner. To bridge this gap, we introduce OmniVideoBench, a large-scale and rigorously designed benchmark dedicated to assessing synergistic audio-visual understanding, with a strong emphasis on modality complementarity and logical consistency. Specifically, OmniVideoBench comprises 1000 high-quality question-answer(QA) pairs, each annotated with step-by-step reasoning traces, derived from 628 diverse videos ranging from several seconds to 30 minutes, and manually verified to guarantee complete correctness and uniqueness. Moreover, OmniVideoBench encompasses 13 carefully designed question types, covering temporal reasoning, spatial localization, counting, causal inference, summarization, and beyond, thereby capturing the essential challenges of video understanding. Evaluation of multiple MLLMs on OmniVideoBench reveals a pronounced gap between model performance and human reasoning, with open-source models lagging significantly behind their closed-source counterparts, underscoring the inherent difficulty of genuine audio-visual reasoning. We will release OmniVideoBench to foster the development of MLLMs with stronger and more generalizable reasoning capabilities.
There are no more articles
❌