{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AX25D2NH42K5RSUEHBHA4FOPXU","short_pith_number":"pith:AX25D2NH","schema_version":"1.0","canonical_sha256":"05f5d1e9a7e695d8ca84384e0e15cfbd2e559f04f54632269fca8ef6cc2eda33","source":{"kind":"arxiv","id":"1806.00701","version":5},"attestation_state":"computed","paper":{"title":"On Multi-Layer Basis Pursuit, Efficient Algorithms and Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Amir Beck, Aviad Aberdam, Jeremias Sulam, Michael Elad","submitted_at":"2018-06-02T20:31:30Z","abstract_excerpt":"Parsimonious representations are ubiquitous in modeling and processing information. Motivated by the recent Multi-Layer Convolutional Sparse Coding (ML-CSC) model, we herein generalize the traditional Basis Pursuit problem to a multi-layer setting, introducing similar sparse enforcing penalties at different representation layers in a symbiotic relation between synthesis and analysis sparse priors. We explore different iterative methods to solve this new problem in practice, and we propose a new Multi-Layer Iterative Soft Thresholding Algorithm (ML-ISTA), as well as a fast version (ML-FISTA). W"},"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":"1806.00701","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-02T20:31:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0a35df917a9a19ae21e12c7d306203891c77a84c75259111f835bfe6d6668e36","abstract_canon_sha256":"2093f911fc5c051ef7e8dc497b36f4176dd10576e153acd343b8a1e6a7b0c3eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:13.110727Z","signature_b64":"dNz5q6egz0+9NggSpDjCd5kcgCoklWjZLEdV664yEejpbahfliu68Tgt+n4B2t6JHt8dWGIZTuCHTq1ZT0P/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05f5d1e9a7e695d8ca84384e0e15cfbd2e559f04f54632269fca8ef6cc2eda33","last_reissued_at":"2026-05-18T00:00:13.110099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:13.110099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Multi-Layer Basis Pursuit, Efficient Algorithms and Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Amir Beck, Aviad Aberdam, Jeremias Sulam, Michael Elad","submitted_at":"2018-06-02T20:31:30Z","abstract_excerpt":"Parsimonious representations are ubiquitous in modeling and processing information. Motivated by the recent Multi-Layer Convolutional Sparse Coding (ML-CSC) model, we herein generalize the traditional Basis Pursuit problem to a multi-layer setting, introducing similar sparse enforcing penalties at different representation layers in a symbiotic relation between synthesis and analysis sparse priors. We explore different iterative methods to solve this new problem in practice, and we propose a new Multi-Layer Iterative Soft Thresholding Algorithm (ML-ISTA), as well as a fast version (ML-FISTA). W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00701","kind":"arxiv","version":5},"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":"1806.00701","created_at":"2026-05-18T00:00:13.110221+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00701v5","created_at":"2026-05-18T00:00:13.110221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00701","created_at":"2026-05-18T00:00:13.110221+00:00"},{"alias_kind":"pith_short_12","alias_value":"AX25D2NH42K5","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AX25D2NH42K5RSUE","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AX25D2NH","created_at":"2026-05-18T12:32:13.499390+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/AX25D2NH42K5RSUEHBHA4FOPXU","json":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU.json","graph_json":"https://pith.science/api/pith-number/AX25D2NH42K5RSUEHBHA4FOPXU/graph.json","events_json":"https://pith.science/api/pith-number/AX25D2NH42K5RSUEHBHA4FOPXU/events.json","paper":"https://pith.science/paper/AX25D2NH"},"agent_actions":{"view_html":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU","download_json":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU.json","view_paper":"https://pith.science/paper/AX25D2NH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00701&json=true","fetch_graph":"https://pith.science/api/pith-number/AX25D2NH42K5RSUEHBHA4FOPXU/graph.json","fetch_events":"https://pith.science/api/pith-number/AX25D2NH42K5RSUEHBHA4FOPXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU/action/storage_attestation","attest_author":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU/action/author_attestation","sign_citation":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU/action/citation_signature","submit_replication":"https://pith.science/pith/AX25D2NH42K5RSUEHBHA4FOPXU/action/replication_record"}},"created_at":"2026-05-18T00:00:13.110221+00:00","updated_at":"2026-05-18T00:00:13.110221+00:00"}