AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Distributionally robust optimization

Train models against worst-case distributions using robust optimization formulations.

184 accepted papers at ICML, NeurIPS, ICLR, CVPR and AAAI (2016–2026) · an approach in Prediction and decision losses, keyword cluster “selection · robust · test”

State History Tried Baselines Checklist Preprints Who Export

Where it stands

Not enough benchmark data Fewer than four papers report the same benchmark, so there is no record to follow.

45 papers in 2023–24 and 46 in 2025–26 (at ICML, NeurIPS, ICLR, CVPR and AAAI); its share of the topic held steady, from 8.4% to 8.0%.

Open questions the data points to

How this is decided

A benchmark is tracked when at least four papers of this approach report their own method on the same dataset and metric in at least two different years. Its record is the best number reported up to 2024 compared with the best reported in 2025–26: still improving means at least 1% better, flat means at most 0.2% better with at least two papers from 2025–26 trying. Numbers on a different scale from the rest (a fraction among percentages) and far outliers are left out. Results come from different papers with different setups, so they are signals, not head-to-head comparisons. The share of papers is counted at ICML, NeurIPS, ICLR, CVPR and AAAI.

How it got here

2016: 8162017: 11172018: 8182019: 6192020: 19202021: 20212022: 21222023: 21232024: 24242025: 22252026: 2426

Most cited paper of each year

Earliest papers here

What has been tried

149 papers here report 1,317 measured changes (a component added, removed or swapped, compared with a baseline): helped 64%, no clear effect 12%, hurt 17%, mixed 7%. Papers mostly publish changes that helped, so "helped" is over-represented.

Ablations in recent papers

What was changedMeasured onResultEffectPaper
Use Exp instead of ReLU activation in DERSST-5 · MSEHelpedThe Evidence Contraction Issue in Deep Evidential Regression: Discussion and Solution (AAAI 2024 · 14 citations)
Vary the uncertainty regularization coefficient λ₁Cubic regression outside HUA · uncertainty estimationMixedUncertainty Regularized Evidential Regression (AAAI 2024 · 13 citations)
remove elevation predictorNew Zealand · MSE63.6±2.0 -> 65.2±1.4HurtQuantile-Regression-Ensemble: A Deep Learning Algorithm for Downscaling Extreme Precipitation (AAAI 2024 · 11 citations)
Replace sparse aggregation with Q-aggregationSynthetic Model II · MISENo clear effectTransfer Learning Meets Functional Linear Regression: No Negative Transfer Under Posterior Drift (AAAI 2025 · 2 citations)
Expand the sigma search interval, holding step τ=0.4 and left endpoint at 0.12CIFAR-10, σ=0.5, id%50==0 · ACR0.619; 0.627; 0.638HelpedTowards Large Certified Radius in Randomized Smoothing Using Quasiconcave Optimization (AAAI 2024 · 1 citation)
increase slider τ from 0 to 0.9Normal, p=5, δ=2, n=500 · empirical power (%)46.9 -> 100.0HelpedZipper: Addressing Degeneracy in Algorithm-Agnostic Inference (NeurIPS 2024 · 1 citation)
Add structural regularization with moderate λ (around 1.0) rather than λ = 0FMoW-WILDS Test Middle and Test After 2016 · worst-region accuracy (%)HelpedStructure-informed Risk Minimization for Robust Ensemble Learning (ICML 2025 · 0 citations)
Use the α-hat-prime weight estimator instead of α-hatFinite-sample estimation across evaluated datasets · MSEMixedA Novel Characterization of the Population Area Under the Risk Coverage Curve (AURC) and Rates of Finite Sample Estimators (ICML 2025 · 0 citations)
Project influence estimates onto high-curvature eigenspaces, excluding lower-curvature directionsMNIST and FashionMNIST · LDSHurtBetter Training Data Attribution via Better Inverse Hessian-Vector Products (NeurIPS 2025 · 0 citations)
Set VAE bottleneck dimension to L=2 rather than L=4 or L=8New England capacity expansion · VaR approximation error14% (52) vs 114% (64) and 112% (40)HelpedA Deep Generative Learning Approach for Two-stage Adaptive Robust Optimization (ICLR 2025 · 0 citations)
Use vector parameterization instead of neural-network parameterizationSpambase · logistic test loss2.57 ± 0.19 vs 2.56 ± 0.13No clear effectA Differentiable Rank-Based Objective for Better Feature Learning (ICLR 2025 · 0 citations)
Increase the initial regularization ρBaird's Example · early convergence speedHelpedRegularized Q-learning through Robust Averaging (ICML 2024 · 0 citations)

Baseline numbers that disagree

The same baseline on the same benchmark and metric, reported more than 5% apart by different papers here. Training budgets, data splits and reimplementations differ, so state which number you compare with.

BaselineBenchmarkMetricReportedPapers
ERMWaterBirds testaverage accuracy85.2 – 97.12 papers, e.g. ICLR 2022 and ICLR 2023

What reviewers will expect

Datasets and baselines named in the 26 papers of this approach from 2025–2026 that have a full-text summary. Leaving out the common ones is a frequent review question.

Datasets

  • CIFAR-10 · 5 of 26 papers
  • Waterbirds · 3 of 26 papers
  • CivilComments · 3 of 26 papers
  • MNIST · 3 of 26 papers
  • CIFAR100 · 2 of 26 papers
  • UCI Concrete · 2 of 26 papers
  • QSAR · 2 of 26 papers
  • Metashift · 2 of 26 papers

Baselines

  • ERM · 3 of 26 papers
  • Random · 3 of 26 papers
  • Mixup · 2 of 26 papers
  • GroupDRO · 2 of 26 papers

Recent preprints

Loading recent arXiv preprints…

    Who publishes on it

    Institutions on the most papers of this approach since 2023 (of 91 papers; from OpenAlex and the papers' affiliations).

    Use it

    Download BibTeX of 40 key papersOpen the topic in the interactive map

    Get alerts. Describe your idea in scime atlas and save it (free scime account): you get a weekly email when new preprints land close to it.

    Same keyword cluster

    Elsewhere in the topic

    Benchmark numbers, ablations and baseline numbers are extracted by AI from each paper's full text and can be wrong; the paper is the authority. Data: results index of 2026-11-02, citation counts from OpenAlex (2026-10-09).

    Get the next scime Dispatch and a monthly field update

    Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy