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

3867731,1591,545 · Jun 202019922001200920172026
48 results for open-set semi-supervised learning

ProSub uses angles in feature space to classify data as in- or out-of-distribution.

problem Open-set semi-supervised learning with unknown classes.
method Probabilistic approach based on angles in feature space, estimating conditional distributions of scores.
result ProSub achieves state-of-the-art performance on benchmark problems.

Despite significant progress in object categorization, in recent years, a number of important challenges remain, mainly, ability to learn from limited labeled data and ability to recognize object classes within large, potentially open, set of labels. Zero-shot learning is one way of addressing these challenges, but it …

2016-04-24abs ↗pdf ↗

S2OSC improves OSC by filtering and re-training models with out-of-class instances.

problem Difficulty in classifying out-of-class instances during inference.
method S2OSC combines semi-supervised learning, out-of-class instance filtering, and model re-training.
result S2OSC achieves state-of-the-art performance in various OSC tasks.

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.

Integrates multiple datasets to solve open set crowdsourcing problems.

problem Crowdsourcing with unknown label space and unfamiliar tasks.
method Integrates multiple crowdsourced datasets, weights them based on category correlation, and uses open set transfer learning.
result Proves OSCrowd solves open set crowdsourcing problems and outperforms related solutions.

The aim of unsupervised domain adaptation is to leverage the knowledge in a labeled (source) domain to improve a model's learning performance with an unlabeled (target) domain -- the basic strategy being to mitigate the effects of discrepancies between the two distributions. Most existing algorithms can only handle uns…

2019-07-19abs ↗pdf ↗

CGDL improves open set recognition by learning conditional Gaussian distributions.

problem Handling unknown samples in real-world recognition tasks.
method Conditional Gaussian Distribution Learning (CGDL) with probabilistic ladder architecture.
result CGDL significantly outperforms baseline methods on standard image datasets.

In open set learning, a model must be able to generalize to novel classes when it encounters a sample that does not belong to any of the classes it has seen before. Open set learning poses a realistic learning scenario that is receiving growing attention. Existing studies on open set learning mainly focused on detectin…

2018-09-20abs ↗pdf ↗

A new method trains deep neural networks for open set domain adaptation without negative open set difference.

problem Training deep neural networks for open set domain adaptation without negative open set difference.
method Proposes a new upper bound of target-domain risk, including source-domain risk, ε-open set difference (ΔεΔ_ε), distributional discrepancy, and constant. Uses gradient descent for source-domain risk and ΔεΔ_ε, and adversarial training for distributional discrepancy. Trains DNNs via minimizing the new upper bound.
result Shows state-of-the-art performance on benchmark datasets.

Machine-learned diagnosis models have shown promise as medical aides but are trained under a closed-set assumption, i.e. that models will only encounter conditions on which they have been trained. However, it is practically infeasible to obtain sufficient training data for every human condition, and once deployed such …

2019-10-07abs ↗pdf ↗

This work bridges continual learning, active learning, and open set recognition in deep neural networks.

problem Protecting previously acquired representations from catastrophic forgetting in deep neural networks.
method Surveying the literature and proposing a consolidated view to integrate open set recognition and active learning principles.
result Joint improvement in alleviating catastrophic forgetting, querying data, selecting task orders, and robust open world application.

New method for estimating class proportions in open-set label shift data.

problem Estimating class proportions and distributions when test data includes novel classes.
method Semiparametric density ratio model framework with maximum empirical likelihood estimators and confidence intervals.
result Improved estimation accuracy and classification performance compared to existing methods.

This paper proposes a method to use deep neural networks as end-to-end open-set classifiers. It is based on intra-class data splitting. In open-set recognition, only samples from a limited number of known classes are available for training. During inference, an open-set classifier must reject samples from unknown class…

2019-03-12abs ↗pdf ↗

Proposes a framework for semi-supervised continual learning from sequentially arriving data.

problem Learning from data with changing task distribution over time, especially in domains with a mix of labeled and unlabeled data.
method Meta-Consolidation for Continual Semi-Supervised Learning (MCSSL) framework with a hypernetwork and semi-supervised auxiliary classifier.
result Significant improvements in continual semi-supervised learning setting.

