Semi-supervised Deep Kernel Learning: Regression with Unlabeled Data by Minimizing Predictive Variance
Large amounts of labeled data are typically required to train deep learning models. For many real-world problems, however, acquiring additional data can be expensive or even impossible. We present semi-supervised deep kernel learning (SSDKL), a semi-supervised regression model based on minimizing predictive variance in the posterior regularization framework. SSDKL combines the hierarchical representation learning of neural networks with the probabilistic modeling capabilities of Gaussian processes. By leveraging unlabeled data, we show improvements on a diverse set of real-world regression tasks over supervised deep kernel learning and semi-supervised methods such as VAT and mean teacher adapted for regression.
Code (1)
Tasks
Gaussian ProcessesregressionRepresentation LearningSimilar Papers 제목 키워드 기반
A semi-supervised learning using over-parameterized regression
Semi-supervised learning (SSL) is an important theme in machine learning, in which we have a few labeled samples and many unlabeled samples. In this paper, for SSL in a regression problem, we consider a method of incorpo…
Dimensionality ReductionregressionSemi-Supervised Learning with Noisy Proxy Covariates: Generalization Bounds and Distribution Regression
In many modern machine learning pipelines, abundant pretrained representations serve as noisy proxy covariates, while task-specific labels remain scarce. We study semi-supervised regression in this setting, and propose a…
Correlated random features for fast semi-supervised learning
This paper presents Correlated Nystrom Views (XNV), a fast semi-supervised algorithm for regression and classification. The algorithm draws on two main ideas. First, it generates two views consisting of computationally i…
regressionSemi-Supervised Regression with Co-Training
In many practical machine learning and data min-ing applications, unlabeled training examples arereadily available but labeled ones are fairly expen-sive to obtain. Therefore, semi-supervised learn-ing algori…
BIG-bench Machine LearningregressionSemi-supervised Ranking Pursuit
We propose a novel sparse preference learning/ranking algorithm. Our algorithm approximates the true utility function by a weighted sum of basis functions using the squared loss on pairs of data points, and is a generali…
regression