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

Trend · papers per month

86171257342 · Jun 202019922001200920172026
48 results for domain-invariant representations

Paper develops upper-bounds for target general loss in multiple source DA and DG settings.

problem Complexity and trade-offs in multiple source domain adaptation and domain generalization.
method Defines two types of domain-invariant representations and studies their pros, cons, and trade-offs.
result Developed upper-bounds for target general loss offer insights into domain-invariant representations.

Estimates model performance under distribution shift using domain-invariant predictors.

problem Poor performance of models on test distributions different from training distributions.
method Uses domain-invariant predictors as a proxy for unknown target labels.
result Shows that the complexity of latent representations influences target risk.

Learning domain-invariant representations has become a popular approach to unsupervised domain adaptation and is often justified by invoking a particular suite of theoretical results. We argue that there are two significant flaws in such arguments. First, the results in question hold only for a fixed representation and…

2019-03-08abs ↗pdf ↗

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.

The paper proposes a method to create domain-invariant representations using Wasserstein distance.

problem Domain shifts in training data affect machine learning model performance across different domains.
method The method combines classification/regression losses with a GAN-type discriminator to minimize the Wasserstein distance between domains.
result The approach produces the highest minimum classification accuracy and most invariant representation across domains.

Proposes Infomax and Domain-Independent Representations for robust causal inference.

problem Handling treatment selection bias and domain imbalance in causal inference with real-world data.
method Utilizes mutual information to learn domain-invariant representations that maximize predictive common information.
result Achieves state-of-the-art performance on causal effect inference across various data distributions.

Improves transferability of representations from source to target domains with weights and invariant representations.

problem Label shift between source and target domains in unsupervised domain adaptation.
method Integrates weights and invariant representations to bound the target risk, highlighting the role of inductive bias.
result Empirical evidence shows that weak inductive bias makes adaptation more robust.

Unsupervised Domain Adaptation aims to learn a model on a source domain with labeled data in order to perform well on unlabeled data of a target domain. Current approaches focus on learning \textit{Domain Invariant Representations}. It relies on the assumption that such representations are well-suited for learning the …

2019-07-29abs ↗pdf ↗

Unsupervised domain adaptation aims to generalize the hypothesis trained in a source domain to an unlabeled target domain. One popular approach to this problem is to learn domain-invariant embeddings for both domains. In this work, we study, theoretically and empirically, the effect of the embedding complexity on gener…

2019-10-13abs ↗pdf ↗

Discrepancy between training and testing domains is a fundamental problem in the generalization of machine learning techniques. Recently, several approaches have been proposed to learn domain invariant feature representations through adversarial deep learning. However, label shift, where the percentage of data in each …

2019-03-15abs ↗pdf ↗

Unsupervised domain adaptation methods aim to alleviate performance degradation caused by domain-shift by learning domain-invariant representations. Existing deep domain adaptation methods focus on holistic feature alignment by matching source and target holistic feature distributions, without considering local feature…

2018-11-12abs ↗pdf ↗

New approach improves domain adaptation with label shift assumptions.

problem Improving domain adaptation when label distributions differ between source and target domains.
method Proposes generalized label shift (GLSGLS) and modifies three DA algorithms (JAN, DANN, CDAN) to handle label distribution mismatches.
result Modified DA algorithms outperform base versions, especially with large label distribution mismatches.

Domain generalization aims to apply knowledge gained from multiple labeled source domains to unseen target domains. The main difficulty comes from the dataset bias: training data and test data have different distributions, and the training set contains heterogeneous samples from different distributions. Let XX denote …

2018-07-23abs ↗pdf ↗

TCRI improves domain generalization by enforcing conditional independence constraints.

problem Limitations of existing domain generalization methods due to incomplete constraints.
method TCRI implements regularizers motivated by conditional independence constraints.
result TCRI achieves cross-domain stability and outperforms baselines in worst-domain accuracy.

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.

We consider the problem of domain generalization, namely, how to learn representations given data from a set of domains that generalize to data from a previously unseen domain. We propose the Domain Invariant Variational Autoencoder (DIVA), a generative model that tackles this problem by learning three independent late…

2019-05-24abs ↗pdf ↗

Adversarial domain-invariant training (ADIT) proves to be effective in suppressing the effects of domain variability in acoustic modeling and has led to improved performance in automatic speech recognition (ASR). In ADIT, an auxiliary domain classifier takes in equally-weighted deep features from a deep neural network …

2019-04-28abs ↗pdf ↗

Sequential data often originates from diverse domains across which statistical regularities and domain specifics exist. To specifically learn cross-domain sequence representations, we introduce disentangled state space models (DSSM) -- a class of SSM in which domain-invariant state dynamics is explicitly disentangled f…

2019-06-07abs ↗pdf ↗

This paper investigates domain generalization: How to take knowledge acquired from an arbitrary number of related domains and apply it to previously unseen domains? We propose Domain-Invariant Component Analysis (DICA), a kernel-based optimization algorithm that learns an invariant transformation by minimizing the diss…

2013-01-10abs ↗pdf ↗

Studies show that the representations learned by deep neural networks can be transferred to similar prediction tasks in other domains for which we do not have enough labeled data. However, as we transition to higher layers in the model, the representations become more task-specific and less generalizable. Recent resear…

2019-10-28abs ↗pdf ↗

Network alignment is a critical task to a wide variety of fields. Many existing works leverage on representation learning to accomplish this task without eliminating domain representation bias induced by domain-dependent features, which yield inferior alignment performance. This paper proposes a unified deep architectu…

2019-08-15abs ↗pdf ↗

New risk decompositions clarify domain adaptation issues.

problem Domain adaptation challenges with different training and test distributions.
method Representation Bayesian Risk Decompositions, hybrid argument.
result Clarifies factors (2) and (3) as reasons for generalization failure.

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.

Due to the ability of deep neural nets to learn rich representations, recent advances in unsupervised domain adaptation have focused on learning domain-invariant features that achieve a small error on the source domain. The hope is that the learnt representation, together with the hypothesis learnt from the source doma…

2019-01-27abs ↗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.

A new method improves label propagation for unsupervised domain adaptation.

problem Improving unsupervised domain adaptation through semi-supervised learning techniques.
method Label Propagation with Augmented Anchors (A2^2LP) for UDA.
result A2^2LP improves over representative UDA methods and benchmarks.

New method improves domain generalization by matching object representations.

problem Existing domain generalization methods fail to generalize to unseen domains.
method Proposes matching-based algorithms to match object representations across domains.
result MatchDG algorithm matches ground-truth object representations and improves out-of-domain accuracy.

GENIE balances domain-invariant feature learning and gradient alignment for improved DG performance.

problem Domain Generalization (DG) overfitting to domain-specific features
method GENIE (Generalization-ENhancing Iterative Equalizer) optimizer
result Prevents a small subset of parameters from dominating optimization, promoting domain-invariant feature learning

The paper explores how to make machine learning models robust to domain shifts.

problem Machine learning models are unreliable in domains different from training.
method Introducing a broad formal notion of invariance and causal structures.
result The true underlying causal structure of the data plays a critical role in robustness.

The well known domain shift issue causes model performance to degrade when deployed to a new target domain with different statistics to training. Domain adaptation techniques alleviate this, but need some instances from the target domain to drive adaptation. Domain generalisation is the recently topical problem of lear…

2019-01-31abs ↗pdf ↗

In this paper, we consider domain-invariant deep learning by explicitly modeling domain shifts with only a small amount of domain-specific parameters in a Convolutional Neural Network (CNN). By exploiting the observation that a convolutional filter can be well approximated as a linear combination of a small set of dict…

2019-09-25abs ↗pdf ↗