{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Y26FYW5AFM6S4NOQXPJ7K7WMEX","short_pith_number":"pith:Y26FYW5A","schema_version":"1.0","canonical_sha256":"c6bc5c5ba02b3d2e35d0bbd3f57ecc25d6c71f3f77e3264bb5bce434e5d60006","source":{"kind":"arxiv","id":"2008.01171","version":1},"attestation_state":"computed","paper":{"title":"Deep Reinforcement Learning using Cyclical Learning Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Akos Csiszar, Alexander Verl, Marc Tuscher, Oliver Riedel, Ralf Gulde","submitted_at":"2020-07-31T10:06:02Z","abstract_excerpt":"Deep Reinforcement Learning (DRL) methods often rely on the meticulous tuning of hyperparameters to successfully resolve problems. One of the most influential parameters in optimization procedures based on stochastic gradient descent (SGD) is the learning rate. We investigate cyclical learning and propose a method for defining a general cyclical learning rate for various DRL problems. In this paper we present a method for cyclical learning applied to complex DRL problems. Our experiments show that, utilizing cyclical learning achieves similar or even better results than highly tuned fixed lear"},"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":"2008.01171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-31T10:06:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"78ea52e04f2e5a84189237490d6e8bc9a0d9ad8951a2ae6489536e8dda9a9157","abstract_canon_sha256":"2ac23b3b98fbba52a3c53444b3f952bd0cab73001074a36270c50333299798d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:24:17.859484Z","signature_b64":"3e6m2kTbos/pmwuWeUQBiAQq4hvjMg0evo3jV4qUSaXZr+YHVUdxtSBGmZpHeSNkwQS+b2AJan9B7OhuvdofBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6bc5c5ba02b3d2e35d0bbd3f57ecc25d6c71f3f77e3264bb5bce434e5d60006","last_reissued_at":"2026-07-05T01:24:17.859102Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:24:17.859102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Reinforcement Learning using Cyclical Learning Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Akos Csiszar, Alexander Verl, Marc Tuscher, Oliver Riedel, Ralf Gulde","submitted_at":"2020-07-31T10:06:02Z","abstract_excerpt":"Deep Reinforcement Learning (DRL) methods often rely on the meticulous tuning of hyperparameters to successfully resolve problems. One of the most influential parameters in optimization procedures based on stochastic gradient descent (SGD) is the learning rate. We investigate cyclical learning and propose a method for defining a general cyclical learning rate for various DRL problems. In this paper we present a method for cyclical learning applied to complex DRL problems. Our experiments show that, utilizing cyclical learning achieves similar or even better results than highly tuned fixed lear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.01171","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.01171/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":"2008.01171","created_at":"2026-07-05T01:24:17.859160+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.01171v1","created_at":"2026-07-05T01:24:17.859160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.01171","created_at":"2026-07-05T01:24:17.859160+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y26FYW5AFM6S","created_at":"2026-07-05T01:24:17.859160+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y26FYW5AFM6S4NOQ","created_at":"2026-07-05T01:24:17.859160+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y26FYW5A","created_at":"2026-07-05T01:24:17.859160+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/Y26FYW5AFM6S4NOQXPJ7K7WMEX","json":"https://pith.science/pith/Y26FYW5AFM6S4NOQXPJ7K7WMEX.json","graph_json":"https://pith.science/api/pith-number/Y26FYW5AFM6S4NOQXPJ7K7WMEX/graph.json","events_json":"https://pith.science/api/pith-number/Y26FYW5AFM6S4NOQXPJ7K7WMEX/events.json","paper":"https://pith.science/paper/Y26FYW5A"},"agent_actions":{"view_html":"https://pith.science/pith/Y26FYW5AFM6S4NOQXPJ7K7WMEX","download_json":"https://pith.science/pith/Y26FYW5AFM6S4NOQXPJ7K7WMEX.json","view_paper":"https://pith.science/paper/Y26FYW5A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.01171&json=true","fetch_graph":"https://pith.science/api/pith-number/Y26FYW5AFM6S4NOQXPJ7K7WMEX/graph.json","fetch_events":"https://pith.science/api/pith-number/Y26FYW5AFM6S4NOQXPJ7K7WMEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y26FYW5AFM6S4NOQXPJ7K7WMEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y26FYW5AFM6S4NOQXPJ7K7WMEX/action/storage_attestation","attest_author":"https://pith.science/pith/Y26FYW5AFM6S4NOQXPJ7K7WMEX/action/author_attestation","sign_citation":"https://pith.science/pith/Y26FYW5AFM6S4NOQXPJ7K7WMEX/action/citation_signature","submit_replication":"https://pith.science/pith/Y26FYW5AFM6S4NOQXPJ7K7WMEX/action/replication_record"}},"created_at":"2026-07-05T01:24:17.859160+00:00","updated_at":"2026-07-05T01:24:17.859160+00:00"}