{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7WRNNEC6BBTUBVAQNV4R73VFXH","short_pith_number":"pith:7WRNNEC6","schema_version":"1.0","canonical_sha256":"fda2d6905e086740d4106d791feea5b9f171b68301b52f32a3d81ea0e32991e5","source":{"kind":"arxiv","id":"1803.06673","version":2},"attestation_state":"computed","paper":{"title":"Damped Anderson acceleration with restarts and monotonicity control for accelerating EM and EM-like algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Nicholas C. Henderson, Ravi Varadhan","submitted_at":"2018-03-18T15:01:22Z","abstract_excerpt":"The expectation-maximization (EM) algorithm is a well-known iterative method for computing maximum likelihood estimates from incomplete data. Despite its numerous advantages, a main drawback of the EM algorithm is its frequently observed slow convergence which often hinders the application of EM algorithms in high-dimensional problems or in other complex settings.To address the need for more rapidly convergent EM algorithms, we describe a new class of acceleration schemes that build on the Anderson acceleration technique for speeding fixed-point iterations. Our approach is effective at greatly"},"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":"1803.06673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-03-18T15:01:22Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"72dc8e5737a9bc0c4adb7c9d3d9b1cf3ddb3717bef1fa76ef606ee25aec4d0bd","abstract_canon_sha256":"28ef21be278a19883d965666ed86fbc1e534537fd661c18d3f1436de5fbe0190"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:20.948065Z","signature_b64":"mq9HS9DQ659GOaepNbFlFhr8vAYSTMQt7DnpGBkQOdmWUh0MBIlIznAapkdxIM3umsu1C2sb7X0BUtidjF7JCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fda2d6905e086740d4106d791feea5b9f171b68301b52f32a3d81ea0e32991e5","last_reissued_at":"2026-05-18T00:08:20.947563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:20.947563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Damped Anderson acceleration with restarts and monotonicity control for accelerating EM and EM-like algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Nicholas C. Henderson, Ravi Varadhan","submitted_at":"2018-03-18T15:01:22Z","abstract_excerpt":"The expectation-maximization (EM) algorithm is a well-known iterative method for computing maximum likelihood estimates from incomplete data. Despite its numerous advantages, a main drawback of the EM algorithm is its frequently observed slow convergence which often hinders the application of EM algorithms in high-dimensional problems or in other complex settings.To address the need for more rapidly convergent EM algorithms, we describe a new class of acceleration schemes that build on the Anderson acceleration technique for speeding fixed-point iterations. Our approach is effective at greatly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06673","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":"1803.06673","created_at":"2026-05-18T00:08:20.947648+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06673v2","created_at":"2026-05-18T00:08:20.947648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06673","created_at":"2026-05-18T00:08:20.947648+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WRNNEC6BBTU","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WRNNEC6BBTUBVAQ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WRNNEC6","created_at":"2026-05-18T12:32:11.075285+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/7WRNNEC6BBTUBVAQNV4R73VFXH","json":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH.json","graph_json":"https://pith.science/api/pith-number/7WRNNEC6BBTUBVAQNV4R73VFXH/graph.json","events_json":"https://pith.science/api/pith-number/7WRNNEC6BBTUBVAQNV4R73VFXH/events.json","paper":"https://pith.science/paper/7WRNNEC6"},"agent_actions":{"view_html":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH","download_json":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH.json","view_paper":"https://pith.science/paper/7WRNNEC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06673&json=true","fetch_graph":"https://pith.science/api/pith-number/7WRNNEC6BBTUBVAQNV4R73VFXH/graph.json","fetch_events":"https://pith.science/api/pith-number/7WRNNEC6BBTUBVAQNV4R73VFXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH/action/storage_attestation","attest_author":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH/action/author_attestation","sign_citation":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH/action/citation_signature","submit_replication":"https://pith.science/pith/7WRNNEC6BBTUBVAQNV4R73VFXH/action/replication_record"}},"created_at":"2026-05-18T00:08:20.947648+00:00","updated_at":"2026-05-18T00:08:20.947648+00:00"}