{"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/regression-1/papers/ran/4","list_of":"/task/regression-1","task":"regression","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":4,"pages_in_order":5,"rows_per_page":100,"rows":[301,400],"of":449,"counts":{"archive_papers_tagged":9424,"with_a_code_link":2445,"where_syntology_ran_a_sample":449,"not_listed_spam_title":0,"listed":9424,"listed_where_code_ran":449,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":374,"every_run_a_failure_of_syntologys_instrument":75,"listed_with_a_run_with_no_instrument_failure":374,"listed_every_run_a_failure_of_syntologys_instrument":75,"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/regression-1/papers/ran/1","prev":"/task/regression-1/papers/ran/3","next":"/task/regression-1/papers/ran/5","papers":[{"url":"/paper/recyclable-gaussian-processes","slug":"recyclable-gaussian-processes","title":"Recyclable Gaussian Processes","date":"2020-10-06","arxiv_id":"2010.02554","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/recyclable-gaussian-processes#ran","syntology_url":"https://syntology.ai/paper/2010.02554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02554"}},"official":{"repos":["pmorenoz/RecyclableGP"],"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/a-transformer-based-framework-for-1","slug":"a-transformer-based-framework-for-1","title":"A Transformer-based Framework for Multivariate Time Series Representation Learning","date":"2020-10-06","arxiv_id":"2010.02803","repositories_listed":6,"syntology":{"n":32,"n_ran":23,"n_constructed":0,"n_ran_checked":22,"n_instrument":1,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":22,"n_pointer_only":6,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 0 honoured, 0 violated, 22 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/a-transformer-based-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/2010.02803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02803"}},"official":{"repos":["gzerveas/mvts_transformer"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-the-universality-of-the-double-descent-1","slug":"on-the-universality-of-the-double-descent-1","title":"On the Universality of the Double Descent Peak in Ridgeless Regression","date":"2020-10-05","arxiv_id":"2010.01851","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-universality-of-the-double-descent-1#ran","syntology_url":"https://syntology.ai/paper/2010.01851","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01851"}},"official":{"repos":["dholzmueller/universal_double_descent"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-semantic-capacity-of-terms","slug":"exploring-semantic-capacity-of-terms","title":"Exploring Semantic Capacity of Terms","date":"2020-10-05","arxiv_id":"2010.01898","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/exploring-semantic-capacity-of-terms#ran","syntology_url":"https://syntology.ai/paper/2010.01898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01898"}},"official":{"repos":["c3sr/semantic-capacity"],"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/estimating-individual-treatment-effects-using","slug":"estimating-individual-treatment-effects-using","title":"Estimating Individual Treatment Effects using Non-Parametric Regression Models: a Review","date":"2020-09-14","arxiv_id":"2009.06472","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/estimating-individual-treatment-effects-using#ran","syntology_url":"https://syntology.ai/paper/2009.06472","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.06472"}},"official":{"repos":["albicaron/estite"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/certainty-equivalent-perception-based-control","slug":"certainty-equivalent-perception-based-control","title":"Certainty Equivalent Perception-Based Control","date":"2020-08-27","arxiv_id":"2008.12332","repositories_listed":1,"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/certainty-equivalent-perception-based-control#ran","syntology_url":"https://syntology.ai/paper/2008.12332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.12332"}},"official":{"repos":["modestyachts/certainty_equiv_perception_control"],"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/monocular-expressive-body-regression-through","slug":"monocular-expressive-body-regression-through","title":"Monocular Expressive Body Regression through Body-Driven Attention","date":"2020-08-20","arxiv_id":"2008.09062","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/monocular-expressive-body-regression-through#ran","syntology_url":"https://syntology.ai/paper/2008.09062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.09062"}},"official":{"repos":["vchoutas/expose"],"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/neural-complexity-measures","slug":"neural-complexity-measures","title":"Neural Complexity Measures","date":"2020-08-07","arxiv_id":"2008.02953","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":3,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"6 ran (of which 3 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) · 0 unverified","sample_list":"/paper/neural-complexity-measures#ran","syntology_url":"https://syntology.ai/paper/2008.02953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.02953"}},"official":{"repos":["yoonholee/neural-complexity"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/convergence-of-sparse-variational-inference","slug":"convergence-of-sparse-variational-inference","title":"Convergence of Sparse Variational Inference in Gaussian Processes Regression","date":"2020-08-01","arxiv_id":"2008.00323","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/convergence-of-sparse-variational-inference#ran","syntology_url":"https://syntology.ai/paper/2008.00323","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.00323"}},"official":{"repos":["markvdw/RobustGP"],"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/awr-adaptive-weighting-regression-for-3d-hand","slug":"awr-adaptive-weighting-regression-for-3d-hand","title":"AWR: Adaptive Weighting Regression for 3D Hand Pose Estimation","date":"2020-07-19","arxiv_id":"2007.09590","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/awr-adaptive-weighting-regression-for-3d-hand#ran","syntology_url":"https://syntology.ai/paper/2007.09590","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.09590"}},"official":{"repos":["Elody-07/AWR-Adaptive-Weighting-Regression"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/alleviating-over-segmentation-errors-by","slug":"alleviating-over-segmentation-errors-by","title":"Alleviating Over-segmentation Errors by Detecting Action Boundaries","date":"2020-07-14","arxiv_id":"2007.06866","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/alleviating-over-segmentation-errors-by#ran","syntology_url":"https://syntology.ai/paper/2007.06866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06866"}},"official":{"repos":["yiskw713/asrf"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-graph-matching-networks-for-deep-1","slug":"hierarchical-graph-matching-networks-for-deep-1","title":"Multilevel Graph Matching Networks for Deep Graph Similarity Learning","date":"2020-07-08","arxiv_id":"2007.04395","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-graph-matching-networks-for-deep-1#ran","syntology_url":"https://syntology.ai/paper/2007.04395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04395"}},"official":{"repos":["kleincup/MGMN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/detection-as-regression-certified-object","slug":"detection-as-regression-certified-object","title":"Detection as Regression: Certified Object Detection by Median Smoothing","date":"2020-07-07","arxiv_id":"2007.03730","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/detection-as-regression-certified-object#ran","syntology_url":"https://syntology.ai/paper/2007.03730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.03730"}},"official":null}},{"url":"/paper/attention-based-joint-detection-of-object-and","slug":"attention-based-joint-detection-of-object-and","title":"Attention-based Joint Detection of Object and Semantic Part","date":"2020-07-05","arxiv_id":"2007.02419","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/attention-based-joint-detection-of-object-and#ran","syntology_url":"https://syntology.ai/paper/2007.02419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02419"}},"official":{"repos":["kevalmorabia97/Object-and-Semantic-Part-Detection-pyTorch"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/path-integral-based-convolution-and-pooling","slug":"path-integral-based-convolution-and-pooling","title":"Path Integral Based Convolution and Pooling for Graph Neural Networks","date":"2020-06-29","arxiv_id":"2006.16811","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":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/path-integral-based-convolution-and-pooling#ran","syntology_url":"https://syntology.ai/paper/2006.16811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16811"}},"official":{"repos":["YuGuangWang/PAN"],"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/statistical-mechanics-of-generalization-in","slug":"statistical-mechanics-of-generalization-in","title":"Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networks","date":"2020-06-23","arxiv_id":"2006.13198","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/statistical-mechanics-of-generalization-in#ran","syntology_url":"https://syntology.ai/paper/2006.13198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13198"}},"official":{"repos":["Pehlevan-Group/kernel-generalization"],"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/graph-neural-networks-in-tensorflow-and-keras","slug":"graph-neural-networks-in-tensorflow-and-keras","title":"Graph Neural Networks in TensorFlow and Keras with Spektral","date":"2020-06-22","arxiv_id":"2006.12138","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/graph-neural-networks-in-tensorflow-and-keras#ran","syntology_url":"https://syntology.ai/paper/2006.12138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12138"}},"official":{"repos":["danielegrattarola/spektral"],"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/regression-prior-networks","slug":"regression-prior-networks","title":"Regression Prior Networks","date":"2020-06-20","arxiv_id":"2006.11590","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/regression-prior-networks#ran","syntology_url":"https://syntology.ai/paper/2006.11590","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11590"}},"official":{"repos":["JanRocketMan/regression-prior-networks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ai-feynman-2-0-pareto-optimal-symbolic","slug":"ai-feynman-2-0-pareto-optimal-symbolic","title":"AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularity","date":"2020-06-18","arxiv_id":"2006.10782","repositories_listed":2,"syntology":{"n":20,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":8,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/ai-feynman-2-0-pareto-optimal-symbolic#ran","syntology_url":"https://syntology.ai/paper/2006.10782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10782"}},"official":null}},{"url":"/paper/depth-uncertainty-in-neural-networks","slug":"depth-uncertainty-in-neural-networks","title":"Depth Uncertainty in Neural Networks","date":"2020-06-15","arxiv_id":"2006.08437","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/depth-uncertainty-in-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.08437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08437"}},"official":{"repos":["cambridge-mlg/DUN"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/implicit-bias-of-gradient-descent-for-mean","slug":"implicit-bias-of-gradient-descent-for-mean","title":"Implicit Bias of Gradient Descent for Mean Squared Error Regression with Two-Layer Wide Neural Networks","date":"2020-06-12","arxiv_id":"2006.07356","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/implicit-bias-of-gradient-descent-for-mean#ran","syntology_url":"https://syntology.ai/paper/2006.07356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07356"}},"official":{"repos":["huijin12/implicit_bias_wide_neural_networks"],"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/adaptive-sampling-to-reduce-disparate","slug":"adaptive-sampling-to-reduce-disparate","title":"Active Sampling for Min-Max Fairness","date":"2020-06-11","arxiv_id":"2006.06879","repositories_listed":1,"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/adaptive-sampling-to-reduce-disparate#ran","syntology_url":"https://syntology.ai/paper/2006.06879","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06879"}},"official":{"repos":["amazon-research/active-sampling-for-minmax-fairness"],"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/3d-human-mesh-regression-with-dense-1","slug":"3d-human-mesh-regression-with-dense-1","title":"3D Human Mesh Regression with Dense Correspondence","date":"2020-06-10","arxiv_id":"2006.05734","repositories_listed":3,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/3d-human-mesh-regression-with-dense-1#ran","syntology_url":"https://syntology.ai/paper/2006.05734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05734"}},"official":{"repos":["zengwang430521/DecoMR"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/coresets-via-bilevel-optimization-for","slug":"coresets-via-bilevel-optimization-for","title":"Coresets via Bilevel Optimization for Continual Learning and Streaming","date":"2020-06-06","arxiv_id":"2006.03875","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/coresets-via-bilevel-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2006.03875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03875"}},"official":{"repos":["zalanborsos/bilevel_coresets"],"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/regression-enrichment-surfaces-a-simple","slug":"regression-enrichment-surfaces-a-simple","title":"Regression Enrichment Surfaces: a Simple Analysis Technique for Virtual Drug Screening Models","date":"2020-06-01","arxiv_id":"2006.01171","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/regression-enrichment-surfaces-a-simple#ran","syntology_url":"https://syntology.ai/paper/2006.01171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.01171"}},"official":{"repos":["aclyde11/regression_enrichment_surface"],"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/discretize-optimize-vs-optimize-discretize","slug":"discretize-optimize-vs-optimize-discretize","title":"Discretize-Optimize vs. Optimize-Discretize for Time-Series Regression and Continuous Normalizing Flows","date":"2020-05-27","arxiv_id":"2005.13420","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/discretize-optimize-vs-optimize-discretize#ran","syntology_url":"https://syntology.ai/paper/2005.13420","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.13420"}},"official":{"repos":["EmoryMLIP/DOvsOD_NeuralODEs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-geometric-factors-in-model-learning","slug":"enhancing-geometric-factors-in-model-learning","title":"Enhancing Geometric Factors in Model Learning and Inference for Object Detection and Instance Segmentation","date":"2020-05-07","arxiv_id":"2005.03572","repositories_listed":6,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/enhancing-geometric-factors-in-model-learning#ran","syntology_url":"https://syntology.ai/paper/2005.03572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03572"}},"official":{"repos":["Zzh-tju/CIoU"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/active-preference-based-gaussian-process","slug":"active-preference-based-gaussian-process","title":"Active Preference-Based Gaussian Process Regression for Reward Learning","date":"2020-05-06","arxiv_id":"2005.02575","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":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/active-preference-based-gaussian-process#ran","syntology_url":"https://syntology.ai/paper/2005.02575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02575"}},"official":{"repos":["Stanford-ILIAD/active-preference-based-gpr"],"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/how-to-train-your-energy-based-model-for","slug":"how-to-train-your-energy-based-model-for","title":"How to Train Your Energy-Based Model for Regression","date":"2020-05-04","arxiv_id":"2005.01698","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/how-to-train-your-energy-based-model-for#ran","syntology_url":"https://syntology.ai/paper/2005.01698","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01698"}},"official":{"repos":["fregu856/ebms_regression"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-additive-models-interpretable-machine","slug":"neural-additive-models-interpretable-machine","title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","date":"2020-04-29","arxiv_id":"2004.13912","repositories_listed":8,"syntology":{"n":33,"n_ran":26,"n_constructed":14,"n_ran_checked":26,"n_instrument":0,"n_unverified":7,"n_honours":5,"n_violates":0,"n_no_contract":21,"n_pointer_only":14,"phrase":"26 ran (of which 14 constructed an object rather than computing a result; 26 with no instrument failure: 5 honoured, 0 violated, 21 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/neural-additive-models-interpretable-machine#ran","syntology_url":"https://syntology.ai/paper/2004.13912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13912"}},"official":{"repos":["lemeln/nam"],"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":["listed","official"]}}},{"url":"/paper/polylanenet-lane-estimation-via-deep","slug":"polylanenet-lane-estimation-via-deep","title":"PolyLaneNet: Lane Estimation via Deep Polynomial Regression","date":"2020-04-23","arxiv_id":"2004.10924","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/polylanenet-lane-estimation-via-deep#ran","syntology_url":"https://syntology.ai/paper/2004.10924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10924"}},"official":{"repos":["lucastabelini/PolyLaneNet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-a-formula-of-interpretability-to","slug":"learning-a-formula-of-interpretability-to","title":"Learning a Formula of Interpretability to Learn Interpretable Formulas","date":"2020-04-23","arxiv_id":"2004.11170","repositories_listed":3,"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/learning-a-formula-of-interpretability-to#ran","syntology_url":"https://syntology.ai/paper/2004.11170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11170"}},"official":{"repos":["MaLeLabTs/GPFormulasInterpretability","marcovirgolin/pyNSGP"],"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/learning-from-aggregate-observations","slug":"learning-from-aggregate-observations","title":"Learning from Aggregate Observations","date":"2020-04-14","arxiv_id":"2004.06316","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-from-aggregate-observations#ran","syntology_url":"https://syntology.ai/paper/2004.06316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.06316"}},"official":{"repos":["YivanZhang/lio"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-r-cnn-towards-high-quality-object","slug":"dynamic-r-cnn-towards-high-quality-object","title":"Dynamic R-CNN: Towards High Quality Object Detection via Dynamic Training","date":"2020-04-13","arxiv_id":"2004.06002","repositories_listed":3,"syntology":{"n":18,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":9,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/dynamic-r-cnn-towards-high-quality-object#ran","syntology_url":"https://syntology.ai/paper/2004.06002","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.06002"}},"official":{"repos":["hkzhang95/DynamicRCNN"],"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":["listed","official"]}}},{"url":"/paper/sparse-regression-at-scale-branch-and-bound","slug":"sparse-regression-at-scale-branch-and-bound","title":"Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimization","date":"2020-04-13","arxiv_id":"2004.06152","repositories_listed":2,"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/sparse-regression-at-scale-branch-and-bound#ran","syntology_url":"https://syntology.ai/paper/2004.06152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.06152"}},"official":{"repos":["alisaab/l0bnb"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/closed-loop-matters-dual-regression-networks","slug":"closed-loop-matters-dual-regression-networks","title":"Closed-loop Matters: Dual Regression Networks for Single Image Super-Resolution","date":"2020-03-16","arxiv_id":"2003.07018","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/closed-loop-matters-dual-regression-networks#ran","syntology_url":"https://syntology.ai/paper/2003.07018","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.07018"}},"official":{"repos":["guoyongcs/DRN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/arbitrary-oriented-object-detection-with","slug":"arbitrary-oriented-object-detection-with","title":"On the Arbitrary-Oriented Object Detection: Classification based Approaches Revisited","date":"2020-03-12","arxiv_id":"2003.05597","repositories_listed":4,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 0 unverified","sample_list":"/paper/arbitrary-oriented-object-detection-with#ran","syntology_url":"https://syntology.ai/paper/2003.05597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05597"}},"official":{"repos":["SJTU-Thinklab-Det/OHDet_Tensorflow","Thinklab-SJTU/CSL_RetinaNet_Tensorflow","yangxue0827/RotationDetection"],"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":["official"]}}},{"url":"/paper/pixel-in-pixel-net-towards-efficient-facial","slug":"pixel-in-pixel-net-towards-efficient-facial","title":"Pixel-in-Pixel Net: Towards Efficient Facial Landmark Detection in the Wild","date":"2020-03-08","arxiv_id":"2003.03771","repositories_listed":2,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":13,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"15 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pixel-in-pixel-net-towards-efficient-facial#ran","syntology_url":"https://syntology.ai/paper/2003.03771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03771"}},"official":{"repos":["jhb86253817/PIPNet"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/pac-bayesian-meta-learning-with-implicit","slug":"pac-bayesian-meta-learning-with-implicit","title":"PAC-Bayes meta-learning with implicit task-specific posteriors","date":"2020-03-05","arxiv_id":"2003.02455","repositories_listed":1,"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/pac-bayesian-meta-learning-with-implicit#ran","syntology_url":"https://syntology.ai/paper/2003.02455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02455"}},"official":{"repos":["cnguyen10/few_shot_meta_learning"],"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/sleipnir-deterministic-and-provably-accurate","slug":"sleipnir-deterministic-and-provably-accurate","title":"SLEIPNIR: Deterministic and Provably Accurate Feature Expansion for Gaussian Process Regression with Derivatives","date":"2020-03-05","arxiv_id":"2003.02658","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/sleipnir-deterministic-and-provably-accurate#ran","syntology_url":"https://syntology.ai/paper/2003.02658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02658"}},"official":{"repos":["sdi1100041/SLEIPNIR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/memory-based-graph-networks-1","slug":"memory-based-graph-networks-1","title":"Memory-Based Graph Networks","date":"2020-02-21","arxiv_id":"2002.09518","repositories_listed":2,"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/memory-based-graph-networks-1#ran","syntology_url":"https://syntology.ai/paper/2002.09518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09518"}},"official":{"repos":["amirkhas/GraphMemoryNet"],"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/gradient-boosting-neural-networks-grownet","slug":"gradient-boosting-neural-networks-grownet","title":"Gradient Boosting Neural Networks: GrowNet","date":"2020-02-19","arxiv_id":"2002.07971","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gradient-boosting-neural-networks-grownet#ran","syntology_url":"https://syntology.ai/paper/2002.07971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07971"}},"official":{"repos":["sbadirli/GrowNet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/outcome-correlation-in-graph-neural-network","slug":"outcome-correlation-in-graph-neural-network","title":"Residual Correlation in Graph Neural Network Regression","date":"2020-02-19","arxiv_id":"2002.08274","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/outcome-correlation-in-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2002.08274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08274"}},"official":{"repos":["000Justin000/gnn-residual-correlation"],"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/a-unifying-network-architecture-for-semi","slug":"a-unifying-network-architecture-for-semi","title":"Semi-Structured Distributional Regression -- Extending Structured Additive Models by Arbitrary Deep Neural Networks and Data Modalities","date":"2020-02-13","arxiv_id":"2002.05777","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/a-unifying-network-architecture-for-semi#ran","syntology_url":"https://syntology.ai/paper/2002.05777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05777"}},"official":{"repos":["davidruegamer/semi-structured_distributional_regression"],"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/spectrum-dependent-learning-curves-in-kernel","slug":"spectrum-dependent-learning-curves-in-kernel","title":"Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networks","date":"2020-02-07","arxiv_id":"2002.02561","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/spectrum-dependent-learning-curves-in-kernel#ran","syntology_url":"https://syntology.ai/paper/2002.02561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02561"}},"official":{"repos":["Pehlevan-Group/NTK_Learning_Curves"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fairness-measures-for-regression-via","slug":"fairness-measures-for-regression-via","title":"Fairness Measures for Regression via Probabilistic Classification","date":"2020-01-16","arxiv_id":"2001.06089","repositories_listed":3,"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/fairness-measures-for-regression-via#ran","syntology_url":"https://syntology.ai/paper/2001.06089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06089"}},"official":null}},{"url":"/paper/hybridpose-6d-object-pose-estimation-under","slug":"hybridpose-6d-object-pose-estimation-under","title":"HybridPose: 6D Object Pose Estimation under Hybrid Representations","date":"2020-01-07","arxiv_id":"2001.01869","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":5,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 5 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hybridpose-6d-object-pose-estimation-under#ran","syntology_url":"https://syntology.ai/paper/2001.01869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01869"}},"official":{"repos":["chensong1995/HybridPose"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/approximate-inference-for-fully-bayesian","slug":"approximate-inference-for-fully-bayesian","title":"Approximate Inference for Fully Bayesian Gaussian Process Regression","date":"2019-12-31","arxiv_id":"1912.13440","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/approximate-inference-for-fully-bayesian#ran","syntology_url":"https://syntology.ai/paper/1912.13440","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.13440"}},"official":null}},{"url":"/paper/randomly-projected-additive-gaussian","slug":"randomly-projected-additive-gaussian","title":"Randomly Projected Additive Gaussian Processes for Regression","date":"2019-12-30","arxiv_id":"1912.12834","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/randomly-projected-additive-gaussian#ran","syntology_url":"https://syntology.ai/paper/1912.12834","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.12834"}},"official":{"repos":["idelbrid/Randomly-Projected-Additive-GPs"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/performance-of-regression-models-as-a","slug":"performance-of-regression-models-as-a","title":"Performance of regression models as a function of experiment noise","date":"2019-12-17","arxiv_id":"1912.08141","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/performance-of-regression-models-as-a#ran","syntology_url":"https://syntology.ai/paper/1912.08141","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08141"}},"official":{"repos":["EngqvistLab/Supplemetenary_scripts_datasets_R2LG","EngqvistLab/Tome"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-predictor-for-neural-architecture","slug":"neural-predictor-for-neural-architecture","title":"Neural Predictor for Neural Architecture Search","date":"2019-12-02","arxiv_id":"1912.00848","repositories_listed":2,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-predictor-for-neural-architecture#ran","syntology_url":"https://syntology.ai/paper/1912.00848","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00848"}},"official":null}},{"url":"/paper/covernet-multimodal-behavior-prediction-using","slug":"covernet-multimodal-behavior-prediction-using","title":"CoverNet: Multimodal Behavior Prediction using Trajectory Sets","date":"2019-11-23","arxiv_id":"1911.10298","repositories_listed":3,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/covernet-multimodal-behavior-prediction-using#ran","syntology_url":"https://syntology.ai/paper/1911.10298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.10298"}},"official":null}},{"url":"/paper/distance-iou-loss-faster-and-better-learning","slug":"distance-iou-loss-faster-and-better-learning","title":"Distance-IoU Loss: Faster and Better Learning for Bounding Box Regression","date":"2019-11-19","arxiv_id":"1911.08287","repositories_listed":20,"syntology":{"n":25,"n_ran":17,"n_constructed":0,"n_ran_checked":14,"n_instrument":3,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":13,"n_pointer_only":6,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 0 violated, 13 with no contract checked; 3 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/distance-iou-loss-faster-and-better-learning#ran","syntology_url":"https://syntology.ai/paper/1911.08287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08287"}},"official":{"repos":["Zzh-tju/DIoU"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/learning-modulated-loss-for-rotated-object","slug":"learning-modulated-loss-for-rotated-object","title":"Learning Modulated Loss for Rotated Object Detection","date":"2019-11-19","arxiv_id":"1911.08299","repositories_listed":2,"syntology":{"n":13,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/learning-modulated-loss-for-rotated-object#ran","syntology_url":"https://syntology.ai/paper/1911.08299","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08299"}},"official":null}},{"url":"/paper/the-secret-revealer-generative-model-1","slug":"the-secret-revealer-generative-model-1","title":"The Secret Revealer: Generative Model-Inversion Attacks Against Deep Neural Networks","date":"2019-11-17","arxiv_id":"1911.07135","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/the-secret-revealer-generative-model-1#ran","syntology_url":"https://syntology.ai/paper/1911.07135","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.07135"}},"official":{"repos":["AI-secure/GMI-Attack"],"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/siamcar-siamese-fully-convolutional","slug":"siamcar-siamese-fully-convolutional","title":"SiamCAR: Siamese Fully Convolutional Classification and Regression for Visual Tracking","date":"2019-11-17","arxiv_id":"1911.07241","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/siamcar-siamese-fully-convolutional#ran","syntology_url":"https://syntology.ai/paper/1911.07241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.07241"}},"official":{"repos":["ohhhyeahhh/SiamCAR"],"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/chirality-nets-for-human-pose-regression","slug":"chirality-nets-for-human-pose-regression","title":"Chirality Nets for Human Pose Regression","date":"2019-10-31","arxiv_id":"1911.00029","repositories_listed":1,"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/chirality-nets-for-human-pose-regression#ran","syntology_url":"https://syntology.ai/paper/1911.00029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00029"}},"official":null}},{"url":"/paper/scaling-structural-learning-with-no-bears-to","slug":"scaling-structural-learning-with-no-bears-to","title":"Scaling structural learning with NO-BEARS to infer causal transcriptome networks","date":"2019-10-31","arxiv_id":"1911.00081","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scaling-structural-learning-with-no-bears-to#ran","syntology_url":"https://syntology.ai/paper/1911.00081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00081"}},"official":{"repos":["howchihlee/BNGPU"],"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/dual-iv-a-single-stage-instrumental-variable","slug":"dual-iv-a-single-stage-instrumental-variable","title":"Dual Instrumental Variable Regression","date":"2019-10-27","arxiv_id":"1910.12358","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":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/dual-iv-a-single-stage-instrumental-variable#ran","syntology_url":"https://syntology.ai/paper/1910.12358","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12358"}},"official":{"repos":["krikamol/DualIV-NeurIPS2020"],"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/learning-sample-specific-models-with-low-rank","slug":"learning-sample-specific-models-with-low-rank","title":"Learning Sample-Specific Models with Low-Rank Personalized Regression","date":"2019-10-15","arxiv_id":"1910.06939","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/learning-sample-specific-models-with-low-rank#ran","syntology_url":"https://syntology.ai/paper/1910.06939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06939"}},"official":{"repos":["blengerich/personalized_regression"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/ngboost-natural-gradient-boosting-for","slug":"ngboost-natural-gradient-boosting-for","title":"NGBoost: Natural Gradient Boosting for Probabilistic Prediction","date":"2019-10-08","arxiv_id":"1910.03225","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/ngboost-natural-gradient-boosting-for#ran","syntology_url":"https://syntology.ai/paper/1910.03225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03225"}},"official":{"repos":["stanfordmlgroup/ngboost"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deep-evidential-regression","slug":"deep-evidential-regression","title":"Deep Evidential Regression","date":"2019-10-07","arxiv_id":"1910.02600","repositories_listed":6,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-evidential-regression#ran","syntology_url":"https://syntology.ai/paper/1910.02600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02600"}},"official":{"repos":["aamini/evidential-deep-learning"],"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":["listed","official"]}}},{"url":"/paper/on-tractable-computation-of-expected","slug":"on-tractable-computation-of-expected","title":"On Tractable Computation of Expected Predictions","date":"2019-10-05","arxiv_id":"1910.02182","repositories_listed":1,"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":4,"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/on-tractable-computation-of-expected#ran","syntology_url":"https://syntology.ai/paper/1910.02182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02182"}},"official":{"repos":["UCLA-StarAI/mc2"],"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/harnessing-the-power-of-infinitely-wide-deep-1","slug":"harnessing-the-power-of-infinitely-wide-deep-1","title":"Harnessing the Power of Infinitely Wide Deep Nets on Small-data Tasks","date":"2019-10-03","arxiv_id":"1910.01663","repositories_listed":4,"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":1,"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/harnessing-the-power-of-infinitely-wide-deep-1#ran","syntology_url":"https://syntology.ai/paper/1910.01663","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01663"}},"official":{"repos":["LeoYu/neural-tangent-kernel-UCI"],"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/polarmask-single-shot-instance-segmentation","slug":"polarmask-single-shot-instance-segmentation","title":"PolarMask: Single Shot Instance Segmentation with Polar Representation","date":"2019-09-29","arxiv_id":"1909.13226","repositories_listed":2,"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/polarmask-single-shot-instance-segmentation#ran","syntology_url":"https://syntology.ai/paper/1909.13226","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.13226"}},"official":{"repos":["xieenze/PolarMask"],"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/regression-planning-networks","slug":"regression-planning-networks","title":"Regression Planning Networks","date":"2019-09-28","arxiv_id":"1909.13072","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/regression-planning-networks#ran","syntology_url":"https://syntology.ai/paper/1909.13072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.13072"}},"official":null}},{"url":"/paper/weighted-linear-bandits-for-non-stationary","slug":"weighted-linear-bandits-for-non-stationary","title":"Weighted Linear Bandits for Non-Stationary Environments","date":"2019-09-19","arxiv_id":"1909.09146","repositories_listed":1,"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/weighted-linear-bandits-for-non-stationary#ran","syntology_url":"https://syntology.ai/paper/1909.09146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.09146"}},"official":null}},{"url":"/paper/wsod2-learning-bottom-up-and-top-down-1","slug":"wsod2-learning-bottom-up-and-top-down-1","title":"WSOD^2: Learning Bottom-up and Top-down Objectness Distillation for Weakly-supervised Object Detection","date":"2019-09-11","arxiv_id":"1909.04972","repositories_listed":1,"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":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/wsod2-learning-bottom-up-and-top-down-1#ran","syntology_url":"https://syntology.ai/paper/1909.04972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.04972"}},"official":null}},{"url":"/paper/satellite-pose-estimation-with-deep-landmark","slug":"satellite-pose-estimation-with-deep-landmark","title":"Satellite Pose Estimation with Deep Landmark Regression and Nonlinear Pose Refinement","date":"2019-08-30","arxiv_id":"1908.11542","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"8 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/satellite-pose-estimation-with-deep-landmark#ran","syntology_url":"https://syntology.ai/paper/1908.11542","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.11542"}},"official":{"repos":["BoChenYS/satellite-pose-estimation"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pix2pose-pixel-wise-coordinate-regression-of","slug":"pix2pose-pixel-wise-coordinate-regression-of","title":"Pix2Pose: Pixel-Wise Coordinate Regression of Objects for 6D Pose Estimation","date":"2019-08-20","arxiv_id":"1908.07433","repositories_listed":3,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/pix2pose-pixel-wise-coordinate-regression-of#ran","syntology_url":"https://syntology.ai/paper/1908.07433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07433"}},"official":null}},{"url":"/paper/a-neural-network-with-feature-sparsity","slug":"a-neural-network-with-feature-sparsity","title":"LassoNet: A Neural Network with Feature Sparsity","date":"2019-07-29","arxiv_id":"1907.12207","repositories_listed":2,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/a-neural-network-with-feature-sparsity#ran","syntology_url":"https://syntology.ai/paper/1907.12207","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12207"}},"official":{"repos":["ilemhadri/lassoNet"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/subspace-inference-for-bayesian-deep-learning","slug":"subspace-inference-for-bayesian-deep-learning","title":"Subspace Inference for Bayesian Deep Learning","date":"2019-07-17","arxiv_id":"1907.07504","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/subspace-inference-for-bayesian-deep-learning#ran","syntology_url":"https://syntology.ai/paper/1907.07504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.07504"}},"official":{"repos":["wjmaddox/drbayes"],"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/stability-selection-enables-robust-learning","slug":"stability-selection-enables-robust-learning","title":"Stability selection enables robust learning of partial differential equations from limited noisy data","date":"2019-07-17","arxiv_id":"1907.07810","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":3,"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/stability-selection-enables-robust-learning#ran","syntology_url":"https://syntology.ai/paper/1907.07810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.07810"}},"official":{"repos":["SuryanarayanaMK/PDE-STRIDE"],"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/irnet-a-general-purpose-deep-residual","slug":"irnet-a-general-purpose-deep-residual","title":"IRNet: A General Purpose Deep Residual Regression Framework for Materials Discovery","date":"2019-07-07","arxiv_id":"1907.03222","repositories_listed":2,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/irnet-a-general-purpose-deep-residual#ran","syntology_url":"https://syntology.ai/paper/1907.03222","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.03222"}},"official":{"repos":["dipendra009/IRNet"],"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/few-shot-representation-learning-for-out-of","slug":"few-shot-representation-learning-for-out-of","title":"Few-Shot Representation Learning for Out-Of-Vocabulary Words","date":"2019-07-01","arxiv_id":"1907.00505","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":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/few-shot-representation-learning-for-out-of#ran","syntology_url":"https://syntology.ai/paper/1907.00505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00505"}},"official":{"repos":["acbull/HiCE"],"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/locate-size-and-count-accurately-resolving","slug":"locate-size-and-count-accurately-resolving","title":"Locate, Size and Count: Accurately Resolving People in Dense Crowds via Detection","date":"2019-06-18","arxiv_id":"1906.07538","repositories_listed":2,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/locate-size-and-count-accurately-resolving#ran","syntology_url":"https://syntology.ai/paper/1906.07538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.07538"}},"official":{"repos":["val-iisc/lsc-cnn"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/manifold-regression-to-predict-from-megeeg","slug":"manifold-regression-to-predict-from-megeeg","title":"Manifold-regression to predict from MEG/EEG brain signals without source modeling","date":"2019-06-04","arxiv_id":"1906.02687","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":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/manifold-regression-to-predict-from-megeeg#ran","syntology_url":"https://syntology.ai/paper/1906.02687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02687"}},"official":{"repos":["DavidSabbagh/NeurIPS19_manifold-regression-meeg"],"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/reliable-training-and-estimation-of-variance","slug":"reliable-training-and-estimation-of-variance","title":"Reliable training and estimation of variance networks","date":"2019-06-04","arxiv_id":"1906.03260","repositories_listed":2,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":0,"n_instrument":8,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"8 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; 8 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/reliable-training-and-estimation-of-variance#ran","syntology_url":"https://syntology.ai/paper/1906.03260","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03260"}},"official":{"repos":["SkafteNicki/john"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/subspace-networks-for-few-shot-classification","slug":"subspace-networks-for-few-shot-classification","title":"Regression Networks for Meta-Learning Few-Shot Classification","date":"2019-05-31","arxiv_id":"1905.13613","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/subspace-networks-for-few-shot-classification#ran","syntology_url":"https://syntology.ai/paper/1905.13613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13613"}},"official":{"repos":["ArnoutDevos/RegressionNet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-regression-quantitative-definitions-and","slug":"fair-regression-quantitative-definitions-and","title":"Fair Regression: Quantitative Definitions and Reduction-based Algorithms","date":"2019-05-30","arxiv_id":"1905.12843","repositories_listed":4,"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":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fair-regression-quantitative-definitions-and#ran","syntology_url":"https://syntology.ai/paper/1905.12843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12843"}},"official":null}},{"url":"/paper/convolutional-mesh-regression-for-single","slug":"convolutional-mesh-regression-for-single","title":"Convolutional Mesh Regression for Single-Image Human Shape Reconstruction","date":"2019-05-08","arxiv_id":"1905.03244","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/convolutional-mesh-regression-for-single#ran","syntology_url":"https://syntology.ai/paper/1905.03244","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.03244"}},"official":null}},{"url":"/paper/190409406","slug":"190409406","title":"DeepMoD: Deep learning for Model Discovery in noisy data","date":"2019-04-20","arxiv_id":"1904.09406","repositories_listed":2,"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/190409406#ran","syntology_url":"https://syntology.ai/paper/1904.09406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09406"}},"official":{"repos":["PhIMaL/DeePyMoD"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/adaptive-wing-loss-for-robust-face-alignment","slug":"adaptive-wing-loss-for-robust-face-alignment","title":"Adaptive Wing Loss for Robust Face Alignment via Heatmap Regression","date":"2019-04-16","arxiv_id":"1904.07399","repositories_listed":7,"syntology":{"n":27,"n_ran":17,"n_constructed":0,"n_ran_checked":10,"n_instrument":7,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":7,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 7 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/adaptive-wing-loss-for-robust-face-alignment#ran","syntology_url":"https://syntology.ai/paper/1904.07399","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.07399"}},"official":{"repos":["protossw512/AdaptiveWingLoss"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/geometry-aware-maximum-likelihood-estimation","slug":"geometry-aware-maximum-likelihood-estimation","title":"Geometry-Aware Maximum Likelihood Estimation of Intrinsic Dimension","date":"2019-04-12","arxiv_id":"1904.06151","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/geometry-aware-maximum-likelihood-estimation#ran","syntology_url":"https://syntology.ai/paper/1904.06151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.06151"}},"official":null}},{"url":"/paper/spherical-regression-learning-viewpoints","slug":"spherical-regression-learning-viewpoints","title":"Spherical Regression: Learning Viewpoints, Surface Normals and 3D Rotations on n-Spheres","date":"2019-04-10","arxiv_id":"1904.05404","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"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: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/spherical-regression-learning-viewpoints#ran","syntology_url":"https://syntology.ai/paper/1904.05404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05404"}},"official":{"repos":["leoshine/Spherical_Regression"],"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/semantic-graph-convolutional-networks-for-3d","slug":"semantic-graph-convolutional-networks-for-3d","title":"Semantic Graph Convolutional Networks for 3D Human Pose Regression","date":"2019-04-06","arxiv_id":"1904.03345","repositories_listed":5,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"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) · 5 unverified","sample_list":"/paper/semantic-graph-convolutional-networks-for-3d#ran","syntology_url":"https://syntology.ai/paper/1904.03345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.03345"}},"official":{"repos":["garyzhao/SemGCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/3dregnet-a-deep-neural-network-for-3d-point","slug":"3dregnet-a-deep-neural-network-for-3d-point","title":"3DRegNet: A Deep Neural Network for 3D Point Registration","date":"2019-04-02","arxiv_id":"1904.01701","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/3dregnet-a-deep-neural-network-for-3d-point#ran","syntology_url":"https://syntology.ai/paper/1904.01701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01701"}},"official":{"repos":["3DVisionISR/3DRegNet"],"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","unlocated"]}}},{"url":"/paper/understanding-the-limitations-of-cnn-based","slug":"understanding-the-limitations-of-cnn-based","title":"Understanding the Limitations of CNN-based Absolute Camera Pose Regression","date":"2019-03-18","arxiv_id":"1903.07504","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/understanding-the-limitations-of-cnn-based#ran","syntology_url":"https://syntology.ai/paper/1903.07504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.07504"}},"official":{"repos":["tsattler/understanding_apr"],"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/rates-of-convergence-for-sparse-variational","slug":"rates-of-convergence-for-sparse-variational","title":"Rates of Convergence for Sparse Variational Gaussian Process Regression","date":"2019-03-08","arxiv_id":"1903.03571","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/rates-of-convergence-for-sparse-variational#ran","syntology_url":"https://syntology.ai/paper/1903.03571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03571"}},"official":null}},{"url":"/paper/exploiting-unlabeled-data-in-cnns-by-self","slug":"exploiting-unlabeled-data-in-cnns-by-self","title":"Exploiting Unlabeled Data in CNNs by Self-supervised Learning to Rank","date":"2019-02-17","arxiv_id":"1902.06285","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/exploiting-unlabeled-data-in-cnns-by-self#ran","syntology_url":"https://syntology.ai/paper/1902.06285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.06285"}},"official":null}},{"url":"/paper/scalable-nonparametric-sampling-from","slug":"scalable-nonparametric-sampling-from","title":"Scalable Nonparametric Sampling from Multimodal Posteriors with the Posterior Bootstrap","date":"2019-02-08","arxiv_id":"1902.03175","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/scalable-nonparametric-sampling-from#ran","syntology_url":"https://syntology.ai/paper/1902.03175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.03175"}},"official":{"repos":["edfong/npl"],"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/selectivenet-a-deep-neural-network-with-an","slug":"selectivenet-a-deep-neural-network-with-an","title":"SelectiveNet: A Deep Neural Network with an Integrated Reject Option","date":"2019-01-26","arxiv_id":"1901.09192","repositories_listed":5,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":3,"phrase":"6 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/selectivenet-a-deep-neural-network-with-an#ran","syntology_url":"https://syntology.ai/paper/1901.09192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09192"}},"official":{"repos":["geifmany/SelectiveNet"],"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":["listed","official"]}}},{"url":"/paper/provably-efficient-rl-with-rich-observations","slug":"provably-efficient-rl-with-rich-observations","title":"Provably efficient RL with Rich Observations via Latent State Decoding","date":"2019-01-25","arxiv_id":"1901.09018","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/provably-efficient-rl-with-rich-observations#ran","syntology_url":"https://syntology.ai/paper/1901.09018","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09018"}},"official":{"repos":["Microsoft/StateDecoding"],"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/the-autofeat-python-library-for-automatic","slug":"the-autofeat-python-library-for-automatic","title":"The autofeat Python Library for Automated Feature Engineering and Selection","date":"2019-01-22","arxiv_id":"1901.07329","repositories_listed":1,"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/the-autofeat-python-library-for-automatic#ran","syntology_url":"https://syntology.ai/paper/1901.07329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07329"}},"official":{"repos":["cod3licious/autofeat"],"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/consistent-rank-logits-for-ordinal-regression","slug":"consistent-rank-logits-for-ordinal-regression","title":"Rank consistent ordinal regression for neural networks with application to age estimation","date":"2019-01-20","arxiv_id":"1901.07884","repositories_listed":4,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/consistent-rank-logits-for-ordinal-regression#ran","syntology_url":"https://syntology.ai/paper/1901.07884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07884"}},"official":{"repos":["Raschka-research-group/coral-cnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/attentive-neural-processes","slug":"attentive-neural-processes","title":"Attentive Neural Processes","date":"2019-01-17","arxiv_id":"1901.05761","repositories_listed":8,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/attentive-neural-processes#ran","syntology_url":"https://syntology.ai/paper/1901.05761","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.05761"}},"official":{"repos":["deepmind/neural-processes"],"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/taking-a-deeper-look-at-the-inverse","slug":"taking-a-deeper-look-at-the-inverse","title":"Taking a Deeper Look at the Inverse Compositional Algorithm","date":"2018-12-17","arxiv_id":"1812.06861","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/taking-a-deeper-look-at-the-inverse#ran","syntology_url":"https://syntology.ai/paper/1812.06861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.06861"}},"official":{"repos":["lvzhaoyang/DeeperInverseCompositionalAlgorithm"],"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/gspn-generative-shape-proposal-network-for-3d","slug":"gspn-generative-shape-proposal-network-for-3d","title":"GSPN: Generative Shape Proposal Network for 3D Instance Segmentation in Point Cloud","date":"2018-12-08","arxiv_id":"1812.03320","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/gspn-generative-shape-proposal-network-for-3d#ran","syntology_url":"https://syntology.ai/paper/1812.03320","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.03320"}},"official":{"repos":["ericyi/GSPN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/ecc-energy-constrained-deep-neural-network","slug":"ecc-energy-constrained-deep-neural-network","title":"ECC: Platform-Independent Energy-Constrained Deep Neural Network Compression via a Bilinear Regression Model","date":"2018-12-05","arxiv_id":"1812.01803","repositories_listed":2,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/ecc-energy-constrained-deep-neural-network#ran","syntology_url":"https://syntology.ai/paper/1812.01803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01803"}},"official":null}},{"url":"/paper/prediction-error-meta-classification-in","slug":"prediction-error-meta-classification-in","title":"Prediction Error Meta Classification in Semantic Segmentation: Detection via Aggregated Dispersion Measures of Softmax Probabilities","date":"2018-11-01","arxiv_id":"1811.00648","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":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/prediction-error-meta-classification-in#ran","syntology_url":"https://syntology.ai/paper/1811.00648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00648"}},"official":{"repos":["mrottmann/MetaSeg"],"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"]}}}],"record_sha256":"6903f923e3c8a1b8bd66895d1d783c627b307786ed5fd3e8a87fc3b69da45c97","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}