❌

Normal view

Received — 2 April 2026 ⏭

A Rational Account of Categorization Based on Information Theory

✇cs.AI, q-bio.NC updates on arXiv.org
By: Christophe J. MacLellan · Karthik Singaravadivelan · Xin Lian · Zekun Wang · Pat Langley
1 April 2026 at 12:00
arXiv:2603.29895v1 Announce Type: new Abstract: We present a new theory of categorization based on an information-theoretic rational analysis. To evaluate this theory, we investigate how well it can account for key findings from classic categorization experiments conducted by Hayes-Roth and Hayes-Roth (1977), Medin and Schaffer (1978), and Smith and Minda (1998). We find that it explains the human categorization behavior at least as well (or better) than the independent cue and context models (Medin & Schaffer, 1978), the rational model of categorization (Anderson, 1991), and a hierarchical Dirichlet process model (Griffiths et al., 2007).

A monocyte-centered framework for predicting immunochemotherapy efficacy in lung squamous cell carcinoma patients

✇Omics In Lung
By: Jiangnan Zhao · Zijin Wang · Manyu Xiao · Yeyuan Zhang · Boxin Liu · Silin Chen · Yiping Tian · Dongqing Lv · Pingli Wang · Hai Song · Yuefeng Wu · Jian Liu · Kai Wang
30 March 2026 at 18:00

EMBO Mol Med. 2026 Mar 30. doi: 10.1038/s44321-026-00410-y. Online ahead of print.

ABSTRACT

Lung cancer is the leading cause of cancer-related mortality worldwide, with lung squamous cell carcinoma (LUSC) comprising 20-30% of cases. Immunochemotherapy (IC) is the standard first-line treatment for advanced LUSC, yet reliable predictors of therapeutic response remain unavailable. Using single-cell multi-omics profiling of paired pre- and post-treatment tumor and blood samples, we observed that patients responding to IC exhibited significantly higher baseline levels of peripheral blood monocytes, tumor-infiltrating classical monocytes, and APOBEC3A+ monocytes across both compartments compared with non-responders. These associations were independently validated in additional cohorts using routine complete blood count testing and multiplex immunofluorescence analysis of native tumor tissues. Our findings reveal monocyte-related parameters as clinically accessible indicators that link systemic immunity with the tumor microenvironment and hold promise for predicting IC responsiveness in patients with LUSC.

PMID:41912871 | DOI:10.1038/s44321-026-00410-y

A monocyte-centered framework for predicting immunochemotherapy efficacy in lung squamous cell carcinoma patients

✇(Multiomics OR Omics) AND (Lung OR gastric OR Hepatocellular)
By: Jiangnan Zhao · Zijin Wang · Manyu Xiao · Yeyuan Zhang · Boxin Liu · Silin Chen · Yiping Tian · Dongqing Lv · Pingli Wang · Hai Song · Yuefeng Wu · Jian Liu · Kai Wang
30 March 2026 at 18:00

EMBO Mol Med. 2026 Mar 30. doi: 10.1038/s44321-026-00410-y. Online ahead of print.

ABSTRACT

Lung cancer is the leading cause of cancer-related mortality worldwide, with lung squamous cell carcinoma (LUSC) comprising 20-30% of cases. Immunochemotherapy (IC) is the standard first-line treatment for advanced LUSC, yet reliable predictors of therapeutic response remain unavailable. Using single-cell multi-omics profiling of paired pre- and post-treatment tumor and blood samples, we observed that patients responding to IC exhibited significantly higher baseline levels of peripheral blood monocytes, tumor-infiltrating classical monocytes, and APOBEC3A+ monocytes across both compartments compared with non-responders. These associations were independently validated in additional cohorts using routine complete blood count testing and multiplex immunofluorescence analysis of native tumor tissues. Our findings reveal monocyte-related parameters as clinically accessible indicators that link systemic immunity with the tumor microenvironment and hold promise for predicting IC responsiveness in patients with LUSC.

