Logo image
Learning the Robustness Mechanism with Bilevel Optimization
Preprint   Open access

Learning the Robustness Mechanism with Bilevel Optimization

Yiyang Shen, Qihang Lin and Weiran Wang
arXiv
arXiv
09/28/2026
DOI: 10.48550/arxiv.2609.35541
url
https://doi.org/10.48550/arxiv.2609.35541View
Preprint (Author's original) This preprint has not been evaluated by subject experts through peer review. Preprints may undergo extensive changes and/or become peer-reviewed journal articles. Open Access

Abstract

We propose a distributionally robust learning framework where parameters defining the robustness mechanism are learned from held-out data instead of extensively tuned. Using bilevel optimization with both upper and lower level minimax problems, we create two instances of our framework to tackle setups with and without group labels in the training set. Theoretically, we provide sample complexity analysis for our robustness mechanism learning paradigm, showing that it achieves generalization guarantees comparable to exhaustive grid search while being more computationally efficient. Empirically, we evaluate our framework under a challenging setup when both intra-group and inter-group test distribution shifts occur at the same time, thereby demonstrating the efficacy and scalability of our method.
Computer Science - Learning

Details

Metrics

1 Record Views
Logo image