{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WAEJL2KMNFDR3R27SFVACPANTW","short_pith_number":"pith:WAEJL2KM","schema_version":"1.0","canonical_sha256":"b00895e94c69471dc75f916a013c0d9d9983cd3bd4ebeeb2c22bf38fdb2f7a35","source":{"kind":"arxiv","id":"2407.17216","version":4},"attestation_state":"computed","paper":{"title":"Alternating Iteratively Reweighted $\\ell_1$ and Subspace Newton Algorithms for Nonconvex Sparse Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Hao Wang, Xiangyu Yang, Yichen Zhu","submitted_at":"2024-07-24T12:15:59Z","abstract_excerpt":"This paper presents a novel hybrid algorithm for minimizing the sum of a continuously differentiable loss function and a nonsmooth, possibly nonconvex, sparse regularization function. The proposed method alternates between solving a reweighted $\\ell_1$-regularized subproblem and performing an inexact subspace Newton step. The reweighted $\\ell_1$-subproblem allows for efficient closed-form solutions via the soft-thresholding operator, avoiding the computational overhead of proximity operator calculations. As the algorithm approaches an optimal solution, it maintains a stable support set, ensuri"},"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":"2407.17216","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-24T12:15:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"59fedbda8d1f71382a332923d73ba3df46444eaf9b33b3af18955be16db00b91","abstract_canon_sha256":"b68d3dfc289ec9632cf95ad4a7e26dcab98dd41aa8719fde044355eaeb40af11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:14.068306Z","signature_b64":"u/yRdNMJqaviW/TszHxaMSitaNEQGWLZKiOXIzDZdNvOASbZI7n01VSwBbxZLmp9EaGsKwSV0jD5L58LY2gZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b00895e94c69471dc75f916a013c0d9d9983cd3bd4ebeeb2c22bf38fdb2f7a35","last_reissued_at":"2026-07-05T10:41:14.067823Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:14.067823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternating Iteratively Reweighted $\\ell_1$ and Subspace Newton Algorithms for Nonconvex Sparse Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Hao Wang, Xiangyu Yang, Yichen Zhu","submitted_at":"2024-07-24T12:15:59Z","abstract_excerpt":"This paper presents a novel hybrid algorithm for minimizing the sum of a continuously differentiable loss function and a nonsmooth, possibly nonconvex, sparse regularization function. The proposed method alternates between solving a reweighted $\\ell_1$-regularized subproblem and performing an inexact subspace Newton step. The reweighted $\\ell_1$-subproblem allows for efficient closed-form solutions via the soft-thresholding operator, avoiding the computational overhead of proximity operator calculations. As the algorithm approaches an optimal solution, it maintains a stable support set, ensuri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.17216","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.17216/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2407.17216","created_at":"2026-07-05T10:41:14.067884+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.17216v4","created_at":"2026-07-05T10:41:14.067884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.17216","created_at":"2026-07-05T10:41:14.067884+00:00"},{"alias_kind":"pith_short_12","alias_value":"WAEJL2KMNFDR","created_at":"2026-07-05T10:41:14.067884+00:00"},{"alias_kind":"pith_short_16","alias_value":"WAEJL2KMNFDR3R27","created_at":"2026-07-05T10:41:14.067884+00:00"},{"alias_kind":"pith_short_8","alias_value":"WAEJL2KM","created_at":"2026-07-05T10:41:14.067884+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24600","citing_title":"Bridging Identification and Second-Order Acceleration: A Fast Alternating Minimization Framework for Composite Optimization","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WAEJL2KMNFDR3R27SFVACPANTW","json":"https://pith.science/pith/WAEJL2KMNFDR3R27SFVACPANTW.json","graph_json":"https://pith.science/api/pith-number/WAEJL2KMNFDR3R27SFVACPANTW/graph.json","events_json":"https://pith.science/api/pith-number/WAEJL2KMNFDR3R27SFVACPANTW/events.json","paper":"https://pith.science/paper/WAEJL2KM"},"agent_actions":{"view_html":"https://pith.science/pith/WAEJL2KMNFDR3R27SFVACPANTW","download_json":"https://pith.science/pith/WAEJL2KMNFDR3R27SFVACPANTW.json","view_paper":"https://pith.science/paper/WAEJL2KM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.17216&json=true","fetch_graph":"https://pith.science/api/pith-number/WAEJL2KMNFDR3R27SFVACPANTW/graph.json","fetch_events":"https://pith.science/api/pith-number/WAEJL2KMNFDR3R27SFVACPANTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WAEJL2KMNFDR3R27SFVACPANTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WAEJL2KMNFDR3R27SFVACPANTW/action/storage_attestation","attest_author":"https://pith.science/pith/WAEJL2KMNFDR3R27SFVACPANTW/action/author_attestation","sign_citation":"https://pith.science/pith/WAEJL2KMNFDR3R27SFVACPANTW/action/citation_signature","submit_replication":"https://pith.science/pith/WAEJL2KMNFDR3R27SFVACPANTW/action/replication_record"}},"created_at":"2026-07-05T10:41:14.067884+00:00","updated_at":"2026-07-05T10:41:14.067884+00:00"}