{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UNSEYU434UQQGRMDLTMIYEHNK2","short_pith_number":"pith:UNSEYU43","schema_version":"1.0","canonical_sha256":"a3644c539be5210345835cd88c10ed56bd31940eab584e50b8d0921c2650c51e","source":{"kind":"arxiv","id":"2505.23294","version":1},"attestation_state":"computed","paper":{"title":"Group zero-norm regularized robust loss minimization: proximal MM method and statistical error bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ling Liang, Shujun Bi","submitted_at":"2025-05-29T09:46:25Z","abstract_excerpt":"This study focuses on solving group zero-norm regularized robust loss minimization problems. We propose a proximal Majorization-Minimization (PMM) algorithm to address a class of equivalent Difference-of-Convex (DC) surrogate optimization problems. First, we present the core principles and iterative framework of the PMM method. Under the Kurdyka-{\\L}ojasiewicz (KL) property assumption of the potential function, we establish the global convergence of the algorithm and characterize its local (sub)linear convergence rate. Furthermore, for linear observation models with design matrices satisfying "},"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":"2505.23294","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-29T09:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"76fc598fd255e8bbd711081bc23ebb4660f7890da1ec22b4e4579703096af027","abstract_canon_sha256":"aa18f79e09050bef68e9cd392999f0ae9e19d333e5560435b36eda06b7d2a6ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:59.006876Z","signature_b64":"tviqPL5F5N4TGgwiDXj/rwiuMoM7lX8G8M1ZAa5eX2OP1ueX1oQzkp4e9Fe0crblz+qTbhkw+VCoP/ck2remCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3644c539be5210345835cd88c10ed56bd31940eab584e50b8d0921c2650c51e","last_reissued_at":"2026-07-05T11:11:59.006364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:59.006364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group zero-norm regularized robust loss minimization: proximal MM method and statistical error bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ling Liang, Shujun Bi","submitted_at":"2025-05-29T09:46:25Z","abstract_excerpt":"This study focuses on solving group zero-norm regularized robust loss minimization problems. We propose a proximal Majorization-Minimization (PMM) algorithm to address a class of equivalent Difference-of-Convex (DC) surrogate optimization problems. First, we present the core principles and iterative framework of the PMM method. Under the Kurdyka-{\\L}ojasiewicz (KL) property assumption of the potential function, we establish the global convergence of the algorithm and characterize its local (sub)linear convergence rate. Furthermore, for linear observation models with design matrices satisfying "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23294","kind":"arxiv","version":1},"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/2505.23294/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":"2505.23294","created_at":"2026-07-05T11:11:59.006428+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.23294v1","created_at":"2026-07-05T11:11:59.006428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23294","created_at":"2026-07-05T11:11:59.006428+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNSEYU434UQQ","created_at":"2026-07-05T11:11:59.006428+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNSEYU434UQQGRMD","created_at":"2026-07-05T11:11:59.006428+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNSEYU43","created_at":"2026-07-05T11:11:59.006428+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/UNSEYU434UQQGRMDLTMIYEHNK2","json":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2.json","graph_json":"https://pith.science/api/pith-number/UNSEYU434UQQGRMDLTMIYEHNK2/graph.json","events_json":"https://pith.science/api/pith-number/UNSEYU434UQQGRMDLTMIYEHNK2/events.json","paper":"https://pith.science/paper/UNSEYU43"},"agent_actions":{"view_html":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2","download_json":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2.json","view_paper":"https://pith.science/paper/UNSEYU43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.23294&json=true","fetch_graph":"https://pith.science/api/pith-number/UNSEYU434UQQGRMDLTMIYEHNK2/graph.json","fetch_events":"https://pith.science/api/pith-number/UNSEYU434UQQGRMDLTMIYEHNK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2/action/storage_attestation","attest_author":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2/action/author_attestation","sign_citation":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2/action/citation_signature","submit_replication":"https://pith.science/pith/UNSEYU434UQQGRMDLTMIYEHNK2/action/replication_record"}},"created_at":"2026-07-05T11:11:59.006428+00:00","updated_at":"2026-07-05T11:11:59.006428+00:00"}