{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4V6KC6PAYNRBUM46HKSP4AUXJV","short_pith_number":"pith:4V6KC6PA","schema_version":"1.0","canonical_sha256":"e57ca179e0c3621a339e3aa4fe02974d61b883f864bf68ebfaf6ed60817bbb56","source":{"kind":"arxiv","id":"1903.11460","version":3},"attestation_state":"computed","paper":{"title":"A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Chengjing Wang, Defeng Sun, Kim-Chuan Toh, Peipei Tang","submitted_at":"2019-03-27T14:51:35Z","abstract_excerpt":"In this paper, we consider high-dimensional nonconvex square-root-loss regression problems and introduce a proximal majorization-minimization (PMM) algorithm for these problems. Our key idea for making the proposed PMM to be efficient is to develop a sparse semismooth Newton method to solve the corresponding subproblems. By using the Kurdyka-{\\L}ojasiewicz property exhibited in the underlining problems, we prove that the PMM algorithm converges to a d-stationary point. We also analyze the oracle property of the initial subproblem used in our algorithm. Extensive numerical experiments are prese"},"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":"1903.11460","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-27T14:51:35Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","stat.CO","stat.ML"],"title_canon_sha256":"703436179ed2084c4a260511fac2c423e689ea2d7bdd76afbfeeec4f47c7347e","abstract_canon_sha256":"7d13491276fa93632d3ee706f67c39c67e0e1f4cbde15b169fc1b55c8c65b646"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:06:07.429217Z","signature_b64":"CJDZXXFsgHvPWSPJxSwVMtZ2lf1oP6x+ihCfdQLkc7NyHMEfs+M6cloEDA1QflAaQnB1Yx4kBcqti2YtxAQQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e57ca179e0c3621a339e3aa4fe02974d61b883f864bf68ebfaf6ed60817bbb56","last_reissued_at":"2026-07-05T01:06:07.428757Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:06:07.428757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Chengjing Wang, Defeng Sun, Kim-Chuan Toh, Peipei Tang","submitted_at":"2019-03-27T14:51:35Z","abstract_excerpt":"In this paper, we consider high-dimensional nonconvex square-root-loss regression problems and introduce a proximal majorization-minimization (PMM) algorithm for these problems. Our key idea for making the proposed PMM to be efficient is to develop a sparse semismooth Newton method to solve the corresponding subproblems. By using the Kurdyka-{\\L}ojasiewicz property exhibited in the underlining problems, we prove that the PMM algorithm converges to a d-stationary point. We also analyze the oracle property of the initial subproblem used in our algorithm. Extensive numerical experiments are prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11460","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.11460/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":"1903.11460","created_at":"2026-07-05T01:06:07.428813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11460v3","created_at":"2026-07-05T01:06:07.428813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11460","created_at":"2026-07-05T01:06:07.428813+00:00"},{"alias_kind":"pith_short_12","alias_value":"4V6KC6PAYNRB","created_at":"2026-07-05T01:06:07.428813+00:00"},{"alias_kind":"pith_short_16","alias_value":"4V6KC6PAYNRBUM46","created_at":"2026-07-05T01:06:07.428813+00:00"},{"alias_kind":"pith_short_8","alias_value":"4V6KC6PA","created_at":"2026-07-05T01:06:07.428813+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/4V6KC6PAYNRBUM46HKSP4AUXJV","json":"https://pith.science/pith/4V6KC6PAYNRBUM46HKSP4AUXJV.json","graph_json":"https://pith.science/api/pith-number/4V6KC6PAYNRBUM46HKSP4AUXJV/graph.json","events_json":"https://pith.science/api/pith-number/4V6KC6PAYNRBUM46HKSP4AUXJV/events.json","paper":"https://pith.science/paper/4V6KC6PA"},"agent_actions":{"view_html":"https://pith.science/pith/4V6KC6PAYNRBUM46HKSP4AUXJV","download_json":"https://pith.science/pith/4V6KC6PAYNRBUM46HKSP4AUXJV.json","view_paper":"https://pith.science/paper/4V6KC6PA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11460&json=true","fetch_graph":"https://pith.science/api/pith-number/4V6KC6PAYNRBUM46HKSP4AUXJV/graph.json","fetch_events":"https://pith.science/api/pith-number/4V6KC6PAYNRBUM46HKSP4AUXJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4V6KC6PAYNRBUM46HKSP4AUXJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4V6KC6PAYNRBUM46HKSP4AUXJV/action/storage_attestation","attest_author":"https://pith.science/pith/4V6KC6PAYNRBUM46HKSP4AUXJV/action/author_attestation","sign_citation":"https://pith.science/pith/4V6KC6PAYNRBUM46HKSP4AUXJV/action/citation_signature","submit_replication":"https://pith.science/pith/4V6KC6PAYNRBUM46HKSP4AUXJV/action/replication_record"}},"created_at":"2026-07-05T01:06:07.428813+00:00","updated_at":"2026-07-05T01:06:07.428813+00:00"}