Supervised dimension reduction for ordinal predictors
Liliana Forzani, Rodrigo Garc\'ia Arancibia, Pamela Llop, Diego, Tomassi

TL;DR
This paper introduces a supervised dimension reduction method for ordinal predictors that is model-based, distribution-free, and computationally efficient, improving upon existing techniques in simulation and real data applications.
Contribution
A novel supervised dimension reduction approach tailored for ordinal predictors, extending sufficient dimension reduction to latent Gaussian variables without distributional assumptions.
Findings
Method performs well in simulations.
Outperforms traditional techniques in real data.
Regularized estimator enables variable selection.
Abstract
In applications involving ordinal predictors, common approaches to reduce dimensionality are either extensions of unsupervised techniques such as principal component analysis, or variable selection procedures that rely on modeling the regression function. In this paper, a supervised dimension reduction method tailored to ordered categorical predictors is introduced. It uses a model-based dimension reduction approach, inspired by extending sufficient dimension reductions to the context of latent Gaussian variables. The reduction is chosen without modeling the response as a function of the predictors and does not impose any distributional assumption on the response or on the response given the predictors. A likelihood-based estimator of the reduction is derived and an iterative expectation-maximization type algorithm is proposed to alleviate the computational load and thus make the method…
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.
