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.
Due to the steadily increasing relevance of machine learning for practical applications, many of which are coming with safety requirements, the notion of uncertainty has received increasing attention in machine learning research in the last couple of years. In particular, the idea of distinguishing between two important types of uncertainty, often refereed to as aleatoric and epistemic, has recently been studied in the setting of supervised learning. In this paper, we propose to quantify these uncertainties with random forests. More specifically, we show how two general approaches for measuring the learner's aleatoric and epistemic uncertainty in a prediction can be instantiated with decision trees and random forests as learning algorithms in a classification setting. In this regard, we also compare random forests with deep neural networks, which have been used for a similar purpose.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2001.00893")
get_code_for_paper("2001.00893")
have("2001.00893")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2001.00893.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2001.00893)
Connect an agent — have() is free.