❌

Normal view

Received — 15 September 2026 ⏭

ASTRIL-MPC: Autonomous Traversal Framework of Articulated Tracked Robots with Language-Guided Neural-Kinematic MPC

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhenfeng Gan · Yanbo Chen · Lirong Che · Junbo Tan · Xueqian Wang
14 September 2026 at 12:00
arXiv:2609.13083v1 Announce Type: cross Abstract: In urban search and rescue, articulated tracked robots (ATRs) must traverse structured but contact-rich environments such as stairwells and cluttered building interiors. Reliable autonomy remains challenging because robot-terrain interaction (RTI) is hybrid and discontinuous, and effective flipper-track coordination is difficult to model analytically. We present ASTRIL-MPC, a language-guided neural kinematics model predictive control (MPC) framework for autonomous traversal. A learned kinematics model predicts short-horizon task-state increments from a height sequence and recent trajectories; NMPC plans with multi-objective costs and strict feasibility constraints; and a large language model (LLM) proposes bounded updates to selected weights and bounds through a safety-checked interface with range clipping, rate limiting, and consistency checks. The compiled predictor enables a full control cycle within 100 ms. Across three traversal tasks and a multi-height generalization setting, ASTRIL-MPC improves an aggregate traversal-quality score by up to 71% over a non-adaptive NMPC and by 67% over a PPO baseline, while eliminating measurable collision impacts during descent. These results indicate that combining learned kinematics, optimization-based planning, and language-guided retuning yields data-efficient and robust autonomy for articulated tracked robots.
Received — 27 May 2026 ⏭

DemoEvolve: Overcoming Sparse Feedback in Agentic Harness Evolution with Demonstrations

✇cs.AI, q-bio.NC updates on arXiv.org
By: Lirong Che · Yuzhe yang · Peiwen lin · Chuang wang · Xueqian wang · Jian su
26 May 2026 at 12:00
arXiv:2605.24539v1 Announce Type: new Abstract: Agent harness evolution improves frozen language-model agents by modifying the executable structures around them. We study this paradigm as a form of sample-efficient fast adaptation: instead of updating model weights, an agent can acquire task-specific competence by changing its external harness, while leaving the base model's general capabilities intact. Prior work shows that self-generated rollouts can support harness search, suggesting that agents may acquire new task competence through practice. Yet in long-horizon stochastic environments, self-practice becomes fragile: rewards are sparse, outcomes are high-variance, and failures are hard to attribute to concrete harness mechanisms. We introduce DemoEvolve, a demonstration-bootstrapped approach to harness evolution. When reward-only search is too broad and noisy, competent human trajectories serve as expert reference experience for the coding proposer, guiding harness-level diagnosis and editing. Experiments on Liar's Dice show that self-rollout evolution can work when episodes are short and failures are attributable. In contrast, Balatro exposes a harder long-horizon stochastic regime, where self-rollout evolution is misled by sparse feedback and candidate-selection noise, while tutorial-like textual knowledge alone does not yield stable improvement. Under the same limited budget, DemoEvolve produces more effective and auditable harness edits and achieves better performance. Overall, demonstrations make sparse-feedback harness evolution more diagnosable, localizable, and stable.

Turning Stale Gradients into Stable Gradients: Coherent Coordinate Descent with Implicit Landscape Smoothing for Lightweight Zeroth-Order Optimization

✇cs.AI, q-bio.NC updates on arXiv.org
By: Chen Liang · Xiatao Sun · Qian Wang · Daniel Rakita
26 May 2026 at 12:00
arXiv:2605.14373v2 Announce Type: replace-cross Abstract: Zeroth-Order (ZO) optimization is pivotal for scenarios where backpropagation is unavailable, such as memory-constrained on-device learning and black-box optimization. However, existing methods face a stark trade-off: they are either sample-inefficient (e.g., standard finite differences) or suffer from high variance due to randomized estimation (e.g., random subspace methods). In this work, we propose Coherent Coordinate Descent (CoCD), a deterministic, sample-efficient, and budget-aware ZO optimizer. Theoretically, we formalize the notion of gradient coherence and demonstrate that CoCD is equivalent to Block Cyclic Coordinate Descent (BCCD) with ``warm starts,'' effectively converting historical (stale) gradients from a liability into a computational asset. This mechanism enables $O(1)$ query complexity per step while maintaining global descent directions. Furthermore, we derive error bounds revealing a counter-intuitive insight: larger finite-difference step sizes can induce an implicit smoothing effect on the optimization landscape by reducing the effective smoothness constant, thereby improving convergence stability. Experiments on MLP, CNN, and ResNet architectures (up to 270k parameters) demonstrate that CoCD significantly outperforms BCCD in terms of sample efficiency and convergence loss/accuracy, and exhibits superior stability over randomized ZO methods. Our results suggest that deterministic, structure-aware updates offer a superior alternative to randomization for lightweight ZO optimization.

