{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:76NGBGKDGXWPPQZ66QVCEPFEAI","short_pith_number":"pith:76NGBGKD","schema_version":"1.0","canonical_sha256":"ff9a60994335ecf7c33ef42a223ca4023841f351d99a0307a9c4a2b4fc47fd92","source":{"kind":"arxiv","id":"1711.05246","version":2},"attestation_state":"computed","paper":{"title":"Loss Functions for Multiset Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Jialin Mao, Kyunghyun Cho, Sean Welleck, Yu Gai, Zheng Zhang, Zixin Yao","submitted_at":"2017-11-14T18:43:22Z","abstract_excerpt":"We study the problem of multiset prediction. The goal of multiset prediction is to train a predictor that maps an input to a multiset consisting of multiple items. Unlike existing problems in supervised learning, such as classification, ranking and sequence generation, there is no known order among items in a target multiset, and each item in the multiset may appear more than once, making this problem extremely challenging. In this paper, we propose a novel multiset loss function by viewing this problem from the perspective of sequential decision making. The proposed multiset loss function is "},"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":"1711.05246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-14T18:43:22Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"4cedaa8af07e9c8c1f3cf7f8fb64ac7f95378192539ccb8572f72d58da4bc644","abstract_canon_sha256":"5b91876beac11534d454fdf994ba185ecf3e8f5ec43a6fc24d783a4bdbb4392a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:18.392273Z","signature_b64":"1PUpWbjuf9zKWDqn8GEbQsZa06b/vFwz34F0RcoV8Hjz4kT7RtcHcovaxnxYflx7k3CnXKWZy51BLbfPpfPCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff9a60994335ecf7c33ef42a223ca4023841f351d99a0307a9c4a2b4fc47fd92","last_reissued_at":"2026-05-18T00:02:18.391634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:18.391634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Loss Functions for Multiset Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Jialin Mao, Kyunghyun Cho, Sean Welleck, Yu Gai, Zheng Zhang, Zixin Yao","submitted_at":"2017-11-14T18:43:22Z","abstract_excerpt":"We study the problem of multiset prediction. The goal of multiset prediction is to train a predictor that maps an input to a multiset consisting of multiple items. Unlike existing problems in supervised learning, such as classification, ranking and sequence generation, there is no known order among items in a target multiset, and each item in the multiset may appear more than once, making this problem extremely challenging. In this paper, we propose a novel multiset loss function by viewing this problem from the perspective of sequential decision making. The proposed multiset loss function is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05246","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":"1711.05246","created_at":"2026-05-18T00:02:18.391711+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.05246v2","created_at":"2026-05-18T00:02:18.391711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05246","created_at":"2026-05-18T00:02:18.391711+00:00"},{"alias_kind":"pith_short_12","alias_value":"76NGBGKDGXWP","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"76NGBGKDGXWPPQZ6","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"76NGBGKD","created_at":"2026-05-18T12:31:03.183658+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/76NGBGKDGXWPPQZ66QVCEPFEAI","json":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI.json","graph_json":"https://pith.science/api/pith-number/76NGBGKDGXWPPQZ66QVCEPFEAI/graph.json","events_json":"https://pith.science/api/pith-number/76NGBGKDGXWPPQZ66QVCEPFEAI/events.json","paper":"https://pith.science/paper/76NGBGKD"},"agent_actions":{"view_html":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI","download_json":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI.json","view_paper":"https://pith.science/paper/76NGBGKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.05246&json=true","fetch_graph":"https://pith.science/api/pith-number/76NGBGKDGXWPPQZ66QVCEPFEAI/graph.json","fetch_events":"https://pith.science/api/pith-number/76NGBGKDGXWPPQZ66QVCEPFEAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI/action/storage_attestation","attest_author":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI/action/author_attestation","sign_citation":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI/action/citation_signature","submit_replication":"https://pith.science/pith/76NGBGKDGXWPPQZ66QVCEPFEAI/action/replication_record"}},"created_at":"2026-05-18T00:02:18.391711+00:00","updated_at":"2026-05-18T00:02:18.391711+00:00"}