Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,786 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Sep 199319922001200920172026
48 results for source domain performance

Human activity recognition plays an important role in people's daily life. However, it is often expensive and time-consuming to acquire sufficient labeled activity data. To solve this problem, transfer learning leverages the labeled samples from the source domain to annotate the target domain which has few or none labe…

2018-07-20abs ↗pdf ↗

Proposes MDDA for multi-source domain adaptation.

problem Performance decay in deep neural networks due to domain shift between labeled and unlabeled data.
method Multi-source distilling domain adaptation (MDDA) network considering multiple source distributions and target similarities.
result Significantly outperforms state-of-the-art approaches on public DA benchmarks.

Improves domain adaptation by combining multiple source domains and target domain data.

problem Poor performance of empirical risk minimization in distributionally shifted target domains.
method Distributionally robust model optimizing adversarial reward based on explained variance across multiple source domains.
result The robust model is a weighted average of conditional outcome models from source domains.

Paper tackles multi-source domain adaptation for regression.

problem Predicting HDL cholesterol levels using gut microbiome data.
method Two-step procedure: 1) Extend a flexible single-source DA algorithm for classification to regression. 2) Augment with ensemble learning for multi-source DA.
result Consistent improvement in HDL cholesterol level prediction performance over existing methods.

Method generates intermediate domains to align source and target domains.

problem Challenges of domain adaptation with significant domain divergence.
method Progressive domain augmentation via domain interpolation and multiple subspace alignment.
result Achieves state-of-the-art performance on multiple domain adaptation tasks.

Automated sentiment classification (SC) on short text fragments has received increasing attention in recent years. Performing SC on unseen domains with few or no labeled samples can significantly affect the classification performance due to different expression of sentiment in source and target domain. In this study, w…

2018-08-28abs ↗pdf ↗

CWAN tackles multi-source heterogeneous domain adaptation with conditional weighting.

problem Learning cross-domain samples from multiple heterogeneous domains.
method CWAN uses a feature transformer, label classifier, and domain discriminator to learn from multiple sources.
result CWAN outperforms state-of-the-art methods on four real-world datasets.

Proposes DFDG for robust domain generalization without source domain labels.

problem Robustness of deep learning models in real-world applications where train and test distributions differ.
method Model-agnostic, class-aware alignment of class relationships through saliency maps.
result Competitive performance on time series sensor and image classification datasets.

Improves unsupervised domain adaptation by mixing source and target domains.

problem Improves unsupervised domain adaptation by mixing source and target domains.
method Enforces training constraints across domains using mixup formulation and feature-level consistency regularizer.
result Significantly improves state-of-the-art performance on image classification and human activity recognition tasks.

Contradistinguisher learns to distinguish target domain without aligning source and target domains.

problem Difficulty in aligning source and target domains for domain adaptation.
method Direct approach to unsupervised domain adaptation that learns contrastive features and improves classification performance.
result Achieves state-of-the-art performance on Office-31 and VisDA-2017 datasets.

The goal behind Domain Adaptation (DA) is to leverage the labeled examples from a source domain so as to infer an accurate model in a target domain where labels are not available or in scarce at the best. A state-of-the-art approach for the DA is due to (Ganin et al. 2016), known as DANN, where they attempt to induce a…

2018-09-20abs ↗pdf ↗

EnMDAP aligns conditional distributions for multi-source domain adaptation using pseudolabels.

problem Training a target model with no labeled data in the absence of target data labels.
method EnMDAP uses label-wise moment matching and ensemble learning with multiple feature extractors.
result EnMDAP achieves state-of-the-art performance in multi-source domain adaptation tasks.

Survey explores methods to adapt deep learning models across multiple labeled domains.

problem Difficulty in obtaining labeled data for deep learning models.
method Multi-source domain adaptation (MDA) to transfer knowledge from labeled to unlabeled or sparsely labeled target domains.
result MDA methods improve performance by minimizing domain shift.

In domain adaptation, classifiers with information from a source domain adapt to generalize to a target domain. However, an adaptive classifier can perform worse than a non-adaptive classifier due to invalid assumptions, increased sensitivity to estimation errors or model misspecification. Our goal is to develop a doma…

2017-06-25abs ↗pdf ↗

A new method aligns source and target distributions by tuning their weights.

problem Domain adaptation on unlabeled target datasets using labeled source datasets.
method Weighted Joint Distribution Optimal Transport (WJDOT) method that finds alignment between source and target distributions and re-weighting of source distributions.
result Achieves state-of-the-art performance on simulated and real-life datasets.

Prototype extraction framework for domain adaptation.

problem Statistical distance minimization issues in unsupervised domain adaptation.
method Memory and computation-efficient probabilistic framework for class prototype extraction and feature alignment.
result Competitive performance with state-of-the-art methods, no additional model parameters required.

Unsupervised domain adaptation seeks to learn an invariant and discriminative representation for an unlabeled target domain by leveraging the information of a labeled source dataset. We propose to improve the discriminative ability of the target domain representation by simultaneously learning tightly clustered target …

2019-05-30abs ↗pdf ↗

