{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UBPSQX4JUR35EPNI5D3Z7N5BBM","short_pith_number":"pith:UBPSQX4J","schema_version":"1.0","canonical_sha256":"a05f285f89a477d23da8e8f79fb7a10b127f818493d0410496c1decfd16fee0f","source":{"kind":"arxiv","id":"1507.01037","version":3},"attestation_state":"computed","paper":{"title":"I-LAMM for Sparse Learning: Simultaneous Control of Algorithmic Complexity and Statistical Error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Han Liu, Jianqing Fan, Qiang Sun, Tong Zhang","submitted_at":"2015-07-03T21:44:43Z","abstract_excerpt":"We propose a computational framework named iterative local adaptive majorize-minimization (I-LAMM) to simultaneously control algorithmic complexity and statistical error when fitting high dimensional models. I-LAMM is a two-stage algorithmic implementation of the local linear approximation to a family of folded concave penalized quasi-likelihood. The first stage solves a convex program with a crude precision tolerance to obtain a coarse initial estimator, which is further refined in the second stage by iteratively solving a sequence of convex programs with smaller precision tolerances. Theoret"},"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":"1507.01037","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-03T21:44:43Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"15aebf4cae2bf7e3551f729d169b9f4229911df5de71b9751a47fd3b012461eb","abstract_canon_sha256":"7b663d5ed964f1a6f9c912df7828064163468145d0dabe5f3111e2cc75cb3276"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:59.863347Z","signature_b64":"gK0vWbUt9PPhxMLEINwrnERylalBhdAPdNWE6oUuH+VjBGJfPqoRFa5JyAdkTsv1q52St7+84twHnQ5DWrnWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a05f285f89a477d23da8e8f79fb7a10b127f818493d0410496c1decfd16fee0f","last_reissued_at":"2026-05-18T00:46:59.862740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:59.862740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"I-LAMM for Sparse Learning: Simultaneous Control of Algorithmic Complexity and Statistical Error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Han Liu, Jianqing Fan, Qiang Sun, Tong Zhang","submitted_at":"2015-07-03T21:44:43Z","abstract_excerpt":"We propose a computational framework named iterative local adaptive majorize-minimization (I-LAMM) to simultaneously control algorithmic complexity and statistical error when fitting high dimensional models. I-LAMM is a two-stage algorithmic implementation of the local linear approximation to a family of folded concave penalized quasi-likelihood. The first stage solves a convex program with a crude precision tolerance to obtain a coarse initial estimator, which is further refined in the second stage by iteratively solving a sequence of convex programs with smaller precision tolerances. Theoret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01037","kind":"arxiv","version":3},"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":"1507.01037","created_at":"2026-05-18T00:46:59.862821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01037v3","created_at":"2026-05-18T00:46:59.862821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01037","created_at":"2026-05-18T00:46:59.862821+00:00"},{"alias_kind":"pith_short_12","alias_value":"UBPSQX4JUR35","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UBPSQX4JUR35EPNI","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UBPSQX4J","created_at":"2026-05-18T12:29:44.643036+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/UBPSQX4JUR35EPNI5D3Z7N5BBM","json":"https://pith.science/pith/UBPSQX4JUR35EPNI5D3Z7N5BBM.json","graph_json":"https://pith.science/api/pith-number/UBPSQX4JUR35EPNI5D3Z7N5BBM/graph.json","events_json":"https://pith.science/api/pith-number/UBPSQX4JUR35EPNI5D3Z7N5BBM/events.json","paper":"https://pith.science/paper/UBPSQX4J"},"agent_actions":{"view_html":"https://pith.science/pith/UBPSQX4JUR35EPNI5D3Z7N5BBM","download_json":"https://pith.science/pith/UBPSQX4JUR35EPNI5D3Z7N5BBM.json","view_paper":"https://pith.science/paper/UBPSQX4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01037&json=true","fetch_graph":"https://pith.science/api/pith-number/UBPSQX4JUR35EPNI5D3Z7N5BBM/graph.json","fetch_events":"https://pith.science/api/pith-number/UBPSQX4JUR35EPNI5D3Z7N5BBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UBPSQX4JUR35EPNI5D3Z7N5BBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UBPSQX4JUR35EPNI5D3Z7N5BBM/action/storage_attestation","attest_author":"https://pith.science/pith/UBPSQX4JUR35EPNI5D3Z7N5BBM/action/author_attestation","sign_citation":"https://pith.science/pith/UBPSQX4JUR35EPNI5D3Z7N5BBM/action/citation_signature","submit_replication":"https://pith.science/pith/UBPSQX4JUR35EPNI5D3Z7N5BBM/action/replication_record"}},"created_at":"2026-05-18T00:46:59.862821+00:00","updated_at":"2026-05-18T00:46:59.862821+00:00"}