Salvato in:
Dettagli Bibliografici
Autori principali: Weng, Jiaying, Tan, Kai, Wang, Cheng, Yu, Zhou
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:https://arxiv.org/abs/2310.19114
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913776974954496
author Weng, Jiaying
Tan, Kai
Wang, Cheng
Yu, Zhou
author_facet Weng, Jiaying
Tan, Kai
Wang, Cheng
Yu, Zhou
contents Fréchet regression has received considerable attention to model metric-space valued responses that are complex and non-Euclidean data, such as probability distributions and vectors on the unit sphere. However, existing Fréchet regression literature focuses on the classical setting where the predictor dimension is fixed, and the sample size goes to infinity. This paper proposes sparse Fréchet sufficient dimension reduction with graphical structure among high-dimensional Euclidean predictors. In particular, we propose a convex optimization problem that leverages the graphical information among predictors and avoids inverting the high-dimensional covariance matrix. We also provide the Alternating Direction Method of Multipliers (ADMM) algorithm to solve the optimization problem. Theoretically, the proposed method achieves subspace estimation and variable selection consistency under suitable conditions. Extensive simulations and a real data analysis are carried out to illustrate the finite-sample performance of the proposed method.
format Preprint
id arxiv_https___arxiv_org_abs_2310_19114
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Sparse Fréchet Sufficient Dimension Reduction with Graphical Structure Among Predictors
Weng, Jiaying
Tan, Kai
Wang, Cheng
Yu, Zhou
Methodology
Fréchet regression has received considerable attention to model metric-space valued responses that are complex and non-Euclidean data, such as probability distributions and vectors on the unit sphere. However, existing Fréchet regression literature focuses on the classical setting where the predictor dimension is fixed, and the sample size goes to infinity. This paper proposes sparse Fréchet sufficient dimension reduction with graphical structure among high-dimensional Euclidean predictors. In particular, we propose a convex optimization problem that leverages the graphical information among predictors and avoids inverting the high-dimensional covariance matrix. We also provide the Alternating Direction Method of Multipliers (ADMM) algorithm to solve the optimization problem. Theoretically, the proposed method achieves subspace estimation and variable selection consistency under suitable conditions. Extensive simulations and a real data analysis are carried out to illustrate the finite-sample performance of the proposed method.
title Sparse Fréchet Sufficient Dimension Reduction with Graphical Structure Among Predictors
topic Methodology
url https://arxiv.org/abs/2310.19114