IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2105.02569.html
   My bibliography  Save this paper

Machine Collaboration

Author

Listed:
  • Qingfeng Liu
  • Yang Feng

Abstract

We propose a new ensemble framework for supervised learning, called machine collaboration (MaC), using a collection of base machines for prediction tasks. Unlike bagging/stacking (a parallel & independent framework) and boosting (a sequential & top-down framework), MaC is a type of circular & interactive learning framework. The circular & interactive feature helps the base machines to transfer information circularly and update their structures and parameters accordingly. The theoretical result on the risk bound of the estimator from MaC reveals that the circular & interactive feature can help MaC reduce risk via a parsimonious ensemble. We conduct extensive experiments on MaC using both simulated data and 119 benchmark real datasets. The results demonstrate that in most cases, MaC performs significantly better than several other state-of-the-art methods, including classification and regression trees, neural networks, stacking, and boosting.

Suggested Citation

  • Qingfeng Liu & Yang Feng, 2021. "Machine Collaboration," Papers 2105.02569, arXiv.org, revised Feb 2024.
    • Handle: RePEc:arx:papers:2105.02569
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2105.02569
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Laan Mark J. van der & Dudoit Sandrine & Vaart Aad W. van der, 2006. "The cross-validated adaptive epsilon-net estimator," Statistics & Risk Modeling, De Gruyter, vol. 24(3), pages 373-395, 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. Olivier Lopez & Xavier Milhaud & Pierre-Emmanuel Thérond, 2015. "Tree-based censored regression with applications to insurance," Working Papers hal-01141228, HAL.
    2. Susan Gruber & Mark J. van der Laan, 2013. "An Application of Targeted Maximum Likelihood Estimation to the Meta-Analysis of Safety Data," Biometrics, The International Biometric Society, vol. 69(1), pages 254-262, March.
    3. Olivier Lopez & Xavier Milhaud & Pierre-Emmanuel Thérond, 2016. "Tree-based censored regression with applications in insurance," Post-Print hal-01141228, HAL.
    4. Vaart Aad W. van der & Dudoit Sandrine & Laan Mark J. van der, 2006. "Oracle inequalities for multi-fold cross validation," Statistics & Risk Modeling, De Gruyter, vol. 24(3), pages 351-371, December.
    5. van der Laan Mark J., 2010. "Targeted Maximum Likelihood Based Causal Inference: Part I," The International Journal of Biostatistics, De Gruyter, vol. 6(2), pages 1-45, February.
    6. van der Laan Mark J. & Gruber Susan, 2010. "Collaborative Double Robust Targeted Maximum Likelihood Estimation," The International Journal of Biostatistics, De Gruyter, vol. 6(1), pages 1-71, May.
    7. Goldsmith, Jeff & Scheipl, Fabian, 2014. "Estimator selection and combination in scalar-on-function regression," Computational Statistics & Data Analysis, Elsevier, vol. 70(C), pages 362-372.
    8. I Díaz & O Savenkov & K Ballman, 2018. "Targeted learning ensembles for optimal individualized treatment rules with time-to-event outcomes," Biometrika, Biometrika Trust, vol. 105(3), pages 723-738.
    9. Narayanaswamy Balakrishnan & Majid Mojirsheibani, 2015. "A simple method for combining estimates to improve the overall error rates in classification," Computational Statistics, Springer, vol. 30(4), pages 1033-1049, December.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:arx:papers:2105.02569. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.