Multi-omics integration identifies ribosome biogenesis-active macrophage subpopulation and its key gene GNL2 in driving liver hepatocellular carcinoma progression and mechanisms

✇Omics in Hepatocellular
By: Yajie Qi · Kun Li · Pincheng Li · Jianyu Yan · Shuyue Feng · Dan Wan · Ke Du · Xiao Liang · Fan Yang · Erzheng Zhou · Na Huang · Qian Wang · Nanbin Liu
14 May 2026 at 18:00

Cancer Cell Int. 2026 May 14. doi: 10.1186/s12935-026-04330-2. Online ahead of print.

ABSTRACT

BACKGROUND: Liver hepatocellular carcinoma (LIHC) is a common malignancy, yet the core genes driving its progression and potential therapeutic targets remain insufficiently explored. Ribosome biogenesis (RB) is a critical biological process linked to various cancers; however, its systematic role in LIHC remains unclear.

METHODS: This study integrated LIHC single-cell RNA-Seq, bulk RNA-Seq, and spatial transcriptomic data with ribosome biogenesis-related gene sets to construct a single-cell atlas of LIHC. Weighted Gene Co-expression Network Analysis (WGCNA) was employed to characterize myeloid cell subsets. Furthermore, an LIHC prognostic risk model based on RB-related genes was developed using 117 machine-learning algorithm combinations. Key findings were subsequently corroborated through experimental validation and clinical sample analysis.

RESULTS: We identified a distinct macrophage subpopulation with high ribosome biogenesis activity, termed ribosome biogenesis-active macrophages (RAMs). These cells exhibited strong communication with inflammatory macrophages, potentially mediated by MIF-related receptor-ligand interactions. We further constructed an 8-gene prognostic model (PA2G4, GNL2, PWP1, DDX49, NOC4L, GDI2, CST7, and RCL1), which showed good predictive performance. Drug sensitivity analysis suggested that the high-risk group may be more responsive to several agents, including docetaxel. Among these genes, GNL2 was selected for further investigation. Elevated GNL2 expression was associated with increased stemness features in myeloid cells. Molecular docking analysis identified several candidate compounds with potential binding affinity to GNL2. Functionally, GNL2 knockdown in macrophages reduced TGF-β and TNF-α expression and was associated with decreased proliferation, migration, and invasion of LIHC cells.

CONCLUSION: We identified a highly active ribosome biogenesis-macrophage subpopulation (RAM), and constructed a robust risk model to aid in the diagnosis, prognosis, and treatment of LIHC. GNL2 is associated with increased expression of TGF-β and TNF-α and may contribute to LIHC progression.

PMID:42135716 | DOI:10.1186/s12935-026-04330-2

Received — 13 April 2026 ⏭

TREM2-mediated microglial phagocytosis of inhibitory synapses contributes to prolonged FS-induced epileptogenesis

✇Cell Death Discovery nature.com science feeds
By: Xiaoqian Wang · Hua Zhou · Yujie Zhai · Yunrong Zhang · Yao Cheng · Yi Yuan · Wenxiao Cao · Anqing Gao · Mengshuang Liu · Qiaoyun Wang · Hongliu Sun
11 April 2026 at 08:00

Cell Death Discovery, Published online: 11 April 2026; doi:10.1038/s41420-026-03118-7

TREM2-mediated microglial phagocytosis of inhibitory synapses contributes to prolonged FS-induced epileptogenesis
Received — 8 April 2026 ⏭

