arXiv:2508. 14268v2 Announce Type: replace-cross Abstract: Feature selection and importance estimation in a model-agnostic setting is an ongoing challenge of significant interest.
arXiv:2607. 24145v1 Announce Type: new Abstract: Feature selection aims to identify the most informative and relevant features for a given dataset, either in terms of capturing the underlying data structure and distribution better, or with respect to the performance on a downstream task.
arXiv:2609.24126v1 Announce Type: cross Abstract: Black-box machine learning models increasingly deliver strong predictions, but extracting useful information from them, such as a set of important fe...
arXiv:2609.36396v1 Announce Type: cross Abstract: As black-box machine learning models become increasingly common, extracting interpretations with uncertainty quantification has become a critical cha...
arXiv:2511. 20851v3 Announce Type: replace-cross Abstract: Feature selection remains difficult in modern high-dimensional settings, and established methods such as Boruta and Recursive Feature Elimination are either computationally costly or lack a statistically justified stopping criterion for their importance scores.
arXiv:2606. 01111v1 Announce Type: new Abstract: Modern industrial recommender systems rely on thousands of heterogeneous features -- ranging from low-dimensional scalars (e.
arXiv:2605.09396v2 Announce Type: replace-cross Abstract: This paper relaxes the restrictive symmetry conditions adopted in [4], [5] and extends their universal feature selection framework to accommo...
arXiv:2609.37905v1 Announce Type: cross Abstract: Click-Through Rate prediction, a core task in recommendation and advertising systems, relies on modeling interactions among sparse categorical featur...
arXiv:2606. 07068v1 Announce Type: new Abstract: Background: Since 1990 many feature selection methods have been proposed across heterogeneous applications.
The paper introduces a meta‑learning framework that uses a rich set of dataset‑complexity meta‑features to predict the accuracy of different classifiers on image datasets, avoiding exhaustive training. By extracting features with autoencoders, pre‑trained networks, and dimensionality reduction, regression models estimate classifier accuracies, while clustering groups similar performers to simplify recommendations. Tested on 56 diverse image datasets, the method achieves over 86% ranking prediction accuracy, offering a scalable, interpretable solution for model selection and cost reduction.
arXiv:2603. 22050v2 Announce Type: replace-cross Abstract: Supervised machine learning describes the practice of fitting a parameterized model to labeled input-output data.
arXiv:2610.01641v1 Announce Type: cross Abstract: Modern machine-learning models often contain strongly dependent or redundant features, making feature attribution difficult because shared predictive...
arXiv:2603.05575v2 Announce Type: replace-cross Abstract: We study prediction-powered conditional inference in the setting where labeled data are scarce, unlabeled covariates are abundant, and a blac...