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,742 papers · 148 categories

Trend · papers per month

155310465620 · Jun 202019922001200920172026
48 results for adversarial domain adaptation

Study reveals adversarially robust domain adaptation is harder to generalize across domains.

problem Hardness of transferring adversarial robustness across different domains.
method Analysis of adversarial Rademacher complexity over symmetric difference hypothesis space.
result Adversarial Rademacher complexity is always greater than non-adversarial, indicating intrinsic hardness.

Proposes novel losses for fine-grained categorical domain adaptation.

problem Fine-grained alignment of categories across domains in unsupervised domain adaptation.
method Joint category-domain classifier with adversarial training losses for both domain and category levels, and vicinal domain adaptation.
result Achieves state-of-the-art performance on benchmark datasets.

The recent advances in deep transfer learning reveal that adversarial learning can be embedded into deep networks to learn more transferable features to reduce the distribution discrepancy between two domains. Existing adversarial domain adaptation methods either learn a single domain discriminator to align the global …

2019-09-18abs ↗pdf ↗

Adversarial training is a useful approach to promote the learning of transferable representations across the source and target domains, which has been widely applied for domain adaptation (DA) tasks based on deep neural networks. Until very recently, existing adversarial domain adaptation (ADA) methods ignore the usefu…

2019-05-28abs ↗pdf ↗

Dual adversarial domain adaptation improves knowledge transfer between labeled and unlabeled domains.

problem Transfer knowledge from labeled to unlabeled domains using unsupervised methods.
method Adopt a discriminator with 2K-dimensional output for both domain-level and class-level alignments. Design a dual adversarial mechanism to pit two discriminators against each other.
result Our method outperforms state-of-the-art domain adaptation methods on real-world datasets.

Adversarial domain adaptation reduces sample bias in high energy physics classifier.

problem Sample bias in high energy physics classifier training.
method Adversarial domain adaptation using neural networks with gradient reversal layer.
result Successful bias removal on simulated events at the LHC.

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.

Fisher loss improves deep domain adaptation by learning discriminative within-class compact and between-class separable representations.

problem Improving deep domain adaptation performance by learning discriminative representations.
method Proposes a Fisher loss to learn discriminative representations that are within-class compact and between-class separable.
result Noticeable improvements in deep domain adaptation performance, e.g., 6.67% absolute improvement in mean accuracy on the Office-Home dataset.

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.

DART tackles adversarial robustness in domain adaptation without labeled target data.

problem Combining distribution shifts and adversarial examples in unsupervised domain adaptation.
method DART framework that combines standard UDA methods with a generalization bound for adversarial target loss.
result DART significantly enhances model robustness to adversarial attacks compared to state-of-the-art methods.

DMRL improves UDA by mixing source and target samples and enriching latent space structures.

problem Lack of class-aware information and insufficient samples for domain-invariant feature extraction.
method Dual Mixup Regularized Learning (DMRL) that conducts category and domain mixup regularizations.
result DMRL achieves state-of-the-art performance on domain adaptation benchmarks.

Paper proposes MDAT to stabilize domain alignment in label-scarce settings.

problem Stable and comprehensive domain alignment in label-scarce settings.
method Max-margin Domain-Adversarial Training (MDAT) with Adversarial Reconstruction Network (ARN).
result MDAT stabilizes gradient reversing and achieves strong robustness to hyper-parameters.

TAROT enhances robustness and domain adaptability with domain-invariant features.

problem Developing models robust to adversarial attacks across diverse domains.
method Derives a new generalization bound and proposes TAROT algorithm.
result TAROT outperforms state-of-the-art methods in accuracy and robustness.

In this work we address the problem of transferring knowledge obtained from a vast annotated source domain to a low labeled target domain. We propose Adversarial Variational Domain Adaptation (AVDA), a semi-supervised domain adaptation method based on deep variational embedded representations. We use approximate infere…

2019-09-25abs ↗pdf ↗

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 ↗