Stabilizing Unsupervised Self-Evolution of MLLMs via Continuous Softened Retracing reSampling

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yunyao Yu · Zhengxian Wu · Zhuohong Chen · Hangrui Xu · Zirui Liao · Xiangwen Deng · Zhifang Liu · Senyuan Shi · Haoqian Wang
7 April 2026 at 12:00
arXiv:2604.03647v1 Announce Type: cross Abstract: In the unsupervised self-evolution of Multimodal Large Language Models, the quality of feedback signals during post-training is pivotal for stable and effective learning. However, existing self-evolution methods predominantly rely on majority voting to select the most frequent output as the pseudo-golden answer, which may stem from the model's intrinsic biases rather than guaranteeing the objective correctness of the reasoning paths. To counteract the degradation, we propose \textbf{C}ontinuous \textbf{S}oftened \textbf{R}etracing re\textbf{S}ampling (\textbf{CSRS}) in MLLM self-evolution. Specifically, we introduce a Retracing Re-inference Mechanism (\textbf{RRM}) that the model re-inferences from anchor points to expand the exploration of long-tail reasoning paths. Simultaneously, we propose Softened Frequency Reward (\textbf{SFR}), which replaces binary rewards with continuous signals, calibrating reward based on the answers' frequency across sampled reasoning sets. Furthermore, incorporated with Visual Semantic Perturbation (\textbf{VSP}), CSRS ensures the model prioritizes mathematical logic over visual superficiality. Experimental results demonstrate that CSRS significantly enhances the reasoning performance of Qwen2.5-VL-7B on benchmarks such as MathVision. We achieve state-of-the-art (SOTA) results in unsupervised self-evolution on geometric tasks. Our code is avaible at https://github.com/yyy195/CSRS.
Received — 4 April 2026 ⏭

Learning to Learn-at-Test-Time: Language Agents with Learnable Adaptation Policies

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhanzhi Lou · Hui Chen · Yibo Li · Qian Wang · Bryan Hooi
3 April 2026 at 12:00
arXiv:2604.00830v2 Announce Type: replace-cross Abstract: Test-Time Learning (TTL) enables language agents to iteratively refine their performance through repeated interactions with the environment at inference time. At the core of TTL is an adaptation policy that updates the actor policy based on experience from previous episodes, thereby improving future behavior. Existing methods rely on fixed, hand-crafted adaptation policies rather than optimizing them for downstream improvement. We argue that optimal adaptation policies should be learned from task environments, not hand-engineered based on human intuition. To achieve this, we introduce Meta-TTL, a framework that formulates the discovery of effective adaptation policies as a bi-level optimization problem. Within this framework, the inner loop executes the standard TTL process, measuring how effectively a candidate adaptation policy helps an agent correct errors across sequential episodes. Guided by the agent's performance, the outer loop employs evolutionary search over a diverse distribution of training tasks to iteratively refine the adaptation policy. We evaluate Meta-TTL on Jericho and WebArena-Lite across both in-distribution (ID) and out-of-distribution (OOD) settings, using multiple meta-agent backbones. Results on both benchmarks show that Meta-TTL consistently outperforms hand-crafted baselines, suggesting that the optimized adaptation policy encodes transferable strategies that generalize beyond the training task distribution.

PRET is a few-shot system for pan-cancer recognition without example training

✇Nature Cancer
By: Yi Li · Ziyu Ning · Tianqi Xiang · Qixiang Zhang · Zhihao Lin · Min Yi · Feiyan Feng · Baozhen Zeng · Xuexia Qian · Lu Sun · Jiace Qin · Ling Xiang · Chao Fan · Tian Qin · Qian Wang · Xiu-Wu Bian · Kun-Hsing Yu · Kang Zhang · Qingling Zhang · Xiaomeng Li
3 April 2026 at 08:00

Nature Cancer, Published online: 03 April 2026; doi:10.1038/s43018-026-01141-2

Li et al. present PRET, a few-shot system for pan-cancer detection not requiring model fine-tuning, validated it in multicenter datasets and found that it outperformed existing approaches across tasks and pathologists in lymph node metastasis detection.

Metabolite-gated vascular contractility switch: OXGR1 activation mechanism enables agonist therapy for rosacea erythema

✇Cell
By: Wenqin Xiao · Yan Zhu · Xinjie Tang · Kongkai Zhu · Weifeng Zhang · Mengting Chen · Kui Cai · San Xu · Zheng Wu · Mei Wang · Jiayi Liu · Linglong Long · Zixin Tan · Aike Wu · Songqi Zhou · Zhixiang Zhao · Yan Tang · Yingxue Huang · Ben Wang · Fangfen Liu · Qian Wang · Fan Yang · Dan Jian · Wei Shi · Hongfu Xie · Xiang Chen · Lulu Guo · Zhili Deng · Jinpeng Sun · Ji Li
5 March 2026 at 08:00
Xiao et al. identify α-KG as a rosacea-associated metabolite that activates the OXGR1-Gq-MYL9 axis in the vascular smooth muscle cells to boost contractility and suppress pathological vasodilation underlying erythema. Cryo-EM reveals a bipartite-acid pocket of OXGR1 that enables structure-guided development of A-1, a selective agonist that alleviates erythema in rosacea-like models.
Received — 2 April 2026 ⏭

