Improving Performance in Classification Tasks with LCEN and the Weighted Focal Differentiable MCC Loss
Not on the map. Why?
Abstract (arXiv)
The LASSO-Clip-EN (LCEN) algorithm was previously introduced for nonlinear, interpretable feature selection and machine learning. However, its design and use was limited to regression tasks. In this work, we create a modified version of the LCEN algorithm that is suitable for classification tasks and maintains its desirable properties, such as interpretability. This modified LCEN algorithm is evaluated on four widely used binary and multiclass classification datasets. In these experiments, LCEN is compared against 10 other model types and consistently reaches high test-set macro F1 score and Matthews correlation coefficient (MCC) metrics, higher than that of the majority of investigated models. LCEN models for classification remain sparse, eliminating an average of 56% of all input features in the experiments performed. Furthermore, LCEN-selected features are used to retrain all models using the same data, leading to statistically significant performance improvements in three of the experiments and insignificant differences in the fourth when compared to using all features or other feature selection methods. Simultaneously, the weighted focal differentiable MCC (diffMCC) loss function is evaluated on the same datasets. Models trained with the diffMCC loss function are always the best-performing methods in these experiments, and reach test-set macro F1 scores that are, on average, 4.9% higher and MCCs that are 8.5% higher than those obtained by models trained with the weighted cross-entropy loss. These results highlight the performance of LCEN as a feature selection and machine learning algorithm also for classification tasks, and how the diffMCC loss function can train very accurate models, surpassing the weighted cross-entropy loss in the tasks investigated.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 42 references that are in the map. First posted on arXiv 23 Apr 2026.
Builds on
7 of 42 references.
References · 7
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
- 2019Unmasking Clever Hans Predictors and Assessing What Machines Really Learncited by 365
- 2020Integrating Scientific Knowledge with Machine Learning for Engineering and Environmental Systemscited by 164
- 2020Human Factors in Model Interpretability: Industry Practices, Challenges, and Needscited by 74
- 2021Patch Shortcuts: Interpretable Proxy Models Efficiently Find Black-Box Vulnerabilitiescited by 4
- 2024LCEN: A Nonlinear, Interpretable Feature Selection and Machine Learning Algorithmcited by 2
- 2024Predicting O-GlcNAcylation Sites in Mammalian Proteins with Transformers and RNNs Trained with a New Loss Functioncited by 2
Built on by
Not cited yet.