{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7KRVJ4X2BYM6Q7KLIMVFHM7ZUN","short_pith_number":"pith:7KRVJ4X2","schema_version":"1.0","canonical_sha256":"faa354f2fa0e19e87d4b432a53b3f9a34ef4bea21524ce669168a605bfe9836c","source":{"kind":"arxiv","id":"1205.1240","version":1},"attestation_state":"computed","paper":{"title":"Convex Relaxation for Combinatorial Penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Francis Bach (INRIA Paris - Rocquencourt, Guillaume Obozinski (INRIA Paris - Rocquencourt, LIENS)","submitted_at":"2012-05-06T19:54:33Z","abstract_excerpt":"In this paper, we propose an unifying view of several recently proposed structured sparsity-inducing norms. We consider the situation of a model simultaneously (a) penalized by a set- function de ned on the support of the unknown parameter vector which represents prior knowledge on supports, and (b) regularized in Lp-norm. We show that the natural combinatorial optimization problems obtained may be relaxed into convex optimization problems and introduce a notion, the lower combinatorial envelope of a set-function, that characterizes the tightness of our relaxations. We moreover establish links"},"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":"1205.1240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-06T19:54:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1a068a9490b179561246bef348bc48286ce29ff8ef526f6c509c5ee61a57fd52","abstract_canon_sha256":"ef07894b75fbfc6c7a586f1de46678e7faba32a831c25bd8a62f1ad9626f03c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:11.712541Z","signature_b64":"FvoLDbqWl7vY3uCv0JBTgYFkVtiA7cbUC0YcRMZPDQdZ1StRJ3qre/5Kl4f/+fbOca1KmA45iYgWn5eSTlHyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faa354f2fa0e19e87d4b432a53b3f9a34ef4bea21524ce669168a605bfe9836c","last_reissued_at":"2026-05-18T03:56:11.711797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:11.711797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Relaxation for Combinatorial Penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Francis Bach (INRIA Paris - Rocquencourt, Guillaume Obozinski (INRIA Paris - Rocquencourt, LIENS)","submitted_at":"2012-05-06T19:54:33Z","abstract_excerpt":"In this paper, we propose an unifying view of several recently proposed structured sparsity-inducing norms. We consider the situation of a model simultaneously (a) penalized by a set- function de ned on the support of the unknown parameter vector which represents prior knowledge on supports, and (b) regularized in Lp-norm. We show that the natural combinatorial optimization problems obtained may be relaxed into convex optimization problems and introduce a notion, the lower combinatorial envelope of a set-function, that characterizes the tightness of our relaxations. We moreover establish links"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1240","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":"1205.1240","created_at":"2026-05-18T03:56:11.711913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1240v1","created_at":"2026-05-18T03:56:11.711913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1240","created_at":"2026-05-18T03:56:11.711913+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KRVJ4X2BYM6","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KRVJ4X2BYM6Q7KL","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KRVJ4X2","created_at":"2026-05-18T12:26:58.693483+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/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN","json":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN.json","graph_json":"https://pith.science/api/pith-number/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/graph.json","events_json":"https://pith.science/api/pith-number/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/events.json","paper":"https://pith.science/paper/7KRVJ4X2"},"agent_actions":{"view_html":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN","download_json":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN.json","view_paper":"https://pith.science/paper/7KRVJ4X2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1240&json=true","fetch_graph":"https://pith.science/api/pith-number/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/graph.json","fetch_events":"https://pith.science/api/pith-number/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/action/storage_attestation","attest_author":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/action/author_attestation","sign_citation":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/action/citation_signature","submit_replication":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/action/replication_record"}},"created_at":"2026-05-18T03:56:11.711913+00:00","updated_at":"2026-05-18T03:56:11.711913+00:00"}