PMID:41912871 | DOI:10.1038/s44321-026-00410-y

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.

MedCausalX: Adaptive Causal Reasoning with Self-Reflection for Trustworthy Medical Vision-Language Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jianxin Lin · Chunzheng Zhu · Peter J. Kneuertz · Yunfei Bai · Yuan Xue
25 March 2026 at 12:00
arXiv:2603.23085v1 Announce Type: new Abstract: Vision-Language Models (VLMs) have enabled interpretable medical diagnosis by integrating visual perception with linguistic reasoning. Yet, existing medical chain-of-thought (CoT) models lack explicit mechanisms to represent and enforce causal reasoning, leaving them vulnerable to spurious correlations and limiting their clinical reliability. We pinpoint three core challenges in medical CoT reasoning: how to adaptively trigger causal correction, construct high-quality causal-spurious contrastive samples, and maintain causal consistency across reasoning trajectories. To address these challenges, we propose MedCausalX, an end-to-end framework explicitly models causal reasoning chains in medical VLMs. We first introduce the CRMed dataset providing fine-grained anatomical annotations, structured causal reasoning chains, and counterfactual variants that guide the learning of causal relationships beyond superficial correlations. Building upon CRMed, MedCausalX employs a two-stage adaptive reflection architecture equipped with $\langle$causal$\rangle$ and $\langle$verify$\rangle$ tokens, enabling the model to autonomously determine when and how to perform causal analysis and verification. Finally, a trajectory-level causal correction objective optimized through error-attributed reinforcement learning refines the reasoning chain, allowing the model to distinguish genuine causal dependencies from shortcut associations. Extensive experiments on multiple benchmarks show that MedCausalX consistently outperforms state-of-the-art methods, improving diagnostic consistency by +5.4 points, reducing hallucination by over 10 points, and attaining top spatial grounding IoU, thereby setting a new standard for causally grounded medical reasoning.
Received — 17 March 2026 ⏭

MetaKE: Meta-learning Aligned Knowledge Editing via Bi-level Optimization

✇cs.AI, q-bio.NC updates on arXiv.org
By: Shuxin Liu · Ou Wu
16 March 2026 at 12:00
arXiv:2603.12677v1 Announce Type: cross Abstract: Knowledge editing (KE) aims to precisely rectify specific knowledge in Large Language Models (LLMs) without disrupting general capabilities. State-of-the-art methods suffer from an open-loop control mismatch. We identify a critical "Semantic-Execution Disconnect": the semantic target is derived independently without feedback from the downstream's feasible region. This misalignment often causes valid semantic targets to fall within the prohibited space, resulting in gradient truncation and editing failure. To bridge this gap, we propose MetaKE (Meta-learning Aligned Knowledge Editing), a new framework that reframes KE as a bi-level optimization problem. Departing from static calculation, MetaKE treats the edit target as a learnable meta-parameter: the upper-level optimizer seeks a feasible target to maximize post-edit performance, while the lower-level solver executes the editing. To address the challenge of differentiating through complex solvers, we derive a Structural Gradient Proxy, which explicitly backpropagates editability constraints to the target learning phase. Theoretical analysis demonstrates that MetaKE automatically aligns the edit direction with the model's feasible manifold. Extensive experiments confirm that MetaKE significantly outperforms strong baselines, offering a new perspective on knowledge editing.

Insulin resistance prediction from wearables and routine blood biomarkers

✇Nature - Issue - nature.com science feeds
By: Ahmed A. Metwally · A. Ali Heydari · Daniel McDuff · Alexandru Solot · Zeinab Esmaeilpour · Anthony Z. Faranesh · Menglian Zhou · Girish Narayanswamy · Maxwell A. Xu · Xin Liu · Yuzhe Yang · David B. Savage · Mark Malhotra · Conor Heneghan · Shwetak Patel · Cathy Speed · Javier L. Prieto
16 March 2026 at 08:00

