Paper introduces a new model to handle multi-task learning across different input domains.
problem Learning correlated tasks across varying input domains.
method Develops a novel heterogeneous stochastic variational linear model of coregionalization (HSVLMC) for multi-task learning.
result The proposed model outperforms existing models in diverse multi-task scenarios.
Enhances multi-fidelity modeling with DGPs for different input domains.
problem Improving prediction accuracy with multi-fidelity models using different input domains.
method Extends Deep Gaussian Processes (DGPs) to handle different input domains for high and low-fidelity models.
result Demonstrates improved performance on real-world physical problems.
The characteristics (or numerical patterns) of a feature vector in the transform domain of a perturbation model differ significantly from those of its corresponding feature vector in the input domain. These differences - caused by the perturbation techniques used for the transformation of feature patterns - degrade the…
Adversarial attacks on deep neural networks traditionally rely on a constrained optimization paradigm, where an optimization procedure is used to obtain a single adversarial perturbation for a given input example. In this work we frame the problem as learning a distribution of adversarial perturbations, enabling us to …
Aims to eliminate domain bias in authentication without domain labels.
problem Authentication models are biased due to domain differences.
method Discover latent domains and eliminate domain difference alternately, using a meta-learning framework.
result Eliminates domain difference in authentication without domain labels.
The paper tackles domain generalization using functional regression.
problem Learning a model that generalizes well across different source distributions.
method Functional regression approach to learn a linear operator between marginal and conditional distributions.
result The proposed algorithm achieves finite sample error bounds for the idealized risk.
We present CROSSGRAD, a method to use multi-domain training data to learn a classifier that generalizes to new domains. CROSSGRAD does not need an adaptation phase via labeled or unlabeled data, or domain features in the new domain. Most existing domain adaptation methods attempt to erase domain signals using technique…
Dual-structured method improves cross-domain imitation learning.
problem Learning policies in a target domain from source domain expert demonstrations.
method Extracts domain and policy expertness features, synthesizes new features.
result Superior performance compared to other algorithms in MuJoCo tasks.
We introduce a new representation learning algorithm suited to the context of domain adaptation, in which data at training and test time come from similar but different distributions. Our algorithm is directly inspired by theory on domain adaptation suggesting that, for effective domain transfer to be achieved, predict…
Paper explores neural network approximations on sphere domains.
problem Approximating functionals on sphere domains using neural networks.
method Encoder-decoder framework with spherical harmonics for infinite-dimensional domain.
result Approximation rates of neural networks with different encoder structures.
The paper improves model robustness by regularizing posterior differences.
problem Improving model robustness in noisy input scenarios.
method Posterior differential regularization with f-divergence. result Regularizing with f-divergence improves model robustness. 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…
Unsupervised domain adaptation improves with privileged information.
problem Domain adaptation under covariate shift and overlap limitations.
method Two-stage learning algorithm inspired by expected error analysis.
result Using privileged information reduces errors and increases sample efficiency.
REx tackles distributional shift by reducing risk differences across domains.
problem Tackling distributional shift when transferring machine learning systems to real-world applications.
method Risk Extrapolation (REx) assumes training domains represent test-time variations and uses extrapolated domains to minimize risk variance.
result REx reduces sensitivity to extreme distributional shifts, including causal and anti-causal inputs.
An intriguing property of deep neural networks is their inherent vulnerability to adversarial inputs, which significantly hinders their application in security-critical domains. Most existing detection methods attempt to use carefully engineered patterns to distinguish adversarial inputs from their genuine counterparts…
Unified framework for multi-domain learning and data imputation.
problem Improving performance across different domains with missing data.
method Adversarial autoencoder for domain-invariant embeddings and data imputation.
result Superior performance compared to state-of-the-art methods in various settings.
Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched t…
Algorithm adapts to shifting domains with minimal label queries.
problem Adaptive learning in online machine learning systems with domain shifts.
method Adaptive algorithm balancing regret and label queries for hidden domains.
result Achieves lower regret compared to uniform and greedy queries.
New method tackles MNAR missingness in domain adaptation.
problem Handling missingness in both source and target data.
method Reduces MNAR missingness to imputation problem, leveraging recent MNAR imputation methods.
result Developed a novel domain adaptation procedure for MNAR missingness shift.
Proposes a method to improve multi-output Gaussian process for transfer learning.
problem Negative transfer and domain inconsistency in multi-output Gaussian process.
method Regularized MGP with convolution process and domain adaptation.
result Outperforms state-of-the-art benchmarks in simulation and real-world studies.
A method identifies domain-general features using causal graph constraints and regularization.
problem Identifying domain-general features without prior knowledge of spurious features.
method Proposes a novel regularization framework based on causal graph constraints.
result Demonstrates effectiveness in both synthetic and real-world data, outperforming state-of-the-art methods.
Many engineering problems require identifying feasible domains under implicit constraints. One example is finding acceptable car body styling designs based on constraints like aesthetics and functionality. Current active-learning based methods learn feasible domains for bounded input spaces. However, we usually lack pr…
We present a novel and hierarchical approach for supervised classification of signals spanning over a fixed graph, reflecting shared properties of the dataset. To this end, we introduce a Convolutional Cluster Pooling layer exploiting a multi-scale clustering in order to highlight, at different resolutions, locally con…
This paper examines how optimization methods affect the reliability of detecting inputs outside a model's training distribution.
problem The unreliability of deep neural networks on out-of-distribution inputs.
method Analysis of optimization methods' impact on OOD detection approaches.
result Optimization methods significantly influence the robustness of OOD detection approaches.
PETAL adapts models to changing target domains over time.
problem Lifelong test-time adaptation in changing target domains.
method Probabilistic framework with student-teacher model and data-driven parameter restoration.
result PETAL achieves better results than state-of-the-art for online lifelong test-time adaptation.
Develops a new approach to establish universality for any-dimensional machine learning models.
problem Understanding universality for models with inputs of varying sizes.
method Identifies any-dimensional functions with a unique function in an infinite-dimensional limit space, using symmetries and relations between inputs of different sizes.
result Establishes universality for several existing architectures and proposes modifications to restore it.
STAM learns important time steps and variables for multivariate time series prediction.
problem Accurate interpretation of multivariate time series predictions.
method Spatiotemporal attention mechanism (STAM) for multivariate time series modeling.
result STAM maintains state-of-the-art prediction accuracy with improved interpretability.
Proposes a method to generate diverse translations by conditioning on target domain.
problem NMT models lack diversity in translations, even with search algorithms.
method Condition the decoder on a latent variable representing target domain, generated by a target encoder.
result Generated diverse translations without affecting performance or training time.
The study examines generalization bounds for regression and classification tasks on adaptive input domains.
problem Understanding the generalization error in adaptive input domains for regression and classification.
method The analysis considers regression and classification separately, using Lipschitz continuity and 2-norm/0/1 loss for measurement. It also highlights the polynomial relationship between generalization bounds and network parameters.
result Generalization bounds for regression and classification are inversely proportional to a polynomial of the number of parameters, emphasizing the advantages of over-parameterized networks.
Adversarial attacks can fool algorithmic trading systems.
problem Adversarial perturbations can manipulate algorithmic trading models.
method Real-time adversarial attacks on trading algorithms using universal perturbations.
result Perturbations can fool trading algorithms at unseen data points.
A new method for aligning datasets without known correspondences.
problem Aligning datasets from different domains without labeled correspondences.
method Integrates MDS and Wasserstein Procrustes for joint optimization of embeddings and correspondences.
result Maps datasets to a common low-dimensional space without labeled correspondences.
Study reveals differences in medical image models' hidden representation refinement.
problem Understanding how intrinsic dimensionality changes in neural network hidden representations across different domains.
method Analysis of 11 natural and medical image datasets using 6 network architectures.
result Medical image models refine hidden representations earlier, suggesting differences in feature abstraction.
Method aggregates models with different hyper-parameters to adapt to target domain.
problem Choosing hyper-parameters for unsupervised domain adaptation.
method Linear aggregation of models with different hyper-parameters using weighted least squares for vector-valued functions.
result The target error is asymptotically not worse than twice the error of the optimal aggregation.
This paper tackles continuous domain adaptation with a new approach.
problem Learning in non-stationary environments, especially domain drift.
method Variational domain-agnostic feature replay, composed of inference, generative, and solver modules.
result Demonstrates the effectiveness of the proposed approach for practical usage.
DACL tackles domain-specific contrastive learning by using Mixup noise.
problem Domain-specific contrastive learning methods rely on data augmentation techniques that require domain knowledge.
method DACL uses Mixup noise to create similar and dissimilar examples without domain-specific data augmentation.
result DACL outperforms other domain-agnostic noising methods and combines well with domain-specific methods.
Dual random fields improve mineral potential predictions.
problem Limited understanding of multi-dimensional causalities and dependencies.
method Introduces dual random fields to pool response functions across the domain.
result Spatial inference and uncertainty assessment of response models and predictions.
HyperBO+ pre-trains a universal prior for Bayesian optimization across different domains.
problem Bayesian optimization requires domain-specific priors, limiting its applicability.
method Two-step pre-training method for hierarchical Gaussian processes.
result HyperBO+ achieves lower regrets on unseen search spaces.
Conversational agents such as Cortana, Alexa and Siri are continuously working on increasing their capabilities by adding new domains. The support of a new domain includes the design and development of a number of NLU components for domain classification, intents classification and slots tagging (including named entity…
Recently multi-domain recommender systems have received much attention from researchers because they can solve cold-start problem as well as support for cross-selling. However, when applying into multi-domain items, although algorithms specifically addressing a single domain have many difficulties in capturing the spec…
Domain adaptation is an important technique to alleviate performance degradation caused by domain shift, e.g., when training and test data come from different domains. Most existing deep adaptation methods focus on reducing domain shift by matching marginal feature distributions through deep transformations on the inpu…
We introduce PyTorch Geometric, a library for deep learning on irregularly structured input data such as graphs, point clouds and manifolds, built upon PyTorch. In addition to general graph data structures and processing methods, it contains a variety of recently published methods from the domains of relational learnin…
The introduction of convolutional layers greatly advanced the performance of neural networks on image tasks due to innately capturing a way of encoding and learning translation-invariant operations, matching one of the underlying symmetries of the image domain. In comparison, there are a number of problems in which the…
The study reveals a linear relationship between source and target domain classification errors based on disagreement.
problem Evaluating model performance under distribution shift with limited labeled data.
method Developed a theoretical foundation for analyzing disagreement in high-dimensional random features regression.
result The disagreement-on-the-line phenomenon occurs when classification error under the source domain is a linear function of the target domain.
In the time series classification domain, shapelets are small time series that are discriminative for a certain class. It has been shown that classifiers are able to achieve state-of-the-art results on a plethora of datasets by taking as input distances from the input time series to different discriminative shapelets. …
Paper proposes a new ML approach to estimate g-vulnerability without estimating conditional probabilities.
problem Estimating information leakage in black-box systems with large output domains.
method Developed a novel ML-based approach to estimate g-vulnerability without estimating conditional probabilities.
result The proposed method outperforms frequentist approach when dealing with large output domains.
Since its introduction, unsupervised representation learning has attracted a lot of attention from the research community, as it is demonstrated to be highly effective and easy-to-apply in tasks such as dimension reduction, clustering, visualization, information retrieval, and semi-supervised learning. In this work, we…
A new method for domain generalization using unlabeled data.
problem Learning from multiple domains with limited labeled data.
method Combines meta learning and semi-supervised learning with entropy-based pseudo-labeling and discrepancy loss.
result Significantly outperforms state-of-the-art methods on benchmark datasets.
We study the impact of input noise dimension on GAN performance.
problem Challenges in GANs like mode collapse and unstable training.
method Quantitative analysis using FID and IS on different image datasets.
result The optimal input noise dimension varies by dataset and architecture.