Unsupervised DA method using hyper-graph matching.
problem Discrepancy between source and target data distributions.
method Class-regularized hyper-graph matching with first-, second-, and third-order similarities.
result Improved performance on target domain compared to state-of-the-art methods.
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.
Paper proposes a new method for robust speaker verification.
problem Improving robustness in speaker verification systems.
method Combines soft VAD and self-adaptive VAD with DNN-based VAD.
result Significant improvement in verification performance in real-world environments.
Theoretical study on using optimal transport for domain adaptation.
problem Improving efficiency of machine learning algorithms in domain adaptation.
method Theoretical analysis of optimal transport theory applied to three DA settings.
result Wasserstein metric provides generalization guarantees for DA.
AMEAN tackles BTDA by learning meta-sub-targets to bridge domain gaps and misalignments.
problem Blending-target Domain Adaptation (BTDA) with multiple sub-targets that are hard to distinguish.
method AMEAN uses two adversarial processes: first to align source and mixed target domains, second to learn meta-sub-targets.
result AMEAN significantly outperforms existing DA algorithms in BTDA scenarios.
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 (GLS) 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.
A novel unsupervised domain adaptation method using hierarchical optimal transport.
problem Unsupervised domain adaptation between source and target domains.
method Hierarchical optimal transport, leveraging class labels for structure formation in the source domain and learning probability measures in the target domain.
result The proposed HOT-DA method outperforms state-of-the-art approaches on various datasets.
CAD-DA controls anomaly detection under domain adaptation.
problem Valid statistical inference after domain adaptation.
method Conditional Selective Inference to handle domain adaptation effects.
result Valid statistical inference under domain adaptation achieved.
SFS-DA method statistically tests FS reliability under domain adaptation.
problem Feature selection reliability under domain adaptation with limited target data.
method Selective Inference framework to control false positive rate and enhance true positive rate.
result SFS-DA method controls FPR below a pre-specified level α (e.g., 0.05) while maximizing true positive rate. Paper proposes MCC to reduce class confusion for versatile DA.
problem Class confusion in DA methods limits their performance across different scenarios.
method Introduces Minimum Class Confusion (MCC) loss function to handle various DA scenarios.
result MCC significantly improves performance on diverse DA scenarios, including Multi-Source and Multi-Target DA.
New DA method CIRM outperforms existing methods under structural causal model assumptions.
problem Improving prediction performance in domain adaptation with perturbed source and target data.
method Theoretical framework based on structural causal models to analyze and compare DA methods.
result CIRM method outperforms existing methods when covariates and label distributions are perturbed in target data.
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.
ADDA framework speeds up data augmentation in massive data settings.
problem Slow data augmentation in massive data settings.
method Develops asynchronous and distributed data augmentation (ADDA) framework.
result ADDA significantly speeds up data augmentation compared to parent DA algorithms.
TransCal calibrates DA models with lower bias and variance.
problem Calibrating DA models to estimate accurate predictive uncertainty.
method Transferable Calibration (TransCal) in a unified hyperparameter-free optimization framework.
result TransCal achieves more accurate calibration with lower bias and variance.
OMD and DA perform similarly in static settings but OMD is inferior under dynamic learning rates.
problem Proving and understanding the performance difference between OMD and DA under dynamic learning rates.
method Introducing stabilization to OMD and modifying its convergence analysis.
result OMD with stabilization and DA have the same performance guarantees under dynamic learning rates.
Data augmentation improves model robustness by enforcing a margin.
problem Understanding how data augmentation provably improves model robustness.
method Analyzed linear and nonlinear models, quantifying the margin introduced by data augmentation.
result Commonly used data augmentation techniques may only introduce significant margin after adding exponentially many points.
EnFF uses flows to speed up DA in high dimensions.
problem Efficiently assimilating noisy data in high-dimensional systems.
method Flow Matching (FM) for training-free, scalable data assimilation.
result EnFF accelerates DA with improved cost-accuracy tradeoffs and scalability.
ARBO-DART optimizes battery storage dispatch in day-ahead and real-time markets.
problem Optimizing battery storage dispatch in day-ahead and real-time markets.
method Adaptive Refinement Bayesian Optimization (ARBO) for Day-Ahead and Real-Time (ARBO-DART) markets.
result ARBO-DART optimizes battery storage dispatch without requiring analytic gradients or finite-scenario approximations.
GGDA simplifies DA for large models, speeding up attribution by up to 50x.
problem Computational intensity of existing DA methods limits their applicability to large-scale models.
method Generalized Group Data Attribution (GGDA) framework attributing to groups of training points.
result GGDA achieves up to 50x speedups over standard DA methods while maintaining effectiveness.
This review article surveys data augmentation MCMC algorithms.
problem Sampling from intractable probability distributions.
method Comprehensive study of DA MCMC algorithms, their convergence properties, and acceleration strategies.
result Synthesizes recent developments and provides insights for researchers.
STAND-DA improves AD in DA target domains with limited data.
problem Statistical validity of AD after DA with limited data.
method Selective Inference framework for GPU-accelerated p-value computation. result Valid p-values and controlled false positive rate. DA improves solar wind forecasts by updating model boundary conditions.
problem Improving solar wind forecasting accuracy.
method Variational Data Assimilation with solar wind model and in-situ observations.
result DA forecasts are more accurate than non-DA forecasts, especially when STEREO-B's latitude is offset from Earth.
This paper explores bias in GAN-based data augmentation for small samples.
problem Lack of sufficient samples in machine learning tasks.
method Experiments with GAN-based data augmentation to identify and mitigate bias.
result Bias in GAN-generated data can affect model performance, especially when it is not sufficiently low.
The paper studies geometric properties of soliton surfaces using an extended Darboux frame field.
problem Geometric analysis of soliton surfaces associated with the Betchov-Da Rios equation.
method Derivative formulas of an extended Darboux frame field, geometric invariants, curvature calculations.
result Construction of curvature ellipse and Wintgen ideal soliton surfaces.
Paper tackles multi-source domain adaptation for regression.
problem Predicting HDL cholesterol levels using gut microbiome data.
method Two-step procedure: 1) Extend a flexible single-source DA algorithm for classification to regression. 2) Augment with ensemble learning for multi-source DA.
result Consistent improvement in HDL cholesterol level prediction performance over existing methods.
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.
There are few papers about the consumption pattern of the Portuguese wine, using econometrics techniques. This work, pretend to analyze the consumers behavior of the wine produced in Portugal, determining the demand equation with panel data methods. There were used statistical data available in the Alentejo Regional Wi…
This work extends ME-RL using diffusion models to sample optimal policies.
problem Sampling from the optimal policy trajectory distribution in ME-RL.
method Introducing Diffusion-Augmented Markov Decision Processes (DA-MDPs) to minimize reverse KL divergence.
result DA-MDPs enable seamless integration into various ME-RL methods and outperform baselines.
New method transfers causal mechanisms for few-shot domain adaptation.
problem Few labeled target domain data for regression problems.
method Mechanism transfer using structural equations in causal modeling.
result Method can adapt from apparently different distributions.
Modeling long-range context for multi-function utterances in dialogues.
problem Complex dependencies across dialogue turns in long utterances.
method Adapted Convolutional Recurrent Neural Network (CRNN) to model interactions between utterances.
result Significantly outperforms existing work on CDA recognition on a tech forum dataset.
Paper analyzes gradient descent with noisy data copies for linear regression, showing regularization and acceleration effects.
problem Improving generalization in machine learning through data augmentation with noise.
method Gradient descent with on-line noisy copies for linear regression analysis.
result Training with on-line noisy copies is equivalent to ridge regularization with a specific regularization parameter.
New method uses data augmentation to improve causal effect estimation.
problem Improving causal effect estimation in the presence of hidden confounders.
method Introduces IV-like regression and data augmentation techniques.
result Data augmentation can simulate worst-case scenarios for causal estimation.
Framework transfers knowledge across multiple target domains without shared categories.
problem Learning unlabeled target domains without shared categories.
method Model parameter adaptation (PA-1SmT) to transfer knowledge through a common model parameter dictionary.
result Framework demonstrates superiority on three domain adaptation benchmark datasets.
Deep learning improves chaotic dynamics filtering without ensemble.
problem Discovering efficient DA schemes for chaotic dynamics.
method Residual Convolutional Neural Network for the analysis step.
result Deep learning achieves ensemble filtering accuracy without an ensemble.
Bayesian model selection optimizes data augmentation for improved machine learning robustness.
problem Choosing optimal data augmentation parameters is challenging and often done through trial and error.
method Interprets augmentation parameters as model hyperparameters and uses Bayesian model selection to optimize them.
result Our approach improves calibration and robust performance on various tasks.
Researchers link tangle invariants for Khovanov and knot Floer homologies.
problem Relating tangle invariants for Khovanov and knot Floer homologies.
method Constructing algebraic DA bimodules for tangles and open braids, showing homotopy equivalence to Ozsvath-Szabo bimodules.
result Homotopy equivalence of DA bimodules for tangles and knot Floer homology.
A new method finds stable labels for target data using random walks.
problem Automating the labeling of unlabeled data from a related domain.
method Random walk on a graph with stability probabilities to find stable labels.
result The method yields stable labels for target data, improving domain adaptation.
Deep learning outperforms classic machine learning in DAS event detection.
problem Event detection in Distributed Acoustic Sensing (DAS).
method Comparison of classic machine learning and image-based deep learning approaches.
result Image-based deep learning offers significantly faster event detection and execution times.
Improves compression of neural networks for embedded systems.
problem High computational cost and data labeling issues in DNNs.
method Domain Adaptation Regularization for Spectral Pruning.
result Our method outperforms existing methods by a large margin for high compression rates.
Study of discrete analogues of Atiyah sequence in principal bundles.
problem Discrete analogues of vector bundles and connections in principal bundles.
method Analysis in two categories: fiber bundles with sections and local Lie groupoids, defining discrete curvature and splittings.
result Correspondence between splittings of discrete Atiyah sequence and discrete connections with trivial curvature.
PLOT uses optimal transport to find neural site handles for causal abstraction.
problem Finding the relevant neural site for causal analysis is computationally challenging.
method PLOT employs optimal transport to localize causal variables from neural network outputs.
result PLOT efficiently finds intervention handles for causal abstraction in neural networks.
New method improves anomaly detection in acoustic signals.
problem Poor anomaly detection performance in existing acoustic signal-based unsupervised methods.
method Deep autoencoding Gaussian mixture model with hyper-parameter optimization.
result Significantly improved anomaly detection performance compared to previous methods.
Paper optimizes energy trading on DA markets using RL.
problem Volatility and randomness in renewable energy sources.
method Markov Decision Process, reinforcement learning, evolutionary algorithm.
result RL-based strategy generates highest market profits.
DAS-PINNs uses deep learning to solve complex PDEs more accurately.
problem Solving high-dimensional PDEs with high accuracy.
method Deep neural networks and generative models for adaptive sampling.
result DAS-PINNs significantly improves solution accuracy for low regularity and high-dimensional problems.
CoDATS improves DA on time series data with weak supervision.
problem Improving domain adaptation for time series data with limited labeled data.
method CoDATS model for Time Series data, DA-WS method with weak supervision.
result Significant accuracy improvements over state-of-the-art methods.
DA-LSTM adapts LSTM depth to non-uniform data, improving efficiency.
problem Non-uniform information distribution in sequential data cannot be accurately modeled by traditional LSTM.
method Developed DA-LSTM architecture that dynamically adjusts LSTM depth based on information distribution.
result DA-LSTM reduces computation resource usage and convergence time by 41.78% and 46.01% respectively.
New algorithm uses conditionally invariant components to improve domain adaptation performance.
problem Improving domain adaptation performance when source and target data distributions differ.
method Conditionally invariant components (CICs) and importance-weighted conditional invariant penalty (IW-CIP) algorithm.
result New algorithm provides target risk guarantees and addresses label-flipping features.
Machine learning improves model forecasts by correcting errors.
problem Improving short- to mid-range forecasts by correcting model errors.
method Iterative method combining data assimilation and machine learning.
result Hybrid models outperform original models in forecasts.