Population-Robust Feature Selection via Generalized Welfare Optimization

• URL: http://arxiv.org/abs/2608.02887v1
• Date: Mon, 03 Aug 2026 21:16:54 GMT
• Title: Population-Robust Feature Selection via Generalized Welfare Optimization
• Abstract summary: We introduce PopFS, a method for learning one shared, deployable feature set that is robust to population differences.<n>Across eight population splits from six prediction tasks, PopFS consistently achieves strong average and worst-population performance.
• Score: 14.31847187460321
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Choosing which features to collect is a deployment decision: the same limited questionnaire, test panel, or sensor set may need to serve several heterogeneous populations. Standard feature-selection methods typically optimize for one large population, while existing robust approaches tend to learn one shared model for every population. We introduce PopFS, a method for learning one shared, deployable feature set that is robust to population differences while letting each pop- ulation train its own model. PopFS uses a tunable welfare objective that lets practitioners balance overall predictive ben- efit against stronger protection of the populations that benefit least. To make this objective practical at scale, PopFS first uses multitask sparse learning to reduce the candidate pool, then searches directly over hard feature sets by ranking promising additions and swaps and fully refitting only a shortlist. Across eight population splits from six prediction tasks drawn from five tabular and public-health datasets, PopFS consistently achieves strong average and worst-population performance while scaling to thousands of candidate features. A 43-state COVID-19 nowcasting study further shows that changing the welfare objective can improve the least-served states with lit- tle change in average performance and yields an interpretable change in the selected symptom signals. Our code is available at https://github.com/Rachel-Lyu/PopFS.

Related papers

• Towards Scaling Reinforcement Learning to Massive Populations: Learning Mean-Field Representations [21.920988041622035]
  In large-population systems, the dynamics depend on an aggregate summary of the population rather than the identity of any individual.<n>We introduce a mean-field RL framework in which the rewards and transition dynamics depend on the population only through an unknown low-dimensional aggregate statistic.<n>Motivated by real-life supply-chain optimization problems, we design a one-step routing game to test the hypothesis that learning a low-dimensional population representation improves reward prediction.
  arXiv  Detail & Related papers  (2026-08-26T18:54:16Z)
• Beyond Mode Collapse: Distribution Matching for Diverse Reasoning [69.88237286885065]
  On-policy reinforcement learning methods like GRPO suffer from mode collapse.<n>We show this stems from reverse KL minimization's mode-seeking behavior.<n>We propose DMPO, which prevents mode collapse through principled approximation of forward KL minimization.
  arXiv  Detail & Related papers  (2026-05-19T07:13:00Z)
• Response Time Enhances Alignment with Heterogeneous Preferences [49.69696266152175]
  We show that augmenting preference datasets with a simple, secondary signal can restore identifiability of the population's average preference.<n>Our results bring promises and open up new opportunities for future data-collection pipelines.
  arXiv  Detail & Related papers  (2026-05-07T22:05:23Z)
• Diverse Prototypical Ensembles Improve Robustness to Subpopulation Shift [10.04893653044606]
  Subpopulationtion shift can significantly degrade the performance of machine learning models.<n>We propose using an ensemble of diverse classifiers to adaptively capture risk associated with subpopulations.<n>Our method of Diverse Prototypical Ensembles (DPEs) often outperforms the prior state-of-the-art in worst-group accuracy.
  arXiv  Detail & Related papers  (2025-05-29T03:12:56Z)
• MaxMin-RLHF: Alignment with Diverse Human Preferences [101.57443597426374]
  Reinforcement Learning from Human Feedback (RLHF) aligns language models to human preferences by employing a singular reward model derived from preference data.<n>We learn a mixture of preference distributions via an expectation-maximization algorithm to better represent diverse human preferences.<n>Our algorithm achieves an average improvement of more than 16% in win-rates over conventional RLHF algorithms.
  arXiv  Detail & Related papers  (2024-02-14T03:56:27Z)
• Confidence-Based Model Selection: When to Take Shortcuts for Subpopulation Shifts [119.22672589020394]
  We propose COnfidence-baSed MOdel Selection (CosMoS), where model confidence can effectively guide model selection. We evaluate CosMoS on four datasets with spurious correlations, each with multiple test sets with varying levels of data distribution shift.
  arXiv  Detail & Related papers  (2023-06-19T18:48:15Z)
• Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms [23.248796792928204]
  Population update is a key component in multi-objective Evolutionary algorithms (MOEAs)<n>In this paper, we analytically present that population update can be beneficial for the search of MOEAs.<n>Specifically, we prove that the expected running time of two well-established MOEAs, SMS-EMOA and NSGA-II, for solving two bi-objective problems, OneJumpZero and bi-RoyalRoad, can be exponentially decreased if replacing its deterministic population update mechanism with a randomness one.
  arXiv  Detail & Related papers  (2023-06-05T05:54:56Z)
• Learnable Behavior Control: Breaking Atari Human World Records via Sample-Efficient Behavior Selection [80.35510218548693]
  We propose a general framework called Learnable Behavioral Control (LBC) to address the limitation.<n>Our agents have achieved 10077.52% mean human normalized score and surpassed 24 human world records within 1B training frames.
  arXiv  Detail & Related papers  (2023-05-09T08:00:23Z)
• Local Prediction Aggregation: A Frustratingly Easy Source-free Domain Adaptation Method [39.31881646860522]
  We propose a simple but effective source-free domain adaptation (SFDA) method. Treating SFDA as an unsupervised clustering problem, we optimize an objective of prediction consistency. Our method can be adopted as a simple but strong baseline for future research in SFDA.
  arXiv  Detail & Related papers  (2022-05-09T10:49:08Z)
• Balancing Biases and Preserving Privacy on Balanced Faces in the Wild [50.915684171879036]
  There are demographic biases present in current facial recognition (FR) models. We introduce our Balanced Faces in the Wild dataset to measure these biases across different ethnic and gender subgroups. We find that relying on a single score threshold to differentiate between genuine and imposters sample pairs leads to suboptimal results. We propose a novel domain adaptation learning scheme that uses facial features extracted from state-of-the-art neural networks.
  arXiv  Detail & Related papers  (2021-03-16T15:05:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.