{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UAF4UEBF2EHN2LLOORH44STDLK","short_pith_number":"pith:UAF4UEBF","schema_version":"1.0","canonical_sha256":"a00bca1025d10edd2d6e744fce4a635a8002f4c439667253d49393306a9ace30","source":{"kind":"arxiv","id":"1603.07117","version":2},"attestation_state":"computed","paper":{"title":"A Proximal Point Algorithm for Minimum Divergence Estimators with Application to Mixture Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Diaa Al Mohamad, Michel Broniatowski","submitted_at":"2016-03-23T10:19:16Z","abstract_excerpt":"Estimators derived from a divergence criterion such as $\\varphi-$divergences are generally more robust than the maximum likelihood ones. We are interested in particular in the so-called MD$\\varphi$DE, an estimator built using a dual representation of $\\varphi$--divergences. We present in this paper an iterative proximal point algorithm which permits to calculate such estimator. This algorithm contains by its construction the well-known EM algorithm. Our work is based on the paper of \\citep{Tseng} on the likelihood function. We provide several convergence properties of the sequence generated by"},"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":"1603.07117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-03-23T10:19:16Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"a7a3db6c43b37319892fc3652ea6f9dbaa3357216b064e8f863e78d03535d765","abstract_canon_sha256":"9133131bf5e470eb7ecccf496866630ec408d653eadaace2e72586cd34ab2bb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:34.343959Z","signature_b64":"b9PcGDVARzsc3SqfwFNvICj4hP5yVMTk7SacD023wuAzjsNsotbDbA4HukdTY2mzidy/KJ+wfUbWBP8HJvkDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a00bca1025d10edd2d6e744fce4a635a8002f4c439667253d49393306a9ace30","last_reissued_at":"2026-05-18T01:12:34.343443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:34.343443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proximal Point Algorithm for Minimum Divergence Estimators with Application to Mixture Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Diaa Al Mohamad, Michel Broniatowski","submitted_at":"2016-03-23T10:19:16Z","abstract_excerpt":"Estimators derived from a divergence criterion such as $\\varphi-$divergences are generally more robust than the maximum likelihood ones. We are interested in particular in the so-called MD$\\varphi$DE, an estimator built using a dual representation of $\\varphi$--divergences. We present in this paper an iterative proximal point algorithm which permits to calculate such estimator. This algorithm contains by its construction the well-known EM algorithm. Our work is based on the paper of \\citep{Tseng} on the likelihood function. We provide several convergence properties of the sequence generated by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07117","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":"1603.07117","created_at":"2026-05-18T01:12:34.343520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.07117v2","created_at":"2026-05-18T01:12:34.343520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07117","created_at":"2026-05-18T01:12:34.343520+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAF4UEBF2EHN","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAF4UEBF2EHN2LLO","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAF4UEBF","created_at":"2026-05-18T12:30:46.583412+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/UAF4UEBF2EHN2LLOORH44STDLK","json":"https://pith.science/pith/UAF4UEBF2EHN2LLOORH44STDLK.json","graph_json":"https://pith.science/api/pith-number/UAF4UEBF2EHN2LLOORH44STDLK/graph.json","events_json":"https://pith.science/api/pith-number/UAF4UEBF2EHN2LLOORH44STDLK/events.json","paper":"https://pith.science/paper/UAF4UEBF"},"agent_actions":{"view_html":"https://pith.science/pith/UAF4UEBF2EHN2LLOORH44STDLK","download_json":"https://pith.science/pith/UAF4UEBF2EHN2LLOORH44STDLK.json","view_paper":"https://pith.science/paper/UAF4UEBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.07117&json=true","fetch_graph":"https://pith.science/api/pith-number/UAF4UEBF2EHN2LLOORH44STDLK/graph.json","fetch_events":"https://pith.science/api/pith-number/UAF4UEBF2EHN2LLOORH44STDLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAF4UEBF2EHN2LLOORH44STDLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAF4UEBF2EHN2LLOORH44STDLK/action/storage_attestation","attest_author":"https://pith.science/pith/UAF4UEBF2EHN2LLOORH44STDLK/action/author_attestation","sign_citation":"https://pith.science/pith/UAF4UEBF2EHN2LLOORH44STDLK/action/citation_signature","submit_replication":"https://pith.science/pith/UAF4UEBF2EHN2LLOORH44STDLK/action/replication_record"}},"created_at":"2026-05-18T01:12:34.343520+00:00","updated_at":"2026-05-18T01:12:34.343520+00:00"}