ORIL learns a reward function from unlabeled data to improve robot learning.
problem Leveraging unlabeled data for robot learning.
method ORIL learns a reward function from demonstrator and unlabeled trajectories, annotates data, and trains an agent via offline reinforcement learning.
result ORIL consistently outperforms BC agents on various robotic tasks.
Enhances adversarial robustness with unlabeled out-of-domain data.
problem Improving robustness of models against adversarial attacks.
method Leveraging unlabeled data from multiple domains to bridge the sample complexity gap in adversarial robustness.
result Better adversarial robustness achieved when unlabeled data comes from a shifted domain.
New methods learn from PU data with non-representative positives.
problem Learning from PU data with non-representative positive classes.
method Integrates negative-unlabeled and unlabeled-unlabeled learning, or uses a recursive risk estimator.
result Effective across various real-world datasets and forms of positive bias.
Prevents sensitive data generation in diffusion models using labeled and unlabeled data.
problem Generating sensitive data in diffusion models using unlabeled data.
method Positive-Unlabeled Diffusion Models, approximating ELBO with labeled and unlabeled data.
result Prevents the generation of sensitive data without compromising image quality.
Method improves regression models using unlabeled data.
problem Improving predictive performance of regression models with limited labeled data.
method Mixed semi-supervised generalized-linear-regression with different mixing mechanisms.
result Integrating unlabeled data consistently improves predictive performance.
New method learns to weight unlabeled data in semi-supervised learning.
problem Equal weighting of all unlabeled data in semi-supervised learning.
method Adjust weights for each unlabeled example using influence function.
result Technique outperforms state-of-the-art methods on image and language classification tasks.
Bayesian analysis shows unlabeled data improve graph-based semi-supervised learning.
problem Improving semi-supervised learning with limited labeled data.
method Bayesian nonparametric approach using unlabeled data for graph-based learning.
result Posterior contracts optimally around the truth with sufficient unlabeled data.
Paper analyzes how unlabeled data improves SSL and adversarial robustness.
problem Understanding how unlabeled data impacts SSL and adversarial robustness.
method Minimax analysis and adversarial training.
result Reconstruction-based SSL algorithm is rate-optimal under various models and enhances adversarial robustness.
New research shows semantic data matching can degrade SSDL performance.
problem The limits of semantic data set matching in semi-supervised learning.
method Demonstrated through simulations and a new dissimilarity measure.
result Semantic data matching can degrade SSDL performance under non-IID data.
Bayesian framework uses unlabeled data to improve fairness assessment.
problem Reliable fairness assessment with limited labeled data.
method Hierarchical latent variable model with Bayesian inference.
result Significant reduction in estimation error for fairness metrics.
Assessing the performance of a learned model is a crucial part of machine learning. However, in some domains only positive and unlabeled examples are available, which prohibits the use of most standard evaluation metrics. We propose an approach to estimate any metric based on contingency tables, including ROC and PR cu…
This paper uses unlabeled data to improve compressed neural networks.
problem Difficulty in retraining pre-trained models due to limited labeled data.
method Uses unlabeled data to mimic classification characteristics and aligns feature distributions using adversarial loss.
result Unlabeled data significantly improves the performance of compressed neural networks.
New insights on how unlabeled data can speed up learning.
problem Understanding when unlabeled data can improve learning rates.
method Analyzing minimax learning rate improvements with labeled and unlabeled data.
result Conditions for improvements in learning rates are identified and examples demonstrating these conditions are provided.
MILDA uses unlabelled data to compute LDA projections.
problem Training LDA models with unlabelled data.
method Minimal prior information to compute LDA projection vector.
result MILDA closely matches supervised LDA performance and adapts to non-stationary data.
New method improves adversarial learning with unlabeled data.
problem Poor quality of pseudo labels on unlabeled data.
method Robust Co-training (RCT) using deep co-training.
result RCT significantly outperforms baselines in adversarial robustness.
Improves SSL with doubly robust estimation of unlabeled class distribution.
problem Limited labeled data and long-tailed class distributions in unlabeled data.
method Explicitly estimate unlabeled class distribution using doubly robust estimator.
result Improves performance of SSL methods on unlabeled data.
New method uses unlabeled data to prevent forgetting in deep learning.
problem Catastrophic forgetting in lifelong learning with deep neural networks.
method Class-incremental learning scheme with global distillation, confidence-based sampling, and learning strategy.
result Significantly higher accuracy and less forgetting compared to state-of-the-art methods.
DeepMimic trains neural networks using mostly unlabeled data.
problem Insufficient labeled data for deep learning.
method Mentor-Student approach with unlabeled data.
result Student model achieves mentor's performance without labeled data.
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.
Enhances U-statistics for semi-supervised datasets using unlabeled data.
problem Efficiently utilizing unlabeled data in semi-supervised settings.
method Semi-supervised U-statistics enhanced by unlabeled data.
result Proposed method is asymptotically Normal and more efficient than classical U-statistics.
LLM evaluation suffers from systematic biases and lacks reliable positive judgments.
problem LLM evaluation suffers from systematic biases and lacks reliable positive judgments.
method Formulate LLM evaluation as a positive-unlabelled learning problem and propose a geometric auditing framework based on Partial Optimal Transport.
result Improved alignment with human preferences, increased robustness to presentation biases, and interpretable confidence estimates.
Generative model creates synthetic unlabeled data for SSL.
problem Training SSL models without real unlabeled datasets.
method Meta-optimized synthetic samples generated from generative models.
result Synthetic samples improve SSL performance more efficiently than real unlabeled data.
Proposes a few-shot learning method for feature selection without labeled data.
problem Feature selection in unlabeled data with limited instances.
method Uses Concrete random variables and permutation-invariant neural networks to select features from multiple source tasks.
result Outperforms existing methods in feature selection performance.
A method for classification using pairwise similarities and unlabeled data.
problem Handling pairwise similarities and unlabeled data for classification.
method Empirical risk minimization approach to create an unbiased risk estimator.
result Derives an unbiased risk estimator for handling both similarities and unlabeled data.
SAL framework uses unlabeled data to improve OOD detection.
problem Lack of clean OOD samples makes OOD detection challenging.
method SAL framework separates candidate outliers and trains an OOD classifier.
result SAL achieves state-of-the-art performance on benchmarks.
Current approaches for Knowledge Distillation (KD) either directly use training data or sample from the training data distribution. In this paper, we demonstrate effectiveness of 'mismatched' unlabeled stimulus to perform KD for image classification networks. For illustration, we consider scenarios where this is a comp…
Unlabeled data improves adversarial robustness in machine learning.
problem Improving robustness of machine learning models against adversarial attacks.
method Semisupervised learning with self-training using unlabeled data.
result Semisupervised learning with unlabeled data significantly improves adversarial robustness.
MixMatch combines unlabeled data with labeled data to improve semi-supervised learning.
problem Improving semi-supervised learning with limited labeled data.
method MixMatch uses MixUp to blend labeled and unlabeled data, guessing low-entropy labels for augmented examples.
result MixMatch achieves state-of-the-art results across various datasets and labeled data amounts.
A new method improves graph-based learning for high-dimensional data.
problem Inconsistent high-dimensional learning efficiency of semi-supervised graph regularization.
method Introducing a novel regularization approach involving centering operation.
result Empirical results show improved performance over spectral clustering.
FLowDUP trains personalized models with unlabeled clients in low dimensions.
problem Training personalized models on clients with only unlabeled data.
method FLowDUP uses a forward pass with unlabeled data and a transductive PAC-Bayesian bound to generate personalized models in a low-dimensional subspace.
result FLowDUP enables efficient communication and computation with personalized models generated from unlabeled data.
We consider a problem of learning a binary classifier only from positive data and unlabeled data (PU learning) and estimating the class-prior in unlabeled data under the case-control scenario. Most of the recent methods of PU learning require an estimate of the class-prior probability in unlabeled data, and it is estim…
We consider the problem of estimating the class prior in an unlabeled dataset. Under the assumption that an additional labeled dataset is available, the class prior can be estimated by fitting a mixture of class-wise data distributions to the unlabeled data distribution. However, in practice, such an additional labeled…
Medix uses the median to detect outliers from unlabeled data for robust OOD detection.
problem Challenges in using unlabeled data for OOD detection due to mixed InD and OOD samples.
method Introduces Medix, a framework using the median operation to identify outliers from unlabeled data.
result Empirical results show Medix outperforms existing methods in open-world settings.
Framework enables robots to learn tasks from unlabeled human instructions.
problem Robotic task learning with unlabeled human instructions.
method TICS architecture combining reward function, human feedback, and unlabeled instructions.
result Framework accelerates task-learning and reduces teaching signals.
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 framework for document classification using keywords and unlabeled data.
problem Classifying documents without labels but with relevant keywords.
method Theoretical framework for optimizing AUC and other metrics.
result Effective use of keywords and unlabeled data for classification.
The study explores using unlabeled data to improve survival time predictions.
problem Challenges in clinical follow-up studies due to drop-out and data collection issues.
method Investigates three approaches to incorporate unlabeled data in survival analysis.
result All approaches improve predictive performance over independent test data.
The success of deep neural networks (DNNs) is heavily dependent on the availability of labeled data. However, obtaining labeled data is a big challenge in many real-world problems. In such scenarios, a DNN model can leverage labeled and unlabeled data from a related domain, but it has to deal with the shift in data dis…
Proposes a model for semi-supervised learning using both labeled and unlabeled data.
problem Semi-supervised learning with limited labeled data.
method Semi-conditional normalizing flow model with conditional coupling layer.
result Model outperforms variational auto-encoders on MNIST dataset.
RoPAWS improves semi-supervised learning on uncurated data.
problem Efficiency of semi-supervised learning with real-world unlabeled data.
method Reinterprets PAWS as a generative classifier and calibrates predictions using densities of labeled and unlabeled data.
result Significant improvement in performance for uncurated data.
Method trains multi-modal policy from unlabeled mixed demonstrations.
problem Training policies from unlabeled mixed demonstrations.
method Variational autoencoder with categorical latent variable to discover latent factors of variation.
result Policy can reproduce specific behaviors by conditioning on categorical vectors.
A common approach in positive-unlabeled learning is to train a classification model between labeled and unlabeled data. This strategy is in fact known to give an optimal classifier under mild conditions; however, it results in biased empirical estimates of the classifier performance. In this work, we show that the typi…
FedAUX improves Federated Learning by better using unlabeled data.
problem Improving Federated Learning performance with unlabeled data.
method FedAUX modifies FD training by unsupervised pre-training and private certainty scoring.
result FedAUX outperforms state-of-the-art Federated Learning methods.
A new method for PU learning improves classification error on CIFAR-10.
problem Learning from positive and unlabeled data in practical applications.
method A simple yet effective data augmentation method based on consistency regularization.
result Achieves an averaged improvement of 3.40 points in classification error on CIFAR-10.
RealMix improves SSL performance with real-world data challenges.
problem Poor SSL performance when labeled and unlabeled data distributions differ.
method Develops RealMix, a new SSL algorithm.
result Achieves state-of-the-art results on standard benchmark datasets.
Consider a classification problem where we have both labeled and unlabeled data available. We show that for linear classifiers defined by convex margin-based surrogate losses that are decreasing, it is impossible to construct any semi-supervised approach that is able to guarantee an improvement over the supervised clas…
Deep k-means learns clustering and features from unlabeled data.
problem Clustering and feature learning from unlabeled data.
method Gradient-estimator for non-differentiable k-means objective via Gumbel-Softmax reparameterisation.
result Concrete k-means model optimised for canonical k-means objective, end-to-end trainable.
We consider the problem of learning a binary classifier from a training set of positive and unlabeled examples, both in the inductive and in the transductive setting. This problem, often referred to as \emph{PU learning}, differs from the standard supervised classification problem by the lack of negative examples in th…