{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/1cycle","slug":"1cycle","name":"1cycle","full_name":"1cycle learning rate scheduling policy","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"A disciplined approach to neural network hyper-parameters: Part 1 -- learning rate, batch size, momentum, and weight decay","paper":"/paper/a-disciplined-approach-to-neural-network","first_author":"Leslie N. Smith","n_authors":1,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/a-disciplined-approach-to-neural-network"},"source":{"url":"http://arxiv.org/abs/1803.09820v2","title":"A disciplined approach to neural network hyper-parameters: Part 1 -- learning rate, batch size, momentum, and weight decay","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Learning Rate Schedules","url":"/methods/category/learning-rate-schedules","pwc_aliases":[]}],"n_papers_tagged":13,"archive_num_papers":13,"papers_newest_first":[{"paper":"/paper/learning-minimal-representations-of","slug":"learning-minimal-representations-of","title":"Learning minimal representations of stochastic processes with variational autoencoders","date":"2023-07-21","arxiv_id":"2307.11608","n_code_links":1,"syntology":null},{"paper":"/paper/baize-an-open-source-chat-model-with","slug":"baize-an-open-source-chat-model-with","title":"Baize: An Open-Source Chat Model with Parameter-Efficient Tuning on Self-Chat Data","date":"2023-04-03","arxiv_id":"2304.01196","n_code_links":5,"syntology":{"ran":9,"of":9,"n_ran_checked":7,"n_instrument":2,"unverified":0,"pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["project-baize/baize","project-baize/baize-chatbot"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/nuwa-visual-synthesis-pre-training-for-neural","slug":"nuwa-visual-synthesis-pre-training-for-neural","title":"NÜWA: Visual Synthesis Pre-training for Neural visUal World creAtion","date":"2021-11-24","arxiv_id":"2111.12417","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/adop-approximate-differentiable-one-pixel","slug":"adop-approximate-differentiable-one-pixel","title":"ADOP: Approximate Differentiable One-Pixel Point Rendering","date":"2021-10-13","arxiv_id":"2110.06635","n_code_links":2,"syntology":null},{"paper":"/paper/smart-contract-vulnerability-detection-from","slug":"smart-contract-vulnerability-detection-from","title":"Smart Contract Vulnerability Detection: From Pure Neural Network to Interpretable Graph Feature and Expert Pattern Fusion","date":"2021-06-17","arxiv_id":"2106.09282","n_code_links":1,"syntology":{"ran":0,"of":2,"n_ran_checked":0,"n_instrument":0,"unverified":2,"pointer_only":2,"phrase":"0 ran · 2 unverified","official":{"repos":["Messi-Q/AMEVulDetector"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"paper":"/paper/self-attention-between-datapoints-going","slug":"self-attention-between-datapoints-going","title":"Self-Attention Between Datapoints: Going Beyond Individual Input-Output Pairs in Deep Learning","date":"2021-06-04","arxiv_id":"2106.02584","n_code_links":3,"syntology":{"ran":22,"of":30,"n_ran_checked":20,"n_instrument":2,"unverified":8,"pointer_only":0,"phrase":"22 ran (of which 4 constructed an object rather than computing a result; 20 with no instrument failure: 2 honoured, 1 violated, 17 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","official":{"repos":["OATML/Non-Parametric-Transformers"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":4,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/convnets-for-counting-object-detection-of","slug":"convnets-for-counting-object-detection-of","title":"ConvNets for Counting: Object Detection of Transient Phenomena in Steelpan Drums","date":"2021-02-01","arxiv_id":"2102.00632","n_code_links":1,"syntology":null},{"paper":"/paper/improving-polyphonic-music-models-with","slug":"improving-polyphonic-music-models-with","title":"Improving Polyphonic Music Models with Feature-Rich Encoding","date":"2019-11-26","arxiv_id":"1911.11775","n_code_links":2,"syntology":null},{"paper":"/paper/a-disciplined-approach-to-neural-network","slug":"a-disciplined-approach-to-neural-network","title":"A disciplined approach to neural network hyper-parameters: Part 1 -- learning rate, batch size, momentum, and weight decay","date":"2018-03-26","arxiv_id":"1803.09820","n_code_links":30,"syntology":{"ran":4,"of":7,"n_ran_checked":3,"n_instrument":1,"unverified":3,"pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["lnsmith54/hyperParam1"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/using-trusted-data-to-train-deep-networks-on","slug":"using-trusted-data-to-train-deep-networks-on","title":"Using Trusted Data to Train Deep Networks on Labels Corrupted by Severe Noise","date":"2018-02-14","arxiv_id":"1802.05300","n_code_links":1,"syntology":{"ran":5,"of":6,"n_ran_checked":5,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["mmazeika/glc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/sgpn-similarity-group-proposal-network-for-3d","slug":"sgpn-similarity-group-proposal-network-for-3d","title":"SGPN: Similarity Group Proposal Network for 3D Point Cloud Instance Segmentation","date":"2017-11-23","arxiv_id":"1711.08588","n_code_links":1,"syntology":null},{"paper":"/paper/time-contrastive-networks-self-supervised","slug":"time-contrastive-networks-self-supervised","title":"Time-Contrastive Networks: Self-Supervised Learning from Video","date":"2017-04-23","arxiv_id":"1704.06888","n_code_links":7,"syntology":null},{"paper":null,"slug":"large-scale-music-annotation-and-retrieval","title":"Large-Scale Music Annotation and Retrieval: Learning to Rank in Joint Semantic Spaces","date":"2011-05-26","arxiv_id":"1105.5196","n_code_links":0,"syntology":null}],"papers_shown":13,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":13,"with_a_code_link":12,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":13,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/method/1cycle/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/1cycle/papers/ran/1","json":"/method/1cycle/papers/ran/1.json","rows":5}],"tasks":[{"task":"/task/3d-part-segmentation","name":"3D Part Segmentation","papers":2},{"task":"/task/deep-learning","name":"Deep Learning","papers":2},{"task":"/task/object-detection","name":"Object Detection","papers":2},{"task":"/task/object-detection-1","name":"object-detection","papers":2},{"task":"/task/3d-instance-segmentation-1","name":"3D Instance Segmentation","papers":1},{"task":"/task/3d-object-detection","name":"3D Object Detection","papers":1},{"task":"/task/3d-semantic-instance-segmentation","name":"3D Semantic Instance Segmentation","papers":1},{"task":"/task/chatbot","name":"Chatbot","papers":1},{"task":"/task/data-poisoning","name":"Data Poisoning","papers":1},{"task":"/task/decoder","name":"Decoder","papers":1},{"task":null,"name":"Generative Adversarial Network","papers":1},{"task":"/task/image-generation","name":"Image Generation","papers":1},{"task":"/task/instance-segmentation","name":"Instance Segmentation","papers":1},{"task":"/task/inverse-rendering","name":"Inverse Rendering","papers":1},{"task":"/task/language-modeling","name":"Language Modeling","papers":1},{"task":"/task/language-modelling","name":"Language Modelling","papers":1},{"task":"/task/large-language-model","name":"Large Language Model","papers":1},{"task":"/task/learning-to-rank","name":"Learning-To-Rank","papers":1},{"task":"/task/metric-learning","name":"Metric Learning","papers":1},{"task":"/task/multi-task-learning","name":"Multi-Task Learning","papers":1}],"tasks_shown":20,"n_tasks":43,"usage_by_year":[{"year":"2011","papers":1},{"year":"2017","papers":2},{"year":"2018","papers":2},{"year":"2019","papers":1},{"year":"2021","papers":5},{"year":"2023","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/1cycle"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=1cycle","read_at":"2026-10-05T00:51:02+00:00","query":"1cycle","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1803.09820","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named '1cycle' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"7c4d0a75240037df767dadd0d6e6b1b9959e6cce36218b7540ba7417d63d618e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}