Papers › Consistency Regularization for Domain Generalization with Logit Attribution Matching

Consistency Regularization for Domain Generalization with Logit Attribution Matching

13 May 2023arXiv:2305.07888archive 2025-07-28

Han Gao, Kaican Li, Weiyan Xie, Zhi Lin, Yongxiang Huang, Luning Wang, Caleb Chen Cao, Nevin L. Zhang

Domain generalization (DG) is about training models that generalize well under domain shift. Previous research on DG has been conducted mostly in single-source or multi-source settings. In this paper, we consider a third, lesser-known setting where a training domain is endowed with a collection of pairs of examples that share the same semantic information. Such semantic sharing (SS) pairs can be created via data augmentation and then utilized for consistency regularization (CR). We present a theory showing CR is conducive to DG and propose a novel CR method called Logit Attribution Matching (LAM). We conduct experiments on five DG benchmarks and four pretrained models with SS pairs created by both generic and targeted data augmentation methods. LAM outperforms representative single/multi-source DG methods and various CR methods that leverage SS pairs. The code and data of this project are available at https://github.com/Gaohan123/LAM

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2305.07888")

Code

Syntology Ran 0 of 11 code samples harvested from 1 repository linked to this paper; 11 have no recorded run.

By repository: official repository: 11 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

gaohan123/lam officialmentioned in paperpytorchApache-2.0 report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 0 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

11unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from gaohan123/lam. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

build_model gaohan123/lam/src/models/model_utils.py official repository unverified Apache-2.0 (permissive) · 2004e8d9ede9e29c · report
copy_paste_augmentation gaohan123/lam/train_lam.py official repository unverified Apache-2.0 (permissive) · 8d54de902865d503 · report
get_argmax_valid gaohan123/lam/utils.py official repository unverified Apache-2.0 (permissive) · bada690a17a379cb · report
get_bbox gaohan123/lam/copy_paste_aug/wild_mask_bbox.py official repository unverified Apache-2.0 (permissive) · 7a5537948fe58d0d · report
get_empty_img_by_y gaohan123/lam/copy_paste_aug/select_bg.py official repository unverified Apache-2.0 (permissive) · 8861e302edc9b24c · report
get_mask gaohan123/lam/copy_paste_aug/wild_mask_bbox.py official repository unverified Apache-2.0 (permissive) · 05ae9c1f9ae97e0b · report
get_param_weights_counts gaohan123/lam/src/models/model_utils.py official repository unverified Apache-2.0 (permissive) · d13d13177ef6bd70 · report
isin gaohan123/lam/copy_paste_aug/select_bg.py official repository unverified Apache-2.0 (permissive) · b34edff3ffec4fa0 · report
make_checkpoints_dir gaohan123/lam/utils.py official repository unverified Apache-2.0 (permissive) · 0de6908df376c724 · report
sample_empty_img_given_mask gaohan123/lam/copy_paste_aug/select_bg.py official repository unverified Apache-2.0 (permissive) · 0e2fc0ac5d13251f · report
xywh_to_xyxy gaohan123/lam/copy_paste_aug/wild_mask_bbox.py official repository unverified Apache-2.0 (permissive) · 427485a15e05cc2c · report

Tasks

Data AugmentationDomain Generalization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Test

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections