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.
arXiv:2606. 01566v1 Announce Type: new Abstract: Small-to-medium scientific datasets place machine learning pipelines under two compounding pressures.
By Amanda S Barnard
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.
By Mousam Sinha, Tirtha Sarathi Ghosh, Koushik Biswas, Ridam Pal
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.
By Zhen Huang, Peicheng Xu, Junbiao Pang, Yulong Zheng
arXiv:2608. 13514v1 Announce Type: cross Abstract: We revisit the problem of learning predictors robust to adversarial examples at test-time.
By Omar Montasser
arXiv:2606. 14416v1 Announce Type: new Abstract: Federated learning (FL) often struggles with generalization due to heterogeneous client data.
By Dongwon Kim, Donghee Kim, Sung Kuk Shyn, Kwangsu Kim