Challenge: Existing methods for minimizing the worst-case loss of annotated groups are lacking in practice due to expensive annotations and privacy issues.
Approach: They propose a distributionally robust optimization framework that relaxes group identification into direct parameterization by using an interactive training mode.
Outcome: The proposed method outperforms state-of-the-art methods on synthetic and real-world text classification tasks.

Similar Papers

Outlier-Aware Training for Improving Group Accuracy Disparities (2022.aacl-srw)

Copied to clipboard

Challenge: Methods addressing spurious correlations such as Just Train Twice involve reweighting a subset of the training set to maximize the worst-group accuracy.
Approach: They propose to reweight a subset of a training set to maximize the worst-group accuracy by detecting outliers and removing them before reweighing.
Outcome: The proposed method achieves competitive or better accuracy compared with JTT and can detect and remove annotation errors in the subset being reweighted in JTT.
Improving the Robustness of QA Models to Challenge Sets with Variational Question-Answer Pair Generation (2021.acl-srw)

Copied to clipboard

Challenge: Existing data augmentation methods for reading comprehension lack robustness to challenge sets whose distribution is different from that of training sets.
Approach: They propose a question-answer pair generation method that generates multiple diverse QA pairs from a paragraph to mitigate this problem.
Outcome: The proposed model improves the accuracy of 12 challenge sets and the in-distribution accuracy.
Can Data Diversity Enhance Learning Generalization? (2022.coling-1)

Copied to clipboard

Challenge: a diversity advanced actor-critical reinforcement learning framework is used to improve NLP generalization and accuracy.
Approach: They introduce Diversity Advanced Actor-Critic reinforcement learning framework to improve NLP generalization and accuracy.
Outcome: The proposed framework outperforms domain adaptation and generalization baselines without using any target domain knowledge.
GAPO: Robust Advantage Estimation for Real-World Code LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Reinforcement learning (RL) is widely used for post-training large language models (LLMs) in code editing, but in real-world code editing scenarios, reward distributions are often skewed with unpredictable noise, leading to distorted advantage computation and increased rollout outliers.
Approach: They propose a group-relative method that finds an interval with the highest SNR and uses the median of that interval as an adaptive Q to replace the group mean in advantage calculation.
Outcome: The proposed method improves on nine instruction-tuned LLMs while remaining plug-and-play and efficient.
An Empirical Study on Robustness to Spurious Correlations using Pre-trained Language Models (2020.tacl-1)

Copied to clipboard

Challenge: Recent work shows that pre-trained language models perform poorly on challenging datasets where spurious correlations do not hold.
Approach: They propose to use multi-task learning to improve generalization from minority examples . they propose to combine MTL with auxiliary tasks to improve performance .
Outcome: The proposed model generalizes from minority examples without hurting in-distribution performance.
Group-Aware Reinforcement Learning for Output Diversity in Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Large Language Models suffer from mode collapse, repeatedly generating the same few completions even when many valid answers exist.
Approach: They propose a group-aware policy optimization extension of GRPO that computes rewards over the group as a whole.
Outcome: The proposed model improves on standard LLM benchmarks without compromising accuracy.
Can Out-of-Distribution Evaluations Uncover Reliance on Prediction Shortcuts? A Case Study in Question Answering (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing work assesses models’ generalization capabilities through the lens of performance on out-of-distribution (OOD) datasets.
Approach: They challenge this assumption by comparing OOD evaluations with failure modes documented in existing question-answering (QA) models.
Outcome: The proposed evaluations show that the models' generalization capabilities are under-performing on out-of-distribution datasets, while others are underperforming on in-difference datasets.
SAFO: Stable Adaptive Fairness Optimization for LLM-Based Social Survey Simulation (2026.acl-long)

Copied to clipboard

Challenge: Social survey simulations are increasingly used to improve minority performance and social-welfare metrics.
Approach: They propose a dynamic utility–fairness optimization framework for LLM-based survey simulation that explicitly targets fairness and training stability.
Outcome: The proposed framework improves minority performance and social-welfare metrics on three large-scale survey datasets from China, the U.S. and Europe.
Distributional Clarity: The Hidden Driver of RL-Friendliness in Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: RL-friendly models exhibit intra-class compactness and inter-class separation in probability assignments . under identical training, Qwen models achieve substantial gains, while others like Llama yield limited improvements.
Approach: They propose a method to quantify distributional clarity in probability space . they show distributional clearness is a trainable property underlying RL-Friendliness .
Outcome: The proposed model families achieve substantial gains under identical training, while others like Llama yield limited improvements.
Distributionally Robust Language Modeling (D19-1)

Copied to clipboard

Challenge: Language models are generally trained on data spanning a wide range of topics but might be applied to an unknown target distribution.
Approach: They propose a distributionally robust optimization procedure which minimizes the loss of the model over the worst-case mixture of topics with sufficient overlap with the training distribution.
Outcome: The proposed method reduces the loss of the model over the worst-case mixture of topics with sufficient overlap with the training distribution.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations