{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:L2OU7VMAOBY33IDEOPGCP2BAKP","short_pith_number":"pith:L2OU7VMA","schema_version":"1.0","canonical_sha256":"5e9d4fd5807071bda06473cc27e82053fb176d9f75609273bd0ce619b03a6dd9","source":{"kind":"arxiv","id":"1411.1088","version":1},"attestation_state":"computed","paper":{"title":"Expectation-Maximization for Learning Determinantal Point Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alex Kulesza, Ben Taskar, Emily Fox, Jennifer Gillenwater","submitted_at":"2014-11-04T21:23:35Z","abstract_excerpt":"A determinantal point process (DPP) is a probabilistic model of set diversity compactly parameterized by a positive semi-definite kernel matrix. To fit a DPP to a given task, we would like to learn the entries of its kernel matrix by maximizing the log-likelihood of the available data. However, log-likelihood is non-convex in the entries of the kernel matrix, and this learning problem is conjectured to be NP-hard. Thus, previous work has instead focused on more restricted convex learning settings: learning only a single weight for each row of the kernel matrix, or learning weights for a linear"},"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":"1411.1088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-04T21:23:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4f7e90a69a0c2de457ca984ccc67636f75bff763447f402cc7e5fdf994dad241","abstract_canon_sha256":"392ee10f9aff5b174ab28bfccc1f1f7cfc6b20a0ed9e0ce6d75ba0d8c4373078"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:36.344096Z","signature_b64":"R5H+Z9vNr3rcqKmfyD0ItlDR5OtIRTMvvEhc5QBcpxhAdRP4JOqLv3CUkXB7nI+FJ9WdlxfAVbVulPAIxv8pCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e9d4fd5807071bda06473cc27e82053fb176d9f75609273bd0ce619b03a6dd9","last_reissued_at":"2026-05-18T02:38:36.343591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:36.343591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expectation-Maximization for Learning Determinantal Point Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alex Kulesza, Ben Taskar, Emily Fox, Jennifer Gillenwater","submitted_at":"2014-11-04T21:23:35Z","abstract_excerpt":"A determinantal point process (DPP) is a probabilistic model of set diversity compactly parameterized by a positive semi-definite kernel matrix. To fit a DPP to a given task, we would like to learn the entries of its kernel matrix by maximizing the log-likelihood of the available data. However, log-likelihood is non-convex in the entries of the kernel matrix, and this learning problem is conjectured to be NP-hard. Thus, previous work has instead focused on more restricted convex learning settings: learning only a single weight for each row of the kernel matrix, or learning weights for a linear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1088","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":"1411.1088","created_at":"2026-05-18T02:38:36.343664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1088v1","created_at":"2026-05-18T02:38:36.343664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1088","created_at":"2026-05-18T02:38:36.343664+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2OU7VMAOBY3","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2OU7VMAOBY33IDE","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2OU7VMA","created_at":"2026-05-18T12:28:35.611951+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/L2OU7VMAOBY33IDEOPGCP2BAKP","json":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP.json","graph_json":"https://pith.science/api/pith-number/L2OU7VMAOBY33IDEOPGCP2BAKP/graph.json","events_json":"https://pith.science/api/pith-number/L2OU7VMAOBY33IDEOPGCP2BAKP/events.json","paper":"https://pith.science/paper/L2OU7VMA"},"agent_actions":{"view_html":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP","download_json":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP.json","view_paper":"https://pith.science/paper/L2OU7VMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1088&json=true","fetch_graph":"https://pith.science/api/pith-number/L2OU7VMAOBY33IDEOPGCP2BAKP/graph.json","fetch_events":"https://pith.science/api/pith-number/L2OU7VMAOBY33IDEOPGCP2BAKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP/action/storage_attestation","attest_author":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP/action/author_attestation","sign_citation":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP/action/citation_signature","submit_replication":"https://pith.science/pith/L2OU7VMAOBY33IDEOPGCP2BAKP/action/replication_record"}},"created_at":"2026-05-18T02:38:36.343664+00:00","updated_at":"2026-05-18T02:38:36.343664+00:00"}