arXiv Machine Learning
Jul 30
Feature Bagging Provides Stability
arXiv:2607. 26964v1 Announce Type: cross Abstract: We study feature bagging through the lens of algorithmic stability.
Feature Bagging Provides Stability
We study feature bagging through the lens of algorithmic stability. Feature bagging is an ensemble strategy that aggregates base learners trained on randomly subsampled feature subsets, possibly in a data-dependent manner.
Related stories
arXiv Machine Learning
Jun 2
RobustModelMaker: Coupling Bootstrap Stability Selection with Leakage-Safe Nested Cross-Validation for Scientific Machine Learning
arXiv:2606. 01566v1 Announce Type: new Abstract: Small-to-medium scientific datasets place machine learning pipelines under two compounding pressures.
arXiv Machine Learning
Sep 21
Improving the Predictive Performance of Bootstrap Aggregating by Dirichlet Resampling
The paper revisits Breiman’s insight that lowering inter‑tree correlation can boost random forest performance. It introduces two new variants—Dirichlet‑Multinomial Bagging Random Forest (DM) and Dirichlet‑Weighted Random Forest (DW)—which adjust sample reweighting through a concentration parameter α>0. A theoretical criterion is presented to determine when these methods behave like standard random forests, guiding a lightweight tuning approach. Experiments on public classification benchmarks show DM and DW consistently match or outperform other random‑forest baselines with minimal extra runtime.
arXiv Machine Learning
Sep 22
Model-Agnostic Feature Selection via LOCO-Guided Adaptive Minipatch Sampling
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 Machine Learning
4d ago
LOCO-AdaMP: Built-in LOCO Inference for Adaptive Minipatch Ensembles with Enhanced Prediction
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 Machine Learning
Aug 4
Beyond Noise: A Hypothesis Testing Approach to Robust Feature Selection
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 AI
Jun 15
Simplex-Constrained Sparse Bagging: Transitioning from Uniform Priors to Sparse Posteriors in Ensemble Learning
arXiv:2606. 13589v1 Announce Type: cross Abstract: We present Simplex-Constrained Sparse Bagging (SCSB), a mathematically rigorous framework for post-training compression and probability calibration of bootstrap-based bagging ensembles.
arXiv Machine Learning
Jun 15
Federated Learning for Feature Generalization with Convex Constraints
arXiv:2606. 14416v1 Announce Type: new Abstract: Federated learning (FL) often struggles with generalization due to heterogeneous client data.
arXiv Machine Learning
Aug 14
Bagging Robustly Learns VC Classes with Linear Sample Complexity
arXiv:2608. 13514v1 Announce Type: cross Abstract: We revisit the problem of learning predictors robust to adversarial examples at test-time.
arXiv Machine Learning
Sep 15
Stabilizing Performative Feedback Loops with Minimal Model Deployments
arXiv:2609.14065v1 Announce Type: new Abstract: When algorithmic predictions inform people's decisions, the models we deploy are performative and actively shape the data we see. This feedback loop be...
arXiv Machine Learning
Jul 7
Adversarial LassoNet: Robust Feature Selection via Stability-Driven Sparse Learning
arXiv:2607. 03839v1 Announce Type: new Abstract: Sparse feature selection is critical for high-dimensional machine learning, yet traditional $\ell_1$-regularized methods are often brittle under observational noise and spurious correlations, leading to unstable feature supports and degraded generalization.
Hugging Face Trending Papers
Aug 13
Bagging Robustly Learns VC Classes with Linear Sample Complexity
We revisit the problem of learning predictors robust to adversarial examples at test-time. We prove that VC classes are adversarially robustly learnable with sample complexity linear in the VC dimension $d$, providing an exponential improvement over the previous upper bound of Montasser, Hanneke, and Srebro (2019).