CORTEXA
← Browse
arxivstat.MEcs.LGstat.ML2026-07-23

Longitudinal Random Forests for Sparse and Irregular Response Trajectories

Yangsheng Wang, Xiaotian Dai, Haoda Fu, Guifang Fu

Longitudinal studies often collect data at sparse, irregular, and unequally spaced time points. Such heterogeneity is often driven by subject-specific covariates, yet existing methods have been restricted to a scalar endpoint value, completely neglecting the underlying response trajectories. We propose a novel Longitudinal Random Forest (LRF) framework that leverages tree-based ensemble machine learning with adaptive node-wise longitudinal trajectory estimation. The LRF framework makes five methodological contributions. it captures each subject's individual response trajectory while simultaneously accommodating within-node correlation, between-node heterogeneity, and nonlinear and interactive covariate effects. It introduces a novel trajectory-based splitting criterion that maximizes trajectory separation while incorporating a size-weighted penalty; it provides two variants, Principal Analysis by Conditional Expectation (LRF-PACE) and adaptive linear mixed-effects models (LRF-adaptiveLMM), which employ nonparametric and semiparametric node-wise smoothers, respectively, while learning covariate effects in a data-driven manner. It provides a comprehensive interpretation of covariates using both the classical trajectory-based permutation variable importance measure (PVIM) and a newly proposed finite-way interaction frequency count, and it not only predicts entire trajectories for new subjects but also forecasts future trajectories for existing subjects. Extensive simulation studies demonstrate that LRF achieves superior performance over several competing methods, even under severe sparsity. The practical significance of the LRF framework lies in its ability to address five important clinical questions.

View free PDFSource page

Related papers

arxivstat.MEcs.CVcs.LGq-bio.QMstat.ML2026-07-21

Deep Shape Regression for Planar Curves with Multimodal Covariates

Manuel Pfeuffer, Roshan Prakash Rane, Hadya Yassin, Kerstin Ritter, Sonja Greven

The shape of a planar curve is the geometric information that remains once translation, rotation, scale and reparametrisation are removed and is of interest in many health applications, e.g. in neuroimaging. We propose a deep shape regression model for open planar curves that adm…

View free PDFSource page
arxivstat.MEcs.LGmath.STstat.ML2026-07-17

Aggregation of Statistical Evidence under Exchangeability

Antonin Schrab, Rajen Shah, Arthur Gretton, Ilmun Kim

We study aggregation of statistical evidence under unknown and potentially complex dependence using group-invariance. Building on permutation-based constructions that treat transformed datasets as exchangeable units, we aggregate evidence across statistics for each transformed da…

View free PDFSource page
arxivstat.MLcs.LGstat.COstat.ME2026-07-16

cGAP: Generalized Association Plots with HOMALS-Guided Heatmaps for Visualization of High-Dimensional Categorical Data

Chun-houh Chen, Shun-Chuan Chang, Chiun-How Kao, Yi-Ju Lee, Shang-Ying Shiu, Yin-Jing Tien, et al.

High-dimensional categorical data arise in genetics, biomedicine, and the social sciences, yet visualization tools for such data remain far less developed than those for continuous variables. Existing methods either scale poorly, rely heavily on low-dimensional displays detached…

View free PDFSource page
arxivcs.LGcs.DSstat.MEstat.ML2026-07-21

Total Variation Distance Estimation in Autoregressive Models

Eric Price, Kevin Tian, Zhiyang Xun, Yusong Zhu

Modern LLM deployments use a number of implementation choices and inference optimizations (e.g., batching, custom kernels, and quantization) on top of fixed weights, so two engines serving "the same model" can produce meaningfully different distributions. We study the problem of…

View free PDFSource page
arxivstat.MLcs.LGmath.NAstat.ME2026-07-17

Cluster-Aware Matching via Laplacian Optimal Transport

Gabriel Samberg, YoonHaeng Hur, Yuehaw Khoo, Nir Sharon

In many applications of matching, the point clouds to be matched are not merely unstructured sets of points but rather samples from distributions with an intrinsic cluster structure. In such cases, as individual points are often interchangeable within a coherent region, finding a…

View free PDFSource page