New approach combines semi-supervised learning and bandits for better predictions.

problem Online semi-supervised learning with bandit feedback for applications like clinical trials and ad recommendations.
method Adjusted Graph Convolutional Network (GCN) for contextual bandits, with semi-supervised missing rewards imputation.
result Developed multi-GCN embedded contextual bandit algorithms verified on real-world datasets.

Proposes a new framework for open set recognition using conditional probabilistic generative models.

problem Unknown samples can mislead traditional deep neural networks during testing.
method Conditional Probabilistic Generative Models (CPGM) that combine generative models with discriminative information.
result Significantly outperforms baselines on multiple benchmark datasets.

Camera model identification refers to the problem of linking a picture to the camera model used to shoot it. As this might be an enabling factor in different forensic applications to single out possible suspects (e.g., detecting the author of child abuse or terrorist propaganda material), many accurate camera model att…

2019-04-11abs ↗pdf ↗

Study compares semi-supervised learning methods for anomaly detection in hydraulic systems.

problem Challenges in anomaly detection for hydraulic systems due to scarce labeled data.
method Compared various semi-supervised learning methods including traditional models and deep neural networks.
result Customized extreme learning machine (HELM) model achieved state-of-the-art performance.

Study investigates one-shot semi-supervised learning for image classification.

problem Training deep networks requires many labeled samples, limiting adoption.
method Empirical investigation of FixMatch method for one-shot semi-supervised learning.
result Uneven class accuracy is a barrier to high performance in one-shot semi-supervised learning.

New bounds on inscribed triangles in arbitrary planar domains.

problem Finding inscribed triangles in arbitrary planar domains with specific angle constraints.
method Proving the existence of uniformly fat triangles and not-too-fat triangles in bounded open sets.
result Existence of a maximal number Θ (between 0 and 60) for inscribed triangles with angles ≥ Θ degrees.

ModSSC unifies semi-supervised classification for various data types.

problem Fragmented support for semi-supervised classification across different methods, settings, and data types.
method ModSSC is a modular Python framework that supports reproducible and controlled experimentation for semi-supervised classification on heterogeneous data.
result ModSSC enables systematic comparison of semi-supervised learning across various datasets and model backbones.

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 ↗

FROST speeds up and stabilizes one-shot semi-supervised learning.

problem Slow training and sensitivity to labeled data choices in semi-supervised learning.
method Combines semi-supervised learning with a one-stage, single network self-training approach.
result FROST trains up to 10x faster and is more robust to labeled data choices.

Poisson learning improves graph-based semi-supervised learning at very low label rates.

problem Degeneracy of Laplacian semi-supervised learning at low label rates.
method Replaces label assignment with source and sink placement, solving Poisson equation.
result Provably more stable and informative predictions than Laplacian learning.

Study shows semi-supervised learning can be more robust with fewer labeled examples.

problem Learning robust predictors in semi-supervised PAC model with minimal labeled data.
method Characterizes the minimal labeled and unlabeled data required for robust learning.
result Proves nearly matching upper and lower bounds on labeled sample complexity.

In real-world recognition/classification tasks, limited by various objective factors, it is usually difficult to collect training samples to exhaust all classes when training a recognizer or classifier. A more realistic scenario is open set recognition (OSR), where incomplete knowledge of the world exists at training t…

2018-11-21abs ↗pdf ↗

Develops a framework for fair semi-supervised learning.

problem Balancing fairness and accuracy in semi-supervised learning.
method Formulates a framework as an optimization problem, incorporating classifier loss, label propagation loss, and fairness constraints.
result Achieves fair semi-supervised learning with better accuracy-fairness trade-off than fair supervised learning.

The study calculates the risk of semi-supervised multitask learning on Gaussian mixtures.

problem Understanding the risk in semi-supervised multitask learning on Gaussian mixtures.
method Statistical physics methods applied to Gaussian mixture models.
result The study evaluates the performance gain of learning tasks together versus separately.

Optimal and safe semi-supervised learning estimator for high-dimensional data.

problem Improving regression parameter estimation with unlabeled data in high-dimensional settings.
method Established minimax lower bound, proposed optimal and safe semi-supervised estimators.
result Optimal semi-supervised estimator achieves the minimax lower bound.

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.