{"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":"/task/stochastic-optimization/papers/ran/1","list_of":"/task/stochastic-optimization","task":"Stochastic Optimization","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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 run it on this task or check it against the task's benchmarks.","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":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,91],"of":91,"counts":{"archive_papers_tagged":1387,"with_a_code_link":337,"where_syntology_ran_a_sample":91,"not_listed_spam_title":0,"listed":1387,"listed_where_code_ran":91,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":75,"every_run_a_failure_of_syntologys_instrument":16,"listed_with_a_run_with_no_instrument_failure":75,"listed_every_run_a_failure_of_syntologys_instrument":16,"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":"/task/stochastic-optimization/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/efficient-optimization-with-orthogonality","slug":"efficient-optimization-with-orthogonality","title":"Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method","date":"2025-05-18","arxiv_id":"2505.12378","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/efficient-optimization-with-orthogonality#ran","syntology_url":"https://syntology.ai/paper/2505.12378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.12378"}},"official":{"repos":["andyjm3/RSDM"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/benefits-of-learning-rate-annealing-for","slug":"benefits-of-learning-rate-annealing-for","title":"Benefits of Learning Rate Annealing for Tuning-Robustness in Stochastic Optimization","date":"2025-03-12","arxiv_id":"2503.09411","repositories_listed":0,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benefits-of-learning-rate-annealing-for#ran","syntology_url":"https://syntology.ai/paper/2503.09411","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09411"}},"official":null}},{"url":"/paper/a-nearly-optimal-single-loop-algorithm-for","slug":"a-nearly-optimal-single-loop-algorithm-for","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","date":"2024-12-28","arxiv_id":"2412.20017","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_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) · 1 unverified","sample_list":"/paper/a-nearly-optimal-single-loop-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/2412.20017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.20017"}},"official":{"repos":["MingruiLiu-ML-Lab/Single-Loop-bilevel-Optimizer-under-Unbounded-Smoothness"],"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"]}}},{"url":"/paper/mars-unleashing-the-power-of-variance","slug":"mars-unleashing-the-power-of-variance","title":"MARS: Unleashing the Power of Variance Reduction for Training Large Models","date":"2024-11-15","arxiv_id":"2411.10438","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mars-unleashing-the-power-of-variance#ran","syntology_url":"https://syntology.ai/paper/2411.10438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.10438"}},"official":{"repos":["AGI-Arena/MARS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/fair-and-welfare-efficient-constrained-multi","slug":"fair-and-welfare-efficient-constrained-multi","title":"Fair and Welfare-Efficient Constrained Multi-matchings under Uncertainty","date":"2024-11-04","arxiv_id":"2411.02654","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"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) · 3 unverified","sample_list":"/paper/fair-and-welfare-efficient-constrained-multi#ran","syntology_url":"https://syntology.ai/paper/2411.02654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02654"}},"official":{"repos":["justinpayan/RAU2"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/training-free-diffusion-model-alignment-with","slug":"training-free-diffusion-model-alignment-with","title":"Training-free Diffusion Model Alignment with Sampling Demons","date":"2024-10-08","arxiv_id":"2410.05760","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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) · 1 unverified","sample_list":"/paper/training-free-diffusion-model-alignment-with#ran","syntology_url":"https://syntology.ai/paper/2410.05760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05760"}},"official":{"repos":["aiiu-lab/DemonSampling"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/congo-compressive-online-gradient","slug":"congo-compressive-online-gradient","title":"CONGO: Compressive Online Gradient Optimization","date":"2024-07-08","arxiv_id":"2407.06325","repositories_listed":0,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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) · 2 unverified","sample_list":"/paper/congo-compressive-online-gradient#ran","syntology_url":"https://syntology.ai/paper/2407.06325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06325"}},"official":null}},{"url":"/paper/from-text-to-test-ai-generated-control","slug":"from-text-to-test-ai-generated-control","title":"From Text to Test: AI-Generated Control Software for Materials Science Instruments","date":"2024-06-23","arxiv_id":"2406.16224","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/from-text-to-test-ai-generated-control#ran","syntology_url":"https://syntology.ai/paper/2406.16224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16224"}},"official":{"repos":["nrel/de","nrel/keithley_gpt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-polyak-step-sizes-and-momentum","slug":"stochastic-polyak-step-sizes-and-momentum","title":"Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance","date":"2024-06-06","arxiv_id":"2406.04142","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/stochastic-polyak-step-sizes-and-momentum#ran","syntology_url":"https://syntology.ai/paper/2406.04142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04142"}},"official":{"repos":["dimitris-oik/momsps"],"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"]}}},{"url":"/paper/learning-rate-free-stochastic-optimization","slug":"learning-rate-free-stochastic-optimization","title":"Learning-Rate-Free Stochastic Optimization over Riemannian Manifolds","date":"2024-06-04","arxiv_id":"2406.02296","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/learning-rate-free-stochastic-optimization#ran","syntology_url":"https://syntology.ai/paper/2406.02296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02296"}},"official":{"repos":["daniel-dodd/riemannian_dog"],"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"]}}},{"url":"/paper/soul-unlocking-the-power-of-second-order","slug":"soul-unlocking-the-power-of-second-order","title":"SOUL: Unlocking the Power of Second-Order Optimization for LLM Unlearning","date":"2024-04-28","arxiv_id":"2404.18239","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"3 ran (of which 1 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) · 3 unverified","sample_list":"/paper/soul-unlocking-the-power-of-second-order#ran","syntology_url":"https://syntology.ai/paper/2404.18239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.18239"}},"official":{"repos":["optml-group/soul"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/pasoa-particle-based-bayesian-optimal","slug":"pasoa-particle-based-bayesian-optimal","title":"PASOA- PArticle baSed Bayesian Optimal Adaptive design","date":"2024-02-11","arxiv_id":"2402.07160","repositories_listed":1,"syntology":{"n":16,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":9,"n_honours":0,"n_violates":2,"n_no_contract":4,"n_pointer_only":5,"phrase":"7 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; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/pasoa-particle-based-bayesian-optimal#ran","syntology_url":"https://syntology.ai/paper/2402.07160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07160"}},"official":{"repos":["iolloj/pasoa"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/why-do-we-need-weight-decay-in-modern-deep","slug":"why-do-we-need-weight-decay-in-modern-deep","title":"Why Do We Need Weight Decay in Modern Deep Learning?","date":"2023-10-06","arxiv_id":"2310.04415","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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","sample_list":"/paper/why-do-we-need-weight-decay-in-modern-deep#ran","syntology_url":"https://syntology.ai/paper/2310.04415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04415"}},"official":{"repos":["tml-epfl/why-weight-decay"],"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"]}}},{"url":"/paper/quasi-monte-carlo-for-3d-sliced-wasserstein","slug":"quasi-monte-carlo-for-3d-sliced-wasserstein","title":"Quasi-Monte Carlo for 3D Sliced Wasserstein","date":"2023-09-21","arxiv_id":"2309.11713","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/quasi-monte-carlo-for-3d-sliced-wasserstein#ran","syntology_url":"https://syntology.ai/paper/2309.11713","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.11713"}},"official":{"repos":["khainb/quasi-sw"],"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"]}}},{"url":"/paper/promise-preconditioned-stochastic","slug":"promise-preconditioned-stochastic","title":"PROMISE: Preconditioned Stochastic Optimization Methods by Incorporating Scalable Curvature Estimates","date":"2023-09-05","arxiv_id":"2309.02014","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/promise-preconditioned-stochastic#ran","syntology_url":"https://syntology.ai/paper/2309.02014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.02014"}},"official":{"repos":["udellgroup/promise"],"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"]}}},{"url":"/paper/serverless-federated-auprc-optimization-for","slug":"serverless-federated-auprc-optimization-for","title":"Serverless Federated AUPRC Optimization for Multi-Party Collaborative Imbalanced Data Mining","date":"2023-08-06","arxiv_id":"2308.03035","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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","sample_list":"/paper/serverless-federated-auprc-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2308.03035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.03035"}},"official":{"repos":["xidongwu/d-auprc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/noise-stability-optimization-for-flat-minima","slug":"noise-stability-optimization-for-flat-minima","title":"Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach","date":"2023-06-14","arxiv_id":"2306.08553","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/noise-stability-optimization-for-flat-minima#ran","syntology_url":"https://syntology.ai/paper/2306.08553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08553"}},"official":{"repos":["virtuosoresearch/noise-stability-optimization"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-characteristic-activation-value","slug":"neural-characteristic-activation-value","title":"Neural Characteristic Activation Analysis and Geometric Parameterization for ReLU Networks","date":"2023-05-25","arxiv_id":"2305.15912","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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) · 3 unverified","sample_list":"/paper/neural-characteristic-activation-value#ran","syntology_url":"https://syntology.ai/paper/2305.15912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15912"}},"official":{"repos":["Wenlin-Chen/geometric-parameterization"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/sophia-a-scalable-stochastic-second-order","slug":"sophia-a-scalable-stochastic-second-order","title":"Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-training","date":"2023-05-23","arxiv_id":"2305.14342","repositories_listed":7,"syntology":{"n":19,"n_ran":13,"n_constructed":4,"n_ran_checked":12,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"13 ran (of which 4 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/sophia-a-scalable-stochastic-second-order#ran","syntology_url":"https://syntology.ai/paper/2305.14342","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14342"}},"official":null}},{"url":"/paper/momo-momentum-models-for-adaptive-learning","slug":"momo-momentum-models-for-adaptive-learning","title":"MoMo: Momentum Models for Adaptive Learning Rates","date":"2023-05-12","arxiv_id":"2305.07583","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/momo-momentum-models-for-adaptive-learning#ran","syntology_url":"https://syntology.ai/paper/2305.07583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.07583"}},"official":{"repos":["fabian-sp/MoMo"],"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"]}}},{"url":"/paper/black-box-variational-inference-with-a","slug":"black-box-variational-inference-with-a","title":"Black Box Variational Inference with a Deterministic Objective: Faster, More Accurate, and Even More Black Box","date":"2023-04-11","arxiv_id":"2304.05527","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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","sample_list":"/paper/black-box-variational-inference-with-a#ran","syntology_url":"https://syntology.ai/paper/2304.05527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05527"}},"official":{"repos":["rgiordan/dadvipaper"],"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"]}}},{"url":"/paper/combinatorial-optimization-enriched-machine","slug":"combinatorial-optimization-enriched-machine","title":"Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle Routing Problem with Time Windows","date":"2023-04-03","arxiv_id":"2304.00789","repositories_listed":1,"syntology":{"n":21,"n_ran":14,"n_constructed":2,"n_ran_checked":9,"n_instrument":5,"n_unverified":7,"n_honours":5,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"14 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 5 honoured, 0 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/combinatorial-optimization-enriched-machine#ran","syntology_url":"https://syntology.ai/paper/2304.00789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00789"}},"official":{"repos":["tumbais/euro-meets-neurips-2022"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":2,"n_ran_no_instrument_failure":9,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/variational-linearized-laplace-approximation","slug":"variational-linearized-laplace-approximation","title":"Variational Linearized Laplace Approximation for Bayesian Deep Learning","date":"2023-02-24","arxiv_id":"2302.12565","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/variational-linearized-laplace-approximation#ran","syntology_url":"https://syntology.ai/paper/2302.12565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12565"}},"official":{"repos":["ludvins/variational-lla"],"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"]}}},{"url":"/paper/target-based-surrogates-for-stochastic","slug":"target-based-surrogates-for-stochastic","title":"Target-based Surrogates for Stochastic Optimization","date":"2023-02-06","arxiv_id":"2302.02607","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"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) · 3 unverified","sample_list":"/paper/target-based-surrogates-for-stochastic#ran","syntology_url":"https://syntology.ai/paper/2302.02607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02607"}},"official":{"repos":["wilderlavington/target-based-surrogates-for-stochastic-optimization"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-stochastic-optimization-with","slug":"end-to-end-stochastic-optimization-with","title":"End-to-End Stochastic Optimization with Energy-Based Model","date":"2022-11-25","arxiv_id":"2211.13837","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/end-to-end-stochastic-optimization-with#ran","syntology_url":"https://syntology.ai/paper/2211.13837","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.13837"}},"official":{"repos":["Lingkai-Kong/SO-EBM"],"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"]}}},{"url":"/paper/on-demand-sampling-learning-optimally-from","slug":"on-demand-sampling-learning-optimally-from","title":"On-Demand Sampling: Learning Optimally from Multiple Distributions","date":"2022-10-22","arxiv_id":"2210.12529","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/on-demand-sampling-learning-optimally-from#ran","syntology_url":"https://syntology.ai/paper/2210.12529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12529"}},"official":{"repos":["ericzhao28/multidistributionlearning"],"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"]}}},{"url":"/paper/minimax-auc-fairness-efficient-algorithm-with","slug":"minimax-auc-fairness-efficient-algorithm-with","title":"Minimax AUC Fairness: Efficient Algorithm with Provable Convergence","date":"2022-08-22","arxiv_id":"2208.10451","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_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","sample_list":"/paper/minimax-auc-fairness-efficient-algorithm-with#ran","syntology_url":"https://syntology.ai/paper/2208.10451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.10451"}},"official":{"repos":["zhenhuan-yang/minimaxfairauc"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/log-barriers-for-safe-black-box-optimization","slug":"log-barriers-for-safe-black-box-optimization","title":"Log Barriers for Safe Black-box Optimization with Application to Safe Reinforcement Learning","date":"2022-07-21","arxiv_id":"2207.10415","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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) · 2 unverified","sample_list":"/paper/log-barriers-for-safe-black-box-optimization#ran","syntology_url":"https://syntology.ai/paper/2207.10415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10415"}},"official":{"repos":["ilnura/lb_sgd","lasgroup/lbsgd-rl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/benchopt-reproducible-efficient-and","slug":"benchopt-reproducible-efficient-and","title":"Benchopt: Reproducible, efficient and collaborative optimization benchmarks","date":"2022-06-27","arxiv_id":"2206.13424","repositories_listed":3,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_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) · 4 unverified","sample_list":"/paper/benchopt-reproducible-efficient-and#ran","syntology_url":"https://syntology.ai/paper/2206.13424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13424"}},"official":{"repos":["benchopt/benchopt"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/predictor-corrector-algorithms-for-stochastic","slug":"predictor-corrector-algorithms-for-stochastic","title":"Predictor-corrector algorithms for stochastic optimization under gradual distribution shift","date":"2022-05-26","arxiv_id":"2205.13575","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"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) · 4 unverified","sample_list":"/paper/predictor-corrector-algorithms-for-stochastic#ran","syntology_url":"https://syntology.ai/paper/2205.13575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13575"}},"official":{"repos":["smaityumich/concept-drift"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/communication-efficient-adaptive-federated","slug":"communication-efficient-adaptive-federated","title":"Communication-Efficient Adaptive Federated Learning","date":"2022-05-05","arxiv_id":"2205.02719","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/communication-efficient-adaptive-federated#ran","syntology_url":"https://syntology.ai/paper/2205.02719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.02719"}},"official":null}},{"url":"/paper/socially-fair-mitigation-of-misinformation-on","slug":"socially-fair-mitigation-of-misinformation-on","title":"Socially Fair Mitigation of Misinformation on Social Networks via Constraint Stochastic Optimization","date":"2022-03-23","arxiv_id":"2203.12537","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/socially-fair-mitigation-of-misinformation-on#ran","syntology_url":"https://syntology.ai/paper/2203.12537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12537"}},"official":{"repos":["ahmed-abouzeid/mmss"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-learning-with-dynamic-convex","slug":"reinforcement-learning-with-dynamic-convex","title":"Reinforcement Learning with Dynamic Convex Risk Measures","date":"2021-12-26","arxiv_id":"2112.13414","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/reinforcement-learning-with-dynamic-convex#ran","syntology_url":"https://syntology.ai/paper/2112.13414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.13414"}},"official":{"repos":["acoache/rl-dynamicconvexrisk"],"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"]}}},{"url":"/paper/bcd-nets-scalable-variational-approaches-for-1","slug":"bcd-nets-scalable-variational-approaches-for-1","title":"BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery","date":"2021-12-06","arxiv_id":"2112.02761","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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","sample_list":"/paper/bcd-nets-scalable-variational-approaches-for-1#ran","syntology_url":"https://syntology.ai/paper/2112.02761","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.02761"}},"official":{"repos":["ermongroup/bcd-nets"],"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"]}}},{"url":"/paper/stochastic-optimization-under-time-drift","slug":"stochastic-optimization-under-time-drift","title":"Stochastic Optimization under Distributional Drift","date":"2021-08-16","arxiv_id":"2108.07356","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stochastic-optimization-under-time-drift#ran","syntology_url":"https://syntology.ai/paper/2108.07356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.07356"}},"official":{"repos":["joshuacutler/TimeDriftExperiments"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/locally-differentially-private-federated","slug":"locally-differentially-private-federated","title":"Private Federated Learning Without a Trusted Server: Optimal Algorithms for Convex Losses","date":"2021-06-17","arxiv_id":"2106.09779","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/locally-differentially-private-federated#ran","syntology_url":"https://syntology.ai/paper/2106.09779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09779"}},"official":{"repos":["lowya/Locally-Differentially-Private-Federated-Learning","lowya/private-federated-learning-without-a-trusted-server"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scaling-up-graph-neural-networks-via-graph","slug":"scaling-up-graph-neural-networks-via-graph","title":"Scaling Up Graph Neural Networks Via Graph Coarsening","date":"2021-06-09","arxiv_id":"2106.05150","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_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) · 2 unverified","sample_list":"/paper/scaling-up-graph-neural-networks-via-graph#ran","syntology_url":"https://syntology.ai/paper/2106.05150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05150"}},"official":{"repos":["szzhang17/Scaling-Up-Graph-Neural-Networks-Via-Graph-Coarsening"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/differentiable-quality-diversity","slug":"differentiable-quality-diversity","title":"Differentiable Quality Diversity","date":"2021-06-07","arxiv_id":"2106.03894","repositories_listed":3,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/differentiable-quality-diversity#ran","syntology_url":"https://syntology.ai/paper/2106.03894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03894"}},"official":{"repos":["icaros-usc/dqd","icaros-usc/pyribs"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-iterative-graph-matching","slug":"stochastic-iterative-graph-matching","title":"Stochastic Iterative Graph Matching","date":"2021-06-04","arxiv_id":"2106.02206","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stochastic-iterative-graph-matching#ran","syntology_url":"https://syntology.ai/paper/2106.02206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02206"}},"official":null}},{"url":"/paper/polygonal-unadjusted-langevin-algorithms","slug":"polygonal-unadjusted-langevin-algorithms","title":"Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networks","date":"2021-05-28","arxiv_id":"2105.13937","repositories_listed":2,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/polygonal-unadjusted-langevin-algorithms#ran","syntology_url":"https://syntology.ai/paper/2105.13937","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13937"}},"official":null}},{"url":"/paper/fermi-fair-empirical-risk-minimization-via","slug":"fermi-fair-empirical-risk-minimization-via","title":"A Stochastic Optimization Framework for Fair Risk Minimization","date":"2021-02-24","arxiv_id":"2102.12586","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fermi-fair-empirical-risk-minimization-via#ran","syntology_url":"https://syntology.ai/paper/2102.12586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12586"}},"official":{"repos":["optimization-for-data-driven-science/FERMI"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/sinkhorn-label-allocation-semi-supervised","slug":"sinkhorn-label-allocation-semi-supervised","title":"Sinkhorn Label Allocation: Semi-Supervised Classification via Annealed Self-Training","date":"2021-02-17","arxiv_id":"2102.08622","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sinkhorn-label-allocation-semi-supervised#ran","syntology_url":"https://syntology.ai/paper/2102.08622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.08622"}},"official":{"repos":["stanford-futuredata/sinkhorn-label-allocation"],"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"]}}},{"url":"/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","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_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","sample_list":"/paper/apollo-an-adaptive-parameter-wise-diagonal#ran","syntology_url":"https://syntology.ai/paper/2009.13586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13586"}},"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"]}}},{"url":"/paper/stochastic-optimization-forests","slug":"stochastic-optimization-forests","title":"Stochastic Optimization Forests","date":"2020-08-17","arxiv_id":"2008.07473","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/stochastic-optimization-forests#ran","syntology_url":"https://syntology.ai/paper/2008.07473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.07473"}},"official":{"repos":["CausalML/StochOptForest"],"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"]}}},{"url":"/paper/randomized-automatic-differentiation","slug":"randomized-automatic-differentiation","title":"Randomized Automatic Differentiation","date":"2020-07-20","arxiv_id":"2007.10412","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":1,"n_ran_checked":1,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"5 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/randomized-automatic-differentiation#ran","syntology_url":"https://syntology.ai/paper/2007.10412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.10412"}},"official":{"repos":["PrincetonLIPS/RandomizedAutomaticDifferentiation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-better-alternative-to-error-feedback-for","slug":"a-better-alternative-to-error-feedback-for","title":"A Better Alternative to Error Feedback for Communication-Efficient Distributed Learning","date":"2020-06-19","arxiv_id":"2006.11077","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/a-better-alternative-to-error-feedback-for#ran","syntology_url":"https://syntology.ai/paper/2006.11077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11077"}},"official":{"repos":["SamuelHorvath/Compressed_SGD_PyTorch"],"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"]}}},{"url":"/paper/stochastic-optimization-for-performative","slug":"stochastic-optimization-for-performative","title":"Stochastic Optimization for Performative Prediction","date":"2020-06-12","arxiv_id":"2006.06887","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_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) · 1 unverified","sample_list":"/paper/stochastic-optimization-for-performative#ran","syntology_url":"https://syntology.ai/paper/2006.06887","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06887"}},"official":{"repos":["zykls/performative-prediction"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":4,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_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","sample_list":"/paper/adahessian-an-adaptive-second-order-optimizer#ran","syntology_url":"https://syntology.ai/paper/2006.00719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.00719"}},"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"]}}},{"url":"/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","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/stochastic-optimization-with-heavy-tailed#ran","syntology_url":"https://syntology.ai/paper/2005.10785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10785"}},"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"]}}},{"url":"/paper/unbiased-mlmc-stochastic-gradient-based","slug":"unbiased-mlmc-stochastic-gradient-based","title":"Unbiased MLMC stochastic gradient-based optimization of Bayesian experimental designs","date":"2020-05-18","arxiv_id":"2005.08414","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_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) · 3 unverified","sample_list":"/paper/unbiased-mlmc-stochastic-gradient-based#ran","syntology_url":"https://syntology.ai/paper/2005.08414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.08414"}},"official":{"repos":["Goda-Research-Group/MLMC_stochastic_gradient"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/generating-tertiary-protein-structures-via-an","slug":"generating-tertiary-protein-structures-via-an","title":"Generating Tertiary Protein Structures via an Interpretative Variational Autoencoder","date":"2020-04-08","arxiv_id":"2004.07119","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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) · 3 unverified","sample_list":"/paper/generating-tertiary-protein-structures-via-an#ran","syntology_url":"https://syntology.ai/paper/2004.07119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07119"}},"official":null}},{"url":"/paper/progressive-identification-of-true-labels-for","slug":"progressive-identification-of-true-labels-for","title":"Progressive Identification of True Labels for Partial-Label Learning","date":"2020-02-19","arxiv_id":"2002.08053","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/progressive-identification-of-true-labels-for#ran","syntology_url":"https://syntology.ai/paper/2002.08053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08053"}},"official":{"repos":["Lvcrezia77/PRODEN"],"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"]}}},{"url":"/paper/adaptivity-of-stochastic-gradient-methods-for","slug":"adaptivity-of-stochastic-gradient-methods-for","title":"Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization","date":"2020-02-13","arxiv_id":"2002.05359","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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","sample_list":"/paper/adaptivity-of-stochastic-gradient-methods-for#ran","syntology_url":"https://syntology.ai/paper/2002.05359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05359"}},"official":null}},{"url":"/paper/deep-learning-enabled-simulated-annealing-for","slug":"deep-learning-enabled-simulated-annealing-for","title":"Self-Directed Online Machine Learning for Topology Optimization","date":"2020-02-04","arxiv_id":"2002.01927","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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","sample_list":"/paper/deep-learning-enabled-simulated-annealing-for#ran","syntology_url":"https://syntology.ai/paper/2002.01927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.01927"}},"official":{"repos":["deng-cy/deep_learning_topology_opt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/distributionally-robust-neural-networks-for","slug":"distributionally-robust-neural-networks-for","title":"Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalization","date":"2019-11-20","arxiv_id":"1911.08731","repositories_listed":8,"syntology":{"n":10,"n_ran":9,"n_constructed":3,"n_ran_checked":5,"n_instrument":4,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"9 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/distributionally-robust-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/1911.08731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08731"}},"official":{"repos":["kohpangwei/group_DRO","worksheets.codalab.org/worksheets/0x621811fe446b49bb818293bae2ef88c0"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/continual-multi-task-gaussian-processes","slug":"continual-multi-task-gaussian-processes","title":"Continual Multi-task Gaussian Processes","date":"2019-10-31","arxiv_id":"1911.00002","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/continual-multi-task-gaussian-processes#ran","syntology_url":"https://syntology.ai/paper/1911.00002","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00002"}},"official":{"repos":["pmorenoz/ContinualGP"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/an-adaptive-and-momental-bound-method-for","slug":"an-adaptive-and-momental-bound-method-for","title":"An Adaptive and Momental Bound Method for Stochastic Learning","date":"2019-10-27","arxiv_id":"1910.12249","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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","sample_list":"/paper/an-adaptive-and-momental-bound-method-for#ran","syntology_url":"https://syntology.ai/paper/1910.12249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12249"}},"official":{"repos":["lancopku/AdaMod"],"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"]}}},{"url":"/paper/on-the-variance-of-the-adaptive-learning-rate","slug":"on-the-variance-of-the-adaptive-learning-rate","title":"On the Variance of the Adaptive Learning Rate and Beyond","date":"2019-08-08","arxiv_id":"1908.03265","repositories_listed":21,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-the-variance-of-the-adaptive-learning-rate#ran","syntology_url":"https://syntology.ai/paper/1908.03265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.03265"}},"official":{"repos":["LiyuanLucasLiu/RAdam"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/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","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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","sample_list":"/paper/a-stochastic-first-order-method-for-ordered#ran","syntology_url":"https://syntology.ai/paper/1907.04371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04371"}},"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"]}}},{"url":"/paper/universal-boosting-variational-inference","slug":"universal-boosting-variational-inference","title":"Universal Boosting Variational Inference","date":"2019-06-04","arxiv_id":"1906.01235","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_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","sample_list":"/paper/universal-boosting-variational-inference#ran","syntology_url":"https://syntology.ai/paper/1906.01235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01235"}},"official":{"repos":["trevorcampbell/ubvi"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exploiting-uncertainty-of-loss-landscape-for","slug":"exploiting-uncertainty-of-loss-landscape-for","title":"Exploiting Uncertainty of Loss Landscape for Stochastic Optimization","date":"2019-05-30","arxiv_id":"1905.13200","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/exploiting-uncertainty-of-loss-landscape-for#ran","syntology_url":"https://syntology.ai/paper/1905.13200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13200"}},"official":{"repos":["bsvineethiitg/adams"],"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"]}}},{"url":"/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","repositories_listed":3,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_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","sample_list":"/paper/stochastic-gradient-methods-with-layer-wise#ran","syntology_url":"https://syntology.ai/paper/1905.11286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11286"}},"official":null}},{"url":"/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","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/the-step-decay-schedule-a-near-optimal#ran","syntology_url":"https://syntology.ai/paper/1904.12838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12838"}},"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"]}}},{"url":"/paper/on-the-convergence-of-adam-and-beyond-1","slug":"on-the-convergence-of-adam-and-beyond-1","title":"On the Convergence of Adam and Beyond","date":"2019-04-19","arxiv_id":"1904.09237","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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","sample_list":"/paper/on-the-convergence-of-adam-and-beyond-1#ran","syntology_url":"https://syntology.ai/paper/1904.09237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09237"}},"official":null}},{"url":"/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","repositories_listed":32,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_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","sample_list":"/paper/reducing-bert-pre-training-time-from-3-days#ran","syntology_url":"https://syntology.ai/paper/1904.00962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.00962"}},"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"]}}},{"url":"/paper/stochastic-optimization-of-sorting-networks-1","slug":"stochastic-optimization-of-sorting-networks-1","title":"Stochastic Optimization of Sorting Networks via Continuous Relaxations","date":"2019-03-21","arxiv_id":"1903.08850","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/stochastic-optimization-of-sorting-networks-1#ran","syntology_url":"https://syntology.ai/paper/1903.08850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.08850"}},"official":{"repos":["ermongroup/neuralsort"],"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"]}}},{"url":"/paper/deepobs-a-deep-learning-optimizer-benchmark-1","slug":"deepobs-a-deep-learning-optimizer-benchmark-1","title":"DeepOBS: A Deep Learning Optimizer Benchmark Suite","date":"2019-03-13","arxiv_id":"1903.05499","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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) · 1 unverified","sample_list":"/paper/deepobs-a-deep-learning-optimizer-benchmark-1#ran","syntology_url":"https://syntology.ai/paper/1903.05499","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.05499"}},"official":{"repos":["fsschneider/deepobs"],"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"]}}},{"url":"/paper/agnostic-federated-learning","slug":"agnostic-federated-learning","title":"Agnostic Federated Learning","date":"2019-02-01","arxiv_id":"1902.00146","repositories_listed":7,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/agnostic-federated-learning#ran","syntology_url":"https://syntology.ai/paper/1902.00146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00146"}},"official":null}},{"url":"/paper/scalable-robust-kidney-exchange","slug":"scalable-robust-kidney-exchange","title":"Scalable Robust Kidney Exchange","date":"2018-11-08","arxiv_id":"1811.03532","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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) · 3 unverified","sample_list":"/paper/scalable-robust-kidney-exchange#ran","syntology_url":"https://syntology.ai/paper/1811.03532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.03532"}},"official":{"repos":["duncanmcelfresh/RobustKidneyExchange"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/janossy-pooling-learning-deep-permutation","slug":"janossy-pooling-learning-deep-permutation","title":"Janossy Pooling: Learning Deep Permutation-Invariant Functions for Variable-Size Inputs","date":"2018-11-05","arxiv_id":"1811.01900","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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) · 3 unverified","sample_list":"/paper/janossy-pooling-learning-deep-permutation#ran","syntology_url":"https://syntology.ai/paper/1811.01900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.01900"}},"official":{"repos":["PurdueMINDS/JanossyPooling","balasrini33/JanossyPooling"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_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","sample_list":"/paper/quasi-hyperbolic-momentum-and-adam-for-deep#ran","syntology_url":"https://syntology.ai/paper/1810.06801","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.06801"}},"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"]}}},{"url":"/paper/spectral-inference-networks-unifying-spectral","slug":"spectral-inference-networks-unifying-spectral","title":"Spectral Inference Networks: Unifying Deep and Spectral Learning","date":"2018-06-06","arxiv_id":"1806.02215","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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","sample_list":"/paper/spectral-inference-networks-unifying-spectral#ran","syntology_url":"https://syntology.ai/paper/1806.02215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02215"}},"official":{"repos":["deepmind/spectral_inference_networks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/zeroth-order-stochastic-variance-reduction","slug":"zeroth-order-stochastic-variance-reduction","title":"Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimization","date":"2018-05-25","arxiv_id":"1805.10367","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/zeroth-order-stochastic-variance-reduction#ran","syntology_url":"https://syntology.ai/paper/1805.10367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.10367"}},"official":null}},{"url":"/paper/adafactor-adaptive-learning-rates-with","slug":"adafactor-adaptive-learning-rates-with","title":"Adafactor: Adaptive Learning Rates with Sublinear Memory Cost","date":"2018-04-11","arxiv_id":"1804.04235","repositories_listed":5,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_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","sample_list":"/paper/adafactor-adaptive-learning-rates-with#ran","syntology_url":"https://syntology.ai/paper/1804.04235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.04235"}},"official":null}},{"url":"/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","repositories_listed":17,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_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","sample_list":"/paper/averaging-weights-leads-to-wider-optima-and#ran","syntology_url":"https://syntology.ai/paper/1803.05407","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05407"}},"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"]}}},{"url":"/paper/stochastic-hyperparameter-optimization","slug":"stochastic-hyperparameter-optimization","title":"Stochastic Hyperparameter Optimization through Hypernetworks","date":"2018-02-26","arxiv_id":"1802.09419","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_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) · 0 unverified","sample_list":"/paper/stochastic-hyperparameter-optimization#ran","syntology_url":"https://syntology.ai/paper/1802.09419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.09419"}},"official":null}},{"url":"/paper/shampoo-preconditioned-stochastic-tensor","slug":"shampoo-preconditioned-stochastic-tensor","title":"Shampoo: Preconditioned Stochastic Tensor Optimization","date":"2018-02-26","arxiv_id":"1802.09568","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_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","sample_list":"/paper/shampoo-preconditioned-stochastic-tensor#ran","syntology_url":"https://syntology.ai/paper/1802.09568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.09568"}},"official":null}},{"url":"/paper/deeptype-multilingual-entity-linking-by","slug":"deeptype-multilingual-entity-linking-by","title":"DeepType: Multilingual Entity Linking by Neural Type System Evolution","date":"2018-02-03","arxiv_id":"1802.01021","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/deeptype-multilingual-entity-linking-by#ran","syntology_url":"https://syntology.ai/paper/1802.01021","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.01021"}},"official":{"repos":["openai/deeptype"],"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"]}}},{"url":"/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","repositories_listed":73,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/accurate-large-minibatch-sgd-training#ran","syntology_url":"https://syntology.ai/paper/1706.02677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02677"}},"official":null}},{"url":"/paper/online-learning-rate-adaptation-with","slug":"online-learning-rate-adaptation-with","title":"Online Learning Rate Adaptation with Hypergradient Descent","date":"2017-03-14","arxiv_id":"1703.04782","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/online-learning-rate-adaptation-with#ran","syntology_url":"https://syntology.ai/paper/1703.04782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04782"}},"official":{"repos":["gbaydin/hypergradient-descent"],"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"]}}},{"url":"/paper/task-based-end-to-end-model-learning-in","slug":"task-based-end-to-end-model-learning-in","title":"Task-based End-to-end Model Learning in Stochastic Optimization","date":"2017-03-13","arxiv_id":"1703.04529","repositories_listed":1,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 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; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/task-based-end-to-end-model-learning-in#ran","syntology_url":"https://syntology.ai/paper/1703.04529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04529"}},"official":{"repos":["locuslab/e2e-model-learning"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-generalized-canonical-correlation","slug":"deep-generalized-canonical-correlation","title":"Deep Generalized Canonical Correlation Analysis","date":"2017-02-08","arxiv_id":"1702.02519","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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) · 1 unverified","sample_list":"/paper/deep-generalized-canonical-correlation#ran","syntology_url":"https://syntology.ai/paper/1702.02519","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.02519"}},"official":{"repos":["bitbucket.org/adrianbenton/dgcca-py3"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/reparameterization-gradients-through","slug":"reparameterization-gradients-through","title":"Reparameterization Gradients through Acceptance-Rejection Sampling Algorithms","date":"2016-10-18","arxiv_id":"1610.05683","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_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) · 1 unverified","sample_list":"/paper/reparameterization-gradients-through#ran","syntology_url":"https://syntology.ai/paper/1610.05683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.05683"}},"official":{"repos":["blei-lab/ars-reparameterization"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sgdr-stochastic-gradient-descent-with-warm","slug":"sgdr-stochastic-gradient-descent-with-warm","title":"SGDR: Stochastic Gradient Descent with Warm Restarts","date":"2016-08-13","arxiv_id":"1608.03983","repositories_listed":24,"syntology":{"n":17,"n_ran":16,"n_constructed":7,"n_ran_checked":15,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":7,"phrase":"16 ran (of which 7 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sgdr-stochastic-gradient-descent-with-warm#ran","syntology_url":"https://syntology.ai/paper/1608.03983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.03983"}},"official":{"repos":["loshchil/SGDR"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/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","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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","sample_list":"/paper/barzilai-borwein-step-size-for-stochastic#ran","syntology_url":"https://syntology.ai/paper/1605.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.04131"}},"official":null}},{"url":"/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","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/a-kronecker-factored-approximate-fisher#ran","syntology_url":"https://syntology.ai/paper/1602.01407","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.01407"}},"official":null}},{"url":"/paper/optimizing-neural-networks-with-kronecker","slug":"optimizing-neural-networks-with-kronecker","title":"Optimizing Neural Networks with Kronecker-factored Approximate Curvature","date":"2015-03-19","arxiv_id":"1503.05671","repositories_listed":19,"syntology":{"n":82,"n_ran":48,"n_constructed":20,"n_ran_checked":38,"n_instrument":10,"n_unverified":34,"n_honours":5,"n_violates":0,"n_no_contract":33,"n_pointer_only":7,"phrase":"48 ran (of which 20 constructed an object rather than computing a result; 38 with no instrument failure: 5 honoured, 0 violated, 33 with no contract checked; 10 where Syntology's instrument failed) · 34 unverified","sample_list":"/paper/optimizing-neural-networks-with-kronecker#ran","syntology_url":"https://syntology.ai/paper/1503.05671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.05671"}},"official":null}},{"url":"/paper/probabilistic-line-searches-for-stochastic-1","slug":"probabilistic-line-searches-for-stochastic-1","title":"Probabilistic Line Searches for Stochastic Optimization","date":"2015-02-10","arxiv_id":"1502.02846","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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","sample_list":"/paper/probabilistic-line-searches-for-stochastic-1#ran","syntology_url":"https://syntology.ai/paper/1502.02846","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.02846"}},"official":null}},{"url":"/paper/adam-a-method-for-stochastic-optimization","slug":"adam-a-method-for-stochastic-optimization","title":"Adam: A Method for Stochastic Optimization","date":"2014-12-22","arxiv_id":"1412.6980","repositories_listed":87,"syntology":{"n":37,"n_ran":27,"n_constructed":7,"n_ran_checked":23,"n_instrument":4,"n_unverified":10,"n_honours":4,"n_violates":2,"n_no_contract":17,"n_pointer_only":8,"phrase":"27 ran (of which 7 constructed an object rather than computing a result; 23 with no instrument failure: 4 honoured, 2 violated, 17 with no contract checked; 4 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/adam-a-method-for-stochastic-optimization#ran","syntology_url":"https://syntology.ai/paper/1412.6980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.6980"}},"official":null}},{"url":"/paper/deep-learning-with-elastic-averaging-sgd","slug":"deep-learning-with-elastic-averaging-sgd","title":"Deep learning with Elastic Averaging SGD","date":"2014-12-20","arxiv_id":"1412.6651","repositories_listed":10,"syntology":{"n":12,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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) · 11 unverified","sample_list":"/paper/deep-learning-with-elastic-averaging-sgd#ran","syntology_url":"https://syntology.ai/paper/1412.6651","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.6651"}},"official":{"repos":["sixin-zh/mpiT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/black-box-variational-inference","slug":"black-box-variational-inference","title":"Black Box Variational Inference","date":"2013-12-31","arxiv_id":"1401.0118","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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","sample_list":"/paper/black-box-variational-inference#ran","syntology_url":"https://syntology.ai/paper/1401.0118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1401.0118"}},"official":null}}],"record_sha256":"ace29e1b0ad6a003dfb57318ebae4209598d4473d217dd86b7d288c978d5c19c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}