❌

Normal view

Received — 10 September 2026 ⏭

Phase-Aware Spatial-Frequency Fusion for Few-Shot Fine-Grained Image Classification

✇cs.AI, q-bio.NC updates on arXiv.org
By: Ruiling Liu · Linyue Zhang · Wenyi Zeng · Jiamiao Lu · Weichuang Zhang · Changming Sun · Zejun Zhang · Xiao Zhao
10 September 2026 at 12:00
arXiv:2609.03829v2 Announce Type: replace-cross Abstract: Few-shot fine-grained image classification (FSFGIC) aims to classify similar images with limited labeled examples. This work highlights the critical yet underutilized role of phase information in capturing structural relationships within an image. This study introduces a novel plug-and-play amplitude-phase integration (API) module that effectively combines local and global frequency amplitude and phase information for obtaining more comprehensive feature descriptors. Additionally, a dedicated network, named PSF-Net, is proposed that adaptively fuses phase-based spatial and frequency information for FSFGIS. The designed PSF-Net can be easily integrated into standard episodic training architectures for end-to-end training from scratch. Extensive experiments on five public datasets demonstrate that the method outperforms existing state-of-the-art benchmarks.
Received — 27 May 2026 ⏭

OSDTW: Optimal Shared Depth and Task Weighting for Long-Tailed Recognition

✇cs.AI, q-bio.NC updates on arXiv.org
By: Chang Chu · Qingyue Zhang · Shao-Lun Huang · Junxiong Zheng
26 May 2026 at 12:00
arXiv:2605.24969v1 Announce Type: cross Abstract: Long-tailed recognition suffers from a persistent head--tail trade-off: improving tail performance often degrades head accuracy and can increase training instability. Despite strong empirical results from re-weighting, decoupled training, and multi-expert methods, key design choices about representation sharing between head and tail classes and supervision weighting across class groups remain largely heuristic. In this work, we propose OSDTW, a principled task-decomposition framework that partitions the original single-label recognition problem into a head task and a tail task, implemented with a shared encoder and task-specific decoders. To handle the mutual exclusivity and statistical dependence between the two label groups, we introduce a factorized model and show that the resulting Kullback--Leibler divergence-based generalization error can be written as the sum of task-wise terms up to an additive constant, yielding a well-defined task-wise objective. We further develop a three-stage training pipeline: independent task training to estimate task-wise optima and the Fisher information matrix, weighted joint training to learn a shared encoder, and branch assembly to construct the final decoupled model. Under a block-diagonal Fisher approximation, we derive a computable second-order expansion of the expected generalization error, decomposing it into encoder variance, encoder bias, and decoder variance. This bias--variance decomposition provides a computable proxy to select the shared depth and task weights, enabling efficient hyper-parameter search. Experiments on standard long-tailed benchmarks demonstrate the effectiveness of the proposed approach over strong baselines.

An Orally Deliverable, Food-Compatible Lyophilized Recombinant Whole-Cell Catalyst for Alcohol-Associated Liver Injury

✇Omics in Gastric
By: Fan Li · Meng-Yue Zhang · Xiao-Le Shan · Cai-Yun Wang · Ying-Ying Wu · Shuang Li · Shi-Qiao Xu · Yi-Xuan Zhang
4 May 2026 at 18:00

Microorganisms. 2026 Mar 26;14(4):746. doi: 10.3390/microorganisms14040746.

ABSTRACT

Effective oral interventions for alcohol-induced metabolic stress and liver injury remain limited. Pre-absorptive gastrointestinal alcohol handling is gaining interest as a non-pharmacological strategy to reduce hepatic burden. In this study, we developed a formulation-integrated, food-compatible lyophilized recombinant whole-cell catalyst based on Escherichia coli Nissle 1917 engineered to express alcohol dehydrogenase and acetaldehyde dehydrogenase. Rather than focusing exclusively on strain-level genetic modification, the engineered cells were protected by lyophilization combined with a food-grade chitosan-alginate layer-by-layer coating, forming an artificial cell wall designed to enhance survivability during oral delivery. The formulation resisted simulated gastric acid, sodium taurocholate, and ethanol, retained enzymatic activity after storage, and demonstrated formulation stability. In alcohol-exposed mice, oral administration reduced blood ethanol and acetaldehyde levels, improved liver biochemical parameters, attenuated hepatic steatosis, and partially restored oxidative stress indicators. Integrated multi-omics analyses indicated coordinated gut-associated metabolic and inflammatory responses to alcohol and intervention, rather than a single dominant pathway. These findings provide hypothesis-generating evidence; causality remains to be established. Overall, this study demonstrates a proof-of-concept, food-compatible lyophilized recombinant whole-cell catalyst that integrates enzymatic function with formulation stability and gastrointestinal resilience, highlighting an applied, food-compatible microbial framework for exploring alcohol-related metabolic stress.

