{"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/sgd/papers/ran/2","list_of":"/method/sgd","method":"SGD","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not isolate this method inside it.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,192],"of":192,"counts":{"archive_papers_tagged":2021,"with_a_code_link":591,"where_syntology_ran_a_sample":192,"not_listed_spam_title":0,"listed":2021,"listed_where_code_ran":192,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":161,"every_run_a_failure_of_syntologys_instrument":31,"listed_with_a_run_with_no_instrument_failure":161,"listed_every_run_a_failure_of_syntologys_instrument":31,"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"},"first_page":"/method/sgd/papers/ran/1","prev":"/method/sgd/papers/ran/1","next":null,"papers":[{"paper":"/paper/the-sobolev-regularization-effect-of","slug":"the-sobolev-regularization-effect-of","title":"On Linear Stability of SGD and Input-Smoothness of Neural Networks","date":"2021-05-27","arxiv_id":"2105.13462","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ChaoMa93/Sobolev-Reg-of-SGD"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/positive-negative-momentum-manipulating","slug":"positive-negative-momentum-manipulating","title":"Positive-Negative Momentum: Manipulating Stochastic Gradient Noise to Improve Generalization","date":"2021-03-31","arxiv_id":"2103.17182","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["zeke-xie/Positive-Negative-Momentum"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/repurposing-pretrained-models-for-robust-out-1","slug":"repurposing-pretrained-models-for-robust-out-1","title":"Repurposing Pretrained Models for Robust Out-of-domain Few-Shot Learning","date":"2021-03-16","arxiv_id":"2103.09027","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["NamyeongK/USA_UFGSM"],"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":["official"]}}},{"paper":"/paper/permutation-based-sgd-is-random-optimal","slug":"permutation-based-sgd-is-random-optimal","title":"Permutation-Based SGD: Is Random Optimal?","date":"2021-02-19","arxiv_id":"2102.09718","n_code_links":1,"syntology":{"ran":4,"of":6,"n_ran_checked":4,"n_instrument":0,"unverified":2,"pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["shashankrajput/flipflop"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/gradinit-learning-to-initialize-neural","slug":"gradinit-learning-to-initialize-neural","title":"GradInit: Learning to Initialize Neural Networks for Stable and Efficient Training","date":"2021-02-16","arxiv_id":"2102.08098","n_code_links":2,"syntology":{"ran":7,"of":13,"n_ran_checked":4,"n_instrument":3,"unverified":6,"pointer_only":12,"phrase":"7 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; 3 where Syntology's instrument failed) · 6 unverified","official":{"repos":["zhuchen03/gradinit"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/intsgd-floatless-compression-of-stochastic","slug":"intsgd-floatless-compression-of-stochastic","title":"IntSGD: Adaptive Floatless Compression of Stochastic Gradients","date":"2021-02-16","arxiv_id":"2102.08374","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":["bokunwang1/intsgd"],"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/learning-by-turning-neural-architecture-aware","slug":"learning-by-turning-neural-architecture-aware","title":"Learning by Turning: Neural Architecture Aware Optimisation","date":"2021-02-14","arxiv_id":"2102.07227","n_code_links":2,"syntology":{"ran":5,"of":5,"n_ran_checked":2,"n_instrument":3,"unverified":0,"pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["jxbz/nero"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/proximal-and-federated-random-reshuffling","slug":"proximal-and-federated-random-reshuffling","title":"Proximal and Federated Random Reshuffling","date":"2021-02-12","arxiv_id":"2102.06704","n_code_links":1,"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: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["konstmish/rr_prox_fed"],"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/neural-mechanics-symmetry-and-broken","slug":"neural-mechanics-symmetry-and-broken","title":"Neural Mechanics: Symmetry and Broken Conservation Laws in Deep Learning Dynamics","date":"2020-12-08","arxiv_id":"2012.04728","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["danielkunin/neural-mechanics"],"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":["official"]}}},{"paper":"/paper/adaptive-gradient-quantization-for-data","slug":"adaptive-gradient-quantization-for-data","title":"Adaptive Gradient Quantization for Data-Parallel SGD","date":"2020-10-23","arxiv_id":"2010.12460","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["tabrizian/learning-to-quantize"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/adabelief-optimizer-adapting-stepsizes-by-the","slug":"adabelief-optimizer-adapting-stepsizes-by-the","title":"AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradients","date":"2020-10-15","arxiv_id":"2010.07468","n_code_links":8,"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":{"repos":["juntang-zhuang/Adabelief-Optimizer"],"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/understanding-self-supervised-learning-with","slug":"understanding-self-supervised-learning-with","title":"Understanding Self-supervised Learning with Dual Deep Networks","date":"2020-10-01","arxiv_id":"2010.00578","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["facebookresearch/luckmatters"],"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":["official"]}}},{"paper":"/paper/long-tailed-classification-by-keeping-the-1","slug":"long-tailed-classification-by-keeping-the-1","title":"Long-Tailed Classification by Keeping the Good and Removing the Bad Momentum Causal Effect","date":"2020-09-28","arxiv_id":"2009.12991","n_code_links":2,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","official":{"repos":["KaihuaTang/Long-Tailed-Recognition.pytorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/apollo-an-adaptive-parameter-wise-diagonal","slug":"apollo-an-adaptive-parameter-wise-diagonal","title":"Apollo: An Adaptive Parameter-wise Diagonal Quasi-Newton Method for Nonconvex Stochastic Optimization","date":"2020-09-28","arxiv_id":"2009.13586","n_code_links":3,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["XuezheMax/apollo"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/anomalous-diffusion-dynamics-of-learning-in","slug":"anomalous-diffusion-dynamics-of-learning-in","title":"Anomalous diffusion dynamics of learning in deep neural networks","date":"2020-09-22","arxiv_id":"2009.10588","n_code_links":1,"syntology":{"ran":9,"of":11,"n_ran_checked":9,"n_instrument":0,"unverified":2,"pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["ifgovh/Anomalous-diffusion-dynamics-of-SGD"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/nas-bench-301-and-the-case-for-surrogate","slug":"nas-bench-301-and-the-case-for-surrogate","title":"Surrogate NAS Benchmarks: Going Beyond the Limited Search Spaces of Tabular NAS Benchmarks","date":"2020-08-22","arxiv_id":"2008.09777","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["automl/nasbench301"],"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":["official"]}}},{"paper":"/paper/obtaining-adjustable-regularization-for-free","slug":"obtaining-adjustable-regularization-for-free","title":"Obtaining Adjustable Regularization for Free via Iterate Averaging","date":"2020-08-15","arxiv_id":"2008.06736","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"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) · 1 unverified","official":{"repos":["uuujf/IterAvg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/mime-mimicking-centralized-stochastic","slug":"mime-mimicking-centralized-stochastic","title":"Mime: Mimicking Centralized Stochastic Algorithms in Federated Learning","date":"2020-08-08","arxiv_id":"2008.03606","n_code_links":1,"syntology":{"ran":5,"of":6,"n_ran_checked":4,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/multi-level-local-sgd-for-heterogeneous","slug":"multi-level-local-sgd-for-heterogeneous","title":"Multi-Level Local SGD for Heterogeneous Hierarchical Networks","date":"2020-07-27","arxiv_id":"2007.13819","n_code_links":1,"syntology":{"ran":10,"of":17,"n_ran_checked":5,"n_instrument":5,"unverified":7,"pointer_only":17,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","official":{"repos":["rpi-nsl/MLL-SGD"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":"/paper/economical-ensembles-with-hypernetworks","slug":"economical-ensembles-with-hypernetworks","title":"Neural networks with late-phase weights","date":"2020-07-25","arxiv_id":"2007.12927","n_code_links":2,"syntology":{"ran":1,"of":3,"n_ran_checked":0,"n_instrument":1,"unverified":2,"pointer_only":3,"phrase":"1 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; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["google/uncertainty-baselines","seijin-kobayashi/late-phase-weights"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/tdprop-does-jacobi-preconditioning-help","slug":"tdprop-does-jacobi-preconditioning-help","title":"TDprop: Does Jacobi Preconditioning Help Temporal Difference Learning?","date":"2020-07-06","arxiv_id":"2007.02786","n_code_links":0,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":null}},{"paper":"/paper/adai-separating-the-effects-of-adaptive","slug":"adai-separating-the-effects-of-adaptive","title":"Adai: Separating the Effects of Adaptive Learning Rate and Momentum Inertia","date":"2020-06-29","arxiv_id":"2006.15815","n_code_links":1,"syntology":{"ran":5,"of":6,"n_ran_checked":4,"n_instrument":1,"unverified":1,"pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["zeke-xie/adaptive-inertia-adai"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/generalisation-guarantees-for-continual","slug":"generalisation-guarantees-for-continual","title":"Generalisation Guarantees for Continual Learning with Orthogonal Gradient Descent","date":"2020-06-21","arxiv_id":"2006.11942","n_code_links":1,"syntology":{"ran":5,"of":9,"n_ran_checked":4,"n_instrument":1,"unverified":4,"pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","official":{"repos":["MehdiAbbanaBennani/continual-learning-ogdplus"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/hausdorff-dimension-stochastic-differential","slug":"hausdorff-dimension-stochastic-differential","title":"Hausdorff Dimension, Heavy Tails, and Generalization in Neural Networks","date":"2020-06-16","arxiv_id":"2006.09313","n_code_links":1,"syntology":{"ran":9,"of":12,"n_ran_checked":9,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["umutsimsekli/Hausdorff-Dimension-and-Generalization"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/directional-pruning-of-deep-neural-networks","slug":"directional-pruning-of-deep-neural-networks","title":"Directional Pruning of Deep Neural Networks","date":"2020-06-16","arxiv_id":"2006.09358","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["donlan2710/gRDA-Optimizer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/slowing-down-the-weight-norm-increase-in","slug":"slowing-down-the-weight-norm-increase-in","title":"AdamP: Slowing Down the Slowdown for Momentum Optimizers on Scale-invariant Weights","date":"2020-06-15","arxiv_id":"2006.08217","n_code_links":4,"syntology":{"ran":4,"of":4,"n_ran_checked":2,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["clovaai/AdamP"],"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":["named_in_paper"]}}},{"paper":"/paper/auditing-differentially-private-machine","slug":"auditing-differentially-private-machine","title":"Auditing Differentially Private Machine Learning: How Private is Private SGD?","date":"2020-06-13","arxiv_id":"2006.07709","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":6,"n_instrument":0,"unverified":1,"pointer_only":0,"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) · 1 unverified","official":{"repos":["jagielski/auditing-dpsgd"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/adaptive-gradient-methods-converge-faster","slug":"adaptive-gradient-methods-converge-faster","title":"Adaptive Gradient Methods Converge Faster with Over-Parameterization (but you should do a line-search)","date":"2020-06-11","arxiv_id":"2006.06835","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/random-reshuffling-simple-analysis-with-vast","slug":"random-reshuffling-simple-analysis-with-vast","title":"Random Reshuffling: Simple Analysis with Vast Improvements","date":"2020-06-10","arxiv_id":"2006.05988","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":6,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["konstmish/random_reshuffling"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/adahessian-an-adaptive-second-order-optimizer","slug":"adahessian-an-adaptive-second-order-optimizer","title":"ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning","date":"2020-06-01","arxiv_id":"2006.00719","n_code_links":4,"syntology":{"ran":5,"of":11,"n_ran_checked":4,"n_instrument":1,"unverified":6,"pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","official":{"repos":["amirgholami/adahessian"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/stochastic-optimization-with-heavy-tailed","slug":"stochastic-optimization-with-heavy-tailed","title":"Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping","date":"2020-05-21","arxiv_id":"2005.10785","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":0,"n_instrument":2,"unverified":2,"pointer_only":4,"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) · 2 unverified","official":{"repos":["eduardgorbunov/accelerated_clipping"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/understanding-the-difficulty-of-training","slug":"understanding-the-difficulty-of-training","title":"Understanding the Difficulty of Training Transformers","date":"2020-04-17","arxiv_id":"2004.08249","n_code_links":2,"syntology":{"ran":4,"of":5,"n_ran_checked":3,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"4 ran (of which 2 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) · 1 unverified","official":{"repos":["LiyuanLucasLiu/Transforemr-Clinic"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/fda-fourier-domain-adaptation-for-semantic","slug":"fda-fourier-domain-adaptation-for-semantic","title":"FDA: Fourier Domain Adaptation for Semantic Segmentation","date":"2020-04-11","arxiv_id":"2004.05498","n_code_links":3,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["YanchaoYang/FDA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/data-parallelism-in-training-sparse-neural","slug":"data-parallelism-in-training-sparse-neural","title":"Understanding the Effects of Data Parallelism and Sparsity on Neural Network Training","date":"2020-03-25","arxiv_id":"2003.11316","n_code_links":0,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/neural-kernels-without-tangents","slug":"neural-kernels-without-tangents","title":"Neural Kernels Without Tangents","date":"2020-03-04","arxiv_id":"2003.02237","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/on-pruning-adversarially-robust-neural","slug":"on-pruning-adversarially-robust-neural","title":"HYDRA: Pruning Adversarially Robust Neural Networks","date":"2020-02-24","arxiv_id":"2002.10509","n_code_links":4,"syntology":{"ran":4,"of":19,"n_ran_checked":4,"n_instrument":0,"unverified":15,"pointer_only":17,"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) · 15 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","official":{"repos":["inspire-group/compactness-robustness"],"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/learning-to-continually-learn","slug":"learning-to-continually-learn","title":"Learning to Continually Learn","date":"2020-02-21","arxiv_id":"2002.09571","n_code_links":5,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["uvm-neurobotics-lab/ANML"],"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/on-last-layer-algorithms-for-classification","slug":"on-last-layer-algorithms-for-classification","title":"On Last-Layer Algorithms for Classification: Decoupling Representation from Uncertainty Estimation","date":"2020-01-22","arxiv_id":"2001.08049","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["nbrosse/uncertainties"],"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":["official"]}}},{"paper":"/paper/harmonic-convolutional-networks-based-on","slug":"harmonic-convolutional-networks-based-on","title":"Harmonic Convolutional Networks based on Discrete Cosine Transform","date":"2020-01-18","arxiv_id":"2001.06570","n_code_links":1,"syntology":{"ran":10,"of":10,"n_ran_checked":10,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["matej-ulicny/harmonic-networks"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/on-the-intrinsic-privacy-of-stochastic","slug":"on-the-intrinsic-privacy-of-stochastic","title":"An Empirical Study on the Intrinsic Privacy of SGD","date":"2019-12-05","arxiv_id":"1912.02919","n_code_links":1,"syntology":{"ran":11,"of":16,"n_ran_checked":11,"n_instrument":0,"unverified":5,"pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["microsoft/intrinsic-private-sgd"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/local-sgd-with-periodic-averaging-tighter","slug":"local-sgd-with-periodic-averaging-tighter","title":"Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronization","date":"2019-10-30","arxiv_id":"1910.13598","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":{"repos":["mmkamani7/LUPA-SGD"],"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/freeanchor-learning-to-match-anchors-for","slug":"freeanchor-learning-to-match-anchors-for","title":"FreeAnchor: Learning to Match Anchors for Visual Object Detection","date":"2019-09-05","arxiv_id":"1909.02466","n_code_links":4,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zhangxiaosong18/FreeAnchor"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/nuqsgd-improved-communication-efficiency-for","slug":"nuqsgd-improved-communication-efficiency-for","title":"NUQSGD: Improved Communication Efficiency for Data-parallel SGD via Nonuniform Quantization","date":"2019-08-16","arxiv_id":"1908.06077","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["fartashf/nuqsgd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/the-hsic-bottleneck-deep-learning-without","slug":"the-hsic-bottleneck-deep-learning-without","title":"The HSIC Bottleneck: Deep Learning without Back-Propagation","date":"2019-08-05","arxiv_id":"1908.01580","n_code_links":3,"syntology":{"ran":4,"of":16,"n_ran_checked":3,"n_instrument":1,"unverified":12,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 12 unverified","official":{"repos":["choasma/HSIC-Bottleneck"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":10,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/a-stochastic-first-order-method-for-ordered","slug":"a-stochastic-first-order-method-for-ordered","title":"Ordered SGD: A New Stochastic Optimization Framework for Empirical Risk Minimization","date":"2019-07-09","arxiv_id":"1907.04371","n_code_links":2,"syntology":{"ran":6,"of":7,"n_ran_checked":5,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"6 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; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["kenjikawaguchi/qSGD"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-data-augmentation-strategies-for","slug":"learning-data-augmentation-strategies-for","title":"Learning Data Augmentation Strategies for Object Detection","date":"2019-06-26","arxiv_id":"1906.11172","n_code_links":6,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["tensorflow/tpu"],"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/data-cleansing-for-models-trained-with-sgd","slug":"data-cleansing-for-models-trained-with-sgd","title":"Data Cleansing for Models Trained with SGD","date":"2019-06-20","arxiv_id":"1906.08473","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["sato9hara/sgd-influence"],"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":["official"]}}},{"paper":"/paper/dynamics-of-stochastic-gradient-descent-for","slug":"dynamics-of-stochastic-gradient-descent-for","title":"Dynamics of stochastic gradient descent for two-layer neural networks in the teacher-student setup","date":"2019-06-18","arxiv_id":"1906.08632","n_code_links":3,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["sgoldt/nn2pp","sgoldt/pyscm"],"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/training-neural-networks-for-and-by","slug":"training-neural-networks-for-and-by","title":"Training Neural Networks for and by Interpolation","date":"2019-06-13","arxiv_id":"1906.05661","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"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) · 1 unverified","official":{"repos":["oval-group/ali-g"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/bad-global-minima-exist-and-sgd-can-reach","slug":"bad-global-minima-exist-and-sgd-can-reach","title":"Bad Global Minima Exist and SGD Can Reach Them","date":"2019-06-06","arxiv_id":"1906.02613","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":["chao1224/BadGlobalMinima"],"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/powersgd-practical-low-rank-gradient","slug":"powersgd-practical-low-rank-gradient","title":"PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimization","date":"2019-05-31","arxiv_id":"1905.13727","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["epfml/powersgd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/stochastic-gradient-methods-with-layer-wise","slug":"stochastic-gradient-methods-with-layer-wise","title":"Stochastic Gradient Methods with Layer-wise Adaptive Moments for Training of Deep Networks","date":"2019-05-27","arxiv_id":"1905.11286","n_code_links":3,"syntology":{"ran":13,"of":16,"n_ran_checked":12,"n_instrument":1,"unverified":3,"pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":"/paper/matcha-speeding-up-decentralized-sgd-via","slug":"matcha-speeding-up-decentralized-sgd-via","title":"MATCHA: Speeding Up Decentralized SGD via Matching Decomposition Sampling","date":"2019-05-23","arxiv_id":"1905.09435","n_code_links":4,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/adaptively-truncating-backpropagation-through","slug":"adaptively-truncating-backpropagation-through","title":"Adaptively Truncating Backpropagation Through Time to Control Gradient Bias","date":"2019-05-17","arxiv_id":"1905.07473","n_code_links":1,"syntology":{"ran":18,"of":21,"n_ran_checked":18,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 0 violated, 18 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["aicherc/adaptive_tbptt"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":18,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/190503381","slug":"190503381","title":"AutoAssist: A Framework to Accelerate Training of Deep Neural Networks","date":"2019-05-08","arxiv_id":"1905.03381","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/190503711","slug":"190503711","title":"Processing Megapixel Images with Deep Attention-Sampling Models","date":"2019-05-03","arxiv_id":"1905.03711","n_code_links":2,"syntology":{"ran":6,"of":6,"n_ran_checked":6,"n_instrument":0,"unverified":0,"pointer_only":0,"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) · 0 unverified","official":{"repos":["idiap/attention-sampling"],"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/the-step-decay-schedule-a-near-optimal","slug":"the-step-decay-schedule-a-near-optimal","title":"The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure For Least Squares","date":"2019-04-29","arxiv_id":"1904.12838","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["D-X-Y/ResNeXt-DenseNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/swalp-stochastic-weight-averaging-in-low","slug":"swalp-stochastic-weight-averaging-in-low","title":"SWALP : Stochastic Weight Averaging in Low-Precision Training","date":"2019-04-26","arxiv_id":"1904.11943","n_code_links":3,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["stevenygd/SWALP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/dynamic-mini-batch-sgd-for-elastic","slug":"dynamic-mini-batch-sgd-for-elastic","title":"Dynamic Mini-batch SGD for Elastic Distributed Training: Learning in the Limbo of Resources","date":"2019-04-26","arxiv_id":"1904.12043","n_code_links":2,"syntology":{"ran":13,"of":20,"n_ran_checked":13,"n_instrument":0,"unverified":7,"pointer_only":14,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","official":null}},{"paper":"/paper/reppoints-point-set-representation-for-object","slug":"reppoints-point-set-representation-for-object","title":"RepPoints: Point Set Representation for Object Detection","date":"2019-04-25","arxiv_id":"1904.11490","n_code_links":6,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":3,"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":["microsoft/RepPoints"],"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/drop-an-octave-reducing-spatial-redundancy-in","slug":"drop-an-octave-reducing-spatial-redundancy-in","title":"Drop an Octave: Reducing Spatial Redundancy in Convolutional Neural Networks with Octave Convolution","date":"2019-04-10","arxiv_id":"1904.05049","n_code_links":28,"syntology":{"ran":24,"of":34,"n_ran_checked":11,"n_instrument":13,"unverified":10,"pointer_only":9,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 13 where Syntology's instrument failed) · 10 unverified","official":{"repos":["facebookresearch/OctConv"],"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/communication-efficient-distributed-sgd-with","slug":"communication-efficient-distributed-sgd-with","title":"Communication-efficient distributed SGD with Sketching","date":"2019-03-12","arxiv_id":"1903.04488","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["dhroth/sketchedsgd"],"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":["official"]}}},{"paper":"/paper/fall-of-empires-breaking-byzantine-tolerant","slug":"fall-of-empires-breaking-byzantine-tolerant","title":"Fall of Empires: Breaking Byzantine-tolerant SGD by Inner Product Manipulation","date":"2019-03-10","arxiv_id":"1903.03936","n_code_links":4,"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/multigrain-a-unified-image-embedding-for","slug":"multigrain-a-unified-image-embedding-for","title":"MultiGrain: a unified image embedding for classes and instances","date":"2019-02-14","arxiv_id":"1902.05509","n_code_links":3,"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":["facebookresearch/multigrain"],"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-baseline-for-bayesian-uncertainty-in","slug":"a-simple-baseline-for-bayesian-uncertainty-in","title":"A Simple Baseline for Bayesian Uncertainty in Deep Learning","date":"2019-02-07","arxiv_id":"1902.02476","n_code_links":8,"syntology":{"ran":11,"of":17,"n_ran_checked":10,"n_instrument":1,"unverified":6,"pointer_only":9,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","official":{"repos":["wjmaddox/swa_gaussian"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/asymmetric-valleys-beyond-sharp-and-flat","slug":"asymmetric-valleys-beyond-sharp-and-flat","title":"Asymmetric Valleys: Beyond Sharp and Flat Local Minima","date":"2019-02-02","arxiv_id":"1902.00744","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":null}},{"paper":"/paper/error-feedback-fixes-signsgd-and-other","slug":"error-feedback-fixes-signsgd-and-other","title":"Error Feedback Fixes SignSGD and other Gradient Compression Schemes","date":"2019-01-28","arxiv_id":"1901.09847","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["epfml/error-feedback-SGD"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/espnetv2-a-light-weight-power-efficient-and","slug":"espnetv2-a-light-weight-power-efficient-and","title":"ESPNetv2: A Light-weight, Power Efficient, and General Purpose Convolutional Neural Network","date":"2018-11-28","arxiv_id":"1811.11431","n_code_links":10,"syntology":{"ran":4,"of":4,"n_ran_checked":2,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["sacmehta/EdgeNets"],"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/stochastic-gradient-push-for-distributed-deep","slug":"stochastic-gradient-push-for-distributed-deep","title":"Stochastic Gradient Push for Distributed Deep Learning","date":"2018-11-27","arxiv_id":"1811.10792","n_code_links":3,"syntology":{"ran":10,"of":15,"n_ran_checked":10,"n_instrument":0,"unverified":5,"pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":null}},{"paper":"/paper/deep-frank-wolfe-for-neural-network","slug":"deep-frank-wolfe-for-neural-network","title":"Deep Frank-Wolfe For Neural Network Optimization","date":"2018-11-19","arxiv_id":"1811.07591","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["oval-group/dfw"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/quasi-hyperbolic-momentum-and-adam-for-deep","slug":"quasi-hyperbolic-momentum-and-adam-for-deep","title":"Quasi-hyperbolic momentum and Adam for deep learning","date":"2018-10-16","arxiv_id":"1810.06801","n_code_links":2,"syntology":{"ran":6,"of":7,"n_ran_checked":6,"n_instrument":0,"unverified":1,"pointer_only":7,"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) · 1 unverified","official":{"repos":["facebookresearch/qhoptim"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/signsgd-with-majority-vote-is-communication","slug":"signsgd-with-majority-vote-is-communication","title":"signSGD with Majority Vote is Communication Efficient And Fault Tolerant","date":"2018-10-11","arxiv_id":"1810.05291","n_code_links":4,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"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/preconditioner-on-matrix-lie-group-for-sgd","slug":"preconditioner-on-matrix-lie-group-for-sgd","title":"Preconditioner on Matrix Lie Group for SGD","date":"2018-09-26","arxiv_id":"1809.10232","n_code_links":2,"syntology":{"ran":5,"of":6,"n_ran_checked":1,"n_instrument":4,"unverified":1,"pointer_only":6,"phrase":"5 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; 4 where Syntology's instrument failed) · 1 unverified","official":{"repos":["lixilinx/psgd_torch"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/sparsified-sgd-with-memory","slug":"sparsified-sgd-with-memory","title":"Sparsified SGD with Memory","date":"2018-09-20","arxiv_id":"1809.07599","n_code_links":1,"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":["epfml/sparsifiedSGD"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-rate-adaptation-for-federated-and","slug":"learning-rate-adaptation-for-federated-and","title":"Learning Rate Adaptation for Federated and Differentially Private Learning","date":"2018-09-11","arxiv_id":"1809.03832","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 0 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) · 0 unverified","official":null}},{"paper":"/paper/small-steps-and-giant-leaps-minimal-newton","slug":"small-steps-and-giant-leaps-minimal-newton","title":"Small steps and giant leaps: Minimal Newton solvers for Deep Learning","date":"2018-05-21","arxiv_id":"1805.08095","n_code_links":6,"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":["jotaf98/curveball"],"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-scalable-discrete-time-survival-model-for","slug":"a-scalable-discrete-time-survival-model-for","title":"A Scalable Discrete-Time Survival Model for Neural Networks","date":"2018-05-02","arxiv_id":"1805.00917","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["MGensheimer/nnet-survival"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/averaging-weights-leads-to-wider-optima-and","slug":"averaging-weights-leads-to-wider-optima-and","title":"Averaging Weights Leads to Wider Optima and Better Generalization","date":"2018-03-14","arxiv_id":"1803.05407","n_code_links":17,"syntology":{"ran":7,"of":9,"n_ran_checked":5,"n_instrument":2,"unverified":2,"pointer_only":4,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["timgaripov/swa"],"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/shampoo-preconditioned-stochastic-tensor","slug":"shampoo-preconditioned-stochastic-tensor","title":"Shampoo: Preconditioned Stochastic Tensor Optimization","date":"2018-02-26","arxiv_id":"1802.09568","n_code_links":3,"syntology":{"ran":4,"of":4,"n_ran_checked":1,"n_instrument":3,"unverified":0,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/signsgd-compressed-optimisation-for-non","slug":"signsgd-compressed-optimisation-for-non","title":"signSGD: Compressed Optimisation for Non-Convex Problems","date":"2018-02-13","arxiv_id":"1802.04434","n_code_links":6,"syntology":{"ran":1,"of":4,"n_ran_checked":1,"n_instrument":0,"unverified":3,"pointer_only":4,"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) · 3 unverified","official":{"repos":["jxbz/signSGD"],"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/decoupled-weight-decay-regularization","slug":"decoupled-weight-decay-regularization","title":"Decoupled Weight Decay Regularization","date":"2017-11-14","arxiv_id":"1711.05101","n_code_links":23,"syntology":{"ran":18,"of":23,"n_ran_checked":18,"n_instrument":0,"unverified":5,"pointer_only":5,"phrase":"18 ran (of which 6 constructed an object rather than computing a result; 18 with no instrument failure: 3 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["GLambard/AdamW_Keras","Yagami123/Caffe-AdamW-AdamWR","loshchil/AdamW-and-SGDW"],"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/dual-path-networks","slug":"dual-path-networks","title":"Dual Path Networks","date":"2017-07-06","arxiv_id":"1707.01629","n_code_links":18,"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":null}},{"paper":"/paper/accurate-large-minibatch-sgd-training","slug":"accurate-large-minibatch-sgd-training","title":"Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour","date":"2017-06-08","arxiv_id":"1706.02677","n_code_links":73,"syntology":{"ran":3,"of":7,"n_ran_checked":0,"n_instrument":3,"unverified":4,"pointer_only":7,"phrase":"3 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; 3 where Syntology's instrument failed) · 4 unverified","official":null}},{"paper":"/paper/computing-nonvacuous-generalization-bounds","slug":"computing-nonvacuous-generalization-bounds","title":"Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data","date":"2017-03-31","arxiv_id":"1703.11008","n_code_links":3,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"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) · 1 unverified","official":null}},{"paper":"/paper/quasi-recurrent-neural-networks","slug":"quasi-recurrent-neural-networks","title":"Quasi-Recurrent Neural Networks","date":"2016-11-05","arxiv_id":"1611.01576","n_code_links":7,"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/lets-keep-it-simple-using-simple","slug":"lets-keep-it-simple-using-simple","title":"Lets keep it simple, Using simple architectures to outperform deeper and more complex architectures","date":"2016-08-22","arxiv_id":"1608.06037","n_code_links":9,"syntology":{"ran":11,"of":11,"n_ran_checked":8,"n_instrument":3,"unverified":0,"pointer_only":0,"phrase":"11 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["Coderx7/SimpleNet"],"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/barzilai-borwein-step-size-for-stochastic","slug":"barzilai-borwein-step-size-for-stochastic","title":"Barzilai-Borwein Step Size for Stochastic Gradient Descent","date":"2016-05-13","arxiv_id":"1605.04131","n_code_links":1,"syntology":{"ran":5,"of":7,"n_ran_checked":5,"n_instrument":0,"unverified":2,"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) · 2 unverified","official":null}},{"paper":"/paper/a-kronecker-factored-approximate-fisher","slug":"a-kronecker-factored-approximate-fisher","title":"A Kronecker-factored approximate Fisher matrix for convolution layers","date":"2016-02-03","arxiv_id":"1602.01407","n_code_links":4,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/preconditioned-stochastic-gradient-descent","slug":"preconditioned-stochastic-gradient-descent","title":"Preconditioned Stochastic Gradient Descent","date":"2015-12-14","arxiv_id":"1512.04202","n_code_links":2,"syntology":{"ran":5,"of":6,"n_ran_checked":1,"n_instrument":4,"unverified":1,"pointer_only":6,"phrase":"5 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; 4 where Syntology's instrument failed) · 1 unverified","official":{"repos":["lixilinx/psgd_torch"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/spatial-transformer-networks","slug":"spatial-transformer-networks","title":"Spatial Transformer Networks","date":"2015-06-05","arxiv_id":"1506.02025","n_code_links":45,"syntology":{"ran":21,"of":31,"n_ran_checked":21,"n_instrument":0,"unverified":10,"pointer_only":0,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 1 honoured, 0 violated, 20 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","official":null}},{"paper":"/paper/on-the-computational-efficiency-of-training","slug":"on-the-computational-efficiency-of-training","title":"On the Computational Efficiency of Training Neural Networks","date":"2014-10-05","arxiv_id":"1410.1141","n_code_links":1,"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":null}},{"paper":"/paper/hogwild-a-lock-free-approach-to-parallelizing","slug":"hogwild-a-lock-free-approach-to-parallelizing","title":"HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent","date":"2011-06-28","arxiv_id":"1106.5730","n_code_links":5,"syntology":{"ran":16,"of":24,"n_ran_checked":16,"n_instrument":0,"unverified":8,"pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","official":null}}],"record_sha256":"4aefaffc7129458de343036094ce5e031bf010d07737deb4c497490c92831b84","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}