Meaning
Non-parametric statistical methods that reweight sample points from a source distribution to match the moments of a target distribution in a high-dimensional reproducing kernel Hilbert space are central to domain adaptation. Through the use of kernel mean matching, an analyst can directly estimate sample weights without computing intermediate density functions. This produces a vector of instance weights that minimizes the maximum mean discrepancy between the source and target datasets.
The boundary of its application occurs when the kernel functions are poorly chosen and fail to capture the underlying structure.
Optimization Objective
Formulating the correction as a quadratic programming problem allows the algorithm to find weights that align the mean embeddings of the distributions. Applying kernel mean matching guarantees that the expected value of any function in the associated Hilbert space is equal under both distributions. This enables founders to train models on historical user data and apply them to new markets with different demographic mixtures.
Data Weighting
The calculated weights are applied directly to the loss function during model training. In kernel mean matching, each source observation is assigned a value that reflects its similarity to the target cohort. This approach ensures that the model focuses on the most relevant historical samples.
Dimensional Limit
The computation scale of this method scales quadratically with the number of training samples, which poses a significant hurdle for massive datasets. For startups with millions of active users, kernel mean matching can become computationally expensive unless approximation techniques are employed. Subsampling or using random Fourier features represents the standard way to maintain scalability.