Nature, Published online: 16 March 2026; doi:10.1038/s41586-026-10179-2

A machine-learning model that integrates data from wearable devices (such as smartwatches) with blood biomarkers and demographic data can predict whether someone has insulin resistance, enabling timely lifestyle interventions to prevent progression to type 2 diabetes.
Received — 11 March 2026 ⏭

Property-driven Protein Inverse Folding With Multi-Objective Preference Alignment

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xiaoyang Hou · Junqi Liu · Chence Shi · Xin Liu · Zhi Yang · Jian Tang
10 March 2026 at 12:00
arXiv:2603.06748v1 Announce Type: cross Abstract: Protein sequence design must balance designability, defined as the ability to recover a target backbone, with multiple, often competing, developability properties such as solubility, thermostability, and expression. Existing approaches address these properties through post hoc mutation, inference-time biasing, or retraining on property-specific subsets, yet they are target dependent and demand substantial domain expertise or careful hyperparameter tuning. In this paper, we introduce ProtAlign, a multi-objective preference alignment framework that fine-tunes pretrained inverse folding models to satisfy diverse developability objectives while preserving structural fidelity. ProtAlign employs a semi-online Direct Preference Optimization strategy with a flexible preference margin to mitigate conflicts among competing objectives and constructs preference pairs using in silico property predictors. Applied to the widely used ProteinMPNN backbone, the resulting model MoMPNN enhances developability without compromising designability across tasks including sequence design for CATH 4.3 crystal structures, de novo generated backbones, and real-world binder design scenarios, making it an appealing framework for practical protein sequence design.

Real-Time Aligned Reward Model beyond Semantics

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zixuan Huang · Xin Xia · Yuxi Ren · Jianbin Zheng · Xuefeng Xiao · Hongyan Xie · Li Huaqiu · Songshi Liang · Zhongxiang Dai · Fuzhen Zhuang · Jianxin Li · Yikun Ban · Deqing Wang
10 March 2026 at 12:00
arXiv:2601.22664v3 Announce Type: replace Abstract: Reinforcement Learning from Human Feedback (RLHF) is a pivotal technique for aligning large language models (LLMs) with human preferences, yet it is susceptible to reward overoptimization, in which policy models overfit to the reward model, exploit spurious reward patterns instead of faithfully capturing human intent. Prior mitigations primarily relies on surface semantic information and fails to efficiently address the misalignment between the reward model (RM) and the policy model caused by continuous policy distribution shifts. This inevitably leads to an increasing reward discrepancy, exacerbating reward overoptimization. To address these limitations, we introduce R2M (Real-Time Aligned Reward Model), a novel lightweight RLHF framework. R2M goes beyond vanilla reward models that solely depend on the semantic representations of a pretrained LLM. Instead, it leverages the evolving hidden states of the policy (namely policy feedback) to align with the real-time distribution shift of the policy during the RL process. This work points to a promising new direction for improving the performance of reward models through real-time utilization of feedback from policy models.

How Well Do Multimodal Models Reason on ECG Signals?

✇cs.AI, q-bio.NC updates on arXiv.org
By: Maxwell A. Xu · Harish Haresamudram · Catherine W. Liu · Patrick Langer · Jathurshan Pradeepkumar · Wanting Mao · Sunita J. Ferns · Aradhana Verma · Jimeng Sun · Paul Schmiedmayer · Xin Liu · Daniel McDuff · Emily B. Fox · James M. Rehg
10 March 2026 at 12:00
arXiv:2603.00312v2 Announce Type: replace Abstract: While multimodal large language models offer a promising solution to the "black box" nature of health AI by generating interpretable reasoning traces, verifying the validity of these traces remains a critical challenge. Existing evaluation methods are either unscalable, relying on manual clinician review, or superficial, utilizing proxy metrics (e.g. QA) that fail to capture the semantic correctness of clinical logic. In this work, we introduce a reproducible framework for evaluating reasoning in ECG signals. We propose decomposing reasoning into two distinct, components: (i) Perception, the accurate identification of patterns within the raw signal, and (ii) Deduction, the logical application of domain knowledge to those patterns. To evaluate Perception, we employ an agentic framework that generates code to empirically verify the temporal structures described in the reasoning trace. To evaluate Deduction, we measure the alignment of the model's logic against a structured database of established clinical criteria in a retrieval-based approach. This dual-verification method enables the scalable assessment of "true" reasoning capabilities.

