mlsanityData to 7 Oct 2026

Rich Feature Construction for the Optimization-Generalization Dilemma

arXiv 2203.15516 ↗First posted 24 Mar 2022cs.LG cs.AIcited by 34

Not on the map. Why?

Abstract (arXiv)

There often is a dilemma between ease of optimization and robust out-of-distribution (OoD) generalization. For instance, many OoD methods rely on penalty terms whose optimization is challenging. They are either too strong to optimize reliably or too weak to achieve their goals. We propose to initialize the networks with a rich representation containing a palette of potentially useful features, ready to be used by even simple models. On the one hand, a rich representation provides a good initialization for the optimizer. On the other hand, it also provides an inductive bias that helps OoD generalization. Such a representation is constructed with the Rich Feature Construction (RFC) algorithm, also called the Bonsai algorithm, which consists of a succession of training episodes. During discovery episodes, we craft a multi-objective optimization criterion and its associated datasets in a manner that prevents the network from using the features constructed in the previous iterations. During synthesis episodes, we use knowledge distillation to force the network to simultaneously represent all the previously discovered features. Initializing the networks with Bonsai representations consistently helps six OoD methods achieve top performance on ColoredMNIST benchmark. The same technique substantially outperforms comparable results on the Wilds Camelyon17 task, eliminates the high result variance that plagues other methods, and makes hyperparameter tuning and model selection more reliable.

Key facts. Cited by 34 papers in the map (data through 7 Oct 2026). Builds on 24 of its 36 references that are in the map. First posted on arXiv 24 Mar 2022.

Builds on

24 of 36 references.

References · 24

  1. 2016Densely Connected Convolutional Networkscited by 6,691
  2. 2013Intriguing properties of neural networkscited by 5,114
  3. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  4. 2019Invariant Risk Minimizationcited by 1,832
  5. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
  6. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
  7. 2018On First-Order Meta-Learning Algorithmscited by 1,003
  8. 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
  9. 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 737
  10. 2018Recognition in Terra Incognitacited by 655
  11. 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 522
  12. 2020Self-Challenging Improves Cross-Domain Generalizationcited by 426
12 more
  1. 2020Environment Inference for Invariant Learningcited by 306
  2. 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 283
  3. 2020Gradient Starvation: A Learning Proclivity in Neural Networkscited by 262
  4. 2021Gradient Matching for Domain Generalizationcited by 258
  5. 2021Fishr: Invariant Gradient Variances for Out-of-Distribution Generalizationcited by 186
  6. 2021On Calibration and Out-of-domain Generalizationcited by 134
  7. 2020Learning from Failure: Training Debiased Classifier from Biased Classifiercited by 133
  8. 2021Does Invariant Risk Minimization Capture Invariance?cited by 116
  9. 2021Evading the Simplicity Bias: Training a Diverse Set of Models Discovers Solutions with Superior OOD Generalizationcited by 83
  10. 2022Domain-Adjusted Regression or: ERM May Already Learn Features Sufficient for Out-of-Distribution Generalizationcited by 69
  11. 2021Predict then Interpolate: A Simple Algorithm to Learn Stable Classifierscited by 16
  12. 2021Meta-Learned Invariant Risk Minimizationcited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 14; 2023: 9; 2024: 4; 2025: 6; 2026: 1.

34 papers.

Sort:

By area:

  1. 2022On Feature Learning in the Presence of Spurious Correlationscited by 145
  2. 2022Model Ratatouille: Recycling Diverse Models for Out-of-Distribution Generalizationcited by 97
  3. 2022A Whac-A-Mole Dilemma: Shortcuts Come in Multiples Where Mitigating One Amplifies Otherscited by 85
  4. 2022Probable Domain Generalization via Quantile Risk Minimizationcited by 66
  5. 2023Towards Last-layer Retraining for Group Robustness with Fewer Annotationscited by 54
  6. 2022Pareto Invariant Risk Minimization: Towards Mitigating the Optimization Dilemma in Out-of-Distribution Generalizationcited by 38
  7. 2023Understanding and Improving Feature Learning for Out-of-Distribution Generalizationcited by 35
  8. 2024Calibrating Multi-modal Representations: A Pursuit of Group Robustness without Annotationscited by 30
  9. 2022SelecMix: Debiased Learning by Contradicting-pair Samplingcited by 29
  10. 2023Discovering environments with XRMcited by 26
  11. 2023Spurious Feature Diversification Improves Out-of-distribution Generalizationcited by 26
  12. 2022No Reason for No Supervision: Improved Generalization in Supervised Modelscited by 23
22 more
  1. 2022Mitigating Dataset Bias by Using Per-sample Gradientcited by 21
  2. 2023Spuriosity Didn't Kill the Classifier: Using Invariant Predictions to Harness Spurious Featurescited by 21
  3. 2022Nuisances via Negativa: Adjusting for Spurious Correlations via Data Augmentationcited by 18
  4. 2022Learning useful representations for shifting tasks and distributionscited by 14
  5. 2024FOOGD: Federated Collaboration for Both Out-of-distribution Generalization and Detectioncited by 14
  6. 2025Safety Reasoning with Guidelinescited by 14
  7. 2023Mitigating Simplicity Bias in Deep Learning for Improved OOD Generalization and Robustnesscited by 7
  8. 2022Malign Overfitting: Interpolation Can Provably Preclude Invariancecited by 6
  9. 2022Sufficient Invariant Learning for Distribution Shiftcited by 5
  10. 2023Domain Generalization by Rejecting Extreme Augmentationscited by 5
  11. 2023Robustness to Spurious Correlations Improves Semantic Out-of-Distribution Detectioncited by 4
  12. 2023Learning Diverse Features in Vision Transformers for Improved Generalizationcited by 4
  13. 2025TIF: Learning Temporal Invariance in Android Malware Detectorscited by 4
  14. 2022Learning an Invertible Output Mapping Can Mitigate Simplicity Bias in Neural Networkscited by 3
  15. 2024Fine-tuning with Very Large Dropoutcited by 3
  16. 2025Generalizable Prompt Learning of CLIP: A Brief Overviewcited by 3
  17. 2025Improving Group Robustness on Spurious Correlation via Evidential Alignmentcited by 3
  18. 2022Denoising after Entropy-based Debiasing A Robust Training Method for Dataset Bias with Noisy Labelscited by 1
  19. 2025Towards Generalizable PDE Dynamics Forecasting via Physics-Guided Invariant Learningcited by 1
  20. 2024Invariant Correlation of Representation with Label: Enhancing Domain Generalization in Noisy Environmentscited by 0
  21. 2025These Are Not All the Features You Are Looking For: A Fundamental Bottleneck in Supervised Pretrainingcited by 0
  22. 2026Learning domain-invariant features through channel-level sparsification for Out-Of Distribution Generalizationcited by 0