PMID:42075143 | PMC:PMC13119499 | DOI:10.3390/microorganisms14040746

Received — 8 April 2026 ⏭

Search, Do not Guess: Teaching Small Language Models to Be Effective Search Agents

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yizhou Liu · Qi Sun · Yulin Chen · Siyue Zhang · Chen Zhao
7 April 2026 at 12:00
arXiv:2604.04651v1 Announce Type: new Abstract: Agents equipped with search tools have emerged as effective solutions for knowledge-intensive tasks. While Large Language Models (LLMs) exhibit strong reasoning capabilities, their high computational cost limits practical deployment for search agents. Consequently, recent work has focused on distilling agentic behaviors from LLMs into Small Language Models (SLMs). Through comprehensive evaluation on complex multi-hop reasoning tasks, we find that despite possessing less parametric knowledge, SLMs invoke search tools less frequently and are more prone to hallucinations. To address this issue, we propose \policy, a lightweight fine-tuning approach that explicitly trains SLMs to reliably retrieve and generate answers grounded in retrieved evidence. Compared to agent distillation from LLMs, our approach improves performance by 17.3 scores on Bamboogle and 15.3 scores on HotpotQA, achieving LLM-level results across benchmarks. Our further analysis reveals that adaptive search strategies in SLMs often degrade performance, highlighting the necessity of consistent search behavior for reliable reasoning.
Received — 4 April 2026 ⏭

Unified Optimization of Source Weights and Transfer Quantities in Multi-Source Transfer Learning: An Asymptotic Framework

✇cs.AI, q-bio.NC updates on arXiv.org
By: Qingyue Zhang · Chang Chu · Haohao Fu · Tianren Peng · Yanru Wu · Guanbo Huang · Yang Li · Shao-Lun Huang
3 April 2026 at 12:00
arXiv:2601.10779v2 Announce Type: replace-cross Abstract: In multi-source transfer learning, a key challenge lies in how to appropriately differentiate and utilize heterogeneous source tasks. However, existing multi-source methods typically focus on optimizing either the source weights or the amount of transferred samples, largely neglecting their joint consideration. In this work, we propose a theoretical framework, Unified Optimization of Weights and Quantities (UOWQ), that jointly determines the optimal source weights and transfer quantities for each source task. Specifically, the framework formulates multi-source transfer learning as a parameter estimation problem based on an asymptotic analysis of a Kullback--Leibler divergence--based generalization error measure, leading to two main theoretical findings: 1) using all available source samples is always optimal when the weights are properly adjusted; 2) the optimal source weights are characterized by a principled optimization problem whose structure explicitly incorporates the Fisher information, parameter discrepancy, parameter dimensionality, and transfer quantities. Building on the theoretical results, we further propose a practical algorithm for multi-source transfer learning, and extend it to multi-task learning settings where each task simultaneously serves as both a source and a target. Extensive experiments on real-world benchmarks, including DomainNet and Office-Home, demonstrate that UOWQ consistently outperforms strong baselines. The results validate both the theoretical predictions and the practical effectiveness of our framework.
Received — 2 April 2026 ⏭

MindCube: Spatial Mental Modeling from Limited Views

✇cs.AI, q-bio.NC updates on arXiv.org
By: Qineng Wang · Baiqiao Yin · Pingyue Zhang · Jianshu Zhang · Kangrui Wang · Zihan Wang · Jieyu Zhang · Keshigeyan Chandrasegaran · Han Liu · Ranjay Krishna · Saining Xie · Jiajun Wu · Li Fei-Fei · Manling Li
1 April 2026 at 12:00
arXiv:2506.21458v2 Announce Type: replace Abstract: Can Vision-Language Models (VLMs) imagine the full scene from just a few views, like humans do? Humans form spatial mental models naturally, internal representations of unseen space, to reason about layout, perspective, and motion. Our MindCube benchmark with 21,154 questions across 3,268 images exposes this critical gap, where existing VLMs exhibit near-random performance. Using MindCube, we systematically evaluate how well VLMs build robust spatial mental models through representing positions (cognitive mapping), orientations (perspective-taking), and dynamics (mental simulation for "what-if" movements). We then explore three approaches to help approximate spatial mental models in VLMs, focusing on incorporating unseen intermediate views, natural language reasoning chains, and cognitive maps. The significant improvement comes from a synergistic approach, "map-then-reason", that jointly trains the model to first generate a cognitive map and then reason upon it. By training models to reason over these internal maps, we boosted accuracy from 37.8% to 57.8% (+20.0%). Adding reinforcement learning pushed performance even further to 61.3% (+23.5%). Our key insight is that such scaffolding of spatial mental models, actively constructing and utilizing internal structured spatial representations with flexible reasoning processes, significantly improves understanding of unobservable space.
Received — 26 March 2026 ⏭

Agent Audit: A Security Analysis System for LLM Agent Applications

✇cs.AI, q-bio.NC updates on arXiv.org
By: Haiyue Zhang · Yi Nian · Yue Zhao
25 March 2026 at 12:00
arXiv:2603.22853v1 Announce Type: cross Abstract: What should a developer inspect before deploying an LLM agent: the model, the tool code, the deployment configuration, or all three? In practice, many security failures in agent systems arise not from model weights alone, but from the surrounding software stack: tool functions that pass untrusted inputs to dangerous operations, exposed credentials in deployment artifacts, and over-privileged Model Context Protocol (MCP) configurations. We present Agent Audit, a security analysis system for LLM agent applications. Agent Audit analyzes Python agent code and deployment artifacts through an agent-aware pipeline that combines dataflow analysis, credential detection, structured configuration parsing, and privilege-risk checks. The system reports findings in terminal, JSON, and SARIF formats, enabling direct integration with local development workflows and CI/CD pipelines. On a benchmark of 22 samples with 42 annotated vulnerabilities, Agent Audit detects 40 vulnerabilities with 6 false positives, substantially improving recall over common SAST baselines while maintaining sub-second scan times. Agent Audit is open source and installable via pip, making security auditing accessible for agent systems. In the live demonstration, attendees scan vulnerable agent repositories and observe how Agent Audit identifies security risks in tool functions, prompts, and more. Findings are linked to source locations and configuration paths, and can be exported into VS Code and GitHub Code Scanning for interactive inspection.
Received — 17 March 2026 ⏭

Federated Hierarchical Clustering with Automatic Selection of Optimal Cluster Numbers

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yue Zhang · Chuanlong Qiu · Xinfa Liao · Yiqun Zhang
16 March 2026 at 12:00
arXiv:2603.12684v1 Announce Type: cross Abstract: Federated Clustering (FC) is an emerging and promising solution in exploring data distribution patterns from distributed and privacy-protected data in an unsupervised manner. Existing FC methods implicitly rely on the assumption that clients are with a known number of uniformly sized clusters. However, the true number of clusters is typically unknown, and cluster sizes are naturally imbalanced in real scenarios. Furthermore, the privacy-preserving transmission constraints in federated learning inevitably reduce usable information, making the development of robust and accurate FC extremely challenging. Accordingly, we propose a novel FC framework named Fed-$k^*$-HC, which can automatically determine an optimal number of clusters $k^*$ based on the data distribution explored through hierarchical clustering. To obtain the global data distribution for $k^*$ determination, we let each client generate micro-subclusters. Their prototypes are then uploaded to the server for hierarchical merging. The density-based merging design allows exploring clusters of varying sizes and shapes, and the progressive merging process can self-terminate according to the neighboring relationships among the prototypes to determine $k^*$. Extensive experiments on diverse datasets demonstrate the FC capability of the proposed Fed-$k^*$-HC in accurately exploring a proper number of clusters.

