{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M2BX4JTUEXJOTWLHAOQPWAQ6AY","short_pith_number":"pith:M2BX4JTU","schema_version":"1.0","canonical_sha256":"66837e267425d2e9d96703a0fb021e062ab9b9d0ec777b40d783ae5ca0b09c7b","source":{"kind":"arxiv","id":"1802.00518","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Fast Alternating Minimization for Structured Dictionary Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Ma, Deanna Needell, Saiprasad Ravishankar","submitted_at":"2018-02-01T23:49:46Z","abstract_excerpt":"Methods exploiting sparsity have been popular in imaging and signal processing applications including compression, denoising, and imaging inverse problems. Data-driven approaches such as dictionary learning and transform learning enable one to discover complex image features from datasets and provide promising performance over analytical models. Alternating minimization algorithms have been particularly popular in dictionary or transform learning. In this work, we study the properties of alternating minimization for structured (unitary) sparsifying operator learning. While the algorithm conver"},"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":"1802.00518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-01T23:49:46Z","cross_cats_sorted":[],"title_canon_sha256":"6f9590008242db01c1f652182c965a55a74ddc5351e0719abd13a5846933ddcf","abstract_canon_sha256":"8d995628f6f8120332158de97d9db318631fa95b663b28a0d6a491238fdc9e50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:32.977158Z","signature_b64":"UEojOa5xpVVII92rnE4yLYq1VnbRbaTQJd4i108mOA8xtJALx7EMhTvDlo+1BUit0AUVrUvVhTEFuG195Mx5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66837e267425d2e9d96703a0fb021e062ab9b9d0ec777b40d783ae5ca0b09c7b","last_reissued_at":"2026-05-18T00:24:32.976676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:32.976676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Fast Alternating Minimization for Structured Dictionary Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anna Ma, Deanna Needell, Saiprasad Ravishankar","submitted_at":"2018-02-01T23:49:46Z","abstract_excerpt":"Methods exploiting sparsity have been popular in imaging and signal processing applications including compression, denoising, and imaging inverse problems. Data-driven approaches such as dictionary learning and transform learning enable one to discover complex image features from datasets and provide promising performance over analytical models. Alternating minimization algorithms have been particularly popular in dictionary or transform learning. In this work, we study the properties of alternating minimization for structured (unitary) sparsifying operator learning. While the algorithm conver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00518","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":"1802.00518","created_at":"2026-05-18T00:24:32.976756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00518v1","created_at":"2026-05-18T00:24:32.976756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00518","created_at":"2026-05-18T00:24:32.976756+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2BX4JTUEXJO","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2BX4JTUEXJOTWLH","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2BX4JTU","created_at":"2026-05-18T12:32:37.024351+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/M2BX4JTUEXJOTWLHAOQPWAQ6AY","json":"https://pith.science/pith/M2BX4JTUEXJOTWLHAOQPWAQ6AY.json","graph_json":"https://pith.science/api/pith-number/M2BX4JTUEXJOTWLHAOQPWAQ6AY/graph.json","events_json":"https://pith.science/api/pith-number/M2BX4JTUEXJOTWLHAOQPWAQ6AY/events.json","paper":"https://pith.science/paper/M2BX4JTU"},"agent_actions":{"view_html":"https://pith.science/pith/M2BX4JTUEXJOTWLHAOQPWAQ6AY","download_json":"https://pith.science/pith/M2BX4JTUEXJOTWLHAOQPWAQ6AY.json","view_paper":"https://pith.science/paper/M2BX4JTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00518&json=true","fetch_graph":"https://pith.science/api/pith-number/M2BX4JTUEXJOTWLHAOQPWAQ6AY/graph.json","fetch_events":"https://pith.science/api/pith-number/M2BX4JTUEXJOTWLHAOQPWAQ6AY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2BX4JTUEXJOTWLHAOQPWAQ6AY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2BX4JTUEXJOTWLHAOQPWAQ6AY/action/storage_attestation","attest_author":"https://pith.science/pith/M2BX4JTUEXJOTWLHAOQPWAQ6AY/action/author_attestation","sign_citation":"https://pith.science/pith/M2BX4JTUEXJOTWLHAOQPWAQ6AY/action/citation_signature","submit_replication":"https://pith.science/pith/M2BX4JTUEXJOTWLHAOQPWAQ6AY/action/replication_record"}},"created_at":"2026-05-18T00:24:32.976756+00:00","updated_at":"2026-05-18T00:24:32.976756+00:00"}