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

63125188250 · Jun 202019922001200920172026
48 results for pseudo labeling

Doubly robust self-training improves semi-supervised learning by balancing labeled and pseudo-labeled data.

problem Improving semi-supervised learning performance with limited labeled data.
method Introduces doubly robust self-training, a method that combines labeled and pseudo-labeled data to balance between labeled-only and pseudo-labeled-only training.
result Demonstrates superior performance of doubly robust self-training on ImageNet and nuScenes datasets.

Solves biased pseudo-labels in imbalanced SSL by refining them.

problem Imbalanced class distributions in semi-supervised learning lead to biased pseudo-labels.
method Formulates a convex optimization problem to refine pseudo-labels and develops an efficient algorithm, DARP.
result Demonstrates the effectiveness of DARP in various imbalanced semi-supervised scenarios.

Most recent semi-supervised deep learning (deep SSL) methods used a similar paradigm: use network predictions to update pseudo-labels and use pseudo-labels to update network parameters iteratively. However, they lack theoretical support and cannot explain why predictions are good candidates for pseudo-labels. In this p…

2019-08-09abs ↗pdf ↗

Pseudo-label selection affects semi-supervised learning performance.

problem Selection of pseudo-labeled data impacts semi-supervised learning's generalization performance.
method Embedding pseudo-label selection into decision theory, deriving a novel selection criterion based on posterior predictive.
result BPLS (Bayesian pseudo-label selection) outperforms traditional methods in overfitting-prone data.

Paper improves short text clustering by integrating semantic relationships into Optimal Transport.

problem Erroneous pseudo-labels caused by neglecting semantic consistency in existing OT methods.
method Designs an instance-level attention mechanism to capture semantic relationships and integrates them into the OT formulation.
result Generates reliable pseudo-labels that improve clustering accuracy.

Contrastive regularization improves semi-supervised learning by better propagating confident pseudo-labels.

problem Consistency regularization's limitation in high performance and efficiency.
method Proposes contrastive regularization to update model features, pushing confident labels into unlabeled samples.
result Improves semi-supervised learning tasks with fewer training iterations and robust performance.

MTL method uses unlabeled data with pseudo labels to improve classification with disjoint datasets.

problem Improving classification performance with disjoint labeled datasets using unlabeled data.
method Proposes MTL-SA method to select and augment unlabeled data with confident pseudo labels and close distribution to labeled data.
result Extensive experiments show the effectiveness of MTL-SA method in improving classification performance.

A new framework for semi-supervised learning using pseudo-representation labeling.

problem Improving deep learning models with limited labeled data.
method Pseudo-representation labeling framework integrating pseudo-labeling and self-supervised representation learning.
result Outperforms state-of-the-art semi-supervised learning methods in industrial classification problems.

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.

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.

The paper improves self-training in semi-supervised learning by selecting more robust pseudo-labeled data.

problem Improving the reliability of pseudo-labeled data selection in self-training for semi-supervised learning.
method Proposes a multi-objective utility function to select pseudo-labeled data that maximizes reliability, considering model selection, accumulation of errors, and covariate shift uncertainties.
result Robustness towards model choice can lead to substantial accuracy gains in self-training.

A new SSL method uses instance-dependent thresholds to improve accuracy.

problem Improving semi-supervised learning by better selecting confident unlabeled instances.
method Proposes instance-dependent thresholds that vary based on the ambiguity and error rates of pseudo-labels for each unlabeled instance.
result Demonstrates that instance-dependent thresholds provide a probabilistic guarantee for correct pseudo-labels.

GUST framework improves self-training by estimating node uncertainty and generating pseudo-labels.

problem Over-confidence in pseudo-labels during self-training.
method Graph-based uncertainty-aware self-training with stochastic node labeling.
result GUST achieves state-of-the-art performance, especially in sparse labeled data settings.

POTA improves short text clustering by generating reliable pseudo-labels.

problem Limited discriminative representations in short texts.
method POTA uses instance-level attention and optimal transport for semantic consistency and cluster structure.
result POTA outperforms state-of-the-art methods in short text clustering.

Proposes a new contrastive loss for semi-supervised medical image segmentation.

problem Lack of labeled data for medical image segmentation.
method Uses pseudo-labels and a local contrastive loss to learn good local representations.
result Achieved high segmentation performance on public cardiac and prostate datasets.

A method for selecting pseudo-labeled data in semi-supervised learning using generalized Bayes and soft revision.

problem Selecting pseudo-labeled data for semi-supervised learning with robustness to uncertainty.
method Using credal sets and the Gamma-Maximin method with soft revision to update priors and select pseudo-labeled data.
result The Gamma-Maximin method with soft revision can achieve promising results, especially in scenarios with low labeled data proportions.

The paper improves semi-supervised learning using ff-divergences and αα-Rényi divergences.

problem Improving semi-supervised learning with noisy pseudo-labels.
method Inspired by ff-divergences and αα-Rényi divergences, the paper develops new empirical risk functions and regularization techniques.
result The new methods show better performance than traditional self-training methods, especially in noisy pseudo-label scenarios.

Develops a method for kernel ridge regression under covariate shift using pseudo-labels.

