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,657 papers · 148 categories

Trend · papers per month

106212317423 · Jun 202019922001200920172026
48 results for semi-supervised classification

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.

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 ↗

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.

LC-GNN improves GNNs for node classification by incorporating label consistency.

problem Limited performance of GNNs due to label consistency assumption not always holding.
method LC-GNN uses node pairs with the same label but unconnected to expand GNN's receptive field.
result LC-GNN outperforms traditional GNNs in semi-supervised node classification.

Graph semi-supervised learning classifies points on manifold using variational autoencoders and GNN.

problem Classifying points on low-dimensional manifolds using limited labeled data.
method Model data as points on a manifold, approximate manifold with VAE, construct geometric graph, solve semi-supervised node classification with GNN.
result Generalization gap diminishes with graph size and training procedure, vanishing asymptotically.

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.

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.

Unified model combines feature and label propagation for semi-supervised classification.

problem Combining feature and label propagation for effective semi-supervised classification.
method Unified Message Passing Model (UniMP) using Graph Transformer and masked label prediction.
result Obtains new state-of-the-art results in Open Graph Benchmark (OGB).

Deep semi-supervised learning identifies tree species from natural images.

problem Identifying tree species in natural settings with limited labeled data.
method Two-fold approach using deep semi-supervised learning.
result Achieves 94.04% top-5 accuracy for leaves and 83.04% for bark.

New framework combines semi-supervised data programming with subset selection for improved text classification.

problem Sub-optimal performance in data programming with noisy labelling functions.
method Introduces a framework \model for semi-supervised data programming that uses joint models and subset selection.
result Significantly outperforms state-of-the-art on seven datasets.

JRFs improve semi-supervised learning by balancing generation and classification.

problem Mode missing and mode covering issues in GANs and VAEs, and conflict between good classification and generation.
method Joint-stochastic-approximation random fields (JRFs) for deep undirected generative models.
result JRFs achieve good classification and generation results in SSL.

A new model improves semi-supervised learning for unstructured data.

problem Manual labeling of unstructured data is expensive, time-consuming, and prone to errors.
method Batch Semi-Supervised Self-Organizing Map (Batch SS-SOM) integrating deep learning techniques.
result Batch SS-SOM performs well in semi-supervised classification and clustering, even with few labeled samples.

Paper proposes semi-supervised learning using change points for sequence classification.

problem Limited labeled data for sequential sensor data classification.
method Change point detection for identifying class changes, semi-supervised learning with labeled and unlabeled data.
result Improved classification performance on human activity recognition datasets.

Framework fine-tunes foundation models with semi-supervised learning for downstream tasks and latent spaces.

problem Training foundation models with limited labelled data.
method Mutual information decomposition for downstream and latent spaces, semi-supervised fine-tuning.
result Significant improvements in classification tasks under low-labelled conditions.

Semi-supervised learning improves classification in high dimensions.

problem Combining labeled and unlabeled data for high-dimensional classification.
method Information theoretic and computational lower bounds analysis for feature selection.
result Semi-supervised learning is advantageous for classification in high dimensions.

We present graph partition neural networks (GPNN), an extension of graph neural networks (GNNs) able to handle extremely large graphs. GPNNs alternate between locally propagating information between nodes in small subgraphs and globally propagating information between the subgraphs. To efficiently partition graphs, we …

2018-03-16abs ↗pdf ↗

A new method for semi-supervised learning with missing data using GMM and margin confidence.

problem Handling missing data in semi-supervised learning with classification uncertainty.
method Explicitly models missingness mechanism, uses margin confidence and Aranda Ordaz function, develops ECM algorithm.
result Effective reduction of bias and robustness in semi-supervised learning with substantial missing labels.

To explore underlying complementary information from multiple views, in this paper, we propose a novel Latent Multi-view Semi-Supervised Classification (LMSSC) method. Unlike most existing multi-view semi-supervised classification methods that learn the graph using original features, our method seeks an underlying late…

2019-09-09abs ↗pdf ↗

EXoN creates an explainable latent space for semi-supervised learning.

problem Creating an explainable latent space for semi-supervised learning.
method EXoN combines VAE with SCI (Soft-label Consistency Interpolation) to create an explainable latent space.
result EXoN reduces the cost of investigating representation patterns on the latent space.

A new SSL method improves medical image classification using global latent mixing.

problem Costly annotation of large-scale medical image data sets.
method Linear mixing of labeled and unlabeled data in both input and latent space.
result Improved performance in semi-supervised classification of thoracic disease and skin lesion.

In this work, we address semi-supervised classification of graph data, where the categories of those unlabeled nodes are inferred from labeled nodes as well as graph structures. Recent works often solve this problem via advanced graph convolution in a conventionally supervised manner, but the performance could degrade …

2020-01-17abs ↗pdf ↗

EPFGNN models graph connections for better node classification.

problem Graph node classification issues due to feature aggregation.
method EPFGNN models graph as a Markov Random Field with explicit pairwise factors and a GNN backbone.
result EPFGNN improves semi-supervised node classification performance.

Proposes a probabilistic approach to semi-supervised learning using normalizing flows.

problem Leveraging unlabelled data for semi-supervised learning with limited labelled data.
method Uses a normalizing flow to learn the posterior distribution over predictions for labelled data, serving as a prior for unlabelled data.
result Demonstrates improved performance on various tasks with varying output complexity.

Multi-class classification methods based on both labeled and unlabeled functional data sets are discussed. We present a semi-supervised logistic model for classification in the context of functional data analysis. Unknown parameters in our proposed model are estimated by regularization with the help of EM algorithm. A …

2011-02-22abs ↗pdf ↗

For semi-supervised techniques to be applied safely in practice we at least want methods to outperform their supervised counterparts. We study this question for classification using the well-known quadratic surrogate loss function. Using a projection of the supervised estimate onto a set of constraints imposed by the u…

2016-02-25abs ↗pdf ↗

A new classifier uses Fermat distance for semi-supervised learning in high dimensions.

problem Semi-supervised classification with limited labeled data in high-dimensional settings.
method Proposes weighted k-NN and MDS classifiers using Fermat distance.
result The weighted k-NN classifier is minimax optimal and outperforms other methods.

Automates galaxy morphology classification with less human labelling.

problem Insufficient human-labeled galaxy images for accurate classification.
method Developed a VAE with equivariant transformer layers and a classifier network.
result Improves accuracy with fewer labels and unlabelled data.

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.

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 ↗

Proposes BGCN-NRWS for semi-supervised node classification with reduced overfitting.

problem Uncertainty in graph structure for semi-supervised node classification.
method Bayesian Graph Convolutional Network using Neighborhood Random Walk Sampling (BGCN-NRWS) with MCMC graph sampling and variational inference.
result Consistently competitive classification results compared to state-of-the-art.

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 ↗

Algorithm improves binary classification of biased grouped data.

problem Improving binary classification for biased, grouped data.
method Assumes partition-projected class-conditional invariance across groups and derives a semi-supervised algorithm to learn a group-aware classifier.
result Demonstrates improved area under the ROC curve compared to baselines.