Selective classification can worsen accuracy disparities between groups.
problem Selective classification can magnify existing accuracy disparities between various groups.
method Study of margin distribution and distributionally-robust models.
result Selective classification can uniformly improve each group on distributionally-robust models.
Regularizing for or against class selectivity in DNNs improves test accuracy.
problem The necessity and sufficiency of class selectivity in DNNs.
method Direct regularization of class selectivity in convolutional neural networks.
result Reducing class selectivity improves test accuracy, while increasing it decreases it.
Value selection reduces model size while maintaining accuracy.
problem Space efficiency in model size reduction.
method Two probabilistic methods based on information theory's metric: PVS and P + VS.
result Value selection achieves balance between accuracy and model size reduction.
Improves model calibration and selection in unsupervised domain adaptation.
problem Distribution shifts in unsupervised domain adaptation.
method Developed a novel importance weighted group accuracy estimator.
result Improves state-of-the-art performances by 22% in model calibration and 14% in model selection.
A novel feature selection method for SVM improves model accuracy and interpretability.
problem Feature selection in nonlinear SVM classification problems.
method Embedded min-max optimization problem, leveraging duality theory.
result Improves model accuracy and interpretability on benchmark data sets.
In the context of variable selection, ensemble learning has gained increasing interest due to its great potential to improve selection accuracy and to reduce false discovery rate. A novel ordering-based selective ensemble learning strategy is designed in this paper to obtain smaller but more accurate ensembles. In part…
We propose an online method for concept driftdetection based on dynamic classifier ensemble selection. Theproposed method generates a pool of ensembles by promotingdiversity among classifier members and chooses expert ensemblesaccording to global prequential accuracy values. Unlike currentdynamic ensemble selection app…
Minimizes indecisions in selective classification to control misclassification rates.
problem Controlling misclassification rates in high-risk scenarios.
method Using indecisions to control misclassification rates, even below Bayes optimal.
result Control of misclassification rates to any user-specified level, even below Bayes optimal.
AFS-BM improves model accuracy by dynamically selecting features.
problem Feature selection challenges in ML, especially scalability and adaptability.
method Joint optimization for feature selection and model training with binary masking.
result AFS-BM achieves significant improvements in model accuracy and computational efficiency.
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.
Proposes a new stability measure for model fitting on similar feature data sets.
problem Model fitting on data sets with similar features is challenging.
method Tuning hyperparameters in a multi-criteria fashion with predictive accuracy and feature selection stability.
result Our approach achieves similar or better predictive performance than single-criteria and stability selection approaches.
Solar algorithm selects variables faster and more accurately in high-dimensional data.
problem Variable selection in high-dimensional data with high accuracy and stability.
method Subsample-ordered least-angle regression (solar) and its coordinate descent generalization (solar-cd) using L0 norm solution path averaging. result Solar selects variables with high accuracy and stability, reducing redundant variable selection.
VC-PCR improves prediction by clustering correlated variables.
problem Decreased prediction accuracy due to cluster structure in predictor variables.
method Supervised variable selection and clustering to integrate cluster information into a sparse modeling process.
result VC-PCR achieves better prediction, variable selection, and clustering performance.
This paper reviews feature selection methods using swarm intelligence.
problem Reducing dimensionality in high-dimensional datasets.
method Comparative analysis of swarm intelligence-based feature selection methods.
result Evaluation of strengths and weaknesses of swarm intelligence-based methods.
In this paper, we investigate a new form of automated curriculum learning based on adaptive selection of accuracy requirements, called accuracy-based curriculum learning. Using a reinforcement learning agent based on the Deep Deterministic Policy Gradient algorithm and addressing the Reacher environment, we first show …
This study improves stock price prediction for Apple Inc. using feature selection and regression models with technical indicators.
problem Improving stock price prediction accuracy for Apple Inc. using technical indicators.
method Evaluation of 123 technical indicators and 10 regression models on 13 years of Apple Inc. data.
result Combining feature selection with regression models significantly improves prediction accuracy.
Improved selection of best outputs from LLMs for better accuracy.
problem BoN fails to reliably find the correct answer with imperfect rewards.
method Majority-of-the-Bests (MoB) selects the mode of a bootstrapped output distribution of BoN.
result MoB consistently improves over BoN in 25 out of 30 setups.
Paper proposes a new method for selecting the best hierarchical forecasting approach.
problem Selecting the best method for reconciling base forecasts in hierarchical time series.
method Conditional hierarchical forecasting using machine learning and time series features.
result Conditional hierarchical forecasting leads to significantly more accurate forecasts, especially at lower levels.
FoLDTree improves oblique decision trees with ULDA, enhancing accuracy and feature selection.
problem Axis-orthogonal splits limit traditional decision trees' performance on oblique decision boundaries.
method Integrates ULDA into decision tree structure for efficient oblique splits, feature selection, and handling missing values.
result FoLDTree outperforms other methods in accuracy and feature selection, comparable to random forest.
We consider the problem of classifying business process instances based on structural features derived from event logs. The main motivation is to provide machine learning based techniques with quick response times for interactive computer assisted root cause analysis. In particular, we create structural features from p…
Activation functions influence behavior and performance of DNNs. Nonlinear activation functions, like Rectified Linear Units (ReLU), Exponential Linear Units (ELU) and Scaled Exponential Linear Units (SELU), outperform the linear counterparts. However, selecting an appropriate activation function is a challenging probl…
A genetic algorithm with community detection improves feature selection accuracy.
problem Feature selection in high-dimensional datasets.
method Community detection in genetic algorithm for feature selection.
result The new approach yields improved classification accuracy.
New method improves prediction accuracy in business process mining by handling concept drift.
problem Improving prediction quality in business process mining affected by concept drift.
method Systematically analyzed and compared different data selection strategies for retraining machine learning models.
result Improved accuracy from 0.5400 to 0.7010 with concept drift handling.
New method selects features for big data efficiently.
problem Feature selection challenges in huge data.
method Minipatch learning with STAMPS and AdaSTAMPS.
result AdaSTAMPS outperforms other methods in accuracy and speed.
Pair Hidden Markov Models (PHMMs) are probabilistic models used for pairwise sequence alignment, a quintessential problem in bioinformatics. PHMMs include three types of hidden states: match, insertion and deletion. Most previous studies have used one or two hidden states for each PHMM state type. However, few studies …
We study the problem of interference source identification, through the lens of recognizing one of 15 different channels that belong to 3 different wireless technologies: Bluetooth, Zigbee, and WiFi. We employ deep learning algorithms trained on received samples taken from a 10 MHz band in the 2.4 GHz ISM Band. We obta…
We describe a method for selecting relevant new training data for the LSTM-based domain selection component of our personal assistant system. Adding more annotated training data for any ML system typically improves accuracy, but only if it provides examples not already adequately covered in the existing data. However, …
A new method for selective classification trades off accuracy for coverage.
problem Selective classification allows a classifier to abstain from predicting some instances.
method Optimizes a collection of class-wise decoupled one-sided empirical risks.
result The method achieves near-optimal coverage in high target accuracy regimes.
RACER optimizes LLM-as-judge accuracy with dynamic reasoning selection.
problem Balancing reasoning accuracy with computational cost in LLM-as-judge settings.
method Formulates routing as a constrained distributionally robust optimization problem, accounting for distribution shift via KL-divergence uncertainty set.
result RACER achieves superior accuracy-cost trade-offs under distribution shift.
This paper describes the autofeat Python library, which provides scikit-learn style linear regression and classification models with automated feature engineering and selection capabilities. Complex non-linear machine learning models, such as neural networks, are in practice often difficult to train and even harder to …
Proposes a more efficient knot selection method for sparse Gaussian processes.
problem Optimizing marginal likelihood for knot selection leads to suboptimal and inefficient placement of knots.
method Uses Bayesian optimization to propose knots one at a time, avoiding multimodal surface issues.
result Improves both accuracy and speed of knot selection compared to current methods.
We propose a computationally efficient wrapper feature selection method - called Autoencoder and Model Based Elimination of features using Relevance and Redundancy scores (AMBER) - that uses a single ranker model along with autoencoders to perform greedy backward elimination of features. The ranker model is used to pri…
Selective neural network improves credit risk prediction while maintaining interpretability.
problem Improving credit risk prediction accuracy while maintaining interpretability for financial regulators.
method Introducing a neural network with a selective option to distinguish between linear and non-linear datasets.
result For most datasets, logistic regression is sufficient and interpretable, while for specific data portions, a shallow neural network model provides better accuracy.
Improved online penalty selection for time series models.
problem Efficiently selecting penalty parameters for lasso in time series models.
method Enhanced autoregressive model with online penalty selection.
result Significantly improved computational performance and forecast accuracy.
When selecting a classification algorithm to be applied to a particular problem, one has to simultaneously select the best algorithm for that dataset \emph{and} the best set of hyperparameters for the chosen model. The usual approach is to apply a nested cross-validation procedure; hyperparameter selection is performed…
Motivation: Biomarker discovery from high-dimensional data is a crucial problem with enormous applications in biology and medicine. It is also extremely challenging from a statistical viewpoint, but surprisingly few studies have investigated the relative strengths and weaknesses of the plethora of existing feature sele…
A machine learning configuration refers to a combination of preprocessor, learner, and hyperparameters. Given a set of configurations and a large dataset randomly split into training and testing set, we study how to efficiently select the best configuration with approximately the highest testing accuracy when trained f…
Data selection boosts fact memorization in language models.
problem Language models struggle to accurately memorize factual knowledge.
method Formalizes fact memorization, proposes data selection schemes based on training loss.
result Data selection boosts fact accuracy to model capacity and improves performance.
ARHNN method improves electricity price forecasting accuracy.
problem Improving accuracy in electricity price forecasting.
method Combines Autoregressive Hybrid Nearest Neighbors (ARHNN) method with calibration sample selection and forecast combination.
result ARHNN method outperforms benchmarks by up to 10% in German, Spanish, and New England markets.
High-dimensional data in many machine learning applications leads to computational and analytical complexities. Feature selection provides an effective way for solving these problems by removing irrelevant and redundant features, thus reducing model complexity and improving accuracy and generalization capability of the…
Cost-effective feature selection improves network model choice.
problem Selecting informative features from noisy candidates in network models.
method Adapted feature selection methods to account for feature costs and used pilot simulations.
result Reduced computational cost by two orders of magnitude without sacrificing model accuracy.
Dimensionality reduction is one of the key issues in the design of effective machine learning methods for automatic induction. In this work, we introduce recursive maxima hunting (RMH) for variable selection in classification problems with functional data. In this context, variable selection techniques are especially a…
A new stock selection strategy uses combined machine learning with dynamic weighting methods.
problem Improving stock selection accuracy and performance.
method Combined machine learning algorithms with static and dynamic weighting methods.
result IC-based dynamic weighting outperforms static evaluation metrics in backtested returns and predictive performance.
Optimizes model training efficiency with core subset selection.
problem Escalating computational costs in large dataset training.
method Core subset selection for reweighting.
result Efficiently minimizes computational time and improves model performance.
Ensemble learning that can be used to combine the predictions from multiple learners has been widely applied in pattern recognition, and has been reported to be more robust and accurate than the individual learners. This ensemble logic has recently also been more applied in feature selection. There are basically two st…
GSANet improves semantic segmentation accuracy with selective and global attention.
problem Semantic segmentation accuracy improvement.
method Global and selective attention mechanism with ASPP and sparsemax.
result GSANet achieves state-of-the-art accuracy on ADE20k and Cityscapes datasets.
This paper improves volatility forecasting using dynamic subset selection in genetic programming.
problem Improving accuracy of implied volatility forecasting.
method Dynamic training-subset selection methods applied to genetic programming.
result Dynamic subset selection improves predictive accuracy of genetic programming models.
A RL framework selects features to balance bias and accuracy dynamically.
problem Bias in automated feature selection when predictors are correlated.
method Multi-component reward function with policy gradient for dynamic regularization and bias mitigation.
result Model balances fairness and accuracy during training.