{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BHYMOGKA7WSQWK4BLDALMH6T6Z","short_pith_number":"pith:BHYMOGKA","schema_version":"1.0","canonical_sha256":"09f0c71940fda50b2b8158c0b61fd3f67bb46cf370ebd992e43c1f66a2c24df4","source":{"kind":"arxiv","id":"1904.11238","version":2},"attestation_state":"computed","paper":{"title":"Unsupervised Label Noise Modeling and Loss Correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Diego Ortego, Eric Arazo, Kevin McGuinness, Noel E. O'Connor, Paul Albert","submitted_at":"2019-04-25T09:53:48Z","abstract_excerpt":"Despite being robust to small amounts of label noise, convolutional neural networks trained with stochastic gradient methods have been shown to easily fit random labels. When there are a mixture of correct and mislabelled targets, networks tend to fit the former before the latter. This suggests using a suitable two-component mixture model as an unsupervised generative model of sample loss values during training to allow online estimation of the probability that a sample is mislabelled. Specifically, we propose a beta mixture to estimate this probability and correct the loss by relying on the n"},"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":"1904.11238","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-25T09:53:48Z","cross_cats_sorted":[],"title_canon_sha256":"92359f75397a38d4ef01bd6d96587b3dae3d33659295159225134df8be0f20af","abstract_canon_sha256":"f9e92db9e56b3ba94de10315e10d546162c228c7cea0724fa446fc0b332c0761"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:06.914724Z","signature_b64":"MN9doaztQXKLOn7nHPIxT0ReH/oMXy/zytkfxuy3N8JRlSnVJkARZk8sPEslhp2pcA6rxOBLx5ROi9TWSrxrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09f0c71940fda50b2b8158c0b61fd3f67bb46cf370ebd992e43c1f66a2c24df4","last_reissued_at":"2026-05-17T23:44:06.914260Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:06.914260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unsupervised Label Noise Modeling and Loss Correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Diego Ortego, Eric Arazo, Kevin McGuinness, Noel E. O'Connor, Paul Albert","submitted_at":"2019-04-25T09:53:48Z","abstract_excerpt":"Despite being robust to small amounts of label noise, convolutional neural networks trained with stochastic gradient methods have been shown to easily fit random labels. When there are a mixture of correct and mislabelled targets, networks tend to fit the former before the latter. This suggests using a suitable two-component mixture model as an unsupervised generative model of sample loss values during training to allow online estimation of the probability that a sample is mislabelled. Specifically, we propose a beta mixture to estimate this probability and correct the loss by relying on the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11238","kind":"arxiv","version":2},"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":"1904.11238","created_at":"2026-05-17T23:44:06.914348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11238v2","created_at":"2026-05-17T23:44:06.914348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11238","created_at":"2026-05-17T23:44:06.914348+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHYMOGKA7WSQ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHYMOGKA7WSQWK4B","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHYMOGKA","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2010.01412","citing_title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BHYMOGKA7WSQWK4BLDALMH6T6Z","json":"https://pith.science/pith/BHYMOGKA7WSQWK4BLDALMH6T6Z.json","graph_json":"https://pith.science/api/pith-number/BHYMOGKA7WSQWK4BLDALMH6T6Z/graph.json","events_json":"https://pith.science/api/pith-number/BHYMOGKA7WSQWK4BLDALMH6T6Z/events.json","paper":"https://pith.science/paper/BHYMOGKA"},"agent_actions":{"view_html":"https://pith.science/pith/BHYMOGKA7WSQWK4BLDALMH6T6Z","download_json":"https://pith.science/pith/BHYMOGKA7WSQWK4BLDALMH6T6Z.json","view_paper":"https://pith.science/paper/BHYMOGKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11238&json=true","fetch_graph":"https://pith.science/api/pith-number/BHYMOGKA7WSQWK4BLDALMH6T6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/BHYMOGKA7WSQWK4BLDALMH6T6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHYMOGKA7WSQWK4BLDALMH6T6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHYMOGKA7WSQWK4BLDALMH6T6Z/action/storage_attestation","attest_author":"https://pith.science/pith/BHYMOGKA7WSQWK4BLDALMH6T6Z/action/author_attestation","sign_citation":"https://pith.science/pith/BHYMOGKA7WSQWK4BLDALMH6T6Z/action/citation_signature","submit_replication":"https://pith.science/pith/BHYMOGKA7WSQWK4BLDALMH6T6Z/action/replication_record"}},"created_at":"2026-05-17T23:44:06.914348+00:00","updated_at":"2026-05-17T23:44:06.914348+00:00"}