AI Paper Atlas

Research map / Optimization / Optimizers

Surrogate losses and robust solvers

Proposes tailored losses, quantization regularizers, and fast solvers for specific learning problems.

119 accepted papers at ICML, NeurIPS, ICLR, CVPR and AAAI (2016–2026) · an approach in Optimizers, keyword cluster “differentiable · functions · loss”

State History Tried 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.

31 papers in 2023–24 and 29 in 2025–26 (at ICML, NeurIPS, ICLR, CVPR and AAAI); its share of the topic shrank, from 12.8% to 10.0%.

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: 3162017: 7172018: 7182019: 15192020: 12202021: 8212022: 7222023: 12232024: 19242025: 15252026: 1426

Most cited paper of each year

Earliest papers here

What has been tried

101 papers here report 895 measured changes (a component added, removed or swapped, compared with a baseline): helped 69%, no clear effect 8%, hurt 18%, mixed 5%. Papers mostly publish changes that helped, so "helped" is over-represented.

Ablations in recent papers

What was changedMeasured onResultEffectPaper
add text knowledge by learning class-wise blending parameters instead of setting αk = 011 benchmarks, 1-shot · accuracy35.55 -> 63.43HelpedLP++: A Surprisingly Strong Linear Probe for Few-Shot CLIP (CVPR 2024 · 30 citations)
increase the inverse Hessian approximation sizeAAPM, 32 views, no noise · PSNR (dB)35.69 -> 38.11 -> 39.37 -> 39.51HelpedQN-Mixer: A Quasi-Newton MLP-Mixer Model for Sparse-View CT Reconstruction (CVPR 2024 · 11 citations)
Add R-on (implicit online Hessian approximation) to joint GA+FTCIFAR-10 random subset forgetting (10%), ResNet-18 · Avg.D3.20 -> 2.00HelpedUnified Gradient-Based Machine Unlearning with Remain Geometry Enhancement (NeurIPS 2024 · 8 citations)
Remove weight renormalization (ct scaling) from the proposed solutionsKodak, lambda=0.013 · R-D curve convergenceHelpedBalanced Rate-Distortion Optimization in Learned Image Compression (CVPR 2025 · 7 citations)
reduce batch size from 32 to 1MNIST, training from scratch, σ=0.03 · test accuracy0.87 to 0.64HurtCertified Machine Unlearning via Noisy Stochastic Gradient Descent (NeurIPS 2024 · 5 citations)
add the improved noise scheduleCIFAR-10, N=10 · FID16.86 -> 13.25HelpedInterpreting and Improving Diffusion Models from an Optimization Perspective (ICML 2024 · 4 citations)
Use softsign rather than entmoid or sigmoid split activation19 binary classification datasets · Normalized Mean macro F10.2207 -> 0.7906HelpedGRANDE: Gradient-Based Decision Tree Ensembles for Tabular Data (ICLR 2024 · 3 citations)
Set moving-average β to 0.9 rather than 0.99BBBP · ROC-AUC0.961 ± 0.012 -> 0.958 ± 0.014HurtEfficient Sharpness-Aware Minimization for Molecular Graph Transformer Models (ICLR 2024 · 2 citations)
use a proximal step on data fidelityCBSD68 inpainting, random mask p=0.5 · PSNR31.65 -> 31.94HelpedPlug-and-Play image restoration with Stochastic deNOising REgularization (ICML 2024 · 1 citation)
Increase magnitude regularization strength from λ=0 to λ=1MNIST · Generalization gap0.0736 -> 0.0464HelpedApproximating Metric Magnitude of Point Sets (AAAI 2025 · 0 citations)
Vary the noise assumed when estimating privacy-loss rankingsSVHN, ResNet-18 · Spearman correlation0.70 (p = 0.0); 0.99 (p = 0.0); 0.99 (p = 0.0)No clear effectLeveraging Per-Instance Privacy for Machine Unlearning (ICML 2025 · 0 citations)
Add sparse deviationsSuper-resolution, CelebA · LPIPS, PSNR, and SSIMHelpedIntegrating Intermediate Layer Optimization and Projected Gradient Descent for Solving Inverse Problems with Diffusion Models (ICML 2025 · 0 citations)

What reviewers will expect

Datasets and baselines named in the 16 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 · 7 of 16 papers
  • ImageNet · 4 of 16 papers
  • CIFAR100 · 2 of 16 papers

Baselines

  • L1-Sparse · 2 of 16 papers
  • SalUn · 2 of 16 papers

Recent preprints

Loading recent arXiv preprints…

    Who publishes on it

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

    Use it

    Download BibTeX of 39 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