{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JOIIHQCNFVQVJUMRQFMMLY4XBZ","short_pith_number":"pith:JOIIHQCN","schema_version":"1.0","canonical_sha256":"4b9083c04d2d6154d1918158c5e3970e53ccd8d598fa59552c7b78735544cdd6","source":{"kind":"arxiv","id":"2203.14177","version":3},"attestation_state":"computed","paper":{"title":"Benchmarking Deep AUROC Optimization: Loss Functions and Algorithmic Choices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dixian Zhu, Tianbao Yang, Xiaodong Wu","submitted_at":"2022-03-27T00:47:00Z","abstract_excerpt":"The area under the ROC curve (AUROC) has been vigorously applied for imbalanced classification and moreover combined with deep learning techniques. However, there is no existing work that provides sound information for peers to choose appropriate deep AUROC maximization techniques. In this work, we fill this gap from three aspects. (i) We benchmark a variety of loss functions with different algorithmic choices for deep AUROC optimization problem. We study the loss functions in two categories: pairwise loss and composite loss, which includes a total of 10 loss functions. Interestingly, we find "},"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":"2203.14177","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-27T00:47:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"afcdef7333bcd1d4269fc4a708cd67fc39edff7bbe4d75b4175a06598f46b4be","abstract_canon_sha256":"ea57777a72f43145a6c5f6471d93c96903447eb43d9c28b6e298478bcfa9f4a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:37:35.091090Z","signature_b64":"vX2AUsPjZs+J46TaE3m5rLyrjDK4X3epJVJxHjQdcf9rKoc7Y0L5kIQgk++NiLywFlEMH9FoyNOinGq/U/s3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b9083c04d2d6154d1918158c5e3970e53ccd8d598fa59552c7b78735544cdd6","last_reissued_at":"2026-07-05T04:37:35.090595Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:37:35.090595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benchmarking Deep AUROC Optimization: Loss Functions and Algorithmic Choices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dixian Zhu, Tianbao Yang, Xiaodong Wu","submitted_at":"2022-03-27T00:47:00Z","abstract_excerpt":"The area under the ROC curve (AUROC) has been vigorously applied for imbalanced classification and moreover combined with deep learning techniques. However, there is no existing work that provides sound information for peers to choose appropriate deep AUROC maximization techniques. In this work, we fill this gap from three aspects. (i) We benchmark a variety of loss functions with different algorithmic choices for deep AUROC optimization problem. We study the loss functions in two categories: pairwise loss and composite loss, which includes a total of 10 loss functions. Interestingly, we find "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.14177","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.14177/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2203.14177","created_at":"2026-07-05T04:37:35.090651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.14177v3","created_at":"2026-07-05T04:37:35.090651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.14177","created_at":"2026-07-05T04:37:35.090651+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOIIHQCNFVQV","created_at":"2026-07-05T04:37:35.090651+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOIIHQCNFVQVJUMR","created_at":"2026-07-05T04:37:35.090651+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOIIHQCN","created_at":"2026-07-05T04:37:35.090651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.08555","citing_title":"Benchmarking Optimization Algorithms for Automated Calibration of Quantum Devices","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12632","citing_title":"Calibration-Aware Policy Optimization for Reasoning LLMs","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JOIIHQCNFVQVJUMRQFMMLY4XBZ","json":"https://pith.science/pith/JOIIHQCNFVQVJUMRQFMMLY4XBZ.json","graph_json":"https://pith.science/api/pith-number/JOIIHQCNFVQVJUMRQFMMLY4XBZ/graph.json","events_json":"https://pith.science/api/pith-number/JOIIHQCNFVQVJUMRQFMMLY4XBZ/events.json","paper":"https://pith.science/paper/JOIIHQCN"},"agent_actions":{"view_html":"https://pith.science/pith/JOIIHQCNFVQVJUMRQFMMLY4XBZ","download_json":"https://pith.science/pith/JOIIHQCNFVQVJUMRQFMMLY4XBZ.json","view_paper":"https://pith.science/paper/JOIIHQCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.14177&json=true","fetch_graph":"https://pith.science/api/pith-number/JOIIHQCNFVQVJUMRQFMMLY4XBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/JOIIHQCNFVQVJUMRQFMMLY4XBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOIIHQCNFVQVJUMRQFMMLY4XBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOIIHQCNFVQVJUMRQFMMLY4XBZ/action/storage_attestation","attest_author":"https://pith.science/pith/JOIIHQCNFVQVJUMRQFMMLY4XBZ/action/author_attestation","sign_citation":"https://pith.science/pith/JOIIHQCNFVQVJUMRQFMMLY4XBZ/action/citation_signature","submit_replication":"https://pith.science/pith/JOIIHQCNFVQVJUMRQFMMLY4XBZ/action/replication_record"}},"created_at":"2026-07-05T04:37:35.090651+00:00","updated_at":"2026-07-05T04:37:35.090651+00:00"}