analiza aiqbench
This paper advances theoretical machine learning by establishing convergence rates for ReLU deep neural networks in generalized regression tasks involving repeated measurements. The authors provide rigorous proofs of oracle inequalities and central limit theorems that separate within-unit measurement noise from between-unit variation, offering new insights into handling clustered data structures. These findings are significant for researchers developing robust statistical learning models where standard independence assumptions do not hold.
Generalized Deep Regression for Repeated Measurements
arXiv:2609.25605v1 Announce Type: cross 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\beta/(2\beta+d)}$, up to logarithmic factors, over $\beta$-H\"older 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.
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\beta/(2\beta+d)}$, up to logarithmic factors, over $\beta$-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.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2609.25605 [stat.ML]
(or arXiv:2609.25605v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2609.25605 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 255 cuvinte
Subiecte conexe

Why do models task game?
AI Alignment Forum · 6 aug. 2026
Performance Profiling on AMD GPUs – Part 5: Profiling-Driven Kernel Optimization with an AI Code-Assist Tool
AMD · 16 iul. 2026

Echoverse: Deep, evolving environments for computer-use agents
Microsoft Research · 30 iul. 2026

Reviewing failure modes in science as we prepare for AI researchers
LessWrong · 8 oct. 2026