Dynamic residual adapters improve performance across multiple latent domains without domain labels.
problem Overfitting to large domains and ignoring smaller ones in multi-domain learning.
method Dynamic residual adapters and augmentation strategies inspired by style transfer.
result Dynamic residual adapters significantly outperform standard models on multiple latent domains.
Edge devices adapt pre-trained models to local data without backpropagation.
problem Adapting pre-trained models to edge devices' local data distributions.
method Feed-forward latent domain adaptation using cross-attention.
result Consistent improvements over ERM baselines and domain-supervised adaptation.
Domain adaptation refers to the process of learning prediction models in a target domain by making use of data from a source domain. Many classic methods solve the domain adaptation problem by establishing a common latent space, which may cause the loss of many important properties across both domains. In this manuscri…
Domain adaptation framework identifies latent variables for target distribution identifiability.
problem Unsupervised domain adaptation without identifiable joint distribution of features and labels.
method Formulated latent variable model with invariant and changing components, constrained domain shift to influence only changing components.
result Joint distribution of data and labels in target domain is identifiable under mild conditions.
Proxy methods adapt to distribution shifts without explicitly modeling latent confounders.
problem Adapting to distribution shifts under latent variable confounding.
method Proximal causal learning, two-stage kernel estimation.
result Proxy methods outperform other methods in adapting to complex distribution shifts.
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.
Proposes a new approach for domain adaptation using latent representations.
problem Handling distribution shifts between source and target domains in high-dimensional data.
method Learn compact latent representations based on the label's Markov blanket, partitioning into parents, children, and spouses.
result General domain adaptation can be achieved by learning representations of the label's parents, children, and spouses.
We address the problem of severe class imbalance in unsupervised domain adaptation, when the class spaces in source and target domains diverge considerably. Till recently, domain adaptation methods assumed the aligned class spaces, such that reducing distribution divergence makes the transfer between domains easier. Su…
Paper proposes a probabilistic alignment method for domain adaptation.
problem Latent distribution mismatch and miscalibrated uncertainty in adapting large-scale models.
method Bayesian latent transport framework with PAC-Bayesian regularization.
result Reduction in latent manifold discrepancy and improved uncertainty calibration.
Proposes a new approach to MSDA by introducing latent covariate shift to handle varying label distributions.
problem Challenges of conventional MSDA approaches in real-world settings where label distributions vary across domains.
method Introduces latent covariate shift (LCS) and a causal generative model with latent noises, latent content variable, and latent style variable.
result Identifies latent content variable up to block identifiability, enabling more nuanced label distribution recovery.
Adapts to shifts in latent subgroup distributions without labeled target data.
problem Adapting to domain shifts when latent subgroup distributions differ.
method Uses concept and proxy variables from source domain, and unlabeled target data.
result Optimal target predictor can be identified and estimated.
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.
An essential problem in domain adaptation is to understand and make use of distribution changes across domains. For this purpose, we first propose a flexible Generative Domain Adaptation Network (G-DAN) with specific latent variables to capture changes in the generating process of features across domains. By explicitly…
Brain-Machine Interfaces (BMIs) have recently emerged as a clinically viable option to restore voluntary movements after paralysis. These devices are based on the ability to extract information about movement intent from neural signals recorded using multi-electrode arrays chronically implanted in the motor cortices of…
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.
We propose a method to infer domain-specific models such as classifiers for unseen domains, from which no data are given in the training phase, without domain semantic descriptors. When training and test distributions are different, standard supervised learning methods perform poorly. Zero-shot domain adaptation attemp…
Conditional domain generation is a good way to interactively control sample generation process of deep generative models. However, once a conditional generative model has been created, it is often expensive to allow it to adapt to new conditional controls, especially the network structure is relatively deep. We propose…
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.
DAF uses attention sharing to adapt forecasts from abundant to scarce data.
problem Limited data for time series forecasting.
method Attention-based shared module and domain discriminator for domain adaptation.
result DAF outperforms state-of-the-art methods on various domains.
DAPDAG learns DAG structure to adapt predictions across domains.
problem Predicting in a new domain without labeled data.
method Auto-encoder with DAG reconstruction as auxiliary task.
result Reconstructing DAG benefits approximate inference and prediction.
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.
This paper benchmarks speech LVMs against deterministic models and adapts a video model to speech.
problem Speech generation models are inferior to deterministic models.
method Developed a speech benchmark of LVMs and compared them against deterministic models.
result The Clockwork VAE outperforms previous LVMs and reduces the gap to deterministic models.
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.
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.
Optimal transport aligns source and target distributions for domain adaptation.
problem Unsupervised domain adaptation with joint class-conditional and label shifts.
method Minimizes importance weighted loss and Wasserstein distance for aligned marginals and class-conditional distributions.
result Our method outperforms competitors on various domain adaptation tasks.
DDMI generates high-quality INRs by adapting positional embeddings.
problem Existing INR generative models fail to produce high-quality representations.
method DDMI uses adaptive positional embeddings and a D2C-VAE to enhance expressive power.
result DDMI outperforms existing models across multiple modalities and datasets.
We propose a simple neural network model to deal with the domain adaptation problem in object recognition. Our model incorporates the Maximum Mean Discrepancy (MMD) measure as a regularization in the supervised learning to reduce the distribution mismatch between the source and target domains in the latent space. From …
SIG model identifies invariant variables for MSDA with fewer domain constraints.
problem Challenges in enforcing minimal changes across domains for MSDA.
method Subspace identification theory and variational inference.
result SIG model outperforms existing techniques on various benchmark datasets.
We learn multiple hypotheses for related tasks under a latent hierarchical relationship between tasks. We exploit the intuition that for domain adaptation, we wish to share classifier structure, but for multitask learning, we wish to share covariance structure. Our hierarchical model is seen to subsume several previous…
Semi-supervised method enhances recommendation from sparse data.
problem Data sparsity in implicit feedbacks and lack of negative samples.
method Domain adaptation using textual features to align latent spaces.
result Our models significantly outperform existing models on real-world datasets.
spex-LVM infers interpretable latent factors from biomedical data.
problem Inability to learn sparse and interpretable hidden states.
method Factorial latent variable model with sparse priors and domain-relevant annotations.
result Robustly identifies relevant structure in RNA-seq datasets.
Domain adaptation is transfer learning which aims to generalize a learning model across training and testing data with different distributions. Most previous research tackle this problem in seeking a shared feature representation between source and target domains while reducing the mismatch of their data distributions.…
Deep learning for integrating diverse clinical measurements.
problem Combining data from different measurement instruments in longitudinal clinical registries.
method Domain adaptation using deep learning for mapping items from different instruments.
result Domain adaptation can recover latent trajectories even with limited data and misalignment.
A new method for image translation without paired data.
problem Image-to-image translation between two domains with content preservation.
method Energy-based model in latent space of pretrained autoencoder.
result Improved translation quality and content preservation.
Given datasets from multiple domains, a key challenge is to efficiently exploit these data sources for modeling a target domain. Variants of this problem have been studied in many contexts, such as cross-domain translation and domain adaptation. We propose AlignFlow, a generative modeling framework that models each dom…
Meta-learner infers subtask graph to adapt quickly to unknown tasks.
problem Adapting to unknown tasks with unknown subtask dependencies in few-shot RL.
method Meta-learner with Subtask Graph Inference (MSGI) and UCB-inspired intrinsic reward.
result Accurately infers latent task parameters and adapts more efficiently.
Model predicts counterfactuals under domain shift and inaccessible variables.
problem Runtime domain corruption impairs counterfactual prediction.
method Subsumes counterfactual prediction under domain adaptation, uses adversarial domain adaptation to reduce distribution disparity.
result VEGAN outperforms baselines in individual-level treatment effect estimation.
In unsupervised domain adaptation, it is widely known that the target domain error can be provably reduced by having a shared input representation that makes the source and target domains indistinguishable from each other. Very recently it has been studied that not just matching the marginal input distributions, but th…
A novel approach for unsupervised domain adaptation for neural networks is proposed. It relies on metric-based regularization of the learning process. The metric-based regularization aims at domain-invariant latent feature representations by means of maximizing the similarity between domain-specific activation distribu…
TimeVQVAE-AD detects anomalies in time series data with high accuracy and provides explainable results.
problem Detecting and explaining anomalies in time series data accurately.
method Masked latent generative modeling in time-frequency domain.
result TimeVQVAE-AD outperforms existing methods in anomaly detection and explainability.
Proposes MD-LiNA for multi-domain latent factor causal discovery.
problem Discovering causal structures among latent factors from multi-domain data.
method Multi-Domain Linear Non-Gaussian Acyclic Models (MD-LiNA) with an integrated two-phase algorithm.
result Locally consistent estimators of causal structure among shared latent factors.
New approach to meta-learning with variational Bayes for unlabeled data.
problem Improving machine learning systems' adaptability to small data.
method Generative meta-learning using AEVB and mean-field variational Bayes.
result Relevant VB updates do not depend on generative neural networks for certain models.
TALBO optimizes latent spaces for evolving design objectives.
problem Temporal drift in design objectives.
method GP-prior variational autoencoder for time-varying latent space.
result Consistently outperforms LSBO baselines across varying drift speeds and objectives.
FNSDA adapts to new dynamics via Fourier space adaptation.
problem Generalizing to unseen dynamical systems with limited data.
method Automatic partitioning of known environments in Fourier modes and adaptation of specific modes for new environments.
result FNSDA achieves superior or competitive generalization performance with reduced parameter cost.
This work proposes a new algorithm for automated and simultaneous phenotyping of multiple co-occurring medical conditions, also referred as comorbidities, using clinical notes from the electronic health records (EHRs). A basic latent factor estimation technique of non-negative matrix factorization (NMF) is augmented wi…
Single episode policy transfer in RL without access to rewards.
problem Performing near-optimally in a single attempt with unknown dynamics.
method Optimizes a probe and inference model to estimate latent variables for universal control policy.
result Significantly outperforms existing adaptive approaches in diverse domains.
Unified Latent Dynamics unifies model-free and model-based reinforcement learning.
problem Combining the efficiency of model-free methods with the representational strengths of model-based approaches.
method Embedding state-action pairs into a latent space where the true value function is approximately linear, using synchronized updates of encoder, value, and policy networks.
result ULD achieves cross-domain competence with minimal tuning and a fraction of the parameter footprint.
Paper uses deep learning to make predictions transparently.
problem Lack of transparency in DNN predictions.
method Extracts latent variables from trained DNNs for unified analysis.
result Improved prediction accuracy and transparency.