{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UZ3ACNUA4U5OKGUYLYQRNYLQC7","short_pith_number":"pith:UZ3ACNUA","schema_version":"1.0","canonical_sha256":"a676013680e53ae51a985e2116e17017f01a3f2b0b162cf62e0a6122232dde2f","source":{"kind":"arxiv","id":"1311.6556","version":2},"attestation_state":"computed","paper":{"title":"Double Ramp Loss Based Reject Option Classifier","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kalpit Desai, Naresh Manwani, Ramasubramanian Sundararajan, Sanand Sasidharan","submitted_at":"2013-11-26T05:13:18Z","abstract_excerpt":"We consider the problem of learning reject option classifiers. The goodness of a reject option classifier is quantified using $0-d-1$ loss function wherein a loss $d \\in (0,.5)$ is assigned for rejection. In this paper, we propose {\\em double ramp loss} function which gives a continuous upper bound for $(0-d-1)$ loss. Our approach is based on minimizing regularized risk under the double ramp loss using {\\em difference of convex (DC) programming}. We show the effectiveness of our approach through experiments on synthetic and benchmark datasets. Our approach performs better than the state of the"},"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":"1311.6556","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-11-26T05:13:18Z","cross_cats_sorted":[],"title_canon_sha256":"d06c65e2e0908cbadef8e031271ece57c641190f18822001d38b09c383563a52","abstract_canon_sha256":"52c4ca63753e0dfbe3cbde0bed2c8bf3874004ecc740955489359bed227562c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:23.671455Z","signature_b64":"DFFgtr/by9uHYwG1EqY3/MBL45rEoCZl1K6NcCHzDG0sNnt+tMaDVz96bBq8A/u8fCw1PZNhwVThDBgySqwDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a676013680e53ae51a985e2116e17017f01a3f2b0b162cf62e0a6122232dde2f","last_reissued_at":"2026-05-18T00:41:23.670805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:23.670805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double Ramp Loss Based Reject Option Classifier","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kalpit Desai, Naresh Manwani, Ramasubramanian Sundararajan, Sanand Sasidharan","submitted_at":"2013-11-26T05:13:18Z","abstract_excerpt":"We consider the problem of learning reject option classifiers. The goodness of a reject option classifier is quantified using $0-d-1$ loss function wherein a loss $d \\in (0,.5)$ is assigned for rejection. In this paper, we propose {\\em double ramp loss} function which gives a continuous upper bound for $(0-d-1)$ loss. Our approach is based on minimizing regularized risk under the double ramp loss using {\\em difference of convex (DC) programming}. We show the effectiveness of our approach through experiments on synthetic and benchmark datasets. Our approach performs better than the state of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6556","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":"1311.6556","created_at":"2026-05-18T00:41:23.670894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.6556v2","created_at":"2026-05-18T00:41:23.670894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6556","created_at":"2026-05-18T00:41:23.670894+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZ3ACNUA4U5O","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZ3ACNUA4U5OKGUY","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZ3ACNUA","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7","json":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7.json","graph_json":"https://pith.science/api/pith-number/UZ3ACNUA4U5OKGUYLYQRNYLQC7/graph.json","events_json":"https://pith.science/api/pith-number/UZ3ACNUA4U5OKGUYLYQRNYLQC7/events.json","paper":"https://pith.science/paper/UZ3ACNUA"},"agent_actions":{"view_html":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7","download_json":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7.json","view_paper":"https://pith.science/paper/UZ3ACNUA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.6556&json=true","fetch_graph":"https://pith.science/api/pith-number/UZ3ACNUA4U5OKGUYLYQRNYLQC7/graph.json","fetch_events":"https://pith.science/api/pith-number/UZ3ACNUA4U5OKGUYLYQRNYLQC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7/action/storage_attestation","attest_author":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7/action/author_attestation","sign_citation":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7/action/citation_signature","submit_replication":"https://pith.science/pith/UZ3ACNUA4U5OKGUYLYQRNYLQC7/action/replication_record"}},"created_at":"2026-05-18T00:41:23.670894+00:00","updated_at":"2026-05-18T00:41:23.670894+00:00"}