We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We present a novel analysis of the expected risk of weighted majority vote in multiclass classification. The analysis takes correlation of predictions by ensemble members into account and provides a bound that is amenable to efficient minimization, which yields improved weighting for the majority vote. We also provide a specialized version of our bound for binary classification, which allows to exploit additional unlabeled data for tighter risk estimation. In experiments, we apply the bound to improve weighting of trees in random forests and show that, in contrast to the commonly used first order bound, minimization of the new bound typically does not lead to degradation of the test error of the ensemble.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2007.13532")
get_code_for_paper("2007.13532")
have("2007.13532")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2007.13532.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2007.13532)
Connect an agent — have() is free.