Adaptive Batch-Wise Sample Scheduling for Direct Preference Optimization

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zixuan Huang · Yikun Ban · Lean Fu · Xiaojie Li · Zhongxiang Dai · Jianxin Li · Deqing Wang
10 March 2026 at 12:00
arXiv:2506.17252v4 Announce Type: replace-cross Abstract: Direct Preference Optimization (DPO) has emerged as an effective approach for aligning large language models (LLMs) with human preferences. However, its performance is highly dependent on the quality of the underlying human preference data. To address this bottleneck, prior work has explored various data selection strategies, but these methods often overlook the impact of the evolving states of the language model during the optimization process. In this paper, we introduce a novel problem: Sample Scheduling for DPO, which aims to dynamically and adaptively schedule training samples based on the model's evolving batch-wise states throughout preference optimization. To solve this problem, we propose SamS, an efficient and effective algorithm that adaptively selects samples in each training batch based on the LLM's learning feedback to maximize the potential generalization performance. Notably, without modifying the core DPO algorithm, simply integrating SamS significantly improves performance across tasks, with minimal additional computational overhead. This work points to a promising new direction for improving LLM alignment through batch-wise sample selection, with potential generalization to RLHF and broader supervised learning paradigms.
Received — 5 March 2026 ⏭

Metric-Topology Factorization: A Computational Framework for Hippocampal-Neocortical Intelligence

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xin Li
5 March 2026 at 13:00
arXiv:2603.03362v1 Announce Type: new Abstract: The brain achieves stability and plasticity in a topologically complex, shifting world through Metric-Topology Factorization (MTF), separating discrete topological indexing for context selection from continuous metric condensation for local inference. Semantically rich environments defy single globally contractive geometries, causing obstructions under shifts, so intelligence factorizes these: the hippocampus provides sparse signatures indexing manifold identity, while the neocortex untangles geometry hierarchically. In the ventral stream, a dynamic-programming-like process quotients symmetries (e.g., translation, scale), transforming non-convex sensory mazes into separable bowls. Offline replay and consolidation amortize transformations for rapid task switching. Dreaming in REM involves stochastic hippocampal traversal to expose and regularize latent structures. Consciousness arises from resolving topological uncertainty into stable embeddings, with awareness for unamortized states. Evolutionarily, transitions like sensorimotor control to language expand topological complexity, demanding advanced indexing-metric separation. Intelligence emerges via recalibrating context-specific geometries, converting global navigation into local dynamics, not deeper search.

Monitoring AI-Modified Content at Scale: A Case Study on the Impact of ChatGPT on AI Conference Peer Reviews

✇cs.AI, q-bio.NC updates on arXiv.org
By: Weixin Liang · Zachary Izzo · Yaohui Zhang · Haley Lepp · Hancheng Cao · Xuandong Zhao · Lingjiao Chen · Haotian Ye · Sheng Liu · Zhi Huang · Daniel A. McFarland · James Y. Zou
4 March 2026 at 13:00
arXiv:2403.07183v3 Announce Type: replace-cross Abstract: We present an approach for estimating the fraction of text in a large corpus which is likely to be substantially modified or produced by a large language model (LLM). Our maximum likelihood model leverages expert-written and AI-generated reference texts to accurately and efficiently examine real-world LLM-use at the corpus level. We apply this approach to a case study of scientific peer review in AI conferences that took place after the release of ChatGPT: ICLR 2024, NeurIPS 2023, CoRL 2023 and EMNLP 2023. Our results suggest that between 6.5% and 16.9% of text submitted as peer reviews to these conferences could have been substantially modified by LLMs, i.e. beyond spell-checking or minor writing updates. The circumstances in which generated text occurs offer insight into user behavior: the estimated fraction of LLM-generated text is higher in reviews which report lower confidence, were submitted close to the deadline, and from reviewers who are less likely to respond to author rebuttals. We also observe corpus-level trends in generated text which may be too subtle to detect at the individual level, and discuss the implications of such trends on peer review. We call for future interdisciplinary work to examine how LLM use is changing our information and knowledge practices.

