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

Trend · papers per month

240480719959 · Jun 202019922001200920172026
48 results for conditional label distribution

LACD uses unlabeled data to improve conditional diffusion models.

problem Costly and time-consuming acquisition of labeled data.
method Label-augmented conditional diffusion (LACD) with joint denoising score matching.
result LACD converges faster in total variation and Wasserstein-1 distances with sufficient unlabeled data.

A new method compresses conditional distributions of labelled data.

problem No existing method directly compresses the conditional distribution of labelled data.
method Introduce Average Maximum Conditional Mean Discrepancy (AMCMD), derive a closed form estimator, and extend Kernel Herding (KH) to Average Conditional Kernel Herding (ACKH).
result Directly compressing conditional distributions outperforms joint distribution compression and greedy selection.

Majority of state-of-the-art deep learning methods are discriminative approaches, which model the conditional distribution of labels given inputs features. The success of such approaches heavily depends on high-quality labeled instances, which are not easy to obtain, especially as the number of candidate classes increa…

2019-04-02abs ↗pdf ↗

CAN learns conditional and interventional distributions from unlabeled data.

problem Learning conditional and interventional distributions from unlabeled data.
method CAN framework with LGN and CIGN architectures, equipped with an intervention mechanism.
result CAN generates both interventional and conditional samples without needing the causal graph.

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.

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.

New CPS model tackles conditional probability shift in machine learning.

problem Discrepancy between source and target distributions in machine learning.
method Conditional Probability Shift Model (CPSM) using multinomial regression and EM algorithm.
result Superior balanced classification accuracy on target data compared to existing methods.

Estimates calibration error under label shift without labels.

problem Ensuring model reliability in the face of dataset shift without access to labels.
method Importance re-weighting of the labeled source distribution to estimate calibration error under label shift.
result Effective and reliable CE estimation with respect to the shifted target distribution.

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.

We introduce a new model for building conditional generative models in a semi-supervised setting to conditionally generate data given attributes by adapting the GAN framework. The proposed semi-supervised GAN (SS-GAN) model uses a pair of stacked discriminators to learn the marginal distribution of the data, and the co…

2017-08-19abs ↗pdf ↗

We study the problem of learning conditional generators from noisy labeled samples, where the labels are corrupted by random noise. A standard training of conditional GANs will not only produce samples with wrong labels, but also generate poor quality samples. We consider two scenarios, depending on whether the noise m…

2018-11-08abs ↗pdf ↗

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.

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.

Study approximates operators on labelled conditional distributions for non-exchangeable systems.

problem Approximating operators on constrained probability measures for non-exchangeable systems.
method Combines cylindrical approximations and DeepONet-type neural architecture for finite-dimensional representations.
result Establishes a universal approximation theorem for continuous operators on Mλ\cal M_λ.

Study reveals differences in label shift problem difficulty in supervised vs. unsupervised settings.

problem Label shift problem in non-parametric classification.
method Analysis of minimax rates in supervised and unsupervised settings, focusing on class conditional distributions estimation.
result A class proportion estimation approach is minimax rate-optimal in the unsupervised setting.

Generative adversarial networks (GANs) are a framework that learns a generative distribution through adversarial training. Recently, their class-conditional extensions (e.g., conditional GAN (cGAN) and auxiliary classifier GAN (AC-GAN)) have attracted much attention owing to their ability to learn the disentangled repr…

2018-11-27abs ↗pdf ↗

CcGAN tackles conditional image generation for continuous labels.

problem Mathematical challenges in conditioning on continuous, scalar labels.
method Proposes novel empirical losses and label input methods for continuous conditional GANs.
result CcGAN generates diverse, high-quality images from continuous labels.

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.

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.

This paper introduces LR-FFS for robust feature screening in federated learning under label shift.

problem Label shift challenges in federated learning for high-dimensional classification.
method Unified feature screening framework, label-shift robust federated feature screening (LR-FFS), federated estimation procedure.
result LR-FFS outperforms existing methods in diverse client environments with varying class distributions, sample sizes, and missing data.

Paper proposes SJS model to estimate model performance under covariate and label shifts.

