Pith. sign in

REVIEW 11 cited by

Gradient Matching for Domain Generalization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2104.09937 v3 pith:W3MMOFUD submitted 2021-04-20 cs.LG stat.ML

classification cs.LGstat.ML
keywords benchmarkdatasetsdomaingeneralizationgradientacrosscapturescompetitive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Machine learning systems typically assume that the distributions of training and test sets match closely. However, a critical requirement of such systems in the real world is their ability to generalize to unseen domains. Here, we propose an inter-domain gradient matching objective that targets domain generalization by maximizing the inner product between gradients from different domains. Since direct optimization of the gradient inner product can be computationally prohibitive -- requires computation of second-order derivatives -- we derive a simpler first-order algorithm named Fish that approximates its optimization. We demonstrate the efficacy of Fish on 6 datasets from the Wilds benchmark, which captures distribution shift across a diverse range of modalities. Our method produces competitive results on these datasets and surpasses all baselines on 4 of them. We perform experiments on both the Wilds benchmark, which captures distribution shift in the real world, as well as datasets in DomainBed benchmark that focuses more on synthetic-to-real transfer. Our method produces competitive results on both benchmarks, demonstrating its effectiveness across a wide range of domain generalization tasks.

Discussion (0). Sign in to comment.

Forward citations

Cited by 11 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Invariant Gradient Alignment for Robust Reasoning Distillation

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    Invariant Gradient Alignment uses Logical Isomer Sets and a Continuous Gradient Conflict Mask to tighten OOD generalization bounds and boost empirical performance over ERM in reasoning distillation.

  2. Continual Learning of Domain-Invariant Representations

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    Introduces replay-based continual learning with sequential invariance alignment to learn domain-invariant representations, outperforming baselines on generalization to unseen domains across six datasets in vision, med...

  3. Assessing Distribution Shift in Human Activity Recognition for Domain Generalization

    cs.AI 2026-06 unverdicted novelty 6.0 of 10

    Evaluates four distribution shifts in sensor-based HAR, finds diversity shifts dominate, and shows 28 DG methods only marginally beat ERM while releasing open benchmarks.

  4. Learning Gradient-based Mixup with Extrapolation toward Flatter Minima for Domain Generalization

    cs.LG 2022-09 unverdicted novelty 6.0 of 10

    FGMix learns instance weights via gradient compatibilities to perform mixup with extrapolation toward flatter minima, outperforming prior DG methods on DomainBed.

  5. Towards Truly Multilingual ASR: Generalizing Code-Switching ASR to Unseen Language Pairs

    cs.CL 2026-06 unverdicted novelty 5.0 of 10

    Merged bilingual CS-ASR models show only modest generalization to unseen language pairs, indicating limited transfer of code-switching capabilities.

  6. Environment-Robust Representation Learning with Empirical Bayes

    stat.ML 2026-06 unverdicted novelty 5.0 of 10

    An empirical Bayes variational inference method learns environment-robust latent variables from multi-environment data for improved prediction in unseen environments.

  7. Beyond Instance-Level Self-Supervision in 3D Multi-Modal Medical Imaging

    cs.CV 2026-05 unverdicted novelty 5.0 of 10

    A self-supervised approach uses consistent spatial relationships of anatomical structures across patients to improve 3D multi-modal medical image representations, yielding modest gains on segmentation and classificati...

  8. Causal Fine-Tuning under Latent Confounded Shift

    cs.LG 2024-10 unverdicted novelty 5.0 of 10

    Causal Fine-Tuning decomposes BERT representations into causal and spurious parts via SCM inductive bias to improve robustness under latent confounded shifts in text classification.

  9. Technical note on Sequential Test-Time Adaptation via Martingale-Driven Fisher Prompting

    cs.LG 2025-10 conditional novelty 4.0 of 10

    M-FISHER combines an anytime-valid martingale shift detector with Fisher/natural-gradient prompt updates for streaming test-time adaptation of CLIP, with modest empirical gains and largely standard theory.

  10. Single Domain Generalization in Diabetic Retinopathy: A Neuro-Symbolic Learning Approach

    cs.CV 2025-09 reject novelty 4.0 of 10

    KG-DG fuses YOLO-derived lesion features with a frozen ViT via confidence-based fusion and claims gains in diabetic retinopathy domain generalization, but the central KL-divergence mechanism and the MDG headline are c...

  11. Domain-Generalization to Improve Learning in Meta-Learning Algorithms

    cs.LG 2025-08 reject novelty 4.0 of 10

    DGS-MAML layers gradient matching onto SharpMAML and claims O(1/T) convergence and tighter PAC-Bayes bounds, but the displayed theorems give O(1/sqrt T) under the paper's own parameter choices.

Pith tools