56:50
published on April 10, 2025
Deep Out-of-the-distribution Uncertainty Quantification in for Data (Science) Scientists
By Nicolas Vayatis
High-dimensional classification by sparse logistic regression
Appears in collection : Mathematical Methods of Modern Statistics 2 / Méthodes mathématiques en statistiques modernes 2
In this talk we consider high-dimensional classification. We discuss first high-dimensional binary classification by sparse logistic regression, propose a model/feature selection procedure based on penalized maximum likelihood with a complexity penalty on the model size and derive the non-asymptotic bounds for the resulting misclassification excess risk. Implementation of any complexity penalty-based criterion, however, requires a combinatorial search over all possible models. To find a model selection procedure computationally feasible for high-dimensional data, we consider logistic Lasso and Slope classifiers and show that they also achieve the optimal rate. We extend further the proposed approach to multiclass classification by sparse multinomial logistic regression.
This is joint work with Vadim Grinshtein and Tomer Levy.
