{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HAL2BDLYNGS3BHBKZR2HU5W5YI","short_pith_number":"pith:HAL2BDLY","schema_version":"1.0","canonical_sha256":"3817a08d7869a5b09c2acc747a76ddc201a9c4b6adb60ba4fc1f181bade5ff6f","source":{"kind":"arxiv","id":"1711.03634","version":4},"attestation_state":"computed","paper":{"title":"Alternating minimization for dictionary learning: Local Convergence Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Niladri S. Chatterji, Peter L. Bartlett","submitted_at":"2017-11-09T22:55:35Z","abstract_excerpt":"We present theoretical guarantees for an alternating minimization algorithm for the dictionary learning/sparse coding problem. The dictionary learning problem is to factorize vector samples $y^{1},y^{2},\\ldots, y^{n}$ into an appropriate basis (dictionary) $A^*$ and sparse vectors $x^{1*},\\ldots,x^{n*}$. Our algorithm is a simple alternating minimization procedure that switches between $\\ell_1$ minimization and gradient descent in alternate steps. Dictionary learning and specifically alternating minimization algorithms for dictionary learning are well studied both theoretically and empirically"},"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":"1711.03634","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-09T22:55:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"350c5bf160062509066b165f15c9f1a676e70d2911fe3ec15bc0de3557b467b8","abstract_canon_sha256":"1d58df35626ca4ab99823f1e50b83632ebf320de7ca26e53e8d8d5888e00d43b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:50:42.678061Z","signature_b64":"oXyoCmZxTGrVWFX7L+vXr4JK05oLVg5U20k95Qn0XYIkSvuey37Jnn3bDt9KTyziC5BNDNI4bNZPv26/tl07BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3817a08d7869a5b09c2acc747a76ddc201a9c4b6adb60ba4fc1f181bade5ff6f","last_reissued_at":"2026-07-04T23:50:42.677629Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:50:42.677629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternating minimization for dictionary learning: Local Convergence Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Niladri S. Chatterji, Peter L. Bartlett","submitted_at":"2017-11-09T22:55:35Z","abstract_excerpt":"We present theoretical guarantees for an alternating minimization algorithm for the dictionary learning/sparse coding problem. The dictionary learning problem is to factorize vector samples $y^{1},y^{2},\\ldots, y^{n}$ into an appropriate basis (dictionary) $A^*$ and sparse vectors $x^{1*},\\ldots,x^{n*}$. Our algorithm is a simple alternating minimization procedure that switches between $\\ell_1$ minimization and gradient descent in alternate steps. Dictionary learning and specifically alternating minimization algorithms for dictionary learning are well studied both theoretically and empirically"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03634","kind":"arxiv","version":4},"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/1711.03634/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":"1711.03634","created_at":"2026-07-04T23:50:42.677686+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03634v4","created_at":"2026-07-04T23:50:42.677686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03634","created_at":"2026-07-04T23:50:42.677686+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAL2BDLYNGS3","created_at":"2026-07-04T23:50:42.677686+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAL2BDLYNGS3BHBK","created_at":"2026-07-04T23:50:42.677686+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAL2BDLY","created_at":"2026-07-04T23:50:42.677686+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.03738","citing_title":"Mechanistic Interpretability with Sparse Autoencoder Neural Operators","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HAL2BDLYNGS3BHBKZR2HU5W5YI","json":"https://pith.science/pith/HAL2BDLYNGS3BHBKZR2HU5W5YI.json","graph_json":"https://pith.science/api/pith-number/HAL2BDLYNGS3BHBKZR2HU5W5YI/graph.json","events_json":"https://pith.science/api/pith-number/HAL2BDLYNGS3BHBKZR2HU5W5YI/events.json","paper":"https://pith.science/paper/HAL2BDLY"},"agent_actions":{"view_html":"https://pith.science/pith/HAL2BDLYNGS3BHBKZR2HU5W5YI","download_json":"https://pith.science/pith/HAL2BDLYNGS3BHBKZR2HU5W5YI.json","view_paper":"https://pith.science/paper/HAL2BDLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03634&json=true","fetch_graph":"https://pith.science/api/pith-number/HAL2BDLYNGS3BHBKZR2HU5W5YI/graph.json","fetch_events":"https://pith.science/api/pith-number/HAL2BDLYNGS3BHBKZR2HU5W5YI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAL2BDLYNGS3BHBKZR2HU5W5YI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAL2BDLYNGS3BHBKZR2HU5W5YI/action/storage_attestation","attest_author":"https://pith.science/pith/HAL2BDLYNGS3BHBKZR2HU5W5YI/action/author_attestation","sign_citation":"https://pith.science/pith/HAL2BDLYNGS3BHBKZR2HU5W5YI/action/citation_signature","submit_replication":"https://pith.science/pith/HAL2BDLYNGS3BHBKZR2HU5W5YI/action/replication_record"}},"created_at":"2026-07-04T23:50:42.677686+00:00","updated_at":"2026-07-04T23:50:42.677686+00:00"}