problem Estimating model performance when both covariates and labels shift.
method Sparse Joint Shift (SJS) model and SEES algorithm.
result SEES achieves significant shift estimation error improvements over existing approaches.

New method MRI improves machine learning models' ability to generalize to unseen data.

problem Machine learning models often fail to generalize well to out-of-distribution data.
method Introduces a new notion of invariance (MRI) and a practical version (MRI-v1) to improve model generalization.
result MRI-v1 guarantees invariant predictors and outperforms IRM-v1 in various settings.

Transfer learning aims to improve learning in target domain by borrowing knowledge from a related but different source domain. To reduce the distribution shift between source and target domains, recent methods have focused on exploring invariant representations that have similar distributions across domains. However, w…

2017-07-31abs ↗pdf ↗

Paper investigates methods to improve classification by inducing a hierarchy from flat labels.

problem Improving classification performance on datasets lacking a natural hierarchy.
method The approach involves clustering conditional distributions and using a hierarchical classifier with the induced hierarchy.
result The methods can discover latent hierarchies and improve accuracy in various applications.

We present a new replay-based method of continual classification learning that we term "conditional replay" which generates samples and labels together by sampling from a distribution conditioned on the class. We compare conditional replay to another replay-based continual learning paradigm (which we term "marginal rep…

2018-10-29abs ↗pdf ↗

Deep models can fit noisy labels, but robustness and reliability are still issues.

problem Training deep models with noisy labels leads to unreliable uncertainty quantification.
method Analysis of conditional distribution over noisy labels and evaluation of robust loss functions.
result Strictly proper and robust loss functions preserve accuracy but do not guarantee reliability.

This paper proposes a semi-conditional normalizing flow model for semi-supervised learning. The model uses both labelled and unlabeled data to learn an explicit model of joint distribution over objects and labels. Semi-conditional architecture of the model allows us to efficiently compute a value and gradients of the m…

2019-05-01abs ↗pdf ↗

NURD improves model performance by distilling representations independent of nuisance variables.

problem Models trained under spurious correlations may fail on data with different nuisance-label relationships.
method Developed Nuisance-Randomized Distillation (NURD) to find representations independent of nuisance variables.
result NURD finds representations that perform better regardless of nuisance-label relationships.

Ridge regression shows different behaviors in binary classification with noisy labels.

problem Binary classification with noisy labels and anisotropic cluster distributions.
method Investigation of ridge regression behavior in overparameterized settings with label noise.
result Ridge regression exhibits qualitatively different behavior based on the scale of cluster mean vectors and covariance matrices.

Deep generative models are becoming a cornerstone of modern machine learning. Recent work on conditional generative adversarial networks has shown that learning complex, high-dimensional distributions over natural images is within reach. While the latest models are able to generate high-fidelity, diverse natural images…

2019-03-06abs ↗pdf ↗

Well-known for its simplicity and effectiveness in classification, AdaBoost, however, suffers from overfitting when class-conditional distributions have significant overlap. Moreover, it is very sensitive to noise that appears in the labels. This article tackles the above limitations simultaneously via optimizing a mod…

2018-06-21abs ↗pdf ↗

Under covariate shift, training (source) data and testing (target) data differ in input space distribution, but share the same conditional label distribution. This poses a challenging machine learning task. Robust Bias-Aware (RBA) prediction provides the conditional label distribution that is robust to the worstcase lo…

2017-12-28abs ↗pdf ↗

CWAN tackles multi-source heterogeneous domain adaptation with conditional weighting.

problem Learning cross-domain samples from multiple heterogeneous domains.
method CWAN uses a feature transformer, label classifier, and domain discriminator to learn from multiple sources.
result CWAN outperforms state-of-the-art methods on four real-world datasets.

Corrects distribution shift in target shift scenarios using importance weighting.

problem Analyzes importance weighting for correcting distribution shift under target shift.
method Analyzed importance-weighted kernel ridge regression under target shift.
result Shows that importance weighting corrects the train-test mismatch without altering input-space complexity.

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.

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…

2018-02-08abs ↗pdf ↗