Papers › Boosting Multi-modal Model Performance with Adaptive Gradient Modulation

Boosting Multi-modal Model Performance with Adaptive Gradient Modulation

15 Aug 2023ICCV 2023 1arXiv:2308.07686archive 2025-07-28

Hong Li, Xingyu Li, Pengbo Hu, Yinuo Lei, Chunxiao Li, Yi Zhou

While the field of multi-modal learning keeps growing fast, the deficiency of the standard joint training paradigm has become clear through recent studies. They attribute the sub-optimal performance of the jointly trained model to the modality competition phenomenon. Existing works attempt to improve the jointly trained model by modulating the training process. Despite their effectiveness, those methods can only apply to late fusion models. More importantly, the mechanism of the modality competition remains unexplored. In this paper, we first propose an adaptive gradient modulation method that can boost the performance of multi-modal models with various fusion strategies. Extensive experiments show that our method surpasses all existing modulation methods. Furthermore, to have a quantitative understanding of the modality competition and the mechanism behind the effectiveness of our modulation method, we introduce a novel metric to measure the competition strength. This metric is built on the mono-modal concept, a function that is designed to represent the competition-less state of a modality. Through systematic investigation, our results confirm the intuition that the modulation encourages the model to rely on the more informative modality. In addition, we find that the jointly trained model typically has a preferred modality on which the competition is weaker than other modalities. However, this preferred modality need not dominate others. Our code will be available at https://github.com/lihong2303/AGM_ICCV2023.

PaperPDFConference PDFCodeCode 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="2308.07686")

Code

Syntology Ran 10 of 15 code samples harvested from 1 repository linked to this paper; 5 have no recorded run. Of those that ran: 3 ran · our draft was wrong; 7 ran with no contract checked.

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

lihong2303/agm_iccv2023 officialmentioned in papermentioned on GitHubpytorchMIT 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

15 samples harvested; 10 ran; 0 honoured the contract we drafted; 5 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.

3ran · our draft was wrong
7ran
5unverified

Licence: 0 of the 15 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 lihong2303/AGM_ICCV2023. “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.

AVGA lihong2303/AGM_ICCV2023/model/AVE_net.py official repository ran MIT (permissive) · aafb78dc73a6b848 · report
AVSimilarity lihong2303/AGM_ICCV2023/model/AVE_net.py official repository ran · metamorphic tier: invariant fingerprinted MIT (permissive) · c31fa6db2f989e02 · report
Classify lihong2303/AGM_ICCV2023/model/AVE_net.py official repository ran · metamorphic tier: invariant MIT (permissive) · a38cd2fd289e8d54 · report
Modality_Audio lihong2303/AGM_ICCV2023/model/AVE_net.py official repository ran fingerprinted MIT (permissive) · e36f4b0eccf5a497 · report
Modality_Visual lihong2303/AGM_ICCV2023/model/AVE_net.py official repository ran fingerprinted MIT (permissive) · 430f6c316c7ba522 · report
Modality_out lihong2303/AGM_ICCV2023/model/AVE_net.py official repository ran · metamorphic tier: invariant fingerprinted MIT (permissive) · ab2703b195dbc96f · report
conv1x1 lihong2303/agm_iccv2023/model/utils/resnet.py official repository ran · our draft was wrong MIT (permissive) · d9def42110729a85 · report
conv3x3 lihong2303/agm_iccv2023/model/utils/resnet.py official repository ran · our draft was wrong MIT (permissive) · 160bb14bd76201b4 · report
drop_entry lihong2303/agm_iccv2023/dataloader/URFunny_loader.py official repository ran MIT (permissive) · b58de7ad57448696 · report
make_mask lihong2303/agm_iccv2023/model/MOSEI_net.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · e766a0a3063c15d0 · report
GradMod lihong2303/AGM_ICCV2023/model/AVE_net.py official repository unverified MIT (permissive) · bec85adae7b780cd · report
LSTM_A_V lihong2303/AGM_ICCV2023/model/AVE_net.py official repository unverified MIT (permissive) · fb623012ed4c33ad · report
PSP lihong2303/AGM_ICCV2023/model/AVE_net.py official repository unverified MIT (permissive) · c4b3c64906d5d20e · report
psp_net lihong2303/AGM_ICCV2023/model/AVE_net.py official repository unverified MIT (permissive) · 99749a0d159a5471 · report
resnet18 lihong2303/agm_iccv2023/model/utils/resnet.py official repository unverified MIT (permissive) · 9c84dee251170b5d · report

Tasks

Attribute

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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