Deconstruction of a spino-brain–spinal cord circuit that drives chronic pain

✇Nature - Issue - nature.com science feeds
By: Qian Wang · Joo Han Lee · Gregory Nachtrab · Yuan Yuan · Lei Yuan · Wei Qi · Manuel A. Mohr · Jing Xiong · Mark A. Horowitz · Xiaoke Chen
1 April 2026 at 08:00

Nature, Published online: 01 April 2026; doi:10.1038/s41586-026-10296-y

In mice, a circuit between the spinal cord and various regions of the brain, centring on spinal-cord-projecting neurons in the rostral ventromedial medulla, has a key role in driving chronic pain.

A unified deep learning framework for cross-platform harmonization of multi-tracer PET quantification in neurodegenerative disease

✇npj Digital Medicine
By: Jing Wang · Aocheng Zhong · Qian Xu · Haolin Huang · Yuhua Zhu · Jiaying Lu · Min Wang · Jiehui Jiang · Chengyang Li · Ming Ni · Kaicong Sun · Yihui Guan · Jie Lu · Mei Tian · Dinggang Shen · Huiwei Zhang · Qian Wang · Chuantao Zuo
30 March 2026 at 08:00

npj Digital Medicine, Published online: 30 March 2026; doi:10.1038/s41746-026-02570-0

A unified deep learning framework for cross-platform harmonization of multi-tracer PET quantification in neurodegenerative disease
Received — 26 March 2026 ⏭

PhotoAgent: A Robotic Photographer with Spatial and Aesthetic Understanding

✇cs.AI, q-bio.NC updates on arXiv.org
By: Lirong Che · Zhenfeng Gan · Yanbo Chen · Junbo Tan · Xueqian Wang
25 March 2026 at 12:00
arXiv:2603.22796v1 Announce Type: cross Abstract: Embodied agents for creative tasks like photography must bridge the semantic gap between high-level language commands and geometric control. We introduce PhotoAgent, an agent that achieves this by integrating Large Multimodal Models (LMMs) reasoning with a novel control paradigm. PhotoAgent first translates subjective aesthetic goals into solvable geometric constraints via LMM-driven, chain-of-thought (CoT) reasoning, allowing an analytical solver to compute a high-quality initial viewpoint. This initial pose is then iteratively refined through visual reflection within a photorealistic internal world model built with 3D Gaussian Splatting (3DGS). This ``mental simulation'' replaces costly and slow physical trial-and-error, enabling rapid convergence to aesthetically superior results. Evaluations confirm that PhotoAgent excels in spatial reasoning and achieves superior final image quality.

When Models Judge Themselves: Unsupervised Self-Evolution for Multimodal Reasoning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhengxian Wu · Kai Shi · Chuanrui Zhang · Zirui Liao · Jun Yang · Ni Yang · Qiuying Peng · Luyuan Zhang · Hangrui Xu · Tianhuang Su · Zhenyu Yang · Haonan Lu · Haoqian Wang
25 March 2026 at 12:00
arXiv:2603.21289v2 Announce Type: replace-cross Abstract: Recent progress in multimodal large language models has led to strong performance on reasoning tasks, but these improvements largely rely on high-quality annotated data or teacher-model distillation, both of which are costly and difficult to scale. To address this, we propose an unsupervised self-evolution training framework for multimodal reasoning that achieves stable performance improvements without using human-annotated answers or external reward models. For each input, we sample multiple reasoning trajectories and jointly model their within group structure. We use the Actor's self-consistency signal as a training prior, and introduce a bounded Judge based modulation to continuously reweight trajectories of different quality. We further model the modulated scores as a group level distribution and convert absolute scores into relative advantages within each group, enabling more robust policy updates. Trained with Group Relative Policy Optimization (GRPO) on unlabeled data, our method consistently improves reasoning performance and generalization on five mathematical reasoning benchmarks, offering a scalable path toward self-evolving multimodal models. The code are available at https://github.com/OPPO-Mente-Lab/LLM-Self-Judge.

Hijacking ERAD for targeted degradation of transmembrane proteins

✇Cell
By: Haikun Song · Wei Wang · Tingfang Mei · Huiwen Zheng · Keni Ning · Xiaofan Liu · Siulam Cheung · Zhiyuan Cao · Danqi Sheng · Xiaohan Mai · Haoran Zhu · Guankai Guo · Shuaimeng Liu · Rongkai Wei · Qian Wang · Yu Cao · Yu Ding · Yiyan Fei · Rui Liu · Motoyuki Hattori · Chunquan Sheng · Boxun Lu
19 March 2026 at 08:00
Development of an ERAD-hijacking technology overcomes the challenges of current targeted protein degradation approaches to achieve degradation of transmembrane proteins.
Received — 11 March 2026 ⏭

Prompt-SID: Learning Structural Representation Prompt via Latent Diffusion for Single-Image Denoising

✇cs.AI, q-bio.NC updates on arXiv.org
By: Huaqiu Li · Wang Zhang · Xiaowan Hu · Tao Jiang · Zikang Chen · Haoqian Wang
10 March 2026 at 12:00
arXiv:2502.06432v3 Announce Type: replace-cross Abstract: Many studies have concentrated on constructing supervised models utilizing paired datasets for image denoising, which proves to be expensive and time-consuming. Current self-supervised and unsupervised approaches typically rely on blind-spot networks or sub-image pairs sampling, resulting in pixel information loss and destruction of detailed structural information, thereby significantly constraining the efficacy of such methods. In this paper, we introduce Prompt-SID, a prompt-learning-based single image denoising framework that emphasizes preserving of structural details. This approach is trained in a self-supervised manner using downsampled image pairs. It captures original-scale image information through structural encoding and integrates this prompt into the denoiser. To achieve this, we propose a structural representation generation model based on the latent diffusion process and design a structural attention module within the transformer-based denoiser architecture to decode the prompt. Additionally, we introduce a scale replay training mechanism, which effectively mitigates the scale gap from images of different resolutions. We conduct comprehensive experiments on synthetic, real-world, and fluorescence imaging datasets, showcasing the remarkable effectiveness of Prompt-SID. Our code will be released at https://github.com/huaqlili/Prompt-SID.

LD-RPS: Zero-Shot Unified Image Restoration via Latent Diffusion Recurrent Posterior Sampling

✇cs.AI, q-bio.NC updates on arXiv.org
By: Huaqiu Li · Yong Wang · Tongwen Huang · Hailang Huang · Haoqian Wang · Xiangxiang Chu
10 March 2026 at 12:00
arXiv:2507.00790v4 Announce Type: replace-cross Abstract: Unified image restoration is a significantly challenging task in low-level vision. Existing methods either make tailored designs for specific tasks, limiting their generalizability across various types of degradation, or rely on training with paired datasets, thereby suffering from closed-set constraints. To address these issues, we propose a novel, dataset-free, and unified approach through recurrent posterior sampling utilizing a pretrained latent diffusion model. Our method incorporates the multimodal understanding model to provide sematic priors for the generative model under a task-blind condition. Furthermore, it utilizes a lightweight module to align the degraded input with the generated preference of the diffusion model, and employs recurrent refinement for posterior sampling. Extensive experiments demonstrate that our method outperforms state-of-the-art methods, validating its effectiveness and robustness. Our code and data are available at https://github.com/AMAP-ML/LD-RPS.
Received — 17 February 2026 ⏭

LLM DNA: Tracing Model Evolution via Functional Representations

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhaomin Wu · Haodong Zhao · Ziyang Wang · Jizhou Guo · Qian Wang · Bingsheng He
17 February 2026 at 13:00
arXiv:2509.24496v2 Announce Type: replace-cross Abstract: The explosive growth of large language models (LLMs) has created a vast but opaque landscape: millions of models exist, yet their evolutionary relationships through fine-tuning, distillation, or adaptation are often undocumented or unclear, complicating LLM management. Existing methods are limited by task specificity, fixed model sets, or strict assumptions about tokenizers or architectures. Inspired by biological DNA, we address these limitations by mathematically defining LLM DNA as a low-dimensional, bi-Lipschitz representation of functional behavior. We prove that LLM DNA satisfies inheritance and genetic determinism properties and establish the existence of DNA. Building on this theory, we derive a general, scalable, training-free pipeline for DNA extraction. In experiments across 305 LLMs, DNA aligns with prior studies on limited subsets and achieves superior or competitive performance on specific tasks. Beyond these tasks, DNA comparisons uncover previously undocumented relationships among LLMs. We further construct the evolutionary tree of LLMs using phylogenetic algorithms, which align with shifts from encoder-decoder to decoder-only architectures, reflect temporal progression, and reveal distinct evolutionary speeds across LLM families.
There are no more articles
❌