New method evaluates feature interactions using orthogonal variance decomposition.
problem Feature selection fails to account for interactions between features.
method Orthogonal variance decomposition to evaluate feature subsets considering interactions.
result Our method accurately identifies relevant features and improves model accuracy.
The paper proposes criteria and methods for evaluating and aggregating feature-based model explanations.
problem Lack of quantitative evaluation criteria for feature-based model explanations.
method Developed quantitative evaluation criteria (low sensitivity, high faithfulness, low complexity), devised a framework for aggregation, and derived a new aggregate Shapley value explanation function.
result A new aggregate Shapley value explanation function that minimizes sensitivity.
Develops framework to evaluate feature attribution methods.
problem Lack of ground truth for evaluating feature attribution methods.
method Proposes a framework including a dataset and metrics.
result Certain methods produce false positive explanations.
Paper introduces new evaluation criteria for feature-based model explanations.
problem Establishing reliable feature importance explanations for models.
method Robustness analysis using smaller adversarial perturbations.
result New explanations that are necessary and sufficient for predictions.
This paper evaluates and improves metrics for identifying important features in machine learning models.
problem Evaluation metrics for explainable AI are limited by multicollinearity and model accuracy.
method Proposes Expected Accuracy Interval (EAI) to predict model accuracy with multicollinearity.
result EAI is a useful metric for identifying important features in models with multicollinearity.
We study the effectiveness of non-uniform randomized feature selection in decision tree classification. We experimentally evaluate two feature selection methodologies, based on information extracted from the provided dataset: (i) \emph{leverage scores-based} and (ii) \emph{norm-based} feature selection. Experimenta…
New feature mapping approach improves recommendation accuracy and explainability.
problem Balancing recommendation accuracy and explainability using metadata.
method Maps uninterpretable features to interpretable aspect features, minimizing both prediction and interpretation losses.
result Strong performance in recommendation and explainability, eliminating metadata need.
Unified metric c-Eval evaluates feature-based explanations by perturbation.
problem Lack of consensus on evaluating feature-based local explanations.
method Introduces c-Eval metric and framework to quantify explanation quality.
result c-Eval captures the importance of input features and is applicable in adversarial-robust models.
Study evaluates feature selection methods for emotion recognition in resource-constrained settings.
problem Reducing memory and computational requirements for emotion recognition in low-resource settings.
method Evaluation of three feature selection methods: ILFS, ReliefF, Fisher, and AFS.
result Smaller feature sets can achieve similar or better accuracy, reducing resource usage.
Feature selection methods are usually evaluated by wrapping specific classifiers and datasets in the evaluation process, resulting very often in unfair comparisons between methods. In this work, we develop a theoretical framework that allows obtaining the true feature ordering of two-dimensional sequential forward feat…
The paper defines and analyzes feature complexity in DNNs, proposing metrics for feature disentanglement and evaluation.
problem Understanding and quantifying the complexity of features learned by deep neural networks.
method Proposes a definition and disentanglement of feature complexity orders, introduces metrics for reliability and over-fitting evaluation.
result Establishes a relationship between feature complexity and DNN performance, and proposes a generic mathematical tool for network compression and knowledge distillation.
Study reveals class-dependent effects in perturbation-based feature attribution metrics for time series classification.
problem Varying effectiveness of perturbation-based metrics across different classes in time series models.
method Systematic empirical analysis across multiple datasets, model architectures, and perturbation strategies.
result Perturbation-based metrics show varying effectiveness across classes, with some metrics performing better for certain classes.
XAI-Bench releases synthetic datasets for evaluating feature attribution methods.
problem Evaluating and comparing feature attribution methods is challenging.
method Released synthetic datasets and benchmarking library.
result Efficiently evaluates feature attribution methods across various metrics.
AFA evaluates AI feature acquisition strategies in domains with high costs.
problem Evaluate AI feature acquisition strategies in domains with high costs.
method Apply missing data methods and offline reinforcement learning under NDE and NUC assumptions.
result Propose a novel semi-offline reinforcement learning framework with three new estimators.
This paper reviews and evaluates causality-based feature selection methods.
problem Capturing causal relationships between features and class variable for better model interpretability.
method Comprehensive review and evaluation of causality-based feature selection algorithms.
result Development of CausalFS package for algorithm comparison and experimentation.
Forecasting the movements of stock prices is one the most challenging problems in financial markets analysis. In this paper, we use Machine Learning (ML) algorithms for the prediction of future price movements using limit order book data. Two different sets of features are combined and evaluated: handcrafted features b…
A new test improves feature evaluation in predictive models.
problem Evaluating the usefulness of features in supervised prediction problems.
method Proposes a novel conditional independence test using permutation testing.
result Achieves better predictive power than competing approaches.
We present a method to stop the evaluation of a decision making process when the result of the full evaluation is obvious. This trait is highly desirable for online margin-based machine learning algorithms where a classifier traditionally evaluates all the features for every example. We observe that some examples are e…
The paper evaluates company investment value using machine learning models.
problem Evaluating the investment value of companies based on machine learning.
method Data mining, feature selection, cross-validation, stacking model, Bayesian Ridge Regression.
result The RMSE of the final model is 3.047, indicating improved stability and generalization.
We present a method to stop the evaluation of a prediction process when the result of the full evaluation is obvious. This trait is highly desirable in prediction tasks where a predictor evaluates all its features for every example in large datasets. We observe that some examples are easier to classify than others, a p…
The paper formalizes feature attribution to address inconsistent definitions and evaluate methods.
problem Inconsistent definitions of feature relevance in feature attribution.
method Formalization based on relaxed functional dependence, extended to instance-wise setting.
result State-of-the-art methods often fail to verify necessary properties for candidate selection.
Sparse feature selection improves batch RL efficiency.
problem High-dimensional batch RL with many features.
method Sparse linear function approximation, Lasso, group Lasso, fitted Q-evaluation, fitted Q-iteration.
result Sparse feature selection makes batch RL more sample efficient.
Method evaluates classification uncertainty with adaptively chosen features.
problem Finding a balance between model efficiency and fairness.
method Adaptively selects features for equalized coverage in classification.
result Valid and effective method demonstrated on simulated and real data.
Evaluates explanations of LTR models using decision paths and compares their accuracy.
problem Challenges in evaluating local explanations of LTR models due to lack of ground truth feature importance scores.
method Focuses on tree-based LTR models, extracts ground truth feature importance scores using decision paths, and compares them with explanation techniques.
result Explanation accuracy varies depending on the model and data point.
Decision forests learn to model text by evaluating categorical-set conditions.
problem Decision forests cannot directly model text features.
method Defined and learned conditions for categorical-set features, enabling efficient text modeling.
result Decision forests can now directly model text features.
In this paper, a novel feature selection method is presented, which is based on Class-Separability (CS) strategy and Data Envelopment Analysis (DEA). To better capture the relationship between features and the class, class labels are separated into individual variables and relevance and redundancy are explicitly handle…
TorchGAN simplifies GAN training and evaluation with a flexible framework.
problem Training and evaluating GANs can be complex and time-consuming.
method Modular design, extensibility, built-in support for popular models and metrics.
result TorchGAN achieves near-zero overhead compared to vanilla PyTorch.
Enhances clustering quality evaluation in noisy data.
problem Reliable clustering quality assessment in noisy Gaussian mixtures.
method Feature Importance Rescaling (FIR) method.
result FIR improves correlation between cluster validity indices and ground truth.
CLIP models robustness to spurious features is re-evaluated using a new dataset.
problem Existing robustness tests of CLIP models may not fully reflect their performance on spurious features.
method Crafted a new dataset (CounterAnimal) to reveal CLIP models' reliance on realistic spurious features.
result CLIP models are robust to spurious features learned from their training data, not ImageNet.
Paper evaluates and improves private feature selection methods.
problem Feature selection in high-dimensional datasets with privacy constraints.
method Correlations-based order statistic privatized for feature selection.
result Our method significantly outperforms established baseline for private feature selection.
AI techniques explain synthetic tabular data weaknesses.
problem Challenges in evaluating synthetic tabular data quality.
method Apply explainable AI to a binary detection classifier.
result Reveals inconsistencies, unrealistic dependencies, or missing patterns in synthetic data.
This study evaluates handwriting features to diagnose Parkinson's disease.
problem Diagnosing Parkinson's disease through handwriting analysis.
method Kinematic, geometrical, and non-linear features were evaluated using K-nearest neighbors, support vector machines, and random forest classifiers.
result Up to 93.1% accuracy in classifying Parkinson's disease and healthy subjects.
Neural network synthesizes percussive sounds with adjustable timbral features.
problem Control over high-level timbral characteristics of percussive sounds.
method Feedforward convolutional neural network mapping input parameters to waveform.
result Changing input parameters produces a waveform congruent with desired characteristics.
Numerous social, medical, engineering and biological challenges can be framed as graph-based learning tasks. Here, we propose a new feature based approach to network classification. We show how dynamics on a network can be useful to reveal patterns about the organization of the components of the underlying graph where …
The study sets lower bounds on MMSE for inferring sensitive features from noisy data.
problem Estimating sensitive features from noisy observations of correlated features.
method Adversarial evaluation framework based on MMSE estimation with theoretical lower bounds.
result Derives closed-form bounds for linear models, showing optimality in noise variance.
This research simplifies computation of feature attribution methods under certain conditions.
problem Computational complexity of feature attribution methods, especially power indices.
method Identifying conditions for polynomial computation and introducing new indices.
result Conditions for efficient computation of feature attribution methods are identified.
Unified coverage analysis for linear off-policy evaluation in reinforcement learning.
problem Lack of a unified understanding of coverage parameters in linear off-policy evaluation.
method Developed a novel finite-sample analysis for LSTDQ algorithm, introducing feature-dynamics coverage.
result Unified understanding of coverage parameters in linear off-policy evaluation.
Multiclass prediction is the problem of classifying an object into a relevant target class. We consider the problem of learning a multiclass predictor that uses only few features, and in particular, the number of used features should increase sub-linearly with the number of possible classes. This implies that features …
Evaluating human brain potentials during watching different images can be used for memory evaluation, information retrieving, guilty-innocent identification and examining the brain response. In this study, the effects of watching images, with different levels of familiarity, on subjects' Electroencephalogram (EEG) have…
A novel weighted feature selection method using fuzzy sets improves classification accuracy and stability.
problem Improving feature selection accuracy and stability in machine learning models.
method Combination of four feature selection methods using fuzzy sets and bootstrap.
result Our method achieved significantly higher stability than individual methods.
Paper uses LightGBM for mobile user credit assessment.
problem Improving credit evaluation methods for communication operators.
method Data preprocessing, feature engineering, multiple machine learning models integration.
result Established a suitable fusion model for operator user credit evaluation.
In many applications, an anomaly detection system presents the most anomalous data instance to a human analyst, who then must determine whether the instance is truly of interest (e.g. a threat in a security setting). Unfortunately, most anomaly detectors provide no explanation about why an instance was considered anoma…
We present and evaluate Deep Private-Feature Extractor (DPFE), a deep model which is trained and evaluated based on information theoretic constraints. Using the selective exchange of information between a user's device and a service provider, DPFE enables the user to prevent certain sensitive information from being sha…
e-values rank features for model performance.
problem Feature selection for parametric models.
method Data depths and resampling-based algorithm.
result e-values distinguish essential features.
Bitcoin is a cryptocurrency that features a distributed, decentralized and trustworthy mechanism, which has made Bitcoin a popular global transaction platform. The transaction efficiency among nations and the privacy benefiting from address anonymity of the Bitcoin network have attracted many activities such as payment…
Proposes on-the-fly joint feature selection and classification for time-sensitive decisions.
problem Online feature selection and classification for time-sensitive decision making.
method Proposes a framework for joint feature selection and classification on-the-fly, optimizing feature usage and classification accuracy.
result Demonstrates superior performance over state-of-the-art methods on various datasets.
Paper proposes FINN for better CTR prediction by modeling feature interactions.
problem Improving CTR prediction in advertising and recommendation systems.
method Proposes Feature Interaction based Neural Network (FINN) to model feature interactions.
result FINN outperforms other deep models in CTR prediction tasks.
Kernel methods are powerful and flexible approach to solve many problems in machine learning. Due to the pairwise evaluations in kernel methods, the complexity of kernel computation grows as the data size increases; thus the applicability of kernel methods is limited for large scale datasets. Random Fourier Features (R…