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…
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 “semi-supervised optimization”
OTI extends OTP for inductive semi-supervised learning.
problem Inductive semi-supervised learning for out-of-sample data.
method Optimal transport-based approach extended to inductive tasks.
result OTI outperforms state-of-the-art methods in experiments.
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.
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.
GAN-based semi-supervised learning improves classifier generalization.
problem Improving classifier performance with limited labeled data.
method Theoretical analysis of GAN-SSL, proving equivalence of discriminator optimization and supervised learning, and exploring conditions for perfect discriminator.
result GAN-SSL theoretically outputs a perfect discriminator on both labeled and unlabeled data.
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.
Semi-supervised learning is pervasive in real-world applications, where only a few labeled data are available and large amounts of instances remain unlabeled. Since AUC is an important model evaluation metric in classification, directly optimizing AUC in semi-supervised learning scenario has drawn much attention in the…
New method reduces labeling costs in semi-supervised learning.
problem Efficiently label data with limited labeled samples.
method Formulates batch acquisition as bilevel optimization.
result Shows effectiveness in keyword detection tasks.
SILBO optimizes high-dimensional Bayesian optimization using semi-supervised embedding learning.
problem Bayesian optimization struggles with high-dimensional search spaces.
method SILBO uses semi-supervised dimension reduction to find a low-dimensional space for iterative optimization.
result SILBO outperforms existing methods on high-dimensional Bayesian optimization tasks.
Optimal transport semi-supervised learning improves GNSS multi-path detection.
problem GNSS multi-path interference detection.
method Wasserstein distance based semi-supervised manifold learning.
result Significant improvement in classification accuracy over fully supervised training.
Method uses semi-supervised learning to estimate optimal treatment regimes from medical records.
problem Estimating optimal treatment regimes from electronic medical records.
method Imputation-based semi-supervised method using unlabeled data.
result Proposed method yields more efficient estimators of optimal treatment regimes.
Semi-Supervised U-statisticsmath.ST
Enhances U-statistics for semi-supervised datasets using unlabeled data.
problem Efficiently utilizing unlabeled data in semi-supervised settings.
method Semi-supervised U-statistics enhanced by unlabeled data.
result Proposed method is asymptotically Normal and more efficient than classical U-statistics.
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.
A novel approach for semi-supervised learning using regularized optimal transport.
problem Improving model performance with unlabeled data.
method Regularized optimal transport between empirical measures for affinity matrix construction, incremental label propagation, and certainty score.
result Surpasses state-of-the-art results on 12 benchmark datasets.
Unified approach combines prediction-powered inference and variance reduction for semi-supervised optimization.
problem Scarcity of labeled data in semi-supervised optimization.
method PPI-SVRG, combining PPI and SVRG methods.
result Unified convergence bound with improved performance under label scarcity.
Optimizes graph neural networks using natural gradient descent.
problem Improving efficiency and performance of graph neural networks.
method Employing natural gradient descent to optimize graph neural networks.
result Natural gradient optimization leads to superior performance compared to existing methods.
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.
Automates MIPs solution with semi-supervised graph neural networks.
problem Solving recurrent Mixed-Integer Programming (MIP) problems efficiently.
method Semi-supervised Graph Neural Networks (GNNs) for predicting variable values.
result GNNs can solve MIPs with unlabeled data and improve over other ML approaches.
RegMixMatch optimizes Mixup for semi-supervised learning by integrating high- and low-confidence samples.
problem Mixup degrades SSL performance by compromising artificial labels purity.
method RegMixMatch integrates high- and low-confidence samples, uses class-aware Mixup, and mitigates confirmation bias.
result RegMixMatch achieves state-of-the-art performance in SSL benchmarks.
We propose a novel method for semi-supervised learning (SSL) based on data-driven distributionally robust optimization (DRO) using optimal transport metrics. Our proposed method enhances generalization error by using the unlabeled data to restrict the support of the worst case distribution in our DRO formulation. We en…
Study optimal spectral estimator for semi-supervised node classification.
problem Semi-supervised node classification on CSBM with limited labels.
method Spectral estimator inspired by PCA, graph ridge regression, GCN.
result Achieves information-theoretical threshold for exact recovery.
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…
A new method uses optimal transport for semi-supervised classification.
problem Semi-supervised learning with limited labeled data.
method Optimal transport formulation with Sinkhorn iteration for label assignment.
result Improved performance on CIFAR-10, CIFAR-100, and SVHN datasets compared to FixMatch.
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.
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.
Bayesian approach to selecting data for machine learning.
problem Iterative data selection in machine learning algorithms.
method Embedding data selection into decision theory and deriving Bayes-optimal criteria.
result Mitigates confirmation bias in data selection.
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.
Bayesian optimization improves efficiency with semi-supervised learning.
problem Efficiently find global optima of expensive functions.
method Density ratio estimation combined with semi-supervised learning.
result Improved accuracy in identifying global optima with unlabeled data.
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.
S2MAM improves semi-supervised learning by selecting relevant variables and updating similarity metrics.
problem Joint learning from labeled and unlabeled data with geometric structure.
method Bilevel optimization scheme for automatic variable selection and similarity matrix update.
result The proposed S2MAM achieves robust and interpretable predictions.
The Yarowsky algorithm is a rule-based semi-supervised learning algorithm that has been successfully applied to some problems in computational linguistics. The algorithm was not mathematically well understood until (Abney 2004) which analyzed some specific variants of the algorithm, and also proposed some new algorithm…
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.
Proposes a meta-learning algorithm to improve semi-supervised learning.
problem Overfitting and limited model generalization in consistency-based semi-supervised learning.
method Introduces a learn-to-generalize regularization term and meta-gradient optimization.
result Demonstrates improved performance on various datasets compared to state-of-the-art methods.
We propose a technique for declaratively specifying strategies for semi-supervised learning (SSL). The proposed method can be used to specify ensembles of semi-supervised learning, as well as agreement constraints and entropic regularization constraints between these learners, and can be used to model both well-known h…
Graph Random Neural Network improves semi-supervised learning on graphs.
problem Over-smoothing, non-robustness, and weak-generalization in GNNs with few labeled nodes.
method Random propagation strategy and consistency regularization.
result Significantly outperforms state-of-the-art GNN baselines on semi-supervised node classification.
In this paper, Kernel PCA is reinterpreted as the solution to a convex optimization problem. Actually, there is a constrained convex problem for each principal component, so that the constraints guarantee that the principal component is indeed a solution, and not a mere saddle point. Although these insights do not impl…
Scalings in which the graph Laplacian approaches a differential operator in the large graph limit are used to develop understanding of a number of algorithms for semi-supervised learning; in particular the extension, to this graph setting, of the probit algorithm, level set and kriging methods, are studied. Both optimi…
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.
Protein function prediction is the important problem in modern biology. In this paper, the un-normalized, symmetric normalized, and random walk graph Laplacian based semi-supervised learning methods will be applied to the integrated network combined from multiple networks to predict the functions of all yeast proteins …
A method for selecting pseudo-labeled data in semi-supervised learning using generalized Bayes and soft revision.
problem Selecting pseudo-labeled data for semi-supervised learning with robustness to uncertainty.
method Using credal sets and the Gamma-Maximin method with soft revision to update priors and select pseudo-labeled data.
result The Gamma-Maximin method with soft revision can achieve promising results, especially in scenarios with low labeled data proportions.
We address the problem of aggregating an ensemble of predictors with known loss bounds in a semi-supervised binary classification setting, to minimize prediction loss incurred on the unlabeled data. We find the minimax optimal predictions for a very general class of loss functions including all convex and many non-conv…
Semi-supervised clustering aims to introduce prior knowledge in the decision process of a clustering algorithm. In this paper, we propose a novel semi-supervised clustering algorithm based on the information-maximization principle. The proposed method is an extension of a previous unsupervised information-maximization …
We present label gradient alignment, a novel algorithm for semi-supervised learning which imputes labels for the unlabeled data and trains on the imputed labels. We define a semantically meaningful distance metric on the input space by mapping a point (x, y) to the gradient of the model at (x, y). We then formulate an …
Similarity-based clustering and semi-supervised learning methods separate the data into clusters or classes according to the pairwise similarity between the data, and the pairwise similarity is crucial for their performance. In this paper, we propose a novel discriminative similarity learning framework which learns dis…
Semi-Supervised Deep Sobolev Regression: Estimation and Variable Selection by ReQU Neural Networkstat.ML
SDORE uses neural networks to estimate regression functions and their gradients, even with limited labeled data.
problem Nonparametric estimation of regression functions and their gradients.
method Semi-supervised deep ReQU neural networks with gradient norm regularization.
result Achieves minimax optimal convergence rates in -norm and plug-in gradient estimator convergence.
A new approach for instance-optimal learning that bypasses impossibility results.
problem Impossibility of achieving marginal-by-marginal guarantees for all marginals.
method Introduces relatively smart learning, which requires competition only with certifiable semi-supervised guarantees.
result One-Inclusion Graph learner is relatively smart up to squaring the sample complexity.
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…
New JSA autoencoders tackle discrete latent variable models for semi-supervised learning.
problem Handling discrete observations and latent codes in deep generative models.
method Joint-stochastic-approximation (JSA) autoencoders that directly maximize data log-likelihood and minimize KL divergence.
result JSA autoencoders achieve comparable performance to continuous latent space models in semi-supervised tasks.