Skip to content
Open access

Adaptive gradient-norm weighting for improved domain adversarial training

Jul 2026 · International Journal of Data Science and Analysis · Vol 22 · 0 citations · 45 references

TL;DR

Adaptive Gradient-Norm Weighting (AWD), a lightweight scalarization mechanism that dynamically adjusts gradient norms of the classification and alignment losses in UDA consistently improves average performance over fixed and scheduled baselines, with the strongest gains on more difficult transfer settings.

Abstract

Unsupervised domain adaptation (UDA) transfers knowledge from a labeled source domain to an unlabeled target domain by jointly optimizing source classification and domain-alignment objectives. A key practical challenge is selecting the trade-off coefficient λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, which controls the strength of domain alignment. Fixed values and manually designed schedules are commonly used, but the appropriate balance can vary across datasets, transfer directions, and training stages. This paper proposes Adaptive Gradient-Norm Weighting (AWD), a lightweight scalarization mechanism that dynamically adjusts λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document} using the ratio between the gradient norms of the classification and alignment losses. AWD introduces no additional learnable parameters and can be applied to UDA objectives of the form LCE+λLAlign\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {L}_{\textrm{CE}}+\lambda \mathcal {L}_{\textrm{Align}}$$\end{document}. We evaluate AWD within Deep Adaptation Network (DAN) and Domain-Adversarial Neural Network (DANN) on Office-31, Office-Home, DomainNet, and digit adaptation benchmarks using five independent seeds. Across the evaluated benchmarks, AWD consistently improves average performance over fixed and scheduled baselines, with the strongest gains on more difficult transfer settings. On Office-Home with DANN, AWD improves average accuracy over fixed λ=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda {=}1$$\end{document} by +4.4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$+4.4$$\end{document} percentage points, while avoiding manual per-task grid search. The method incurs only modest computational overhead. Overall, the results show that gradient-aware adaptive weighting is a simple, practical, and interpretable mechanism for balancing classification and alignment losses in UDA.

Read PDF

Similar papers

#machine learning Open access Sep 2026

Sparse oblique rule boosting for simpler additive rule ensembles

The proposed method achieves lower model complexity than competitive baselines while maintaining similar or better predictive accuracy and reduces the reliance on manual feature engineering.

Shahrzad Behzadimanesh, P. Le Bodic, Geoffrey I. Webb et al. · 0 citations
Open access Aug 2026

Tuning Social Indexes on Training-Data

To help a (perhaps artificial) policy decider compare the performance of its (perhaps artificial) social agents, a type of abstract evaluation machine is presented that could be used in various concrete operative situations. Designed on a sequence of progressively more challenging objectives on the chain \documentclass...

G. D'Epifanio · 0 citations
Aug 2026

Flexibly Incorporating Prior Information Into Subset Scan Statistics

It is demonstrated that this approach maintains computational efficiency and exact detection of the highest-scoring subset for small-sized filter sets, and initial results for scaling to larger-sized filter sets are presented.

Daniel B. Neill, Shi-Zhan Gong, Ellie Haber et al. · 0 citations
Open access Dec 2025

Adaptive Accelerated Gradient Method for Smooth Convex Optimization

The method incorporates a scheme to determine the step size adaptively, by means of a local estimation of the smoothness constant, by means of a local estimation of the smoothness constant, without resorting to line search procedures.

Zepeng Wang, J. Peypouquet · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.