DiaBlo: Diagonal Blocks Are Sufficient For Finetuning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Selcuk Gurses · Aozhong Zhang · Yanxia Deng · Xun Dong · Xin Li · Naigang Wang · Penghang Yin · Zi Yang
4 March 2026 at 13:00
arXiv:2506.03230v2 Announce Type: replace-cross Abstract: Fine-tuning is a critical step for adapting large language models (LLMs) to domain-specific downstream tasks. To mitigate the substantial computational and memory costs of full-model fine-tuning, Parameter-Efficient Fine-Tuning (PEFT) methods have been proposed to update only a small subset of model parameters. However, performance gaps between PEFT approaches and full-model fine-tuning still exist. In this work, we present DiaBlo, a simple yet effective PEFT approach that updates only the diagonal blocks of selected model weight matrices. Unlike Low-Rank Adaptation (LoRA) and its variants, DiaBlo eliminates the need for low-rank matrix products, thereby avoiding the reliance on auxiliary initialization schemes or customized optimization strategies to improve convergence. This design leads to stable and robust convergence while maintaining comparable memory efficiency and training speed to LoRA. Moreover, we provide theoretical guarantees showing that, under mild low-rank conditions, DiaBlo is more expressive than LoRA in the linear problem and converges to a stationary point of the general nonlinear full fine-tuning. Through extensive experiments across a range of tasks, including commonsense reasoning, arithmetic reasoning, code generation, and safety alignment, we show that fine-tuning only diagonal blocks is sufficient for strong and consistent performance. DiaBlo not only achieves competitive accuracy but also preserves high memory efficiency and fast fine-tuning speed. Codes are available at https://github.com/ziyangjoy/DiaBlo.

xLLM Technical Report

✇cs.AI, q-bio.NC updates on arXiv.org
By: Tongxuan Liu · Tao Peng · Peijun Yang · Xiaoyang Zhao · Xiusheng Lu · Weizhe Huang · Zirui Liu · Xiaoyu Chen · Zhiwei Liang · Jun Xiong · Donghe Jin · Minchao Zhang · Jinrong Guo · Yingxu Deng · Xu Zhang · Xianzhe Dong · Siqi Wang · Siyu Wu · Yu Wu · Zihan Tang · Yuting Zeng · Yanshu Wang · Jinguang Liu · Meng Kang · Menxin Li · Yunlong Wang · Yiming Liu · Xiaolong Ma · Yifan Wang · Yichen Zhang · Jinrun Yin · Keyang Zheng · Jiawei Yin · Jun Zhang · Ziyue Wang · Xiaobo Lin · Liangyu Liu · Liwei Lan · Yang Liu · Chunhua Peng · Han Liu · Songcheng Ren · Xuezhu Wang · Yunheng Shen · Yi Wang · Guyue Liu · Yitao Hu · Hui Chen · Tong Yang · Hailong Yang · Jing Li · Guiguang Ding · Ke Zhang
4 March 2026 at 13:00
arXiv:2510.14686v2 Announce Type: replace-cross Abstract: We introduce xLLM, an intelligent and efficient Large Language Model (LLM) inference framework designed for high-performance, large-scale enterprise-grade serving, with deep optimizations for diverse AI accelerators. To address these challenges, xLLM builds a novel decoupled service-engine architecture. At the service layer, xLLM-Service features an intelligent scheduling module that efficiently processes multimodal requests and co-locates online and offline tasks through unified elastic scheduling to maximize cluster utilization. This module also relies on a workload-adaptive dynamic Prefill-Decode (PD) disaggregation policy and a novel Encode-Prefill-Decode (EPD) disaggregation policy designed for multimodal inputs. Furthermore, it incorporates a distributed architecture to provide global KV Cache management and robust fault-tolerant capabilities for high availability. At the engine layer, xLLM-Engine co-optimizes system and algorithm designs to fully saturate computing resources. This is achieved through comprehensive multi-layer execution pipeline optimizations, an adaptive graph mode and an xTensor memory management. xLLM-Engine also further integrates algorithmic enhancements such as optimized speculative decoding and dynamic EPLB, collectively serving to substantially boost throughput and inference efficiency. Extensive evaluations demonstrate that xLLM delivers significantly superior performance and resource efficiency. Under identical TPOT constraints, xLLM achieves throughput up to 1.7x that of MindIE and 2.2x that of vLLM-Ascend with Qwen-series models, while maintaining an average throughput of 1.7x that of MindIE with Deepseek-series models. xLLM framework is publicly available at https://github.com/jd-opensource/xllm and https://github.com/jd-opensource/xllm-service.