This paper studies the problem of stance detection which aims to predict the perspective (or stance) of a given document with respect to a given claim. Stance detection is a major component of automated fact checking. As annotating stances in different domains is a tedious and costly task, automatic methods based on ma…

2019-02-06abs ↗pdf ↗

This paper addresses the problem of unsupervised domain adaption from theoretical and algorithmic perspectives. Existing domain adaptation theories naturally imply minimax optimization algorithms, which connect well with the domain adaptation methods based on adversarial learning. However, several disconnections still …

2019-04-11abs ↗pdf ↗

Paper proposes a method to improve building extraction from aerial images by adapting CNN models.

problem Limited generalization of CNN-based segmentation models for unseen images.
method Combines domain transfer and adversarial attack concepts to adapt input images to target images.
result Improves overall IoU and outperforms other methods in cross-dataset experiments.

In this paper, we solve the problem of adapting classifiers across domains. We consider the problem of domain adaptation for multi-class classification where we are provided a labeled set of examples in a source dataset and we are provided a target dataset with no supervision. In this setting, we propose an adversarial…

2019-04-02abs ↗pdf ↗

Paper tackles noise-robust domain adaptation in noisy environments.

problem Learning machines struggle with domain adaptation in noisy environments.
method The paper proposes offline curriculum learning and proxy distribution based margin discrepancy to mitigate label and feature noise.
result The proposed algorithm significantly outperforms state-of-the-art methods in noisy environments.

Enhances image-to-image translation using adversarial latent space.

problem Image-to-image translation task in computer vision.
method Introduces an adversarial discriminator on the latent representation to enforce similar latent space distributions.
result Significantly outperforms competing approaches on MNIST and USPS domain adaptation tasks.

Paper develops new algorithms for unsupervised multi-class domain adaptation.

problem Improving performance of machine learning models across different domains without labeled data.
method Introduces MCSD divergence and a new domain adaptation bound, develops adversarial learning objectives, and proposes new algorithms like McDalNets and SymmNets.
result New algorithms improve performance across different domain adaptation settings.

Method maps imperfect simulations to observed stellar spectra using unsupervised domain adaptation.

problem Mapping from large sets of imperfect simulations and observational data.
method Adversarial autoencoders, cycle-consistency constraint, and generative surrogate physics emulator network.
result Reconstructed spectra quality and discovery of new spectral features.

Discriminative active learning reduces data annotation costs for domain adaptation.

problem Conditional shift problem hinders domain adaptation between related but different domains.
method Three-stage active adversarial training: invariant feature space learning, uncertainty and diversity criteria, re-training with queried labels.
result Empirical comparisons show the proposed approach is more effective than existing methods.

Unified analysis of generalization and sample complexity for semi-supervised domain adaptation.

problem Theoretical foundations of domain adaptation remain underexplored, especially for modern approaches.
method Unified theoretical study of domain adaptation algorithms based on domain alignment, considering joint learning of feature transformations and shared classifiers in a semi-supervised setting.
result Unified theoretical analysis of domain adaptation algorithms, providing generalization bounds and sample complexity bounds for MMD and adversarial models.

Domain adaptation addresses the common problem when the target distribution generating our test data drifts from the source (training) distribution. While absent assumptions, domain adaptation is impossible, strict conditions, e.g. covariate or label shift, enable principled algorithms. Recently-proposed domain-adversa…

2019-03-05abs ↗pdf ↗

Transductive Adversarial Networks (TAN) is a novel domain-adaptation machine learning framework that is designed for learning a conditional probability distribution on unlabelled input data in a target domain, while also only having access to: (1) easily obtained labelled data from a related source domain, which may ha…

2018-02-08abs ↗pdf ↗

Paper proposes a method to adapt classifiers using complementary labels instead of true labels.

problem Training classifiers with true labels from the source domain is costly and sometimes impossible.
method Proposes a novel setting with complementary labels and a complementary label adversarial network (CLARINET).
result CLARINET significantly outperforms baselines on handwritten digits and object recognition tasks.