{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5MR37ZRMY5FHPJMKFJRE6PHMQE","short_pith_number":"pith:5MR37ZRM","schema_version":"1.0","canonical_sha256":"eb23bfe62cc74a77a58a2a624f3cec81338a7aacc613c61efbaa88b7f94cbd16","source":{"kind":"arxiv","id":"1802.07167","version":3},"attestation_state":"computed","paper":{"title":"High-Quality Prediction Intervals for Deep Learning: A Distribution-Free, Ensembled Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Alexandra Brintrup, Andy Neely, Mohamed Zaki, Tim Pearce","submitted_at":"2018-02-20T16:02:21Z","abstract_excerpt":"This paper considers the generation of prediction intervals (PIs) by neural networks for quantifying uncertainty in regression tasks. It is axiomatic that high-quality PIs should be as narrow as possible, whilst capturing a specified portion of data. We derive a loss function directly from this axiom that requires no distributional assumption. We show how its form derives from a likelihood principle, that it can be used with gradient descent, and that model uncertainty is accounted for in ensembled form. Benchmark experiments show the method outperforms current state-of-the-art uncertainty qua"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1802.07167","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-20T16:02:21Z","cross_cats_sorted":[],"title_canon_sha256":"b239dd1e80d5ea7676df1442189f6516bf41223e8380584c79ca1f1046d6e0e7","abstract_canon_sha256":"12a1829ebd222f1f7dddbf2ef2d696bf078f4f85a6f6feaf06e4d80701eca5e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:05.961000Z","signature_b64":"pJZVaSw4+mrcC3MOWWJlUEFbCC37NBlRKDd3i/EeQmA1eJ9T+IUlBwEGrPzD2edB3cTh7vFt74MXXPpEAtV4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb23bfe62cc74a77a58a2a624f3cec81338a7aacc613c61efbaa88b7f94cbd16","last_reissued_at":"2026-05-17T23:49:05.960448Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:05.960448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Quality Prediction Intervals for Deep Learning: A Distribution-Free, Ensembled Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Alexandra Brintrup, Andy Neely, Mohamed Zaki, Tim Pearce","submitted_at":"2018-02-20T16:02:21Z","abstract_excerpt":"This paper considers the generation of prediction intervals (PIs) by neural networks for quantifying uncertainty in regression tasks. It is axiomatic that high-quality PIs should be as narrow as possible, whilst capturing a specified portion of data. We derive a loss function directly from this axiom that requires no distributional assumption. We show how its form derives from a likelihood principle, that it can be used with gradient descent, and that model uncertainty is accounted for in ensembled form. Benchmark experiments show the method outperforms current state-of-the-art uncertainty qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07167","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.07167","created_at":"2026-05-17T23:49:05.960523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07167v3","created_at":"2026-05-17T23:49:05.960523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07167","created_at":"2026-05-17T23:49:05.960523+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MR37ZRMY5FH","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MR37ZRMY5FHPJMK","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MR37ZRM","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.11555","citing_title":"As easy as 1, 2... 4? Uncertainty in counting tasks for medical imaging","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5MR37ZRMY5FHPJMKFJRE6PHMQE","json":"https://pith.science/pith/5MR37ZRMY5FHPJMKFJRE6PHMQE.json","graph_json":"https://pith.science/api/pith-number/5MR37ZRMY5FHPJMKFJRE6PHMQE/graph.json","events_json":"https://pith.science/api/pith-number/5MR37ZRMY5FHPJMKFJRE6PHMQE/events.json","paper":"https://pith.science/paper/5MR37ZRM"},"agent_actions":{"view_html":"https://pith.science/pith/5MR37ZRMY5FHPJMKFJRE6PHMQE","download_json":"https://pith.science/pith/5MR37ZRMY5FHPJMKFJRE6PHMQE.json","view_paper":"https://pith.science/paper/5MR37ZRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07167&json=true","fetch_graph":"https://pith.science/api/pith-number/5MR37ZRMY5FHPJMKFJRE6PHMQE/graph.json","fetch_events":"https://pith.science/api/pith-number/5MR37ZRMY5FHPJMKFJRE6PHMQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MR37ZRMY5FHPJMKFJRE6PHMQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MR37ZRMY5FHPJMKFJRE6PHMQE/action/storage_attestation","attest_author":"https://pith.science/pith/5MR37ZRMY5FHPJMKFJRE6PHMQE/action/author_attestation","sign_citation":"https://pith.science/pith/5MR37ZRMY5FHPJMKFJRE6PHMQE/action/citation_signature","submit_replication":"https://pith.science/pith/5MR37ZRMY5FHPJMKFJRE6PHMQE/action/replication_record"}},"created_at":"2026-05-17T23:49:05.960523+00:00","updated_at":"2026-05-17T23:49:05.960523+00:00"}