The convergence rate of semi-supervised regression with quadratic loss

It is known that the semi-supervised learning deals with learning algorithms with less labeled samples and more unlabeled samples. One of the problems in this field is to show, at what extent, the performance depends upon the unlabeled number. A kind of modified semi-supervised regularized regression with quadratic loss is provided. The convergence rate for the error estimate is given in expectation mean. It is shown that the learning rate is controlled by the number of the unlabeled samples, and the algorithm converges with the increasing of the unlabeled sample number.