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

14.7%29.5%44.2%58.9% · Jun 202019922001200920172026
48 results for domain-invariant learning

A new method improves cross-domain sentiment analysis by learning weighted domain-invariant representations.

problem Label distribution changes across domains harm domain adaptation in DIRL.
method Proposes WDIRL, a modification to DIRL that learns weighted domain-invariant representations.
result Empirical studies show the effectiveness of WDIRL in cross-domain sentiment analysis.

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.

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.

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 ↗

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 ↗

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 ↗

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.

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.

JSCN improves cross-domain recommendation by learning domain-invariant user representations.

problem Cross-domain recommendation data sparsity and domain-incompatibility issues.
method JSCN uses multi-layer spectral convolutions on different graphs to learn domain-invariant user representations and domain adaptive user mappings.
result Significant improvement in cross-domain recommendation performance (9.2% recall, 36.4% MAP improvements).

This work examines how embedding complexity impacts domain adaptation.

problem Improving generalization to an unlabeled target domain.
method Theoretical and empirical study of embedding complexity in multilayer neural networks.
result Developed a strategy to mitigate embedding complexity sensitivity and achieve performance on par with best tradeoffs.

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.

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 ↗

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.

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 ↗

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

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 ↗

We tackle class imbalance in unsupervised domain adaptation using latent codes.

problem Class imbalance in unsupervised domain adaptation where target domain has under-represented classes.
method Adversarial domain adaptation framework with latent codes to identify and estimate target labels.
result Latent codes can disentangle target domain structure and identify under-represented classes.

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.

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.

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.

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.

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 ↗

Selective pseudo-labeling improves unsupervised domain adaptation.

problem Classifying unlabeled target domain samples with labeled source domain samples.
method Structured prediction for selective pseudo-labeling.
result Selective pseudo-labeling outperforms state-of-the-art methods.

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.

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 ↗

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.

Recent proofs of classical theorems in polynomial algebra and functional analysis are discussed, which use tools from the topology of real manifolds. Simpler proofs were discovered in the new century, of the Hilbert Nullstellensatz, and the Gelfand-Mazur Theorem. We give a related proof that an irreducible real polynom…

2015-02-01abs ↗pdf ↗

MTS-CycleGAN adapts multivariate time series data for ironmaking industry.

problem Creating a domain invariant dataset from multivariate time series data of different blast furnaces.
method Adversarial-based deep mapping learning network (CycleGAN) with LSTM-based AutoEncoder and discriminator.
result MTS-CycleGAN successfully translates multivariate time series data between different blast furnaces.

Domain generalization (DG) aims to incorporate knowledge from multiple source domains into a single model that could generalize well on unseen target domains. This problem is ubiquitous in practice since the distributions of the target data may rarely be identical to those of the source data. In this paper, we propose …

2019-07-25abs ↗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 ↗

New algorithm improves treatment effect estimation from observational data.

problem Estimating the benefits and harms of interventions from observational data.
method Develops a deep kernel regression algorithm and posterior regularization framework.
result Substantially outperforms state-of-the-art on various benchmarks datasets.

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 ↗

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 ↗

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.