paper-with-me

홈 › Papers

DWMD: Dimensional Weighted Orderwise Moment Discrepancy for Domain-specific Hidden Representation Matching

2020-07-18 · Rongzhe Wei, Fa Zhang, Bo Dong, Qinghua Zheng

Knowledge transfer from a source domain to a different but semantically related target domain has long been an important topic in the context of unsupervised domain adaptation (UDA). A key challenge in this field is establishing a metric that can exactly measure the data distribution discrepancy between two homogeneous domains and adopt it in distribution alignment, especially in the matching of feature representations in the hidden activation space. Existing distribution matching approaches can be interpreted as failing to either explicitly orderwise align higher-order moments or satisfy the prerequisite of certain assumptions in practical uses. We propose a novel moment-based probability distribution metric termed dimensional weighted orderwise moment discrepancy (DWMD) for feature representation matching in the UDA scenario. Our metric function takes advantage of a series for high-order moment alignment, and we theoretically prove that our DWMD metric function is error-free, which means that it can strictly reflect the distribution differences between domains and is valid without any feature distribution assumption. In addition, since the discrepancies between probability distributions in each feature dimension are different, dimensional weighting is considered in our function. We further calculate the error bound of the empirical estimate of the DWMD metric in practical applications. Comprehensive experiments on benchmark datasets illustrate that our method yields state-of-the-art distribution metrics.

📄 PDF Abstract BibTeX arXiv:2007.09312

Code (0)

등록된 구현이 없습니다.

Tasks

Domain AdaptationTransfer LearningUnsupervised Domain Adaptationvalid

Similar Papers 제목 키워드 기반

Density estimation via mixture discrepancy and moments

2025-04-02 · Zhengyang Lei, Sihong Shao

With the aim of generalizing histogram statistics to higher dimensional cases, density estimation via discrepancy based sequential partition (DSP) has been proposed [D. Li, K. Yang, W. Wong, Advances in Neural Informatio…

Density Estimation

Central Moment Discrepancy (CMD) for Domain-Invariant Representation Learning

2017-02-28 · Werner Zellinger, Thomas Grubinger, Edwin Lughofer, Thomas Natschläger 외

The learning of domain-invariant representations in the context of domain adaptation with neural networks is considered. We propose a new regularization method that minimizes the discrepancy between domain-specific laten…

Domain AdaptationObject RecognitionRepresentation LearningSentiment Analysis

Regularized Finite Dimensional Kernel Sobolev Discrepancy

2018-05-16 · Youssef Mroueh

We show in this note that the Sobolev Discrepancy introduced in Mroueh et al in the context of generative adversarial networks, is actually the weighted negative Sobolev norm $||.||_{\dot{H}^{-1}(\nu_q)}$, that is known …

Kernel Two-Sample Tests in High Dimension: Interplay Between Moment Discrepancy and Dimension-and-Sample Orders

2021-12-31 · Jian Yan, Xianyang Zhang

Motivated by the increasing use of kernel-based metrics for high-dimensional and large-scale data, we study the asymptotic behavior of kernel two-sample tests when the dimension and sample sizes both diverge to infinity.…

The Polynomial Stein Discrepancy for Assessing Moment Convergence

2024-12-06 · Narayan Srinivasan, Matthew Sutton, Christopher Drovandi, Leah F South

We propose a novel method for measuring the discrepancy between a set of samples and a desired posterior distribution for Bayesian inference. Classical methods for assessing sample quality like the effective sample size …

Bayesian Inference