SkillsBench: Benchmarking How Well Agent Skills Work Across Diverse Tasks

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xiangyi Li · Wenbo Chen · Yimin Liu · Shenghan Zheng · Xiaokun Chen · Yifeng He · Yubo Li · Bingran You · Haotian Shen · Jiankai Sun · Shuyi Wang · Binxu Li · Qunhong Zeng · Di Wang · Xuandong Zhao · Yuanli Wang · Roey Ben Chaim · Zonglin Di · Yipeng Gao · Junwei He · Yizhuo He · Liqiang Jing · Luyang Kong · Xin Lan · Jiachen Li · Songlin Li · Yijiang Li · Yueqian Lin · Xinyi Liu · Xuanqing Liu · Haoran Lyu · Ze Ma · Bowei Wang · Runhui Wang · Tianyu Wang · Wengao Ye · Yue Zhang · Hanwen Xing · Yiqi Xue · Steven Dillmann · Han-chung Lee
16 March 2026 at 12:00
arXiv:2602.12670v3 Announce Type: replace Abstract: Agent Skills are structured packages of procedural knowledge that augment LLM agents at inference time. Despite rapid adoption, there is no standard way to measure whether they actually help. We present SkillsBench, a benchmark of 86 tasks across 11 domains paired with curated Skills and deterministic verifiers. Each task is evaluated under three conditions: no Skills, curated Skills, and self-generated Skills. We test 7 agent-model configurations over 7,308 trajectories. Curated Skills raise average pass rate by 16.2 percentage points(pp), but effects vary widely by domain (+4.5pp for Software Engineering to +51.9pp for Healthcare) and 16 of 84 tasks show negative deltas. Self-generated Skills provide no benefit on average, showing that models cannot reliably author the procedural knowledge they benefit from consuming. Focused Skills with 2--3 modules outperform comprehensive documentation, and smaller models with Skills can match larger models without them.
Received — 14 March 2026 ⏭

A Lightweight Traffic Map for Efficient Anytime LaCAM*

✇cs.AI, q-bio.NC updates on arXiv.org
By: Bojie Shen · Yue Zhang · Zhe Chen · Daniel Harabor
10 March 2026 at 12:00
arXiv:2603.07891v1 Announce Type: new Abstract: Multi-Agent Path Finding (MAPF) aims to compute collision-free paths for multiple agents and has a wide range of practical applications. LaCAM*, an anytime configuration-based solver, currently represents the state of the art. Recent work has explored the use of guidance paths to steer LaCAM* toward configurations that avoid traffic congestion, thereby improving solution quality. However, existing approaches rely on Frank-Wolfe-style optimization that repeatedly invokes single-agent search before executing LaCAM*, resulting in substantial computational overhead for large-scale problems. Moreover, the guidance path is static and primarily beneficial for finding the first solution in LaCAM*. To address these limitations, we propose a new approach that leverages LaCAM*'s ability to construct a dynamic, lightweight traffic map during its search. Experimental results demonstrate that our method achieves higher solution quality than state-of-the-art guidance-path approaches across two MAPF variants.

The Struggle Between Continuation and Refusal: A Mechanistic Analysis of the Continuation-Triggered Jailbreak in LLMs

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yonghong Deng · Zhen Yang · Ping Jian · Xinyue Zhang · Zhongbin Guo · Chengzhi Li
10 March 2026 at 12:00
arXiv:2603.08234v1 Announce Type: new Abstract: With the rapid advancement of large language models (LLMs), the safety of LLMs has become a critical concern. Despite significant efforts in safety alignment, current LLMs remain vulnerable to jailbreaking attacks. However, the root causes of such vulnerabilities are still poorly understood, necessitating a rigorous investigation into jailbreak mechanisms across both academic and industrial communities. In this work, we focus on a continuation-triggered jailbreak phenomenon, whereby simply relocating a continuation-triggered instruction suffix can substantially increase jailbreak success rates. To uncover the intrinsic mechanisms of this phenomenon, we conduct a comprehensive mechanistic interpretability analysis at the level of attention heads. Through causal interventions and activation scaling, we show that this jailbreak behavior primarily arises from an inherent competition between the model's intrinsic continuation drive and the safety defenses acquired through alignment training. Furthermore, we perform a detailed behavioral analysis of the identified safety-critical attention heads, revealing notable differences in the functions and behaviors of safety heads across different model architectures. These findings provide a novel mechanistic perspective for understanding and interpreting jailbreak behaviors in LLMs, offering both theoretical insights and practical implications for improving model safety.
Received — 11 March 2026 ⏭

