{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IJLGQKMMGIYZBOYQ7NXDKCQSC5","short_pith_number":"pith:IJLGQKMM","schema_version":"1.0","canonical_sha256":"425668298c323190bb10fb6e350a12175368bc9abf4f33e09b952070e6a6095d","source":{"kind":"arxiv","id":"1504.00430","version":1},"attestation_state":"computed","paper":{"title":"Direct l_(2,p)-Norm Learning for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Hanyang Peng, Yong Fan","submitted_at":"2015-04-02T02:16:39Z","abstract_excerpt":"In this paper, we propose a novel sparse learning based feature selection method that directly optimizes a large margin linear classification model sparsity with l_(2,p)-norm (0 < p < 1)subject to data-fitting constraints, rather than using the sparsity as a regularization term. To solve the direct sparsity optimization problem that is non-smooth and non-convex when 0<p<1, we provide an efficient iterative algorithm with proved convergence by converting it to a convex and smooth optimization problem at every iteration step. The proposed algorithm has been evaluated based on publicly available "},"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":"1504.00430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-02T02:16:39Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"62302059f0233b7b9a1deac3fef1c74bc56c7546be1eefb1cd1e674660ec1987","abstract_canon_sha256":"c1fbd0dbf6a4b6f8871e140055670b2a8c7ab64efd87fbe04ac43ba00ddd65dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:43.342107Z","signature_b64":"M6b4zBLsudULjrpEIqt4YhSXEGl6mSah3bUTMwAHx/zKKzvC69qwJ12iwinR9dF1M1Kan5LsZ6p3cy5LO7gnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"425668298c323190bb10fb6e350a12175368bc9abf4f33e09b952070e6a6095d","last_reissued_at":"2026-05-18T02:19:43.341670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:43.341670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Direct l_(2,p)-Norm Learning for Feature Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Hanyang Peng, Yong Fan","submitted_at":"2015-04-02T02:16:39Z","abstract_excerpt":"In this paper, we propose a novel sparse learning based feature selection method that directly optimizes a large margin linear classification model sparsity with l_(2,p)-norm (0 < p < 1)subject to data-fitting constraints, rather than using the sparsity as a regularization term. To solve the direct sparsity optimization problem that is non-smooth and non-convex when 0<p<1, we provide an efficient iterative algorithm with proved convergence by converting it to a convex and smooth optimization problem at every iteration step. The proposed algorithm has been evaluated based on publicly available "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00430","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":""},"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":"1504.00430","created_at":"2026-05-18T02:19:43.341727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00430v1","created_at":"2026-05-18T02:19:43.341727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00430","created_at":"2026-05-18T02:19:43.341727+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJLGQKMMGIYZ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJLGQKMMGIYZBOYQ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJLGQKMM","created_at":"2026-05-18T12:29:25.134429+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/IJLGQKMMGIYZBOYQ7NXDKCQSC5","json":"https://pith.science/pith/IJLGQKMMGIYZBOYQ7NXDKCQSC5.json","graph_json":"https://pith.science/api/pith-number/IJLGQKMMGIYZBOYQ7NXDKCQSC5/graph.json","events_json":"https://pith.science/api/pith-number/IJLGQKMMGIYZBOYQ7NXDKCQSC5/events.json","paper":"https://pith.science/paper/IJLGQKMM"},"agent_actions":{"view_html":"https://pith.science/pith/IJLGQKMMGIYZBOYQ7NXDKCQSC5","download_json":"https://pith.science/pith/IJLGQKMMGIYZBOYQ7NXDKCQSC5.json","view_paper":"https://pith.science/paper/IJLGQKMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00430&json=true","fetch_graph":"https://pith.science/api/pith-number/IJLGQKMMGIYZBOYQ7NXDKCQSC5/graph.json","fetch_events":"https://pith.science/api/pith-number/IJLGQKMMGIYZBOYQ7NXDKCQSC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJLGQKMMGIYZBOYQ7NXDKCQSC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJLGQKMMGIYZBOYQ7NXDKCQSC5/action/storage_attestation","attest_author":"https://pith.science/pith/IJLGQKMMGIYZBOYQ7NXDKCQSC5/action/author_attestation","sign_citation":"https://pith.science/pith/IJLGQKMMGIYZBOYQ7NXDKCQSC5/action/citation_signature","submit_replication":"https://pith.science/pith/IJLGQKMMGIYZBOYQ7NXDKCQSC5/action/replication_record"}},"created_at":"2026-05-18T02:19:43.341727+00:00","updated_at":"2026-05-18T02:19:43.341727+00:00"}