{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:B4UGMQ5U5NZH7NTRGF7QDZLS74","short_pith_number":"pith:B4UGMQ5U","schema_version":"1.0","canonical_sha256":"0f286643b4eb727fb671317f01e572ff2ac527331e7871eb716e30470fe23307","source":{"kind":"arxiv","id":"1706.06066","version":3},"attestation_state":"computed","paper":{"title":"On Quadratic Convergence of DC Proximal Newton Algorithm for Nonconvex Sparse Learning in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Jarvis Haupt, Jason Ge, Lin F. Yang, Tong Zhang, Tuo Zhao, Xingguo Li","submitted_at":"2017-06-19T17:15:47Z","abstract_excerpt":"We propose a DC proximal Newton algorithm for solving nonconvex regularized sparse learning problems in high dimensions. Our proposed algorithm integrates the proximal Newton algorithm with multi-stage convex relaxation based on the difference of convex (DC) programming, and enjoys both strong computational and statistical guarantees. Specifically, by leveraging a sophisticated characterization of sparse modeling structures/assumptions (i.e., local restricted strong convexity and Hessian smoothness), we prove that within each stage of convex relaxation, our proposed algorithm achieves (local) "},"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":"1706.06066","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-19T17:15:47Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"95f545d4cf1fdacaec94ff9b81c725c63dabf7a1c270223cc0ed2a646fcae05b","abstract_canon_sha256":"ffba1df1ccd29befc214149911b43ad1826a19f0b65d7ec20c2f685ee0e8da4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:16.816989Z","signature_b64":"kMCjAS7TQQMtagZZ+C5pAooRtOoW1pGW7PEgZ56QHFJmrgaPfzMPKkerQkTK7nhAbkIC7yqz/9Y5CdCSLX2jBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f286643b4eb727fb671317f01e572ff2ac527331e7871eb716e30470fe23307","last_reissued_at":"2026-05-18T00:23:16.816255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:16.816255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Quadratic Convergence of DC Proximal Newton Algorithm for Nonconvex Sparse Learning in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Jarvis Haupt, Jason Ge, Lin F. Yang, Tong Zhang, Tuo Zhao, Xingguo Li","submitted_at":"2017-06-19T17:15:47Z","abstract_excerpt":"We propose a DC proximal Newton algorithm for solving nonconvex regularized sparse learning problems in high dimensions. Our proposed algorithm integrates the proximal Newton algorithm with multi-stage convex relaxation based on the difference of convex (DC) programming, and enjoys both strong computational and statistical guarantees. Specifically, by leveraging a sophisticated characterization of sparse modeling structures/assumptions (i.e., local restricted strong convexity and Hessian smoothness), we prove that within each stage of convex relaxation, our proposed algorithm achieves (local) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06066","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":"1706.06066","created_at":"2026-05-18T00:23:16.816379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06066v3","created_at":"2026-05-18T00:23:16.816379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06066","created_at":"2026-05-18T00:23:16.816379+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4UGMQ5U5NZH","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4UGMQ5U5NZH7NTR","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4UGMQ5U","created_at":"2026-05-18T12:31:08.081275+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/B4UGMQ5U5NZH7NTRGF7QDZLS74","json":"https://pith.science/pith/B4UGMQ5U5NZH7NTRGF7QDZLS74.json","graph_json":"https://pith.science/api/pith-number/B4UGMQ5U5NZH7NTRGF7QDZLS74/graph.json","events_json":"https://pith.science/api/pith-number/B4UGMQ5U5NZH7NTRGF7QDZLS74/events.json","paper":"https://pith.science/paper/B4UGMQ5U"},"agent_actions":{"view_html":"https://pith.science/pith/B4UGMQ5U5NZH7NTRGF7QDZLS74","download_json":"https://pith.science/pith/B4UGMQ5U5NZH7NTRGF7QDZLS74.json","view_paper":"https://pith.science/paper/B4UGMQ5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06066&json=true","fetch_graph":"https://pith.science/api/pith-number/B4UGMQ5U5NZH7NTRGF7QDZLS74/graph.json","fetch_events":"https://pith.science/api/pith-number/B4UGMQ5U5NZH7NTRGF7QDZLS74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4UGMQ5U5NZH7NTRGF7QDZLS74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4UGMQ5U5NZH7NTRGF7QDZLS74/action/storage_attestation","attest_author":"https://pith.science/pith/B4UGMQ5U5NZH7NTRGF7QDZLS74/action/author_attestation","sign_citation":"https://pith.science/pith/B4UGMQ5U5NZH7NTRGF7QDZLS74/action/citation_signature","submit_replication":"https://pith.science/pith/B4UGMQ5U5NZH7NTRGF7QDZLS74/action/replication_record"}},"created_at":"2026-05-18T00:23:16.816379+00:00","updated_at":"2026-05-18T00:23:16.816379+00:00"}