IDER: IDempotent Experience Replay for Reliable Continual Learning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhanwang Liu · Yuting Li · Haoyuan Gao · Yexin Li · Linghe Kong · Lichao Sun · Weiran Huang
4 March 2026 at 13:00
arXiv:2603.00624v2 Announce Type: replace-cross Abstract: Catastrophic forgetting, the tendency of neural networks to forget previously learned knowledge when learning new tasks, has been a major challenge in continual learning (CL). To tackle this challenge, CL methods have been proposed and shown to reduce forgetting. Furthermore, CL models deployed in mission-critical settings can benefit from uncertainty awareness by calibrating their predictions to reliably assess their confidences. However, existing uncertainty-aware continual learning methods suffer from high computational overhead and incompatibility with mainstream replay methods. To address this, we propose idempotent experience replay (IDER), a novel approach based on the idempotent property where repeated function applications yield the same output. Specifically, we first adapt the training loss to make model idempotent on current data streams. In addition, we introduce an idempotence distillation loss. We feed the output of the current model back into the old checkpoint and then minimize the distance between this reprocessed output and the original output of the current model. This yields a simple and effective new baseline for building reliable continual learners, which can be seamlessly integrated with other CL approaches. Extensive experiments on different CL benchmarks demonstrate that IDER consistently improves prediction reliability while simultaneously boosting accuracy and reducing forgetting. Our results suggest the potential of idempotence as a promising principle for deploying efficient and trustworthy continual learning systems in real-world applications.Our code is available at https://github.com/YutingLi0606/Idempotent-Continual-Learning.
Received — 25 February 2026 ⏭

AgentCAT: An LLM Agent for Extracting and Analyzing Catalytic Reaction Data from Chemical Engineering Literature

✇cs.AI, q-bio.NC updates on arXiv.org
By: Wei Yang · Zihao Liu · Tao Tan · Xiao Hu · Hong Xie · Lulu Li Xin Li · Jianyu Han · Defu Lian · Mao Ye
24 February 2026 at 13:00
arXiv:2602.18479v1 Announce Type: cross Abstract: This paper presents a large language model (LLM) agent named AgentCAT, which extracts and analyzes catalytic reaction data from chemical engineering papers, %and supports natural language based interactive analysis of the extracted data. AgentCAT serves as an alternative to overcome the long-standing data bottleneck in chemical engineering field, and its natural language based interactive data analysis functionality is friendly to the community. AgentCAT also presents a formal abstraction and challenge analysis of the catalytic reaction data extraction task in an artificial intelligence-friendly manner. This abstraction would help the artificial intelligence community understand this problem and in turn would attract more attention to address it. Technically, the complex catalytic process leads to complicated dependency structure in catalytic reaction data with respect to elementary reaction steps, molecular behaviors, measurement evidence, etc. This dependency structure makes it challenging to guarantee the correctness and completeness of data extraction, as well as representing them for analysis. AgentCAT addresses this challenge and it makes four folds of technical contributions: (1) a schema-governed extraction pipeline with progressive schema evolution, enabling robust data extraction from chemical engineering papers; (2) a dependency-aware reaction-network knowledge graph that links catalysts/active sites, synthesis-derived descriptors, mechanistic claims with evidence, and macroscopic outcomes, preserving process coupling and traceability; (3) a general querying module that supports natural-language exploration and visualization over the constructed graph for cross-paper analysis; (4) an evaluation on $\sim$800 peer-reviewed chemical engineering publications demonstrating the effectiveness of AgentCAT.

