Active graph-based semi-supervised learning (AG-SSL) aims to select a small set of labeled examples and utilize their graph-based relation to other unlabeled examples to aid in machine learning tasks. It is also closely related to the sampling theory in graph signal processing. In this paper, we revisit the original fo…
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 “Graph-based SSL”
End-to-end graph-based SSL learns all graph factors dynamically.
problem Learning quality of graph in SSL is crucial but difficult.
method Proposes an end-to-end approach to optimize all graph factors.
result Demonstrates effectiveness on benchmark datasets.
AUC-spec optimizes graph-based SSL for complex label distributions.
problem Training accurate models with scarce labeled data and abundant unlabeled data.
method Computes a low-dimensional representation that maximizes class separation via AUC optimization.
result AUC-spec achieves competitive results on synthetic and real-world datasets.
Graph-based Bayesian SSL uses graph theory to propagate labels from a few to many unlabeled features.
problem Efficiently propagating labels from a small set of labeled data to a large set of unlabeled data.
method Probabilistic framework using graph theory and Bayesian statistics.
result Mathematical foundations for improving the accuracy and efficiency of label propagation.
Improves graph-based active learning for non-Gaussian models.
problem Efficiently selecting data points for labeling in graph-based semi-supervised learning.
method Approximates non-Gaussian distributions, introduces rank-one update and model change acquisition function.
result Enhanced active learning for graph-based SSL under non-Gaussian models.
Contrastive and Generative Graph Convolutional Networks for Graph-based Semi-Supervised Learningcs.LG
Paper proposes a novel GCN-based SSL algorithm to enhance node representations using contrastive and generative losses.
problem Shortage of supervision in graph-based semi-supervised learning.
method Combines contrastive and generative graph convolutional networks to enrich supervision signals.
result Improves node representations and classification results on various real-world datasets.
We focus on developing a novel scalable graph-based semi-supervised learning (SSL) method for a small number of labeled data and a large amount of unlabeled data. Due to the lack of labeled data and the availability of large-scale unlabeled data, existing SSL methods usually encounter either suboptimal performance beca…
Study evaluates graph-based semi-supervised learning under noisy label conditions.
problem Evaluation of semi-supervised learning algorithms under noisy label conditions.
method Compared graph-based semi-supervised algorithms under varying labeled data and label noise conditions.
result Laplacian Eigenmaps performed better than label propagation under noisy conditions.
While the harmonic function solution performs well in many semi-supervised learning (SSL) tasks, it is known to scale poorly with the number of samples. Recent successful and scalable methods, such as the eigenfunction method focus on efficiently approximating the whole spectrum of the graph Laplacian constructed from …
In this paper, we proposed a general framework for data poisoning attacks to graph-based semi-supervised learning (G-SSL). In this framework, we first unify different tasks, goals, and constraints into a single formula for data poisoning attack in G-SSL, then we propose two specialized algorithms to efficiently solve t…
We present a graph-based semi-supervised learning (SSL) method for learning edge flows defined on a graph. Specifically, given flow measurements on a subset of edges, we want to predict the flows on the remaining edges. To this end, we develop a computational framework that imposes certain constraints on the overall fl…
Semi-supervised learning (SSL) is effectively used for numerous classification problems, thanks to its ability to make use of abundant unlabeled data. The main assumption of various SSL algorithms is that the nearby points on the data manifold are likely to share a label. Graph-based SSL constructs a graph from point-c…
In many real-world network datasets such as co-authorship, co-citation, email communication, etc., relationships are complex and go beyond pairwise. Hypergraphs provide a flexible and natural modeling tool to model such complex relationships. The obvious existence of such complex relationships in many real-world networ…
Predicting properties of nodes in a graph is an important problem with applications in a variety of domains. Graph-based Semi-Supervised Learning (SSL) methods aim to address this problem by labeling a small subset of the nodes as seeds and then utilizing the graph structure to predict label scores for the rest of the …
Many interactive image segmentation techniques are based on semi-supervised learning. The user may label some pixels from each object and the SSL algorithm will propagate the labels from the labeled to the unlabeled pixels, finding object boundaries. This paper proposes a new SSL graph-based interactive image segmentat…
TGCN learns from multi-relational graphs, improving SSL performance.
problem Scalable semi-supervised learning from multi-relational data.
method Tensor-graph convolutional network with dynamic weights and graph-based regularizers.
result Significantly improved SSL performance over standard GCNs.
CGM combines SSL and LFM for better recommendation performance.
problem Label sparsity in user-item rating matrices limits LFM performance.
method Probabilistic chain graph model (CGM) integrating Bayesian network and Markov random field.
result CGM significantly outperforms state-of-the-art approaches in recommendation.
Graph construction is a crucial step in spectral clustering (SC) and graph-based semi-supervised learning (SSL). Spectral methods applied on standard graphs such as full-RBF, -graphs and -NN graphs can lead to poor performance in the presence of proximal and unbalanced data. This is because spectral methods based…
A graph-based sampling and consensus (GraphSAC) approach is introduced to effectively detect anomalous nodes in large-scale graphs. Existing approaches rely on connectivity and attributes of all nodes to assign an anomaly score per node. However, nodal attributes and network links might be compromised by adversaries, r…
Semi-supervised learning objectives as log-likelihoods in a generative model of data curationstat.ML
We explain SSL objectives as log-likelihoods in a data curation model.
problem Lack of understanding of SSL objectives as log-likelihoods.
method Formulate SSL objectives as a log-likelihood in a generative model of data curation.
result SSL methods can be understood as lower-bounds on a principled log-likelihood.
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.
A new machine learning methodology, called successive subspace learning (SSL), is introduced in this work. SSL contains four key ingredients: 1) successive near-to-far neighborhood expansion; 2) unsupervised dimension reduction via subspace approximation; 3) supervised dimension reduction via label-assisted regression …
Semi-supervised learning benefits the rich more than the poor, affecting fairness.
problem Disparate impact of semi-supervised learning on different sub-populations.
method Theoretical and empirical analysis of a broad family of SSL algorithms using pseudo-labels.
result Semi-supervised learning benefits the rich more than the poor, potentially violating fairness.
Researchers propose a new SSL risk decomposition method to evaluate and improve self-supervised learning models.
problem Self-supervised learning evaluation is limited to a single metric, providing little insight into model performance and improvement.
method Proposes an SSL risk decomposition that considers four error components: approximation, representation usability, probe generalization, and encoder generalization.
result Analysis of 169 SSL vision models reveals the main sources of error and provides insights for improving SSL models in specific settings.
New theory explains how self-supervised learning converges, advancing AI research.
problem Lack of precise theoretical explanation for self-supervised learning convergence.
method Synthesized Identifiability Theory with empirical evidence to propose Singular Identifiability Theory (SITh).
result SITh provides deeper insights into SSL's implicit data assumptions and advances representation learning.
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.
Maximizes image representation dependence for self-supervised learning.
problem Learning meaningful image representations from unlabeled data.
method Maximizes Hilbert-Schmidt Independence Criterion (HSIC) between image transformations and identity.
result Matches state-of-the-art performance on ImageNet and other vision tasks.
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.
DoubleMatch combines pseudo-labeling with self-supervision for SSL.
problem Lack of effective use of unlabeled data in SSL.
method Combines pseudo-labeling with self-supervised loss.
result Achieves state-of-the-art accuracies on multiple datasets.
Semi-supervised learning debiased for better performance.
problem Bias in SSL methods impairs theoretical guarantees and empirical performance.
method Simple debiasing approach to remove risk estimate bias.
result Debiased SSL methods provide better calibrated models.
Semi-supervised learning (SSL) provides a powerful framework for leveraging unlabeled data when labels are limited or expensive to obtain. SSL algorithms based on deep neural networks have recently proven successful on standard benchmark tasks. However, we argue that these benchmarks fail to address many issues that th…
A new framework decouples SSL tasks into VDA and VLC, revealing VDA's importance.
problem Designing effective self-supervised learning tasks without manual annotation.
method Borrowing a multi-view perspective, the paper decouples popular pretext tasks into VDA and VLC, focusing on VDA's role in feature learning.
result VDA tasks dominate SSL performance, and integrating predictions from augmented views improves overall performance.
Semi-Supervised Learning (SSL) algorithms have shown great potential in training regimes when access to labeled data is scarce but access to unlabeled data is plentiful. However, our experiments illustrate several shortcomings that prior SSL algorithms suffer from. In particular, poor performance when unlabeled and lab…
Solves biased pseudo-labels in imbalanced SSL by refining them.
problem Imbalanced class distributions in semi-supervised learning lead to biased pseudo-labels.
method Formulates a convex optimization problem to refine pseudo-labels and develops an efficient algorithm, DARP.
result Demonstrates the effectiveness of DARP in various imbalanced semi-supervised scenarios.
Semi-Supervised Learning (SSL) has achieved great success in overcoming the difficulties of labeling and making full use of unlabeled data. However, SSL has a limited assumption that the numbers of samples in different classes are balanced, and many SSL algorithms show lower performance for the datasets with the imbala…
Flaky performance found in GNN SSL on RDBs, leading to worse linear evaluation.
problem Downstream task performances of GNN SSL on RDBs are poor.
method Proposed InfoNode to maximize mutual information between initial and final node representations.
result InfoNode improves GNN SSL performance on RDBs, supporting conjecture of conflict between SSL and GNN message passing.
This work defines idealized SSL representations and improves existing methods.
problem Unclear characteristics of SSL representations leading to high downstream accuracies.
method Characterized ideal properties and derived necessary and sufficient conditions.
result Improved SSL methods and derived new objectives for contrastive and non-contrastive learning.
MTSSL optimizes threshold τ for better semi-supervised learning performance.
problem Optimizing the threshold τ for effective semi-supervised learning.
method Meta-Thresholding approach to optimize τ during training.
result Optimal values of τ are not necessary for achieving similar performance.
MET learns tabular data representations without data augmentations.
problem Lack of effective self-supervised learning methods for tabular data.
method Reconstruction-based approach using masked encoding, with separate representations for each coordinate and adversarial reconstruction loss.
result MET achieves state-of-the-art performance on five diverse tabular datasets, improving up to 9% over current methods.
SSL theory improves representation learning from raw data.
problem Challenges in SSL, including instability and collapse.
method Precise analysis of generalization performance with a theory-friendly setup.
result Insights for SSL practitioners on data augmentation, network architecture, and training algorithm.
Computer vision SSL methods show effectiveness on time series data.
problem Evaluate if computer vision SSL frameworks are effective on time series data.
method Evaluated on UCR and UEA archives, proposed a new method improving VICReg.
result Computer vision SSL frameworks can be effective on time series data.
A new probabilistic model for semi-supervised learning unifies various methods.
problem Combining different aspects of data distribution for semi-supervised learning.
method A probabilistic model that interprets and improves upon existing SSL methods.
result The model unifies various SSL methods and extends to neuro-symbolic learning.
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.
This paper explores SSL for graph neural networks, improving performance on real-world datasets.
problem Leveraging unlabeled data for graph neural networks to improve deep learning performance.
method Empirical study of various SSL pretext tasks on graphs and proposing a new approach called SelfTask.
result Proposes SelfTask, achieving state-of-the-art performance on real-world datasets.
Spectral clustering (SC) and graph-based semi-supervised learning (SSL) algorithms are sensitive to how graphs are constructed from data. In particular if the data has proximal and unbalanced clusters these algorithms can lead to poor performance on well-known graphs such as -NN, full-RBF, -graphs. This is becaus…
The study analyzes consistency-based SSL methods and proposes a new framework.
problem Improving performance in semi-supervised learning with minimal labeled data.
method Analysis of consistency-based SSL methods, including the -model, and proposing a new framework.
result A simple extension of the Hidden Manifold Model that incorporates data-augmentation schemes.
From a machine learning perspective, the human ability localize sounds can be modeled as a non-parametric and non-linear regression problem between binaural spectral features of sound received at the ears (input) and their sound-source directions (output). The input features can be summarized in terms of the individual…
SSL framework identifies non-linear systems without labeled data.
problem System identification in non-linear environments without labeled data.
method Dynamics contrastive learning framework.
result SSL can identify non-linear dynamics in latent space.