{"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/lars","slug":"lars","name":"LARS","full_name":"LARS","full_name_withheld":false,"description_markdown":"**Layer-wise Adaptive Rate Scaling**, or **LARS**, is a large batch optimization technique.  There are two notable differences between LARS and other adaptive algorithms such as [Adam](https://paperswithcode.com/method/adam) or [RMSProp](https://paperswithcode.com/method/rmsprop): first, LARS uses a separate learning rate for each layer and not for each weight. And second, the magnitude of the update is controlled with respect to the weight norm for better control of training speed.\r\n\r\n$$m\\_{t} = \\beta\\_{1}m\\_{t-1} + \\left(1-\\beta\\_{1}\\right)\\left(g\\_{t} + \\lambda{x\\_{t}}\\right)$$\r\n$$x\\_{t+1}^{\\left(i\\right)} = x\\_{t}^{\\left(i\\right)}  - \\eta\\_{t}\\frac{\\phi\\left(|| x\\_{t}^{\\left(i\\right)} ||\\right)}{|| m\\_{t}^{\\left(i\\right)} || }m\\_{t}^{\\left(i\\right)} $$","description_state":"present","introduced_year":null,"introduced_by":{"title":"Large Batch Training of Convolutional Networks","paper":"/paper/large-batch-training-of-convolutional","first_author":"Yang You","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/large-batch-training-of-convolutional"},"source":{"url":"http://arxiv.org/abs/1708.03888v3","title":"Large Batch Training of Convolutional Networks","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/kakaobrain/torchlars/blob/3b3d7e9c7bd35a31b2c2fa6f213beb0bf6881892/torchlars/lars.py#L11","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Large Batch Optimization","url":"/methods/category/large-batch-optimization","pwc_aliases":[]}],"n_papers_tagged":77,"archive_num_papers":77,"papers_newest_first":[{"paper":null,"slug":"analyzing-breast-cancer-survival-disparities","title":"Analyzing Breast Cancer Survival Disparities by Race and Demographic Location: A Survival Analysis Approach","date":"2025-06-08","arxiv_id":"2506.07191","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-federated-survival-analysis-through","title":"Enhancing Federated Survival Analysis through Peer-Driven Client Reputation in Healthcare","date":"2025-05-22","arxiv_id":"2505.16190","n_code_links":0,"syntology":null},{"paper":null,"slug":"is-self-supervised-pre-training-on-satellite","title":"Is Self-Supervised Pre-training on Satellite Imagery Better than ImageNet? A Systematic Study with Sentinel-2","date":"2025-02-15","arxiv_id":"2502.10669","n_code_links":0,"syntology":null},{"paper":"/paper/self-supervised-frameworks-for-speaker","slug":"self-supervised-frameworks-for-speaker","title":"Self-Supervised Frameworks for Speaker Verification via Bootstrapped Positive Sampling","date":"2025-01-29","arxiv_id":"2501.17772","n_code_links":1,"syntology":null},{"paper":"/paper/tackling-small-sample-survival-analysis-via","slug":"tackling-small-sample-survival-analysis-via","title":"Tackling Small Sample Survival Analysis via Transfer Learning: A Study of Colorectal Cancer Prognosis","date":"2025-01-21","arxiv_id":"2501.12421","n_code_links":1,"syntology":null},{"paper":"/paper/prediction-of-lung-metastasis-from","slug":"prediction-of-lung-metastasis-from","title":"Prediction of Lung Metastasis from Hepatocellular Carcinoma using the SEER Database","date":"2025-01-20","arxiv_id":"2501.11720","n_code_links":1,"syntology":null},{"paper":null,"slug":"diagnosis-and-severity-assessment-of","title":"Diagnosis and Severity Assessment of Ulcerative Colitis using Self Supervised Learning","date":"2024-12-09","arxiv_id":"2412.07806","n_code_links":0,"syntology":null},{"paper":null,"slug":"seer-self-aligned-evidence-extraction-for","title":"SEER: Self-Aligned Evidence Extraction for Retrieval-Augmented Generation","date":"2024-10-15","arxiv_id":"2410.11315","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-informed-elastic-net-for-fast-grouped","title":"The Informed Elastic Net for Fast Grouped Variable Selection and FDR Control in Genomics Research","date":"2024-10-07","arxiv_id":"2410.05211","n_code_links":0,"syntology":null},{"paper":null,"slug":"do-not-design-learn-a-trainable-scoring","title":"Do Not Design, Learn: A Trainable Scoring Function for Uncertainty Estimation in Generative LLMs","date":"2024-06-17","arxiv_id":"2406.11278","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-preference-based-reinforcement-1","title":"Efficient Preference-based Reinforcement Learning via Aligned Experience Estimation","date":"2024-05-29","arxiv_id":"2405.18688","n_code_links":0,"syntology":null},{"paper":null,"slug":"self-supervised-multiple-instance-learning","title":"Self-Supervised Multiple Instance Learning for Acute Myeloid Leukemia Classification","date":"2024-03-08","arxiv_id":"2403.05379","n_code_links":0,"syntology":null},{"paper":"/paper/seer-facilitating-structured-reasoning-and","slug":"seer-facilitating-structured-reasoning-and","title":"SEER: Facilitating Structured Reasoning and Explanation via Reinforcement Learning","date":"2024-01-24","arxiv_id":"2401.13246","n_code_links":1,"syntology":{"ran":13,"of":16,"n_ran_checked":6,"n_instrument":7,"unverified":3,"pointer_only":2,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","official":{"repos":["chen-gx/seer"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official","unlocated"]}}},{"paper":null,"slug":"survival-analysis-of-young-triple-negative","title":"Survival Analysis of Young Triple-Negative Breast Cancer Patients","date":"2024-01-15","arxiv_id":"2401.08712","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-contrastive-learning-with-efficient","title":"Enhancing Contrastive Learning with Efficient Combinatorial Positive Pairing","date":"2024-01-11","arxiv_id":"2401.05730","n_code_links":0,"syntology":null},{"paper":null,"slug":"quantum-algorithms-for-the-pathwise-lasso","title":"Quantum Algorithms for the Pathwise Lasso","date":"2023-12-21","arxiv_id":"2312.14141","n_code_links":0,"syntology":null},{"paper":"/paper/importance-of-feature-extraction-in-the","slug":"importance-of-feature-extraction-in-the","title":"Feature Extraction for Generative Medical Imaging Evaluation: New Evidence Against an Evolving Trend","date":"2023-11-22","arxiv_id":"2311.13717","n_code_links":2,"syntology":null},{"paper":"/paper/seer-a-knapsack-approach-to-exemplar","slug":"seer-a-knapsack-approach-to-exemplar","title":"SEER : A Knapsack approach to Exemplar Selection for In-Context HybridQA","date":"2023-10-10","arxiv_id":"2310.06675","n_code_links":1,"syntology":{"ran":6,"of":16,"n_ran_checked":5,"n_instrument":1,"unverified":10,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 10 unverified","official":{"repos":["jtonglet/seer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":10,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"revisiting-lars-for-large-batch-training","title":"Revisiting LARS for Large Batch Training Generalization of Neural Networks","date":"2023-09-25","arxiv_id":"2309.14053","n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerating-large-batch-training-via","title":"Accelerating Large Batch Training via Gradient Signal to Noise Ratio (GSNR)","date":"2023-09-24","arxiv_id":"2309.13681","n_code_links":0,"syntology":null},{"paper":null,"slug":"seer-super-optimization-explorer-for-hls","title":"SEER: Super-Optimization Explorer for HLS using E-graph Rewriting with MLIR","date":"2023-08-15","arxiv_id":"2308.07654","n_code_links":0,"syntology":null},{"paper":"/paper/the-role-of-entropy-and-reconstruction-in","slug":"the-role-of-entropy-and-reconstruction-in","title":"The Role of Entropy and Reconstruction in Multi-View Self-Supervised Learning","date":"2023-07-20","arxiv_id":"2307.10907","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["apple/ml-entropy-reconstruction"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/semi-supervised-learning-made-simple-with-1","slug":"semi-supervised-learning-made-simple-with-1","title":"Semi-supervised learning made simple with self-supervised clustering","date":"2023-06-13","arxiv_id":"2306.07483","n_code_links":1,"syntology":{"ran":2,"of":5,"n_ran_checked":1,"n_instrument":1,"unverified":3,"pointer_only":5,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["pietroastolfi/suave-daino"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/hiding-in-plain-sight-disguising-data","slug":"hiding-in-plain-sight-disguising-data","title":"Hiding in Plain Sight: Disguising Data Stealing Attacks in Federated Learning","date":"2023-06-05","arxiv_id":"2306.03013","n_code_links":2,"syntology":null},{"paper":null,"slug":"using-spatio-temporal-dual-stream-network","title":"Using Spatio-Temporal Dual-Stream Network with Self-Supervised Learning for Lung Tumor Classification on Radial Probe Endobronchial Ultrasound Video","date":"2023-05-04","arxiv_id":"2305.02719","n_code_links":0,"syntology":null},{"paper":null,"slug":"in-distribution-and-out-of-distribution-self","title":"In-Distribution and Out-of-Distribution Self-supervised ECG Representation Learning for Arrhythmia Detection","date":"2023-04-13","arxiv_id":"2304.06427","n_code_links":0,"syntology":null},{"paper":null,"slug":"saddle-to-saddle-dynamics-in-diagonal-linear","title":"Saddle-to-Saddle Dynamics in Diagonal Linear Networks","date":"2023-04-02","arxiv_id":"2304.00488","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-domain-invariance-in-self","title":"Towards domain-invariant Self-Supervised Learning with Batch Styles Standardization","date":"2023-03-10","arxiv_id":"2303.06088","n_code_links":0,"syntology":null},{"paper":"/paper/infobatch-lossless-training-speed-up-by","slug":"infobatch-lossless-training-speed-up-by","title":"InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning","date":"2023-03-08","arxiv_id":"2303.04947","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":["nus-hpc-ai-lab/infobatch"],"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/towards-a-unified-theoretical-understanding","slug":"towards-a-unified-theoretical-understanding","title":"Towards a Unified Theoretical Understanding of Non-contrastive Learning via Rank Differential Mechanism","date":"2023-03-04","arxiv_id":"2303.02387","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["pku-ml/rank-differential-mechanism"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/perfect-is-the-enemy-of-test-oracle","slug":"perfect-is-the-enemy-of-test-oracle","title":"Perfect is the enemy of test oracle","date":"2023-02-03","arxiv_id":"2302.01488","n_code_links":1,"syntology":null},{"paper":null,"slug":"leveraging-the-third-dimension-in-contrastive","title":"Leveraging the Third Dimension in Contrastive Learning","date":"2023-01-27","arxiv_id":"2301.11790","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-simple-recipe-for-competitive-low-compute","title":"A Simple Recipe for Competitive Low-compute Self supervised Vision Models","date":"2023-01-23","arxiv_id":"2301.09451","n_code_links":0,"syntology":null},{"paper":null,"slug":"joint-self-supervised-image-volume","title":"Joint Self-Supervised Image-Volume Representation Learning with Intra-Inter Contrastive Clustering","date":"2022-12-04","arxiv_id":"2212.01893","n_code_links":0,"syntology":null},{"paper":"/paper/how-well-do-unsupervised-learning-algorithms","slug":"how-well-do-unsupervised-learning-algorithms","title":"How Well Do Unsupervised Learning Algorithms Model Human Real-time and Life-long Learning?","date":"2022-11-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/large-batch-optimization-for-dense-visual","slug":"large-batch-optimization-for-dense-visual","title":"Large-batch Optimization for Dense Visual Predictions","date":"2022-10-20","arxiv_id":"2210.11078","n_code_links":1,"syntology":null},{"paper":"/paper/the-hidden-uniform-cluster-prior-in-self","slug":"the-hidden-uniform-cluster-prior-in-self","title":"The Hidden Uniform Cluster Prior in Self-Supervised Learning","date":"2022-10-13","arxiv_id":"2210.07277","n_code_links":1,"syntology":null},{"paper":"/paper/effective-self-supervised-pre-training-on-low","slug":"effective-self-supervised-pre-training-on-low","title":"Effective Self-supervised Pre-training on Low-compute Networks without Distillation","date":"2022-10-06","arxiv_id":"2210.02808","n_code_links":1,"syntology":{"ran":6,"of":9,"n_ran_checked":3,"n_instrument":3,"unverified":3,"pointer_only":3,"phrase":"6 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; 3 where Syntology's instrument failed) · 3 unverified","official":{"repos":["saic-fi/sslight"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-formal-comparison-between-datalog-based","title":"A Formal Comparison between Datalog-based Languages for Stream Reasoning (extended version)","date":"2022-08-26","arxiv_id":"2208.12726","n_code_links":0,"syntology":null},{"paper":"/paper/communication-efficient-distributed-learning-5","slug":"communication-efficient-distributed-learning-5","title":"Communication-efficient Distributed Learning for Large Batch Optimization","date":"2022-07-17","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/studiogan-a-taxonomy-and-benchmark-of-gans","slug":"studiogan-a-taxonomy-and-benchmark-of-gans","title":"StudioGAN: A Taxonomy and Benchmark of GANs for Image Synthesis","date":"2022-06-19","arxiv_id":"2206.09479","n_code_links":2,"syntology":{"ran":8,"of":11,"n_ran_checked":6,"n_instrument":2,"unverified":3,"pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["POSTECH-CVLab/PyTorch-StudioGAN"],"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":null,"slug":"evaluation-of-contrastive-learning-with","title":"Evaluation of Contrastive Learning with Various Code Representations for Code Clone Detection","date":"2022-06-17","arxiv_id":"2206.08726","n_code_links":0,"syntology":null},{"paper":null,"slug":"spatial-cross-attention-improves-self","title":"Spatial Cross-Attention Improves Self-Supervised Visual Representation Learning","date":"2022-06-07","arxiv_id":"2206.05028","n_code_links":0,"syntology":null},{"paper":"/paper/ttaps-test-time-adaption-by-aligning","slug":"ttaps-test-time-adaption-by-aligning","title":"TTAPS: Test-Time Adaption by Aligning Prototypes using Self-Supervision","date":"2022-05-18","arxiv_id":"2205.08731","n_code_links":1,"syntology":null},{"paper":null,"slug":"chasing-streams-with-existential-rules","title":"Chasing Streams with Existential Rules","date":"2022-05-04","arxiv_id":"2205.02220","n_code_links":0,"syntology":null},{"paper":"/paper/auton-survival-an-open-source-package-for","slug":"auton-survival-an-open-source-package-for","title":"auton-survival: an Open-Source Package for Regression, Counterfactual Estimation, Evaluation and Phenotyping with Censored Time-to-Event Data","date":"2022-04-15","arxiv_id":"2204.07276","n_code_links":3,"syntology":null},{"paper":"/paper/unsupervised-salient-object-detection-with","slug":"unsupervised-salient-object-detection-with","title":"Unsupervised Salient Object Detection with Spectral Cluster Voting","date":"2022-03-23","arxiv_id":"2203.12614","n_code_links":1,"syntology":{"ran":5,"of":9,"n_ran_checked":0,"n_instrument":5,"unverified":4,"pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","official":{"repos":["noelshin/selfmask"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"towards-self-supervised-gaze-estimation","title":"Towards Self-Supervised Gaze Estimation","date":"2022-03-21","arxiv_id":"2203.10974","n_code_links":0,"syntology":null},{"paper":null,"slug":"influence-of-different-factors-on-survival-of","title":"Influence of different factors on survival of patients with colorectal cancer","date":"2022-02-05","arxiv_id":"2202.03425","n_code_links":0,"syntology":null},{"paper":"/paper/survtrace-transformers-for-survival-analysis","slug":"survtrace-transformers-for-survival-analysis","title":"SurvTRACE: Transformers for Survival Analysis with Competing Events","date":"2021-10-02","arxiv_id":"2110.00855","n_code_links":1,"syntology":{"ran":7,"of":9,"n_ran_checked":7,"n_instrument":0,"unverified":2,"pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["RyanWangZf/SurvTRACE"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"contrastive-clustering-to-mine-pseudo","title":"Contrastive Clustering to Mine Pseudo Parallel Data for Unsupervised Translation","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/pass-an-imagenet-replacement-for-self","slug":"pass-an-imagenet-replacement-for-self","title":"PASS: An ImageNet replacement for self-supervised pretraining without humans","date":"2021-09-27","arxiv_id":"2109.13228","n_code_links":1,"syntology":{"ran":11,"of":14,"n_ran_checked":8,"n_instrument":3,"unverified":3,"pointer_only":9,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 2 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","official":{"repos":["yukimasano/PASS"],"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":["found_in_text"]}}},{"paper":null,"slug":"resource-and-data-efficient-self-supervised","title":"Resource and data efficient self supervised learning","date":"2021-09-03","arxiv_id":"2109.01721","n_code_links":0,"syntology":null},{"paper":null,"slug":"how-transferable-are-self-supervised-features","title":"How Transferable Are Self-supervised Features in Medical Image Classification Tasks?","date":"2021-08-23","arxiv_id":"2108.10048","n_code_links":0,"syntology":null},{"paper":"/paper/distributed-deep-learning-in-open","slug":"distributed-deep-learning-in-open","title":"Distributed Deep Learning in Open Collaborations","date":"2021-06-18","arxiv_id":"2106.10207","n_code_links":2,"syntology":{"ran":0,"of":5,"n_ran_checked":0,"n_instrument":0,"unverified":5,"pointer_only":0,"phrase":"0 ran · 5 unverified","official":{"repos":["learning-at-home/hivemind","yandex-research/DeDLOC"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]}}},{"paper":null,"slug":"faster-than-laser-towards-stream-reasoning","title":"Faster than LASER -- Towards Stream Reasoning with Deep Neural Networks","date":"2021-06-15","arxiv_id":"2106.08457","n_code_links":0,"syntology":null},{"paper":"/paper/semi-supervised-learning-of-visual-features","slug":"semi-supervised-learning-of-visual-features","title":"Semi-Supervised Learning of Visual Features by Non-Parametrically Predicting View Assignments with Support Samples","date":"2021-04-28","arxiv_id":"2104.13963","n_code_links":4,"syntology":{"ran":19,"of":21,"n_ran_checked":16,"n_instrument":3,"unverified":2,"pointer_only":3,"phrase":"19 ran (of which 4 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["facebookresearch/suncet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"prediction-of-prognosis-and-survival-of","title":"Prediction of Prognosis and Survival of Patients with Gastric Cancer by Weighted Improved Random Forest Model","date":"2021-04-10","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"self-supervised-training-enhances-online","title":"Self-Supervised Training Enhances Online Continual Learning","date":"2021-03-25","arxiv_id":"2103.14010","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-visual-pretraining-with-contrastive","slug":"efficient-visual-pretraining-with-contrastive","title":"Efficient Visual Pretraining with Contrastive Detection","date":"2021-03-19","arxiv_id":"2103.10957","n_code_links":2,"syntology":null},{"paper":"/paper/improving-computational-efficiency-in-visual","slug":"improving-computational-efficiency-in-visual","title":"Improving Computational Efficiency in Visual Reinforcement Learning via Stored Embeddings","date":"2021-03-04","arxiv_id":"2103.02886","n_code_links":1,"syntology":null},{"paper":"/paper/self-supervised-pretraining-of-visual","slug":"self-supervised-pretraining-of-visual","title":"Self-supervised Pretraining of Visual Features in the Wild","date":"2021-03-02","arxiv_id":"2103.01988","n_code_links":1,"syntology":null},{"paper":"/paper/a-large-batch-optimizer-reality-check","slug":"a-large-batch-optimizer-reality-check","title":"A Large Batch Optimizer Reality Check: Traditional, Generic Optimizers Suffice Across Batch Sizes","date":"2021-02-12","arxiv_id":"2102.06356","n_code_links":0,"syntology":null},{"paper":null,"slug":"evaluating-deep-learning-in-systemml-using","title":"Evaluating Deep Learning in SystemML using Layer-wise Adaptive Rate Scaling(LARS) Optimizer","date":"2021-02-05","arxiv_id":"2102.03018","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-training-of-contrastive-learning-with","title":"Fast Training of Contrastive Learning with Intermediate Contrastive Loss","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"study-on-the-large-batch-size-training-of","title":"Study on the Large Batch Size Training of Neural Networks Based on the Second Order Gradient","date":"2020-12-16","arxiv_id":"2012.08795","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-layer-wise-adaptive-rate-methods","title":"Improving Layer-wise Adaptive Rate Methods using Trust Ratio Clipping","date":"2020-11-27","arxiv_id":"2011.13584","n_code_links":0,"syntology":null},{"paper":null,"slug":"self-supervised-ranking-for-representation","title":"Self-Supervised Ranking for Representation Learning","date":"2020-10-14","arxiv_id":"2010.07258","n_code_links":0,"syntology":null},{"paper":"/paper/unsupervised-learning-of-visual-features-by","slug":"unsupervised-learning-of-visual-features-by","title":"Unsupervised Learning of Visual Features by Contrasting Cluster Assignments","date":"2020-06-17","arxiv_id":"2006.09882","n_code_links":18,"syntology":{"ran":13,"of":17,"n_ran_checked":6,"n_instrument":7,"unverified":4,"pointer_only":6,"phrase":"13 ran (of which 4 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 7 where Syntology's instrument failed) · 4 unverified","official":{"repos":["facebookresearch/swav"],"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/supervised-contrastive-learning","slug":"supervised-contrastive-learning","title":"Supervised Contrastive Learning","date":"2020-04-23","arxiv_id":"2004.11362","n_code_links":26,"syntology":{"ran":17,"of":23,"n_ran_checked":12,"n_instrument":5,"unverified":6,"pointer_only":5,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","official":{"repos":["HobbitLong/SupContrast","google-research/google-research"],"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/a-simple-framework-for-contrastive-learning","slug":"a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","arxiv_id":"2002.05709","n_code_links":96,"syntology":{"ran":115,"of":137,"n_ran_checked":89,"n_instrument":26,"unverified":22,"pointer_only":52,"phrase":"115 ran (of which 33 constructed an object rather than computing a result; 89 with no instrument failure: 1 honoured, 1 violated, 87 with no contract checked; 26 where Syntology's instrument failed) · 22 unverified","official":{"repos":["google-research/simclr"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/reducing-bert-pre-training-time-from-3-days","slug":"reducing-bert-pre-training-time-from-3-days","title":"Large Batch Optimization for Deep Learning: Training BERT in 76 minutes","date":"2019-04-01","arxiv_id":"1904.00962","n_code_links":32,"syntology":{"ran":6,"of":11,"n_ran_checked":6,"n_instrument":0,"unverified":5,"pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["tensorflow/addons"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"snap-a-semismooth-newton-algorithm-for","title":"SNAP: A semismooth Newton algorithm for pathwise optimization with optimal local convergence rate and oracle properties","date":"2018-10-09","arxiv_id":"1810.03814","n_code_links":0,"syntology":null},{"paper":null,"slug":"convergence-analysis-of-gradient-descent","title":"Convergence Analysis of Gradient Descent Algorithms with Proportional Updates","date":"2018-01-09","arxiv_id":"1801.03137","n_code_links":0,"syntology":null},{"paper":null,"slug":"large-batch-training-of-convolutional-1","title":"Large Batch Training of Convolutional Networks with Layer-wise Adaptive Rate Scaling","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/imagenet-training-in-minutes","slug":"imagenet-training-in-minutes","title":"ImageNet Training in Minutes","date":"2017-09-14","arxiv_id":"1709.05011","n_code_links":1,"syntology":null},{"paper":"/paper/large-batch-training-of-convolutional","slug":"large-batch-training-of-convolutional","title":"Large Batch Training of Convolutional Networks","date":"2017-08-13","arxiv_id":"1708.03888","n_code_links":12,"syntology":{"ran":4,"of":5,"n_ran_checked":4,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","official":null}}],"papers_shown":77,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":77,"with_a_code_link":34,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":77,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":13,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":3,"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":16,"papers_where_code_ran_first_page":"/method/lars/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/lars/papers/ran/1","json":"/method/lars/papers/ran/1.json","rows":16}],"tasks":[{"task":"/task/self-supervised-learning","name":"Self-Supervised Learning","papers":20},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":10},{"task":"/task/image-classification","name":"Image Classification","papers":10},{"task":"/task/representation-learning","name":"Representation Learning","papers":7},{"task":"/task/clustering","name":"Clustering","papers":6},{"task":"/task/question-answering","name":"Question Answering","papers":5},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":5},{"task":"/task/survival-analysis","name":"Survival Analysis","papers":5},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":5},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":4},{"task":"/task/object-detection","name":"Object Detection","papers":4},{"task":"/task/prognosis","name":"Prognosis","papers":4},{"task":"/task/semi-supervised-image-classification","name":"Semi-Supervised Image Classification","papers":4},{"task":"/task/image-classification","name":"image-classification","papers":4},{"task":"/task/object-detection-1","name":"object-detection","papers":4},{"task":"/task/diversity","name":"Diversity","papers":3},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":3},{"task":"/task/self-supervised-image-classification","name":"Self-Supervised Image Classification","papers":3},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":3},{"task":"/task/16k","name":"16k","papers":2}],"tasks_shown":20,"n_tasks":106,"usage_by_year":[{"year":"2017","papers":2},{"year":"2018","papers":3},{"year":"2019","papers":1},{"year":"2020","papers":6},{"year":"2021","papers":16},{"year":"2022","papers":16},{"year":"2023","papers":18},{"year":"2024","papers":9},{"year":"2025","papers":6}],"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/lars"},"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=LARS","read_at":"2026-10-05T00:58:25+00:00","query":"LARS","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":"2308.09618"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"1708.03888","repositories":{"listed":2,"in_graph":2,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":true,"bearers_found":4,"served":{"arxiv_id":"2308.09618","citations":null},"leading_other_bearer":{"arxiv_id":"1708.03888","title":"Large Batch Training of Convolutional Networks","citations":977,"named_by":["acronym_expansion"],"bearer_name":"Layer-wise Adaptive Rate Scaling (LARS)","ask_with":"have('1708.03888')"},"n_other_bearers_listed":3,"note":"'LARS' is ALSO the name of 'Layer-wise Adaptive Rate Scaling (LARS)', a method in 'Large Batch Training of Convolutional Networks' (arXiv:1708.03888, 977 citations), which is cited FAR more than the paper this answer is about (citations not recorded). This answer may be about the wrong LARS. If you meant the better-known one, ask again with that entry of `also_named`."},"name_competition_text":"The same name also belongs to “Layer-wise Adaptive Rate Scaling (LARS)”, a method in the paper “Large Batch Training of Convolutional Networks” (arXiv:1708.03888, 977 citations), which the lookup finds cited far more than the paper this answer is about (citations not recorded), so this answer may be about a different sense of the name.","near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2308.09618","page":"/paper/lars-a-diverse-panoptic-maritime-obstacle","syntology_url":"https://syntology.ai/paper/2308.09618","in_graph_layer":false,"samples":0},"line":"about another paper, arXiv:2308.09618: 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:2308.09618, not a method entry. About another paper: this answer is about arXiv:2308.09618, while the archive credits arXiv:1708.03888.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"70b4a8c50b19d831ad8c8b824404eadf88dfe5af691c1149018c21846161c001","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}