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

3016019021,202 · Jun 202019922001200920172026
48 results for Semi-Supervised Methods

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.

Maximizing the area under the receiver operating characteristic curve (AUC) is a standard approach to imbalanced classification. So far, various supervised AUC optimization methods have been developed and they are also extended to semi-supervised scenarios to cope with small sample problems. However, existing semi-supe…

2017-05-04abs ↗pdf ↗

This paper compares unstructured and structured EM-based semi-supervised learning methods.

problem Semi-supervised learning with EM algorithm for structured prediction.
method Comparative study between unstructured and structured EM-based semi-supervised learning methods.
result Structured EM is more robust to class confusion in flood mapping datasets.

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.

A new method for semi-supervised learning of sparse features using elastic-net.

problem Semi-supervised learning of sparse features in generalized linear models.
method Generalized Semi-Supervised Elastic-Net (s2net) framework.
result The s2net framework improves upon supervised elastic-net methods for semi-supervised learning.

A new method improves semi-supervised learning by handling tasks with different attribute spaces.

problem Existing methods assume tasks share the same attribute space, limiting their applicability.
method Meta-learning approach that embeds labeled and unlabeled data in task-specific spaces using neural networks.
result Improves test performance on tasks with small labeled data using unlabeled and various task data.

Combines Xgboost and transductive SVM for semi-supervised learning.

problem Improving semi-supervised learning performance with heterogeneous tabular data.
method Proposes an optimization-based ensemble method to adaptively combine Xgboost and transductive SVM.
result Significantly improves classification accuracy over state-of-the-art methods.

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.

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.

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.

Proposes a graph learning framework for clustering and semi-supervised classification.

problem Graph-based clustering and semi-supervised classification techniques have shown impressive performance but lack explicit cluster structure.
method Uses self-expressiveness of samples for global structure and adaptive neighbor approach for local structure. Incorporates rank constraint to ensure optimal performance.
result The proposed method achieves better performance than state-of-the-art methods in clustering and semi-supervised classification.

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.

In the recent years, there is a growing interest in semi-supervised learning, since, in many learning tasks, there is a plentiful supply of unlabeled data, but insufficient labeled ones. Hence, Semi-Supervised learning models can benefit from both types of data to improve the obtained performance. Also, it is important…

2019-07-01abs ↗pdf ↗

In this paper, we introduce a package for semi-supervised learning research in the R programming language called RSSL. We cover the purpose of the package, the methods it includes and comment on their use and implementation. We then show, using several code examples, how the package can be used to replicate well-known …

2016-12-23abs ↗pdf ↗

Semi-supervised wrapper methods are concerned with building effective supervised classifiers from partially labeled data. Though previous works have succeeded in some fields, it is still difficult to apply semi-supervised wrapper methods to practice because the assumptions those methods rely on tend to be unrealistic i…

2016-11-12abs ↗pdf ↗

Proposes a new method to learn distance metrics for semi-supervised learning.

problem Inconsistency between perturbed input sets and lack of pairwise relationship information.
method Metric Learning by Similarity Network (MLSN) co-training with a classification network to learn distance metrics adaptively.
result Performs better than state-of-the-art methods on empirical tasks.

Semi-supervised learning is an important and active topic of research in pattern recognition. For classification using linear discriminant analysis specifically, several semi-supervised variants have been proposed. Using any one of these methods is not guaranteed to outperform the supervised classifier which does not t…

2014-11-17abs ↗pdf ↗

A framework combines unsupervised and semi-supervised AD using synthetic anomalies.

problem Improving anomaly detection in both unsupervised and semi-supervised settings.
method Proposes a new framework that uses both known and synthetic anomalies for training.
result Synthetic anomalies improve anomaly modeling in low-density regions and provide optimal convergence guarantees.

New particle-based method improves semi-supervised learning robustness to label noise.

problem Label noise degrades semi-supervised learning accuracy.
method Particle competition and cooperation algorithm for robust semi-supervised learning.
result Improved robustness to label noise compared to existing methods.

Proposes a new method to estimate individual treatment effects using unlabeled data.

problem Difficult estimation of individual treatment effects due to high costs of intervention studies.
method Combines causal inference matching and semi-supervised learning label propagation.
result Demonstrates successful mitigation of data scarcity in ITE estimation.

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.

We used the Ladder Network [Rasmus et al. (2015)] to perform Hyperspectral Image Classification in a semi-supervised setting. The Ladder Network distinguishes itself from other semi-supervised methods by jointly optimizing a supervised and unsupervised cost. In many settings this has proven to be more successful than o…

2018-12-04abs ↗pdf ↗

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.

Study how noisy labels affect semi-supervised learning.

problem Effect of noisy labels on semi-supervised learning performance.
method Proposed an algorithm derived from a continuous relaxation of the Maximum A Posteriori (MAP) estimator for a Degree Corrected Stochastic Block Model (DC-SBM).
result Our approach achieves promising performance even with very noisy labeled data.

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.

New method for semi-supervised learning in federated learning with and without labels at clients.

problem Training federated learning models with partially or completely unlabeled data.
method Federated Matching (FedMatch) with inter-client consistency loss and disjoint learning.
result FedMatch outperforms local semi-supervised learning and naive federated learning combinations.

Automates graph convolutional network design for semi-supervised node classification.

problem Designing optimal graph convolutional network architectures for semi-supervised node classification.
method An automatic process to define a problem-specific architecture based on graph structure.
result The proposed method outperforms existing methods in classification performance and network compactness.