problem Learning a regression function with small mean squared error over a target distribution with labeled data from a different feature distribution.
method Split labeled data into two subsets, conduct kernel ridge regression on each, use imputation model to fill missing labels, and select the best candidate model.
result Non-asymptotic excess risk bounds demonstrate effective adaptation to target distribution and covariate shift.

Several machine learning problems arising in natural language processing can be modeled as a sequence labeling problem. We provide Gaussian process models based on pseudo-likelihood approximation to perform sequence labeling. Gaussian processes (GPs) provide a Bayesian approach to learning in a kernel based framework. …

2014-12-25abs ↗pdf ↗

Self-training improves generalization by fitting to reliable pseudo-labels or gradually improving the classification plane.

problem Understanding how self-training improves generalization in high-dimensional Gaussian mixtures.
method Analyzing iterative self-training on binary Gaussian mixtures in the asymptotic limit.
result ST improves generalization by fitting to reliable pseudo-labels or gradually improving the classification plane.

Mitigates confirmation bias in SSL by adjusting pseudo labels dynamically.

problem Confirmation bias in semi-supervised learning leads to errors in pseudo labels.
method TaMatch framework adjusts scaling ratio to debias pseudo labels and dynamically adjusts target distribution.
result TaMatch significantly outperforms existing methods in SSL tasks.

Self-training algorithm improves classifier performance with labeled and unlabeled data.

problem Improving classifier performance with limited labeled data.
method Iterative learning of halfspaces, exploration and pruning phases.
result Misclassification error is bounded and never degrades compared to initial labeled set.

Method transfers knowledge without label overlap, source data, or target architecture consistency.

problem Difficulties in transfer learning due to label mismatch, restricted source data, and specialized target architectures.
method Uses deep generative models in two stages: pseudo pre-training and pseudo semi-supervised learning.
result Outperforms scratch training and knowledge distillation methods.

Proposes ConstraintMatch for semi-supervised clustering with unconstrained data.

problem Leveraging unconstrained data alongside constraints for clustering models.
method Semi-supervised context with pseudo-constraining and pseudo-labeling mechanisms.
result Demonstrates effectiveness of ConstraintMatch over baselines.

Proposes a meta-learning algorithm to improve semi-supervised learning.

problem Overfitting and limited model generalization in consistency-based semi-supervised learning.
method Introduces a learn-to-generalize regularization term and meta-gradient optimization.
result Demonstrates improved performance on various datasets compared to state-of-the-art methods.

New method estimates covariance in deep heteroscedastic regression without labels.

problem Estimating covariance in deep heteroscedastic models is challenging due to sample-dependent covariance and lack of ground truth.
method Proposes a self-supervised approach using KL Divergence and 2-Wasserstein distance for covariance estimation and a neighborhood-based heuristic for pseudo labels.
result Demonstrates effective pseudo labels and a computationally cheaper yet accurate deep heteroscedastic regression.

A new metric predicts model performance on unseen data.

problem Predicting performance on out-of-distribution data without labels.
method Uses model predictions to pseudo-label data, trains a new model, and measures difference from in-distribution models.
result Empirically outperforms existing methods on image and text classification tasks.

Dash selects dynamic pseudo labels from unlabeled data for semi-supervised learning.

problem Efficiently using unlabeled data in semi-supervised learning while avoiding incorrect pseudo labels.
method Dynamic thresholding to select a subset of unlabeled examples for training.
result Dash achieves theoretical convergence and outperforms state-of-the-art methods empirically.

PPI++ outperforms gold-standard labels only if pseudo-labels are highly correlated.

problem Optimizing statistical estimation using noisy pseudo-labels.
method Exact finite-sample analysis of PPI++ on mean estimation problem.
result PPI++ has provably worse estimation error than gold-standard labels alone in some settings.

Few-shot classification (FSC) is challenging due to the scarcity of labeled training data (e.g. only one labeled data point per class). Meta-learning has shown to achieve promising results by learning to initialize a classification model for FSC. In this paper we propose a novel semi-supervised meta-learning method cal…

2019-06-03abs ↗pdf ↗

The study examines when to trust confidence thresholding in pseudo-labelling regression.

problem Calibrated probabilities from classifiers used for pseudo-labelling need careful handling to avoid bias in downstream regression.
method Developed a diagnostic apparatus to predict and bound the bias induced by confidence thresholding, derived a closed-form expression for the attenuation bias.
result The bias can be predicted from the residual score variance VV^{*}, motivating a structural separation between classifier features and downstream controls.

RegMixMatch optimizes Mixup for semi-supervised learning by integrating high- and low-confidence samples.

problem Mixup degrades SSL performance by compromising artificial labels purity.
method RegMixMatch integrates high- and low-confidence samples, uses class-aware Mixup, and mitigates confirmation bias.
result RegMixMatch achieves state-of-the-art performance in SSL benchmarks.

Self-training improves model accuracy by refining pseudo-labels.

problem Improving semi-supervised learning with self-training.
method Theoretical insights into self-training algorithm with a focus on linear classifiers.
result Self-training iterations can improve model accuracy even if stuck in sub-optimal fixed points.