SearcharxivSearch

arXiv · 2507.11723

Smooth tensor decomposition with application to ambulatory blood pressure monitoring data

Abstract

Ambulatory blood pressure monitoring (ABPM) enables continuous measurement of blood pressure and heart rate over 24 hours and is increasingly used in clinical studies. However, ABPM data are often reduced to summary statistics, such as means or medians, which obscure temporal features like nocturnal dipping and individual chronotypes. Functional data analysis methods better capture these temporal dynamics but typically treat each ABPM measurement separately, limiting their ability to leverage correlations among matched measurements. In this work, we observe that aligning ABPM data along measurement type, time, and patient ID lends itself to a tensor representation--a multidimensional array. Although tensor learning has shown great potential in other fields, it has not been applied to ABPM data. Existing tensor learning approaches often lack temporal smoothing constraints, assume no missing data, and can be computationally demanding. To address these limitations, we propose a novel smooth tensor decomposition method that incorporates a temporal smoothing penalty and accommodates missing data. We also develop an automatic procedure for selecting the optimal smoothing parameter and tensor ranks. Simulation studies demonstrate that our method reliably reconstructs smooth temporal trends from noisy, incomplete data. Application to ABPM data from patients with concurrent obstructive sleep apnea and type 2 diabetes uncovers clinically relevant associations between patient characteristics and ABPM measurements, which are missed by summary-based approaches.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leyuan Qian, R. Nisha Aurora, Naresh M. Punjabi, Irina Gaynanova. 2025-07-15. Smooth tensor decomposition with application to ambulatory blood pressure monitoring data. https://arxiv.org/abs/2507.11723

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

KEEP EXPLORING

Related papers

Surprise Reduction and Nullification in Bayesian and Inverse Bayesian Inference under Ambiguous Prediction-Error Attribution

In non-stationary environments, prediction errors may signal environmental change or transient outliers, and adaptive systems must track such changes without overreacting to outliers. We distinguish surprise reduction, which updates beliefs to fit observations, from surprise nullification, which weakens constraints imposed by the predictive structure, and formalize both within Bayesian and inverse Bayesian (BIB) inference. Belief and likelihood updates are derived from variational objectives sharing a nullification strength, determined endogenously by minimizing surprise under the candidate post-update predictive distribution. In the Gaussian case, nullification expands belief and likelihood variances by a common factor relative to standard Bayesian updating, leaving the ratio unchanged. BIB thus defers attribution of the prediction error, committing to neither latent-state change nor observation-process uncertainty. The nullification strength is carried over as a candidate and is maintained or released according to the predictive surprise of the next observation. In a mean estimation task with outliers and changepoints, no scanned parameter setting of a Sage-Husa-type adaptive Kalman filter, fixed-strength BIB variant, or belief-forgetting-only variant outperforms BIB in both changepoint tracking and post-outlier stability. An oracle-informed reduced Bayesian model tracks changepoints better but is less stable after outliers. Although BIB maintains no explicit hypotheses about changepoints or outliers, it generates event-dependent dynamics. The learning rate increases after changepoints, whereas after outliers, nullification is released, and this increase is suppressed. Deferring attribution and letting subsequent observations differentiate the responses may constitute a principle of adaptive inference in non-stationary environments.

stat.ME

Generalized Ridge Refitting for the Lasso and Prediction Improvement Bounds

We study a class of Lasso based estimators obtained by applying a quadratic correction on the Lasso equicorrelation set. The penalty matrix determines both the magnitude and geometry of the correction and contains, among other cases, the isotropic Lasso--Ridge correction, least squares refitting, Gram proportional interpolation between the Lasso and least squares, and coordinate specific penalties. We first derive a closed form representation and isolate the positive gain component of the resulting prediction improvement. We then control the remaining stochastic linear term in expectation by localizing the random signed equicorrelation model around a deterministic reference support. This yields a finite sample expectation bound that explicitly accounts for the randomness induced by Lasso model selection. The resulting decomposition provides a unified framework for understanding when Lasso based quadratic corrections can improve prediction.

stat.ME

Discretization in covariate-adaptive randomization: gains and losses

Covariate-adaptive randomization(CAR) is widely implemented in clinical trials to balance prognostic covariates across treatment arms. Continuous covariates are often discretized into strata in practice, yet their consequences are not clearly understood. This paper provides a comprehensive study of the impact of discretization on both the CAR design process and the inferential results thereafter. We establish the asymptotic properties of both imbalance measures and treatment effect estimators under discretized and non-discretized settings. Practical recommendations are given on when and how discretization should be employed. We show that discretization in design is generally recommended, as it enhances robustness against model misspecification. However, if the true model is known, the most efficient strategy is to balance covariates according to that model in the design. The theoretical results are corroborated by extensive simulation studies and an empirical application to a diabetes trial dataset. Together, the results clarify the gains and losses of discretization in CAR and pave the way for learning impact of discretization to other designs and beyond.

stat.ME