Search arXivSearch

arXiv · 2608.25073

DeMMO: Longitudinal and Cross-Disease Modelling of Digital Mobility Outcomes via Multi-Task Learning

Abstract

Digital mobility outcomes (DMOs) derived from wearable sensors characterise mobility in daily life and offer a promising means of monitoring disease progression. However, existing DMO studies have typically focused on either a single disease or a single visit. To the best of our knowledge, we are the first to define and study the practical problem of cross-disease longitudinal DMO modelling. We argue that this problem should satisfy at least two requirements. First, the temporal progression of DMOs should be modelled within each disease, as mobility-limiting diseases evolve over time. Second, multiple mobility-limiting diseases should be modelled jointly, as different diseases affect different aspects of human mobility. To address this problem, we propose DeMMO, an interpretable framework for longitudinal, multi-disease, and multi-outcome learning. Its central technical contribution is an interpretable cross-disease and cross-outcome relation-learning mechanism that infers signed relations directly from learned longitudinal DMO-outcome mappings, thereby enabling selective information sharing across cohorts without requiring paired participants. We evaluate DeMMO on the recently released, large-scale, multicentre Mobilise-D dataset, which presents a challenging modelling setting involving longitudinal observations, multiple clinical outcomes, and four participant-disjoint cohorts representing distinct mobility-limiting diseases. Compared with eight strong structural longitudinal and deep-regression baselines, DeMMO achieves the best overall predictive performance and outperforms the baselines for most individual outcomes. Stability selection further identifies reliable longitudinal DMO patterns that can inform subsequent clinical validation and disease monitoring. The implementation code is available at https://github.com/menghui-zhou/DeMMO.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Menghui Zhou, Zhipeng Yuan, Vitaveska Lanfranchi, Po Yang. 2026-09-03. DeMMO: Longitudinal and Cross-Disease Modelling of Digital Mobility Outcomes via Multi-Task Learning. https://arxiv.org/abs/2608.25073

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

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