An Accuracy Argument in Favor of Ranking Theory

dc.contributor.authorRaidl, Eric
dc.contributor.authorSpohn, Wolfgang
dc.date.accessioned2019-07-01T12:00:03Z
dc.date.available2019-07-01T12:00:03Z
dc.date.issued2020-04
dc.description.abstractFitelson and McCarthy (2014) have proposed an accuracy measure for confidence orders which favors probability measures and Dempster-Shafer belief functions as accounts of degrees of belief and excludes ranking functions. Their accuracy measure only penalizes mistakes in confidence comparisons. We propose an alternative accuracy measure that also rewards correct confidence comparisons. Thus we conform to both of William James’ maxims: “Believe truth! Shun error!” We combine the two maxims, penalties and rewards, into one criterion that we call prioritized accuracy optimization (PAO). That is, PAO punishes wrong comparisons (preferring the false to the true) and rewards right comparisons (preferring the true to the false). And it requires to prioritize being right und avoiding to be wrong in a specific way. Thus PAO is both, a scoring rule and a decision rule. It turns out that precisely confidence orders representable by two-sided ranking functions satisfy PAO. The point is not to argue that PAO is the better accuracy goal. The point is only that ranking theory can also be supported by accuracy considerations. Thus, those considerations by themselves cannot decide about rational formats for degrees of belief, but are part and parcel of an overall normative assessment of those formats.eng
dc.description.versionpublishedeng
dc.identifier.doi10.1007/s10992-019-09518-8eng
dc.identifier.ppn1824059280
dc.identifier.urihttps://kops.uni-konstanz.de/handle/123456789/46184
dc.language.isoengeng
dc.rightsterms-of-use
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/
dc.subjectComparative belief, Accuracy, Accuracy-first epistemology, Degrees of belief, Probability theory, Ranking theory, Representation theoremseng
dc.subject.ddc100eng
dc.titleAn Accuracy Argument in Favor of Ranking Theoryeng
dc.typeJOURNAL_ARTICLEeng
dspace.entity.typePublication
kops.citation.bibtex
@article{Raidl2020-04Accur-46184,
  year={2020},
  doi={10.1007/s10992-019-09518-8},
  title={An Accuracy Argument in Favor of Ranking Theory},
  number={2},
  volume={49},
  issn={0022-3611},
  journal={Journal of Philosophical Logic},
  pages={283--313},
  author={Raidl, Eric and Spohn, Wolfgang}
}
kops.citation.iso690RAIDL, Eric, Wolfgang SPOHN, 2020. An Accuracy Argument in Favor of Ranking Theory. In: Journal of Philosophical Logic. Springer Science+Business Media. 2020, 49(2), pp. 283-313. ISSN 0022-3611. eISSN 1573-0433. Available under: doi: 10.1007/s10992-019-09518-8deu
kops.citation.iso690RAIDL, Eric, Wolfgang SPOHN, 2020. An Accuracy Argument in Favor of Ranking Theory. In: Journal of Philosophical Logic. Springer Science+Business Media. 2020, 49(2), pp. 283-313. ISSN 0022-3611. eISSN 1573-0433. Available under: doi: 10.1007/s10992-019-09518-8eng
kops.citation.rdf
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/46184">
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
    <dcterms:title>An Accuracy Argument in Favor of Ranking Theory</dcterms:title>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/46184"/>
    <dc:creator>Raidl, Eric</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-07-01T12:00:03Z</dc:date>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:abstract xml:lang="eng">Fitelson and McCarthy (2014) have proposed an accuracy measure for confidence orders which favors probability measures and Dempster-Shafer belief functions as accounts of degrees of belief and excludes ranking functions. Their accuracy measure only penalizes mistakes in confidence comparisons. We propose an alternative accuracy measure that also rewards correct confidence comparisons. Thus we conform to both of William James’ maxims: “Believe truth! Shun error!” We combine the two maxims, penalties and rewards, into one criterion that we call prioritized accuracy optimization (PAO). That is, PAO punishes wrong comparisons (preferring the false to the true) and rewards right comparisons (preferring the true to the false). And it requires to prioritize being right und avoiding to be wrong in a specific way. Thus PAO is both, a scoring rule and a decision rule. It turns out that precisely confidence orders representable by two-sided ranking functions satisfy PAO. The point is not to argue that PAO is the better accuracy goal. The point is only that ranking theory can also be supported by accuracy considerations. Thus, those considerations by themselves cannot decide about rational formats for degrees of belief, but are part and parcel of an overall normative assessment of those formats.</dcterms:abstract>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-07-01T12:00:03Z</dcterms:available>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40"/>
    <dcterms:issued>2020-04</dcterms:issued>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/46184/1/Raidl_2-fssl5ey2a1ec1.PDF"/>
    <dc:contributor>Spohn, Wolfgang</dc:contributor>
    <dc:creator>Spohn, Wolfgang</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:language>eng</dc:language>
    <dc:contributor>Raidl, Eric</dc:contributor>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/46184/1/Raidl_2-fssl5ey2a1ec1.PDF"/>
  </rdf:Description>
</rdf:RDF>
kops.description.openAccessopenaccessgreen
kops.flag.isPeerReviewedtrueeng
kops.flag.knbibliographytrue
kops.identifier.nbnurn:nbn:de:bsz:352-2-fssl5ey2a1ec1
kops.sourcefieldJournal of Philosophical Logic. Springer Science+Business Media. 2020, <b>49</b>(2), pp. 283-313. ISSN 0022-3611. eISSN 1573-0433. Available under: doi: 10.1007/s10992-019-09518-8deu
kops.sourcefield.plainJournal of Philosophical Logic. Springer Science+Business Media. 2020, 49(2), pp. 283-313. ISSN 0022-3611. eISSN 1573-0433. Available under: doi: 10.1007/s10992-019-09518-8deu
kops.sourcefield.plainJournal of Philosophical Logic. Springer Science+Business Media. 2020, 49(2), pp. 283-313. ISSN 0022-3611. eISSN 1573-0433. Available under: doi: 10.1007/s10992-019-09518-8eng
relation.isAuthorOfPublication1b80b292-c563-42da-863a-857f96216d10
relation.isAuthorOfPublication7c1a2af8-2c70-457a-870a-ae49c21744b3
relation.isAuthorOfPublication.latestForDiscovery1b80b292-c563-42da-863a-857f96216d10
source.bibliographicInfo.fromPage283
source.bibliographicInfo.issue2
source.bibliographicInfo.toPage313
source.bibliographicInfo.volume49
source.identifier.eissn1573-0433eng
source.identifier.issn0022-3611eng
source.periodicalTitleJournal of Philosophical Logiceng
source.publisherSpringer Science+Business Media

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
Raidl_2-fssl5ey2a1ec1.PDF
Größe:
236.91 KB
Format:
Adobe Portable Document Format
Beschreibung:
Raidl_2-fssl5ey2a1ec1.PDF
Raidl_2-fssl5ey2a1ec1.PDFGröße: 236.91 KBDownloads: 132