SKADA-bench evaluates unsupervised DA methods across diverse modalities.
problem Evaluating unsupervised DA methods on diverse modalities with realistic validation.
method Nested cross-validation and unsupervised model selection scores.
result Highlights the importance of realistic validation and provides practical guidance.
Proposes a method to generate realistic counterfactuals by learning relationships.
problem Counterfactual explanations often ignore intrinsic relationships between data attributes.
method Uses a variational auto-encoder to learn relationships and perturb the latent space.
result The model preserves relationships and generates realistic counterfactuals.
The paper examines domain generalization algorithms and finds empirical risk minimization performs well.
problem Comparing domain generalization algorithms is difficult due to inconsistent experimental conditions.
method Implemented DomainBed, a testbed for domain generalization with seven datasets and model selection criteria.
result Empirical risk minimization shows state-of-the-art performance across all datasets.
Proposes a unified normalization method for multi-domain medical images.
problem Inadequate joint information across multiple datasets hinders image segmentation performance.
method Adversarial and task-driven normalization approach to learn a common normalizing function across multiple datasets.
result Jointly normalized images improve segmentation accuracy by up to 57.5%.
Evaluates transfer learning methods in dynamic data availability scenarios.
problem Real-world data availability varies over time, leading to unrealistic TL method evaluations.
method Proposes a data manipulation framework to simulate varying data availability and domain transformations.
result Demonstrates the usefulness of the framework on proprietary and publicly available datasets.
Agent learns from an expert, adapting to constraints in concept learning.
problem Insufficient query selection in active learning for realistic human domains.
method Imitation learning to reason about both internal goals and external constraints.
result Agent outperforms other active learners under most constrained conditions.
This work evaluates PDA methods without target labels, revealing significant accuracy drops.
problem Evaluating PDA methods without target labels and inconsistent experimental settings.
method Realistic evaluation of 7 PDA methods with 7 model selection strategies on 2 datasets.
result Accuracy drops up to 30 percentage points without target labels, only one method performs well.
Generative model creates realistic scenes from pixel-wise labels.
problem Creating photo-realistic scenes from pixel-wise labels.
method Semantic bottleneck GAN model combining conditional and unconditional generation networks.
result Model outperforms state-of-the-art models in unsupervised image synthesis.
We present a framework for translating unlabeled images from one domain into analog images in another domain. We employ a progressively growing skip-connected encoder-generator structure and train it with a GAN loss for realistic output, a cycle consistency loss for maintaining same-domain translation identity, and a s…
The paper shows how integrating categorical semantics can enhance unsupervised domain translation.
problem Improving unsupervised domain translation between perceptually different domains.
method Learning invariant categorical semantic features in an unsupervised manner and conditioning them on the style encoder.
result Conditioning the style encoder on learned categorical semantics improves translation and stylization.
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 improves domain adaptation by aligning sub-domains.
problem Real-world domain adaptation with shifted class distributions.
method Rebalanced sub-domain alignment and novel generalization bound.
result Improves performance in shifted class distribution scenarios.
Detects out-of-domain cases with limited training data.
problem Detecting out-of-domain cases with insufficient in-domain training data.
method Proposes an OOD-resistant Prototypical Network.
result Outperforms state-of-the-art methods in zero-shot OOD detection.
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.
Realistic music generation is a challenging task. When building generative models of music that are learnt from data, typically high-level representations such as scores or MIDI are used that abstract away the idiosyncrasies of a particular performance. But these nuances are very important for our perception of musical…
New approach tackles open compound domain adaptation without clear domain labels.
problem Adapting models to new, mixed domains without domain labels.
method Curriculum domain adaptation strategy and memory module.
result Demonstrated effectiveness on various tasks.
DIVA generates diverse tasks for complex simulators, enabling adaptive agent training.
problem Lack of diverse training data for complex, open-ended simulators.
method Evolutionary approach using domain randomization and procedural generation.
result Successfully trains adaptive agent behavior in complex simulators.
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.
Self-training improves gradual domain adaptation with unlabeled data.
problem Improving machine learning models' adaptability to gradually shifting data distributions.
method Proved upper bounds on self-training error, highlighted the importance of regularization and label sharpening, and demonstrated algorithmic insights.
result Self-training works well for gradual shifts, especially with small Wasserstein-infinity distance.
New benchmark and COAL model tackle class-imbalanced domain adaptation.
problem Aligning feature and label distributions across domains with different label distributions.
method COAL model combining feature and label distribution alignment.
result COAL model outperforms recent domain adaptation methods.
Proposes a label propagation framework for domain adaptation.
problem Subpopulation shift in machine learning domains.
method Label propagation based on a teacher classifier trained on source domain.
result End-to-end finite-sample guarantees on domain adaptation algorithm.
Unsupervised learning representations generalize better than supervised learning under distribution shifts.
problem Robustness of unsupervised representations to distribution shift.
method Extensive evaluation on synthetic and realistic datasets, including controllable domain generalization datasets.
result Unsupervised representations learned from SSL and AE generalize better than supervised learning under various distribution shifts.
We propose a general approach to modeling semi-supervised learning (SSL) algorithms. Specifically, we present a declarative language for modeling both traditional supervised classification tasks and many SSL heuristics, including both well-known heuristics such as co-training and novel domain-specific heuristics. In ad…
Non-negative blind source separation (non-negative BSS), which is also referred to as non-negative matrix factorization (NMF), is a very active field in domains as different as astrophysics, audio processing or biomedical signal processing. In this context, the efficient retrieval of the sources requires the use of sig…
Recent advances in deep learning-based object detection techniques have revolutionized their applicability in several fields. However, since these methods rely on unwieldy and large amounts of data, a common practice is to download models pre-trained on standard datasets and fine-tune them for specific application doma…
Domain-Adversarial Neural Networks improve fault diagnosis models across different machines.
problem Improving fault diagnosis models on new machines with limited labeled data.
method Domain-Adversarial Neural Networks (DANN) and other methods for domain adaptation.
result Unified experimental protocol for fair comparison of domain adaptation methods.
Generates synthetic laparoscopic images for training deep neural networks.
problem Lack of large labeled data sets for laparoscopic image processing.
method Unpaired image-to-image translation to generate realistic synthetic images.
result Synthetic data set improves liver segmentation performance without manual labeling.
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.
End-to-end PGL framework tackles open-set domain shift.
problem Real-world domain shift with unknown additional classes.
method Episodic training in graph neural network with adversarial learning.
result Guarantees tighter upper bound of target error.
Paper tackles open set domain adaptation with theoretical bounds and algorithms.
problem Improving model performance on target domain with unknown classes.
method Theoretical investigation and regularization of open set difference, leading to DAOD algorithm.
result Proposed learning bound and algorithm show superior performance compared to existing methods.
Generative Adversarial Networks (GANs) can produce images of remarkable complexity and realism but are generally structured to sample from a single latent source ignoring the explicit spatial interaction between multiple entities that could be present in a scene. Capturing such complex interactions between different ob…
New model optimizes portfolios with realistic transaction costs.
problem Real-world transaction costs impact portfolio profitability.
method DPGRGT model with 2D relative-attentional Gated Transformer.
result Model outperforms baseline models in U.S. stock market data.
Butterfly tackles wild unsupervised domain adaptation with noisy labeled data.
problem Training classifiers with noisy labeled data from source domain and unlabeled data from target domain.
method Butterfly framework, maintaining four deep networks for simultaneous adaptations.
result Butterfly significantly outperforms existing methods in wild unsupervised domain adaptation.
Classification problems in security settings are usually contemplated as confrontations in which one or more adversaries try to fool a classifier to obtain a benefit. Most approaches to such adversarial classification problems have focused on game theoretical ideas with strong underlying common knowledge assumptions, w…
CounteRGAN generates realistic, actionable counterfactuals for machine learning models.
problem Creating realistic and actionable counterfactuals for machine learning models.
method Applying Residual GANs to improve counterfactual realism and actionability.
result CounteRGAN produces counterfactuals with improved realism and actionability, achieving real-time applicability.
Paper tackles noisy S-D data for classification.
problem Learning from noisy Similar (S) and Dissimilar (D) pairs.
method Proposes two algorithms to learn from noisy S-D data under two noise models.
result Noise-informed algorithms outperform noise-blind baselines.
Robust OPE framework uses human inputs to improve policy evaluation in changing environments.
problem Inaccurate policy evaluations due to shifts in environment properties.
method Adapts OPE methods to shifts on user-inputted covariates, providing more realistic utility estimates.
result Robust OPE framework yields less pessimistic policy evaluations and captures realistic dataset shifts.
Study adversarial attacks on automated trading systems.
problem Robustness of deep learning models in algorithmic trading.
method New attacks with size constraints to evaluate model robustness.
result Realistic adversarial attacks can fool automated trading systems.
Emotion classification improved using brain signals from tactile enhanced multimedia.
problem Classifying viewer emotions in tactile enhanced multimedia.
method Frequency domain features from EEG data analyzed using SVM.
result Increased accuracy (76.19%) compared to time domain features (63.41%).
MarS simulates financial markets using generative models.
problem Simulating realistic financial market effects.
method Order-level generative foundation model (LMM) for realistic, interactive, and controllable order generation.
result Strong scalability and robust realism in MarS.
DiffObs predicts global precipitation with realistic wave modes and low frequency variations.
problem Predicting global precipitation evolution using satellite observations.
method Autoregressive generative diffusion model trained on satellite data.
result Model generates realistic wave modes and low frequency variations, validating its potential for climate prediction.
Typically a classifier trained on a given dataset (source domain) does not performs well if it is tested on data acquired in a different setting (target domain). This is the problem that domain adaptation (DA) tries to overcome and, while it is a well explored topic in computer vision, it is largely ignored in robotic …
Symmetry augmentation speeds up learning in robotics tasks.
problem Learning efficiency in robotics tasks with limited data.
method Data augmentation using symmetry in the quadruped domain of DeepMind control suite.
result Agent learns faster with augmented symmetry experiences.
We introduce Deep Variational Bayes Filters (DVBF), a new method for unsupervised learning and identification of latent Markovian state space models. Leveraging recent advances in Stochastic Gradient Variational Bayes, DVBF can overcome intractable inference distributions via variational inference. Thus, it can handle …
We propose a segmentation framework that uses deep neural networks and introduce two innovations. First, we describe a biophysics-based domain adaptation method. Second, we propose an automatic method to segment white and gray matter, and cerebrospinal fluid, in addition to tumorous tissue. Regarding our first innovati…
Algorithm generates private continuous-time data for sensitive domains.
problem Private generation of continuous-time data for sensitive domains.
method Mean-field Langevin dynamics and noisy particle gradient descent.
result Strong privacy guarantees for one-time data contributions.
Machine learning has become pervasive in multiple domains, impacting a wide variety of applications, such as knowledge discovery and data mining, natural language processing, information retrieval, computer vision, social and health informatics, ubiquitous computing, etc. Two essential problems of machine learning are …
Deep learning usually requires big data, with respect to both volume and variety. However, most remote sensing applications only have limited training data, of which a small subset is labeled. Herein, we review three state-of-the-art approaches in deep learning to combat this challenge. The first topic is transfer lear…