Sufficient Dimension Reduction for Classification

We propose a new sufficient dimension reduction approach designed deliberately for high-dimensional classification problems.This novel method is named as Maximal Mean Variance (MMV), inspired by the mean variance index first proposed by Cui, Li and Zhong (2015).MMV requires reasonably mild restrictions on the predictors, and keeps the model-free advantage without the need to estimate the link function.The consistency of the MMV estimator is established under regularity conditions with possibly diverging number of predictors and categories of the response.We also construct the asymptotic normality for the estimator when the dimension of the predictors keeps fixed.The relationship between MMV and several classical classification algorithms are further elaborated.Moreover, although without any definite theoretical guarantee, our method works pretty well when the sample size is far less than the problem dimension.The surprising classification efficiency gain of MMV is demonstrated by simulation studies and real data analysis.

Authors

Publication Details

Journal
Statistica Sinica
Published
2024-11-13
DOI
https://doi.org/10.5705/ss.202023.0143
Primary Topic
Face and Expression Recognition
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sufficient Dimension Reduction for Classification

Zhigang Yao, Jingjing Wu, Xin Chen, Jia Zhang
Statistica Sinica
Face and Expression Recognition
article

Sufficient Dimension Reduction for Classification

Zhigang Yao, Jingjing Wu, Xin Chen, Jia Zhang
article en

Abstract

We propose a new sufficient dimension reduction approach designed deliberately for high-dimensional classification problems.This novel method is named as Maximal Mean Variance (MMV), inspired by the mean variance index first proposed by Cui, Li and Zhong (2015).MMV requires reasonably mild restrictions on the predictors, and keeps the model-free advantage without the need to estimate the link function.The consistency of the MMV estimator is established under regularity conditions with possibly diverging number of predictors and categories of the response.We also construct the asymptotic normality for the estimator when the dimension of the predictors keeps fixed.The relationship between MMV and several classical classification algorithms are further elaborated.Moreover, although without any definite theoretical guarantee, our method works pretty well when the sample size is far less than the problem dimension.The surprising classification efficiency gain of MMV is demonstrated by simulation studies and real data analysis.

Statistica Sinica
National Natural Science Foundation of China
Climate action
Openalex Percentile: Top 80%
Face and Expression Recognition
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.