{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JPFKWTMPWP6JZ3NTUPZYSXCYMN","short_pith_number":"pith:JPFKWTMP","schema_version":"1.0","canonical_sha256":"4bcaab4d8fb3fc9cedb3a3f3895c58637538c4f3389d07881fd3c35d7d288fdc","source":{"kind":"arxiv","id":"1905.12799","version":1},"attestation_state":"computed","paper":{"title":"Reinforcement Learning and Adaptive Sampling for Optimized DNN Compilation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Byung Hoon Ahn, Hadi Esmaeilzadeh, Prannoy Pilligundla","submitted_at":"2019-05-30T00:37:26Z","abstract_excerpt":"Achieving faster execution with shorter compilation time can enable further diversity and innovation in neural networks. However, the current paradigm of executing neural networks either relies on hand-optimized libraries, traditional compilation heuristics, or very recently, simulated annealing and genetic algorithms. Our work takes a unique approach by formulating compiler optimizations for neural networks as a reinforcement learning problem, whose solution takes fewer steps to converge. This solution, dubbed ReLeASE, comes with a sampling algorithm that leverages clustering to focus the cos"},"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":"1905.12799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T00:37:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"67a9190b564bdc15638c3ad286dcf9fc5f8e54f0abdf290f4d5a5d7b947b2a67","abstract_canon_sha256":"8aa4c86870021cf5ce1179b6a088baac483058f823dda6543097be1b972fc5fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:39.633980Z","signature_b64":"ePtq6+g2tYeKUH3azs/FKrFFkPa2453UVzEejIW07ATDQ/M5VLidSTkeUuFxpZu/GTO+DM3Zjqhy2VX7cX+1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bcaab4d8fb3fc9cedb3a3f3895c58637538c4f3389d07881fd3c35d7d288fdc","last_reissued_at":"2026-05-17T23:44:39.633485Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:39.633485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Learning and Adaptive Sampling for Optimized DNN Compilation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Byung Hoon Ahn, Hadi Esmaeilzadeh, Prannoy Pilligundla","submitted_at":"2019-05-30T00:37:26Z","abstract_excerpt":"Achieving faster execution with shorter compilation time can enable further diversity and innovation in neural networks. However, the current paradigm of executing neural networks either relies on hand-optimized libraries, traditional compilation heuristics, or very recently, simulated annealing and genetic algorithms. Our work takes a unique approach by formulating compiler optimizations for neural networks as a reinforcement learning problem, whose solution takes fewer steps to converge. This solution, dubbed ReLeASE, comes with a sampling algorithm that leverages clustering to focus the cos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12799","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":"1905.12799","created_at":"2026-05-17T23:44:39.633573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12799v1","created_at":"2026-05-17T23:44:39.633573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12799","created_at":"2026-05-17T23:44:39.633573+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPFKWTMPWP6J","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPFKWTMPWP6JZ3NT","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPFKWTMP","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00280","citing_title":"ReLATE: Learning Efficient Sparse Encoding for High-Performance Tensor Decomposition","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JPFKWTMPWP6JZ3NTUPZYSXCYMN","json":"https://pith.science/pith/JPFKWTMPWP6JZ3NTUPZYSXCYMN.json","graph_json":"https://pith.science/api/pith-number/JPFKWTMPWP6JZ3NTUPZYSXCYMN/graph.json","events_json":"https://pith.science/api/pith-number/JPFKWTMPWP6JZ3NTUPZYSXCYMN/events.json","paper":"https://pith.science/paper/JPFKWTMP"},"agent_actions":{"view_html":"https://pith.science/pith/JPFKWTMPWP6JZ3NTUPZYSXCYMN","download_json":"https://pith.science/pith/JPFKWTMPWP6JZ3NTUPZYSXCYMN.json","view_paper":"https://pith.science/paper/JPFKWTMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12799&json=true","fetch_graph":"https://pith.science/api/pith-number/JPFKWTMPWP6JZ3NTUPZYSXCYMN/graph.json","fetch_events":"https://pith.science/api/pith-number/JPFKWTMPWP6JZ3NTUPZYSXCYMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPFKWTMPWP6JZ3NTUPZYSXCYMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPFKWTMPWP6JZ3NTUPZYSXCYMN/action/storage_attestation","attest_author":"https://pith.science/pith/JPFKWTMPWP6JZ3NTUPZYSXCYMN/action/author_attestation","sign_citation":"https://pith.science/pith/JPFKWTMPWP6JZ3NTUPZYSXCYMN/action/citation_signature","submit_replication":"https://pith.science/pith/JPFKWTMPWP6JZ3NTUPZYSXCYMN/action/replication_record"}},"created_at":"2026-05-17T23:44:39.633573+00:00","updated_at":"2026-05-17T23:44:39.633573+00:00"}