Continuous Telemonitoring of Heart Failure using Personalised Speech Dynamics

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yue Pan · Xingyao Wang · Hanyue Zhang · Liwei Liu · Changxin Li · Gang Yang · Rong Sheng · Yili Xia · Ming Chu
24 February 2026 at 13:00
arXiv:2602.19674v1 Announce Type: cross Abstract: Remote monitoring of heart failure (HF) via speech signals provides a non-invasive and cost-effective solution for long-term patient management. However, substantial inter-individual heterogeneity in vocal characteristics often limits the accuracy of traditional cross-sectional classification models. To address this, we propose a Longitudinal Intra-Patient Tracking (LIPT) scheme designed to capture the trajectory of relative symptomatic changes within individuals. Central to this framework is a Personalised Sequential Encoder (PSE), which transforms longitudinal speech recordings into context-aware latent representations. By incorporating historical data at each timestamp, the PSE facilitates a holistic assessment of the clinical trajectory rather than modelling discrete visits independently. Experimental results from a cohort of 225 patients demonstrate that the LIPT paradigm significantly outperforms the classic cross-sectional approaches, achieving a recognition accuracy of 99.7% for clinical status transitions. The model's high sensitivity was further corroborated by additional follow-up data, confirming its efficacy in predicting HF deterioration and its potential to secure patient safety in remote, home-based settings. Furthermore, this work addresses the gap in existing literature by providing a comprehensive analysis of different speech task designs and acoustic features. Taken together, the superior performance of the LIPT framework and PSE architecture validates their readiness for integration into long-term telemonitoring systems, offering a scalable solution for remote heart failure management.

Does Your Reasoning Model Implicitly Know When to Stop Thinking?

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zixuan Huang · Xin Xia · Yuxi Ren · Jianbin Zheng · Xuanda Wang · Zhixia Zhang · Hongyan Xie · Songshi Liang · Zehao Chen · Xuefeng Xiao · Fuzhen Zhuang · Jianxin Li · Yikun Ban · Deqing Wang
24 February 2026 at 13:00
arXiv:2602.08354v2 Announce Type: replace Abstract: Recent advancements in large reasoning models (LRMs) have greatly improved their capabilities on complex reasoning tasks through Long Chains of Thought (CoTs). However, this approach often results in substantial redundancy, impairing computational efficiency and causing significant delays in real-time applications. Recent studies show that longer reasoning chains are frequently uncorrelated with correctness and can even be detrimental to accuracy. In a further in-depth analysis of this phenomenon, we surprisingly uncover and empirically verify that LRMs implicitly know the appropriate time to stop thinking, while this capability is obscured by current sampling paradigms. Motivated by this, we introduce SAGE (Self-Aware Guided Efficient Reasoning), a novel sampling paradigm that unleashes this efficient reasoning potential. Furthermore, integrating SAGE as mixed sampling into group-based reinforcement learning (SAGE-RL) enables SAGE-RL to effectively incorporate SAGE-discovered efficient reasoning patterns into standard pass@1 inference, markedly enhancing both the reasoning accuracy and efficiency of LRMs across multiple challenging mathematical benchmarks.
❌