Generalized Deep Regression for Repeated Measurements
Abstract
In this paper, we study the estimation of a marginal regression function from independent units with repeated binary, count, or continuous responses using ReLU deep neural networks. In the model, we assume that the dependence is generated by an unobserved random mean function within each unit. We then fit a neural network with a convex generalized regression loss. We show an oracle inequality by separating conditional measurement variation from between-unit variation. In addition, we prove that with n units and m measurements per unit, ReLU networks can attain an integrated mean squared error of order n−1+(nm)−2β/(2β+d), up to logarithmic factors, over β-Hölder classes. We also derive a weighted oracle inequality for unequal cluster sizes and a rate for compositionally smooth functions. For pointwise ensemble inference, we give a projection central limit theorem and prove infinitesimal jackknife consistency under an explicit asymptotic linearity condition. Simulations and real data examples are provided to support our theoretical findings and practical implications.
Related
- Difference-based variance estimators with repeated measurements
- When Repeated Measurements Hurt Tabular Foundation Models
- Temporal Degeneracy Limits Message Passing Decoding of QLDPC Codes Under Repeated Noisy Syndrome Measurements
- A penalized logistic generalized regression estimator
- A Generalized Ridge Regression and Convolutional LASSO
BibTeX
@misc{li2026generalized,
title = {{Generalized Deep Regression for Repeated Measurements}},
author = {Kexuan Li},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.25605},
eprint = {2609.25605},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.25605},
}
RIS
TY - UNPB
TI - Generalized Deep Regression for Repeated Measurements
AU - Kexuan Li
PY - 2026
DA - 2026/09/22
PB - arXiv
DO - 10.48550/arxiv.2609.25605
UR - https://arxiv.org/abs/2609.25605
AB - In this paper, we study the estimation of a marginal regression function from independent units with repeated binary, count, or continuous responses using ReLU deep neural networks. In the model, we assume that the dependence is generated by an unobserved random mean function within each unit. We then fit a neural network with a convex generalized regression loss. We show an oracle inequality by separating conditional measurement variation from between-unit variation. In addition, we prove that with n units and m measurements per unit, ReLU networks can attain an integrated mean squared error of order n^−1+(nm)^−2β/(2β+d), up to logarithmic factors, over β-Hölder classes. We also derive a weighted oracle inequality for unequal cluster sizes and a rate for compositionally smooth functions. For pointwise ensemble inference, we give a projection central limit theorem and prove infinitesimal jackknife consistency under an explicit asymptotic linearity condition. Simulations and real data examples are provided to support our theoretical findings and practical implications.
ER -