{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A7CQPJ4BVEMD4XK2ZJFBR7DEVC","short_pith_number":"pith:A7CQPJ4B","schema_version":"1.0","canonical_sha256":"07c507a781a9183e5d5aca4a18fc64a8881bd849ad8179ec046bef67ec933d9d","source":{"kind":"arxiv","id":"1606.02077","version":1},"attestation_state":"computed","paper":{"title":"Regret Bounds for Non-decomposable Metrics with Missing Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nagarajan Natarajan, Prateek Jain","submitted_at":"2016-06-07T10:00:30Z","abstract_excerpt":"We consider the problem of recommending relevant labels (items) for a given data point (user). In particular, we are interested in the practically important setting where the evaluation is with respect to non-decomposable (over labels) performance metrics like the $F_1$ measure, and the training data has missing labels. To this end, we propose a generic framework that given a performance metric $\\Psi$, can devise a regularized objective function and a threshold such that all the values in the predicted score vector above and only above the threshold are selected to be positive. We show that th"},"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":"1606.02077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-07T10:00:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7bda85dd331fd1f83ee05d74ff20be24ccb0df117a5c2e67f989fa55363f4d0d","abstract_canon_sha256":"70ca59b6fd62af202bfed06c60d31d5b049ae139f6d90b53f4a32576d231a411"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:44.657578Z","signature_b64":"O48w8FvvmuO2wlUJWSX5na4n6qKHjkqhIujQq6poz1/tlDQ4K4JZVRajfkxIDkF0v6Q4Ad36xcqnRIPtycB4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07c507a781a9183e5d5aca4a18fc64a8881bd849ad8179ec046bef67ec933d9d","last_reissued_at":"2026-05-18T01:12:44.657205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:44.657205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regret Bounds for Non-decomposable Metrics with Missing Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nagarajan Natarajan, Prateek Jain","submitted_at":"2016-06-07T10:00:30Z","abstract_excerpt":"We consider the problem of recommending relevant labels (items) for a given data point (user). In particular, we are interested in the practically important setting where the evaluation is with respect to non-decomposable (over labels) performance metrics like the $F_1$ measure, and the training data has missing labels. To this end, we propose a generic framework that given a performance metric $\\Psi$, can devise a regularized objective function and a threshold such that all the values in the predicted score vector above and only above the threshold are selected to be positive. We show that th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02077","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":"1606.02077","created_at":"2026-05-18T01:12:44.657269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02077v1","created_at":"2026-05-18T01:12:44.657269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02077","created_at":"2026-05-18T01:12:44.657269+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7CQPJ4BVEMD","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7CQPJ4BVEMD4XK2","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7CQPJ4B","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01250","citing_title":"Neural Variance-aware Dueling Bandits with Deep Representation and Shallow Exploration","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A7CQPJ4BVEMD4XK2ZJFBR7DEVC","json":"https://pith.science/pith/A7CQPJ4BVEMD4XK2ZJFBR7DEVC.json","graph_json":"https://pith.science/api/pith-number/A7CQPJ4BVEMD4XK2ZJFBR7DEVC/graph.json","events_json":"https://pith.science/api/pith-number/A7CQPJ4BVEMD4XK2ZJFBR7DEVC/events.json","paper":"https://pith.science/paper/A7CQPJ4B"},"agent_actions":{"view_html":"https://pith.science/pith/A7CQPJ4BVEMD4XK2ZJFBR7DEVC","download_json":"https://pith.science/pith/A7CQPJ4BVEMD4XK2ZJFBR7DEVC.json","view_paper":"https://pith.science/paper/A7CQPJ4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02077&json=true","fetch_graph":"https://pith.science/api/pith-number/A7CQPJ4BVEMD4XK2ZJFBR7DEVC/graph.json","fetch_events":"https://pith.science/api/pith-number/A7CQPJ4BVEMD4XK2ZJFBR7DEVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7CQPJ4BVEMD4XK2ZJFBR7DEVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7CQPJ4BVEMD4XK2ZJFBR7DEVC/action/storage_attestation","attest_author":"https://pith.science/pith/A7CQPJ4BVEMD4XK2ZJFBR7DEVC/action/author_attestation","sign_citation":"https://pith.science/pith/A7CQPJ4BVEMD4XK2ZJFBR7DEVC/action/citation_signature","submit_replication":"https://pith.science/pith/A7CQPJ4BVEMD4XK2ZJFBR7DEVC/action/replication_record"}},"created_at":"2026-05-18T01:12:44.657269+00:00","updated_at":"2026-05-18T01:12:44.657269+00:00"}