Unlabeled sensing is a linear inverse problem where the measurements are scrambled under an unknown permutation leading to loss of correspondence between the measurements and the rows of the sensing matrix. Motivated by practical tasks such as mobile sensor networks, target tracking and the pose and correspondence esti…
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
48 results for “Unlabeled Sensing”
The paper improves conditions for unique recovery in homomorphic sensing of subspaces.
problem Unique recovery of points in a linear subspace from their images under linear maps.
method Tighter and simpler conditions for unique recovery in single and subspace arrangement cases, extending to noise stability.
result Conditions for unique recovery in homomorphic sensing are improved and unified.
UPCA solves data matrix completion with permuted columns.
problem Data matrix completion with permuted columns.
method Algebraic geometry and two-stage algorithm.
result UPCA recovers the ground-truth matrix from corrupted data.
A deep latent variable model for semi-supervised multi-unit soft sensing in industrial processesstat.ML
Deep model learns from labeled and unlabeled data for industrial soft sensing.
problem Lack of data limits soft sensor development in industrial processes.
method Hierarchical, generative deep latent variable model for semi-supervised multi-unit soft sensing.
result Model outperforms current methods for soft sensing in industrial processes.
We describe our language-independent unsupervised word sense induction system. This system only uses topic features to cluster different word senses in their global context topic space. Using unlabeled data, this system trains a latent Dirichlet allocation (LDA) topic model then uses it to infer the topics distribution…
In this paper, we study the recovery of a signal from a set of noisy linear projections (measurements), when such projections are unlabeled, that is, the correspondence between the measurements and the set of projection vectors (i.e., the rows of the measurement matrix) is not known a priori. We consider a special case…
Algorithm recovers multiple low-rank matrices from unlabeled data.
problem Learning mixtures of low-rank models from unlabelled data.
method Three-stage meta-algorithm that copes with non-convexity and noise.
result Near-optimal sample and computational complexities under Gaussian designs.
Spanning attack improves black-box attacks with unlabeled data.
problem Query inefficiency in black-box attacks due to high input space dimensionality.
method Proposes spanning attack by constraining adversarial perturbations in a low-dimensional subspace via an auxiliary unlabeled dataset.
result Significantly improves query efficiency of black-box attacks.
Framework uses unlabeled out-of-domain data to improve semi-supervised classification.
problem Improving generalization in semi-supervised classification problems.
method Combines Distributionally Robust Optimization (DRO) with self-supervised training.
result Significant improvement in generalization error compared to ERM.
Active learning selects most informative unlabeled samples for labeling.
problem Efficiently label unlabeled data in applications with scarce labeled data.
method Formulated as open-set recognition, uses VNNs to identify uncertain samples.
result Achieved state-of-the-art results on MNIST, CIFAR-10, and CIFAR-100.
Active learning aims to train a classifier as fast as possible with as few labels as possible. The core element in virtually any active learning strategy is the criterion that measures the usefulness of the unlabeled data based on which new points to be labeled are picked. We propose a novel approach which we refer to …
One of the major problems in natural language processing (NLP) is the word sense disambiguation (WSD) problem. It is the task of computationally identifying the right sense of a polysemous word based on its context. Resolving the WSD problem boosts the accuracy of many NLP focused algorithms such as text classification…
We propose a sparse-coding framework for activity recognition in ubiquitous and mobile computing that alleviates two fundamental problems of current supervised learning approaches. (i) It automatically derives a compact, sparse and meaningful feature representation of sensor data that does not rely on prior expert know…
Proper learning is possible with labeled data, but unlabeled data can improve performance.
problem Problems that can only be learned improperly, like multiclass classification.
method Distributional regularization and worst-case performance evaluation.
result Proper learnability is possible under certain conditions involving unlabeled data.
Deep learning usually requires big data, with respect to both volume and variety. However, most remote sensing applications only have limited training data, of which a small subset is labeled. Herein, we review three state-of-the-art approaches in deep learning to combat this challenge. The first topic is transfer lear…
In this paper, we present our method of using fixed-size ordinally forgetting encoding (FOFE) to solve the word sense disambiguation (WSD) problem. FOFE enables us to encode variable-length sequence of words into a theoretically unique fixed-size representation that can be fed into a feed forward neural network (FFNN),…
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.
Improves anomaly detection with contaminated unlabeled data.
problem Weakness in existing semi-supervised anomaly detection methods when unlabeled data contain anomalies.
method Integrates positive-unlabeled learning with deep anomaly detection models.
result Achieves better detection performance on various datasets.
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.
On Leveraging Unlabeled Data for Concurrent Positive-Unlabeled Classification and Robust Generationcs.LG
Paper tackles leveraging unlabeled data for PU classification and robust generation.
problem Scarcity of labeled data in machine learning problems.
method Introduces a novel training framework that simultaneously targets PU classification and conditional generation using extra unlabeled data.
result Proves the effectiveness of a Classifier-Noise-Invariant Conditional GAN (CNI-CGAN) that enhances PU classifier performance and leverages extra data.
In "Unlabeled Sensing", one observes a set of linear measurements of an underlying signal with incomplete or missing information about their ordering, which can be modeled in terms of an unknown permutation. Previous work on the case of a single noisy measurement vector has exposed two main challenges: 1) a high requir…
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.
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.
The article explains how to estimate confusion matrices for classifiers using unlabeled data.
problem Estimating sensitivity and specificity of binary medical diagnostic tests without gold standard tests.
method Modifying diagnostic test solutions to estimate confusion matrices for classifiers on unlabeled data.
result The approach can be used to estimate accuracy statistics for supervised or unsupervised binary classifiers on unlabeled data.
Can I Trust My Fairness Metric? Assessing Fairness with Unlabeled Data and Bayesian Inferencestat.ML
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.
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.
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.
Paper proposes a new approach to stabilize GAN training by treating generated data as unlabeled.
problem Traditional GAN training treats generated data as negative, ignoring their potential quality.
method Defines positive and unlabeled classification for GANs, treating generated data as unlabeled.
result PUGAN achieves comparable or better performance than sophisticated discriminator stabilization methods.
New method uses unlabelled data to improve Bayesian Neural Networks.
problem Lack of ability to use unlabelled data in conventional Bayesian Neural Networks.
method Self-supervised Bayesian Neural Networks using contrastive pretraining and variational lower bound optimization.
result Prior predictive distributions capture problem semantics better and improve predictive performance.
Generalization Bounds for Learning with Linear, Polygonal, Quadratic and Conic Side Knowledgestat.ML
In this paper, we consider a supervised learning setting where side knowledge is provided about the labels of unlabeled examples. The side knowledge has the effect of reducing the hypothesis space, leading to tighter generalization bounds, and thus possibly better generalization. We consider several types of side knowl…
New research shows unlabeled data is equally valuable as labeled data in certain semi-supervised learning scenarios.
problem Improving learning performance with limited labeled data.
method Statistical models with continuous parameters, showing equal utility of unlabeled data under specific conditions.
result The learning rate of semi-supervised learning scales similarly to supervised learning when unlabeled data is abundant.
Surveying how to use unlabeled data in federated learning.
problem Costly labeling of data limits FL applications.
method Survey and analyze existing research.
result Potential for using unlabeled data in FL.
Comparing the Value of Labeled and Unlabeled Data in Method-of-Moments Latent Variable Estimationcs.LG
New framework assesses value of labeled vs unlabeled data in latent variable models.
problem Determining the optimal use of labeled and unlabeled data in latent variable models.
method Developed a bias-variance decomposition of the generalization error for method-of-moments latent variable estimation, and introduced a correction for misspecification.
result Labeled data is more valuable than unlabeled data when models are misspecified, but this value can be reduced with correction.
Research improves open-set learning by leveraging unlabelled data.
problem Learning between observed and unobserved novel categories.
method Unified policy of positive and unlabelled learning, semi-supervised learning, and open-set recognition.
result Achieves state-of-the-art results in open-set learning.
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.
Toward Deep Supervised Anomaly Detection: Reinforcement Learning from Partially Labeled Anomaly Datacs.LG
Deep RL detects anomalies from few labeled examples and large unlabeled data.
problem Anomaly detection with limited labeled data and large unlabeled data.
method Deep reinforcement learning to optimize detection of labeled and unlabeled anomalies.
result Significantly outperforms state-of-the-art methods on 48 real-world datasets.
More unlabelled data or label more data? A study on semi-supervised laparoscopic image segmentationeess.IV
Improving a semi-supervised image segmentation task has the option of adding more unlabelled images, labelling the unlabelled images or combining both, as neither image acquisition nor expert labelling can be considered trivial in most clinical applications. With a laparoscopic liver image segmentation application, we …
LoD improves model safety by integrating unlabeled wild data, reducing OOD misclassification.
problem Improving model safety and reliability using unlabeled wild data containing both in-distribution and out-of-distribution samples.
method Intentionally label-noisifying unlabeled wild data to enable joint learning of labeled ID and OOD data, distinguishing losses between ID and OOD samples.
result LoD framework achieves superior OOD detection without requiring thresholds, improving model safety.
The paper proposes a SSL framework for complex causal models using unlabelled data.
problem Understanding how unlabelled data can improve SSL in complex causal models.
method The paper explores flexible causal graph structures and designs causal generative models to generate synthetic labelled data.
result The proposed method effectively improves predictive model accuracy using synthetic labelled data generated from unlabelled data.
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…
We quantify the separation between the numbers of labeled examples required to learn in two settings: Settings with and without the knowledge of the distribution of the unlabeled data. More specifically, we prove a separation by multiplicative factor for the class of projections over the Boolean hypercube o…
Unlabeled Data Help in Graph-Based Semi-Supervised Learning: A Bayesian Nonparametrics Perspectivemath.ST
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.
ORDisCo learns from unlabeled data to improve semi-supervised continual learning.
problem Lack of effective use of unlabeled data in semi-supervised continual learning.
method Deep Online Replay with Discriminator Consistency (ORDisCo) that continually passes the learned data distribution to a classifier and selectively stabilizes discriminator parameters.
result Significant performance improvement on various semi-supervised learning benchmark datasets.
TAP transfers knowledge from unlabeled data to improve cross-modal learning.
problem Improving supervised learning performance using unlabeled data from a different modality.
method Probabilistic approach for missing information estimation, kernel regression, cross-attention module, TAP neural network.
result TAP significantly improves generalization across different domains and neural network architectures.
Paper tackles survival data analysis with positive and unlabeled observations.
problem Traditional survival analysis yields biased results with positive-unlabeled data.
method Developed parametric, nonparametric, and machine learning models for positive and unlabeled survival data.
result Proposed estimation method provides valid results for positive-unlabeled survival 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.
Boosting with unlabeled data achieves optimal sample complexity in agnostic settings.
problem Boosting's sample inefficiency in agnostic learning.
method Designing an agnostic boosting algorithm with unlabeled data to match ERM's sample complexity.
result The total sample complexity is optimal, with a vanishing fraction needing to be labeled.
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.