AINeutralarXiv – CS AI · 3d ago6/10
🧠A comprehensive study of Markov boundaries in tabular prediction reveals that while oracle boundaries significantly improve model performance, practical causal discovery methods fail to recover them cost-effectively. The research identifies fundamental misalignments between structural recovery optimization and predictive performance, suggesting that prediction-focused feature selection requires different approaches than theoretical assumptions propose.
AIBullisharXiv – CS AI · 4d ago6/10
🧠Researchers propose BayesNCL, a new machine learning approach that improves the interpretability of self-supervised learning models by using probabilistic gating to filter out task-irrelevant features. The method achieves a 142.1% improvement in semantic consistency on ImageNet-100 while maintaining downstream task performance, addressing a fundamental limitation in how contrastive learning models process information.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers present a Sequential Forward Floating Selection (SFFS) framework for identifying the minimal set of satellite imagery channels needed for accurate landslide detection, demonstrating that 8 carefully selected channels match or exceed the performance of models using 30 channels. The work addresses computational efficiency and model interpretability in Earth observation machine learning by moving beyond conventional approaches that simply include all available data.
AINeutralarXiv – CS AI · May 125/10
🧠Researchers have developed GPU-accelerated versions of the Boruta feature selection algorithm, significantly improving computational efficiency for processing large-scale datasets while maintaining accuracy comparable to the original CPU-based method. The two variants—Boruta-Permut and Boruta-TreeImp—demonstrate that GPU acceleration offers a cost-effective solution for machine learning workflows on high-dimensional data.
AINeutralarXiv – CS AI · May 96/10
🧠Researchers introduce CatNet, an algorithm that controls False Discovery Rate (FDR) in LSTM neural networks by combining SHAP feature importance derivatives with a Gaussian Mirror statistical approach. The method addresses overfitting and model interpretability challenges in time-series deep learning through improved feature selection and a novel kernel-based independence measure.
AIBullisharXiv – CS AI · Feb 276/105
🧠Researchers developed a lightweight intrusion detection system using XGBoost and explainable AI to detect Advanced Persistent Threats (APTs) at early stages. The system reduced required features from 77 to just 4 while maintaining 97% precision and 100% recall performance.
$APT
AINeutralarXiv – CS AI · Mar 34/105
🧠Researchers introduce Group Stepdown SLOPE, a new statistical method for high-dimensional feature selection that improves upon existing frameworks by controlling multiple error metrics and exploiting group structure in data. The method provides better statistical power while maintaining strict error control in machine learning applications.
AINeutralarXiv – CS AI · Mar 24/106
🧠Researchers propose a new framework for feature selection that uses permutation-invariant embedding and reinforcement learning to address limitations in current methods. The approach combines an encoder-decoder paradigm to preserve feature relationships without order bias and employs policy-based RL to explore embedding spaces without convexity assumptions.
AIBullisharXiv – CS AI · Mar 24/106
🧠Researchers have developed a new framework for privacy-preserving feature selection that uses permutation-invariant representation learning and federated learning techniques. The approach addresses data imbalance and privacy constraints in distributed scenarios while improving computational efficiency and downstream task performance.
