{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:J77EZERGLGAN7AWGLHA7LUJUZX","short_pith_number":"pith:J77EZERG","schema_version":"1.0","canonical_sha256":"4ffe4c92265980df82c659c1f5d134cdd796a2e346a6865bda51e224ab3d5007","source":{"kind":"arxiv","id":"1009.2111","version":2},"attestation_state":"computed","paper":{"title":"How Many Iterations are Sufficient for Semiparametric Estimation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Guang Cheng","submitted_at":"2010-09-10T22:04:20Z","abstract_excerpt":"A common practice in obtaining a semiparametric efficient estimate is through iteratively maximizing the (penalized) log-likelihood w.r.t. its Euclidean parameter and functional nuisance parameter via Newton-Raphson algorithm. The purpose of this paper is to provide a formula in calculating the minimal number of iterations $k^\\ast$ needed to produce an efficient estimate $\\hat\\theta_n^{(k^\\ast)}$ from a theoretical point of view. We discover that (a) $k^\\ast$ depends on the convergence rates of the initial estimate and nuisance estimate; (b) more than $k^\\ast$ iterations, i.e., $k$, will only "},"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":"1009.2111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-09-10T22:04:20Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"3fcfdcad7510d89d705bf855b6738b919581776fde95688d9b84f258d7430eac","abstract_canon_sha256":"311d522c84bf8da5b71459be68184d31b5d561931b0e5e07cecb7ab51fc0f211"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:33.819157Z","signature_b64":"bh7qHa2nvLzG3Db4o8TwCcpeFgcUy9ZSyFeBD6Y8gxSos9mP7Livdt3uF7w06Tl/seYafbjsJXP/hdNTJKsEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ffe4c92265980df82c659c1f5d134cdd796a2e346a6865bda51e224ab3d5007","last_reissued_at":"2026-05-18T04:40:33.818647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:33.818647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Many Iterations are Sufficient for Semiparametric Estimation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Guang Cheng","submitted_at":"2010-09-10T22:04:20Z","abstract_excerpt":"A common practice in obtaining a semiparametric efficient estimate is through iteratively maximizing the (penalized) log-likelihood w.r.t. its Euclidean parameter and functional nuisance parameter via Newton-Raphson algorithm. The purpose of this paper is to provide a formula in calculating the minimal number of iterations $k^\\ast$ needed to produce an efficient estimate $\\hat\\theta_n^{(k^\\ast)}$ from a theoretical point of view. We discover that (a) $k^\\ast$ depends on the convergence rates of the initial estimate and nuisance estimate; (b) more than $k^\\ast$ iterations, i.e., $k$, will only "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2111","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":"1009.2111","created_at":"2026-05-18T04:40:33.818725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.2111v2","created_at":"2026-05-18T04:40:33.818725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2111","created_at":"2026-05-18T04:40:33.818725+00:00"},{"alias_kind":"pith_short_12","alias_value":"J77EZERGLGAN","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"J77EZERGLGAN7AWG","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"J77EZERG","created_at":"2026-05-18T12:26:09.077623+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/J77EZERGLGAN7AWGLHA7LUJUZX","json":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX.json","graph_json":"https://pith.science/api/pith-number/J77EZERGLGAN7AWGLHA7LUJUZX/graph.json","events_json":"https://pith.science/api/pith-number/J77EZERGLGAN7AWGLHA7LUJUZX/events.json","paper":"https://pith.science/paper/J77EZERG"},"agent_actions":{"view_html":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX","download_json":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX.json","view_paper":"https://pith.science/paper/J77EZERG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.2111&json=true","fetch_graph":"https://pith.science/api/pith-number/J77EZERGLGAN7AWGLHA7LUJUZX/graph.json","fetch_events":"https://pith.science/api/pith-number/J77EZERGLGAN7AWGLHA7LUJUZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX/action/storage_attestation","attest_author":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX/action/author_attestation","sign_citation":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX/action/citation_signature","submit_replication":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX/action/replication_record"}},"created_at":"2026-05-18T04:40:33.818725+00:00","updated_at":"2026-05-18T04:40:33.818725+00:00"}