{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:35YAJDEADSPILHK72KUMCAJLNG","short_pith_number":"pith:35YAJDEA","schema_version":"1.0","canonical_sha256":"df70048c801c9e859d5fd2a8c1012b69a8041e4d1df1f32a5424375b67da6621","source":{"kind":"arxiv","id":"1802.04235","version":2},"attestation_state":"computed","paper":{"title":"Sparse Reject Option Classifier Using Successive Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kulin Shah, Naresh Manwani","submitted_at":"2018-02-12T18:38:26Z","abstract_excerpt":"In this paper, we propose an approach for learning sparse reject option classifiers using double ramp loss $L_{dr}$. We use DC programming to find the risk minimizer. The algorithm solves a sequence of linear programs to learn the reject option classifier. We show that the loss $L_{dr}$ is Fisher consistent. We also show that the excess risk of loss $L_d$ is upper bounded by the excess risk of $L_{dr}$. We derive the generalization error bounds for the proposed approach. We show the effectiveness of the proposed approach by experimenting it on several real world datasets. The proposed approach"},"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.04235","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T18:38:26Z","cross_cats_sorted":[],"title_canon_sha256":"8e62dcf3d8ca0020fd08d8a021ab6b0eb74f7d29a95a86ef93364c18926ed709","abstract_canon_sha256":"b342fc3504d9225671a7d6c33a5e7618e8c60e4deb66cd80e7c2c2a807e38fe7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:42.822182Z","signature_b64":"jdnOHhtIFymaXK5M8fKSF4ltNWJMatGuQwFa0/FgmshZ1ueTOJ3HC1BZ6eZi7Hn0FlWMEVzWT+Jbkk4jYQcUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df70048c801c9e859d5fd2a8c1012b69a8041e4d1df1f32a5424375b67da6621","last_reissued_at":"2026-05-17T23:50:42.821638Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:42.821638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Reject Option Classifier Using Successive Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Kulin Shah, Naresh Manwani","submitted_at":"2018-02-12T18:38:26Z","abstract_excerpt":"In this paper, we propose an approach for learning sparse reject option classifiers using double ramp loss $L_{dr}$. We use DC programming to find the risk minimizer. The algorithm solves a sequence of linear programs to learn the reject option classifier. We show that the loss $L_{dr}$ is Fisher consistent. We also show that the excess risk of loss $L_d$ is upper bounded by the excess risk of $L_{dr}$. We derive the generalization error bounds for the proposed approach. We show the effectiveness of the proposed approach by experimenting it on several real world datasets. The proposed approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04235","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":"1802.04235","created_at":"2026-05-17T23:50:42.821699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04235v2","created_at":"2026-05-17T23:50:42.821699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04235","created_at":"2026-05-17T23:50:42.821699+00:00"},{"alias_kind":"pith_short_12","alias_value":"35YAJDEADSPI","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"35YAJDEADSPILHK7","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"35YAJDEA","created_at":"2026-05-18T12:32:02.567920+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/35YAJDEADSPILHK72KUMCAJLNG","json":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG.json","graph_json":"https://pith.science/api/pith-number/35YAJDEADSPILHK72KUMCAJLNG/graph.json","events_json":"https://pith.science/api/pith-number/35YAJDEADSPILHK72KUMCAJLNG/events.json","paper":"https://pith.science/paper/35YAJDEA"},"agent_actions":{"view_html":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG","download_json":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG.json","view_paper":"https://pith.science/paper/35YAJDEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04235&json=true","fetch_graph":"https://pith.science/api/pith-number/35YAJDEADSPILHK72KUMCAJLNG/graph.json","fetch_events":"https://pith.science/api/pith-number/35YAJDEADSPILHK72KUMCAJLNG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG/action/storage_attestation","attest_author":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG/action/author_attestation","sign_citation":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG/action/citation_signature","submit_replication":"https://pith.science/pith/35YAJDEADSPILHK72KUMCAJLNG/action/replication_record"}},"created_at":"2026-05-17T23:50:42.821699+00:00","updated_at":"2026-05-17T23:50:42.821699+00:00"}