{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KWPEYDY4VP6KA3FVB5GIYMPWJO","short_pith_number":"pith:KWPEYDY4","schema_version":"1.0","canonical_sha256":"559e4c0f1cabfca06cb50f4c8c31f64b90f137b32fb47d537ed10db5b50cf433","source":{"kind":"arxiv","id":"1701.05009","version":1},"attestation_state":"computed","paper":{"title":"Optimal Kullback-Leibler Aggregation in Mixture Density Estimation by Maximum Likelihood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Arnak S. Dalalyan, Mehdi Sebbar","submitted_at":"2017-01-18T11:07:42Z","abstract_excerpt":"We study the maximum likelihood estimator of density of $n$ independent observations, under the assumption that it is well approximated by a mixture with a large number of components. The main focus is on statistical properties with respect to the Kullback-Leibler loss. We establish risk bounds taking the form of sharp oracle inequalities both in deviation and in expectation. A simple consequence of these bounds is that the maximum likelihood estimator attains the optimal rate $((\\log K)/n)^{1/2}$, up to a possible logarithmic correction, in the problem of convex aggregation when the number $K"},"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":"1701.05009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-01-18T11:07:42Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"6111e0731b84e39ae12e065af87f32d321f28f28475007ccd3522525c970fc51","abstract_canon_sha256":"98106d0c35c38a02a393573d49225aa6586b2fd4cd423b67adcb2a9b23888414"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:33.314736Z","signature_b64":"MxD0+AJSN+3Dvmvh9Ofn9r3a/fR9hnaoqaiXGSYv5CYBZU2w0jx35XYIVRdCVTYLv/tDBQ6+47Q/7xQi3LDWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"559e4c0f1cabfca06cb50f4c8c31f64b90f137b32fb47d537ed10db5b50cf433","last_reissued_at":"2026-05-18T00:52:33.314304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:33.314304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Kullback-Leibler Aggregation in Mixture Density Estimation by Maximum Likelihood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Arnak S. Dalalyan, Mehdi Sebbar","submitted_at":"2017-01-18T11:07:42Z","abstract_excerpt":"We study the maximum likelihood estimator of density of $n$ independent observations, under the assumption that it is well approximated by a mixture with a large number of components. The main focus is on statistical properties with respect to the Kullback-Leibler loss. We establish risk bounds taking the form of sharp oracle inequalities both in deviation and in expectation. A simple consequence of these bounds is that the maximum likelihood estimator attains the optimal rate $((\\log K)/n)^{1/2}$, up to a possible logarithmic correction, in the problem of convex aggregation when the number $K"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05009","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":"1701.05009","created_at":"2026-05-18T00:52:33.314382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05009v1","created_at":"2026-05-18T00:52:33.314382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05009","created_at":"2026-05-18T00:52:33.314382+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWPEYDY4VP6K","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWPEYDY4VP6KA3FV","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWPEYDY4","created_at":"2026-05-18T12:31:28.150371+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/KWPEYDY4VP6KA3FVB5GIYMPWJO","json":"https://pith.science/pith/KWPEYDY4VP6KA3FVB5GIYMPWJO.json","graph_json":"https://pith.science/api/pith-number/KWPEYDY4VP6KA3FVB5GIYMPWJO/graph.json","events_json":"https://pith.science/api/pith-number/KWPEYDY4VP6KA3FVB5GIYMPWJO/events.json","paper":"https://pith.science/paper/KWPEYDY4"},"agent_actions":{"view_html":"https://pith.science/pith/KWPEYDY4VP6KA3FVB5GIYMPWJO","download_json":"https://pith.science/pith/KWPEYDY4VP6KA3FVB5GIYMPWJO.json","view_paper":"https://pith.science/paper/KWPEYDY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05009&json=true","fetch_graph":"https://pith.science/api/pith-number/KWPEYDY4VP6KA3FVB5GIYMPWJO/graph.json","fetch_events":"https://pith.science/api/pith-number/KWPEYDY4VP6KA3FVB5GIYMPWJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWPEYDY4VP6KA3FVB5GIYMPWJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWPEYDY4VP6KA3FVB5GIYMPWJO/action/storage_attestation","attest_author":"https://pith.science/pith/KWPEYDY4VP6KA3FVB5GIYMPWJO/action/author_attestation","sign_citation":"https://pith.science/pith/KWPEYDY4VP6KA3FVB5GIYMPWJO/action/citation_signature","submit_replication":"https://pith.science/pith/KWPEYDY4VP6KA3FVB5GIYMPWJO/action/replication_record"}},"created_at":"2026-05-18T00:52:33.314382+00:00","updated_at":"2026-05-18T00:52:33.314382+00:00"}