{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RUAT7D2D6OV2XZ6MSWJSJXUKYR","short_pith_number":"pith:RUAT7D2D","schema_version":"1.0","canonical_sha256":"8d013f8f43f3ababe7cc959324de8ac4695de254256034a5cf6568a0b68a7118","source":{"kind":"arxiv","id":"2403.14144","version":2},"attestation_state":"computed","paper":{"title":"Understanding the Ranking Loss for Recommendation with Sparse User Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Jie Jiang, Junwei Pan, Lei Xiao, Shangyu Zhang, Shudong Huang, Ximei Wang, Xi Xiao, Zhutian Lin","submitted_at":"2024-03-21T05:40:01Z","abstract_excerpt":"Click-through rate (CTR) prediction is a crucial area of research in online advertising. While binary cross entropy (BCE) has been widely used as the optimization objective for treating CTR prediction as a binary classification problem, recent advancements have shown that combining BCE loss with an auxiliary ranking loss can significantly improve performance. However, the full effectiveness of this combination loss is not yet fully understood. In this paper, we uncover a new challenge associated with the BCE loss in scenarios where positive feedback is sparse: the issue of gradient vanishing f"},"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":"2403.14144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-03-21T05:40:01Z","cross_cats_sorted":[],"title_canon_sha256":"adb363cfb27ca5ecb8c8eccebbf7186bde30f69d9b51c8eeabfabfbd0d76004b","abstract_canon_sha256":"045470e3c390658ce00fa20fd6d8fc0129f2a4f7044743a6baf733a4e38b1f57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:39.735254Z","signature_b64":"4Bb9IJK8RHXuubbNaPTq3G35hrR55UF1cm/sejwXgA0VN6VbZXSnyMwZkE4CHDwOrVjBEZUOPVtNFln6fWHTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d013f8f43f3ababe7cc959324de8ac4695de254256034a5cf6568a0b68a7118","last_reissued_at":"2026-07-05T08:40:39.734796Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:39.734796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding the Ranking Loss for Recommendation with Sparse User Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Jie Jiang, Junwei Pan, Lei Xiao, Shangyu Zhang, Shudong Huang, Ximei Wang, Xi Xiao, Zhutian Lin","submitted_at":"2024-03-21T05:40:01Z","abstract_excerpt":"Click-through rate (CTR) prediction is a crucial area of research in online advertising. While binary cross entropy (BCE) has been widely used as the optimization objective for treating CTR prediction as a binary classification problem, recent advancements have shown that combining BCE loss with an auxiliary ranking loss can significantly improve performance. However, the full effectiveness of this combination loss is not yet fully understood. In this paper, we uncover a new challenge associated with the BCE loss in scenarios where positive feedback is sparse: the issue of gradient vanishing f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14144","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.14144/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":"2403.14144","created_at":"2026-07-05T08:40:39.734855+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.14144v2","created_at":"2026-07-05T08:40:39.734855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14144","created_at":"2026-07-05T08:40:39.734855+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUAT7D2D6OV2","created_at":"2026-07-05T08:40:39.734855+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUAT7D2D6OV2XZ6M","created_at":"2026-07-05T08:40:39.734855+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUAT7D2D","created_at":"2026-07-05T08:40:39.734855+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.17999","citing_title":"Revisiting Feature Interactions from the Perspective of Quadratic Neural Networks for Click-through Rate Prediction","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RUAT7D2D6OV2XZ6MSWJSJXUKYR","json":"https://pith.science/pith/RUAT7D2D6OV2XZ6MSWJSJXUKYR.json","graph_json":"https://pith.science/api/pith-number/RUAT7D2D6OV2XZ6MSWJSJXUKYR/graph.json","events_json":"https://pith.science/api/pith-number/RUAT7D2D6OV2XZ6MSWJSJXUKYR/events.json","paper":"https://pith.science/paper/RUAT7D2D"},"agent_actions":{"view_html":"https://pith.science/pith/RUAT7D2D6OV2XZ6MSWJSJXUKYR","download_json":"https://pith.science/pith/RUAT7D2D6OV2XZ6MSWJSJXUKYR.json","view_paper":"https://pith.science/paper/RUAT7D2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.14144&json=true","fetch_graph":"https://pith.science/api/pith-number/RUAT7D2D6OV2XZ6MSWJSJXUKYR/graph.json","fetch_events":"https://pith.science/api/pith-number/RUAT7D2D6OV2XZ6MSWJSJXUKYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUAT7D2D6OV2XZ6MSWJSJXUKYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUAT7D2D6OV2XZ6MSWJSJXUKYR/action/storage_attestation","attest_author":"https://pith.science/pith/RUAT7D2D6OV2XZ6MSWJSJXUKYR/action/author_attestation","sign_citation":"https://pith.science/pith/RUAT7D2D6OV2XZ6MSWJSJXUKYR/action/citation_signature","submit_replication":"https://pith.science/pith/RUAT7D2D6OV2XZ6MSWJSJXUKYR/action/replication_record"}},"created_at":"2026-07-05T08:40:39.734855+00:00","updated_at":"2026-07-05T08:40:39.734855+00:00"}