{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PWCFLKMBYWDOAUGNTY74C6IHJS","short_pith_number":"pith:PWCFLKMB","schema_version":"1.0","canonical_sha256":"7d8455a981c586e050cd9e3fc179074c89b7dc8b092918b42b3d89a727ba740d","source":{"kind":"arxiv","id":"1511.05743","version":1},"attestation_state":"computed","paper":{"title":"Sparse learning of maximum likelihood model for optimization of complex loss function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ning Zhang, Prathamesh Chandrasekar","submitted_at":"2015-11-18T11:40:02Z","abstract_excerpt":"Traditional machine learning methods usually minimize a simple loss function to learn a predictive model, and then use a complex performance measure to measure the prediction performance. However, minimizing a simple loss function cannot guarantee that an optimal performance. In this paper, we study the problem of optimizing the complex performance measure directly to obtain a predictive model. We proposed to construct a maximum likelihood model for this problem, and to learn the model parameter, we minimize a com- plex loss function corresponding to the desired complex performance measure. To"},"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":"1511.05743","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-18T11:40:02Z","cross_cats_sorted":[],"title_canon_sha256":"262d4a244c9914995fc588dbe8529cb14b02c0d418805fea5f0b17b6f7803894","abstract_canon_sha256":"302d505dc7e4edeebc946d36540d7783f7940aed1cc0c0d1d4bf728c4850f863"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:32.869260Z","signature_b64":"HI7Pdc0HQoTiNXuGAidaR4IkK9tHasVk4ikCbAyWPTlp1SS/BDILI0A8QMlNituQABl5Knh8YF96wsTtxwrYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d8455a981c586e050cd9e3fc179074c89b7dc8b092918b42b3d89a727ba740d","last_reissued_at":"2026-05-18T01:26:32.868694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:32.868694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse learning of maximum likelihood model for optimization of complex loss function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ning Zhang, Prathamesh Chandrasekar","submitted_at":"2015-11-18T11:40:02Z","abstract_excerpt":"Traditional machine learning methods usually minimize a simple loss function to learn a predictive model, and then use a complex performance measure to measure the prediction performance. However, minimizing a simple loss function cannot guarantee that an optimal performance. In this paper, we study the problem of optimizing the complex performance measure directly to obtain a predictive model. We proposed to construct a maximum likelihood model for this problem, and to learn the model parameter, we minimize a com- plex loss function corresponding to the desired complex performance measure. To"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05743","kind":"arxiv","version":1},"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":"1511.05743","created_at":"2026-05-18T01:26:32.868780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05743v1","created_at":"2026-05-18T01:26:32.868780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05743","created_at":"2026-05-18T01:26:32.868780+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWCFLKMBYWDO","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWCFLKMBYWDOAUGN","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWCFLKMB","created_at":"2026-05-18T12:29:37.295048+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/PWCFLKMBYWDOAUGNTY74C6IHJS","json":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS.json","graph_json":"https://pith.science/api/pith-number/PWCFLKMBYWDOAUGNTY74C6IHJS/graph.json","events_json":"https://pith.science/api/pith-number/PWCFLKMBYWDOAUGNTY74C6IHJS/events.json","paper":"https://pith.science/paper/PWCFLKMB"},"agent_actions":{"view_html":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS","download_json":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS.json","view_paper":"https://pith.science/paper/PWCFLKMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05743&json=true","fetch_graph":"https://pith.science/api/pith-number/PWCFLKMBYWDOAUGNTY74C6IHJS/graph.json","fetch_events":"https://pith.science/api/pith-number/PWCFLKMBYWDOAUGNTY74C6IHJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS/action/storage_attestation","attest_author":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS/action/author_attestation","sign_citation":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS/action/citation_signature","submit_replication":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS/action/replication_record"}},"created_at":"2026-05-18T01:26:32.868780+00:00","updated_at":"2026-05-18T01:26:32.868780+00:00"}