Search arXivSearch

arXiv · 2608.22809

SAGE: Stability-Aware Graph-Based Ensemble Feature Selection for Explainable Postpartum Depression Risk Prediction

Abstract

Postpartum depression (PPD) poses a major burden on maternal and child health, especially in low- and middle-income countries where prevalence exceeds 19%. Despite advancements in machine learning for PPD prediction, current approaches are limited by opaque global explanations that lack clinical usefulness at the patient level, unstable feature selection, and poor generalization under class imbalance. We propose SAGE, a Stability-Aware Graph-Based Ensemble feature selection system that incorporates both local explainable AI and a genetically optimized artificial neural network (GA-ANN). Using a primary cohort of 766 postpartum women, SAGE combines information-theoretic relevance, PCA-based structure, and graph-based interactions with bootstrap stability weighting to identify robust and non-redundant predictors. The GA-ANN architecture, optimized using a genetic algorithm and enhanced with GAN based oversampling, achieved strong performance with 87.96% accuracy, 86.32% F1 score, and 0.88 AUC using only 16 features, outperforming baseline and other feature selection methods. Psychological and socioeconomic factors such as EPDS score, PHQ-9 score, feelings about motherhood, and abuse history are the main predictors, while demographic factors have less influence. The LIME-based explanations allow instance-based insight into selected features from the graph, enabling personalized risk assessment. The findings make SAGE a scalable, interpretable, and clinical tool for early identification of PPD in health-care limited resources.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Md. Rokon Islam Emon, Syed Shariar Alam Shuvo, Shahriar Siddique Ayon, Abdullah Al Mamun, Ahnaf Atef Choudhury. 2026-08-24. SAGE: Stability-Aware Graph-Based Ensemble Feature Selection for Explainable Postpartum Depression Risk Prediction. https://arxiv.org/abs/2608.22809

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG