{"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/1-bit-adam","slug":"1-bit-adam","name":"1-bit Adam","full_name":"1-bit Adam","full_name_withheld":false,"description_markdown":"**1-bit Adam** is a [stochastic optimization](https://paperswithcode.com/methods/category/stochastic-optimization) technique that is a variant of [ADAM](https://paperswithcode.com/method/adam) with error-compensated 1-bit compression, based on finding that Adam's variance term becomes stable at an early stage. First vanilla Adam is used for a few epochs as a warm-up. After the warm-up stage, the compression stage starts and we stop updating the variance term $\\mathbf{v}$ and use it as a fixed precondition. At the compression stage, we communicate based on the momentum applied with error-compensated 1-bit compression. The momentums are quantized into 1-bit representation (the sign of each element). Accompanying the vector, a scaling factor is computed as $\\frac{\\text { magnitude of compensated gradient }}{\\text { magnitude of quantized gradient }}$. This scaling factor ensures that the compressed momentum has the same magnitude as the uncompressed momentum. This 1-bit compression could reduce the communication cost by $97 \\%$ and $94 \\%$ compared to the original float 32 and float 16 training, respectively.","description_state":"present","introduced_year":null,"introduced_by":{"title":"1-bit Adam: Communication Efficient Large-Scale Training with Adam's Convergence Speed","paper":"/paper/1-bit-adam-communication-efficient-large","first_author":"Hanlin Tang","n_authors":9,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/1-bit-adam-communication-efficient-large"},"source":{"url":"https://arxiv.org/abs/2102.02888v2","title":"1-bit Adam: Communication Efficient Large-Scale Training with Adam's Convergence Speed","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":"Large Batch Optimization","url":"/methods/category/large-batch-optimization","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Stochastic Optimization","url":"/methods/category/stochastic-optimization","pwc_aliases":[]}],"n_papers_tagged":40,"archive_num_papers":40,"papers_newest_first":[{"paper":null,"slug":"arwi-arabic-write-and-improve","title":"ARWI: Arabic Write and Improve","date":"2025-04-16","arxiv_id":"2504.11814","n_code_links":0,"syntology":null},{"paper":"/paper/deepseek-r1-incentivizing-reasoning","slug":"deepseek-r1-incentivizing-reasoning","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","date":"2025-01-22","arxiv_id":"2501.12948","n_code_links":4,"syntology":null},{"paper":"/paper/showui-one-vision-language-action-model-for","slug":"showui-one-vision-language-action-model-for","title":"ShowUI: One Vision-Language-Action Model for GUI Visual Agent","date":"2024-11-26","arxiv_id":"2411.17465","n_code_links":1,"syntology":{"ran":13,"of":16,"n_ran_checked":8,"n_instrument":5,"unverified":3,"pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","official":{"repos":["showlab/showui"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/2408-01800","slug":"2408-01800","title":"MiniCPM-V: A GPT-4V Level MLLM on Your Phone","date":"2024-08-03","arxiv_id":"2408.01800","n_code_links":2,"syntology":{"ran":11,"of":14,"n_ran_checked":5,"n_instrument":6,"unverified":3,"pointer_only":6,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 2 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified","official":{"repos":["OpenBMB/MiniCPM-o"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/yolov10-real-time-end-to-end-object-detection","slug":"yolov10-real-time-end-to-end-object-detection","title":"YOLOv10: Real-Time End-to-End Object Detection","date":"2024-05-23","arxiv_id":"2405.14458","n_code_links":3,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["THU-MIG/yolov10"],"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/fast-fishing-approximating-bait-for-efficient","slug":"fast-fishing-approximating-bait-for-efficient","title":"Fast Fishing: Approximating BAIT for Efficient and Scalable Deep Active Image Classification","date":"2024-04-13","arxiv_id":"2404.08981","n_code_links":1,"syntology":null},{"paper":"/paper/tracking-anything-in-high-quality","slug":"tracking-anything-in-high-quality","title":"Tracking Anything in High Quality","date":"2023-07-26","arxiv_id":"2307.13974","n_code_links":1,"syntology":null},{"paper":"/paper/dinov2-learning-robust-visual-features","slug":"dinov2-learning-robust-visual-features","title":"DINOv2: Learning Robust Visual Features without Supervision","date":"2023-04-14","arxiv_id":"2304.07193","n_code_links":26,"syntology":{"ran":39,"of":46,"n_ran_checked":32,"n_instrument":7,"unverified":7,"pointer_only":12,"phrase":"39 ran (of which 13 constructed an object rather than computing a result; 32 with no instrument failure: 2 honoured, 0 violated, 30 with no contract checked; 7 where Syntology's instrument failed) · 7 unverified","official":{"repos":["facebookresearch/dinov2"],"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/chatdoctor-a-medical-chat-model-fine-tuned-on","slug":"chatdoctor-a-medical-chat-model-fine-tuned-on","title":"ChatDoctor: A Medical Chat Model Fine-Tuned on a Large Language Model Meta-AI (LLaMA) Using Medical Domain Knowledge","date":"2023-03-24","arxiv_id":"2303.14070","n_code_links":1,"syntology":null},{"paper":"/paper/cctv-gun-benchmarking-handgun-detection-in","slug":"cctv-gun-benchmarking-handgun-detection-in","title":"CCTV-Gun: Benchmarking Handgun Detection in CCTV Images","date":"2023-03-19","arxiv_id":"2303.10703","n_code_links":1,"syntology":null},{"paper":"/paper/musiclm-generating-music-from-text","slug":"musiclm-generating-music-from-text","title":"MusicLM: Generating Music From Text","date":"2023-01-26","arxiv_id":"2301.11325","n_code_links":5,"syntology":{"ran":10,"of":16,"n_ran_checked":8,"n_instrument":2,"unverified":6,"pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 3 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","official":null}},{"paper":null,"slug":"dynamic-gradient-reactivation-for-backward","title":"Dynamic Gradient Reactivation for Backward Compatible Person Re-identification","date":"2022-07-12","arxiv_id":"2207.05658","n_code_links":0,"syntology":null},{"paper":"/paper/solving-quantitative-reasoning-problems-with","slug":"solving-quantitative-reasoning-problems-with","title":"Solving Quantitative Reasoning Problems with Language Models","date":"2022-06-29","arxiv_id":"2206.14858","n_code_links":1,"syntology":null},{"paper":"/paper/maximizing-communication-efficiency-for-large","slug":"maximizing-communication-efficiency-for-large","title":"Maximizing Communication Efficiency for Large-scale Training via 0/1 Adam","date":"2022-02-12","arxiv_id":"2202.06009","n_code_links":1,"syntology":null},{"paper":"/paper/fer2013-recognition-resnet18-with-tricks","slug":"fer2013-recognition-resnet18-with-tricks","title":"Fer2013 Recognition - ResNet18 With Tricks","date":"2021-12-29","arxiv_id":null,"n_code_links":1,"syntology":null},{"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/1-bit-lamb-communication-efficient-large","slug":"1-bit-lamb-communication-efficient-large","title":"1-bit LAMB: Communication Efficient Large-Scale Large-Batch Training with LAMB's Convergence Speed","date":"2021-04-13","arxiv_id":"2104.06069","n_code_links":1,"syntology":null},{"paper":"/paper/layoutparser-a-unified-toolkit-for-deep","slug":"layoutparser-a-unified-toolkit-for-deep","title":"LayoutParser: A Unified Toolkit for Deep Learning Based Document Image Analysis","date":"2021-03-29","arxiv_id":"2103.15348","n_code_links":6,"syntology":null},{"paper":null,"slug":"what-is-it-like-to-be-a-bot-simulated","title":"What is it Like to Be a Bot: Simulated, Situated, Structurally Coherent Qualia (S3Q) Theory of Consciousness","date":"2021-03-13","arxiv_id":"2103.12638","n_code_links":0,"syntology":null},{"paper":"/paper/zero-shot-text-to-image-generation","slug":"zero-shot-text-to-image-generation","title":"Zero-Shot Text-to-Image Generation","date":"2021-02-24","arxiv_id":"2102.12092","n_code_links":12,"syntology":{"ran":7,"of":7,"n_ran_checked":3,"n_instrument":4,"unverified":0,"pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","official":{"repos":["openai/DALL-E"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"paper":"/paper/1-bit-adam-communication-efficient-large","slug":"1-bit-adam-communication-efficient-large","title":"1-bit Adam: Communication Efficient Large-Scale Training with Adam's Convergence Speed","date":"2021-02-04","arxiv_id":"2102.02888","n_code_links":2,"syntology":null},{"paper":"/paper/infinite-nature-perpetual-view-generation-of","slug":"infinite-nature-perpetual-view-generation-of","title":"Infinite Nature: Perpetual View Generation of Natural Scenes from a Single Image","date":"2020-12-17","arxiv_id":"2012.09855","n_code_links":1,"syntology":null},{"paper":null,"slug":"in-silico-comparison-of-spike-protein-ace2","title":"In silico comparison of spike protein-ACE2 binding affinities across species; significance for the possible origin of the SARS-CoV-2 virus","date":"2020-05-13","arxiv_id":"2005.06199","n_code_links":0,"syntology":null},{"paper":"/paper/mti-net-multi-scale-task-interaction-networks","slug":"mti-net-multi-scale-task-interaction-networks","title":"MTI-Net: Multi-Scale Task Interaction Networks for Multi-Task Learning","date":"2020-01-19","arxiv_id":"2001.06902","n_code_links":1,"syntology":null},{"paper":"/paper/advances-and-open-problems-in-federated","slug":"advances-and-open-problems-in-federated","title":"Advances and Open Problems in Federated Learning","date":"2019-12-10","arxiv_id":"1912.04977","n_code_links":9,"syntology":{"ran":8,"of":9,"n_ran_checked":8,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/191111236","slug":"191111236","title":"RandLA-Net: Efficient Semantic Segmentation of Large-Scale Point Clouds","date":"2019-11-25","arxiv_id":"1911.11236","n_code_links":9,"syntology":{"ran":4,"of":4,"n_ran_checked":3,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["QingyongHu/RandLA-Net"],"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/green-ai","slug":"green-ai","title":"Green AI","date":"2019-07-22","arxiv_id":"1907.10597","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/self-supervised-representation-learning-by","slug":"self-supervised-representation-learning-by","title":"Self-Supervised Representation Learning by Rotation Feature Decoupling","date":"2019-06-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/a-comprehensive-overhaul-of-feature","slug":"a-comprehensive-overhaul-of-feature","title":"A Comprehensive Overhaul of Feature Distillation","date":"2019-04-03","arxiv_id":"1904.01866","n_code_links":2,"syntology":{"ran":4,"of":6,"n_ran_checked":3,"n_instrument":1,"unverified":2,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["clovaai/overhaul-distillation"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"analysis-of-the-generalization-error","title":"Analysis of the Generalization Error: Empirical Risk Minimization over Deep Artificial Neural Networks Overcomes the Curse of Dimensionality in the Numerical Approximation of Black-Scholes Partial Differential Equations","date":"2018-09-09","arxiv_id":"1809.03062","n_code_links":0,"syntology":null},{"paper":"/paper/mesonet-a-compact-facial-video-forgery","slug":"mesonet-a-compact-facial-video-forgery","title":"MesoNet: a Compact Facial Video Forgery Detection Network","date":"2018-09-04","arxiv_id":"1809.00888","n_code_links":8,"syntology":{"ran":1,"of":6,"n_ran_checked":1,"n_instrument":0,"unverified":5,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["DariusAf/MesoNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/fashion-gen-the-generative-fashion-dataset","slug":"fashion-gen-the-generative-fashion-dataset","title":"Fashion-Gen: The Generative Fashion Dataset and Challenge","date":"2018-06-21","arxiv_id":"1806.08317","n_code_links":3,"syntology":null},{"paper":"/paper/leolani-a-reference-machine-with-a-theory-of","slug":"leolani-a-reference-machine-with-a-theory-of","title":"Leolani: a reference machine with a theory of mind for social communication","date":"2018-06-05","arxiv_id":"1806.01526","n_code_links":1,"syntology":null},{"paper":"/paper/automatic-query-image-disambiguation-for","slug":"automatic-query-image-disambiguation-for","title":"Automatic Query Image Disambiguation for Content-Based Image Retrieval","date":"2017-11-02","arxiv_id":"1711.00953","n_code_links":1,"syntology":null},{"paper":"/paper/deepvo-towards-end-to-end-visual-odometry","slug":"deepvo-towards-end-to-end-visual-odometry","title":"DeepVO: Towards End-to-End Visual Odometry with Deep Recurrent Convolutional Neural Networks","date":"2017-09-25","arxiv_id":"1709.08429","n_code_links":5,"syntology":null},{"paper":"/paper/an-information-theory-based-feature-selection","slug":"an-information-theory-based-feature-selection","title":"An Information Theory-Based Feature Selection Framework for Big Data Under Apache Spark","date":"2017-07-06","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"multi-way-multi-level-kernel-modeling-for","title":"Multi-Way Multi-Level Kernel Modeling for Neuroimaging Classification","date":"2017-07-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/automatic-text-scoring-using-neural-networks","slug":"automatic-text-scoring-using-neural-networks","title":"Automatic Text Scoring Using Neural Networks","date":"2016-06-14","arxiv_id":"1606.04289","n_code_links":3,"syntology":null},{"paper":"/paper/rnn-recurrent-library-for-torch","slug":"rnn-recurrent-library-for-torch","title":"rnn : Recurrent Library for Torch","date":"2015-11-24","arxiv_id":"1511.07889","n_code_links":1,"syntology":null},{"paper":null,"slug":"steven-kelly","title":"Steven Kelly","date":"1986-03-27","arxiv_id":null,"n_code_links":0,"syntology":null}],"papers_shown":40,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":40,"with_a_code_link":33,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":40,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":12,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":12,"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":12,"papers_where_code_ran_first_page":"/method/1-bit-adam/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/1-bit-adam/papers/ran/1","json":"/method/1-bit-adam/papers/ran/1.json","rows":12}],"tasks":[{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":5},{"task":"/task/image-generation","name":"Image Generation","papers":4},{"task":"/task/2d-object-detection","name":"2D Object Detection","papers":3},{"task":"/task/image-classification","name":"Image Classification","papers":3},{"task":"/task/object-detection","name":"Object Detection","papers":3},{"task":"/task/retrieval","name":"Retrieval","papers":3},{"task":"/task/object-detection-1","name":"object-detection","papers":3},{"task":"/task/2d-human-pose-estimation","name":"2D Human Pose Estimation","papers":2},{"task":"/task/deep-learning","name":"Deep Learning","papers":2},{"task":"/task/classification","name":"General Classification","papers":2},{"task":"/task/image-retrieval","name":"Image Retrieval","papers":2},{"task":"/task/language-modeling","name":"Language Modeling","papers":2},{"task":"/task/language-modelling","name":"Language Modelling","papers":2},{"task":"/task/large-language-model","name":"Large Language Model","papers":2},{"task":"/task/multi-task-language-understanding","name":"Multi-task Language Understanding","papers":2},{"task":"/task/object","name":"Object","papers":2},{"task":"/task/text-to-image-generation-1","name":"Text to Image Generation","papers":2},{"task":"/task/text-to-image-generation","name":"Text-to-Image Generation","papers":2},{"task":"/task/video-generation","name":"Video Generation","papers":2},{"task":"/task/image-classification","name":"image-classification","papers":2}],"tasks_shown":20,"n_tasks":96,"usage_by_year":[{"year":"1986","papers":1},{"year":"2015","papers":1},{"year":"2016","papers":1},{"year":"2017","papers":4},{"year":"2018","papers":4},{"year":"2019","papers":5},{"year":"2020","papers":3},{"year":"2021","papers":7},{"year":"2022","papers":3},{"year":"2023","papers":5},{"year":"2024","papers":4},{"year":"2025","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/1-bit-adam"},"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=1-bit%20Adam","read_at":"2026-10-05T00:51:02+00:00","query":"1-bit Adam","kind":"paper","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2102.02888"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2102.02888","repositories":{"listed":2,"in_graph":2,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2102.02888","citations":114},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named '1-bit Adam'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2102.02888","page":"/paper/1-bit-adam-communication-efficient-large","syntology_url":"https://syntology.ai/paper/2102.02888","in_graph_layer":false,"samples":0},"line":"repository known, no verified implementation (declared_code; repositories: 2 listed of 2 in the graph, strongest link: official). The lookup matched a paper by its title, arXiv:2102.02888, not a method entry. This answer is about arXiv:2102.02888, the paper the archive credits with this method.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"2802af65945b0133d579a8c2fc59b633f3e573bf441e86968a997f184509c173","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}