Metraipolis › archive › dc_deba2ae1a58d
High-Dimensional Assisted Learning for Vertically Distributed Data with Blockwise Missingness — arXiv:2608.16337
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.16337
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T20:05:17.802Z
- SHA-256 of the archived text
6c1c2c49b98c9809ebda91e3262bb7e8a7b8e411b615a9443b47a5a7da3efe6c- Stable URL of this page
https://metraipolis.com/documento/dc_deba2ae1a58d
How to cite
High-Dimensional Assisted Learning for Vertically Distributed Data with Blockwise Missingness — arXiv:2608.16337 — arXiv (en), https://arxiv.org/abs/2608.16337 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_deba2ae1a58d (Metraipolis archive dc_deba2ae1a58d, sha256 6c1c2c49b98c9809ebda91e3262bb7e8a7b8e411b615a9443b47a5a7da3efe6c)
BibTeX
@misc{dcdeba2ae1a58d,
title = {High-Dimensional Assisted Learning for Vertically Distributed Data with Blockwise Missingness — arXiv:2608.16337},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.16337},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_deba2ae1a58d; sha256 6c1c2c49b98c9809ebda91e3262bb7e8a7b8e411b615a9443b47a5a7da3efe6c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.16337. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In multi-institutional studies, different parties hold distinct feature blocks for partially overlapping sets of individuals. Responses may also be missing for some records. In such settings, we propose Assisted Learning with Block-Missing Data (ALB) for sparse high-dimensional linear estimation and coordinatewise inference without pooling records or relying on a coordinating server. ALB minimizes a regularized available-case quadratic loss using cyclic block updates. Each cycle communicates $O(n)$ scalars through sample-level linear summaries, regardless of data dimension $p$, and the iterates converge geometrically to the centralized solution. We derive estimation rates that separate statistical and optimization errors. For inference on a target coefficient, ALB estimates the corresponding precision column and uses a sample-level variance estimator that accounts for dependence among moments computed from overlapping samples. Under sparsity and overlap conditions, the studentized estimator is asymptotically standard normal at the $\sqrt n$ rate, even when there are no complete cases. We also study one-time perturbed covariate and response releases that reduce direct disclosure by replacing unperturbed sample-level quantities with noisy versions. Simulations and an analysis of multimodal Alzheimer's Disease Neuroimaging Initiative data indicate that ALB approximates its centralized benchmark and improves upon complete-case Lasso by incorporating partially observed records. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-18 in stat.ME). Categorie arXiv: Methodology (stat.ME). Pagina del lavoro: https://arxiv.org/abs/2608.16337 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T19:44:19.574Z dalla pagina https://arxiv.org/catchup/stat.ME/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).