{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2GEJWZXNNAGFQXRQOVKBHRRUW7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4d84d0ee4658a500bf6a6b6310e6731ad3f1fbbd8148fca6566e08d6665edc00","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-27T09:19:02Z","title_canon_sha256":"52b4d924421c3c6efd072e1b00f857f73cbe92cf3cb6d12d3b1da0270b1e778e"},"schema_version":"1.0","source":{"id":"1905.11071","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11071","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11071v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11071","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"2GEJWZXNNAGF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2GEJWZXNNAGFQXRQ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2GEJWZXN","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:e1e46ee74e4227599358a107f34ca5da45b76a0ed3acc49c53945576a8b2652b","target":"graph","created_at":"2026-05-17T23:45:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Sparse coding is typically solved by iterative optimization techniques, such as the Iterative Shrinkage-Thresholding Algorithm (ISTA). Unfolding and learning weights of ISTA using neural networks is a practical way to accelerate estimation. In this paper, we study the selection of adapted step sizes for ISTA. We show that a simple step size strategy can improve the convergence rate of ISTA by leveraging the sparsity of the iterates. However, it is impractical in most large-scale applications. Therefore, we propose a network architecture where only the step sizes of ISTA are learned. We demonst","authors_text":"Alexandre Gramfort, Mathurin Massias, Pierre Ablin, Thomas Moreau","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-27T09:19:02Z","title":"Learning step sizes for unfolded sparse coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11071","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:09de112216959fb5e5db21f878e4f6221cf4a50bf3f88a1137811e7e7c1069df","target":"record","created_at":"2026-05-17T23:45:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4d84d0ee4658a500bf6a6b6310e6731ad3f1fbbd8148fca6566e08d6665edc00","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-27T09:19:02Z","title_canon_sha256":"52b4d924421c3c6efd072e1b00f857f73cbe92cf3cb6d12d3b1da0270b1e778e"},"schema_version":"1.0","source":{"id":"1905.11071","kind":"arxiv","version":1}},"canonical_sha256":"d1889b66ed680c585e30755413c634b7c9396b73cf97223078fcaedabb46cc59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1889b66ed680c585e30755413c634b7c9396b73cf97223078fcaedabb46cc59","first_computed_at":"2026-05-17T23:45:03.001492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:03.001492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Abt0KUtVLTOg4N0ERx4Oose5AFPD8S0f0v9uFnqYhHIWplIa12seqNEWyNqa6rj9MphVn3en3AZwGFC+kCCJDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:03.002057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11071","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09de112216959fb5e5db21f878e4f6221cf4a50bf3f88a1137811e7e7c1069df","sha256:e1e46ee74e4227599358a107f34ca5da45b76a0ed3acc49c53945576a8b2652b"],"state_sha256":"f67fde62f3f1f7193661b095157d1184f631f11dec569fa3b2aefaf3d7b3c62f"}