Nonparametric Screening under Conditional Strictly Convex Loss for Ultrahigh Dimensional Sparse Data
Xu Han

TL;DR
This paper introduces a unified nonparametric screening framework for ultrahigh dimensional data using a new class of loss functions called conditional strictly convex loss, demonstrating improved model selection and convergence properties.
Contribution
It develops a general framework for nonparametric screening based on loss functions and proposes a new class called conditional strictly convex loss, enhancing universality and effectiveness.
Findings
Established sure screening properties within the new loss class.
Achieved better convergence probability for true model inclusion.
Demonstrated superior performance through simulations and real data.
Abstract
Sure screening technique has been considered as a powerful tool to handle the ultrahigh dimensional variable selection problems, where the dimensionality p and the sample size n can satisfy the NP dimensionality log p=O(n^a) for some a>0 (Fan & Lv 2008). The current paper aims to simultaneously tackle the "universality" and "effectiveness" of sure screening procedures. For the "universality", we develop a general and unified framework for nonparametric screening methods from a loss function perspective. Consider a loss function to measure the divergence of the response variable and the underlying nonparametric function of covariates. We newly propose a class of loss functions called conditional strictly convex loss, which contains, but is not limited to, negative log likelihood loss from one-parameter exponential families, exponential loss for binary classification and quantile…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
