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,694 papers · 148 categories

Trend · papers per month

112225337449 · Jun 202019922001200920172026
48 results for label adaptation

Paper tackles online adaptation to changing label distributions.

problem Adapting machine learning models to changing label distributions in real-world settings.
method Leverages novel analysis to show estimation of expected test loss is possible without true labels. Proposes adaptation algorithms inspired by classical online learning techniques.
result Empirically verified that OGD is particularly effective and robust to various label shift scenarios.

ELSA efficiently adapts to label shift without post-prediction calibrations.

problem Domain adaptation with label shift across training and testing datasets.
method Moment-matching framework based on influence function geometry; solves linear systems for adaptation weights.
result ELSA estimator is n\sqrt{n}-consistent and asymptotically normal, achieving state-of-the-art estimation performance.

Paper proposes a method to adapt classifiers using complementary labels instead of true labels.

problem Training classifiers with true labels from the source domain is costly and sometimes impossible.
method Proposes a novel setting with complementary labels and a complementary label adversarial network (CLARINET).
result CLARINET significantly outperforms baselines on handwritten digits and object recognition tasks.

RLSbench benchmarks domain adaptation under label proportion shifts, revealing widespread failures and proposing a two-step meta-algorithm.

problem Domain adaptation under label proportion shifts is poorly understood and inconsistent across methods.
method RLSbench introduces a large-scale benchmark with 500 distribution shift pairs. It proposes a two-step meta-algorithm to improve domain adaptation methods under label proportion shifts.
result The two-step meta-algorithm improves domain adaptation methods by 2-10% accuracy points under large label proportion shifts.

EnMDAP aligns conditional distributions for multi-source domain adaptation using pseudolabels.

problem Training a target model with no labeled data in the absence of target data labels.
method EnMDAP uses label-wise moment matching and ensemble learning with multiple feature extractors.
result EnMDAP achieves state-of-the-art performance in multi-source domain adaptation tasks.

Framework for domain adaptation using pseudo-labels from unlabeled data.

problem Improving prediction accuracy in target domain with covariate shift.
method Kernel GLMs with labeled and pseudo-labeled data, using imputation model for target data.
result Non-asymptotic excess-risk bounds for effective labeled sample size.

Paper tackles backwards-compatible data adaptation for confounded covariate and label shifts.

problem Adapt covariates to predict labels confounded with covariate shifts.
method Proposes confounded shift framework based on minimizing divergence between source and target conditional distributions, conditioning on confounders.
result Demonstrates approach on synthetic and real datasets, achieving backwards-compatible data adaptation.

Unsupervised Domain Adaptation (DA) is used to automatize the task of labeling data: an unlabeled dataset (target) is annotated using a labeled dataset (source) from a related domain. We cast domain adaptation as the problem of finding stable labels for target examples. A new definition of label stability is proposed, …

2017-06-16abs ↗pdf ↗

OSAMD adapts online to changing distributions with limited labels.

problem Models struggle with continual distribution shifts and expensive labeling in changing environments.
method Online Active Continual Adaptation with OSAMD, an online teacher-student structure and margin-based criterion.
result OSAMD achieves favorable dynamic regret bounds under changing environments with limited labels.

AdapTable adapts tabular models to shifts without source data, improving HELOC performance.

problem Distribution shifts in tabular data threaten model performance.
method Shift-aware uncertainty calibrator and label distribution handler.
result Up to 16% improvement on HELOC dataset.

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.

Paper proposes a new method to aggregate multiple sources with different label distributions.

problem Aggregating from multiple target-shifted sources with different label distributions.
method Unified framework to select relevant sources for domain adaptation with limited label, unsupervised, and label partial unsupervised scenarios.
result Empirical results significantly outperform baselines.

Clarinet uses complementary labels to train classifiers with less source data.

problem Training classifiers with true-label data from source domain is costly.
method Proposes CLARINET to train classifiers with complementary-label source data and unlabeled target data.
result CLARINET significantly outperforms baselines in unsupervised domain adaptation.

Domain Adaptation in 6G wireless networks: When is it green?

problem Energy consumption of Domain Adaptation (UDA) compared to single-task training in 6G wireless networks.
method Investigate energy consumption and propose a method to determine the minimum number of target domains for UDA to be more energy-efficient than retraining.
result Proposed a method to determine the minimum number of target domains for UDA to be more energy-efficient than retraining.

Improves domain adaptation by aligning source and target distributions and mitigating noisy labels.

problem Improving performance on target images with different acquisition conditions.
method Combines optimal transport, MixUp regularization, and robust loss for noisy labels.
result Improves domain adaptation performance on various benchmarks and real-world problems.

New method uses limited labeled data and multiple starts to adapt models across domains.

problem Accurate predictions in target domain with few labeled data.
method Fine-tuning from multiple adaptive starts, extending UDA methods.
result Minimax-optimal target performance with limited labeled target data.

In this paper we propose a domain adaptation algorithm designed for graph domains. Given a source graph with many labeled nodes and a target graph with few or no labeled nodes, we aim to estimate the target labels by making use of the similarity between the characteristics of the variation of the label functions on the…

2019-11-07abs ↗pdf ↗

Paper tackles dynamic label shift in online learning, achieving optimal performance.

problem Adapting to changing class marginals in online supervised and unsupervised learning.
method Develops novel algorithms reducing adaptation to online regression, achieving optimal dynamic regret.
result Achieves superior performance in various online label shift scenarios.

CAT improves domain adaptation for fault diagnosis by calibrating teacher network predictions.

problem Performance drops in deep learning models when applied to different data distributions.
method CAT uses post-hoc calibration techniques to calibrate predictions of the teacher network during self-training.
result CAT achieves state-of-the-art performance on most transfer tasks in domain-adaptive IFD.

TTLSA adapts models to label shifts across domains with nuisance factors.

problem Adapting models to changes in label distributions with nuisance factors.
method TTLSA uses EM on unlabeled samples to adapt a trained model to new label distributions.
result TTLSA improves model performance over invariance methods and baseline methods.

New method removes pseudo-label bias for unsupervised domain adaptation.

problem Class imbalance and distribution shift between domains.
method Implicit class-conditioned domain alignment without explicit pseudo-label optimization.
result Effective in handling within-domain class imbalance and between-domain class distribution shift.

A new method for online multi-label stream classification.

problem Challenges in classifying continuous data streams with concept drift and delayed labels.
method Online unsupervised incremental method based on self-organizing maps.
result The method is highly competitive in both stationary and concept drift scenarios.

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…

2019-06-24abs ↗pdf ↗

APLC-XLNet improves XMTC by clustering labels and reducing computational time.

problem Efficiently tagging texts with many labels from a large set.
method Fine-tunes XLNet with APLC to approximate cross entropy loss.
result Achieved state-of-the-art results on XMTC benchmarks.

Proposes a framework to improve domain adaptation without labeled data.

problem Improving adaptability and preserving intrinsic data structure in unsupervised domain adaptation.
method Discriminative Manifold Propagation framework using soft labels and manifold metric alignment.
result The method achieves better transferability and discriminability compared to existing approaches.

Proposes a regularization method for unsupervised domain adaptation that aligns predictions with target data's top singular vectors.

problem Domain adaptation challenges in high joint error scenarios.
method Regularizes classifier to align with unsupervised target data guided by label alignment property (LAP).
result The method improves performance in MNIST-USPS domain adaptation and cross-lingual sentiment analysis.

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.