{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7F4D2XQWASVL7BRIM74HRO2BXG","short_pith_number":"pith:7F4D2XQW","schema_version":"1.0","canonical_sha256":"f9783d5e1604aabf862867f878bb41b9af83ce09802b7f9d6092fb6da99fadbe","source":{"kind":"arxiv","id":"2402.08493","version":1},"attestation_state":"computed","paper":{"title":"Sparsity via Sparse Group $k$-max Regularization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Johan A.K. Suykens, Jun Xu, Qinghua Tao, Xiangming Xi","submitted_at":"2024-02-13T14:41:28Z","abstract_excerpt":"For the linear inverse problem with sparsity constraints, the $l_0$ regularized problem is NP-hard, and existing approaches either utilize greedy algorithms to find almost-optimal solutions or to approximate the $l_0$ regularization with its convex counterparts. In this paper, we propose a novel and concise regularization, namely the sparse group $k$-max regularization, which can not only simultaneously enhance the group-wise and in-group sparsity, but also casts no additional restraints on the magnitude of variables in each group, which is especially important for variables at different scale"},"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":"2402.08493","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-13T14:41:28Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d1e61eef2c56f9b81c4b72cccaa808d63263f15f40fca8b9d5be9951fe36fb3f","abstract_canon_sha256":"171929a70dc028113627e09edffecacea011b290b88a33b7d9cdd305ad1ca87e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:47.627758Z","signature_b64":"Jm9DeAucz0q7/0PVCA4zJgIt+HsL3RBbGYPSfEydsvgssZ7itFyktWdAAa5HqNH6+DyxJ93ZLZWgoQlmwKrMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9783d5e1604aabf862867f878bb41b9af83ce09802b7f9d6092fb6da99fadbe","last_reissued_at":"2026-07-05T07:44:47.627271Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:47.627271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsity via Sparse Group $k$-max Regularization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Johan A.K. Suykens, Jun Xu, Qinghua Tao, Xiangming Xi","submitted_at":"2024-02-13T14:41:28Z","abstract_excerpt":"For the linear inverse problem with sparsity constraints, the $l_0$ regularized problem is NP-hard, and existing approaches either utilize greedy algorithms to find almost-optimal solutions or to approximate the $l_0$ regularization with its convex counterparts. In this paper, we propose a novel and concise regularization, namely the sparse group $k$-max regularization, which can not only simultaneously enhance the group-wise and in-group sparsity, but also casts no additional restraints on the magnitude of variables in each group, which is especially important for variables at different scale"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08493","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/2402.08493/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":"2402.08493","created_at":"2026-07-05T07:44:47.627338+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.08493v1","created_at":"2026-07-05T07:44:47.627338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08493","created_at":"2026-07-05T07:44:47.627338+00:00"},{"alias_kind":"pith_short_12","alias_value":"7F4D2XQWASVL","created_at":"2026-07-05T07:44:47.627338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7F4D2XQWASVL7BRI","created_at":"2026-07-05T07:44:47.627338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7F4D2XQW","created_at":"2026-07-05T07:44:47.627338+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/7F4D2XQWASVL7BRIM74HRO2BXG","json":"https://pith.science/pith/7F4D2XQWASVL7BRIM74HRO2BXG.json","graph_json":"https://pith.science/api/pith-number/7F4D2XQWASVL7BRIM74HRO2BXG/graph.json","events_json":"https://pith.science/api/pith-number/7F4D2XQWASVL7BRIM74HRO2BXG/events.json","paper":"https://pith.science/paper/7F4D2XQW"},"agent_actions":{"view_html":"https://pith.science/pith/7F4D2XQWASVL7BRIM74HRO2BXG","download_json":"https://pith.science/pith/7F4D2XQWASVL7BRIM74HRO2BXG.json","view_paper":"https://pith.science/paper/7F4D2XQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.08493&json=true","fetch_graph":"https://pith.science/api/pith-number/7F4D2XQWASVL7BRIM74HRO2BXG/graph.json","fetch_events":"https://pith.science/api/pith-number/7F4D2XQWASVL7BRIM74HRO2BXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7F4D2XQWASVL7BRIM74HRO2BXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7F4D2XQWASVL7BRIM74HRO2BXG/action/storage_attestation","attest_author":"https://pith.science/pith/7F4D2XQWASVL7BRIM74HRO2BXG/action/author_attestation","sign_citation":"https://pith.science/pith/7F4D2XQWASVL7BRIM74HRO2BXG/action/citation_signature","submit_replication":"https://pith.science/pith/7F4D2XQWASVL7BRIM74HRO2BXG/action/replication_record"}},"created_at":"2026-07-05T07:44:47.627338+00:00","updated_at":"2026-07-05T07:44:47.627338+00:00"}