{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TAX457VFJ4KWBIXR52Z2K2RIWS","short_pith_number":"pith:TAX457VF","schema_version":"1.0","canonical_sha256":"982fcefea54f1560a2f1eeb3a56a28b4b247321937b35b260eeb4ea4e26609f7","source":{"kind":"arxiv","id":"1703.00441","version":2},"attestation_state":"computed","paper":{"title":"Learning to Optimize Neural Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jitendra Malik, Ke Li","submitted_at":"2017-03-01T18:52:23Z","abstract_excerpt":"Learning to Optimize is a recently proposed framework for learning optimization algorithms using reinforcement learning. In this paper, we explore learning an optimization algorithm for training shallow neural nets. Such high-dimensional stochastic optimization problems present interesting challenges for existing reinforcement learning algorithms. We develop an extension that is suited to learning optimization algorithms in this setting and demonstrate that the learned optimization algorithm consistently outperforms other known optimization algorithms even on unseen tasks and is robust to chan"},"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":"1703.00441","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-01T18:52:23Z","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"title_canon_sha256":"ed5462524c4b30d9870b2042937164423d61d00870bb454b9eff7482bc59b01d","abstract_canon_sha256":"bc2fd361c067ffaddda83201b2dd8d59a3aa9c3048a532034af2e31de94a5939"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:15.364246Z","signature_b64":"B5QWlZSbmxK38gIkZZFNV05h4BantWwefD22guKSyopxJGquXDjlIJkUJ3ZlWzcA48pJPlDCfPpuMBsR4KDuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"982fcefea54f1560a2f1eeb3a56a28b4b247321937b35b260eeb4ea4e26609f7","last_reissued_at":"2026-05-18T00:29:15.363708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:15.363708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Optimize Neural Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jitendra Malik, Ke Li","submitted_at":"2017-03-01T18:52:23Z","abstract_excerpt":"Learning to Optimize is a recently proposed framework for learning optimization algorithms using reinforcement learning. In this paper, we explore learning an optimization algorithm for training shallow neural nets. Such high-dimensional stochastic optimization problems present interesting challenges for existing reinforcement learning algorithms. We develop an extension that is suited to learning optimization algorithms in this setting and demonstrate that the learned optimization algorithm consistently outperforms other known optimization algorithms even on unseen tasks and is robust to chan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00441","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":""},"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":"1703.00441","created_at":"2026-05-18T00:29:15.363790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00441v2","created_at":"2026-05-18T00:29:15.363790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00441","created_at":"2026-05-18T00:29:15.363790+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAX457VFJ4KW","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAX457VFJ4KWBIXR","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAX457VF","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2005.14165","citing_title":"Language Models are Few-Shot Learners","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TAX457VFJ4KWBIXR52Z2K2RIWS","json":"https://pith.science/pith/TAX457VFJ4KWBIXR52Z2K2RIWS.json","graph_json":"https://pith.science/api/pith-number/TAX457VFJ4KWBIXR52Z2K2RIWS/graph.json","events_json":"https://pith.science/api/pith-number/TAX457VFJ4KWBIXR52Z2K2RIWS/events.json","paper":"https://pith.science/paper/TAX457VF"},"agent_actions":{"view_html":"https://pith.science/pith/TAX457VFJ4KWBIXR52Z2K2RIWS","download_json":"https://pith.science/pith/TAX457VFJ4KWBIXR52Z2K2RIWS.json","view_paper":"https://pith.science/paper/TAX457VF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00441&json=true","fetch_graph":"https://pith.science/api/pith-number/TAX457VFJ4KWBIXR52Z2K2RIWS/graph.json","fetch_events":"https://pith.science/api/pith-number/TAX457VFJ4KWBIXR52Z2K2RIWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAX457VFJ4KWBIXR52Z2K2RIWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAX457VFJ4KWBIXR52Z2K2RIWS/action/storage_attestation","attest_author":"https://pith.science/pith/TAX457VFJ4KWBIXR52Z2K2RIWS/action/author_attestation","sign_citation":"https://pith.science/pith/TAX457VFJ4KWBIXR52Z2K2RIWS/action/citation_signature","submit_replication":"https://pith.science/pith/TAX457VFJ4KWBIXR52Z2K2RIWS/action/replication_record"}},"created_at":"2026-05-18T00:29:15.363790+00:00","updated_at":"2026-05-18T00:29:15.363790+00:00"}