AutoFigure-Edit: Generating Editable Scientific Illustration

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhen Lin · Qiujie Xie · Minjun Zhu · Shichen Li · Qiyao Sun · Enhao Gu · Yiran Ding · Ke Sun · Fang Guo · Panzhong Lu · Zhiyuan Ning · Yixuan Weng · Yue Zhang
10 March 2026 at 12:00
arXiv:2603.06674v1 Announce Type: cross Abstract: High-quality scientific illustrations are essential for communicating complex scientific and technical concepts, yet existing automated systems remain limited in editability, stylistic controllability, and efficiency. We present AutoFigure-Edit, an end-to-end system that generates fully editable scientific illustrations from long-form scientific text while enabling flexible style adaptation through user-provided reference images. By combining long-context understanding, reference-guided styling, and native SVG editing, it enables efficient creation and refinement of high-quality scientific illustrations. To facilitate further progress in this field, we release the video at https://youtu.be/10IH8SyJjAQ, full codebase at https://github.com/ResearAI/AutoFigure-Edit and provide a website for easy access and interactive use at https://deepscientist.cc/.

Give Them an Inch and They Will Take a Mile:Understanding and Measuring Caller Identity Confusion in MCP-Based AI Systems

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yuhang Huang · Boyang Ma · Biwei Yan · Xuelong Dai · Yechao Zhang · Minghui Xu · Kaidi Xu · Yue Zhang
10 March 2026 at 12:00
arXiv:2603.07473v1 Announce Type: cross Abstract: The Model Context Protocol (MCP) is an open and standardized interface that enables large language models (LLMs) to interact with external tools and services, and is increasingly adopted by AI agents. However, the security of MCP-based systems remains largely unexplored.In this work, we conduct a large-scale security analysis of MCP servers integrated within MCP clients. We show that treating MCP servers as trusted entities without authenticating the caller identity is fundamentally insecure. Since MCP servers often cannot distinguish who is invoking a request, a single authorization decision may implicitly grant access to multiple, potentially untrusted callers.Our empirical study reveals that most MCP servers rely on persistent authorization states, allowing tool invocations after an initial authorization without re-authentication, regardless of the caller. In addition, many MCP servers fail to enforce authentication at the per-tool level, enabling unauthorized access to sensitive operations.These findings demonstrate that one-time authorization and server-level trust significantly expand the attack surface of MCP-based systems, highlighting the need for explicit caller authentication and fine-grained authorization mechanisms.

SkillsBench: Benchmarking How Well Agent Skills Work Across Diverse Tasks

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xiangyi Li · Wenbo Chen · Yimin Liu · Shenghan Zheng · Xiaokun Chen · Yifeng He · Yubo Li · Bingran You · Haotian Shen · Jiankai Sun · Shuyi Wang · Binxu Li · Qunhong Zeng · Di Wang · Xuandong Zhao · Yuanli Wang · Roey Ben Chaim · Zonglin Di · Yipeng Gao · Junwei He · Yizhuo He · Liqiang Jing · Luyang Kong · Xin Lan · Jiachen Li · Songlin Li · Yijiang Li · Yueqian Lin · Xinyi Liu · Xuanqing Liu · Haoran Lyu · Ze Ma · Bowei Wang · Runhui Wang · Tianyu Wang · Wengao Ye · Yue Zhang · Hanwen Xing · Yiqi Xue · Steven Dillmann · Han-chung Lee
10 March 2026 at 12:00
arXiv:2602.12670v2 Announce Type: replace Abstract: Agent Skills are structured packages of procedural knowledge that augment LLM agents at inference time. Despite rapid adoption, there is no standard way to measure whether they actually help. We present SkillsBench, a benchmark of 86 tasks across 11 domains paired with curated Skills and deterministic verifiers. Each task is evaluated under three conditions: no Skills, curated Skills, and self-generated Skills. We test 7 agent-model configurations over 7,308 trajectories. Curated Skills raise average pass rate by 16.2 percentage points(pp), but effects vary widely by domain (+4.5pp for Software Engineering to +51.9pp for Healthcare) and 16 of 84 tasks show negative deltas. Self-generated Skills provide no benefit on average, showing that models cannot reliably author the procedural knowledge they benefit from consuming. Focused Skills with 2--3 modules outperform comprehensive documentation, and smaller models with Skills can match larger models without them.
Received — 5 March 2026 ⏭