Improves domain adaptation by aligning source and target distributions and mitigating noisy labels.

problem Improving performance on target images with different acquisition conditions.
method Combines optimal transport, MixUp regularization, and robust loss for noisy labels.
result Improves domain adaptation performance on various benchmarks and real-world problems.

Domain adaptation refers to the problem of leveraging labeled data in a source domain to learn an accurate model in a target domain where labels are scarce or unavailable. A recent approach for finding a common representation of the two domains is via domain adversarial training (Ganin & Lempitsky, 2015), which attempt…

2018-02-23abs ↗pdf ↗

Enhances source domain knowledge with target data for transfer learning.

problem Limited data in target domains and rigid model assumptions in transfer learning.
method Transfer learning through Enhanced Sufficient Representation (TESR).
result TESR enhances source domain knowledge with target data, improving transfer learning performance.

Transfer learning has recently attracted significant research attention, as it simultaneously learns from different source domains, which have plenty of labeled data, and transfers the relevant knowledge to the target domain with limited labeled data to improve the prediction performance. We propose a Bayesian transfer…

2018-01-02abs ↗pdf ↗

Compared with shallow domain adaptation, recent progress in deep domain adaptation has shown that it can achieve higher predictive performance and stronger capacity to tackle structural data (e.g., image and sequential data). The underlying idea of deep domain adaptation is to bridge the gap between source and target d…

2018-11-15abs ↗pdf ↗

A new method uses normalizing flows for gradual domain adaptation.

problem Difficulty in domain adaptation when source and target domains have a large gap.
method Proposes using normalizing flows to learn a transformation from target to Gaussian mixture distribution.
result Improves classification performance and mitigates the problem of gradual self-training failure.

Paper tackles domain invariant sentiment classification using weak supervision.

problem Learning a sentiment classification model that adapts to any target domain.
method Two-stage training procedure with weakly supervised datasets.
result Transfer learning with weak supervision achieves performance close to supervised training.

The primary objective of domain adaptation methods is to transfer knowledge from a source domain to a target domain that has similar but different data distributions. Thus, in order to correctly classify the unlabeled target domain samples, the standard approach is to learn a common representation for both source and t…

2018-11-17abs ↗pdf ↗

Deep learning has produced state-of-the-art results for a variety of tasks. While such approaches for supervised learning have performed well, they assume that training and testing data are drawn from the same distribution, which may not always be the case. As a complement to this challenge, single-source unsupervised …

2018-12-06abs ↗pdf ↗

Improves unsupervised domain adaptation by enforcing feature extractor to focus on task-relevant information.

problem Leveraging label information from source domain for accurate target domain models without labels.
method Variational Information Bottleneck (VBDA) method that explicitly enforces feature extractor to ignore irrelevant task factors.
result Significantly outperforms state-of-the-art methods across three domain adaptation benchmark datasets.

New method recovers predictions from unobservable source subpopulation in binary classification.

problem Challenging binary classification with unobservable subpopulation in source domain.
method Distribution matching method to estimate subpopulation proportions, rigorous derivation of prediction models.
result Our method outperforms naive benchmarks in synthetic and real-world datasets.

MetFA aligns source and target domains for cross-device image classification.

problem Learning discriminative class boundaries across different domains.
method Distance metric guided feature alignment (MetFA) for domain-invariant and discriminative feature extraction.
result MetFA outperforms state-of-the-art methods in cross-device image classification.

Algorithm improves model performance on shifted concepts without retraining.

problem Improving model performance on shifted concepts with limited source data.
method Model consolidation of intermediate internal distributions after adaptation.
result Effective improvement in model performance on shifted concepts.

Interventional domain adaptation improves feature transferability by removing spurious correlations.

problem Improper feature transferability due to spurious correlations in domain adaptation.
method Intervention strategy using unlabeled target data to generate counterfactual features and train discriminability invariance.
result Consistent performance improvements over state-of-the-art approaches in various domain adaptation tasks.

Paper tackles open set domain adaptation by detecting unknown classes.

problem Adapting to target domains with unknown classes when label spaces partially overlap.
method Instance-level reweighting strategy combined with Extreme Value Theory for unknown class detection.
result Proposed method outperforms state-of-the-art models on conventional datasets.

Framework for domain adaptation using pseudo-labels from unlabeled data.

problem Improving prediction accuracy in target domain with covariate shift.
method Kernel GLMs with labeled and pseudo-labeled data, using imputation model for target data.
result Non-asymptotic excess-risk bounds for effective labeled sample size.

In the absence of sufficient data variation (e.g., scanner and protocol variability) in annotated data, deep neural networks (DNNs) tend to overfit during training. As a result, their performance is significantly lower on data from unseen sources compared to the performance on data from the same source as the training …

2019-08-16abs ↗pdf ↗

Paper tackles adapting multiple domains to a target domain using distillation and dictionary learning.

problem Adapting multiple heterogeneous labeled source domains to an unlabeled target domain.
method Combines Multi-Source Domain Adaptation and Dataset Distillation with Dataset Dictionary Learning.
result Achieves state-of-the-art adaptation performance even with minimal labeled data.