IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v321y2018icp11-24.html
   My bibliography  Save this article

The convergence rate of semi-supervised regression with quadratic loss

Author

Listed:
  • Sheng, Baohuai
  • Zhu, Hancan

Abstract

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.

Suggested Citation

  • Sheng, Baohuai & Zhu, Hancan, 2018. "The convergence rate of semi-supervised regression with quadratic loss," Applied Mathematics and Computation, Elsevier, vol. 321(C), pages 11-24.
    • Handle: RePEc:eee:apmaco:v:321:y:2018:i:c:p:11-24
    DOI: 10.1016/j.amc.2017.10.033
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317307324
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.10.033?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Michael Kohler, 2002. "Universal Consistency of Local Polynomial Kernel Regression Estimates," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 54(4), pages 879-899, December.
    2. Harro Walk, 2005. "Strong universal consistency of smooth kernel regression estimates," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 57(4), pages 665-685, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Baranyi, Máté & Bolla, Marianna, 2021. "Iterated conditional expectation algorithm on DAGs and regression graphs," Econometrics and Statistics, Elsevier, vol. 20(C), pages 131-152.
    2. Györfi László & Walk Harro, 2013. "Rate of convergence of the density estimation of regression residual," Statistics & Risk Modeling, De Gruyter, vol. 30(1), pages 55-74, March.
    3. Ahmed Ouazza & Noureddine Rhomari & Zoubir Zarrouk, 2022. "Kernel method to estimate nonlinear structural equation models," Quality & Quantity: International Journal of Methodology, Springer, vol. 56(5), pages 3465-3480, October.
    4. Kohler, Michael & Krzyzak, Adam, 2007. "Asymptotic confidence intervals for Poisson regression," Journal of Multivariate Analysis, Elsevier, vol. 98(5), pages 1072-1094, May.
    5. Walk, Harro, 2010. "Strong consistency of kernel estimates of regression function under dependence," Statistics & Probability Letters, Elsevier, vol. 80(15-16), pages 1147-1156, August.
    6. Ahnaf Rafi, 2023. "Efficient Semiparametric Estimation of Average Treatment Effects Under Covariate Adaptive Randomization," Papers 2305.08340, arXiv.org.
    7. Györfi, László & Walk, Harro, 2012. "Strongly consistent density estimation of the regression residual," Statistics & Probability Letters, Elsevier, vol. 82(11), pages 1923-1929.
    8. Matthias Hansmann & Michael Kohler & Harro Walk, 2019. "On the strong universal consistency of local averaging regression estimates," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 71(5), pages 1233-1263, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:321:y:2018:i:c:p:11-24. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.