RLJP: Legal Judgment Prediction via First-Order Logic Rule-enhanced with Large Language Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yue Zhang · Zhiliang Tian · Shicheng Zhou · Haiyang Wang · Wenqing Hou · Yuying Liu · Xuechen Zhao · Minlie Huang · Ye Wang · Bin Zhou
5 March 2026 at 13:00
arXiv:2505.21281v2 Announce Type: replace Abstract: Legal Judgment Prediction (LJP) is a pivotal task in legal AI. Existing semantic-enhanced LJP models integrate judicial precedents and legal knowledge for high performance. But they neglect legal reasoning logic, a critical component of legal judgments requiring rigorous logical analysis. Although some approaches utilize legal reasoning logic for high-quality predictions, their logic rigidity hinders adaptation to case-specific logical frameworks, particularly in complex cases that are lengthy and detailed. This paper proposes a rule-enhanced legal judgment prediction framework based on first-order logic (FOL) formalism and comparative learning (CL) to develop an adaptive adjustment mechanism for legal judgment logic and further enhance performance in LJP. Inspired by the process of human exam preparation, our method follows a three-stage approach: first, we initialize judgment rules using the FOL formalism to capture complex reasoning logic accurately; next, we propose a Confusion-aware Contrastive Learning (CACL) to dynamically optimize the judgment rules through a quiz consisting of confusable cases; finally, we utilize the optimized judgment rules to predict legal judgments. Experimental results on two public datasets show superior performance across all metrics. The code is publicly available{https://anonymous.4open.science/r/RLJP-FDF1}.

Practical FP4 Training for Large-Scale MoE Models on Hopper GPUs

✇cs.AI, q-bio.NC updates on arXiv.org
By: Wuyue Zhang · Chongdong Huang · Chunbo You · Cheng Gu · Fengjuan Wang · Mou Sun
4 March 2026 at 13:00
arXiv:2603.02731v1 Announce Type: cross Abstract: Training large-scale Mixture-of-Experts (MoE) models is bottlenecked by activation memory and expert-parallel communication, yet FP4 training remains impractical on Hopper-class GPUs without native MXFP4 or NVFP4 support. In this work, we present a training recipe that enables MXFP4 efficiency for MoE models on Hopper architectures without native 4-bit computation support. A central challenge is to integrate FP4 into an existing BF16/FP8 hybrid training pipeline without incurring costly precision round-trips (e.g., FP4 $\leftrightarrow$ BF16 $\leftrightarrow$ FP8). We address this challenge by introducing direct FP8-to-FP4 quantization and de-quantization, together with scaling-aware FP4 row-wise to column-wise conversion, enabling FP4 activations and expert-parallel communication with minimal overhead. Core MoE computations are executed in FP8, while activations and expert-parallel communication are compressed using MXFP4, achieving substantial memory and bandwidth savings without degrading convergence. At the 671B parameter scale, our method achieves end-to-end training performance comparable to strong FP8 baselines, while reducing peak activation memory by 14.8\% (11.8 GB) and improving training throughput by 12.5\%, from 1157 to 1302 tokens per GPU per second. These results show that FP4 efficiency can be practically realized for large-scale MoE training through careful software-hardware co-design, even without native FP4 Tensor Core support.
Received — 25 February 2026 ⏭

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.
❌