Search arXivSearch

arXiv · 2506.16494

Manifold Learning for Personalized and Label-Free Detection of Cardiac Arrhythmias

Abstract

Electrocardiograms (ECGs) provide non-invasive measurements of heart activity and are established tools for detecting cardiac arrhythmias. Although supervised machine learning has emerged as a promising approach for automated heartbeat classification, substantial variations in ECG signals across individuals and leads, combined with inconsistent labeling standards and dataset biases, make it difficult to develop generalizable models. Dimensionality reduction maps high-dimensional data into a lower-dimensional space while preserving the underlying structure, enabling visualization and pattern discovery. Conventional methods, e.g., principal component analysis, prioritize large variances and typically overlook subtle yet clinically relevant patterns. Here, we show that nonlinear dimensionality reduction (NLDR) algorithms, e.g., t-SNE and UMAP, can identify medically relevant features in ECG signals without pretraining or prior information. Using the MIT-BIH Arrhythmia Database, we show that: a) applying NLDR to a mixed population of heartbeats reveals inter-individual morphological differences, as signals from the same person cluster together in latent spaces; and b) applying NLDR to heartbeats of a single individual separates normal beats from arrhythmias into distinct clusters, identifiable in an unsupervised manner. To our knowledge, this is the first systematic evaluation of NLDR for unsupervised arrhythmia detection. Both UMAP and t-SNE achieved trustworthiness scores >=0.95, indicating that local neighborhoods are well preserved in the embedding. Classification on 2D embeddings outperforms the original high-dimensional space, with a k-NN classifier discriminating individual recordings with >=80% accuracy and identifying arrhythmias with median accuracy >=98% and median F1-score >=85%. These results show that NLDR holds much promise for cardiac monitoring and personalized healthcare.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amir Reza Vazifeh, Jason W. Fleischer. 2026-04-23. Manifold Learning for Personalized and Label-Free Detection of Cardiac Arrhythmias. https://doi.org/10.1016/j.imu.2026.101770

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG