{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OJHYZJFQXNGFSZITNS3TLZ5FTK","short_pith_number":"pith:OJHYZJFQ","schema_version":"1.0","canonical_sha256":"724f8ca4b0bb4c5965136cb735e7a59ab49c407b1439a8768fe8fee39727da74","source":{"kind":"arxiv","id":"2303.05582","version":3},"attestation_state":"computed","paper":{"title":"Generalization analysis of an unfolding network for analysis-based Compressed Sensing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR","cs.IT","eess.SP","math.IT"],"primary_cat":"cs.LG","authors_text":"Vicky Kouni, Yannis Panagakis","submitted_at":"2023-03-09T21:13:32Z","abstract_excerpt":"Unfolding networks have shown promising results in the Compressed Sensing (CS) field. Yet, the investigation of their generalization ability is still in its infancy. In this paper, we perform a generalization analysis of a state-of-the-art ADMM-based unfolding network, which jointly learns a decoder for CS and a sparsifying redundant analysis operator. To this end, we first impose a structural constraint on the learnable sparsifier, which parametrizes the network's hypothesis class. For the latter, we estimate its Rademacher complexity. With this estimate in hand, we deliver generalization err"},"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":"2303.05582","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-09T21:13:32Z","cross_cats_sorted":["cs.IR","cs.IT","eess.SP","math.IT"],"title_canon_sha256":"588359375ac2548a3e7ef700156fca7b21dc5f8c57145ba670aa0b3d7cb7d89d","abstract_canon_sha256":"39878015d047a86ec47496d4f5bf1a5419dc678e1aaf02ceb1c6e3d7af0cf8a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:56.587933Z","signature_b64":"jOFSbFYw1C4pQLmf/0AhRWG8Pap1mbgyLQ7E8wpwKJMAkr7oZbt7qDUBjvj/Utuaez0gBNUwyRl0JEsPR6i4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"724f8ca4b0bb4c5965136cb735e7a59ab49c407b1439a8768fe8fee39727da74","last_reissued_at":"2026-07-05T11:18:56.587474Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:56.587474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalization analysis of an unfolding network for analysis-based Compressed Sensing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IR","cs.IT","eess.SP","math.IT"],"primary_cat":"cs.LG","authors_text":"Vicky Kouni, Yannis Panagakis","submitted_at":"2023-03-09T21:13:32Z","abstract_excerpt":"Unfolding networks have shown promising results in the Compressed Sensing (CS) field. Yet, the investigation of their generalization ability is still in its infancy. In this paper, we perform a generalization analysis of a state-of-the-art ADMM-based unfolding network, which jointly learns a decoder for CS and a sparsifying redundant analysis operator. To this end, we first impose a structural constraint on the learnable sparsifier, which parametrizes the network's hypothesis class. For the latter, we estimate its Rademacher complexity. With this estimate in hand, we deliver generalization err"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.05582","kind":"arxiv","version":3},"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/2303.05582/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":"2303.05582","created_at":"2026-07-05T11:18:56.587534+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.05582v3","created_at":"2026-07-05T11:18:56.587534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.05582","created_at":"2026-07-05T11:18:56.587534+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJHYZJFQXNGF","created_at":"2026-07-05T11:18:56.587534+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJHYZJFQXNGFSZIT","created_at":"2026-07-05T11:18:56.587534+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJHYZJFQ","created_at":"2026-07-05T11:18:56.587534+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01854","citing_title":"How to warm-start your unfolding network","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OJHYZJFQXNGFSZITNS3TLZ5FTK","json":"https://pith.science/pith/OJHYZJFQXNGFSZITNS3TLZ5FTK.json","graph_json":"https://pith.science/api/pith-number/OJHYZJFQXNGFSZITNS3TLZ5FTK/graph.json","events_json":"https://pith.science/api/pith-number/OJHYZJFQXNGFSZITNS3TLZ5FTK/events.json","paper":"https://pith.science/paper/OJHYZJFQ"},"agent_actions":{"view_html":"https://pith.science/pith/OJHYZJFQXNGFSZITNS3TLZ5FTK","download_json":"https://pith.science/pith/OJHYZJFQXNGFSZITNS3TLZ5FTK.json","view_paper":"https://pith.science/paper/OJHYZJFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.05582&json=true","fetch_graph":"https://pith.science/api/pith-number/OJHYZJFQXNGFSZITNS3TLZ5FTK/graph.json","fetch_events":"https://pith.science/api/pith-number/OJHYZJFQXNGFSZITNS3TLZ5FTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJHYZJFQXNGFSZITNS3TLZ5FTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJHYZJFQXNGFSZITNS3TLZ5FTK/action/storage_attestation","attest_author":"https://pith.science/pith/OJHYZJFQXNGFSZITNS3TLZ5FTK/action/author_attestation","sign_citation":"https://pith.science/pith/OJHYZJFQXNGFSZITNS3TLZ5FTK/action/citation_signature","submit_replication":"https://pith.science/pith/OJHYZJFQXNGFSZITNS3TLZ5FTK/action/replication_record"}},"created_at":"2026-07-05T11:18:56.587534+00:00","updated_at":"2026-07-05T11:18:56.587534+00:00"}