arXiv Machine Learning
CCMP: Class-Conditional Multicollinearity Pruning for High-Dimensional Feature Selection
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 7
Efficient Cross-Validation for Sparse Linear Regression
arXiv:2306. 14851v5 Announce Type: replace-cross Abstract: Given a high-dimensional covariate matrix and a response vector, ridge-regularized sparse linear regression selects a subset of features that explains the relationship between covariates and the response in an interpretable manner.
arXiv Machine Learning
Jul 14
Vertical Fusion: Condensing Internal Representations for Robust ViT Classification
arXiv:2607. 10391v1 Announce Type: cross Abstract: Despite exposing rich intermediate representations, Vision Transformers (ViTs) are almost exclusively utilized as black-box feature extractors, where only the last layer is considered for downstream tasks.
arXiv Machine Learning
5d ago
Unsupervised Feature Selection Using Local Intrinsic Dimensionality -- Extended Version
The paper introduces LIDFS, an unsupervised feature selection technique that uses Local Intrinsic Dimensionality (LID) to rank features based on their local discriminability. By treating each feature as a point and estimating its LID via maximum likelihood from distances to its k nearest neighboring features, LIDFS assigns higher importance to features with lower LID and refines the ranking to remove locally redundant features. Experiments on 23 high‑dimensional datasets show that LIDFS outperforms both classic and state‑of‑the‑art methods in supervised and clustering evaluations while running faster than its closest competitor.
arXiv AI
Oct 27
A Canary in the Neural Mine: Catching an Image Classifier's Silent, Confident Failures
arXiv:2610.33063v1 Announce Type: cross Abstract: Deployed vision models auto-accept confident predictions, so high-confidence errors propagate silently. Maximum Softmax Probability (MSP), the standa...
arXiv Machine Learning
Aug 26
Calibration-Preserving Pruning: Compression as a Reliability Contract
arXiv:2608.23744v1 Announce Type: new Abstract: Split conformal prediction, not the pruning rule, supplies finite-sample marginal coverage once a pruned model is fixed independently of the conformal...
arXiv Machine Learning
Aug 3
GEMSS: A Variational Method for Discovering Multiple Sparse Solutions in Classification and Regression Problems
arXiv:2602. 08913v3 Announce Type: replace Abstract: In underdetermined regression and classification problems, multiple feature subsets often yield equivalent predictive performance.