{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MVJPDU6N4B3AVFXOKWNAMPXF6M","short_pith_number":"pith:MVJPDU6N","schema_version":"1.0","canonical_sha256":"6552f1d3cde0760a96ee559a063ee5f32329011c0629b918ee5b281c184b1997","source":{"kind":"arxiv","id":"1110.4481","version":1},"attestation_state":"computed","paper":{"title":"Learning Hierarchical and Topographic Dictionaries with Structured Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francis Bach (LIENS, Guillaume Obozinski (LIENS, INRIA Paris - Rocquencourt), Julien Mairal, Rodolphe Jenatton (LIENS","submitted_at":"2011-10-20T09:50:58Z","abstract_excerpt":"Recent work in signal processing and statistics have focused on defining new regularization functions, which not only induce sparsity of the solution, but also take into account the structure of the problem. We present in this paper a class of convex penalties introduced in the machine learning community, which take the form of a sum of l_2 and l_infinity-norms over groups of variables. They extend the classical group-sparsity regularization in the sense that the groups possibly overlap, allowing more flexibility in the group design. We review efficient optimization methods to deal with the co"},"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":"1110.4481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-10-20T09:50:58Z","cross_cats_sorted":[],"title_canon_sha256":"b8168c24aca4def4c51ad7fee56fe40a6c0dff02c5c387a24455d5dd4397570f","abstract_canon_sha256":"f92097e07c003fa0f8efa4f180e0031b830d4ef01970aff242ecf858491eb827"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:36.644656Z","signature_b64":"HpqdxVt+mOhyuFZji26DGOBI7lRcCi4FGAbfYlKNVQEC9Cd8zNqTDuenBwXBtYLS6uSvoogUtosTYVcuks01CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6552f1d3cde0760a96ee559a063ee5f32329011c0629b918ee5b281c184b1997","last_reissued_at":"2026-05-18T04:10:36.644035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:36.644035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Hierarchical and Topographic Dictionaries with Structured Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francis Bach (LIENS, Guillaume Obozinski (LIENS, INRIA Paris - Rocquencourt), Julien Mairal, Rodolphe Jenatton (LIENS","submitted_at":"2011-10-20T09:50:58Z","abstract_excerpt":"Recent work in signal processing and statistics have focused on defining new regularization functions, which not only induce sparsity of the solution, but also take into account the structure of the problem. We present in this paper a class of convex penalties introduced in the machine learning community, which take the form of a sum of l_2 and l_infinity-norms over groups of variables. They extend the classical group-sparsity regularization in the sense that the groups possibly overlap, allowing more flexibility in the group design. We review efficient optimization methods to deal with the co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4481","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":"1110.4481","created_at":"2026-05-18T04:10:36.644125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.4481v1","created_at":"2026-05-18T04:10:36.644125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4481","created_at":"2026-05-18T04:10:36.644125+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVJPDU6N4B3A","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVJPDU6N4B3AVFXO","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVJPDU6N","created_at":"2026-05-18T12:26:37.096874+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/MVJPDU6N4B3AVFXOKWNAMPXF6M","json":"https://pith.science/pith/MVJPDU6N4B3AVFXOKWNAMPXF6M.json","graph_json":"https://pith.science/api/pith-number/MVJPDU6N4B3AVFXOKWNAMPXF6M/graph.json","events_json":"https://pith.science/api/pith-number/MVJPDU6N4B3AVFXOKWNAMPXF6M/events.json","paper":"https://pith.science/paper/MVJPDU6N"},"agent_actions":{"view_html":"https://pith.science/pith/MVJPDU6N4B3AVFXOKWNAMPXF6M","download_json":"https://pith.science/pith/MVJPDU6N4B3AVFXOKWNAMPXF6M.json","view_paper":"https://pith.science/paper/MVJPDU6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.4481&json=true","fetch_graph":"https://pith.science/api/pith-number/MVJPDU6N4B3AVFXOKWNAMPXF6M/graph.json","fetch_events":"https://pith.science/api/pith-number/MVJPDU6N4B3AVFXOKWNAMPXF6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVJPDU6N4B3AVFXOKWNAMPXF6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVJPDU6N4B3AVFXOKWNAMPXF6M/action/storage_attestation","attest_author":"https://pith.science/pith/MVJPDU6N4B3AVFXOKWNAMPXF6M/action/author_attestation","sign_citation":"https://pith.science/pith/MVJPDU6N4B3AVFXOKWNAMPXF6M/action/citation_signature","submit_replication":"https://pith.science/pith/MVJPDU6N4B3AVFXOKWNAMPXF6M/action/replication_record"}},"created_at":"2026-05-18T04:10:36.644125+00:00","updated_at":"2026-05-18T04:10:36.644125+00:00"}