Machine Collaboration
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913229824851968 |
|---|---|
| author | Liu, Qingfeng Feng, Yang |
| author_facet | Liu, Qingfeng Feng, Yang |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2105_02569 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Machine Collaboration Liu, Qingfeng Feng, Yang Machine Learning Econometrics 68Q32, 68T05, 62G05, 68T07, 62J02, 62G08, 62J07, 62J12 G.3; I.2.6; I.6.4; I.6.5 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. |
| title | Machine Collaboration |
| topic | Machine Learning Econometrics 68Q32, 68T05, 62G05, 68T07, 62J02, 62G08, 62J07, 62J12 G.3; I.2.6; I.6.4; I.6.5 |
| url | https://arxiv.org/abs/2105.02569 |