{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:WXFJ5VHEJS24TXH4UHAMJAUZ2Z","short_pith_number":"pith:WXFJ5VHE","schema_version":"1.0","canonical_sha256":"b5ca9ed4e44cb5c9dcfca1c0c48299d670c4c5f5825431e954b1a9d89f516255","source":{"kind":"arxiv","id":"2110.06641","version":2},"attestation_state":"computed","paper":{"title":"Dictionary Learning with Convex Update (ROMD)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Cheng cheng, Wei Dai","submitted_at":"2021-10-13T11:14:38Z","abstract_excerpt":"Dictionary learning aims to find a dictionary under which the training data can be sparsely represented, and it is usually achieved by iteratively applying two stages: sparse coding and dictionary update. Typical methods for dictionary update focuses on refining both dictionary atoms and their corresponding sparse coefficients by using the sparsity patterns obtained from sparse coding stage, and hence it is a non-convex bilinear inverse problem. In this paper, we propose a Rank-One Matrix Decomposition (ROMD) algorithm to recast this challenge into a convex problem by resolving these two varia"},"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":"2110.06641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-10-13T11:14:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a90c95a60fb2a55c635f80ce5cb06207c6d2b476cf972a11b94fcc14575757b4","abstract_canon_sha256":"b48aa313147ea29c2bbd68ee4d845fae6c5be1693713a9f5f787045f205a4bf7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:25:17.900715Z","signature_b64":"tCK2WcZQfihbw9qBoFnva+Zum3FX47xHucehr/TnUDsqourvZ9dW0cS6EBM4WD0hne55f32YMOlXZDG2qIUpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5ca9ed4e44cb5c9dcfca1c0c48299d670c4c5f5825431e954b1a9d89f516255","last_reissued_at":"2026-07-05T03:25:17.900287Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:25:17.900287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dictionary Learning with Convex Update (ROMD)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Cheng cheng, Wei Dai","submitted_at":"2021-10-13T11:14:38Z","abstract_excerpt":"Dictionary learning aims to find a dictionary under which the training data can be sparsely represented, and it is usually achieved by iteratively applying two stages: sparse coding and dictionary update. Typical methods for dictionary update focuses on refining both dictionary atoms and their corresponding sparse coefficients by using the sparsity patterns obtained from sparse coding stage, and hence it is a non-convex bilinear inverse problem. In this paper, we propose a Rank-One Matrix Decomposition (ROMD) algorithm to recast this challenge into a convex problem by resolving these two varia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.06641","kind":"arxiv","version":2},"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/2110.06641/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":"2110.06641","created_at":"2026-07-05T03:25:17.900358+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.06641v2","created_at":"2026-07-05T03:25:17.900358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.06641","created_at":"2026-07-05T03:25:17.900358+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXFJ5VHEJS24","created_at":"2026-07-05T03:25:17.900358+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXFJ5VHEJS24TXH4","created_at":"2026-07-05T03:25:17.900358+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXFJ5VHE","created_at":"2026-07-05T03:25:17.900358+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/WXFJ5VHEJS24TXH4UHAMJAUZ2Z","json":"https://pith.science/pith/WXFJ5VHEJS24TXH4UHAMJAUZ2Z.json","graph_json":"https://pith.science/api/pith-number/WXFJ5VHEJS24TXH4UHAMJAUZ2Z/graph.json","events_json":"https://pith.science/api/pith-number/WXFJ5VHEJS24TXH4UHAMJAUZ2Z/events.json","paper":"https://pith.science/paper/WXFJ5VHE"},"agent_actions":{"view_html":"https://pith.science/pith/WXFJ5VHEJS24TXH4UHAMJAUZ2Z","download_json":"https://pith.science/pith/WXFJ5VHEJS24TXH4UHAMJAUZ2Z.json","view_paper":"https://pith.science/paper/WXFJ5VHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.06641&json=true","fetch_graph":"https://pith.science/api/pith-number/WXFJ5VHEJS24TXH4UHAMJAUZ2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/WXFJ5VHEJS24TXH4UHAMJAUZ2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXFJ5VHEJS24TXH4UHAMJAUZ2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXFJ5VHEJS24TXH4UHAMJAUZ2Z/action/storage_attestation","attest_author":"https://pith.science/pith/WXFJ5VHEJS24TXH4UHAMJAUZ2Z/action/author_attestation","sign_citation":"https://pith.science/pith/WXFJ5VHEJS24TXH4UHAMJAUZ2Z/action/citation_signature","submit_replication":"https://pith.science/pith/WXFJ5VHEJS24TXH4UHAMJAUZ2Z/action/replication_record"}},"created_at":"2026-07-05T03:25:17.900358+00:00","updated_at":"2026-07-05T03:25:17.900358+00:00"}