{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:N2PPGYIZFT7AEMFTCXVZXPQ65H","short_pith_number":"pith:N2PPGYIZ","schema_version":"1.0","canonical_sha256":"6e9ef361192cfe0230b315eb9bbe1ee9ef82bb87727f77f0a31db789a9deb8d6","source":{"kind":"arxiv","id":"2205.09180","version":4},"attestation_state":"computed","paper":{"title":"Learning Rate Curriculum","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.CV"],"primary_cat":"cs.LG","authors_text":"Florinel-Alin Croitoru, Nicolae-Catalin Ristea, Nicu Sebe, Radu Tudor Ionescu","submitted_at":"2022-05-18T18:57:36Z","abstract_excerpt":"Most curriculum learning methods require an approach to sort the data samples by difficulty, which is often cumbersome to perform. In this work, we propose a novel curriculum learning approach termed Learning Rate Curriculum (LeRaC), which leverages the use of a different learning rate for each layer of a neural network to create a data-agnostic curriculum during the initial training epochs. More specifically, LeRaC assigns higher learning rates to neural layers closer to the input, gradually decreasing the learning rates as the layers are placed farther away from the input. The learning rates"},"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":"2205.09180","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-18T18:57:36Z","cross_cats_sorted":["cs.CL","cs.CV"],"title_canon_sha256":"b74dc6654054cbae32f4cbc693925223ab747bb35bb61c4685637c1a6d10c6be","abstract_canon_sha256":"7c7b090e8ac24a421e594da0345e201f839c06314c95f3960946a6f8909ec786"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:46:14.898264Z","signature_b64":"1C6QFk+PKyDsRf9TGwRxV+1N4w0y9/62mW1WIJL71n6CtIRVoCKN/lSkc0hdQnhTG+LU1BxjDXPkQHzAhZzUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e9ef361192cfe0230b315eb9bbe1ee9ef82bb87727f77f0a31db789a9deb8d6","last_reissued_at":"2026-07-05T08:46:14.897851Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:46:14.897851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Rate Curriculum","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.CV"],"primary_cat":"cs.LG","authors_text":"Florinel-Alin Croitoru, Nicolae-Catalin Ristea, Nicu Sebe, Radu Tudor Ionescu","submitted_at":"2022-05-18T18:57:36Z","abstract_excerpt":"Most curriculum learning methods require an approach to sort the data samples by difficulty, which is often cumbersome to perform. In this work, we propose a novel curriculum learning approach termed Learning Rate Curriculum (LeRaC), which leverages the use of a different learning rate for each layer of a neural network to create a data-agnostic curriculum during the initial training epochs. More specifically, LeRaC assigns higher learning rates to neural layers closer to the input, gradually decreasing the learning rates as the layers are placed farther away from the input. The learning rates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.09180","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/2205.09180/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":"2205.09180","created_at":"2026-07-05T08:46:14.897911+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.09180v4","created_at":"2026-07-05T08:46:14.897911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.09180","created_at":"2026-07-05T08:46:14.897911+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2PPGYIZFT7A","created_at":"2026-07-05T08:46:14.897911+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2PPGYIZFT7AEMFT","created_at":"2026-07-05T08:46:14.897911+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2PPGYIZ","created_at":"2026-07-05T08:46:14.897911+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/N2PPGYIZFT7AEMFTCXVZXPQ65H","json":"https://pith.science/pith/N2PPGYIZFT7AEMFTCXVZXPQ65H.json","graph_json":"https://pith.science/api/pith-number/N2PPGYIZFT7AEMFTCXVZXPQ65H/graph.json","events_json":"https://pith.science/api/pith-number/N2PPGYIZFT7AEMFTCXVZXPQ65H/events.json","paper":"https://pith.science/paper/N2PPGYIZ"},"agent_actions":{"view_html":"https://pith.science/pith/N2PPGYIZFT7AEMFTCXVZXPQ65H","download_json":"https://pith.science/pith/N2PPGYIZFT7AEMFTCXVZXPQ65H.json","view_paper":"https://pith.science/paper/N2PPGYIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.09180&json=true","fetch_graph":"https://pith.science/api/pith-number/N2PPGYIZFT7AEMFTCXVZXPQ65H/graph.json","fetch_events":"https://pith.science/api/pith-number/N2PPGYIZFT7AEMFTCXVZXPQ65H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2PPGYIZFT7AEMFTCXVZXPQ65H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2PPGYIZFT7AEMFTCXVZXPQ65H/action/storage_attestation","attest_author":"https://pith.science/pith/N2PPGYIZFT7AEMFTCXVZXPQ65H/action/author_attestation","sign_citation":"https://pith.science/pith/N2PPGYIZFT7AEMFTCXVZXPQ65H/action/citation_signature","submit_replication":"https://pith.science/pith/N2PPGYIZFT7AEMFTCXVZXPQ65H/action/replication_record"}},"created_at":"2026-07-05T08:46:14.897911+00:00","updated_at":"2026-07-05T08:46:14.897911+00:00"}