Pith. sign in

REVIEW 1 cited by

Epistemic Deep Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.07609 v1 pith:G45JBWQ3 submitted 2022-06-15 cs.LG cs.NEstat.ML

classification cs.LGcs.NEstat.ML
keywords epistemiclearningrandom-setbeliefdeepfunctionsnetworksneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The belief function approach to uncertainty quantification as proposed in the Demspter-Shafer theory of evidence is established upon the general mathematical models for set-valued observations, called random sets. Set-valued predictions are the most natural representations of uncertainty in machine learning. In this paper, we introduce a concept called epistemic deep learning based on the random-set interpretation of belief functions to model epistemic learning in deep neural networks. We propose a novel random-set convolutional neural network for classification that produces scores for sets of classes by learning set-valued ground truth representations. We evaluate different formulations of entropy and distance measures for belief functions as viable loss functions for these random-set networks. We also discuss methods for evaluating the quality of epistemic predictions and the performance of epistemic random-set neural networks. We demonstrate through experiments that the epistemic approach produces better performance results when compared to traditional approaches of estimating uncertainty.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Unified Evaluation Framework for Epistemic Predictions

    cs.LG 2025-01 conditional novelty 6.0 of 10

    A new metric E = KL distance to the nearest credal-set vertex plus λ times non-specificity ranks uncertainty-aware classifiers under a user-chosen accuracy-precision trade-off.

Pith tools